- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(map,f),nil) -> nil [2] app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) [3] app(app(append,xs),nil) -> xs [4] app(app(append,nil),ys) -> ys [5] app(app(append,app(app(cons,x),xs)),ys) -> app(app(cons,x),app(app(append,xs),ys)) [6] app(app(zip,nil),yss) -> yss [7] app(app(zip,xss),nil) -> xss [8] app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) -> app(app(cons,app(app(append,xs),ys)),app(app(zip,xss),yss)) [9] app(app(combine,xs),nil) -> xs [10] app(app(combine,xs),app(app(cons,ys),yss)) -> app(app(combine,app(app(zip,xs),ys)),yss) [11] app(levels,app(app(node,x),xs)) -> app(app(cons,app(app(cons,x),nil)), app(app(combine,nil),app(app(map,levels),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(map,f),nil) >= nil ; app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) ; app(app(append,nil),ys) >= ys ; app(app(append,app(app(cons,x),xs)),ys) >= app(app(cons,x), app(app(append,xs),ys)) ; app(app(append,xs),nil) >= xs ; app(app(zip,nil),yss) >= yss ; app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) >= app(app( cons, app( app( append, xs), ys)), app(app( zip, xss), yss)) ; app(app(zip,xss),nil) >= xss ; app(app(combine,xs),nil) >= xs ; app(app(combine,xs),app(app(cons,ys),yss)) >= app(app(combine, app(app(zip,xs),ys)), yss) ; app(levels,app(app(node,x),xs)) >= app(app(cons,app(app(cons,x),nil)), app(app(combine,nil), app(app(map,levels),xs))) ; 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(append,app(app(cons,x),xs)),ys) >= Marked_app(app(cons,x), app(app(append,xs),ys)) ; Marked_app(app(append,app(app(cons,x),xs)),ys) >= Marked_app(app(append,xs), ys) ; Marked_app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) >= Marked_app(app(cons,app(app(append,xs),ys)),app(app(zip,xss),yss)) ; Marked_app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) >= Marked_app(app(append,xs),ys) ; Marked_app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) >= Marked_app(app(zip,xss),yss) ; Marked_app(app(combine,xs),app(app(cons,ys),yss)) >= Marked_app(app(zip,xs), ys) ; Marked_app(app(combine,xs),app(app(cons,ys),yss)) >= Marked_app(app( combine, app( app( zip, xs), ys)), yss) ; Marked_app(levels,app(app(node,x),xs)) >= Marked_app(app(map,levels),xs) ; Marked_app(levels,app(app(node,x),xs)) >= Marked_app(app(cons, app(app(cons,x),nil)), app(app(combine,nil), app(app(map,levels),xs))) ; Marked_app(levels,app(app(node,x),xs)) >= Marked_app(app(cons,x),nil) ; Marked_app(levels,app(app(node,x),xs)) >= Marked_app(app(combine,nil), app(app(map,levels),xs)) ; } + Disjunctions:{ { 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(append,app(app(cons,x),xs)),ys) > Marked_app(app(cons,x), app(app(append,xs),ys)) ; } { Marked_app(app(append,app(app(cons,x),xs)),ys) > Marked_app(app(append,xs), ys) ; } { Marked_app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) > Marked_app(app(cons,app(app(append,xs),ys)),app(app(zip,xss),yss)) ; } { Marked_app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) > Marked_app(app(append,xs),ys) ; } { Marked_app(app(zip,app(app(cons,xs),xss)),app(app(cons,ys),yss)) > Marked_app(app(zip,xss),yss) ; } { Marked_app(app(combine,xs),app(app(cons,ys),yss)) > Marked_app(app(zip,xs), ys) ; } { Marked_app(app(combine,xs),app(app(cons,ys),yss)) > Marked_app(app( combine, app( app( zip, xs), ys)), yss) ; } { Marked_app(levels,app(app(node,x),xs)) > Marked_app(app(map,levels),xs) ; } { Marked_app(levels,app(app(node,x),xs)) > Marked_app(app(cons, app(app(cons,x),nil)), app(app(combine,nil), app(app(map,levels),xs))) ; } { Marked_app(levels,app(app(node,x),xs)) > Marked_app(app(cons,x),nil) ; } { Marked_app(levels,app(app(node,x),xs)) > Marked_app(app(combine,nil), app(app(map,levels),xs)) ; } } === 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 : 15.000000 === Entering poly_solver Starting Sat solver initialization === STOPING TIMER virtual === Time out 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 50.525592 seconds (real time) Cime Exit Status: 0