/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(append(),nil()),l) -> l
    2: app(app(append(),app(app(cons(),h),t)),l) -> app(app(cons(),h),app(app(append(),t),l))
    3: app(app(map(),f),nil()) -> nil()
    4: app(app(map(),f),app(app(cons(),h),t)) -> app(app(cons(),app(f,h)),app(app(map(),f),t))
    5: app(app(append(),app(app(append(),l1),l2)),l3) -> app(app(append(),l1),app(app(append(),l2),l3))
    6: app(app(map(),f),app(app(append(),l1),l2)) -> app(app(append(),app(app(map(),f),l1)),app(app(map(),f),l2))
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying app
1: app^2_append(nil(),l) -> l
2: app^2_append(app^2_cons(h,t),l) -> app^2_cons(h,app^2_append(t,l))
3: app^2_map(f,nil()) -> nil()
4: app^2_map(f,app^2_cons(h,t)) -> app^2_cons(app(f,h),app^2_map(f,t))
5: app^2_append(app^2_append(l1,l2),l3) -> app^2_append(l1,app^2_append(l2,l3))
6: app^2_map(f,app^2_append(l1,l2)) -> app^2_append(app^2_map(f,l1),app^2_map(f,l2))
7: app(append(),_1) ->= app^1_append(_1)
8: app(app^1_append(_1),_2) ->= app^2_append(_1,_2)
9: app(cons(),_1) ->= app^1_cons(_1)
10: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2)
11: app(map(),_1) ->= app^1_map(_1)
12: app(app^1_map(_1),_2) ->= app^2_map(_1,_2)
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #app^2_append(app^2_cons(h,t),l) -> #app^2_append(t,l)
   #2: #app^2_map(f,app^2_append(l1,l2)) -> #app^2_append(app^2_map(f,l1),app^2_map(f,l2))
   #3: #app^2_map(f,app^2_append(l1,l2)) -> #app^2_map(f,l1)
   #4: #app^2_map(f,app^2_append(l1,l2)) -> #app^2_map(f,l2)
   #5: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2)
   #6: #app^2_append(app^2_append(l1,l2),l3) -> #app^2_append(l1,app^2_append(l2,l3))
   #7: #app^2_append(app^2_append(l1,l2),l3) -> #app^2_append(l2,l3)
   #8: #app(app^1_append(_1),_2) ->? #app^2_append(_1,_2)
   #9: #app^2_map(f,app^2_cons(h,t)) -> #app(f,h)
   #10: #app^2_map(f,app^2_cons(h,t)) -> #app^2_map(f,t)
Number of SCCs: 2, DPs: 8
  SCC { #1 #6 #7 }
POLO(Sum)... succeeded.
      app^1_cons	w: 0
      #app^2_map	w: 0
      app^1_append	w: 0
      #app^2_append	w: x1
      append	w: 0
      nil	w: 1
      #app	w: 0
      map	w: 0
      cons	w: 0
      app^1_map	w: 0
      app^2_cons	w: x2 + 1
      app^2_append	w: x1 + x2 + 1
      app^2_map	w: 0
      app	w: 0
    USABLE RULES: { 1 2 5 }
    Removed DPs: #1 #6 #7
Number of SCCs: 1, DPs: 5
  SCC { #3..5 #9 #10 }
POLO(Sum)... succeeded.
      app^1_cons	w: 0
      #app^2_map	w: x2
      app^1_append	w: 0
      #app^2_append	w: 0
      append	w: 0
      nil	w: 1
      #app	w: x2 + 1
      map	w: 0
      cons	w: 0
      app^1_map	w: 1
      app^2_cons	w: x1 + x2 + 2
      app^2_append	w: x1 + x2 + 1
      app^2_map	w: 0
      app	w: 0
    USABLE RULES: { 1 2 5 }
    Removed DPs: #3..5 #9 #10
Number of SCCs: 0, DPs: 0