0.00/0.00	MAYBE
0.00/0.00	
0.00/0.00	
0.00/0.00	Succeeded in reading "/export/starexec/sandbox/benchmark/theBenchmark.trs".
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR ys v xs z y x w)
0.00/0.00	    (RULES
0.00/0.00	      ssp(xs,v) -> ys | subL(ys,xs) == tt, sum(ys) == v
0.00/0.00	      subL(nil,nil) -> tt
0.00/0.00	      subL(xs,cons(y,ys)) -> z | subL(xs,ys) == z
0.00/0.00	      sum(nil) -> 0
0.00/0.00	      sum(cons(x,xs)) -> z | sum(xs) == w, add(w,x) == z
0.00/0.00	      add(x,0) -> x
0.00/0.00	      add(x,s(y)) -> s(z) | add(x,y) == z
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1016/j.tcs.2012.09.005 [72] Example 9 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 ys v xs z y x w)
0.00/0.00	    (RULES
0.00/0.00	      ssp(xs,v) -> ys | subL(ys,xs) == tt, sum(ys) == v
0.00/0.00	      subL(nil,nil) -> tt
0.00/0.00	      subL(xs,cons(y,ys)) -> z | subL(xs,ys) == z
0.00/0.00	      sum(nil) -> 0
0.00/0.00	      sum(cons(x,xs)) -> z | sum(xs) == w, add(w,x) == z
0.00/0.00	      add(x,0) -> x
0.00/0.00	      add(x,s(y)) -> s(z) | add(x,y) == z
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1016/j.tcs.2012.09.005 [72] Example 9 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 ys v xs z y x w)
0.00/0.00	    (RULES
0.00/0.00	      ssp(xs,v) -> ys | subL(ys,xs) == tt, sum(ys) == v
0.00/0.00	      subL(nil,nil) -> tt
0.00/0.00	      subL(xs,cons(y,ys)) -> z | subL(xs,ys) == z
0.00/0.00	      sum(nil) -> 0
0.00/0.00	      sum(cons(x,xs)) -> z | sum(xs) == w, add(w,x) == z
0.00/0.00	      add(x,0) -> x
0.00/0.00	      add(x,s(y)) -> s(z) | add(x,y) == z
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1016/j.tcs.2012.09.005 [72] Example 9 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 ys v xs z y x w)
0.00/0.00	    (RULES
0.00/0.00	      ssp(xs,v) -> ys | subL(ys,xs) == tt, sum(ys) == v
0.00/0.00	      subL(nil,nil) -> tt
0.00/0.00	      subL(xs,cons(y,ys)) -> z | subL(xs,ys) == z
0.00/0.00	      sum(nil) -> 0
0.00/0.00	      sum(cons(x,xs)) -> z | sum(xs) == w, add(w,x) == z
0.00/0.00	      add(x,0) -> x
0.00/0.00	      add(x,s(y)) -> s(z) | add(x,y) == z
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1016/j.tcs.2012.09.005 [72] Example 9 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	EOF