0.00/0.02	NO
0.00/0.02	(ignored inputs)COMMENT doi:10.1016/j.jlap.2009.08.001 [73] Example 8 submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ g(?x) -> k(?y) | h(?x) == d,h(?x) == c(?y),
0.00/0.02	     h(d) -> c(a),
0.00/0.02	     h(d) -> c(b),
0.00/0.02	     f(k(a),k(b),?x) -> f(?x,?x,?x) ]
0.00/0.02	Check whether all rules are type 3
0.00/0.02	OK
0.00/0.02	Check whether the input is deterministic
0.00/0.02	OK
0.00/0.02	Result of unraveling:
0.00/0.02	   [ g(?x) -> U0(h(?x),?x),
0.00/0.02	     U0(d,?x) -> U1(h(?x),?x),
0.00/0.02	     U1(c(?y),?x) -> k(?y),
0.00/0.02	     h(d) -> c(a),
0.00/0.02	     h(d) -> c(b),
0.00/0.02	     f(k(a),k(b),?x) -> f(?x,?x,?x) ]
0.00/0.02	Check whether U(R) is terminating
0.00/0.02	OK
0.00/0.02	Check whether the input is weakly left-linear
0.00/0.02	OK
0.00/0.02	Check whether U(R) is confluent
0.00/0.02	U(R) is not confluent
0.00/0.02	Conditional critical pairs (CCPs):
0.00/0.02	   [ c(b) = c(a),
0.00/0.02	     c(a) = c(b) ]
0.00/0.02	Check whether the input is almost orthogonale
0.00/0.02	not almost orthogonal
0.00/0.02	OK
0.00/0.02	Check whether the input is absolutely irreducible
0.00/0.02	OK
0.00/0.02	Check whether all CCPs are joinable
0.00/0.02	Some ccp may be feasible but not joinable
0.00/0.02	   [ c(b) = c(a),
0.00/0.02	     c(a) = c(b) ]
0.00/0.02	A feasible but not joinable CCP: c(b) = c(a)
0.00/0.02	/export/starexec/sandbox/benchmark/theBenchmark.trs: Success(not CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF