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


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


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