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


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


MAYBE
Input TRS:
    1: d(n(x1)) -> d(x1)
    2: d(o(x1)) -> d(x1)
    3: o(u(x1)) -> u(x1)
    4: t(u(x1)) ->= t(c(d(x1)))
    5: d(f(x1)) ->= f(d(x1))
    6: d(g(x1)) ->= u(g(x1))
    7: f(u(x1)) ->= u(f(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: 3
Direct POLO(bPol) ... removes: 3 2
      d 	w: x1 + 1
      n 	w: x1
      u 	w: x1 + 1
      t 	w: x1
      c 	w: x1
      f 	w: x1 + 1
      o 	w: 2 * x1 + 1
      g 	w: x1 + 2
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #c(n(x1)) ->? #c(x1)
   #2: #c(o(x1)) ->? #c(x1)
   #3: #c(f(x1)) ->? #c(x1)
   #4: #t(x1) ->? #t(c(n(x1)))
   #5: #t(x1) ->? #c(n(x1))
   #6: #d(f(x1)) ->? #d(x1)
   #7: #c(d(x1)) ->? #d(c(x1))
   #8: #c(d(x1)) ->? #c(x1)
   #9: #d(n(x1)) -> #d(x1)
   #10: #c(u(x1)) ->? #c(x1)
   #11: #t(u(x1)) ->? #t(c(d(x1)))
   #12: #t(u(x1)) ->? #c(d(x1))
   #13: #t(u(x1)) ->? #d(x1)
Number of SCCs: 3, DPs: 9
  SCC { #6 #9 }
POLO(Sum)... succeeded.
      d 	w: x1 + 1
      n 	w: x1
      u 	w: 1
      t 	w: 0
      c 	w: x1 + 1
      f 	w: x1 + 1
      o 	w: x1 + 1
      #d 	w: x1
      #c 	w: 0
      #t 	w: 0
      g 	w: 1
    Removed DPs: #6
Number of SCCs: 3, DPs: 8
  SCC { #9 }
POLO(Sum)... succeeded.
      d 	w: x1 + 1
      n 	w: x1 + 1
      u 	w: 1
      t 	w: 0
      c 	w: x1 + 1
      f 	w: 1
      o 	w: x1 + 1
      #d 	w: x1
      #c 	w: 0
      #t 	w: 0
      g 	w: 1
    Removed DPs: #9
Number of SCCs: 2, DPs: 7
  SCC { #4 #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      d 	w: [0,1;0,1] * x1 + [1;0]
      n 	w: x1
      u 	w: [0,0;0,1] * x1 + [2;0]
      t 	w: [0;0]
      c 	w: [1,0;0,0] * x1
      f 	w: x1
      o 	w: [1,0;0,0] * x1 + [1;0]
      #d 	w: [0;0]
      #c 	w: [0;0]
      #t 	w: [1,1;0,0] * x1
      g 	w: [1;1]
    Removed DPs: #11
Number of SCCs: 2, DPs: 6
  SCC { #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.