- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] isEmpty(nil) -> true [2] isEmpty(cons(x,xs)) -> false [3] last(cons(x,nil)) -> x [4] last(cons(x,cons(y,ys))) -> last(cons(y,ys)) [5] dropLast(nil) -> nil [6] dropLast(cons(x,nil)) -> nil [7] dropLast(cons(x,cons(y,ys))) -> cons(x,dropLast(cons(y,ys))) [8] append(nil,ys) -> ys [9] append(cons(x,xs),ys) -> cons(x,append(xs,ys)) [10] reverse(xs) -> rev(xs,nil) [11] rev(xs,ys) -> if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) [12] if(true,xs,ys,zs) -> zs [13] if(false,xs,ys,zs) -> rev(xs,ys) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 4 components: { --> --> } { --> } { --> } { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { isEmpty(nil) >= true ; isEmpty(cons(x,xs)) >= false ; last(cons(x,nil)) >= x ; last(cons(x,cons(y,ys))) >= last(cons(y,ys)) ; dropLast(nil) >= nil ; dropLast(cons(x,nil)) >= nil ; dropLast(cons(x,cons(y,ys))) >= cons(x,dropLast(cons(y,ys))) ; append(nil,ys) >= ys ; append(cons(x,xs),ys) >= cons(x,append(xs,ys)) ; rev(xs,ys) >= if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) ; reverse(xs) >= rev(xs,nil) ; if(true,xs,ys,zs) >= zs ; if(false,xs,ys,zs) >= rev(xs,ys) ; Marked_if(false,xs,ys,zs) >= Marked_rev(xs,ys) ; Marked_rev(xs,ys) >= Marked_if(isEmpty(xs),dropLast(xs),append(ys,last(xs)), ys) ; } + Disjunctions:{ { Marked_if(false,xs,ys,zs) > Marked_rev(xs,ys) ; } { Marked_rev(xs,ys) > Marked_if(isEmpty(xs),dropLast(xs),append(ys,last(xs)), ys) ; } } === 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 : 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 (Simple graph) Found the following constraints: { isEmpty(nil) >= true ; isEmpty(cons(x,xs)) >= false ; last(cons(x,nil)) >= x ; last(cons(x,cons(y,ys))) >= last(cons(y,ys)) ; dropLast(nil) >= nil ; dropLast(cons(x,nil)) >= nil ; dropLast(cons(x,cons(y,ys))) >= cons(x,dropLast(cons(y,ys))) ; append(nil,ys) >= ys ; append(cons(x,xs),ys) >= cons(x,append(xs,ys)) ; rev(xs,ys) >= if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) ; reverse(xs) >= rev(xs,nil) ; if(true,xs,ys,zs) >= zs ; if(false,xs,ys,zs) >= rev(xs,ys) ; Marked_if(false,xs,ys,zs) >= Marked_rev(xs,ys) ; Marked_rev(xs,ys) > Marked_if(isEmpty(xs),dropLast(xs),append(ys,last(xs)), ys) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { isEmpty(nil) >= true ; isEmpty(cons(x,xs)) >= false ; last(cons(x,nil)) >= x ; last(cons(x,cons(y,ys))) >= last(cons(y,ys)) ; dropLast(nil) >= nil ; dropLast(cons(x,nil)) >= nil ; dropLast(cons(x,cons(y,ys))) >= cons(x,dropLast(cons(y,ys))) ; append(nil,ys) >= ys ; append(cons(x,xs),ys) >= cons(x,append(xs,ys)) ; rev(xs,ys) >= if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) ; reverse(xs) >= rev(xs,nil) ; if(true,xs,ys,zs) >= zs ; if(false,xs,ys,zs) >= rev(xs,ys) ; Marked_if(false,xs,ys,zs) >= Marked_rev(xs,ys) ; Marked_rev(xs,ys) > Marked_if(isEmpty(xs),dropLast(xs),append(ys,last(xs)), ys) ; } + Disjunctions:{ } === 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 === No solution found for these parameters.(34596 bt (36580) [2497]) === 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 6.180086 seconds (real time) Cime Exit Status: 0