3 F={x: x in S | ((forall y in U.((y > x) or(x = x))) and(x /= 0))}
9 F={x: x in S | ((forall y in U.((y > x) or(x = x))) and(x /= 0))}
18 F={x: x in S | ((forall y in U.((y > x) or(x = x))) and(x /= 0))}
24 [DNF construction and simplification phase]
26 {x: x in S | ((nonempty U) and(x /= 0))}
28 [Constructing the query graph]
31 {x: x in S | ((nonempty U) and(x /= 0))}
33 [Quantifier elimination phase]
35 if(nonempty U) then{x: x in S | (x /= 0)} else {}
37 [Disjunction removal phase]
39 if(nonempty U) then{x: x in S | (x /= 0)} else {}
41 [Conjunctive query decomposition phase]
44 if(nonempty U) then{x: x in S | (x /= 0)} else {}
46 [Projection recognition phase]
48 if(nonempty U) then{x: x in S | (x /= 0)} else {}
50 [Simple find/count query decomposition phase]
53 if(nonempty U) then{x: x in S | (x /= 0)} else {}