/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: a__zeros() -> cons(0(),zeros()) 2: a__and(tt(),X) -> mark(X) 3: a__length(nil()) -> 0() 4: a__length(cons(N,L)) -> s(a__length(mark(L))) 5: mark(zeros()) -> a__zeros() 6: mark(and(X1,X2)) -> a__and(mark(X1),X2) 7: mark(length(X)) -> a__length(mark(X)) 8: mark(cons(X1,X2)) -> cons(mark(X1),X2) 9: mark(0()) -> 0() 10: mark(tt()) -> tt() 11: mark(nil()) -> nil() 12: mark(s(X)) -> s(mark(X)) 13: a__zeros() -> zeros() 14: a__and(X1,X2) -> and(X1,X2) 15: a__length(X) -> length(X) Number of strict rules: 15 Direct POLO(bPol) ... removes: 15 8 3 10 7 14 11 9 13 6 2 s w: x1 and w: 2 * x1 + 2 * x2 + 3 zeros w: 1 0 w: 0 nil w: 1 mark w: 2 * x1 + 1 cons w: x1 + 2 * x2 + 1 tt w: 1 a__and w: 2 * x1 + 2 * x2 + 4 length w: x1 + 2 a__zeros w: 3 a__length w: x1 + 3 Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #mark(s(X)) -> #mark(X) #2: #mark(zeros()) -> #a__zeros() #3: #a__length(cons(N,L)) -> #a__length(mark(L)) #4: #a__length(cons(N,L)) -> #mark(L) Number of SCCs: 2, DPs: 2 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 and w: 0 zeros w: 0 #mark w: x1 0 w: 0 #a__zeros w: 0 nil w: 0 mark w: 0 #a__length w: 0 cons w: 0 tt w: 0 a__and w: 0 length w: 0 a__zeros w: 0 a__length w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 1 SCC { #3 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #a__length(cons(N,zeros())) -#3-> #a__length(mark(zeros())) --->* #a__length(cons(0(),zeros())) Looping with: [ N := 0(); ]