- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(from(X)) -> mark(cons(X,from(s(X)))) [2] active(head(cons(X,XS))) -> mark(X) [3] active(2nd(cons(X,XS))) -> mark(head(XS)) [4] active(take(0,XS)) -> mark(nil) [5] active(take(s(N),cons(X,XS))) -> mark(cons(X,take(N,XS))) [6] active(sel(0,cons(X,XS))) -> mark(X) [7] active(sel(s(N),cons(X,XS))) -> mark(sel(N,XS)) [8] mark(from(X)) -> active(from(mark(X))) [9] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [10] mark(s(X)) -> active(s(mark(X))) [11] mark(head(X)) -> active(head(mark(X))) [12] mark(2nd(X)) -> active(2nd(mark(X))) [13] mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) [14] mark(0) -> active(0) [15] mark(nil) -> active(nil) [16] mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) [17] from(mark(X)) -> from(X) [18] from(active(X)) -> from(X) [19] cons(mark(X1),X2) -> cons(X1,X2) [20] cons(X1,mark(X2)) -> cons(X1,X2) [21] cons(active(X1),X2) -> cons(X1,X2) [22] cons(X1,active(X2)) -> cons(X1,X2) [23] s(mark(X)) -> s(X) [24] s(active(X)) -> s(X) [25] head(mark(X)) -> head(X) [26] head(active(X)) -> head(X) [27] 2nd(mark(X)) -> 2nd(X) [28] 2nd(active(X)) -> 2nd(X) [29] take(mark(X1),X2) -> take(X1,X2) [30] take(X1,mark(X2)) -> take(X1,X2) [31] take(active(X1),X2) -> take(X1,X2) [32] take(X1,active(X2)) -> take(X1,X2) [33] sel(mark(X1),X2) -> sel(X1,X2) [34] sel(X1,mark(X2)) -> sel(X1,X2) [35] sel(active(X1),X2) -> sel(X1,X2) [36] sel(X1,active(X2)) -> sel(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 8 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(head(X)) >= active(head(mark(X))) ; mark(2nd(X)) >= active(2nd(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(head(cons(X,XS))) >= mark(X) ; active(2nd(cons(X,XS))) >= mark(head(XS)) ; active(take(s(N),cons(X,XS))) >= mark(cons(X,take(N,XS))) ; active(take(0,XS)) >= mark(nil) ; active(sel(s(N),cons(X,XS))) >= mark(sel(N,XS)) ; active(sel(0,cons(X,XS))) >= mark(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(2nd(X)) >= Marked_mark(X) ; Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X1) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X2) ; Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; Marked_active(head(cons(X,XS))) >= Marked_mark(X) ; Marked_active(2nd(cons(X,XS))) >= Marked_mark(head(XS)) ; Marked_active(take(s(N),cons(X,XS))) >= Marked_mark(cons(X,take(N,XS))) ; Marked_active(sel(s(N),cons(X,XS))) >= Marked_mark(sel(N,XS)) ; Marked_active(sel(0,cons(X,XS))) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(2nd(X)) > Marked_mark(X) ; } { Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(sel(X1,X2)) > Marked_active(sel(mark(X1),mark(X2))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { Marked_active(head(cons(X,XS))) > Marked_mark(X) ; } { Marked_active(2nd(cons(X,XS))) > Marked_mark(head(XS)) ; } { Marked_active(take(s(N),cons(X,XS))) > Marked_mark(cons(X,take(N,XS))) ; } { Marked_active(sel(s(N),cons(X,XS))) > Marked_mark(sel(N,XS)) ; } { Marked_active(sel(0,cons(X,XS))) > Marked_mark(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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(2nd(X)) >= active(2nd(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(head(cons(X,XS))) >= mark(X) constraint: active(2nd(cons(X,XS))) >= mark(head(XS)) constraint: active(take(s(N),cons(X,XS))) >= mark(cons(X,take(N,XS))) constraint: active(take(0,XS)) >= mark(nil) constraint: active(sel(s(N),cons(X,XS))) >= mark(sel(N,XS)) constraint: active(sel(0,cons(X,XS))) >= mark(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: sel(mark(X1),X2) >= sel(X1,X2) constraint: sel(active(X1),X2) >= sel(X1,X2) constraint: sel(X1,mark(X2)) >= sel(X1,X2) constraint: sel(X1,active(X2)) >= sel(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(head(X)) >= Marked_mark(X) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(2nd(X)) >= Marked_mark(X) constraint: Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(sel(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(sel(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) constraint: Marked_active(head(cons(X,XS))) >= Marked_mark(X) constraint: Marked_active(2nd(cons(X,XS))) >= Marked_mark(head(XS)) constraint: Marked_active(take(s(N),cons(X,XS))) >= Marked_mark(cons( X,take(N,XS))) constraint: Marked_active(sel(s(N),cons(X,XS))) >= Marked_mark(sel(N,XS)) constraint: Marked_active(sel(0,cons(X,XS))) >= Marked_mark(X) APPLY CRITERIA (Subterm criterion) ST: Marked_from -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_s -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_head -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_2nd -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_take -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_sel -> 2 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(head(X)) >= active(head(mark(X))) ; mark(2nd(X)) >= active(2nd(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(head(cons(X,XS))) >= mark(X) ; active(2nd(cons(X,XS))) >= mark(head(XS)) ; active(take(s(N),cons(X,XS))) >= mark(cons(X,take(N,XS))) ; active(take(0,XS)) >= mark(nil) ; active(sel(s(N),cons(X,XS))) >= mark(sel(N,XS)) ; active(sel(0,cons(X,XS))) >= mark(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(2nd(X)) >= Marked_mark(X) ; Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X1) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X2) ; Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; Marked_active(head(cons(X,XS))) >= Marked_mark(X) ; Marked_active(2nd(cons(X,XS))) >= Marked_mark(head(XS)) ; Marked_active(take(s(N),cons(X,XS))) >= Marked_mark(cons(X,take(N,XS))) ; Marked_active(sel(s(N),cons(X,XS))) >= Marked_mark(sel(N,XS)) ; Marked_active(sel(0,cons(X,XS))) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(2nd(X)) > Marked_mark(X) ; } { Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(sel(X1,X2)) > Marked_active(sel(mark(X1),mark(X2))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { Marked_active(head(cons(X,XS))) > Marked_mark(X) ; } { Marked_active(2nd(cons(X,XS))) > Marked_mark(head(XS)) ; } { Marked_active(take(s(N),cons(X,XS))) > Marked_mark(cons(X,take(N,XS))) ; } { Marked_active(sel(s(N),cons(X,XS))) > Marked_mark(sel(N,XS)) ; } { Marked_active(sel(0,cons(X,XS))) > Marked_mark(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 : 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 : 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 timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(head(X)) >= active(head(mark(X))) ; mark(2nd(X)) >= active(2nd(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(head(cons(X,XS))) >= mark(X) ; active(2nd(cons(X,XS))) >= mark(head(XS)) ; active(take(s(N),cons(X,XS))) >= mark(cons(X,take(N,XS))) ; active(take(0,XS)) >= mark(nil) ; active(sel(s(N),cons(X,XS))) >= mark(sel(N,XS)) ; active(sel(0,cons(X,XS))) >= mark(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; Marked_mark(from(X)) > Marked_mark(X) ; Marked_mark(from(X)) > Marked_active(from(mark(X))) ; Marked_mark(s(X)) > Marked_mark(X) ; Marked_mark(head(X)) > Marked_mark(X) ; Marked_mark(head(X)) > Marked_active(head(mark(X))) ; Marked_mark(2nd(X)) > Marked_mark(X) ; Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; Marked_mark(take(X1,X2)) > Marked_mark(X1) ; Marked_mark(take(X1,X2)) > Marked_mark(X2) ; Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(sel(X1,X2)) > Marked_mark(X1) ; Marked_mark(sel(X1,X2)) > Marked_mark(X2) ; Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) ; Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; Marked_active(head(cons(X,XS))) > Marked_mark(X) ; Marked_active(2nd(cons(X,XS))) > Marked_mark(head(XS)) ; Marked_active(take(s(N),cons(X,XS))) > Marked_mark(cons(X,take(N,XS))) ; Marked_active(sel(s(N),cons(X,XS))) > Marked_mark(sel(N,XS)) ; Marked_active(sel(0,cons(X,XS))) > Marked_mark(X) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(head(X)) >= active(head(mark(X))) ; mark(2nd(X)) >= active(2nd(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(head(cons(X,XS))) >= mark(X) ; active(2nd(cons(X,XS))) >= mark(head(XS)) ; active(take(s(N),cons(X,XS))) >= mark(cons(X,take(N,XS))) ; active(take(0,XS)) >= mark(nil) ; active(sel(s(N),cons(X,XS))) >= mark(sel(N,XS)) ; active(sel(0,cons(X,XS))) >= mark(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; Marked_mark(from(X)) > Marked_mark(X) ; Marked_mark(from(X)) > Marked_active(from(mark(X))) ; Marked_mark(s(X)) > Marked_mark(X) ; Marked_mark(head(X)) > Marked_mark(X) ; Marked_mark(head(X)) > Marked_active(head(mark(X))) ; Marked_mark(2nd(X)) > Marked_mark(X) ; Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; Marked_mark(take(X1,X2)) > Marked_mark(X1) ; Marked_mark(take(X1,X2)) > Marked_mark(X2) ; Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(sel(X1,X2)) > Marked_mark(X1) ; Marked_mark(sel(X1,X2)) > Marked_mark(X2) ; Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) ; Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; Marked_active(head(cons(X,XS))) > Marked_mark(X) ; Marked_active(2nd(cons(X,XS))) > Marked_mark(head(XS)) ; Marked_active(take(s(N),cons(X,XS))) > Marked_mark(cons(X,take(N,XS))) ; Marked_active(sel(s(N),cons(X,XS))) > Marked_mark(sel(N,XS)) ; Marked_active(sel(0,cons(X,XS))) > Marked_mark(X) ; } + Disjunctions:{ } === 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 === No solution found for these parameters.(191 bt (156) [155]) === 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) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_take -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_sel -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 61.241938 seconds (real time) Cime Exit Status: 0