/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: a(a(b(x1))) -> a(c(c(x1))) 2: c(c(b(x1))) -> b(b(c(x1))) 3: c(a(a(x1))) -> c(a(c(x1))) 4: b(b(c(x1))) ->= b(a(c(x1))) 5: a(b(a(x1))) ->= a(b(c(x1))) 6: c(a(c(x1))) ->= c(b(a(x1))) 7: a(a(b(x1))) ->= a(a(b(x1))) Removing trivial weak rule 7. Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #c(c(b(x1))) -> #b(b(c(x1))) #2: #c(c(b(x1))) -> #b(c(x1)) #3: #c(c(b(x1))) -> #c(x1) #4: #c(a(c(x1))) ->? #c(b(a(x1))) #5: #c(a(c(x1))) ->? #b(a(x1)) #6: #c(a(c(x1))) ->? #a(x1) #7: #a(b(a(x1))) ->? #a(b(c(x1))) #8: #a(b(a(x1))) ->? #b(c(x1)) #9: #a(b(a(x1))) ->? #c(x1) #10: #c(a(a(x1))) -> #c(a(c(x1))) #11: #c(a(a(x1))) -> #a(c(x1)) #12: #c(a(a(x1))) -> #c(x1) #13: #a(a(b(x1))) -> #a(c(c(x1))) #14: #a(a(b(x1))) -> #c(c(x1)) #15: #a(a(b(x1))) -> #c(x1) #16: #b(b(c(x1))) ->? #b(a(c(x1))) #17: #b(b(c(x1))) ->? #a(c(x1)) Number of SCCs: 1, DPs: 14 SCC { #1..3 #6..15 #17 } POLO(Sum)... succeeded. a w: x1 + 284 b w: x1 + 284 c w: x1 + 284 #c w: x1 + 2 #a w: x1 + 282 #b w: x1 USABLE RULES: { 1..6 } Removed DPs: #1..3 #6 #8 #9 #11 #12 #14 #15 #17 Number of SCCs: 2, DPs: 2 SCC { #10 } POLO(Sum)... succeeded. a w: x1 + 31893 b w: 21656 c w: 31892 #c w: x1 + 2 #a w: 282 #b w: x1 USABLE RULES: { 2..6 } Removed DPs: #10 Number of SCCs: 1, DPs: 1 SCC { #7 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded. a w: [54760;54759] b w: [0,1;1,0] * x1 c w: [54759;54760] #c w: [0;0] #a w: [0,1;0,1] * x1 #b w: [0;0] USABLE RULES: { 2..6 } Removed DPs: #7 Number of SCCs: 0, DPs: 0