/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(true(),x,y) -> f(gt(x,y),x,round(s(y)))
    2: round(0()) -> 0()
    3: round(s(0())) -> s(s(0()))
    4: round(s(s(x))) -> s(s(round(x)))
    5: gt(0(),v) -> false()
    6: gt(s(u),0()) -> true()
    7: gt(s(u),s(v)) -> gt(u,v)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying round
1: f(true(),x,y) -> f(gt(x,y),x,round^1_s(y))
2: round^1_0() -> 0()
3: round^1_s(0()) -> s(s(0()))
4: round^1_s(s(x)) -> s(s(round(x)))
5: gt(0(),v) -> false()
6: gt(s(u),0()) -> true()
7: gt(s(u),s(v)) -> gt(u,v)
8: round(0()) ->= round^1_0()
9: round(s(_1)) ->= round^1_s(_1)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #round(s(_1)) ->? #round^1_s(_1)
   #2: #gt(s(u),s(v)) -> #gt(u,v)
   #3: #f(true(),x,y) -> #f(gt(x,y),x,round^1_s(y))
   #4: #f(true(),x,y) -> #gt(x,y)
   #5: #f(true(),x,y) -> #round^1_s(y)
   #6: #round(0()) ->? #round^1_0()
   #7: #round^1_s(s(x)) -> #round(x)
Number of SCCs: 3, DPs: 4
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #round^1_s	w: 0
      gt	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      round^1_s	w: 0
      0 	w: 0
      #gt	w: x1
      #f 	w: 0
      round	w: 0
      round^1_0	w: 0
      #round^1_0	w: 0
      #round	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 2, DPs: 3
  SCC { #1 #7 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #round^1_s	w: x1
      gt	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      round^1_s	w: 0
      0 	w: 0
      #gt	w: 0
      #f 	w: 0
      round	w: 0
      round^1_0	w: 0
      #round^1_0	w: 0
      #round	w: x1
    USABLE RULES: { }
    Removed DPs: #1 #7
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.