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


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


NO
Input TRS:
    1: app(app(f,0()),n) -> app(app(hd(),app(app(map(),f),app(app(cons(),0()),nil()))),n)
    2: app(app(map(),f),nil()) -> nil()
    3: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(app(cons(),app(f,x)),app(app(map(),f),xs))
   #2: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(cons(),app(f,x))
   #3: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(f,x)
   #4: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(app(map(),f),xs)
   #5: #app(app(f,0()),n) -> #app(app(hd(),app(app(map(),f),app(app(cons(),0()),nil()))),n)
   #6: #app(app(f,0()),n) -> #app(hd(),app(app(map(),f),app(app(cons(),0()),nil())))
   #7: #app(app(f,0()),n) -> #app(app(map(),f),app(app(cons(),0()),nil()))
   #8: #app(app(f,0()),n) -> #app(map(),f)
   #9: #app(app(f,0()),n) -> #app(app(cons(),0()),nil())
   #10: #app(app(f,0()),n) -> #app(cons(),0())
Number of SCCs: 1, DPs: 4
  SCC { #3 #4 #7 #9 }
POLO(Sum)... succeeded.
      hd	w: 1
      0 	w: 2
      nil	w: 1
      #app	w: x1
      map	w: 1
      cons	w: 0
      app	w: x1 + x2 + 1
    USABLE RULES: { }
    Removed DPs: #3 #7
Number of SCCs: 2, DPs: 2
  SCC { #9 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #app(app(f,0()),n)	-#9->
  #app(app(cons(),0()),nil())	--->*
  #app(app(cons(),0()),nil())
  Looping with: [ n := nil(); f := cons(); ]