0.00/0.02 NO 0.00/0.02 (ignored inputs)COMMENT doi:10.1016/j.jlap.2009.08.001 [73] Example 4 submitted by: Thomas Sternagel and Aart Middeldorp 0.00/0.02 Conditional Rewrite Rules: 0.00/0.02 [ f(?x) -> a | ?x == b, 0.00/0.02 a -> b, 0.00/0.02 a -> c ] 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) -> U0(?x,?x), 0.00/0.02 U0(b,?x) -> a, 0.00/0.02 a -> b, 0.00/0.02 a -> c ] 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 [ c = b, 0.00/0.02 b = c ] 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 Some ccp may be feasible but not joinable 0.00/0.02 [ c = b, 0.00/0.02 b = c ] 0.00/0.02 A feasible but not joinable CCP: c = b 0.00/0.02 /export/starexec/sandbox/benchmark/theBenchmark.trs: Success(not CR) 0.00/0.02 (0 msec.) 0.00/0.02 EOF