- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] U11(tt,N,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) [2] U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) [3] afterNth(N,XS) -> snd(splitAt(N,XS)) [4] and(tt,X) -> activate(X) [5] fst(pair(X,Y)) -> X [6] head(cons(N,XS)) -> N [7] natsFrom(N) -> cons(N,n__natsFrom(n__s(N))) [8] sel(N,XS) -> head(afterNth(N,XS)) [9] snd(pair(X,Y)) -> Y [10] splitAt(0,XS) -> pair(nil,XS) [11] splitAt(s(N),cons(X,XS)) -> U11(tt,N,X,activate(XS)) [12] tail(cons(N,XS)) -> activate(XS) [13] take(N,XS) -> fst(splitAt(N,XS)) [14] natsFrom(X) -> n__natsFrom(X) [15] s(X) -> n__s(X) [16] activate(n__natsFrom(X)) -> natsFrom(activate(X)) [17] activate(n__s(X)) -> s(activate(X)) [18] 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: { U12(pair(YS,ZS),X) >= pair(cons(activate(X),YS),ZS) ; splitAt(0,XS) >= pair(nil,XS) ; splitAt(s(N),cons(X,XS)) >= U11(tt,N,X,activate(XS)) ; activate(n__natsFrom(X)) >= natsFrom(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(X) >= X ; U11(tt,N,X,XS) >= U12(splitAt(activate(N),activate(XS)),activate(X)) ; snd(pair(X,Y)) >= Y ; afterNth(N,XS) >= snd(splitAt(N,XS)) ; and(tt,X) >= activate(X) ; fst(pair(X,Y)) >= X ; head(cons(N,XS)) >= N ; natsFrom(N) >= cons(N,n__natsFrom(n__s(N))) ; natsFrom(X) >= n__natsFrom(X) ; sel(N,XS) >= head(afterNth(N,XS)) ; s(X) >= n__s(X) ; tail(cons(N,XS)) >= activate(XS) ; take(N,XS) >= fst(splitAt(N,XS)) ; Marked_splitAt(s(N),cons(X,XS)) >= Marked_U11(tt,N,X,activate(XS)) ; Marked_U11(tt,N,X,XS) >= Marked_splitAt(activate(N),activate(XS)) ; } + Disjunctions:{ { Marked_splitAt(s(N),cons(X,XS)) > Marked_U11(tt,N,X,activate(XS)) ; } { Marked_U11(tt,N,X,XS) > Marked_splitAt(activate(N),activate(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 === 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 27.043698 seconds (real time) Cime Exit Status: 0