- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] or(true,y) -> true [2] or(x,true) -> true [3] or(false,false) -> false [4] mem(x,nil) -> false [5] mem(x,set(y)) -> =(x,y) [6] mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) 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: { or(true,y) >= true ; or(false,false) >= false ; or(x,true) >= true ; mem(x,nil) >= false ; mem(x,set(y)) >= =(x,y) ; mem(x,union(y,z)) >= or(mem(x,y),mem(x,z)) ; Marked_mem(x,union(y,z)) >= Marked_mem(x,y) ; Marked_mem(x,union(y,z)) >= Marked_mem(x,z) ; } + Disjunctions:{ { Marked_mem(x,union(y,z)) > Marked_mem(x,y) ; } { Marked_mem(x,union(y,z)) > Marked_mem(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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: or(true,y) >= true constraint: or(false,false) >= false constraint: or(x,true) >= true constraint: mem(x,nil) >= false constraint: mem(x,set(y)) >= =(x,y) constraint: mem(x,union(y,z)) >= or(mem(x,y),mem(x,z)) constraint: Marked_mem(x,union(y,z)) >= Marked_mem(x,y) constraint: Marked_mem(x,union(y,z)) >= Marked_mem(x,z) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] or(true,y) -> true [2] or(x,true) -> true [3] or(false,false) -> false [4] mem(x,nil) -> false [5] mem(x,set(y)) -> =(x,y) [6] mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ true ] () = 0; [ Marked_mem ] (X0,X1) = 3*X1 + 0; [ nil ] () = 0; [ false ] () = 0; [ set ] (X0) = 3 + 3*X0 + 0; [ or ] (X0,X1) = 0; [ = ] (X0,X1) = 2*X1 + 0; [ mem ] (X0,X1) = 2 + 2*X1 + 0; [ union ] (X0,X1) = 2 + 3*X0 + 3*X1 + 0; ]} ]} ]} Cime worked for 0.022744 seconds (real time) Cime Exit Status: 0