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