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


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


MAYBE
Input TRS:
    1: app(app(app(fold(),f),x),nil()) -> x
    2: app(app(app(fold(),f),x),app(app(cons(),y),z)) -> app(app(f,y),app(app(app(fold(),f),x),z))
    3: app(app(plus(),0()),y) -> y
    4: app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
    5: app(app(times(),0()),y) -> 0()
    6: app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
    7: sum() -> app(app(fold(),add()),0())
    8: prod() -> app(app(fold(),mul()),app(s(),0()))
Number of strict rules: 8
Direct poly ... failed.
Freezing app
1: app❆3_fold(f,x,nil()) -> x
2: app❆3_fold(f,x,app❆2_cons(y,z)) -> app(app(f,y),app❆3_fold(f,x,z))
3: app❆2_plus(0(),y) -> y
4: app❆2_plus(app❆1_s(x),y) -> app❆1_s(app❆2_plus(x,y))
5: app❆2_times(0(),y) -> 0()
6: app❆2_times(app❆1_s(x),y) -> app❆2_plus(app❆2_times(x,y),y)
7: sum() -> app❆2_fold(add(),0())
8: prod() -> app❆2_fold(mul(),app❆1_s(0()))
9: app(plus(),_1) ->= app❆1_plus(_1)
10: app(app❆1_plus(_1),_2) ->= app❆2_plus(_1,_2)
11: app(cons(),_1) ->= app❆1_cons(_1)
12: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2)
13: app(times(),_1) ->= app❆1_times(_1)
14: app(app❆1_times(_1),_2) ->= app❆2_times(_1,_2)
15: app(s(),_1) ->= app❆1_s(_1)
16: app(fold(),_1) ->= app❆1_fold(_1)
17: app(app❆1_fold(_1),_2) ->= app❆2_fold(_1,_2)
18: app(app❆2_fold(_1,_2),_3) ->= app❆3_fold(_1,_2,_3)
Number of strict rules: 8
Direct poly ... failed.
Dependency Pairs:
   #1: #app❆3_fold(f,x,app❆2_cons(y,z)) -> #app(app(f,y),app❆3_fold(f,x,z))
   #2: #app❆3_fold(f,x,app❆2_cons(y,z)) -> #app(f,y)
   #3: #app❆3_fold(f,x,app❆2_cons(y,z)) -> #app❆3_fold(f,x,z)
   #4: #app❆2_times(app❆1_s(x),y) -> #app❆2_plus(app❆2_times(x,y),y)
   #5: #app❆2_times(app❆1_s(x),y) -> #app❆2_times(x,y)
   #6: #app(app❆1_times(_1),_2) ->? #app❆2_times(_1,_2)
   #7: #app(app❆1_plus(_1),_2) ->? #app❆2_plus(_1,_2)
   #8: #app❆2_plus(app❆1_s(x),y) -> #app❆2_plus(x,y)
   #9: #app(app❆2_fold(_1,_2),_3) ->? #app❆3_fold(_1,_2,_3)
Number of SCCs: 3, DPs: 6
	SCC { #5 }
Sum... succeeded.
  mul()		w: (0)
  prod()		w: (0)
  s()		w: (0)
  app❆1_plus(x1)		w: (0)
  #prod()		w: (0)
  app❆2_plus(x1,x2)		w: (0)
  app❆3_fold(x1,x2,x3)		w: (0)
  #app❆3_fold(x1,x2,x3)		w: (0)
  sum()		w: (0)
  app❆2_fold(x1,x2)		w: (0)
  0()		w: (0)
  #app❆2_plus(x1,x2)		w: (0)
  times()		w: (0)
  nil()		w: (0)
  #app(x1,x2)		w: (0)
  fold()		w: (0)
  #app❆2_times(x1,x2)		w: (x1)
  plus()		w: (0)
  cons()		w: (0)
  app❆2_cons(x1,x2)		w: (0)
  app❆2_times(x1,x2)		w: (0)
  add()		w: (0)
  app❆1_s(x1)		w: (1 + x1)
  #sum()		w: (0)
  app❆1_cons(x1)		w: (0)
  app❆1_fold(x1)		w: (0)
  app❆1_times(x1)		w: (0)
  app(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 2, DPs: 5
	SCC { #8 }
Sum... succeeded.
  mul()		w: (0)
  prod()		w: (0)
  s()		w: (0)
  app❆1_plus(x1)		w: (0)
  #prod()		w: (0)
  app❆2_plus(x1,x2)		w: (0)
  app❆3_fold(x1,x2,x3)		w: (0)
  #app❆3_fold(x1,x2,x3)		w: (0)
  sum()		w: (0)
  app❆2_fold(x1,x2)		w: (0)
  0()		w: (0)
  #app❆2_plus(x1,x2)		w: (x1)
  times()		w: (0)
  nil()		w: (0)
  #app(x1,x2)		w: (0)
  fold()		w: (0)
  #app❆2_times(x1,x2)		w: (0)
  plus()		w: (0)
  cons()		w: (0)
  app❆2_cons(x1,x2)		w: (0)
  app❆2_times(x1,x2)		w: (0)
  add()		w: (0)
  app❆1_s(x1)		w: (1 + x1)
  #sum()		w: (0)
  app❆1_cons(x1)		w: (0)
  app❆1_fold(x1)		w: (0)
  app❆1_times(x1)		w: (0)
  app(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 1, DPs: 4
	SCC { #1..3 #9 }
Sum... Max... succeeded.
  mul()		w: (0)
  prod()		w: (0)
  s()		w: (0)
  app❆1_plus(x1)		w: (1)
  #prod()		w: (0)
  app❆2_plus(x1,x2)		w: (max{x2, 0})
  app❆3_fold(x1,x2,x3)		w: (max{x3, 282 + x2, 12272 + x1})
  #app❆3_fold(x1,x2,x3)		w: (max{51150 + x3, 57286 + x2, 63422 + x1})
  sum()		w: (0)
  app❆2_fold(x1,x2)		w: (max{x2, 6136 + x1})
  0()		w: (1143)
  #app❆2_plus(x1,x2)		w: (0)
  times()		w: (0)
  nil()		w: (0)
  #app(x1,x2)		w: (max{51150 + x2, 57286 + x1})
  fold()		w: (0)
  #app❆2_times(x1,x2)		w: (0)
  plus()		w: (0)
  cons()		w: (0)
  app❆2_cons(x1,x2)		w: (max{x2, 6136 + x1})
  app❆2_times(x1,x2)		w: (max{x2, 1 + x1})
  add()		w: (0)
  app❆1_s(x1)		w: (x1)
  #sum()		w: (0)
  app❆1_cons(x1)		w: (x1)
  app❆1_fold(x1)		w: (x1)
  app❆1_times(x1)		w: (x1)
  app(x1,x2)		w: (max{x2, 6136 + x1})
    USABLE RULES: { 1..6 9..18 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 3
	SCC { #1 #3 #9 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.