0.00/0.02	YES
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ f(?x,?y) -> g(?x) | c(g(?x)) == c(a),
0.00/0.02	     f(?x,?y) -> h(?x) | c(h(?x)) == c(a),
0.00/0.02	     g(s(?x)) -> ?x,
0.00/0.02	     h(s(?x)) -> ?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,?y) -> U1(c(g(?x)),?x,?y),
0.00/0.02	     U1(c(a),?x,?y) -> g(?x),
0.00/0.02	     f(?x,?y) -> U1(c(h(?x)),?x,?y),
0.00/0.02	     U1(c(a),?x,?y) -> h(?x),
0.00/0.02	     g(s(?x)) -> ?x,
0.00/0.02	     h(s(?x)) -> ?x ]
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	   [ h(?x_1) = g(?x_1) | c(h(?x_1)) == c(a),c(g(?x_1)) == c(a),
0.00/0.02	     g(?x) = h(?x) | c(g(?x)) == c(a),c(h(?x)) == c(a) ]
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