/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: rev1(0(),nil()) -> 0() 2: rev1(s(X),nil()) -> s(X) 3: rev1(X,cons(Y,L)) -> rev1(Y,L) 4: rev(nil()) -> nil() 5: rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) 6: rev2(X,nil()) -> nil() 7: rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying rev 1: rev1(0(),nil()) -> 0() 2: rev1(s(X),nil()) -> s(X) 3: rev1(X,cons(Y,L)) -> rev1(Y,L) 4: rev^1_nil() -> nil() 5: rev^1_cons(X,L) -> cons(rev1(X,L),rev2(X,L)) 6: rev2(X,nil()) -> nil() 7: rev2(X,cons(Y,L)) -> rev^1_cons(X,rev(rev2(Y,L))) 8: rev(cons(_1,_2)) ->= rev^1_cons(_1,_2) 9: rev(nil()) ->= rev^1_nil() Number of strict rules: 7 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #rev(nil()) ->? #rev^1_nil() #2: #rev2(X,cons(Y,L)) -> #rev^1_cons(X,rev(rev2(Y,L))) #3: #rev2(X,cons(Y,L)) -> #rev(rev2(Y,L)) #4: #rev2(X,cons(Y,L)) -> #rev2(Y,L) #5: #rev^1_cons(X,L) -> #rev1(X,L) #6: #rev^1_cons(X,L) -> #rev2(X,L) #7: #rev1(X,cons(Y,L)) -> #rev1(Y,L) #8: #rev(cons(_1,_2)) ->? #rev^1_cons(_1,_2) Number of SCCs: 2, DPs: 6 SCC { #7 } POLO(Sum)... succeeded. #rev w: 0 s w: 0 rev1 w: 0 #rev1 w: x2 #rev2 w: 0 0 w: 0 #rev^1_nil w: 0 nil w: 0 rev w: 0 cons w: x1 + x2 + 1 #rev^1_cons w: 0 rev^1_cons w: 0 rev2 w: 0 rev^1_nil w: 0 USABLE RULES: { } Removed DPs: #7 Number of SCCs: 1, DPs: 5 SCC { #2..4 #6 #8 } POLO(Sum)... succeeded. #rev w: x1 + 1 s w: 1 rev1 w: x1 + x2 + 1 #rev1 w: 0 #rev2 w: x2 0 w: 1 #rev^1_nil w: 0 nil w: 1 rev w: x1 cons w: x2 + 2 #rev^1_cons w: x2 + 2 rev^1_cons w: x2 + 2 rev2 w: x2 rev^1_nil w: 1 USABLE RULES: { 4..9 } Removed DPs: #3 #4 #6 #8 Number of SCCs: 0, DPs: 0