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


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


MAYBE
Input TRS:
    1: b(b(b(x1))) -> x1
    2: c(c(c(x1))) -> a(a(x1))
    3: a(x1) ->= a(c(b(x1)))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #c(c(c(x1))) -> #a(a(x1))
   #2: #c(c(c(x1))) -> #a(x1)
   #3: #a(x1) ->? #a(c(b(x1)))
   #4: #a(x1) ->? #c(b(x1))
   #5: #a(x1) ->? #b(x1)
Number of SCCs: 1, DPs: 4
  SCC { #1..4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [0;4]
      b 	w: [1,1;1,0] * x1 + [0;2]
      c 	w: [0,0;1,1] * x1 + [0;3]
      #c 	w: [0,1;0,0] * x1
      #a 	w: [1,0;0,0] * x1 + [4;0]
      #b 	w: [0;0]
    USABLE RULES: { 1..3 }
    Removed DPs: #1 #2 #4
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.