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


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


NO
Input TRS:
    1: +(1(),x) -> +(+(0(),1()),x)
    2: +(0(),x) -> x
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying +
1: +^1_1(x) -> +(+^1_0(1()),x)
2: +^1_0(x) -> x
3: +(1(),_1) ->= +^1_1(_1)
4: +(0(),_1) ->= +^1_0(_1)
Number of strict rules: 2
Direct POLO(bPol) ... removes: 4
      1 	w: 1
      +^1_1	w: 2 * x1 + 1
      +^1_0	w: x1
      0 	w: 1
      + 	w: x1 + 2 * x2
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #+(1(),_1) ->? #+^1_1(_1)
   #2: #+^1_1(x) -> #+(+^1_0(1()),x)
   #3: #+^1_1(x) -> #+^1_0(1())
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #+(1(),_1_{2})	-#1->
  #+^1_1(_1_{2})	--->*
  #+^1_1(_1_{2})	-#2->
  #+(+^1_0(1()),_1_{2})	--->*
  #+(1(),_1_{2})
  Looping with: [ _1_{2} := _1_{2}; ]