0.00/0.02	YES
0.00/0.02	(ignored inputs)COMMENT [101] Example 3.3 submitted by: Thomas Sternagel
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ f(?x) -> a | a == ?x,
0.00/0.02	     f(?x) -> b | b == ?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	   [ f(?x) -> U1(a,?x),
0.00/0.02	     U1(?x,?x) -> a,
0.00/0.02	     f(?x) -> U1(b,?x),
0.00/0.02	     U1(?x,?x) -> 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	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	   [ b = a | b == ?x_1,a == ?x_1,
0.00/0.02	     a = b | a == ?x,b == ?x ]
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	OK
0.00/0.02	/export/starexec/sandbox/benchmark/theBenchmark.trs: Success(CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF