/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: 0(q0(0(x1))) -> 0(0(q0(x1))) 2: 0(q0(h(x1))) -> 0(0(q0(h(x1)))) 3: 0(q0(1(x1))) -> 0(1(q0(x1))) 4: 1(q0(0(x1))) -> 0(0(q1(x1))) 5: 1(q0(h(x1))) -> 0(0(q1(h(x1)))) 6: 1(q0(1(x1))) -> 0(1(q1(x1))) 7: 1(q1(0(x1))) -> 1(0(q1(x1))) 8: 1(q1(h(x1))) -> 1(0(q1(h(x1)))) 9: 1(q1(1(x1))) -> 1(1(q1(x1))) 10: 0(q1(0(x1))) -> 0(0(q2(x1))) 11: 0(q1(h(x1))) -> 0(0(q2(h(x1)))) 12: 0(q1(1(x1))) -> 0(1(q2(x1))) 13: 1(q2(0(x1))) -> 1(0(q2(x1))) 14: 1(q2(h(x1))) -> 1(0(q2(h(x1)))) 15: 1(q2(1(x1))) -> 1(1(q2(x1))) 16: 0(q2(x1)) -> q3(1(x1)) 17: 1(q3(x1)) -> q3(1(x1)) 18: 0(q3(x1)) -> q4(0(x1)) 19: 1(q4(x1)) -> q4(1(x1)) 20: 0(q4(0(x1))) -> 1(0(q5(x1))) 21: 0(q4(h(x1))) -> 1(0(q5(h(x1)))) 22: 0(q4(1(x1))) -> 1(1(q5(x1))) 23: 1(q5(0(x1))) -> 0(0(q1(x1))) 24: 1(q5(h(x1))) -> 0(0(q1(h(x1)))) 25: 1(q5(1(x1))) -> 0(1(q1(x1))) 26: h(q0(x1)) -> h(0(q0(x1))) 27: h(q1(x1)) -> h(0(q1(x1))) 28: h(q2(x1)) -> h(0(q2(x1))) 29: h(q3(x1)) -> h(0(q3(x1))) 30: h(q4(x1)) -> h(0(q4(x1))) 31: h(q5(x1)) -> h(0(q5(x1))) Number of strict rules: 31 Direct poly ... removes: 4 5 6 h(x1) w: (1 + x1) 1(x1) w: (x1) q3(x1) w: (20585 + x1) q4(x1) w: (20585 + x1) 0(x1) w: (x1) q1(x1) w: (20585 + x1) q5(x1) w: (20585 + x1) q2(x1) w: (20585 + x1) q0(x1) w: (20586 + 2 * x1) Number of strict rules: 28 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #0(q0(h(x1))) -> #0(0(q0(h(x1)))) #2: #0(q0(h(x1))) -> #0(q0(h(x1))) #3: #h(q3(x1)) -> #h(0(q3(x1))) #4: #h(q3(x1)) -> #0(q3(x1)) #5: #1(q2(0(x1))) -> #1(0(q2(x1))) #6: #1(q2(0(x1))) -> #0(q2(x1)) #7: #1(q1(1(x1))) -> #1(1(q1(x1))) #8: #1(q1(1(x1))) -> #1(q1(x1)) #9: #0(q1(h(x1))) -> #0(0(q2(h(x1)))) #10: #0(q1(h(x1))) -> #0(q2(h(x1))) #11: #1(q5(h(x1))) -> #0(0(q1(h(x1)))) #12: #1(q5(h(x1))) -> #0(q1(h(x1))) #13: #1(q5(0(x1))) -> #0(0(q1(x1))) #14: #1(q5(0(x1))) -> #0(q1(x1)) #15: #0(q1(1(x1))) -> #0(1(q2(x1))) #16: #0(q1(1(x1))) -> #1(q2(x1)) #17: #h(q5(x1)) -> #h(0(q5(x1))) #18: #h(q5(x1)) -> #0(q5(x1)) #19: #1(q2(h(x1))) -> #1(0(q2(h(x1)))) #20: #1(q2(h(x1))) -> #0(q2(h(x1))) #21: #h(q4(x1)) -> #h(0(q4(x1))) #22: #h(q4(x1)) -> #0(q4(x1)) #23: #1(q5(1(x1))) -> #0(1(q1(x1))) #24: #1(q5(1(x1))) -> #1(q1(x1)) #25: #0(q4(0(x1))) -> #1(0(q5(x1))) #26: #0(q4(0(x1))) -> #0(q5(x1)) #27: #1(q1(0(x1))) -> #1(0(q1(x1))) #28: #1(q1(0(x1))) -> #0(q1(x1)) #29: #0(q1(0(x1))) -> #0(0(q2(x1))) #30: #0(q1(0(x1))) -> #0(q2(x1)) #31: #h(q2(x1)) -> #h(0(q2(x1))) #32: #h(q2(x1)) -> #0(q2(x1)) #33: #0(q4(1(x1))) -> #1(1(q5(x1))) #34: #0(q4(1(x1))) -> #1(q5(x1)) #35: #h(q1(x1)) -> #h(0(q1(x1))) #36: #h(q1(x1)) -> #0(q1(x1)) #37: #1(q3(x1)) -> #1(x1) #38: #1(q4(x1)) -> #1(x1) #39: #h(q0(x1)) -> #h(0(q0(x1))) #40: #h(q0(x1)) -> #0(q0(x1)) #41: #0(q4(h(x1))) -> #1(0(q5(h(x1)))) #42: #0(q4(h(x1))) -> #0(q5(h(x1))) #43: #0(q2(x1)) -> #1(x1) #44: #0(q0(1(x1))) -> #0(1(q0(x1))) #45: #0(q0(1(x1))) -> #1(q0(x1)) #46: #0(q0(0(x1))) -> #0(0(q0(x1))) #47: #0(q0(0(x1))) -> #0(q0(x1)) #48: #1(q1(h(x1))) -> #1(0(q1(h(x1)))) #49: #1(q1(h(x1))) -> #0(q1(h(x1))) #50: #1(q2(1(x1))) -> #1(1(q2(x1))) #51: #1(q2(1(x1))) -> #1(q2(x1)) #52: #0(q3(x1)) -> #0(x1) Number of SCCs: 2, DPs: 36 SCC { #3 #21 } Sum... succeeded. h(x1) w: (1) #0(x1) w: (0) 1(x1) w: (x1) q3(x1) w: (4) q4(x1) w: (3) 0(x1) w: (3) #h(x1) w: (x1) q1(x1) w: (1) q5(x1) w: (3) q2(x1) w: (1 + x1) #1(x1) w: (0) q0(x1) w: (11798 + x1) USABLE RULES: { 1..3 17..31 } Removed DPs: #3 Number of SCCs: 2, DPs: 35 SCC { #21 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... succeeded. h(x1) w: (max{0, 45864 + x1_1 + x1_2}, -45865 + x1_2) #0(x1) w: (0, 0) 1(x1) w: (max{0, x1_1 + x1_2}, 0) q3(x1) w: (max{0, 37081}, 0) q4(x1) w: (max{0, 1}, 0) 0(x1) w: (max{0, -37078 + x1_1}, 0) #h(x1) w: (max{0, 1373 + x1_1}, 0) q1(x1) w: (max{0, 55486}, -25113) q5(x1) w: (max{0, -9335}, -9336) q2(x1) w: (max{0, 74159}, -18673) #1(x1) w: (0, 0) q0(x1) w: (max{0, 110330}, -1) USABLE RULES: { 1..3 7..25 } Removed DPs: #21 Number of SCCs: 1, DPs: 34 SCC { #1 #2 #5..16 #19 #20 #23 #24 #27..30 #33 #34 #37 #38 #43 #46..52 } Sum... succeeded. h(x1) w: (1) #0(x1) w: (x1) 1(x1) w: (3) q3(x1) w: (x1) q4(x1) w: (3) 0(x1) w: (3) #h(x1) w: (3) q1(x1) w: (3) q5(x1) w: (4) q2(x1) w: (3) #1(x1) w: (3) q0(x1) w: (31115) USABLE RULES: { 1..3 7..25 } Removed DPs: #1 #46 Number of SCCs: 3, DPs: 32 SCC { #47 } Sum... Max... succeeded. h(x1) w: (15922) #0(x1) w: (x1) 1(x1) w: (8951 + x1) q3(x1) w: (17899) q4(x1) w: (17901) 0(x1) w: (1 + x1) #h(x1) w: (0) q1(x1) w: (8951 + x1) q5(x1) w: (1) q2(x1) w: (8952 + x1) #1(x1) w: (0) q0(x1) w: (1 + x1) USABLE RULES: { } Removed DPs: #47 Number of SCCs: 2, DPs: 31 SCC { #2 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... found. #0(q0(h(x1_{1}))) -#2-> #0(q0(h(x1_{1}))) --->* #0(q0(h(x1_{1}))) Looping with: [ x1_{1} := x1_{1}; ]