/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
Input TRS:
    1: n(s(x1)) -> s(x1)
    2: o(s(x1)) -> s(x1)
    3: t(x1) ->= t(c(n(x1)))
    4: c(n(x1)) ->= n(c(x1))
    5: c(o(x1)) ->= o(c(x1))
    6: c(o(x1)) ->= o(x1)
Number of strict rules: 2
Direct POLO(bPol) ... removes: 2
      s 	w: x1 + 1
      n 	w: x1
      t 	w: x1
      c 	w: x1
      o 	w: x1 + 1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #c(o(x1)) ->? #c(x1)
   #2: #t(x1) ->? #t(c(n(x1)))
   #3: #t(x1) ->? #c(n(x1))
   #4: #t(x1) ->? #n(x1)
   #5: #c(n(x1)) ->? #n(c(x1))
   #6: #c(n(x1)) ->? #c(x1)
Number of SCCs: 2, DPs: 3
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.