- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(:,app(app(:,x),y)),z) -> app(app(:,x),app(app(:,y),z)) [2] app(app(:,app(app(+,x),y)),z) -> app(app(+,app(app(:,x),z)),app(app(:,y),z)) [3] app(app(:,z),app(app(+,x),app(f,y))) -> app(app(:,app(app(g,z),y)),app(app(+,x),a)) [4] app(app(map,f),nil) -> nil [5] app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) [6] app(app(filter,f),nil) -> nil [7] app(app(filter,f),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(f,x)),f),x),xs) [8] app(app(app(app(filter2,true),f),x),xs) -> app(app(cons,x),app(app(filter,f),xs)) [9] app(app(app(app(filter2,false),f),x),xs) -> app(app(filter,f),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),f),x),xs) >= app(app(cons,x), app(app(filter,f),xs)) ; app(app(app(app(filter2,false),f),x),xs) >= app(app(filter,f),xs) ; app(app(:,app(app(:,x),y)),z) >= app(app(:,x),app(app(:,y),z)) ; app(app(:,app(app(+,x),y)),z) >= app(app(+,app(app(:,x),z)),app(app(:,y),z)) ; app(app(:,z),app(app(+,x),app(f,y))) >= app(app(:,app(app(g,z),y)), app(app(+,x),a)) ; app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) ; app(app(map,f),nil) >= nil ; app(app(filter,f),app(app(cons,x),xs)) >= app(app(app(app(filter2,app(f,x)), f),x),xs) ; app(app(filter,f),nil) >= nil ; Marked_app(app(app(app(filter2,true),f),x),xs) >= Marked_app(app(cons,x), app(app(filter,f),xs)) ; Marked_app(app(app(app(filter2,true),f),x),xs) >= Marked_app(app(filter,f), xs) ; Marked_app(app(app(app(filter2,false),f),x),xs) >= Marked_app(app(filter,f), xs) ; Marked_app(app(:,app(app(:,x),y)),z) >= Marked_app(app(:,x),app(app(:,y),z)) ; Marked_app(app(:,app(app(:,x),y)),z) >= Marked_app(app(:,y),z) ; Marked_app(app(:,app(app(+,x),y)),z) >= Marked_app(app(:,x),z) ; Marked_app(app(:,app(app(+,x),y)),z) >= Marked_app(app(:,y),z) ; Marked_app(app(:,app(app(+,x),y)),z) >= Marked_app(app(+,app(app(:,x),z)), app(app(:,y),z)) ; Marked_app(app(:,z),app(app(+,x),app(f,y))) >= Marked_app(app(:, app(app(g,z),y)), app(app(+,x),a)) ; Marked_app(app(:,z),app(app(+,x),app(f,y))) >= Marked_app(app(+,x),a) ; Marked_app(app(:,z),app(app(+,x),app(f,y))) >= Marked_app(app(g,z),y) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(map,f),xs) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(f,x) ; Marked_app(app(filter,f),app(app(cons,x),xs)) >= Marked_app(app(app( app( filter2, app(f,x)), f), x),xs) ; Marked_app(app(filter,f),app(app(cons,x),xs)) >= Marked_app(app(app( filter2, app(f,x)), f),x) ; Marked_app(app(filter,f),app(app(cons,x),xs)) >= Marked_app(app(filter2, app(f,x)), f) ; Marked_app(app(filter,f),app(app(cons,x),xs)) >= Marked_app(f,x) ; } + Disjunctions:{ { Marked_app(app(app(app(filter2,true),f),x),xs) > Marked_app(app(cons,x), app(app(filter,f),xs)) ; } { Marked_app(app(app(app(filter2,true),f),x),xs) > Marked_app(app(filter,f),xs) ; } { Marked_app(app(app(app(filter2,false),f),x),xs) > Marked_app(app(filter,f), xs) ; } { Marked_app(app(:,app(app(:,x),y)),z) > Marked_app(app(:,x),app(app(:,y),z)) ; } { Marked_app(app(:,app(app(:,x),y)),z) > Marked_app(app(:,y),z) ; } { Marked_app(app(:,app(app(+,x),y)),z) > Marked_app(app(:,x),z) ; } { Marked_app(app(:,app(app(+,x),y)),z) > Marked_app(app(:,y),z) ; } { Marked_app(app(:,app(app(+,x),y)),z) > Marked_app(app(+,app(app(:,x),z)), app(app(:,y),z)) ; } { Marked_app(app(:,z),app(app(+,x),app(f,y))) > Marked_app(app(:, app(app(g,z),y)), app(app(+,x),a)) ; } { Marked_app(app(:,z),app(app(+,x),app(f,y))) > Marked_app(app(+,x),a) ; } { Marked_app(app(:,z),app(app(+,x),app(f,y))) > Marked_app(app(g,z),y) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(map,f),xs) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(f,x) ; } { Marked_app(app(filter,f),app(app(cons,x),xs)) > Marked_app(app(app( app( filter2, app(f,x)), f), x),xs) ; } { Marked_app(app(filter,f),app(app(cons,x),xs)) > Marked_app(app(app( filter2, app(f,x)), f),x) ; } { Marked_app(app(filter,f),app(app(cons,x),xs)) > Marked_app(app(filter2, app(f,x)), f) ; } { Marked_app(app(filter,f),app(app(cons,x),xs)) > Marked_app(f,x) ; } } === 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 : 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 Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === 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 42.990380 seconds (real time) Cime Exit Status: 0