TSTP Solution File: SET090-7 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SET090-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n032.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:08 EDT 2024
% Result : Unsatisfiable 0.17s 0.50s
% Output : Proof 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET090-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : do_cvc5 %s %d
% 0.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue May 28 09:54:08 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.43 %----Proving TF0_NAR, FOF, or CNF
% 0.17/0.44 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.17/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.qxmNVkKawg/cvc5---1.0.5_26432.smt2
% 0.17/0.50 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.qxmNVkKawg/cvc5---1.0.5_26432.smt2
% 0.17/0.50 (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.17/0.50 (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member (tptp.not_subclass_element X Y) X) (tptp.subclass X Y))))
% 0.17/0.50 (assume a2 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (tptp.subclass X Y))))
% 0.17/0.50 (assume a3 (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)))
% 0.17/0.50 (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass X Y))))
% 0.17/0.50 (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass Y X))))
% 0.17/0.50 (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.subclass Y X)) (= X Y))))
% 0.17/0.50 (assume a7 (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.unordered_pair X Y))) (= U X) (= U Y))))
% 0.17/0.50 (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.unordered_pair X Y)))))
% 0.17/0.50 (assume a9 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (tptp.member Y (tptp.unordered_pair X Y)))))
% 0.17/0.50 (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X Y) tptp.universal_class)))
% 0.17/0.50 (assume a11 (forall ((X $$unsorted)) (= (tptp.unordered_pair X X) (tptp.singleton X))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a17 (tptp.subclass tptp.element_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 0.17/0.50 (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.element_relation)) (tptp.member X Y))))
% 0.17/0.50 (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.17/0.50 (assume a20 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))))
% 0.17/0.50 (assume a21 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z Y))))
% 0.17/0.50 (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.17/0.50 (assume a23 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))))
% 0.17/0.50 (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.17/0.50 (assume a25 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))))
% 0.17/0.50 (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.17/0.50 (assume a27 (forall ((Xr $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.intersection Xr (tptp.cross_product X Y)) (tptp.restrict Xr X Y))))
% 0.17/0.50 (assume a28 (forall ((X $$unsorted) (Y $$unsorted) (Xr $$unsorted)) (= (tptp.intersection (tptp.cross_product X Y) Xr) (tptp.restrict Xr X Y))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a37 (forall ((Y $$unsorted)) (= (tptp.domain_of (tptp.flip (tptp.cross_product Y tptp.universal_class))) (tptp.inverse Y))))
% 0.17/0.50 (assume a38 (forall ((Z $$unsorted)) (= (tptp.domain_of (tptp.inverse Z)) (tptp.range_of Z))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (assume a41 (forall ((Xr $$unsorted) (X $$unsorted)) (= (tptp.range_of (tptp.restrict Xr X tptp.universal_class)) (tptp.image Xr X))))
% 0.17/0.50 (assume a42 (forall ((X $$unsorted)) (= (tptp.union X (tptp.singleton X)) (tptp.successor X))))
% 0.17/0.50 (assume a43 (tptp.subclass tptp.successor_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 0.17/0.50 (assume a44 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.successor_relation)) (= (tptp.successor X) Y))))
% 0.17/0.50 (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.17/0.50 (assume a46 (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.member tptp.null_class X))))
% 0.17/0.50 (assume a47 (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.subclass (tptp.image tptp.successor_relation X) X))))
% 0.17/0.50 (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.17/0.50 (assume a49 (tptp.inductive tptp.omega))
% 0.17/0.50 (assume a50 (forall ((Y $$unsorted)) (or (not (tptp.inductive Y)) (tptp.subclass tptp.omega Y))))
% 0.17/0.50 (assume a51 (tptp.member tptp.omega tptp.universal_class))
% 0.17/0.50 (assume a52 (forall ((X $$unsorted)) (= (tptp.domain_of (tptp.restrict tptp.element_relation tptp.universal_class X)) (tptp.sum_class X))))
% 0.17/0.50 (assume a53 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.sum_class X) tptp.universal_class))))
% 0.17/0.50 (assume a54 (forall ((X $$unsorted)) (= (tptp.complement (tptp.image tptp.element_relation (tptp.complement X))) (tptp.power_class X))))
% 0.17/0.50 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.member U tptp.universal_class)) (tptp.member (tptp.power_class U) tptp.universal_class))))
% 0.17/0.50 (assume a56 (forall ((Yr $$unsorted) (Xr $$unsorted)) (tptp.subclass (tptp.compose Yr Xr) (tptp.cross_product tptp.universal_class tptp.universal_class))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (assume a59 (forall ((X $$unsorted)) (or (not (tptp.single_valued_class X)) (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation))))
% 0.17/0.50 (assume a60 (forall ((X $$unsorted)) (or (not (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation)) (tptp.single_valued_class X))))
% 0.17/0.50 (assume a61 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass Xf (tptp.cross_product tptp.universal_class tptp.universal_class)))))
% 0.17/0.50 (assume a62 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass (tptp.compose Xf (tptp.inverse Xf)) tptp.identity_relation))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (assume a65 (forall ((X $$unsorted)) (or (= X tptp.null_class) (tptp.member (tptp.regular X) X))))
% 0.17/0.50 (assume a66 (forall ((X $$unsorted)) (or (= X tptp.null_class) (= (tptp.intersection X (tptp.regular X)) tptp.null_class))))
% 0.17/0.50 (assume a67 (forall ((Xf $$unsorted) (Y $$unsorted)) (= (tptp.sum_class (tptp.image Xf (tptp.singleton Y))) (tptp.apply Xf Y))))
% 0.17/0.50 (assume a68 (tptp.function tptp.choice))
% 0.17/0.50 (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.17/0.50 (assume a70 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function Xf))))
% 0.17/0.50 (assume a71 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function (tptp.inverse Xf)))))
% 0.17/0.50 (assume a72 (forall ((Xf $$unsorted)) (or (not (tptp.function (tptp.inverse Xf))) (not (tptp.function Xf)) (tptp.one_to_one Xf))))
% 0.17/0.50 (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.17/0.50 (assume a74 (= (tptp.intersection (tptp.inverse tptp.subset_relation) tptp.subset_relation) tptp.identity_relation))
% 0.17/0.50 (assume a75 (forall ((Xr $$unsorted)) (= (tptp.complement (tptp.domain_of (tptp.intersection Xr tptp.identity_relation))) (tptp.diagonalise Xr))))
% 0.17/0.50 (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.17/0.50 (assume a77 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.function Xf))))
% 0.17/0.50 (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.17/0.50 (assume a79 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.subclass (tptp.range_of Xf) (tptp.domain_of (tptp.domain_of Xf))))))
% 0.17/0.50 (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.17/0.50 (assume a81 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (tptp.function Xh))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a85 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf1))))
% 0.17/0.50 (assume a86 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf2))))
% 0.17/0.50 (assume a87 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.compatible Xh Xf1 Xf2))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a95 (forall ((X $$unsorted)) (tptp.subclass X X)))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a101 (forall ((Y $$unsorted) (X $$unsorted)) (not (tptp.member Y (tptp.intersection (tptp.complement X) X)))))
% 0.17/0.50 (assume a102 (forall ((Z $$unsorted)) (not (tptp.member Z tptp.null_class))))
% 0.17/0.50 (assume a103 (forall ((X $$unsorted)) (tptp.subclass tptp.null_class X)))
% 0.17/0.50 (assume a104 (forall ((X $$unsorted)) (or (not (tptp.subclass X tptp.null_class)) (= X tptp.null_class))))
% 0.17/0.50 (assume a105 (forall ((Z $$unsorted)) (or (= Z tptp.null_class) (tptp.member (tptp.not_subclass_element Z tptp.null_class) Z))))
% 0.17/0.50 (assume a106 (tptp.member tptp.null_class tptp.universal_class))
% 0.17/0.50 (assume a107 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair X Y) (tptp.unordered_pair Y X))))
% 0.17/0.50 (assume a108 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.subclass (tptp.singleton X) (tptp.unordered_pair X Y))))
% 0.17/0.50 (assume a109 (forall ((Y $$unsorted) (X $$unsorted)) (tptp.subclass (tptp.singleton Y) (tptp.unordered_pair X Y))))
% 0.17/0.50 (assume a110 (forall ((Y $$unsorted) (X $$unsorted)) (or (tptp.member Y tptp.universal_class) (= (tptp.unordered_pair X Y) (tptp.singleton X)))))
% 0.17/0.50 (assume a111 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member X tptp.universal_class) (= (tptp.unordered_pair X Y) (tptp.singleton Y)))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a119 (forall ((X $$unsorted)) (tptp.member (tptp.singleton X) tptp.universal_class)))
% 0.17/0.50 (assume a120 (forall ((Y $$unsorted) (X $$unsorted)) (tptp.member (tptp.singleton Y) (tptp.unordered_pair X (tptp.singleton Y)))))
% 0.17/0.50 (assume a121 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.singleton X)))))
% 0.17/0.50 (assume a122 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (not (= (tptp.singleton X) tptp.null_class)))))
% 0.17/0.50 (assume a123 (tptp.member tptp.null_class (tptp.singleton tptp.null_class)))
% 0.17/0.50 (assume a124 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y (tptp.singleton X))) (= Y X))))
% 0.17/0.50 (assume a125 (forall ((X $$unsorted)) (or (tptp.member X tptp.universal_class) (= (tptp.singleton X) tptp.null_class))))
% 0.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (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.17/0.50 (assume a131 (forall ((X $$unsorted)) (or (tptp.member (tptp.member_of X) tptp.universal_class) (= (tptp.member_of X) X))))
% 0.17/0.50 (assume a132 (forall ((X $$unsorted)) (or (= (tptp.singleton (tptp.member_of X)) X) (= (tptp.member_of X) X))))
% 0.17/0.50 (assume a133 (tptp.member tptp.u tptp.universal_class))
% 0.17/0.50 (assume a134 (not (= (tptp.member_of (tptp.singleton tptp.u)) tptp.u)))
% 0.17/0.50 (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y)))) :rule implies_neg1)
% 0.17/0.50 (anchor :step t2)
% 0.17/0.50 (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))))
% 0.17/0.50 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y)))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))))) :rule forall_inst :args ((:= X tptp.u) (:= Y (tptp.member_of (tptp.singleton tptp.u)))))
% 0.17/0.50 (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y)))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) :rule or :premises (t2.t1))
% 0.17/0.50 (step t2.t3 (cl (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.17/0.50 (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y)))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) :rule subproof :discharge (t2.a0))
% 0.17/0.50 (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) :rule resolution :premises (t1 t2))
% 0.17/0.50 (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) (not (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))))) :rule implies_neg2)
% 0.17/0.50 (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))))) :rule resolution :premises (t3 t4))
% 0.17/0.50 (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))))) :rule contraction :premises (t5))
% 0.17/0.50 (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y)))) (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) :rule implies :premises (t6))
% 0.17/0.50 (step t8 (cl (not (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))) :rule or_pos)
% 0.17/0.50 (step t9 (cl (= tptp.u (tptp.member_of (tptp.singleton tptp.u))) (not (tptp.member tptp.u tptp.universal_class)) (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))))) :rule reordering :premises (t8))
% 0.17/0.50 (step t10 (cl (not (= tptp.u (tptp.member_of (tptp.singleton tptp.u))))) :rule not_symm :premises (a134))
% 0.17/0.50 (step t11 (cl (not (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) :rule or_pos)
% 0.17/0.50 (step t12 (cl (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))) (not (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))))) :rule reordering :premises (t11))
% 0.17/0.50 (step t13 (cl (=> (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) :rule implies_neg1)
% 0.17/0.50 (anchor :step t14)
% 0.17/0.50 (assume t14.a0 (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))))
% 0.17/0.50 (step t14.t1 (cl (or (not (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))))) :rule forall_inst :args ((:= Y tptp.u)))
% 0.17/0.50 (step t14.t2 (cl (not (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) :rule or :premises (t14.t1))
% 0.17/0.50 (step t14.t3 (cl (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) :rule resolution :premises (t14.t2 t14.a0))
% 0.17/0.50 (step t14 (cl (not (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) :rule subproof :discharge (t14.a0))
% 0.17/0.50 (step t15 (cl (=> (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) :rule resolution :premises (t13 t14))
% 0.17/0.50 (step t16 (cl (=> (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) (not (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))))) :rule implies_neg2)
% 0.17/0.50 (step t17 (cl (=> (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) (=> (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))))) :rule resolution :premises (t15 t16))
% 0.17/0.50 (step t18 (cl (=> (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))))) :rule contraction :premises (t17))
% 0.17/0.50 (step t19 (cl (not (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) :rule implies :premises (t18))
% 0.17/0.50 (step t20 (cl (not (= (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton (tptp.member_of (tptp.singleton Y))) (tptp.singleton Y)))) (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))))) (not (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton (tptp.member_of (tptp.singleton Y))) (tptp.singleton Y))))) (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) :rule equiv_pos2)
% 0.17/0.50 (anchor :step t21 :args ((Y $$unsorted) (:= Y Y)))
% 0.17/0.50 (step t21.t1 (cl (= Y Y)) :rule refl)
% 0.17/0.50 (step t21.t2 (cl (= (not (tptp.member Y tptp.universal_class)) (not (tptp.member Y tptp.universal_class)))) :rule refl)
% 0.17/0.50 (step t21.t3 (cl (= (= (tptp.singleton (tptp.member_of (tptp.singleton Y))) (tptp.singleton Y)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))) :rule all_simplify)
% 0.17/0.50 (step t21.t4 (cl (= (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton (tptp.member_of (tptp.singleton Y))) (tptp.singleton Y))) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) :rule cong :premises (t21.t2 t21.t3))
% 0.17/0.50 (step t21 (cl (= (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton (tptp.member_of (tptp.singleton Y))) (tptp.singleton Y)))) (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y)))))))) :rule bind)
% 0.17/0.50 (step t22 (cl (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton Y) (tptp.singleton (tptp.member_of (tptp.singleton Y))))))) :rule resolution :premises (t20 t21 a130))
% 0.17/0.50 (step t23 (cl (or (not (tptp.member tptp.u tptp.universal_class)) (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u)))))) :rule resolution :premises (t19 t22))
% 0.17/0.50 (step t24 (cl (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) :rule resolution :premises (t12 a133 t23))
% 0.17/0.50 (step t25 (cl (not (or (not (= (tptp.singleton tptp.u) (tptp.singleton (tptp.member_of (tptp.singleton tptp.u))))) (not (tptp.member tptp.u tptp.universal_class)) (= tptp.u (tptp.member_of (tptp.singleton tptp.u)))))) :rule resolution :premises (t9 t10 a133 t24))
% 0.17/0.50 (step t26 (cl) :rule resolution :premises (t7 t25 a126))
% 0.17/0.50
% 0.17/0.50 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.qxmNVkKawg/cvc5---1.0.5_26432.smt2
% 0.17/0.51 % cvc5---1.0.5 exiting
% 0.17/0.51 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------