0.00/0.00 MAYBE 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 xs ys x) 0.00/0.00 (RULES 0.00/0.00 isnoc(cons(y,nil)) -> tp2(nil,y) 0.00/0.00 isnoc(cons(x,ys)) -> tp2(cons(x,xs),y) | isnoc(ys) == tp2(xs,y) 0.00/0.00 ) 0.00/0.00 (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.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 xs ys x) 0.00/0.00 (RULES 0.00/0.00 isnoc(cons(y,nil)) -> tp2(nil,y) 0.00/0.00 isnoc(cons(x,ys)) -> tp2(cons(x,xs),y) | isnoc(ys) == tp2(xs,y) 0.00/0.00 ) 0.00/0.00 (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.00 0.00/0.00 Removed infeasible rules as much as possible. 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR y xs ys x) 0.00/0.00 (RULES 0.00/0.00 isnoc(cons(y,nil)) -> tp2(nil,y) 0.00/0.00 isnoc(cons(x,ys)) -> tp2(cons(x,xs),y) | isnoc(ys) == tp2(xs,y) 0.00/0.00 ) 0.00/0.00 (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.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 xs ys x) 0.00/0.00 (RULES 0.00/0.00 isnoc(cons(y,nil)) -> tp2(nil,y) 0.00/0.00 isnoc(cons(x,ys)) -> tp2(cons(x,xs),y) | isnoc(ys) == tp2(xs,y) 0.00/0.00 ) 0.00/0.00 (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.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 x2 x4 x3) 0.00/0.00 (RULES 0.00/0.00 isnoc(cons(x1,nil)) -> tp2(nil,x1) 0.00/0.00 isnoc(cons(x1,x2)) -> u1(isnoc(x2),x1,x2) 0.00/0.00 u1(tp2(x3,x4),x1,x2) -> tp2(cons(x1,x3),x4) 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 Failed to prove confluence of U(R). 0.00/0.00 0.00/0.00 Try to prove operational termination of R, i.e., termination of U(R). 0.00/0.00 0.00/0.00 Succeeded in proving operational termination of R. 0.00/0.00 0.00/0.00 Try to prove joinability of all (conditional) CPs. 0.00/0.00 0.00/0.00 Failed to prove joinability of conditional CPs (via narrowing trees). 0.00/0.00 0.00/0.00 MAYBE 0.00/0.00 EOF