0.00/0.02	NO
0.00/0.02	(ignored inputs)COMMENT doi:10.2168/LMCS-8 ( 3:4 ) 2012 [64] Example 4.8 ( R_8 ) submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ f(?x) -> c(?x,?y) | g(?x) == ?y,?y == h(?x),
0.00/0.02	     a -> b,
0.00/0.02	     g(a) -> h(b) ]
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	   [ f(?x) -> U0(g(?x),?x),
0.00/0.02	     U0(?y,?x) -> U1(?y,?x,?y),
0.00/0.02	     U1(h(?x),?x,?y) -> c(?x,?y),
0.00/0.02	     a -> b,
0.00/0.02	     g(a) -> h(b) ]
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	not weakly left-linear
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	   [ g(b) = h(b) ]
0.00/0.02	Check whether the input is almost orthogonale
0.00/0.02	not almost orthogonal
0.00/0.02	not weakly left-linear
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	   [ g(b) = h(b) ]
0.00/0.02	A feasible but not joinable CCP: g(b) = h(b)
0.00/0.02	/export/starexec/sandbox/benchmark/theBenchmark.trs: Success(not CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF