0.00/0.02	NO
0.00/0.02	(ignored inputs)COMMENT [75] Example 28 submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ a -> c,
0.00/0.02	     a -> d,
0.00/0.02	     b -> c,
0.00/0.02	     b -> d,
0.00/0.02	     s(k) -> t(a),
0.00/0.02	     s(l) -> t(a),
0.00/0.02	     g(?x,?x) -> h(?x,?x),
0.00/0.02	     f(?x,?y) -> ?y | s(?x) == t(?y) ]
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	   [ a -> c,
0.00/0.02	     a -> d,
0.00/0.02	     b -> c,
0.00/0.02	     b -> d,
0.00/0.02	     s(k) -> t(a),
0.00/0.02	     s(l) -> t(a),
0.00/0.02	     g(?x,?x) -> h(?x,?x),
0.00/0.02	     f(?x,?y) -> U0(s(?x),?x,?y),
0.00/0.02	     U0(t(?y),?x,?y) -> ?y ]
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	   [ d = c,
0.00/0.02	     c = d,
0.00/0.02	     d = c,
0.00/0.02	     c = d ]
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	   [ d = c,
0.00/0.02	     c = d,
0.00/0.02	     d = c,
0.00/0.02	     c = d ]
0.00/0.02	A feasible but not joinable CCP: d = c
0.00/0.02	/export/starexec/sandbox2/benchmark/theBenchmark.trs: Success(not CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF