0.00/0.00 YES 0.00/0.00 0.00/0.00 0.00/0.00 Succeeded in reading "/export/starexec/sandbox2/benchmark/theBenchmark.trs". 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR y x) 0.00/0.00 (RULES 0.00/0.00 f(c(x),c(c(y))) -> a(a(x)) | c(f(x,y)) == c(a(b)) 0.00/0.00 f(c(c(c(x))),y) -> a(y) | c(f(c(x),c(c(y)))) == c(a(a(b))) 0.00/0.00 h(b) -> b 0.00/0.00 h(a(a(x))) -> a(b) | h(x) == b 0.00/0.00 ) 0.00/0.00 (COMMENT Example 1 in extended version of [92]) 0.00/0.00 0.00/0.00 No "->="-rules. 0.00/0.00 0.00/0.00 Decomposed conditions if possible. 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR y x) 0.00/0.00 (RULES 0.00/0.00 f(c(x),c(c(y))) -> a(a(x)) | f(x,y) == a(b) 0.00/0.00 f(c(c(c(x))),y) -> a(y) | f(c(x),c(c(y))) == a(a(b)) 0.00/0.00 h(b) -> b 0.00/0.00 h(a(a(x))) -> a(b) | h(x) == b 0.00/0.00 ) 0.00/0.00 (COMMENT Example 1 in extended version of [92]) 0.00/0.00 0.00/0.00 Removed infeasible rules as much as possible. 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR y x) 0.00/0.00 (RULES 0.00/0.00 h(b) -> b 0.00/0.00 h(a(a(x))) -> a(b) | h(x) == b 0.00/0.00 ) 0.00/0.00 (COMMENT Example 1 in extended version of [92]) 0.00/0.00 0.00/0.00 Try to disprove confluence of the following (C)TRS: 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR y x) 0.00/0.00 (RULES 0.00/0.00 h(b) -> b 0.00/0.00 h(a(a(x))) -> a(b) | h(x) == b 0.00/0.00 ) 0.00/0.00 (COMMENT Example 1 in extended version of [92]) 0.00/0.00 0.00/0.00 Failed either to apply SR and U for normal 1CTRSs to the above CTRS or to prove confluence of any converted TRSs. 0.00/0.00 0.00/0.00 Try to apply SR and U for 3DCTRSs to the above CTRS. 0.00/0.00 0.00/0.00 Succeeded in applying U for 3DCTRSs to the above CTRS. 0.00/0.00 U(R) = 0.00/0.00 (VAR x1) 0.00/0.00 (RULES 0.00/0.00 h(b) -> b 0.00/0.00 h(a(a(x1))) -> u1(h(x1),x1) 0.00/0.00 u1(b,x1) -> a(b) 0.00/0.00 ) 0.00/0.00 0.00/0.00 U for 3DCTRSs is sound for the above CTRS. 0.00/0.00 0.00/0.00 U(R) is confluent. 0.00/0.00 0.00/0.00 YES 0.00/0.00 EOF