0.00/0.03	MAYBE
0.00/0.03	(ignored inputs)COMMENT doi:10.2168/LMCS-8 ( 3:4 ) 2012 [64] Example 6.7 ( R_20 ) submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.03	Conditional Rewrite Rules:
0.00/0.03	   [ isnoc(cons(?y,nil)) -> tp2(nil,?y),
0.00/0.03	     isnoc(cons(?x,?ys)) -> tp2(cons(?x,?xs),?y) | isnoc(?ys) == tp2(?xs,?y) ]
0.00/0.03	Check whether all rules are type 3
0.00/0.03	OK
0.00/0.03	Check whether the input is deterministic
0.00/0.03	OK
0.00/0.03	Result of unraveling:
0.00/0.03	   [ isnoc(cons(?y,nil)) -> tp2(nil,?y),
0.00/0.03	     isnoc(cons(?x,?ys)) -> U0(isnoc(?ys),?x,?ys),
0.00/0.03	     U0(tp2(?xs,?y),?x,?ys) -> tp2(cons(?x,?xs),?y) ]
0.00/0.03	Check whether U(R) is terminating
0.00/0.03	OK
0.00/0.03	Check whether the input is weakly left-linear
0.00/0.03	OK
0.00/0.03	Check whether U(R) is confluent
0.00/0.03	U(R) is not confluent
0.00/0.03	Conditional critical pairs (CCPs):
0.00/0.03	   [ tp2(cons(?x_1,?xs_1),?y_1) = tp2(nil,?x_1) | isnoc(nil) == tp2(?xs_1,?y_1),
0.00/0.03	     tp2(nil,?y) = tp2(cons(?y,?xs_1),?y_1) | isnoc(nil) == tp2(?xs_1,?y_1) ]
0.00/0.03	Check whether the input is almost orthogonale
0.00/0.03	not almost orthogonal
0.00/0.03	OK
0.00/0.03	Check whether the input is absolutely irreducible
0.00/0.03	OK
0.00/0.03	Check whether all CCPs are joinable
0.00/0.03	Some ccp may be feasible but not joinable
0.00/0.03	   [ tp2(cons(?x_1,?xs_1),?y_1) = tp2(nil,?x_1) | isnoc(nil) == tp2(?xs_1,?y_1),
0.00/0.03	     tp2(nil,?y) = tp2(cons(?y,?xs_1),?y_1) | isnoc(nil) == tp2(?xs_1,?y_1) ]
0.00/0.03	/export/starexec/sandbox/benchmark/theBenchmark.trs: Failure(unknown CR)
0.00/0.03	(4 msec.)
0.00/0.03	EOF