0.00/0.02	MAYBE
0.00/0.02	(ignored inputs)COMMENT doi:10.1007/3-540-60381-6_19 [71] Example 2 submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ f(?x',?x'') -> g(?x) | ?x' == ?x,?x'' == ?x,
0.00/0.02	     f(?y',h(?y'')) -> g(?y) | ?y' == ?y,?y'' == ?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	   [ f(?x',?x'') -> U0(?x',?x',?x''),
0.00/0.02	     U0(?x,?x',?x'') -> U1(?x'',?x',?x'',?x),
0.00/0.02	     U1(?x,?x',?x'',?x) -> g(?x),
0.00/0.02	     f(?y',h(?y'')) -> U2(?y',?y',?y''),
0.00/0.02	     U2(?y,?y',?y'') -> U3(?y'',?y',?y'',?y),
0.00/0.02	     U3(?y,?y',?y'',?y) -> g(?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	   [ g(?y_1) = g(?x) | ?y'_1 == ?y_1,?y''_1 == ?y_1,?y'_1 == ?x,h(?y''_1) == ?x,
0.00/0.02	     g(?x) = g(?y_1) | ?x' == ?x,h(?y''_1) == ?x,?x' == ?y_1,?y''_1 == ?y_1 ]
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(?y_1) = g(?x) | ?y'_1 == ?y_1,?y''_1 == ?y_1,?y'_1 == ?x,h(?y''_1) == ?x,
0.00/0.02	     g(?x) = g(?y_1) | ?x' == ?x,h(?y''_1) == ?x,?x' == ?y_1,?y''_1 == ?y_1 ]
0.00/0.02	/export/starexec/sandbox/benchmark/theBenchmark.trs: Failure(unknown CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF