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


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


MAYBE
Input TRS:
    1: f(tt(),x) -> f(eq(x,half(double(x))),s(x))
    2: eq(s(x),s(y)) -> eq(x,y)
    3: eq(0(),0()) -> tt()
    4: double(s(x)) -> s(s(double(x)))
    5: double(0()) -> 0()
    6: half(s(s(x))) -> s(half(x))
    7: half(0()) -> 0()
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #eq(s(x),s(y)) -> #eq(x,y)
   #2: #half(s(s(x))) -> #half(x)
   #3: #f(tt(),x) -> #f(eq(x,half(double(x))),s(x))
   #4: #f(tt(),x) -> #eq(x,half(double(x)))
   #5: #f(tt(),x) -> #half(double(x))
   #6: #f(tt(),x) -> #double(x)
   #7: #double(s(x)) -> #double(x)
Number of SCCs: 4, DPs: 4
  SCC { #7 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      eq	w: 0
      #half	w: 0
      f 	w: 0
      #eq	w: 0
      half	w: 0
      0 	w: 0
      #double	w: x1
      double	w: 0
      #f 	w: 0
      tt	w: 0
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 3, DPs: 3
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      eq	w: 0
      #half	w: x1
      f 	w: 0
      #eq	w: 0
      half	w: 0
      0 	w: 0
      #double	w: 0
      double	w: 0
      #f 	w: 0
      tt	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 2, DPs: 2
  SCC { #1 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      eq	w: 0
      #half	w: 0
      f 	w: 0
      #eq	w: x2
      half	w: 0
      0 	w: 0
      #double	w: 0
      double	w: 0
      #f 	w: 0
      tt	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.