- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(f,app(app(cons,nil),y)) -> y [2] app(f,app(app(cons,app(f,app(app(cons,nil),y))),z)) -> app(app(app(copy,n),y),z) [3] app(app(app(copy,0),y),z) -> app(f,z) [4] app(app(app(copy,app(s,x)),y),z) -> app(app(app(copy,x),y),app(app(cons,app(f,y)),z)) [5] app(app(map,fun),nil) -> nil [6] app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) [7] app(app(filter,fun),nil) -> nil [8] app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) [9] app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) [10] app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(app(app(filter2,true),fun),x),xs) >= app(app(cons,x), app(app(filter,fun),xs)) ; app(app(app(app(filter2,false),fun),x),xs) >= app(app(filter,fun),xs) ; app(app(app(copy,app(s,x)),y),z) >= app(app(app(copy,x),y), app(app(cons,app(f,y)),z)) ; app(app(app(copy,0),y),z) >= app(f,z) ; app(app(map,fun),app(app(cons,x),xs)) >= app(app(cons,app(fun,x)), app(app(map,fun),xs)) ; app(app(map,fun),nil) >= nil ; app(app(filter,fun),app(app(cons,x),xs)) >= app(app(app(app(filter2, app(fun,x)), fun),x),xs) ; app(app(filter,fun),nil) >= nil ; app(f,app(app(cons,app(f,app(app(cons,nil),y))),z)) >= app(app(app(copy,n),y), z) ; app(f,app(app(cons,nil),y)) >= y ; Marked_app(app(app(app(filter2,true),fun),x),xs) >= Marked_app(app(cons,x), app(app(filter,fun),xs)) ; Marked_app(app(app(app(filter2,true),fun),x),xs) >= Marked_app(app( filter, fun), xs) ; Marked_app(app(app(app(filter2,false),fun),x),xs) >= Marked_app(app( filter, fun), xs) ; Marked_app(app(app(copy,app(s,x)),y),z) >= Marked_app(app(app(copy,x),y), app(app(cons,app(f,y)),z)) ; Marked_app(app(app(copy,app(s,x)),y),z) >= Marked_app(app(cons,app(f,y)),z) ; Marked_app(app(app(copy,app(s,x)),y),z) >= Marked_app(app(copy,x),y) ; Marked_app(app(app(copy,app(s,x)),y),z) >= Marked_app(f,y) ; Marked_app(app(app(copy,0),y),z) >= Marked_app(f,z) ; Marked_app(app(map,fun),app(app(cons,x),xs)) >= Marked_app(app(cons, app(fun,x)), app(app(map,fun),xs)) ; Marked_app(app(map,fun),app(app(cons,x),xs)) >= Marked_app(app(map,fun),xs) ; Marked_app(app(map,fun),app(app(cons,x),xs)) >= Marked_app(fun,x) ; Marked_app(app(filter,fun),app(app(cons,x),xs)) >= Marked_app(app(app( app( filter2, app(fun,x)), fun), x),xs) ; Marked_app(app(filter,fun),app(app(cons,x),xs)) >= Marked_app(app(app( filter2, app(fun,x)), fun), x) ; Marked_app(app(filter,fun),app(app(cons,x),xs)) >= Marked_app(app(filter2, app(fun,x)), fun) ; Marked_app(app(filter,fun),app(app(cons,x),xs)) >= Marked_app(fun,x) ; Marked_app(f,app(app(cons,app(f,app(app(cons,nil),y))),z)) >= Marked_app( app( app( copy, n), y), z) ; Marked_app(f,app(app(cons,app(f,app(app(cons,nil),y))),z)) >= Marked_app( app( copy, n), y) ; } + Disjunctions:{ { Marked_app(app(app(app(filter2,true),fun),x),xs) > Marked_app(app(cons,x), app(app(filter,fun),xs)) ; } { Marked_app(app(app(app(filter2,true),fun),x),xs) > Marked_app(app(filter,fun), xs) ; } { Marked_app(app(app(app(filter2,false),fun),x),xs) > Marked_app(app( filter, fun), xs) ; } { Marked_app(app(app(copy,app(s,x)),y),z) > Marked_app(app(app(copy,x),y), app(app(cons,app(f,y)),z)) ; } { Marked_app(app(app(copy,app(s,x)),y),z) > Marked_app(app(cons,app(f,y)),z) ; } { Marked_app(app(app(copy,app(s,x)),y),z) > Marked_app(app(copy,x),y) ; } { Marked_app(app(app(copy,app(s,x)),y),z) > Marked_app(f,y) ; } { Marked_app(app(app(copy,0),y),z) > Marked_app(f,z) ; } { Marked_app(app(map,fun),app(app(cons,x),xs)) > Marked_app(app(cons, app(fun,x)), app(app(map,fun),xs)) ; } { Marked_app(app(map,fun),app(app(cons,x),xs)) > Marked_app(app(map,fun),xs) ; } { Marked_app(app(map,fun),app(app(cons,x),xs)) > Marked_app(fun,x) ; } { Marked_app(app(filter,fun),app(app(cons,x),xs)) > Marked_app(app(app( app( filter2, app(fun,x)), fun), x),xs) ; } { Marked_app(app(filter,fun),app(app(cons,x),xs)) > Marked_app(app(app( filter2, app(fun,x)), fun), x) ; } { Marked_app(app(filter,fun),app(app(cons,x),xs)) > Marked_app(app(filter2, app(fun,x)), fun) ; } { Marked_app(app(filter,fun),app(app(cons,x),xs)) > Marked_app(fun,x) ; } { Marked_app(f,app(app(cons,app(f,app(app(cons,nil),y))),z)) > Marked_app( app(app(copy,n), y),z) ; } { Marked_app(f,app(app(cons,app(f,app(app(cons,nil),y))),z)) > Marked_app( app(copy, n),y) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) NOT SOLVED No proof found Cime worked for 82.112685 seconds (real time) Cime Exit Status: 0