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


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


YES
Input TRS:
    1: app(f(),a()) -> app(f(),b())
    2: app(g(),b()) -> app(g(),a())
    3: app(app(map(),fun),nil()) -> nil()
    4: app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs))
    5: app(app(filter(),fun),nil()) -> nil()
    6: app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs)
    7: app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs))
    8: app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs)
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying app^1_g app
1: app^1_f(a()) -> app^1_f(b())
2: app^1_g^1_b() -> app^1_g^1_a()
3: app^2_map(fun,nil()) -> nil()
4: app^2_map(fun,app^2_cons(x,xs)) -> app^2_cons(app(fun,x),app^2_map(fun,xs))
5: app^2_filter(fun,nil()) -> nil()
6: app^2_filter(fun,app^2_cons(x,xs)) -> app^4_filter2(app(fun,x),fun,x,xs)
7: app^4_filter2(true(),fun,x,xs) -> app^2_cons(x,app^2_filter(fun,xs))
8: app^4_filter2(false(),fun,x,xs) -> app^2_filter(fun,xs)
9: app(cons(),_1) ->= app^1_cons(_1)
10: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2)
11: app(filter(),_1) ->= app^1_filter(_1)
12: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2)
13: app(map(),_1) ->= app^1_map(_1)
14: app(app^1_map(_1),_2) ->= app^2_map(_1,_2)
15: app(g(),_1) ->= app^1_g(_1)
16: app(f(),_1) ->= app^1_f(_1)
17: app(filter2(),_1) ->= app^1_filter2(_1)
18: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2)
19: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3)
20: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4)
21: app^1_g(a()) ->= app^1_g^1_a()
22: app^1_g(b()) ->= app^1_g^1_b()
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #app^2_filter(fun,app^2_cons(x,xs)) -> #app^4_filter2(app(fun,x),fun,x,xs)
   #2: #app^2_filter(fun,app^2_cons(x,xs)) -> #app(fun,x)
   #3: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2)
   #4: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2)
   #5: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4)
   #6: #app^4_filter2(true(),fun,x,xs) -> #app^2_filter(fun,xs)
   #7: #app^1_g(b()) ->? #app^1_g^1_b()
   #8: #app(f(),_1) ->? #app^1_f(_1)
   #9: #app^1_f(a()) -> #app^1_f(b())
   #10: #app^4_filter2(false(),fun,x,xs) -> #app^2_filter(fun,xs)
   #11: #app(g(),_1) ->? #app^1_g(_1)
   #12: #app^2_map(fun,app^2_cons(x,xs)) -> #app(fun,x)
   #13: #app^2_map(fun,app^2_cons(x,xs)) -> #app^2_map(fun,xs)
Number of SCCs: 1, DPs: 8
  SCC { #2..6 #10 #12 #13 }
POLO(Sum)... succeeded.
      a 	w: 0
      app^1_cons	w: 0
      #app^2_map	w: x1 + x2
      b 	w: 0
      #app^1_g	w: 0
      app^2_filter2	w: 0
      app^4_filter2	w: 0
      false	w: 1
      #app^1_f	w: 0
      app^1_filter2	w: 0
      true	w: 1
      f 	w: 0
      filter2	w: 0
      #app^1_g^1_b	w: 0
      #app^4_filter2	w: x1 + x2 + x4
      nil	w: 0
      #app	w: x1 + x2
      map	w: 0
      app^1_filter	w: x1 + 1
      app^1_g^1_b	w: 0
      cons	w: 0
      app^1_f	w: 0
      filter	w: 0
      app^3_filter2	w: x1 + x2 + x3 + 1
      app^2_filter	w: 0
      g 	w: 0
      app^1_map	w: x1 + 1
      app^2_cons	w: x1 + x2 + 1
      app^1_g^1_a	w: 0
      app^2_map	w: 0
      #app^2_filter	w: x1 + x2
      app	w: 0
      app^1_g	w: 0
    USABLE RULES: { }
    Removed DPs: #2..6 #10 #12 #13
Number of SCCs: 0, DPs: 0