0.00/0.02 NO 0.00/0.02 (ignored inputs)COMMENT doi:10.2168/LMCS-8 ( 3:4 ) 2012 [64] Example 3.3 ( R_3 ) submitted by: Thomas Sternagel and Aart Middeldorp 0.00/0.02 Conditional Rewrite Rules: 0.00/0.02 [ f(?x) -> ?x | ?x == e, 0.00/0.02 g(d,?x,?x) -> A, 0.00/0.02 h(?x,?x) -> g(?x,?x,f(k)), 0.00/0.02 a -> c, 0.00/0.02 a -> d, 0.00/0.02 b -> c, 0.00/0.02 b -> d, 0.00/0.02 c -> e, 0.00/0.02 c -> l, 0.00/0.02 k -> l, 0.00/0.02 k -> m, 0.00/0.02 d -> m ] 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(e,?x) -> ?x, 0.00/0.02 g(d,?x,?x) -> A, 0.00/0.02 h(?x,?x) -> g(?x,?x,f(k)), 0.00/0.02 a -> c, 0.00/0.02 a -> d, 0.00/0.02 b -> c, 0.00/0.02 b -> d, 0.00/0.02 c -> e, 0.00/0.02 c -> l, 0.00/0.02 k -> l, 0.00/0.02 k -> m, 0.00/0.02 d -> m ] 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 not weakly left-linear 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(m,?x_1,?x_1) = A, 0.00/0.02 d = c, 0.00/0.02 c = d, 0.00/0.02 d = c, 0.00/0.02 c = d, 0.00/0.02 l = e, 0.00/0.02 e = l, 0.00/0.02 m = l, 0.00/0.02 l = m ] 0.00/0.02 Check whether the input is almost orthogonale 0.00/0.03 not almost orthogonal 0.00/0.03 not weakly left-linear 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 [ g(m,?x_1,?x_1) = A, 0.00/0.03 d = c, 0.00/0.03 c = d, 0.00/0.03 d = c, 0.00/0.03 c = d, 0.00/0.03 l = e, 0.00/0.03 e = l, 0.00/0.03 m = l, 0.00/0.03 l = m ] 0.00/0.03 A feasible but not joinable CCP: g(m,?x_1,?x_1) = A 0.00/0.03 /export/starexec/sandbox/benchmark/theBenchmark.trs: Success(not CR) 0.00/0.03 (1 msec.) 0.00/0.03 EOF