/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: c(a(c(x1))) -> b(c(a(x1))) 2: b(a(a(x1))) -> b(b(a(x1))) 3: b(a(b(x1))) -> c(b(c(x1))) 4: a(b(a(x1))) -> c(c(a(x1))) 5: c(b(b(x1))) ->= a(c(c(x1))) 6: c(b(b(x1))) ->= b(c(c(x1))) 7: b(c(c(x1))) ->= c(a(a(x1))) Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #b(a(a(x1))) -> #b(b(a(x1))) #2: #b(a(a(x1))) -> #b(a(x1)) #3: #c(b(b(x1))) ->? #b(c(c(x1))) #4: #c(b(b(x1))) ->? #c(c(x1)) #5: #c(b(b(x1))) ->? #c(x1) #6: #b(c(c(x1))) ->? #c(a(a(x1))) #7: #b(c(c(x1))) ->? #a(a(x1)) #8: #b(c(c(x1))) ->? #a(x1) #9: #c(b(b(x1))) ->? #a(c(c(x1))) #10: #c(b(b(x1))) ->? #c(c(x1)) #11: #c(b(b(x1))) ->? #c(x1) #12: #b(a(b(x1))) -> #c(b(c(x1))) #13: #b(a(b(x1))) -> #b(c(x1)) #14: #b(a(b(x1))) -> #c(x1) #15: #c(a(c(x1))) -> #b(c(a(x1))) #16: #c(a(c(x1))) -> #c(a(x1)) #17: #c(a(c(x1))) -> #a(x1) #18: #a(b(a(x1))) -> #c(c(a(x1))) #19: #a(b(a(x1))) -> #c(a(x1)) Number of SCCs: 1, DPs: 19 SCC { #1..19 } POLO(Sum)... succeeded. a w: x1 + 11798 b w: x1 + 11798 c w: x1 + 11798 #c w: x1 #a w: x1 #b w: x1 USABLE RULES: { 1..7 } Removed DPs: #2 #4 #5 #7 #8 #10 #11 #13 #14 #16 #17 #19 Number of SCCs: 1, DPs: 7 SCC { #1 #3 #6 #9 #12 #15 #18 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.