0.03/0.03	NO
0.03/0.03	Conditional Rewrite Rules:
0.03/0.03	   [ f(?x) -> b,
0.03/0.03	     g(?x) -> f(?x),
0.03/0.03	     g(?x) -> a | f(?x) == b ]
0.03/0.03	Check whether all rules are type 3
0.03/0.03	OK
0.03/0.03	Check whether the input is deterministic
0.03/0.03	OK
0.03/0.03	Result of unraveling:
0.03/0.03	   [ f(?x) -> b,
0.03/0.03	     g(?x) -> f(?x),
0.03/0.03	     g(?x) -> U0(f(?x),?x),
0.03/0.03	     U0(b,?x) -> a ]
0.03/0.03	Check whether U(R) is terminating
0.03/0.03	OK
0.03/0.03	Check whether the input is weakly left-linear
0.03/0.03	OK
0.03/0.03	Check whether U(R) is confluent
0.03/0.03	U(R) is not confluent
0.03/0.03	Conditional critical pairs (CCPs):
0.03/0.03	   [ a = f(?x_2) | f(?x_2) == b,
0.03/0.03	     f(?x_1) = a | f(?x_1) == b ]
0.03/0.03	Check whether the input is almost orthogonale
0.03/0.03	not almost orthogonal
0.03/0.03	OK
0.03/0.03	Check whether the input is absolutely irreducible
0.03/0.03	OK
0.03/0.03	Check whether all CCPs are joinable
0.03/0.03	Some ccp may be feasible but not joinable
0.03/0.03	   [ a = f(?x_2) | f(?x_2) == b,
0.03/0.03	     f(?x_1) = a | f(?x_1) == b ]
0.03/0.03	A feasible but not joinable CCP: a = f(?x_2) | f(?x_2) == b