- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] not(not(x)) -> x [2] not(or(x,y)) -> and(not(not(not(x))),not(not(not(y)))) [3] not(and(x,y)) -> or(not(not(not(x))),not(not(not(y)))) 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: { not(not(x)) >= x ; not(and(x,y)) >= or(not(not(not(x))),not(not(not(y)))) ; not(or(x,y)) >= and(not(not(not(x))),not(not(not(y)))) ; Marked_not(and(x,y)) >= Marked_not(not(not(x))) ; Marked_not(and(x,y)) >= Marked_not(not(not(y))) ; Marked_not(and(x,y)) >= Marked_not(not(x)) ; Marked_not(and(x,y)) >= Marked_not(not(y)) ; Marked_not(and(x,y)) >= Marked_not(x) ; Marked_not(and(x,y)) >= Marked_not(y) ; Marked_not(or(x,y)) >= Marked_not(not(not(x))) ; Marked_not(or(x,y)) >= Marked_not(not(not(y))) ; Marked_not(or(x,y)) >= Marked_not(not(x)) ; Marked_not(or(x,y)) >= Marked_not(not(y)) ; Marked_not(or(x,y)) >= Marked_not(x) ; Marked_not(or(x,y)) >= Marked_not(y) ; } + Disjunctions:{ { Marked_not(and(x,y)) > Marked_not(not(not(x))) ; } { Marked_not(and(x,y)) > Marked_not(not(not(y))) ; } { Marked_not(and(x,y)) > Marked_not(not(x)) ; } { Marked_not(and(x,y)) > Marked_not(not(y)) ; } { Marked_not(and(x,y)) > Marked_not(x) ; } { Marked_not(and(x,y)) > Marked_not(y) ; } { Marked_not(or(x,y)) > Marked_not(not(not(x))) ; } { Marked_not(or(x,y)) > Marked_not(not(not(y))) ; } { Marked_not(or(x,y)) > Marked_not(not(x)) ; } { Marked_not(or(x,y)) > Marked_not(not(y)) ; } { Marked_not(or(x,y)) > Marked_not(x) ; } { Marked_not(or(x,y)) > Marked_not(y) ; } } === 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: not(not(x)) >= x constraint: not(and(x,y)) >= or(not(not(not(x))),not(not(not(y)))) constraint: not(or(x,y)) >= and(not(not(not(x))),not(not(not(y)))) constraint: Marked_not(and(x,y)) >= Marked_not(not(not(x))) constraint: Marked_not(and(x,y)) >= Marked_not(not(not(y))) constraint: Marked_not(and(x,y)) >= Marked_not(not(x)) constraint: Marked_not(and(x,y)) >= Marked_not(not(y)) constraint: Marked_not(and(x,y)) >= Marked_not(x) constraint: Marked_not(and(x,y)) >= Marked_not(y) constraint: Marked_not(or(x,y)) >= Marked_not(not(not(x))) constraint: Marked_not(or(x,y)) >= Marked_not(not(not(y))) constraint: Marked_not(or(x,y)) >= Marked_not(not(x)) constraint: Marked_not(or(x,y)) >= Marked_not(not(y)) constraint: Marked_not(or(x,y)) >= Marked_not(x) constraint: Marked_not(or(x,y)) >= Marked_not(y) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] not(not(x)) -> x [2] not(or(x,y)) -> and(not(not(not(x))),not(not(not(y)))) [3] not(and(x,y)) -> or(not(not(not(x))),not(not(not(y)))) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ not ] (X0) = 1*X0 + 0; [ or ] (X0,X1) = 2 + 2*X0 + 2*X1 + 0; [ and ] (X0,X1) = 2 + 2*X0 + 2*X1 + 0; [ Marked_not ] (X0) = 2*X0 + 0; ]} ]} ]} Cime worked for 0.086475 seconds (real time) Cime Exit Status: 0