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