- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(nil,YS) -> YS [2] app(cons(X,XS),YS) -> cons(X,n__app(activate(XS),YS)) [3] from(X) -> cons(X,n__from(n__s(X))) [4] zWadr(nil,YS) -> nil [5] zWadr(XS,nil) -> nil [6] zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,n__nil)),n__zWadr(activate(XS),activate(YS))) [7] prefix(L) -> cons(nil,n__zWadr(L,n__prefix(L))) [8] app(X1,X2) -> n__app(X1,X2) [9] from(X) -> n__from(X) [10] s(X) -> n__s(X) [11] nil -> n__nil [12] zWadr(X1,X2) -> n__zWadr(X1,X2) [13] prefix(X) -> n__prefix(X) [14] activate(n__app(X1,X2)) -> app(activate(X1),activate(X2)) [15] activate(n__from(X)) -> from(activate(X)) [16] activate(n__s(X)) -> s(activate(X)) [17] activate(n__nil) -> nil [18] activate(n__zWadr(X1,X2)) -> zWadr(activate(X1),activate(X2)) [19] activate(n__prefix(X)) -> prefix(activate(X)) [20] activate(X) -> X 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(nil,YS) >= YS ; app(cons(X,XS),YS) >= cons(X,n__app(activate(XS),YS)) ; app(X1,X2) >= n__app(X1,X2) ; nil >= n__nil ; activate(n__app(X1,X2)) >= app(activate(X1),activate(X2)) ; activate(n__from(X)) >= from(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(n__nil) >= nil ; activate(n__zWadr(X1,X2)) >= zWadr(activate(X1),activate(X2)) ; activate(n__prefix(X)) >= prefix(activate(X)) ; activate(X) >= X ; from(X) >= cons(X,n__from(n__s(X))) ; from(X) >= n__from(X) ; zWadr(nil,YS) >= nil ; zWadr(cons(X,XS),cons(Y,YS)) >= cons(app(Y,cons(X,n__nil)), n__zWadr(activate(XS),activate(YS))) ; zWadr(XS,nil) >= nil ; zWadr(X1,X2) >= n__zWadr(X1,X2) ; prefix(X) >= n__prefix(X) ; prefix(L) >= cons(nil,n__zWadr(L,n__prefix(L))) ; s(X) >= n__s(X) ; Marked_activate(n__app(X1,X2)) >= Marked_activate(X1) ; Marked_activate(n__app(X1,X2)) >= Marked_activate(X2) ; Marked_activate(n__app(X1,X2)) >= Marked_app(activate(X1),activate(X2)) ; Marked_activate(n__from(X)) >= Marked_activate(X) ; Marked_activate(n__s(X)) >= Marked_activate(X) ; Marked_activate(n__zWadr(X1,X2)) >= Marked_activate(X1) ; Marked_activate(n__zWadr(X1,X2)) >= Marked_activate(X2) ; Marked_activate(n__zWadr(X1,X2)) >= Marked_zWadr(activate(X1),activate(X2)) ; Marked_activate(n__prefix(X)) >= Marked_activate(X) ; Marked_zWadr(cons(X,XS),cons(Y,YS)) >= Marked_activate(YS) ; Marked_zWadr(cons(X,XS),cons(Y,YS)) >= Marked_activate(XS) ; Marked_zWadr(cons(X,XS),cons(Y,YS)) >= Marked_app(Y,cons(X,n__nil)) ; Marked_app(cons(X,XS),YS) >= Marked_activate(XS) ; } + Disjunctions:{ { Marked_activate(n__app(X1,X2)) > Marked_activate(X1) ; } { Marked_activate(n__app(X1,X2)) > Marked_activate(X2) ; } { Marked_activate(n__app(X1,X2)) > Marked_app(activate(X1),activate(X2)) ; } { Marked_activate(n__from(X)) > Marked_activate(X) ; } { Marked_activate(n__s(X)) > Marked_activate(X) ; } { Marked_activate(n__zWadr(X1,X2)) > Marked_activate(X1) ; } { Marked_activate(n__zWadr(X1,X2)) > Marked_activate(X2) ; } { Marked_activate(n__zWadr(X1,X2)) > Marked_zWadr(activate(X1),activate(X2)) ; } { Marked_activate(n__prefix(X)) > Marked_activate(X) ; } { Marked_zWadr(cons(X,XS),cons(Y,YS)) > Marked_activate(YS) ; } { Marked_zWadr(cons(X,XS),cons(Y,YS)) > Marked_activate(XS) ; } { Marked_zWadr(cons(X,XS),cons(Y,YS)) > Marked_app(Y,cons(X,n__nil)) ; } { Marked_app(cons(X,XS),YS) > Marked_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 === === 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 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 21.677703 seconds (real time) Cime Exit Status: 0