/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(map(),f),nil()) -> nil()
    2: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs))
    3: app(flatten(),app(app(node(),x),xs)) -> app(app(cons(),x),app(concat(),app(app(map(),flatten()),xs)))
    4: app(concat(),nil()) -> nil()
    5: app(concat(),app(app(cons(),x),xs)) -> app(app(append(),x),app(concat(),xs))
    6: app(app(append(),nil()),xs) -> xs
    7: app(app(append(),app(app(cons(),x),xs)),ys) -> app(app(cons(),x),app(app(append(),xs),ys))
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying app
1: app^2_map(f,nil()) -> nil()
2: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs))
3: app^1_flatten(app^2_node(x,xs)) -> app^2_cons(x,app^1_concat(app^2_map(flatten(),xs)))
4: app^1_concat(nil()) -> nil()
5: app^1_concat(app^2_cons(x,xs)) -> app^2_append(x,app^1_concat(xs))
6: app^2_append(nil(),xs) -> xs
7: app^2_append(app^2_cons(x,xs),ys) -> app^2_cons(x,app^2_append(xs,ys))
8: app(append(),_1) ->= app^1_append(_1)
9: app(app^1_append(_1),_2) ->= app^2_append(_1,_2)
10: app(cons(),_1) ->= app^1_cons(_1)
11: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2)
12: app(flatten(),_1) ->= app^1_flatten(_1)
13: app(map(),_1) ->= app^1_map(_1)
14: app(app^1_map(_1),_2) ->= app^2_map(_1,_2)
15: app(node(),_1) ->= app^1_node(_1)
16: app(app^1_node(_1),_2) ->= app^2_node(_1,_2)
17: app(concat(),_1) ->= app^1_concat(_1)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x)
   #2: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs)
   #3: #app(app^1_append(_1),_2) ->? #app^2_append(_1,_2)
   #4: #app(flatten(),_1) ->? #app^1_flatten(_1)
   #5: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2)
   #6: #app^2_append(app^2_cons(x,xs),ys) -> #app^2_append(xs,ys)
   #7: #app^1_concat(app^2_cons(x,xs)) -> #app^2_append(x,app^1_concat(xs))
   #8: #app^1_concat(app^2_cons(x,xs)) -> #app^1_concat(xs)
   #9: #app(concat(),_1) ->? #app^1_concat(_1)
   #10: #app^1_flatten(app^2_node(x,xs)) -> #app^1_concat(app^2_map(flatten(),xs))
   #11: #app^1_flatten(app^2_node(x,xs)) -> #app^2_map(flatten(),xs)
Number of SCCs: 3, DPs: 7
  SCC { #8 }
POLO(Sum)... succeeded.
      #app^1_flatten	w: 0
      flatten	w: 0
      app^1_cons	w: 0
      #app^2_map	w: 0
      app^1_flatten	w: 0
      app^1_append	w: 0
      app^1_concat	w: 0
      concat	w: 0
      #app^2_append	w: 0
      app^2_node	w: 0
      append	w: 0
      #app^1_concat	w: x1
      nil	w: 0
      #app	w: 0
      map	w: 0
      cons	w: 0
      app^1_map	w: 0
      app^2_cons	w: x2 + 1
      node	w: 0
      app^2_append	w: 0
      app^2_map	w: 0
      app	w: 0
      app^1_node	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 6
  SCC { #6 }
POLO(Sum)... succeeded.
      #app^1_flatten	w: 0
      flatten	w: 0
      app^1_cons	w: 0
      #app^2_map	w: 0
      app^1_flatten	w: 0
      app^1_append	w: 0
      app^1_concat	w: 0
      concat	w: 0
      #app^2_append	w: x1
      app^2_node	w: 0
      append	w: 0
      #app^1_concat	w: 0
      nil	w: 0
      #app	w: 0
      map	w: 0
      cons	w: 0
      app^1_map	w: 0
      app^2_cons	w: x2 + 1
      node	w: 0
      app^2_append	w: 0
      app^2_map	w: 0
      app	w: 0
      app^1_node	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 1, DPs: 5
  SCC { #1 #2 #4 #5 #11 }
POLO(Sum)... succeeded.
      #app^1_flatten	w: 1
      flatten	w: 1
      app^1_cons	w: 0
      #app^2_map	w: x1
      app^1_flatten	w: 0
      app^1_append	w: 0
      app^1_concat	w: 0
      concat	w: 0
      #app^2_append	w: 0
      app^2_node	w: 1
      append	w: 0
      #app^1_concat	w: 0
      nil	w: 0
      #app	w: x1
      map	w: 0
      cons	w: 0
      app^1_map	w: x1 + 1
      app^2_cons	w: 1
      node	w: 0
      app^2_append	w: 0
      app^2_map	w: 0
      app	w: 0
      app^1_node	w: 0
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 1, DPs: 4
  SCC { #1 #2 #4 #11 }
POLO(Sum)... succeeded.
      #app^1_flatten	w: x1
      flatten	w: 1
      app^1_cons	w: 0
      #app^2_map	w: x2 + 1
      app^1_flatten	w: 0
      app^1_append	w: 0
      app^1_concat	w: 0
      concat	w: 0
      #app^2_append	w: 0
      app^2_node	w: x2 + 2
      append	w: 0
      #app^1_concat	w: 0
      nil	w: 0
      #app	w: x2 + 1
      map	w: 0
      cons	w: 0
      app^1_map	w: 1
      app^2_cons	w: x1 + x2 + 1
      node	w: 0
      app^2_append	w: 0
      app^2_map	w: 0
      app	w: 0
      app^1_node	w: 0
    USABLE RULES: { }
    Removed DPs: #1 #2 #4 #11
Number of SCCs: 0, DPs: 0