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


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


MAYBE
Input TRS:
    1: top1(free(x),y) -> top2(check(new(x)),y)
    2: top1(free(x),y) -> top2(new(x),check(y))
    3: top1(free(x),y) -> top2(check(x),new(y))
    4: top1(free(x),y) -> top2(x,check(new(y)))
    5: top2(x,free(y)) -> top1(check(new(x)),y)
    6: top2(x,free(y)) -> top1(new(x),check(y))
    7: top2(x,free(y)) -> top1(check(x),new(y))
    8: top2(x,free(y)) -> top1(x,check(new(y)))
    9: new(free(x)) -> free(new(x))
    10: old(free(x)) -> free(old(x))
    11: new(serve()) -> free(serve())
    12: old(serve()) -> free(serve())
    13: check(free(x)) -> free(check(x))
    14: check(new(x)) -> new(check(x))
    15: check(old(x)) -> old(check(x))
    16: check(old(x)) -> old(x)
Number of strict rules: 16
Direct POLO(bPol) ... removes: 12
      new	w: x1 + 1
      top1	w: x1 + x2
      serve	w: 1
      free	w: x1 + 1
      top2	w: x1 + x2
      check	w: x1
      old	w: x1 + 2
Number of strict rules: 15
Direct POLO(bPol) ... removes: 10
      new	w: x1 + 1
      top1	w: x1 + x2
      serve	w: 1
      free	w: x1 + 1
      top2	w: x1 + x2
      check	w: x1
      old	w: 2 * x1 + 2
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #top1(free(x),y) -> #top2(new(x),check(y))
   #2: #top1(free(x),y) -> #new(x)
   #3: #top1(free(x),y) -> #check(y)
   #4: #top2(x,free(y)) -> #top1(new(x),check(y))
   #5: #top2(x,free(y)) -> #new(x)
   #6: #top2(x,free(y)) -> #check(y)
   #7: #check(free(x)) -> #check(x)
   #8: #new(free(x)) -> #new(x)
   #9: #check(new(x)) -> #new(check(x))
   #10: #check(new(x)) -> #check(x)
   #11: #top2(x,free(y)) -> #top1(check(x),new(y))
   #12: #top2(x,free(y)) -> #check(x)
   #13: #top2(x,free(y)) -> #new(y)
   #14: #top2(x,free(y)) -> #top1(check(new(x)),y)
   #15: #top2(x,free(y)) -> #check(new(x))
   #16: #top2(x,free(y)) -> #new(x)
   #17: #top1(free(x),y) -> #top2(check(x),new(y))
   #18: #top1(free(x),y) -> #check(x)
   #19: #top1(free(x),y) -> #new(y)
   #20: #top1(free(x),y) -> #top2(check(new(x)),y)
   #21: #top1(free(x),y) -> #check(new(x))
   #22: #top1(free(x),y) -> #new(x)
   #23: #top2(x,free(y)) -> #top1(x,check(new(y)))
   #24: #top2(x,free(y)) -> #check(new(y))
   #25: #top2(x,free(y)) -> #new(y)
   #26: #check(old(x)) -> #check(x)
   #27: #top1(free(x),y) -> #top2(x,check(new(y)))
   #28: #top1(free(x),y) -> #check(new(y))
   #29: #top1(free(x),y) -> #new(y)
Number of SCCs: 3, DPs: 12
  SCC { #8 }
POLO(Sum)... succeeded.
      new	w: 0
      #top2	w: 0
      top1	w: 0
      #check	w: 0
      #top1	w: 0
      serve	w: 0
      free	w: x1 + 1
      top2	w: 0
      check	w: 0
      #new	w: x1
      old	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 11
  SCC { #7 #10 #26 }
POLO(Sum)... succeeded.
      new	w: x1 + 1
      #top2	w: 0
      top1	w: 0
      #check	w: x1
      #top1	w: 0
      serve	w: 0
      free	w: x1 + 1
      top2	w: 0
      check	w: 0
      #new	w: 0
      old	w: x1 + 1
    USABLE RULES: { }
    Removed DPs: #7 #10 #26
Number of SCCs: 1, DPs: 8
  SCC { #1 #4 #11 #14 #17 #20 #23 #27 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.