- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] zeros -> cons(0,n__zeros) [2] U11(tt,L) -> U12(tt,activate(L)) [3] U12(tt,L) -> s(length(activate(L))) [4] U21(tt,IL,M,N) -> U22(tt,activate(IL),activate(M),activate(N)) [5] U22(tt,IL,M,N) -> U23(tt,activate(IL),activate(M),activate(N)) [6] U23(tt,IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) [7] length(nil) -> 0 [8] length(cons(N,L)) -> U11(tt,activate(L)) [9] take(0,IL) -> nil [10] take(s(M),cons(N,IL)) -> U21(tt,activate(IL),M,N) [11] zeros -> n__zeros [12] take(X1,X2) -> n__take(X1,X2) [13] activate(n__zeros) -> zeros [14] activate(n__take(X1,X2)) -> take(activate(X1),activate(X2)) [15] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { zeros >= cons(0,n__zeros) ; zeros >= n__zeros ; U12(tt,L) >= s(length(activate(L))) ; activate(n__zeros) >= zeros ; activate(n__take(X1,X2)) >= take(activate(X1),activate(X2)) ; activate(X) >= X ; U11(tt,L) >= U12(tt,activate(L)) ; length(cons(N,L)) >= U11(tt,activate(L)) ; length(nil) >= 0 ; U22(tt,IL,M,N) >= U23(tt,activate(IL),activate(M),activate(N)) ; U21(tt,IL,M,N) >= U22(tt,activate(IL),activate(M),activate(N)) ; U23(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= nil ; take(s(M),cons(N,IL)) >= U21(tt,activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; Marked_length(cons(N,L)) >= Marked_U11(tt,activate(L)) ; Marked_U11(tt,L) >= Marked_U12(tt,activate(L)) ; Marked_U12(tt,L) >= Marked_length(activate(L)) ; } + Disjunctions:{ { Marked_length(cons(N,L)) > Marked_U11(tt,activate(L)) ; } { Marked_U11(tt,L) > Marked_U12(tt,activate(L)) ; } { Marked_U12(tt,L) > Marked_length(activate(L)) ; } } === 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 === Time out for these parameters. === 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 26.266579 seconds (real time) Cime Exit Status: 0