/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(and(tt(),X)) -> mark(X) 2: active(plus(N,0())) -> mark(N) 3: active(plus(N,s(M))) -> mark(s(plus(N,M))) 4: active(x(N,0())) -> mark(0()) 5: active(x(N,s(M))) -> mark(plus(x(N,M),N)) 6: mark(and(X1,X2)) -> active(and(mark(X1),X2)) 7: mark(tt()) -> active(tt()) 8: mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) 9: mark(0()) -> active(0()) 10: mark(s(X)) -> active(s(mark(X))) 11: mark(x(X1,X2)) -> active(x(mark(X1),mark(X2))) 12: and(mark(X1),X2) -> and(X1,X2) 13: and(X1,mark(X2)) -> and(X1,X2) 14: and(active(X1),X2) -> and(X1,X2) 15: and(X1,active(X2)) -> and(X1,X2) 16: plus(mark(X1),X2) -> plus(X1,X2) 17: plus(X1,mark(X2)) -> plus(X1,X2) 18: plus(active(X1),X2) -> plus(X1,X2) 19: plus(X1,active(X2)) -> plus(X1,X2) 20: s(mark(X)) -> s(X) 21: s(active(X)) -> s(X) 22: x(mark(X1),X2) -> x(X1,X2) 23: x(X1,mark(X2)) -> x(X1,X2) 24: x(active(X1),X2) -> x(X1,X2) 25: x(X1,active(X2)) -> x(X1,X2) Number of strict rules: 25 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(plus(N,0())) -> #mark(N) #2: #mark(and(X1,X2)) -> #active(and(mark(X1),X2)) #3: #mark(and(X1,X2)) -> #and(mark(X1),X2) #4: #mark(and(X1,X2)) -> #mark(X1) #5: #and(X1,mark(X2)) -> #and(X1,X2) #6: #mark(0()) -> #active(0()) #7: #mark(x(X1,X2)) -> #active(x(mark(X1),mark(X2))) #8: #mark(x(X1,X2)) -> #x(mark(X1),mark(X2)) #9: #mark(x(X1,X2)) -> #mark(X1) #10: #mark(x(X1,X2)) -> #mark(X2) #11: #x(active(X1),X2) -> #x(X1,X2) #12: #x(X1,mark(X2)) -> #x(X1,X2) #13: #and(mark(X1),X2) -> #and(X1,X2) #14: #and(active(X1),X2) -> #and(X1,X2) #15: #x(X1,active(X2)) -> #x(X1,X2) #16: #s(mark(X)) -> #s(X) #17: #mark(tt()) -> #active(tt()) #18: #mark(s(X)) -> #active(s(mark(X))) #19: #mark(s(X)) -> #s(mark(X)) #20: #mark(s(X)) -> #mark(X) #21: #active(x(N,s(M))) -> #mark(plus(x(N,M),N)) #22: #active(x(N,s(M))) -> #plus(x(N,M),N) #23: #active(x(N,s(M))) -> #x(N,M) #24: #x(mark(X1),X2) -> #x(X1,X2) #25: #plus(X1,mark(X2)) -> #plus(X1,X2) #26: #plus(X1,active(X2)) -> #plus(X1,X2) #27: #s(active(X)) -> #s(X) #28: #plus(mark(X1),X2) -> #plus(X1,X2) #29: #active(plus(N,s(M))) -> #mark(s(plus(N,M))) #30: #active(plus(N,s(M))) -> #s(plus(N,M)) #31: #active(plus(N,s(M))) -> #plus(N,M) #32: #active(and(tt(),X)) -> #mark(X) #33: #mark(plus(X1,X2)) -> #active(plus(mark(X1),mark(X2))) #34: #mark(plus(X1,X2)) -> #plus(mark(X1),mark(X2)) #35: #mark(plus(X1,X2)) -> #mark(X1) #36: #mark(plus(X1,X2)) -> #mark(X2) #37: #and(X1,active(X2)) -> #and(X1,X2) #38: #active(x(N,0())) -> #mark(0()) #39: #plus(active(X1),X2) -> #plus(X1,X2) Number of SCCs: 5, DPs: 27 SCC { #16 #27 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (0) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (0) #s(x1) w: (x1) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #16 #27 Number of SCCs: 4, DPs: 25 SCC { #5 #13 #14 #37 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (0) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (0) #s(x1) w: (0) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (x1) USABLE RULES: { } Removed DPs: #13 #14 Number of SCCs: 4, DPs: 23 SCC { #5 #37 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (0) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (0) #s(x1) w: (0) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (x2) USABLE RULES: { } Removed DPs: #5 #37 Number of SCCs: 3, DPs: 21 SCC { #11 #12 #15 #24 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (0) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (x2) #s(x1) w: (0) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #12 #15 Number of SCCs: 3, DPs: 19 SCC { #11 #24 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (0) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (x1) #s(x1) w: (0) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #11 #24 Number of SCCs: 2, DPs: 17 SCC { #25 #26 #28 #39 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (x2) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (0) #s(x1) w: (0) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #25 #26 Number of SCCs: 2, DPs: 15 SCC { #28 #39 } Sum... succeeded. s(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (x1) x(x1,x2) w: (0) #mark(x1) w: (0) 0() w: (0) #x(x1,x2) w: (0) #s(x1) w: (0) mark(x1) w: (1 + x1) plus(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) tt() w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #28 #39 Number of SCCs: 1, DPs: 13 SCC { #1 #2 #4 #7 #9 #10 #20 #21 #29 #32 #33 #35 #36 } Sum... Max... succeeded. s(x1) w: (x1) and(x1,x2) w: (max{1 + x2, 283 + x1}) #plus(x1,x2) w: (0) x(x1,x2) w: (max{20540 + x2, 20539 + x1}) #mark(x1) w: (29242 + x1) 0() w: (20540) #x(x1,x2) w: (0) #s(x1) w: (0) mark(x1) w: (x1) plus(x1,x2) w: (max{1 + x2, x1}) active(x1) w: (x1) #active(x1) w: (29242 + x1) tt() w: (0) #and(x1,x2) w: (0) USABLE RULES: { 1..25 } Removed DPs: #4 #9 #10 #32 #36 Number of SCCs: 1, DPs: 7 SCC { #1 #7 #20 #21 #29 #33 #35 } Sum... Max... QLPOpS... succeeded. s(x1) 1[x1] and(x1,x2) x2 #plus(x1,x2) 0[x1] x(x1,x2) 4[x1,x2] #mark(x1) 2[x1] 0() 1 #x(x1,x2) 0[] #s(x1) 0[] mark(x1) x1 plus(x1,x2) 3[x2,x1] active(x1) x1 #active(x1) 0[x1] tt() 5 #and(x1,x2) 0[x2] USABLE RULES: { 1..25 } Removed DPs: #1 #7 #20 #21 #29 #33 #35 Number of SCCs: 0, DPs: 0