/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),nil()),x) -> x
    2: app(app(app(fold(),f),app(app(cons(),h),t)),x) -> app(app(app(fold(),f),t),app(app(f,x),h))
    3: app(sum(),l) -> app(app(app(fold(),add()),l),0())
    4: app(app(app(fold(),mul()),l),1()) -> app(prod(),l)
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying app
1: app^3_fold(f,nil(),x) -> x
2: app^3_fold(f,app^2_cons(h,t),x) -> app^3_fold(f,t,app(app(f,x),h))
3: app^1_sum(l) -> app^3_fold(add(),l,0())
4: app^3_fold(mul(),l,1()) -> app^1_prod(l)
5: app(prod(),_1) ->= app^1_prod(_1)
6: app(cons(),_1) ->= app^1_cons(_1)
7: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2)
8: app(fold(),_1) ->= app^1_fold(_1)
9: app(app^1_fold(_1),_2) ->= app^2_fold(_1,_2)
10: app(app^2_fold(_1,_2),_3) ->= app^3_fold(_1,_2,_3)
11: app(sum(),_1) ->= app^1_sum(_1)
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #app^3_fold(f,app^2_cons(h,t),x) -> #app^3_fold(f,t,app(app(f,x),h))
   #2: #app^3_fold(f,app^2_cons(h,t),x) -> #app(app(f,x),h)
   #3: #app^3_fold(f,app^2_cons(h,t),x) -> #app(f,x)
   #4: #app(sum(),_1) ->? #app^1_sum(_1)
   #5: #app(app^2_fold(_1,_2),_3) ->? #app^3_fold(_1,_2,_3)
   #6: #app^1_sum(l) -> #app^3_fold(add(),l,0())
Number of SCCs: 1, DPs: 6
  SCC { #1..6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.