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


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


MAYBE
Input TRS:
    1: active(f(b(),c(),x)) -> mark(f(x,x,x))
    2: active(f(x,y,z)) -> f(x,y,active(z))
    3: active(d()) -> m(b())
    4: f(x,y,mark(z)) -> mark(f(x,y,z))
    5: active(d()) -> mark(c())
    6: proper(b()) -> ok(b())
    7: proper(c()) -> ok(c())
    8: proper(d()) -> ok(d())
    9: proper(f(x,y,z)) -> f(proper(x),proper(y),proper(z))
    10: f(ok(x),ok(y),ok(z)) -> ok(f(x,y,z))
    11: top(mark(x)) -> top(proper(x))
    12: top(ok(x)) -> top(active(x))
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #active(f(x,y,z)) -> #f(x,y,active(z))
   #2: #active(f(x,y,z)) -> #active(z)
   #3: #proper(f(x,y,z)) -> #f(proper(x),proper(y),proper(z))
   #4: #proper(f(x,y,z)) -> #proper(x)
   #5: #proper(f(x,y,z)) -> #proper(y)
   #6: #proper(f(x,y,z)) -> #proper(z)
   #7: #top(mark(x)) -> #top(proper(x))
   #8: #top(mark(x)) -> #proper(x)
   #9: #top(ok(x)) -> #top(active(x))
   #10: #top(ok(x)) -> #active(x)
   #11: #f(ok(x),ok(y),ok(z)) -> #f(x,y,z)
   #12: #active(f(b(),c(),x)) -> #f(x,x,x)
   #13: #f(x,y,mark(z)) -> #f(x,y,z)
Number of SCCs: 4, DPs: 8
  SCC { #2 }
POLO(Sum)... succeeded.
      d 	w: 0
      b 	w: 0
      top	w: 0
      #top	w: 0
      c 	w: 0
      f 	w: x3 + 1
      proper	w: 0
      ok	w: 0
      mark	w: 0
      #f 	w: 0
      #proper	w: 0
      active	w: 0
      #active	w: x1
      m 	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 3, DPs: 7
  SCC { #7 #9 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.