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


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


YES
Input TRS:
    1: app(app(plus(),0()),y) -> y
    2: app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
    3: app(app(map(),f),nil()) -> nil()
    4: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs))
    5: app(app(app(curry(),g),x),y) -> app(app(g,x),y)
    6: inc() -> app(map(),app(app(curry(),plus()),app(s(),0())))
Number of strict rules: 6
Direct poly ... failed.
Freezing app
1: app❆2_plus(0(),y) -> y
2: app❆2_plus(app❆1_s(x),y) -> app❆1_s(app❆2_plus(x,y))
3: app❆2_map(f,nil()) -> nil()
4: app❆2_map(f,app❆2_cons(x,xs)) -> app❆2_cons(app(f,x),app❆2_map(f,xs))
5: app❆3_curry(g,x,y) -> app(app(g,x),y)
6: inc() -> app❆1_map(app❆2_curry(plus(),app❆1_s(0())))
7: app(plus(),_1) ->= app❆1_plus(_1)
8: app(app❆1_plus(_1),_2) ->= app❆2_plus(_1,_2)
9: app(curry(),_1) ->= app❆1_curry(_1)
10: app(app❆1_curry(_1),_2) ->= app❆2_curry(_1,_2)
11: app(app❆2_curry(_1,_2),_3) ->= app❆3_curry(_1,_2,_3)
12: app(cons(),_1) ->= app❆1_cons(_1)
13: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2)
14: app(s(),_1) ->= app❆1_s(_1)
15: app(map(),_1) ->= app❆1_map(_1)
16: app(app❆1_map(_1),_2) ->= app❆2_map(_1,_2)
Number of strict rules: 6
Direct poly ... failed.
Dependency Pairs:
   #1: #app❆2_plus(app❆1_s(x),y) -> #app❆2_plus(x,y)
   #2: #app(app❆2_curry(_1,_2),_3) ->? #app❆3_curry(_1,_2,_3)
   #3: #app❆3_curry(g,x,y) -> #app(app(g,x),y)
   #4: #app❆3_curry(g,x,y) -> #app(g,x)
   #5: #app(app❆1_map(_1),_2) ->? #app❆2_map(_1,_2)
   #6: #app(app❆1_plus(_1),_2) ->? #app❆2_plus(_1,_2)
   #7: #app❆2_map(f,app❆2_cons(x,xs)) -> #app(f,x)
   #8: #app❆2_map(f,app❆2_cons(x,xs)) -> #app❆2_map(f,xs)
Number of SCCs: 2, DPs: 7
	SCC { #1 }
Sum... succeeded.
  #app❆3_curry(x1,x2,x3)		w: (0)
  #app❆2_map(x1,x2)		w: (0)
  s()		w: (0)
  app❆1_map(x1)		w: (0)
  app❆1_plus(x1)		w: (0)
  app❆2_plus(x1,x2)		w: (0)
  app❆2_map(x1,x2)		w: (0)
  curry()		w: (0)
  #inc()		w: (0)
  app❆3_curry(x1,x2,x3)		w: (0)
  inc()		w: (0)
  0()		w: (0)
  #app❆2_plus(x1,x2)		w: (x1)
  nil()		w: (0)
  #app(x1,x2)		w: (0)
  map()		w: (0)
  app❆1_curry(x1)		w: (0)
  plus()		w: (0)
  cons()		w: (0)
  app❆2_cons(x1,x2)		w: (0)
  app❆2_curry(x1,x2)		w: (0)
  app❆1_s(x1)		w: (1 + x1)
  app❆1_cons(x1)		w: (0)
  app(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 6
	SCC { #2..5 #7 #8 }
Sum... succeeded.
  #app❆3_curry(x1,x2,x3)		w: (4 + x2 + x1)
  #app❆2_map(x1,x2)		w: (2 + x1)
  s()		w: (1)
  app❆1_map(x1)		w: (3 + x1)
  app❆1_plus(x1)		w: (4 + x1)
  app❆2_plus(x1,x2)		w: (1 + x2 + x1)
  app❆2_map(x1,x2)		w: (1)
  curry()		w: (10451)
  #inc()		w: (0)
  app❆3_curry(x1,x2,x3)		w: (6 + x3 + x2 + x1)
  inc()		w: (0)
  0()		w: (1)
  #app❆2_plus(x1,x2)		w: (0)
  nil()		w: (1)
  #app(x1,x2)		w: (x1)
  map()		w: (1)
  app❆1_curry(x1)		w: (3 + x1)
  plus()		w: (8366)
  cons()		w: (32286)
  app❆2_cons(x1,x2)		w: (1)
  app❆2_curry(x1,x2)		w: (5 + x2 + x1)
  app❆1_s(x1)		w: (4 + x1)
  app❆1_cons(x1)		w: (30613)
  app(x1,x2)		w: (3 + x2 + x1)
    USABLE RULES: { 1..5 7..16 }
    Removed DPs: #2..5 #7
Number of SCCs: 1, DPs: 1
	SCC { #8 }
Sum... succeeded.
  #app❆3_curry(x1,x2,x3)		w: (4)
  #app❆2_map(x1,x2)		w: (2 + x2)
  s()		w: (1)
  app❆1_map(x1)		w: (1 + x1)
  app❆1_plus(x1)		w: (4 + x1)
  app❆2_plus(x1,x2)		w: (1 + x2 + x1)
  app❆2_map(x1,x2)		w: (x2)
  curry()		w: (10453)
  #inc()		w: (0)
  app❆3_curry(x1,x2,x3)		w: (2 + x3 + x2 + x1)
  inc()		w: (0)
  0()		w: (1)
  #app❆2_plus(x1,x2)		w: (0)
  nil()		w: (0)
  #app(x1,x2)		w: (x1)
  map()		w: (1)
  app❆1_curry(x1)		w: (3 + x1)
  plus()		w: (26288)
  cons()		w: (1)
  app❆2_cons(x1,x2)		w: (1 + x2)
  app❆2_curry(x1,x2)		w: (1 + x2 + x1)
  app❆1_s(x1)		w: (2 + x1)
  app❆1_cons(x1)		w: (2)
  app(x1,x2)		w: (1 + x2 + x1)
    USABLE RULES: { 1..5 7..16 }
    Removed DPs: #8
Number of SCCs: 0, DPs: 0