- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] not(and(x,y)) -> or(not(x),not(y)) [2] not(or(x,y)) -> and(not(x),not(y)) [3] and(x,or(y,z)) -> or(and(x,y),and(x,z)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { not(or(x,y)) >= and(not(x),not(y)) ; not(and(x,y)) >= or(not(x),not(y)) ; and(x,or(y,z)) >= or(and(x,y),and(x,z)) ; Marked_not(or(x,y)) >= Marked_not(x) ; Marked_not(or(x,y)) >= Marked_not(y) ; Marked_not(and(x,y)) >= Marked_not(x) ; Marked_not(and(x,y)) >= Marked_not(y) ; } + Disjunctions:{ { Marked_not(or(x,y)) > Marked_not(x) ; } { Marked_not(or(x,y)) > Marked_not(y) ; } { Marked_not(and(x,y)) > Marked_not(x) ; } { Marked_not(and(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 === 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 === === STOPING TIMER virtual === constraint: not(or(x,y)) >= and(not(x),not(y)) constraint: not(and(x,y)) >= or(not(x),not(y)) constraint: and(x,or(y,z)) >= or(and(x,y),and(x,z)) constraint: Marked_not(or(x,y)) >= Marked_not(x) constraint: Marked_not(or(x,y)) >= Marked_not(y) constraint: Marked_not(and(x,y)) >= Marked_not(x) constraint: Marked_not(and(x,y)) >= Marked_not(y) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { not(or(x,y)) >= and(not(x),not(y)) ; not(and(x,y)) >= or(not(x),not(y)) ; and(x,or(y,z)) >= or(and(x,y),and(x,z)) ; Marked_and(x,or(y,z)) >= Marked_and(x,y) ; Marked_and(x,or(y,z)) >= Marked_and(x,z) ; } + Disjunctions:{ { Marked_and(x,or(y,z)) > Marked_and(x,y) ; } { Marked_and(x,or(y,z)) > Marked_and(x,z) ; } } === 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 === === STOPING TIMER virtual === constraint: not(or(x,y)) >= and(not(x),not(y)) constraint: not(and(x,y)) >= or(not(x),not(y)) constraint: and(x,or(y,z)) >= or(and(x,y),and(x,z)) constraint: Marked_and(x,or(y,z)) >= Marked_and(x,y) constraint: Marked_and(x,or(y,z)) >= Marked_and(x,z) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] not(and(x,y)) -> or(not(x),not(y)) [2] not(or(x,y)) -> and(not(x),not(y)) [3] and(x,or(y,z)) -> or(and(x,y),and(x,z)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: RPO with AFS = AFS: and precedence: prec (All symbols are Lex.): { or < not ; or < and ; not > or ; not > and ; and > or ; and < not ; } ]} { DP termination of: , CRITERION: ORD [ Solution found: RPO with AFS = AFS: and precedence: prec (All symbols are Lex.): { or < not ; or < and ; not > or ; not > and ; and > or ; and < not ; } ]} ]} ]} Cime worked for 0.050142 seconds (real time) Cime Exit Status: 0