/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(U11(tt(),M,N)) -> mark(U12(tt(),M,N)) 2: active(U12(tt(),M,N)) -> mark(s(plus(N,M))) 3: active(U21(tt(),M,N)) -> mark(U22(tt(),M,N)) 4: active(U22(tt(),M,N)) -> mark(plus(x(N,M),N)) 5: active(plus(N,0())) -> mark(N) 6: active(plus(N,s(M))) -> mark(U11(tt(),M,N)) 7: active(x(N,0())) -> mark(0()) 8: active(x(N,s(M))) -> mark(U21(tt(),M,N)) 9: active(U11(X1,X2,X3)) -> U11(active(X1),X2,X3) 10: active(U12(X1,X2,X3)) -> U12(active(X1),X2,X3) 11: active(s(X)) -> s(active(X)) 12: active(plus(X1,X2)) -> plus(active(X1),X2) 13: active(plus(X1,X2)) -> plus(X1,active(X2)) 14: active(U21(X1,X2,X3)) -> U21(active(X1),X2,X3) 15: active(U22(X1,X2,X3)) -> U22(active(X1),X2,X3) 16: active(x(X1,X2)) -> x(active(X1),X2) 17: active(x(X1,X2)) -> x(X1,active(X2)) 18: U11(mark(X1),X2,X3) -> mark(U11(X1,X2,X3)) 19: U12(mark(X1),X2,X3) -> mark(U12(X1,X2,X3)) 20: s(mark(X)) -> mark(s(X)) 21: plus(mark(X1),X2) -> mark(plus(X1,X2)) 22: plus(X1,mark(X2)) -> mark(plus(X1,X2)) 23: U21(mark(X1),X2,X3) -> mark(U21(X1,X2,X3)) 24: U22(mark(X1),X2,X3) -> mark(U22(X1,X2,X3)) 25: x(mark(X1),X2) -> mark(x(X1,X2)) 26: x(X1,mark(X2)) -> mark(x(X1,X2)) 27: proper(U11(X1,X2,X3)) -> U11(proper(X1),proper(X2),proper(X3)) 28: proper(tt()) -> ok(tt()) 29: proper(U12(X1,X2,X3)) -> U12(proper(X1),proper(X2),proper(X3)) 30: proper(s(X)) -> s(proper(X)) 31: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) 32: proper(U21(X1,X2,X3)) -> U21(proper(X1),proper(X2),proper(X3)) 33: proper(U22(X1,X2,X3)) -> U22(proper(X1),proper(X2),proper(X3)) 34: proper(x(X1,X2)) -> x(proper(X1),proper(X2)) 35: proper(0()) -> ok(0()) 36: U11(ok(X1),ok(X2),ok(X3)) -> ok(U11(X1,X2,X3)) 37: U12(ok(X1),ok(X2),ok(X3)) -> ok(U12(X1,X2,X3)) 38: s(ok(X)) -> ok(s(X)) 39: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) 40: U21(ok(X1),ok(X2),ok(X3)) -> ok(U21(X1,X2,X3)) 41: U22(ok(X1),ok(X2),ok(X3)) -> ok(U22(X1,X2,X3)) 42: x(ok(X1),ok(X2)) -> ok(x(X1,X2)) 43: top(mark(X)) -> top(proper(X)) 44: top(ok(X)) -> top(active(X)) Number of strict rules: 44 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(U12(tt(),M,N)) -> #s(plus(N,M)) #2: #active(U12(tt(),M,N)) -> #plus(N,M) #3: #top(mark(X)) -> #top(proper(X)) #4: #top(mark(X)) -> #proper(X) #5: #proper(U12(X1,X2,X3)) -> #U12(proper(X1),proper(X2),proper(X3)) #6: #proper(U12(X1,X2,X3)) -> #proper(X1) #7: #proper(U12(X1,X2,X3)) -> #proper(X2) #8: #proper(U12(X1,X2,X3)) -> #proper(X3) #9: #x(ok(X1),ok(X2)) -> #x(X1,X2) #10: #U22(ok(X1),ok(X2),ok(X3)) -> #U22(X1,X2,X3) #11: #U12(ok(X1),ok(X2),ok(X3)) -> #U12(X1,X2,X3) #12: #s(ok(X)) -> #s(X) #13: #active(plus(N,s(M))) -> #U11(tt(),M,N) #14: #U21(ok(X1),ok(X2),ok(X3)) -> #U21(X1,X2,X3) #15: #active(plus(X1,X2)) -> #plus(X1,active(X2)) #16: #active(plus(X1,X2)) -> #active(X2) #17: #active(U11(X1,X2,X3)) -> #U11(active(X1),X2,X3) #18: #active(U11(X1,X2,X3)) -> #active(X1) #19: #active(s(X)) -> #s(active(X)) #20: #active(s(X)) -> #active(X) #21: #U22(mark(X1),X2,X3) -> #U22(X1,X2,X3) #22: #U21(mark(X1),X2,X3) -> #U21(X1,X2,X3) #23: #active(plus(X1,X2)) -> #plus(active(X1),X2) #24: #active(plus(X1,X2)) -> #active(X1) #25: #proper(plus(X1,X2)) -> #plus(proper(X1),proper(X2)) #26: #proper(plus(X1,X2)) -> #proper(X1) #27: #proper(plus(X1,X2)) -> #proper(X2) #28: #active(U21(X1,X2,X3)) -> #U21(active(X1),X2,X3) #29: #active(U21(X1,X2,X3)) -> #active(X1) #30: #proper(s(X)) -> #s(proper(X)) #31: #proper(s(X)) -> #proper(X) #32: #x(mark(X1),X2) -> #x(X1,X2) #33: #s(mark(X)) -> #s(X) #34: #plus(ok(X1),ok(X2)) -> #plus(X1,X2) #35: #active(U12(X1,X2,X3)) -> #U12(active(X1),X2,X3) #36: #active(U12(X1,X2,X3)) -> #active(X1) #37: #proper(U22(X1,X2,X3)) -> #U22(proper(X1),proper(X2),proper(X3)) #38: #proper(U22(X1,X2,X3)) -> #proper(X1) #39: #proper(U22(X1,X2,X3)) -> #proper(X2) #40: #proper(U22(X1,X2,X3)) -> #proper(X3) #41: #top(ok(X)) -> #top(active(X)) #42: #top(ok(X)) -> #active(X) #43: #plus(X1,mark(X2)) -> #plus(X1,X2) #44: #proper(x(X1,X2)) -> #x(proper(X1),proper(X2)) #45: #proper(x(X1,X2)) -> #proper(X1) #46: #proper(x(X1,X2)) -> #proper(X2) #47: #proper(U11(X1,X2,X3)) -> #U11(proper(X1),proper(X2),proper(X3)) #48: #proper(U11(X1,X2,X3)) -> #proper(X1) #49: #proper(U11(X1,X2,X3)) -> #proper(X2) #50: #proper(U11(X1,X2,X3)) -> #proper(X3) #51: #active(x(X1,X2)) -> #x(X1,active(X2)) #52: #active(x(X1,X2)) -> #active(X2) #53: #proper(U21(X1,X2,X3)) -> #U21(proper(X1),proper(X2),proper(X3)) #54: #proper(U21(X1,X2,X3)) -> #proper(X1) #55: #proper(U21(X1,X2,X3)) -> #proper(X2) #56: #proper(U21(X1,X2,X3)) -> #proper(X3) #57: #U12(mark(X1),X2,X3) -> #U12(X1,X2,X3) #58: #x(X1,mark(X2)) -> #x(X1,X2) #59: #U11(ok(X1),ok(X2),ok(X3)) -> #U11(X1,X2,X3) #60: #plus(mark(X1),X2) -> #plus(X1,X2) #61: #active(x(X1,X2)) -> #x(active(X1),X2) #62: #active(x(X1,X2)) -> #active(X1) #63: #active(U21(tt(),M,N)) -> #U22(tt(),M,N) #64: #active(U11(tt(),M,N)) -> #U12(tt(),M,N) #65: #active(x(N,s(M))) -> #U21(tt(),M,N) #66: #active(U22(X1,X2,X3)) -> #U22(active(X1),X2,X3) #67: #active(U22(X1,X2,X3)) -> #active(X1) #68: #active(U22(tt(),M,N)) -> #plus(x(N,M),N) #69: #active(U22(tt(),M,N)) -> #x(N,M) #70: #U11(mark(X1),X2,X3) -> #U11(X1,X2,X3) Number of SCCs: 10, DPs: 44 SCC { #12 #33 } POLO(Sum)... succeeded. U21 w: 0 U11 w: 0 s w: 0 top w: 0 #plus w: 0 #top w: 0 U12 w: 0 x w: 0 #U12 w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 #x w: 0 #s w: x1 mark w: x1 + 1 #proper w: 0 plus w: 0 #U11 w: 0 active w: 0 #active w: 0 #U21 w: 0 #U22 w: 0 tt w: 0 U22 w: 0 USABLE RULES: { } Removed DPs: #12 #33 Number of SCCs: 9, DPs: 42 SCC { #3 #41 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.