- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(U11(tt,N)) -> mark(N) [2] active(U21(tt,M,N)) -> mark(s(plus(N,M))) [3] active(and(tt,X)) -> mark(X) [4] active(isNat(0)) -> mark(tt) [5] active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) [6] active(isNat(s(V1))) -> mark(isNat(V1)) [7] active(plus(N,0)) -> mark(U11(isNat(N),N)) [8] active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) [9] active(U11(X1,X2)) -> U11(active(X1),X2) [10] active(U21(X1,X2,X3)) -> U21(active(X1),X2,X3) [11] active(s(X)) -> s(active(X)) [12] active(plus(X1,X2)) -> plus(active(X1),X2) [13] active(plus(X1,X2)) -> plus(X1,active(X2)) [14] active(and(X1,X2)) -> and(active(X1),X2) [15] U11(mark(X1),X2) -> mark(U11(X1,X2)) [16] U21(mark(X1),X2,X3) -> mark(U21(X1,X2,X3)) [17] s(mark(X)) -> mark(s(X)) [18] plus(mark(X1),X2) -> mark(plus(X1,X2)) [19] plus(X1,mark(X2)) -> mark(plus(X1,X2)) [20] and(mark(X1),X2) -> mark(and(X1,X2)) [21] proper(U11(X1,X2)) -> U11(proper(X1),proper(X2)) [22] proper(tt) -> ok(tt) [23] proper(U21(X1,X2,X3)) -> U21(proper(X1),proper(X2),proper(X3)) [24] proper(s(X)) -> s(proper(X)) [25] proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) [26] proper(and(X1,X2)) -> and(proper(X1),proper(X2)) [27] proper(isNat(X)) -> isNat(proper(X)) [28] proper(0) -> ok(0) [29] U11(ok(X1),ok(X2)) -> ok(U11(X1,X2)) [30] U21(ok(X1),ok(X2),ok(X3)) -> ok(U21(X1,X2,X3)) [31] s(ok(X)) -> ok(s(X)) [32] plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) [33] and(ok(X1),ok(X2)) -> ok(and(X1,X2)) [34] isNat(ok(X)) -> ok(isNat(X)) [35] top(mark(X)) -> top(proper(X)) [36] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 9 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(U11(tt,N)) >= mark(N) ; active(U11(X1,X2)) >= U11(active(X1),X2) ; active(s(X)) >= s(active(X)) ; active(plus(N,s(M))) >= mark(U21(and(isNat(M),isNat(N)),M,N)) ; active(plus(N,0)) >= mark(U11(isNat(N),N)) ; active(plus(X1,X2)) >= plus(active(X1),X2) ; active(plus(X1,X2)) >= plus(X1,active(X2)) ; active(U21(tt,M,N)) >= mark(s(plus(N,M))) ; active(U21(X1,X2,X3)) >= U21(active(X1),X2,X3) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(plus(V1,V2))) >= mark(and(isNat(V1),isNat(V2))) ; active(isNat(0)) >= mark(tt) ; U11(mark(X1),X2) >= mark(U11(X1,X2)) ; U11(ok(X1),ok(X2)) >= ok(U11(X1,X2)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; plus(mark(X1),X2) >= mark(plus(X1,X2)) ; plus(ok(X1),ok(X2)) >= ok(plus(X1,X2)) ; plus(X1,mark(X2)) >= mark(plus(X1,X2)) ; U21(mark(X1),X2,X3) >= mark(U21(X1,X2,X3)) ; U21(ok(X1),ok(X2),ok(X3)) >= ok(U21(X1,X2,X3)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; isNat(ok(X)) >= ok(isNat(X)) ; proper(U11(X1,X2)) >= U11(proper(X1),proper(X2)) ; proper(tt) >= ok(tt) ; proper(s(X)) >= s(proper(X)) ; proper(plus(X1,X2)) >= plus(proper(X1),proper(X2)) ; proper(U21(X1,X2,X3)) >= U21(proper(X1),proper(X2),proper(X3)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(isNat(X)) >= isNat(proper(X)) ; proper(0) >= ok(0) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) >= Marked_top(proper(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(mark(X)) > Marked_top(proper(X)) ; } { Marked_top(ok(X)) > Marked_top(active(X)) ; } } === 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 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 53.563360 seconds (real time) Cime Exit Status: 0