- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(from(X)) -> mark(cons(X,from(s(X)))) [2] active(sel(0,cons(X,XS))) -> mark(X) [3] active(sel(s(N),cons(X,XS))) -> mark(sel(N,XS)) [4] active(minus(X,0)) -> mark(0) [5] active(minus(s(X),s(Y))) -> mark(minus(X,Y)) [6] active(quot(0,s(Y))) -> mark(0) [7] active(quot(s(X),s(Y))) -> mark(s(quot(minus(X,Y),s(Y)))) [8] active(zWquot(XS,nil)) -> mark(nil) [9] active(zWquot(nil,XS)) -> mark(nil) [10] active(zWquot(cons(X,XS),cons(Y,YS))) -> mark(cons(quot(X,Y),zWquot(XS,YS))) [11] active(from(X)) -> from(active(X)) [12] active(cons(X1,X2)) -> cons(active(X1),X2) [13] active(s(X)) -> s(active(X)) [14] active(sel(X1,X2)) -> sel(active(X1),X2) [15] active(sel(X1,X2)) -> sel(X1,active(X2)) [16] active(minus(X1,X2)) -> minus(active(X1),X2) [17] active(minus(X1,X2)) -> minus(X1,active(X2)) [18] active(quot(X1,X2)) -> quot(active(X1),X2) [19] active(quot(X1,X2)) -> quot(X1,active(X2)) [20] active(zWquot(X1,X2)) -> zWquot(active(X1),X2) [21] active(zWquot(X1,X2)) -> zWquot(X1,active(X2)) [22] from(mark(X)) -> mark(from(X)) [23] cons(mark(X1),X2) -> mark(cons(X1,X2)) [24] s(mark(X)) -> mark(s(X)) [25] sel(mark(X1),X2) -> mark(sel(X1,X2)) [26] sel(X1,mark(X2)) -> mark(sel(X1,X2)) [27] minus(mark(X1),X2) -> mark(minus(X1,X2)) [28] minus(X1,mark(X2)) -> mark(minus(X1,X2)) [29] quot(mark(X1),X2) -> mark(quot(X1,X2)) [30] quot(X1,mark(X2)) -> mark(quot(X1,X2)) [31] zWquot(mark(X1),X2) -> mark(zWquot(X1,X2)) [32] zWquot(X1,mark(X2)) -> mark(zWquot(X1,X2)) [33] proper(from(X)) -> from(proper(X)) [34] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [35] proper(s(X)) -> s(proper(X)) [36] proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) [37] proper(0) -> ok(0) [38] proper(minus(X1,X2)) -> minus(proper(X1),proper(X2)) [39] proper(quot(X1,X2)) -> quot(proper(X1),proper(X2)) [40] proper(zWquot(X1,X2)) -> zWquot(proper(X1),proper(X2)) [41] proper(nil) -> ok(nil) [42] from(ok(X)) -> ok(from(X)) [43] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [44] s(ok(X)) -> ok(s(X)) [45] sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) [46] minus(ok(X1),ok(X2)) -> ok(minus(X1,X2)) [47] quot(ok(X1),ok(X2)) -> ok(quot(X1,X2)) [48] zWquot(ok(X1),ok(X2)) -> ok(zWquot(X1,X2)) [49] top(mark(X)) -> top(proper(X)) [50] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 10 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(sel(s(N),cons(X,XS))) >= mark(sel(N,XS)) ; active(sel(0,cons(X,XS))) >= mark(X) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(minus(s(X),s(Y))) >= mark(minus(X,Y)) ; active(minus(X,0)) >= mark(0) ; active(minus(X1,X2)) >= minus(active(X1),X2) ; active(minus(X1,X2)) >= minus(X1,active(X2)) ; active(quot(s(X),s(Y))) >= mark(s(quot(minus(X,Y),s(Y)))) ; active(quot(0,s(Y))) >= mark(0) ; active(quot(X1,X2)) >= quot(active(X1),X2) ; active(quot(X1,X2)) >= quot(X1,active(X2)) ; active(zWquot(cons(X,XS),cons(Y,YS))) >= mark(cons(quot(X,Y),zWquot(XS,YS))) ; active(zWquot(nil,XS)) >= mark(nil) ; active(zWquot(XS,nil)) >= mark(nil) ; active(zWquot(X1,X2)) >= zWquot(active(X1),X2) ; active(zWquot(X1,X2)) >= zWquot(X1,active(X2)) ; sel(mark(X1),X2) >= mark(sel(X1,X2)) ; sel(ok(X1),ok(X2)) >= ok(sel(X1,X2)) ; sel(X1,mark(X2)) >= mark(sel(X1,X2)) ; minus(mark(X1),X2) >= mark(minus(X1,X2)) ; minus(ok(X1),ok(X2)) >= ok(minus(X1,X2)) ; minus(X1,mark(X2)) >= mark(minus(X1,X2)) ; quot(mark(X1),X2) >= mark(quot(X1,X2)) ; quot(ok(X1),ok(X2)) >= ok(quot(X1,X2)) ; quot(X1,mark(X2)) >= mark(quot(X1,X2)) ; zWquot(mark(X1),X2) >= mark(zWquot(X1,X2)) ; zWquot(ok(X1),ok(X2)) >= ok(zWquot(X1,X2)) ; zWquot(X1,mark(X2)) >= mark(zWquot(X1,X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(minus(X1,X2)) >= minus(proper(X1),proper(X2)) ; proper(quot(X1,X2)) >= quot(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(zWquot(X1,X2)) >= zWquot(proper(X1),proper(X2)) ; 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 54.165812 seconds (real time) Cime Exit Status: 0