TSTP Solution File: SET118-7 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SET118-7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 17:44:16 EDT 2024
% Result : Unsatisfiable 0.46s 0.69s
% Output : Proof 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SET118-7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.12/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue May 28 08:48:39 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.46/0.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.V95w5PMzva/cvc5---1.0.5_2808.smt2
% 0.46/0.69 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.V95w5PMzva/cvc5---1.0.5_2808.smt2
% 0.46/0.70 (assume a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))))
% 0.46/0.70 (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member (tptp.not_subclass_element X Y) X) (tptp.subclass X Y))))
% 0.46/0.70 (assume a2 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (tptp.subclass X Y))))
% 0.46/0.70 (assume a3 (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)))
% 0.46/0.70 (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass X Y))))
% 0.46/0.70 (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass Y X))))
% 0.46/0.70 (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.subclass Y X)) (= X Y))))
% 0.46/0.70 (assume a7 (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.unordered_pair X Y))) (= U X) (= U Y))))
% 0.46/0.70 (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.unordered_pair X Y)))))
% 0.46/0.70 (assume a9 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (tptp.member Y (tptp.unordered_pair X Y)))))
% 0.46/0.70 (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X Y) tptp.universal_class)))
% 0.46/0.70 (assume a11 (forall ((X $$unsorted)) (= (tptp.unordered_pair X X) (tptp.singleton X))))
% 0.46/0.70 (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair (tptp.singleton X) (tptp.unordered_pair X (tptp.singleton Y))) (tptp.ordered_pair X Y))))
% 0.46/0.70 (assume a13 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member U X))))
% 0.46/0.70 (assume a14 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member V Y))))
% 0.46/0.70 (assume a15 (forall ((U $$unsorted) (X $$unsorted) (V $$unsorted) (Y $$unsorted)) (or (not (tptp.member U X)) (not (tptp.member V Y)) (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y)))))
% 0.46/0.70 (assume a16 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z))))
% 0.46/0.70 (assume a17 (tptp.subclass tptp.element_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 0.46/0.70 (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.element_relation)) (tptp.member X Y))))
% 0.46/0.70 (assume a19 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product tptp.universal_class tptp.universal_class))) (not (tptp.member X Y)) (tptp.member (tptp.ordered_pair X Y) tptp.element_relation))))
% 0.46/0.70 (assume a20 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))))
% 0.46/0.70 (assume a21 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z Y))))
% 0.46/0.70 (assume a22 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z X)) (not (tptp.member Z Y)) (tptp.member Z (tptp.intersection X Y)))))
% 0.46/0.70 (assume a23 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))))
% 0.46/0.70 (assume a24 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))))
% 0.46/0.70 (assume a25 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))))
% 0.46/0.70 (assume a26 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.intersection (tptp.complement (tptp.intersection X Y)) (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y)))) (tptp.symmetric_difference X Y))))
% 0.46/0.70 (assume a27 (forall ((Xr $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.intersection Xr (tptp.cross_product X Y)) (tptp.restrict Xr X Y))))
% 0.46/0.70 (assume a28 (forall ((X $$unsorted) (Y $$unsorted) (Xr $$unsorted)) (= (tptp.intersection (tptp.cross_product X Y) Xr) (tptp.restrict Xr X Y))))
% 0.46/0.70 (assume a29 (forall ((X $$unsorted) (Z $$unsorted)) (or (not (= (tptp.restrict X (tptp.singleton Z) tptp.universal_class) tptp.null_class)) (not (tptp.member Z (tptp.domain_of X))))))
% 0.46/0.70 (assume a30 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (= (tptp.restrict X (tptp.singleton Z) tptp.universal_class) tptp.null_class) (tptp.member Z (tptp.domain_of X)))))
% 0.46/0.70 (assume a31 (forall ((X $$unsorted)) (tptp.subclass (tptp.rotate X) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))))
% 0.46/0.70 (assume a32 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.rotate X))) (tptp.member (tptp.ordered_pair (tptp.ordered_pair V W) U) X))))
% 0.46/0.70 (assume a33 (forall ((V $$unsorted) (W $$unsorted) (U $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair V W) U) X)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.rotate X)))))
% 0.46/0.70 (assume a34 (forall ((X $$unsorted)) (tptp.subclass (tptp.flip X) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))))
% 0.46/0.70 (assume a35 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.flip X))) (tptp.member (tptp.ordered_pair (tptp.ordered_pair V U) W) X))))
% 0.46/0.70 (assume a36 (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair V U) W) X)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.flip X)))))
% 0.46/0.70 (assume a37 (forall ((Y $$unsorted)) (= (tptp.domain_of (tptp.flip (tptp.cross_product Y tptp.universal_class))) (tptp.inverse Y))))
% 0.46/0.70 (assume a38 (forall ((Z $$unsorted)) (= (tptp.domain_of (tptp.inverse Z)) (tptp.range_of Z))))
% 0.46/0.70 (assume a39 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.first (tptp.not_subclass_element (tptp.restrict Z X (tptp.singleton Y)) tptp.null_class)) (tptp.domain Z X Y))))
% 0.46/0.70 (assume a40 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.second (tptp.not_subclass_element (tptp.restrict Z (tptp.singleton X) Y) tptp.null_class)) (tptp.range Z X Y))))
% 0.46/0.70 (assume a41 (forall ((Xr $$unsorted) (X $$unsorted)) (= (tptp.range_of (tptp.restrict Xr X tptp.universal_class)) (tptp.image Xr X))))
% 0.46/0.70 (assume a42 (forall ((X $$unsorted)) (= (tptp.union X (tptp.singleton X)) (tptp.successor X))))
% 0.46/0.70 (assume a43 (tptp.subclass tptp.successor_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 0.46/0.70 (assume a44 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.successor_relation)) (= (tptp.successor X) Y))))
% 0.46/0.70 (assume a45 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.successor X) Y)) (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product tptp.universal_class tptp.universal_class))) (tptp.member (tptp.ordered_pair X Y) tptp.successor_relation))))
% 0.46/0.70 (assume a46 (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.member tptp.null_class X))))
% 0.46/0.70 (assume a47 (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.subclass (tptp.image tptp.successor_relation X) X))))
% 0.46/0.70 (assume a48 (forall ((X $$unsorted)) (or (not (tptp.member tptp.null_class X)) (not (tptp.subclass (tptp.image tptp.successor_relation X) X)) (tptp.inductive X))))
% 0.46/0.70 (assume a49 (tptp.inductive tptp.omega))
% 0.46/0.70 (assume a50 (forall ((Y $$unsorted)) (or (not (tptp.inductive Y)) (tptp.subclass tptp.omega Y))))
% 0.46/0.70 (assume a51 (tptp.member tptp.omega tptp.universal_class))
% 0.46/0.70 (assume a52 (forall ((X $$unsorted)) (= (tptp.domain_of (tptp.restrict tptp.element_relation tptp.universal_class X)) (tptp.sum_class X))))
% 0.46/0.70 (assume a53 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.sum_class X) tptp.universal_class))))
% 0.46/0.70 (assume a54 (forall ((X $$unsorted)) (= (tptp.complement (tptp.image tptp.element_relation (tptp.complement X))) (tptp.power_class X))))
% 0.46/0.70 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.member U tptp.universal_class)) (tptp.member (tptp.power_class U) tptp.universal_class))))
% 0.46/0.70 (assume a56 (forall ((Yr $$unsorted) (Xr $$unsorted)) (tptp.subclass (tptp.compose Yr Xr) (tptp.cross_product tptp.universal_class tptp.universal_class))))
% 0.46/0.70 (assume a57 (forall ((Y $$unsorted) (Z $$unsorted) (Yr $$unsorted) (Xr $$unsorted)) (or (not (tptp.member (tptp.ordered_pair Y Z) (tptp.compose Yr Xr))) (tptp.member Z (tptp.image Yr (tptp.image Xr (tptp.singleton Y)))))))
% 0.46/0.70 (assume a58 (forall ((Z $$unsorted) (Yr $$unsorted) (Xr $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.image Yr (tptp.image Xr (tptp.singleton Y))))) (not (tptp.member (tptp.ordered_pair Y Z) (tptp.cross_product tptp.universal_class tptp.universal_class))) (tptp.member (tptp.ordered_pair Y Z) (tptp.compose Yr Xr)))))
% 0.46/0.70 (assume a59 (forall ((X $$unsorted)) (or (not (tptp.single_valued_class X)) (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation))))
% 0.46/0.70 (assume a60 (forall ((X $$unsorted)) (or (not (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation)) (tptp.single_valued_class X))))
% 0.46/0.70 (assume a61 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass Xf (tptp.cross_product tptp.universal_class tptp.universal_class)))))
% 0.46/0.70 (assume a62 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass (tptp.compose Xf (tptp.inverse Xf)) tptp.identity_relation))))
% 0.46/0.70 (assume a63 (forall ((Xf $$unsorted)) (or (not (tptp.subclass Xf (tptp.cross_product tptp.universal_class tptp.universal_class))) (not (tptp.subclass (tptp.compose Xf (tptp.inverse Xf)) tptp.identity_relation)) (tptp.function Xf))))
% 0.46/0.70 (assume a64 (forall ((Xf $$unsorted) (X $$unsorted)) (or (not (tptp.function Xf)) (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.image Xf X) tptp.universal_class))))
% 0.46/0.70 (assume a65 (forall ((X $$unsorted)) (or (= X tptp.null_class) (tptp.member (tptp.regular X) X))))
% 0.46/0.70 (assume a66 (forall ((X $$unsorted)) (or (= X tptp.null_class) (= (tptp.intersection X (tptp.regular X)) tptp.null_class))))
% 0.46/0.70 (assume a67 (forall ((Xf $$unsorted) (Y $$unsorted)) (= (tptp.sum_class (tptp.image Xf (tptp.singleton Y))) (tptp.apply Xf Y))))
% 0.46/0.70 (assume a68 (tptp.function tptp.choice))
% 0.46/0.70 (assume a69 (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= Y tptp.null_class) (tptp.member (tptp.apply tptp.choice Y) Y))))
% 0.46/0.70 (assume a70 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function Xf))))
% 0.46/0.70 (assume a71 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function (tptp.inverse Xf)))))
% 0.46/0.70 (assume a72 (forall ((Xf $$unsorted)) (or (not (tptp.function (tptp.inverse Xf))) (not (tptp.function Xf)) (tptp.one_to_one Xf))))
% 0.46/0.70 (assume a73 (= (tptp.intersection (tptp.cross_product tptp.universal_class tptp.universal_class) (tptp.intersection (tptp.cross_product tptp.universal_class tptp.universal_class) (tptp.complement (tptp.compose (tptp.complement tptp.element_relation) (tptp.inverse tptp.element_relation))))) tptp.subset_relation))
% 0.46/0.70 (assume a74 (= (tptp.intersection (tptp.inverse tptp.subset_relation) tptp.subset_relation) tptp.identity_relation))
% 0.46/0.70 (assume a75 (forall ((Xr $$unsorted)) (= (tptp.complement (tptp.domain_of (tptp.intersection Xr tptp.identity_relation))) (tptp.diagonalise Xr))))
% 0.46/0.70 (assume a76 (forall ((X $$unsorted)) (= (tptp.intersection (tptp.domain_of X) (tptp.diagonalise (tptp.compose (tptp.inverse tptp.element_relation) X))) (tptp.cantor X))))
% 0.46/0.70 (assume a77 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.function Xf))))
% 0.46/0.70 (assume a78 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (= (tptp.cross_product (tptp.domain_of (tptp.domain_of Xf)) (tptp.domain_of (tptp.domain_of Xf))) (tptp.domain_of Xf)))))
% 0.46/0.70 (assume a79 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.subclass (tptp.range_of Xf) (tptp.domain_of (tptp.domain_of Xf))))))
% 0.46/0.70 (assume a80 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (not (= (tptp.cross_product (tptp.domain_of (tptp.domain_of Xf)) (tptp.domain_of (tptp.domain_of Xf))) (tptp.domain_of Xf))) (not (tptp.subclass (tptp.range_of Xf) (tptp.domain_of (tptp.domain_of Xf)))) (tptp.operation Xf))))
% 0.46/0.70 (assume a81 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (tptp.function Xh))))
% 0.46/0.70 (assume a82 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (= (tptp.domain_of (tptp.domain_of Xf1)) (tptp.domain_of Xh)))))
% 0.46/0.70 (assume a83 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (tptp.subclass (tptp.range_of Xh) (tptp.domain_of (tptp.domain_of Xf2))))))
% 0.46/0.70 (assume a84 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.function Xh)) (not (= (tptp.domain_of (tptp.domain_of Xf1)) (tptp.domain_of Xh))) (not (tptp.subclass (tptp.range_of Xh) (tptp.domain_of (tptp.domain_of Xf2)))) (tptp.compatible Xh Xf1 Xf2))))
% 0.46/0.70 (assume a85 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf1))))
% 0.46/0.70 (assume a86 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf2))))
% 0.46/0.70 (assume a87 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.compatible Xh Xf1 Xf2))))
% 0.46/0.70 (assume a88 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (not (tptp.member (tptp.ordered_pair X Y) (tptp.domain_of Xf1))) (= (tptp.apply Xf2 (tptp.ordered_pair (tptp.apply Xh X) (tptp.apply Xh Y))) (tptp.apply Xh (tptp.apply Xf1 (tptp.ordered_pair X Y)))))))
% 0.46/0.70 (assume a89 (forall ((Xf1 $$unsorted) (Xf2 $$unsorted) (Xh $$unsorted)) (or (not (tptp.operation Xf1)) (not (tptp.operation Xf2)) (not (tptp.compatible Xh Xf1 Xf2)) (tptp.member (tptp.ordered_pair (tptp.not_homomorphism1 Xh Xf1 Xf2) (tptp.not_homomorphism2 Xh Xf1 Xf2)) (tptp.domain_of Xf1)) (tptp.homomorphism Xh Xf1 Xf2))))
% 0.46/0.70 (assume a90 (forall ((Xf1 $$unsorted) (Xf2 $$unsorted) (Xh $$unsorted)) (or (not (tptp.operation Xf1)) (not (tptp.operation Xf2)) (not (tptp.compatible Xh Xf1 Xf2)) (not (= (tptp.apply Xf2 (tptp.ordered_pair (tptp.apply Xh (tptp.not_homomorphism1 Xh Xf1 Xf2)) (tptp.apply Xh (tptp.not_homomorphism2 Xh Xf1 Xf2)))) (tptp.apply Xh (tptp.apply Xf1 (tptp.ordered_pair (tptp.not_homomorphism1 Xh Xf1 Xf2) (tptp.not_homomorphism2 Xh Xf1 Xf2)))))) (tptp.homomorphism Xh Xf1 Xf2))))
% 0.46/0.70 (assume a91 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product U V))) (tptp.member X (tptp.unordered_pair X Y)))))
% 0.46/0.70 (assume a92 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product U V))) (tptp.member Y (tptp.unordered_pair X Y)))))
% 0.46/0.70 (assume a93 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member U tptp.universal_class))))
% 0.46/0.70 (assume a94 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member V tptp.universal_class))))
% 0.46/0.70 (assume a95 (forall ((X $$unsorted)) (tptp.subclass X X)))
% 0.46/0.70 (assume a96 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.subclass Y Z)) (tptp.subclass X Z))))
% 0.46/0.70 (assume a97 (forall ((X $$unsorted) (Y $$unsorted)) (or (= X Y) (tptp.member (tptp.not_subclass_element X Y) X) (tptp.member (tptp.not_subclass_element Y X) Y))))
% 0.46/0.70 (assume a98 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (= X Y) (tptp.member (tptp.not_subclass_element Y X) Y))))
% 0.46/0.70 (assume a99 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element Y X) X)) (= X Y) (tptp.member (tptp.not_subclass_element X Y) X))))
% 0.46/0.70 (assume a100 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (not (tptp.member (tptp.not_subclass_element Y X) X)) (= X Y))))
% 0.46/0.70 (assume a101 (forall ((Y $$unsorted) (X $$unsorted)) (not (tptp.member Y (tptp.intersection (tptp.complement X) X)))))
% 0.46/0.70 (assume a102 (forall ((Z $$unsorted)) (not (tptp.member Z tptp.null_class))))
% 0.46/0.70 (assume a103 (forall ((X $$unsorted)) (tptp.subclass tptp.null_class X)))
% 0.46/0.70 (assume a104 (forall ((X $$unsorted)) (or (not (tptp.subclass X tptp.null_class)) (= X tptp.null_class))))
% 0.46/0.70 (assume a105 (forall ((Z $$unsorted)) (or (= Z tptp.null_class) (tptp.member (tptp.not_subclass_element Z tptp.null_class) Z))))
% 0.46/0.70 (assume a106 (tptp.member tptp.null_class tptp.universal_class))
% 0.46/0.70 (assume a107 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair X Y) (tptp.unordered_pair Y X))))
% 0.46/0.70 (assume a108 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.subclass (tptp.singleton X) (tptp.unordered_pair X Y))))
% 0.46/0.70 (assume a109 (forall ((Y $$unsorted) (X $$unsorted)) (tptp.subclass (tptp.singleton Y) (tptp.unordered_pair X Y))))
% 0.46/0.70 (assume a110 (forall ((Y $$unsorted) (X $$unsorted)) (or (tptp.member Y tptp.universal_class) (= (tptp.unordered_pair X Y) (tptp.singleton X)))))
% 0.46/0.70 (assume a111 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member X tptp.universal_class) (= (tptp.unordered_pair X Y) (tptp.singleton Y)))))
% 0.46/0.70 (assume a112 (forall ((X $$unsorted) (Y $$unsorted)) (or (= (tptp.unordered_pair X Y) tptp.null_class) (tptp.member X tptp.universal_class) (tptp.member Y tptp.universal_class))))
% 0.46/0.70 (assume a113 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.unordered_pair X Y) (tptp.unordered_pair X Z))) (not (tptp.member (tptp.ordered_pair Y Z) (tptp.cross_product tptp.universal_class tptp.universal_class))) (= Y Z))))
% 0.46/0.70 (assume a114 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (not (= (tptp.unordered_pair X Z) (tptp.unordered_pair Y Z))) (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product tptp.universal_class tptp.universal_class))) (= X Y))))
% 0.46/0.70 (assume a115 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (not (= (tptp.unordered_pair X Y) tptp.null_class)))))
% 0.46/0.70 (assume a116 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (not (= (tptp.unordered_pair X Y) tptp.null_class)))))
% 0.46/0.70 (assume a117 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product U V))) (not (= (tptp.unordered_pair X Y) tptp.null_class)))))
% 0.46/0.70 (assume a118 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Z)) (not (tptp.member Y Z)) (tptp.subclass (tptp.unordered_pair X Y) Z))))
% 0.46/0.70 (assume a119 (forall ((X $$unsorted)) (tptp.member (tptp.singleton X) tptp.universal_class)))
% 0.46/0.70 (assume a120 (forall ((Y $$unsorted) (X $$unsorted)) (tptp.member (tptp.singleton Y) (tptp.unordered_pair X (tptp.singleton Y)))))
% 0.46/0.70 (assume a121 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.singleton X)))))
% 0.46/0.70 (assume a122 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (not (= (tptp.singleton X) tptp.null_class)))))
% 0.46/0.70 (assume a123 (tptp.member tptp.null_class (tptp.singleton tptp.null_class)))
% 0.46/0.70 (assume a124 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y (tptp.singleton X))) (= Y X))))
% 0.46/0.70 (assume a125 (forall ((X $$unsorted)) (or (tptp.member X tptp.universal_class) (= (tptp.singleton X) tptp.null_class))))
% 0.46/0.70 (assume a126 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))))
% 0.46/0.70 (assume a127 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member Y tptp.universal_class)) (= X Y))))
% 0.46/0.70 (assume a128 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (= (tptp.unordered_pair Y Z) (tptp.singleton X))) (not (tptp.member X tptp.universal_class)) (= X Y) (= X Z))))
% 0.46/0.70 (assume a129 (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (tptp.member (tptp.member_of (tptp.singleton Y)) tptp.universal_class))))
% 0.46/0.70 (assume a130 (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton (tptp.member_of (tptp.singleton Y))) (tptp.singleton Y)))))
% 0.46/0.70 (assume a131 (forall ((X $$unsorted)) (or (tptp.member (tptp.member_of X) tptp.universal_class) (= (tptp.member_of X) X))))
% 0.46/0.70 (assume a132 (forall ((X $$unsorted)) (or (= (tptp.singleton (tptp.member_of X)) X) (= (tptp.member_of X) X))))
% 0.46/0.70 (assume a133 (forall ((U $$unsorted)) (or (not (tptp.member U tptp.universal_class)) (= (tptp.member_of (tptp.singleton U)) U))))
% 0.46/0.70 (assume a134 (forall ((X $$unsorted)) (or (tptp.member (tptp.member_of1 X) tptp.universal_class) (= (tptp.member_of X) X))))
% 0.46/0.70 (assume a135 (forall ((X $$unsorted)) (or (= (tptp.singleton (tptp.member_of1 X)) X) (= (tptp.member_of X) X))))
% 0.46/0.70 (assume a136 (forall ((X $$unsorted)) (or (not (= (tptp.singleton (tptp.member_of X)) X)) (tptp.member X tptp.universal_class))))
% 0.46/0.70 (assume a137 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton (tptp.member_of X)) X)) (not (tptp.member Y X)) (= (tptp.member_of X) Y))))
% 0.46/0.70 (assume a138 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Y)) (tptp.subclass (tptp.singleton X) Y))))
% 0.46/0.70 (assume a139 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subclass X (tptp.singleton Y))) (= X tptp.null_class) (= (tptp.singleton Y) X))))
% 0.46/0.70 (assume a140 (forall ((X $$unsorted)) (or (tptp.member (tptp.not_subclass_element (tptp.intersection (tptp.complement (tptp.singleton (tptp.not_subclass_element X tptp.null_class))) X) tptp.null_class) (tptp.intersection (tptp.complement (tptp.singleton (tptp.not_subclass_element X tptp.null_class))) X)) (= (tptp.singleton (tptp.not_subclass_element X tptp.null_class)) X) (= X tptp.null_class))))
% 0.46/0.70 (assume a141 (forall ((X $$unsorted)) (or (tptp.member (tptp.not_subclass_element (tptp.intersection (tptp.complement (tptp.singleton (tptp.not_subclass_element X tptp.null_class))) X) tptp.null_class) X) (= (tptp.singleton (tptp.not_subclass_element X tptp.null_class)) X) (= X tptp.null_class))))
% 0.46/0.70 (assume a142 (forall ((X $$unsorted)) (or (not (= (tptp.not_subclass_element (tptp.intersection (tptp.complement (tptp.singleton (tptp.not_subclass_element X tptp.null_class))) X) tptp.null_class) (tptp.not_subclass_element X tptp.null_class))) (= (tptp.singleton (tptp.not_subclass_element X tptp.null_class)) X) (= X tptp.null_class))))
% 0.46/0.70 (assume a143 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair X Y) (tptp.union (tptp.singleton X) (tptp.singleton Y)))))
% 0.46/0.70 (assume a144 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)))
% 0.46/0.70 (assume a145 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.singleton X) (tptp.ordered_pair X Y))))
% 0.46/0.70 (assume a146 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X (tptp.singleton Y)) (tptp.ordered_pair X Y))))
% 0.46/0.70 (assume a147 (forall ((X $$unsorted) (Y $$unsorted)) (or (= (tptp.unordered_pair (tptp.singleton X) (tptp.unordered_pair X tptp.null_class)) (tptp.ordered_pair X Y)) (tptp.member Y tptp.universal_class))))
% 0.46/0.70 (assume a148 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.unordered_pair tptp.null_class (tptp.singleton (tptp.singleton Y))) (tptp.ordered_pair X Y)) (tptp.member X tptp.universal_class))))
% 0.46/0.70 (assume a149 (forall ((X $$unsorted) (Y $$unsorted)) (or (= (tptp.unordered_pair tptp.null_class (tptp.singleton tptp.null_class)) (tptp.ordered_pair X Y)) (tptp.member X tptp.universal_class) (tptp.member Y tptp.universal_class))))
% 0.46/0.70 (assume a150 (forall ((W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.ordered_pair W X) (tptp.ordered_pair Y Z))) (not (tptp.member W tptp.universal_class)) (= W Y))))
% 0.46/0.70 (assume a151 (forall ((W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.ordered_pair W X) (tptp.ordered_pair Y Z))) (not (tptp.member X tptp.universal_class)) (= X Z))))
% 0.46/0.70 (assume a152 (forall ((Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.ordered_pair Y Z) (tptp.cross_product tptp.universal_class tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.first (tptp.ordered_pair Y Z)) (tptp.second (tptp.ordered_pair Y Z))) (tptp.cross_product tptp.universal_class tptp.universal_class)))))
% 0.46/0.70 (assume a153 (forall ((X $$unsorted)) (or (tptp.member (tptp.ordered_pair (tptp.first X) (tptp.second X)) (tptp.cross_product tptp.universal_class tptp.universal_class)) (= (tptp.first X) X))))
% 0.46/0.70 (assume a154 (forall ((X $$unsorted)) (or (tptp.member (tptp.ordered_pair (tptp.first X) (tptp.second X)) (tptp.cross_product tptp.universal_class tptp.universal_class)) (= (tptp.second X) X))))
% 0.46/0.70 (assume a155 (forall ((X $$unsorted)) (or (= (tptp.ordered_pair (tptp.first X) (tptp.second X)) X) (= (tptp.first X) X))))
% 0.46/0.70 (assume a156 (forall ((X $$unsorted)) (or (= (tptp.ordered_pair (tptp.first X) (tptp.second X)) X) (= (tptp.second X) X))))
% 0.46/0.70 (assume a157 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product tptp.universal_class tptp.universal_class))) (= (tptp.first (tptp.ordered_pair U V)) U))))
% 0.46/0.70 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product tptp.universal_class tptp.universal_class))) (= (tptp.second (tptp.ordered_pair U V)) V))))
% 0.46/0.70 (assume a159 (forall ((X $$unsorted)) (or (tptp.member (tptp.ordered_pair (tptp.first X) (tptp.second X)) (tptp.cross_product tptp.universal_class tptp.universal_class)) (= (tptp.first X) X))))
% 0.46/0.70 (assume a160 (forall ((X $$unsorted)) (or (tptp.member (tptp.ordered_pair (tptp.first X) (tptp.second X)) (tptp.cross_product tptp.universal_class tptp.universal_class)) (= (tptp.second X) X))))
% 0.46/0.70 (assume a161 (forall ((X $$unsorted)) (or (= (tptp.ordered_pair (tptp.first X) (tptp.second X)) X) (= (tptp.first X) X))))
% 0.46/0.70 (assume a162 (forall ((X $$unsorted)) (or (= (tptp.ordered_pair (tptp.first X) (tptp.second X)) X) (= (tptp.second X) X))))
% 0.46/0.70 (assume a163 (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 0.46/0.70 (assume a164 (not (tptp.member tptp.x tptp.universal_class)))
% 0.46/0.70 (step t1 (cl (not (= (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (or (tptp.member tptp.x tptp.universal_class) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))))) (not (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) (or (tptp.member tptp.x tptp.universal_class) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule equiv_pos2)
% 0.46/0.70 (step t2 (cl (= (= (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class)) true) (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class)))) :rule equiv_simplify)
% 0.46/0.70 (step t3 (cl (not (= (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class)) true)) (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class))) :rule equiv1 :premises (t2))
% 0.46/0.70 (step t4 (cl (= (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class)) (= (tptp.member tptp.x tptp.universal_class) (not (not (tptp.member tptp.x tptp.universal_class)))))) :rule all_simplify)
% 0.46/0.70 (step t5 (cl (= (tptp.member tptp.x tptp.universal_class) (tptp.member tptp.x tptp.universal_class))) :rule refl)
% 0.46/0.70 (step t6 (cl (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class))) :rule all_simplify)
% 0.46/0.70 (step t7 (cl (= (= (tptp.member tptp.x tptp.universal_class) (not (not (tptp.member tptp.x tptp.universal_class)))) (= (tptp.member tptp.x tptp.universal_class) (tptp.member tptp.x tptp.universal_class)))) :rule cong :premises (t5 t6))
% 0.46/0.70 (step t8 (cl (= (= (tptp.member tptp.x tptp.universal_class) (tptp.member tptp.x tptp.universal_class)) true)) :rule all_simplify)
% 0.46/0.70 (step t9 (cl (= (= (tptp.member tptp.x tptp.universal_class) (not (not (tptp.member tptp.x tptp.universal_class)))) true)) :rule trans :premises (t7 t8))
% 0.46/0.70 (step t10 (cl (= (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class)) true)) :rule trans :premises (t4 t9))
% 0.46/0.70 (step t11 (cl (= (not (not (tptp.member tptp.x tptp.universal_class))) (tptp.member tptp.x tptp.universal_class))) :rule resolution :premises (t3 t10))
% 0.46/0.70 (step t12 (cl (= (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule refl)
% 0.46/0.70 (step t13 (cl (= (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule refl)
% 0.46/0.70 (step t14 (cl (= (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (or (tptp.member tptp.x tptp.universal_class) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))))) :rule cong :premises (t11 t12 t13))
% 0.46/0.70 (step t15 (cl (not (= (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))))) (not (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule equiv_pos2)
% 0.46/0.70 (step t16 (cl (= (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule refl)
% 0.46/0.70 (step t17 (cl (= (= (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))))) :rule equiv_simplify)
% 0.46/0.70 (step t18 (cl (= (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (not (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))))) :rule equiv2 :premises (t17))
% 0.46/0.70 (step t19 (cl (not (not (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))))) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule not_not)
% 0.46/0.70 (step t20 (cl (= (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule resolution :premises (t18 t19))
% 0.46/0.70 (step t21 (cl (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule implies_neg1)
% 0.46/0.70 (anchor :step t22)
% 0.46/0.70 (assume t22.a0 (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))
% 0.46/0.70 (assume t22.a1 (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))
% 0.46/0.70 (assume t22.a2 (not (tptp.member tptp.x tptp.universal_class)))
% 0.46/0.70 (step t22.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 0.46/0.70 (step t22.t2 (cl (= (= false true) false)) :rule all_simplify)
% 0.46/0.70 (step t22.t3 (cl (= (= (tptp.member tptp.x tptp.universal_class) false) (not (tptp.member tptp.x tptp.universal_class)))) :rule equiv_simplify)
% 0.46/0.70 (step t22.t4 (cl (= (tptp.member tptp.x tptp.universal_class) false) (not (not (tptp.member tptp.x tptp.universal_class)))) :rule equiv2 :premises (t22.t3))
% 0.46/0.70 (step t22.t5 (cl (not (not (not (tptp.member tptp.x tptp.universal_class)))) (tptp.member tptp.x tptp.universal_class)) :rule not_not)
% 0.46/0.70 (step t22.t6 (cl (= (tptp.member tptp.x tptp.universal_class) false) (tptp.member tptp.x tptp.universal_class)) :rule resolution :premises (t22.t4 t22.t5))
% 0.46/0.70 (step t22.t7 (cl (= (tptp.member tptp.x tptp.universal_class) false)) :rule resolution :premises (t22.t6 t22.a2))
% 0.46/0.70 (step t22.t8 (cl (= false (tptp.member tptp.x tptp.universal_class))) :rule symm :premises (t22.t7))
% 0.46/0.70 (step t22.t9 (cl (= (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.x)) :rule symm :premises (t22.a1))
% 0.46/0.70 (step t22.t10 (cl (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) :rule symm :premises (t22.t9))
% 0.46/0.70 (step t22.t11 (cl (= tptp.universal_class tptp.universal_class)) :rule refl)
% 0.46/0.70 (step t22.t12 (cl (= (tptp.member tptp.x tptp.universal_class) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule cong :premises (t22.t10 t22.t11))
% 0.46/0.70 (step t22.t13 (cl (= (= (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) true) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule equiv_simplify)
% 0.46/0.70 (step t22.t14 (cl (= (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) true) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule equiv2 :premises (t22.t13))
% 0.46/0.70 (step t22.t15 (cl (= (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) true)) :rule resolution :premises (t22.t14 t22.a0))
% 0.46/0.70 (step t22.t16 (cl (= false true)) :rule trans :premises (t22.t8 t22.t12 t22.t15))
% 0.46/0.70 (step t22.t17 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t16))
% 0.46/0.70 (step t22 (cl (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (not (tptp.member tptp.x tptp.universal_class))) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 0.46/0.70 (step t23 (cl (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule and_pos)
% 0.46/0.70 (step t24 (cl (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) :rule and_pos)
% 0.46/0.70 (step t25 (cl (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (tptp.member tptp.x tptp.universal_class))) :rule and_pos)
% 0.46/0.70 (step t26 (cl false (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) :rule resolution :premises (t22 t23 t24 t25))
% 0.46/0.70 (step t27 (cl (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) false) :rule reordering :premises (t26))
% 0.46/0.70 (step t28 (cl (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) false) :rule contraction :premises (t27))
% 0.46/0.70 (step t29 (cl (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) false) :rule resolution :premises (t21 t28))
% 0.46/0.70 (step t30 (cl (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (not false)) :rule implies_neg2)
% 0.46/0.70 (step t31 (cl (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false)) :rule resolution :premises (t29 t30))
% 0.46/0.70 (step t32 (cl (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false)) :rule contraction :premises (t31))
% 0.46/0.70 (step t33 (cl (= (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))))) :rule implies_simplify)
% 0.46/0.70 (step t34 (cl (not (=> (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false)) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) :rule equiv1 :premises (t33))
% 0.46/0.70 (step t35 (cl (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) :rule resolution :premises (t32 t34))
% 0.46/0.70 (step t36 (cl (= (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) false)) :rule resolution :premises (t20 t35))
% 0.46/0.70 (step t37 (cl (= (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) false))) :rule cong :premises (t16 t36))
% 0.46/0.70 (step t38 (cl (= (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) false) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))))) :rule all_simplify)
% 0.46/0.70 (step t39 (cl (= (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))))) :rule trans :premises (t37 t38))
% 0.46/0.70 (step t40 (cl (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule implies_neg1)
% 0.46/0.70 (anchor :step t41)
% 0.46/0.70 (assume t41.a0 (not (tptp.member tptp.x tptp.universal_class)))
% 0.46/0.70 (assume t41.a1 (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))
% 0.46/0.70 (assume t41.a2 (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))
% 0.46/0.70 (step t41.t1 (cl (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (not (tptp.member tptp.x tptp.universal_class)))) :rule and_neg)
% 0.46/0.70 (step t41.t2 (cl (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule resolution :premises (t41.t1 t41.a2 t41.a1 t41.a0))
% 0.46/0.70 (step t41 (cl (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 0.46/0.70 (step t42 (cl (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (tptp.member tptp.x tptp.universal_class))) :rule and_pos)
% 0.46/0.70 (step t43 (cl (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) :rule and_pos)
% 0.46/0.70 (step t44 (cl (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule and_pos)
% 0.46/0.70 (step t45 (cl (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule resolution :premises (t41 t42 t43 t44))
% 0.46/0.70 (step t46 (cl (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule reordering :premises (t45))
% 0.46/0.70 (step t47 (cl (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule contraction :premises (t46))
% 0.46/0.70 (step t48 (cl (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) :rule resolution :premises (t40 t47))
% 0.46/0.70 (step t49 (cl (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (not (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) :rule implies_neg2)
% 0.46/0.70 (step t50 (cl (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class)))) (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) :rule resolution :premises (t48 t49))
% 0.46/0.70 (step t51 (cl (=> (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (and (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (tptp.member tptp.x tptp.universal_class))))) :rule contraction :premises (t50))
% 0.46/0.70 (step t52 (cl (not (and (not (tptp.member tptp.x tptp.universal_class)) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule resolution :premises (t15 t39 t51))
% 0.46/0.70 (step t53 (cl (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule not_and :premises (t52))
% 0.46/0.70 (step t54 (cl (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (not (not (tptp.member tptp.x tptp.universal_class))))) :rule or_neg)
% 0.46/0.70 (step t55 (cl (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule or_neg)
% 0.46/0.70 (step t56 (cl (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (not (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule or_neg)
% 0.46/0.70 (step t57 (cl (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule resolution :premises (t53 t54 t55 t56))
% 0.46/0.70 (step t58 (cl (or (not (not (tptp.member tptp.x tptp.universal_class))) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule contraction :premises (t57))
% 0.46/0.70 (step t59 (cl (or (tptp.member tptp.x tptp.universal_class) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)))) :rule resolution :premises (t1 t14 t58))
% 0.46/0.70 (step t60 (cl (tptp.member tptp.x tptp.universal_class) (not (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule or :premises (t59))
% 0.46/0.70 (step t61 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class))) :rule implies_neg1)
% 0.46/0.70 (anchor :step t62)
% 0.46/0.70 (assume t62.a0 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)))
% 0.46/0.70 (step t62.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule forall_inst :args ((:= X (tptp.first tptp.x)) (:= Y (tptp.second tptp.x))))
% 0.46/0.70 (step t62.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule or :premises (t62.t1))
% 0.46/0.70 (step t62.t3 (cl (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule resolution :premises (t62.t2 t62.a0))
% 0.46/0.70 (step t62 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule subproof :discharge (t62.a0))
% 0.46/0.70 (step t63 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule resolution :premises (t61 t62))
% 0.46/0.70 (step t64 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (not (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule implies_neg2)
% 0.46/0.70 (step t65 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule resolution :premises (t63 t64))
% 0.46/0.70 (step t66 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class))) :rule contraction :premises (t65))
% 0.46/0.70 (step t67 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class))) (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule implies :premises (t66))
% 0.46/0.70 (step t68 (cl (tptp.member (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)) tptp.universal_class)) :rule resolution :premises (t67 a144))
% 0.46/0.70 (step t69 (cl (not (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) :rule or_pos)
% 0.46/0.70 (step t70 (cl (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))) (not (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule reordering :premises (t69))
% 0.46/0.70 (step t71 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) :rule implies_neg1)
% 0.46/0.70 (anchor :step t72)
% 0.46/0.70 (assume t72.a0 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))))
% 0.46/0.70 (step t72.t1 (cl (or (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule forall_inst :args ((:= Z tptp.x) (:= X tptp.universal_class) (:= Y tptp.universal_class)))
% 0.46/0.70 (step t72.t2 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) :rule or :premises (t72.t1))
% 0.46/0.70 (step t72.t3 (cl (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) :rule resolution :premises (t72.t2 t72.a0))
% 0.46/0.70 (step t72 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) :rule subproof :discharge (t72.a0))
% 0.46/0.70 (step t73 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) :rule resolution :premises (t71 t72))
% 0.46/0.70 (step t74 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) (not (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule implies_neg2)
% 0.46/0.70 (step t75 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule resolution :premises (t73 t74))
% 0.46/0.70 (step t76 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))))) :rule contraction :premises (t75))
% 0.46/0.70 (step t77 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) :rule implies :premises (t76))
% 0.46/0.70 (step t78 (cl (not (= (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))))) (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) :rule equiv_pos2)
% 0.46/0.70 (anchor :step t79 :args ((Z $$unsorted) (:= Z Z) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 0.46/0.70 (step t79.t1 (cl (= Z Z)) :rule refl)
% 0.46/0.70 (step t79.t2 (cl (= X X)) :rule refl)
% 0.46/0.70 (step t79.t3 (cl (= Y Y)) :rule refl)
% 0.46/0.70 (step t79.t4 (cl (= (not (tptp.member Z (tptp.cross_product X Y))) (not (tptp.member Z (tptp.cross_product X Y))))) :rule refl)
% 0.46/0.70 (step t79.t5 (cl (= (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) :rule all_simplify)
% 0.46/0.70 (step t79.t6 (cl (= (or (not (tptp.member Z (tptp.cross_product X Y))) (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) :rule cong :premises (t79.t4 t79.t5))
% 0.46/0.70 (step t79 (cl (= (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))))) :rule bind)
% 0.46/0.70 (step t80 (cl (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z)))))) :rule resolution :premises (t78 t79 a16))
% 0.46/0.70 (step t81 (cl (or (not (tptp.member tptp.x (tptp.cross_product tptp.universal_class tptp.universal_class))) (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x))))) :rule resolution :premises (t77 t80))
% 0.46/0.70 (step t82 (cl (= tptp.x (tptp.ordered_pair (tptp.first tptp.x) (tptp.second tptp.x)))) :rule resolution :premises (t70 a163 t81))
% 0.46/0.70 (step t83 (cl) :rule resolution :premises (t60 t68 t82 a164))
% 0.46/0.70
% 0.46/0.70 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.V95w5PMzva/cvc5---1.0.5_2808.smt2
% 0.46/0.71 % cvc5---1.0.5 exiting
% 0.46/0.71 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------