- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(fib(N)) -> mark(sel(N,fib1(s(0),s(0)))) [2] active(fib1(X,Y)) -> mark(cons(X,fib1(Y,add(X,Y)))) [3] active(add(0,X)) -> mark(X) [4] active(add(s(X),Y)) -> mark(s(add(X,Y))) [5] active(sel(0,cons(X,XS))) -> mark(X) [6] active(sel(s(N),cons(X,XS))) -> mark(sel(N,XS)) [7] active(fib(X)) -> fib(active(X)) [8] active(sel(X1,X2)) -> sel(active(X1),X2) [9] active(sel(X1,X2)) -> sel(X1,active(X2)) [10] active(fib1(X1,X2)) -> fib1(active(X1),X2) [11] active(fib1(X1,X2)) -> fib1(X1,active(X2)) [12] active(s(X)) -> s(active(X)) [13] active(cons(X1,X2)) -> cons(active(X1),X2) [14] active(add(X1,X2)) -> add(active(X1),X2) [15] active(add(X1,X2)) -> add(X1,active(X2)) [16] fib(mark(X)) -> mark(fib(X)) [17] sel(mark(X1),X2) -> mark(sel(X1,X2)) [18] sel(X1,mark(X2)) -> mark(sel(X1,X2)) [19] fib1(mark(X1),X2) -> mark(fib1(X1,X2)) [20] fib1(X1,mark(X2)) -> mark(fib1(X1,X2)) [21] s(mark(X)) -> mark(s(X)) [22] cons(mark(X1),X2) -> mark(cons(X1,X2)) [23] add(mark(X1),X2) -> mark(add(X1,X2)) [24] add(X1,mark(X2)) -> mark(add(X1,X2)) [25] proper(fib(X)) -> fib(proper(X)) [26] proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) [27] proper(fib1(X1,X2)) -> fib1(proper(X1),proper(X2)) [28] proper(s(X)) -> s(proper(X)) [29] proper(0) -> ok(0) [30] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [31] proper(add(X1,X2)) -> add(proper(X1),proper(X2)) [32] fib(ok(X)) -> ok(fib(X)) [33] sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) [34] fib1(ok(X1),ok(X2)) -> ok(fib1(X1,X2)) [35] s(ok(X)) -> ok(s(X)) [36] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [37] add(ok(X1),ok(X2)) -> ok(add(X1,X2)) [38] top(mark(X)) -> top(proper(X)) [39] 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: { 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)) ; fib1(mark(X1),X2) >= mark(fib1(X1,X2)) ; fib1(ok(X1),ok(X2)) >= ok(fib1(X1,X2)) ; fib1(X1,mark(X2)) >= mark(fib1(X1,X2)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(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(fib1(X,Y)) >= mark(cons(X,fib1(Y,add(X,Y)))) ; active(fib1(X1,X2)) >= fib1(active(X1),X2) ; active(fib1(X1,X2)) >= fib1(X1,active(X2)) ; active(s(X)) >= s(active(X)) ; active(fib(N)) >= mark(sel(N,fib1(s(0),s(0)))) ; active(fib(X)) >= fib(active(X)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(0,X)) >= mark(X) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(add(X1,X2)) >= add(X1,active(X2)) ; fib(mark(X)) >= mark(fib(X)) ; fib(ok(X)) >= ok(fib(X)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; add(X1,mark(X2)) >= mark(add(X1,X2)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(fib1(X1,X2)) >= fib1(proper(X1),proper(X2)) ; proper(s(X)) >= s(proper(X)) ; proper(0) >= ok(0) ; proper(fib(X)) >= fib(proper(X)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(add(X1,X2)) >= add(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 53.602260 seconds (real time) Cime Exit Status: 0