{x_{1}}^{3}  + (91) {x_{0}}^{10}  + (79) {x_{0}}^{9}  + (72) {x_{0}}^{8}  + (-97) {x_{1}}^{4}  = 0] \vee[(-36) {x_{0}}^{8}  + (2) {x_{0}}^{10} {x_{1}}^{5}  + (-46) {x_{0}}^{7} {x_{1}}^{2}  + (11)  + (28) {x_{0}}^{7} {x_{1}}^{7}  = 0] \vee[(-38) {x_{0}}^{5}  + (94) {x_{0}}^{10} {x_{1}}^{9}  + (-15) {x_{0}}^{1}  + (-91)  + (-5) {x_{1}}^{3}  = 0] \vee[(93)  + (52) {x_{0}}^{10} {x_{1}}^{2}  + (-5) {x_{0}}^{3} {x_{1}}^{2}  + (-20)  + (-5)  = 0] \vee[(-47) {x_{0}}^{7}  + (80) {x_{0}}^{10}  + (76)  + (54) {x_{1}}^{3}  + (86) {x_{1}}^{4}  = 0]] \wedge [[(-21) {x_{0}}^{6} {x_{1}}^{8}  + (-83) {x_{0}}^{10} {x_{1}}^{5}  + (67) {x_{0}}^{3}  + (80) {x_{0}}^{5}  + (57) {x_{1}}^{2}  = 0] \vee[(-24) {x_{1}}^{6}  + (78) {x_{0}}^{10}  + (-68) {x_{0}}^{6}  + (83) {x_{0}}^{8}  + (66)  = 0] \vee[(-60)  + (97) {x_{0}}^{10} {x_{1}}^{7}  + (-6) {x_{0}}^{3}  + (53) {x_{1}}^{9}  + (-36) {x_{1}}^{4}  = 0] \vee[(83) {x_{0}}^{1} {x_{1}}^{5}  + (-55) {x_{0}}^{10} {x_{1}}^{6}  + (-48)  + (69) {x_{0}}^{2}  + (-44)  = 0] \vee[(15)  + (-49) {x_{0}}^{10}  + (90)  + (-23) {x_{0}}^{6} {x_{1}}^{4}  + (85) {x_{1}}^{4}  = 0]]].$

An example of the actual input, which consists of 100 clauses could not be provided here due to space constraints (as it would occupy four pages). This also proves the robustness of the algorithm, as CAD in practice relies on 