- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(max,0),x) -> x [2] app(app(max,x),0) -> x [3] app(app(max,app(s,x)),app(s,y)) -> app(app(max,x),y) [4] app(app(min,0),x) -> 0 [5] app(app(min,x),0) -> 0 [6] app(app(min,app(s,x)),app(s,y)) -> app(app(min,x),y) [7] app(app(app(app(insert,f),g),nil),x) -> app(app(cons,x),nil) [8] app(app(app(app(insert,f),g),app(app(cons,h),t)),x) -> app(app(cons,app(app(f,x),h)), app(app(app(app(insert,f),g),t),app(app(g,x),h))) [9] app(app(app(sort,f),g),nil) -> nil [10] app(app(app(sort,f),g),app(app(cons,h),t)) -> app(app(app(app(insert,f),g),app(app(app(sort,f),g),t)),h) [11] app(ascending_sort,l) -> app(app(app(sort,min),max),l) [12] app(descending_sort,l) -> app(app(app(sort,max),min),l) 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(insert,f),g),app(app(cons,h),t)),x) >= app(app(cons, app(app(f,x),h)), app(app(app( app( insert, f), g), t), app(app(g,x),h))) ; app(app(app(app(insert,f),g),nil),x) >= app(app(cons,x),nil) ; app(app(app(sort,f),g),app(app(cons,h),t)) >= app(app(app(app(insert,f),g), app(app(app(sort,f),g),t)), h) ; app(app(app(sort,f),g),nil) >= nil ; app(app(max,app(s,x)),app(s,y)) >= app(app(max,x),y) ; app(app(max,0),x) >= x ; app(app(max,x),0) >= x ; app(app(min,app(s,x)),app(s,y)) >= app(app(min,x),y) ; app(app(min,0),x) >= 0 ; app(app(min,x),0) >= 0 ; app(ascending_sort,l) >= app(app(app(sort,min),max),l) ; app(descending_sort,l) >= app(app(app(sort,max),min),l) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app( app( app( app( insert, f), g), t), app( app(g,x), h)) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app( app( app( insert, f), g), t) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app( app( cons, app( app(f,x), h)), app( app( app( app( insert, f), g), t), app( app(g,x), h))) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app( app( f,x), h) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app( app( g,x), h) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app(f,x) ; Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) >= Marked_app(g,x) ; Marked_app(app(app(app(insert,f),g),nil),x) >= Marked_app(app(cons,x),nil) ; Marked_app(app(app(sort,f),g),app(app(cons,h),t)) >= Marked_app(app( app( app( insert, f), g), app( app( app( sort, f), g), t)), h) ; Marked_app(app(app(sort,f),g),app(app(cons,h),t)) >= Marked_app(app( app( insert, f), g), app(app(app(sort,f),g), t)) ; Marked_app(app(app(sort,f),g),app(app(cons,h),t)) >= Marked_app(app( app( sort, f), g), t) ; Marked_app(app(app(sort,f),g),app(app(cons,h),t)) >= Marked_app(app(insert,f), g) ; Marked_app(app(max,app(s,x)),app(s,y)) >= Marked_app(app(max,x),y) ; Marked_app(app(min,app(s,x)),app(s,y)) >= Marked_app(app(min,x),y) ; Marked_app(ascending_sort,l) >= Marked_app(app(app(sort,min),max),l) ; Marked_app(ascending_sort,l) >= Marked_app(app(sort,min),max) ; Marked_app(descending_sort,l) >= Marked_app(app(app(sort,max),min),l) ; Marked_app(descending_sort,l) >= Marked_app(app(sort,max),min) ; } + Disjunctions:{ { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app( app(app( app( insert, f), g), t), app(app(g,x),h)) ; } { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app( app(app( insert, f), g),t) ; } { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app( app(cons, app( app(f,x), h)), app(app( app( app( insert, f), g), t), app( app(g,x), h))) ; } { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app( app(f, x),h) ; } { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app( app(g, x),h) ; } { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app(f,x) ; } { Marked_app(app(app(app(insert,f),g),app(app(cons,h),t)),x) > Marked_app(g,x) ; } { Marked_app(app(app(app(insert,f),g),nil),x) > Marked_app(app(cons,x),nil) ; } { Marked_app(app(app(sort,f),g),app(app(cons,h),t)) > Marked_app(app( app( app( insert, f), g), app( app( app( sort, f), g), t)), h) ; } { Marked_app(app(app(sort,f),g),app(app(cons,h),t)) > Marked_app(app( app( insert, f), g), app(app(app(sort,f),g), t)) ; } { Marked_app(app(app(sort,f),g),app(app(cons,h),t)) > Marked_app(app( app( sort, f), g), t) ; } { Marked_app(app(app(sort,f),g),app(app(cons,h),t)) > Marked_app(app(insert,f), g) ; } { Marked_app(app(max,app(s,x)),app(s,y)) > Marked_app(app(max,x),y) ; } { Marked_app(app(min,app(s,x)),app(s,y)) > Marked_app(app(min,x),y) ; } { Marked_app(ascending_sort,l) > Marked_app(app(app(sort,min),max),l) ; } { Marked_app(ascending_sort,l) > Marked_app(app(sort,min),max) ; } { Marked_app(descending_sort,l) > Marked_app(app(app(sort,max),min),l) ; } { Marked_app(descending_sort,l) > Marked_app(app(sort,max),min) ; } } === 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 === 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 timeout reached === 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 100.033676 seconds (real time) Cime Exit Status: 0