0.00/0.02	MAYBE
0.00/0.02	(ignored inputs)COMMENT doi:10.1007/3-540-58216-9_40 [45] Example 4.1.b submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.02	Conditional Rewrite Rules:
0.00/0.02	   [ a -> c,
0.00/0.02	     g(a) -> h(b),
0.00/0.02	     h(b) -> g(c),
0.00/0.02	     f(?x) -> ?z | g(?x) == h(?z) ]
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	     g(a) -> h(b),
0.00/0.02	     h(b) -> g(c),
0.00/0.02	     f(?x) -> U0(g(?x),?x),
0.00/0.02	     U0(h(?z),?x) -> ?z ]
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	   [ g(c) = h(b) ]
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	not absolutely irreducible
0.00/0.02	/export/starexec/sandbox2/benchmark/theBenchmark.trs: Failure(unknown CR)
0.00/0.02	(0 msec.)
0.00/0.02	EOF