0.00/0.02	MAYBE
0.00/0.02	(ignored inputs)COMMENT doi:10.2168/LMCS-8 ( 3:4 ) 2012 [64] Example 3.5 ( R_5 ) submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ f(?x) -> ?x | ?x == a,b == ?x,
0.00/0.02	     a -> 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(?x,?x),
0.00/0.02	     U0(a,?x) -> U1(b,?x),
0.00/0.02	     U1(?x,?x) -> ?x,
0.00/0.02	     a -> 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	   [  ]
0.00/0.02	Check whether the input is almost orthogonale
0.00/0.02	OK
0.00/0.02	Check whether the input is properly oriented
0.00/0.02	OK
0.00/0.02	Check whether the input is right-stable
0.00/0.02	not right-stable
0.00/0.02	not weakly left-linear
0.00/0.02	Check whether the input is absolutely irreducible
0.00/0.02	not absolutely irreducible
0.00/0.02	/export/starexec/sandbox/benchmark/theBenchmark.trs: Failure(unknown CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF