/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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 poly ... failed.
Freezing ... 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 }
Sum... succeeded.
  hd()		w: (11798)
  0()		w: (2)
  nil()		w: (8366)
  #app(x1,x2)		w: (x1)
  map()		w: (1)
  cons()		w: (0)
  app(x1,x2)		w: (32287 + x2 + x1)
    USABLE RULES: { }
    Removed DPs: #3 #7
Number of SCCs: 2, DPs: 2
	SCC { #9 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... 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(); ]