%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET167-6 : TPTP v8.2.0. Bugfixed v2.1.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:23 EDT 2024

% Result   : Unsatisfiable 23.06s 23.32s
% Output   : Proof 23.06s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem    : SET167-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.05/0.13  % Command    : do_cvc5 %s %d
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue May 28 09:01:54 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.18/0.49  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.50/10.77  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.51/15.82  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.58/20.86  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 23.06/23.32  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.wdTPwhq5o2/cvc5---1.0.5_13970.smt2
% 23.06/23.32  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.wdTPwhq5o2/cvc5---1.0.5_13970.smt2
% 23.06/23.33  (assume a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))))
% 23.06/23.33  (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member (tptp.not_subclass_element X Y) X) (tptp.subclass X Y))))
% 23.06/23.33  (assume a2 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (tptp.subclass X Y))))
% 23.06/23.33  (assume a3 (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)))
% 23.06/23.33  (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass X Y))))
% 23.06/23.33  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass Y X))))
% 23.06/23.33  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.subclass Y X)) (= X Y))))
% 23.06/23.33  (assume a7 (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.unordered_pair X Y))) (= U X) (= U Y))))
% 23.06/23.33  (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.unordered_pair X Y)))))
% 23.06/23.33  (assume a9 (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (tptp.member Y (tptp.unordered_pair X Y)))))
% 23.06/23.33  (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X Y) tptp.universal_class)))
% 23.06/23.33  (assume a11 (forall ((X $$unsorted)) (= (tptp.unordered_pair X X) (tptp.singleton X))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a17 (tptp.subclass tptp.element_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 23.06/23.33  (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.element_relation)) (tptp.member X Y))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a20 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))))
% 23.06/23.33  (assume a21 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z Y))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (assume a23 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a25 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a27 (forall ((Xr $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.intersection Xr (tptp.cross_product X Y)) (tptp.restrict Xr X Y))))
% 23.06/23.33  (assume a28 (forall ((X $$unsorted) (Y $$unsorted) (Xr $$unsorted)) (= (tptp.intersection (tptp.cross_product X Y) Xr) (tptp.restrict Xr X Y))))
% 23.06/23.33  (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))))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (assume a37 (forall ((Y $$unsorted)) (= (tptp.domain_of (tptp.flip (tptp.cross_product Y tptp.universal_class))) (tptp.inverse Y))))
% 23.06/23.33  (assume a38 (forall ((Z $$unsorted)) (= (tptp.domain_of (tptp.inverse Z)) (tptp.range_of Z))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a41 (forall ((Xr $$unsorted) (X $$unsorted)) (= (tptp.range_of (tptp.restrict Xr X tptp.universal_class)) (tptp.image Xr X))))
% 23.06/23.33  (assume a42 (forall ((X $$unsorted)) (= (tptp.union X (tptp.singleton X)) (tptp.successor X))))
% 23.06/23.33  (assume a43 (tptp.subclass tptp.successor_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 23.06/23.33  (assume a44 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.successor_relation)) (= (tptp.successor X) Y))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a46 (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.member tptp.null_class X))))
% 23.06/23.33  (assume a47 (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.subclass (tptp.image tptp.successor_relation X) X))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a49 (tptp.inductive tptp.omega))
% 23.06/23.33  (assume a50 (forall ((Y $$unsorted)) (or (not (tptp.inductive Y)) (tptp.subclass tptp.omega Y))))
% 23.06/23.33  (assume a51 (tptp.member tptp.omega tptp.universal_class))
% 23.06/23.33  (assume a52 (forall ((X $$unsorted)) (= (tptp.domain_of (tptp.restrict tptp.element_relation tptp.universal_class X)) (tptp.sum_class X))))
% 23.06/23.33  (assume a53 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.sum_class X) tptp.universal_class))))
% 23.06/23.33  (assume a54 (forall ((X $$unsorted)) (= (tptp.complement (tptp.image tptp.element_relation (tptp.complement X))) (tptp.power_class X))))
% 23.06/23.33  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.member U tptp.universal_class)) (tptp.member (tptp.power_class U) tptp.universal_class))))
% 23.06/23.33  (assume a56 (forall ((Yr $$unsorted) (Xr $$unsorted)) (tptp.subclass (tptp.compose Yr Xr) (tptp.cross_product tptp.universal_class tptp.universal_class))))
% 23.06/23.33  (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)))))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (assume a59 (forall ((X $$unsorted)) (or (not (tptp.single_valued_class X)) (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation))))
% 23.06/23.33  (assume a60 (forall ((X $$unsorted)) (or (not (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation)) (tptp.single_valued_class X))))
% 23.06/23.33  (assume a61 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass Xf (tptp.cross_product tptp.universal_class tptp.universal_class)))))
% 23.06/23.33  (assume a62 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass (tptp.compose Xf (tptp.inverse Xf)) tptp.identity_relation))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a65 (forall ((X $$unsorted)) (or (= X tptp.null_class) (tptp.member (tptp.regular X) X))))
% 23.06/23.33  (assume a66 (forall ((X $$unsorted)) (or (= X tptp.null_class) (= (tptp.intersection X (tptp.regular X)) tptp.null_class))))
% 23.06/23.33  (assume a67 (forall ((Xf $$unsorted) (Y $$unsorted)) (= (tptp.sum_class (tptp.image Xf (tptp.singleton Y))) (tptp.apply Xf Y))))
% 23.06/23.33  (assume a68 (tptp.function tptp.choice))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a70 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function Xf))))
% 23.06/23.33  (assume a71 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function (tptp.inverse Xf)))))
% 23.06/23.33  (assume a72 (forall ((Xf $$unsorted)) (or (not (tptp.function (tptp.inverse Xf))) (not (tptp.function Xf)) (tptp.one_to_one Xf))))
% 23.06/23.33  (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))
% 23.06/23.33  (assume a74 (= (tptp.intersection (tptp.inverse tptp.subset_relation) tptp.subset_relation) tptp.identity_relation))
% 23.06/23.33  (assume a75 (forall ((Xr $$unsorted)) (= (tptp.complement (tptp.domain_of (tptp.intersection Xr tptp.identity_relation))) (tptp.diagonalise Xr))))
% 23.06/23.33  (assume a76 (forall ((X $$unsorted)) (= (tptp.intersection (tptp.domain_of X) (tptp.diagonalise (tptp.compose (tptp.inverse tptp.element_relation) X))) (tptp.cantor X))))
% 23.06/23.33  (assume a77 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.function Xf))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (assume a79 (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.subclass (tptp.range_of Xf) (tptp.domain_of (tptp.domain_of Xf))))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a81 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (tptp.function Xh))))
% 23.06/23.33  (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)))))
% 23.06/23.33  (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))))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a85 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf1))))
% 23.06/23.33  (assume a86 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf2))))
% 23.06/23.33  (assume a87 (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.compatible Xh Xf1 Xf2))))
% 23.06/23.33  (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)))))))
% 23.06/23.33  (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))))
% 23.06/23.33  (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))))
% 23.06/23.33  (assume a91 (forall ((X $$unsorted)) (tptp.subclass (tptp.compose_class X) (tptp.cross_product tptp.universal_class tptp.universal_class))))
% 23.06/23.33  (assume a92 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair Y Z) (tptp.compose_class X))) (= (tptp.compose X Y) Z))))
% 23.06/23.33  (assume a93 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair Y Z) (tptp.cross_product tptp.universal_class tptp.universal_class))) (not (= (tptp.compose X Y) Z)) (tptp.member (tptp.ordered_pair Y Z) (tptp.compose_class X)))))
% 23.06/23.33  (assume a94 (tptp.subclass tptp.composition_function (tptp.cross_product tptp.universal_class (tptp.cross_product tptp.universal_class tptp.universal_class))))
% 23.06/23.33  (assume a95 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X (tptp.ordered_pair Y Z)) tptp.composition_function)) (= (tptp.compose X Y) Z))))
% 23.06/23.33  (assume a96 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product tptp.universal_class tptp.universal_class))) (tptp.member (tptp.ordered_pair X (tptp.ordered_pair Y (tptp.compose X Y))) tptp.composition_function))))
% 23.06/23.33  (assume a97 (tptp.subclass tptp.domain_relation (tptp.cross_product tptp.universal_class tptp.universal_class)))
% 23.06/23.33  (assume a98 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.domain_relation)) (= (tptp.domain_of X) Y))))
% 23.06/23.33  (assume a99 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.ordered_pair X (tptp.domain_of X)) tptp.domain_relation))))
% 23.06/23.33  (assume a100 (forall ((X $$unsorted)) (= (tptp.first (tptp.not_subclass_element (tptp.compose X (tptp.inverse X)) tptp.identity_relation)) (tptp.single_valued1 X))))
% 23.06/23.33  (assume a101 (forall ((X $$unsorted)) (= (tptp.second (tptp.not_subclass_element (tptp.compose X (tptp.inverse X)) tptp.identity_relation)) (tptp.single_valued2 X))))
% 23.06/23.33  (assume a102 (forall ((X $$unsorted)) (= (tptp.domain X (tptp.image (tptp.inverse X) (tptp.singleton (tptp.single_valued1 X))) (tptp.single_valued2 X)) (tptp.single_valued3 X))))
% 23.06/23.33  (assume a103 (= (tptp.intersection (tptp.complement (tptp.compose tptp.element_relation (tptp.complement tptp.identity_relation))) tptp.element_relation) tptp.singleton_relation))
% 23.06/23.33  (assume a104 (tptp.subclass tptp.application_function (tptp.cross_product tptp.universal_class (tptp.cross_product tptp.universal_class tptp.universal_class))))
% 23.06/23.33  (assume a105 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X (tptp.ordered_pair Y Z)) tptp.application_function)) (tptp.member Y (tptp.domain_of X)))))
% 23.06/23.33  (assume a106 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X (tptp.ordered_pair Y Z)) tptp.application_function)) (= (tptp.apply X Y) Z))))
% 23.06/23.33  (assume a107 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X (tptp.ordered_pair Y Z)) (tptp.cross_product tptp.universal_class (tptp.cross_product tptp.universal_class tptp.universal_class)))) (not (tptp.member Y (tptp.domain_of X))) (tptp.member (tptp.ordered_pair X (tptp.ordered_pair Y (tptp.apply X Y))) tptp.application_function))))
% 23.06/23.33  (assume a108 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.function Xf))))
% 23.06/23.33  (assume a109 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (= (tptp.domain_of Xf) X))))
% 23.06/23.33  (assume a110 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.subclass (tptp.range_of Xf) Y))))
% 23.06/23.33  (assume a111 (forall ((Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.function Xf)) (not (tptp.subclass (tptp.range_of Xf) Y)) (tptp.maps Xf (tptp.domain_of Xf) Y))))
% 23.06/23.33  (assume a112 (tptp.member tptp.x tptp.y))
% 23.06/23.33  (assume a113 (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))
% 23.06/23.33  (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y)))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t2)
% 23.06/23.33  (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))))
% 23.06/23.33  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)))) :rule forall_inst :args ((:= X tptp.y) (:= Y tptp.universal_class) (:= U tptp.x)))
% 23.06/23.33  (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) :rule or :premises (t2.t1))
% 23.06/23.33  (step t2.t3 (cl (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) :rule resolution :premises (t2.t2 t2.a0))
% 23.06/23.33  (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) :rule subproof :discharge (t2.a0))
% 23.06/23.33  (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) :rule resolution :premises (t1 t2))
% 23.06/23.33  (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) (not (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)))) :rule implies_neg2)
% 23.06/23.33  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)))) :rule resolution :premises (t3 t4))
% 23.06/23.33  (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)))) :rule contraction :premises (t5))
% 23.06/23.33  (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) :rule implies :premises (t6))
% 23.06/23.33  (step t8 (cl (not (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class))) (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)) :rule or_pos)
% 23.06/23.33  (step t9 (cl (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class) (not (tptp.subclass tptp.y tptp.universal_class)) (not (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)))) :rule reordering :premises (t8))
% 23.06/23.33  (step t10 (cl (not (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) :rule or_pos)
% 23.06/23.33  (step t11 (cl (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (not (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule reordering :premises (t10))
% 23.06/23.33  (step t12 (cl (not (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y))) :rule or_pos)
% 23.06/23.33  (step t13 (cl (tptp.member tptp.x (tptp.complement tptp.y)) (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (not (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y))))) :rule reordering :premises (t12))
% 23.06/23.33  (step t14 (cl (not (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y))) :rule or_pos)
% 23.06/23.33  (step t15 (cl (not (tptp.member tptp.x tptp.y)) (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y))))) :rule reordering :premises (t14))
% 23.06/23.33  (step t16 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X))))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t17)
% 23.06/23.33  (assume t17.a0 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))))
% 23.06/23.33  (step t17.t1 (cl (or (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X))))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y))))) :rule forall_inst :args ((:= Z tptp.x) (:= X tptp.y)))
% 23.06/23.33  (step t17.t2 (cl (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X))))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) :rule or :premises (t17.t1))
% 23.06/23.33  (step t17.t3 (cl (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) :rule resolution :premises (t17.t2 t17.a0))
% 23.06/23.33  (step t17 (cl (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X))))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) :rule subproof :discharge (t17.a0))
% 23.06/23.33  (step t18 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) :rule resolution :premises (t16 t17))
% 23.06/23.33  (step t19 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) (not (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y))))) :rule implies_neg2)
% 23.06/23.33  (step t20 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y))))) :rule resolution :premises (t18 t19))
% 23.06/23.33  (step t21 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y))))) :rule contraction :premises (t20))
% 23.06/23.33  (step t22 (cl (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X))))) (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) :rule implies :premises (t21))
% 23.06/23.33  (step t23 (cl (or (not (tptp.member tptp.x (tptp.complement tptp.y))) (not (tptp.member tptp.x tptp.y)))) :rule resolution :premises (t22 a23))
% 23.06/23.33  (step t24 (cl (not (tptp.member tptp.x (tptp.complement tptp.y)))) :rule resolution :premises (t15 a112 t23))
% 23.06/23.33  (step t25 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X)))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t26)
% 23.06/23.33  (assume t26.a0 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))))
% 23.06/23.33  (step t26.t1 (cl (or (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y))))) :rule forall_inst :args ((:= Z tptp.x) (:= X (tptp.complement tptp.y)) (:= Y (tptp.complement tptp.z))))
% 23.06/23.33  (step t26.t2 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) :rule or :premises (t26.t1))
% 23.06/23.33  (step t26.t3 (cl (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) :rule resolution :premises (t26.t2 t26.a0))
% 23.06/23.33  (step t26 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) :rule subproof :discharge (t26.a0))
% 23.06/23.33  (step t27 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) :rule resolution :premises (t25 t26))
% 23.06/23.33  (step t28 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) (not (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y))))) :rule implies_neg2)
% 23.06/23.33  (step t29 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y))))) :rule resolution :premises (t27 t28))
% 23.06/23.33  (step t30 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y))))) :rule contraction :premises (t29))
% 23.06/23.33  (step t31 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X)))) (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) :rule implies :premises (t30))
% 23.06/23.33  (step t32 (cl (or (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.complement tptp.y)))) :rule resolution :premises (t31 a20))
% 23.06/23.33  (step t33 (cl (not (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule resolution :premises (t13 t24 t32))
% 23.06/23.33  (step t34 (cl (not (= (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (or (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))))) (not (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) (or (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule equiv_pos2)
% 23.06/23.33  (step t35 (cl (= (= (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) true) (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) :rule equiv_simplify)
% 23.06/23.33  (step t36 (cl (not (= (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) true)) (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule equiv1 :premises (t35))
% 23.06/23.33  (step t37 (cl (= (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))))) :rule all_simplify)
% 23.06/23.33  (step t38 (cl (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule refl)
% 23.06/23.33  (step t39 (cl (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule all_simplify)
% 23.06/23.33  (step t40 (cl (= (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) :rule cong :premises (t38 t39))
% 23.06/23.33  (step t41 (cl (= (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) true)) :rule all_simplify)
% 23.06/23.33  (step t42 (cl (= (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) true)) :rule trans :premises (t40 t41))
% 23.06/23.33  (step t43 (cl (= (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) true)) :rule trans :premises (t37 t42))
% 23.06/23.33  (step t44 (cl (= (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule resolution :premises (t36 t43))
% 23.06/23.33  (step t45 (cl (= (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule refl)
% 23.06/23.33  (step t46 (cl (= (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule refl)
% 23.06/23.33  (step t47 (cl (= (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (or (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))))) :rule cong :premises (t44 t45 t46))
% 23.06/23.33  (step t48 (cl (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule and_neg)
% 23.06/23.33  (step t49 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t50)
% 23.06/23.33  (assume t50.a0 (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))
% 23.06/23.33  (assume t50.a1 (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))
% 23.06/23.33  (step t50.t1 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t50.t2)
% 23.06/23.33  (assume t50.t2.a0 (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))
% 23.06/23.33  (assume t50.t2.a1 (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))
% 23.06/23.33  (step t50.t2.t1 (cl (= (= (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) false) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule equiv_simplify)
% 23.06/23.33  (step t50.t2.t2 (cl (not (= (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) false)) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule equiv1 :premises (t50.t2.t1))
% 23.06/23.33  (step t50.t2.t3 (cl (= tptp.x tptp.x)) :rule refl)
% 23.06/23.33  (step t50.t2.t4 (cl (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) :rule symm :premises (t50.t2.a1))
% 23.06/23.33  (step t50.t2.t5 (cl (= (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule cong :premises (t50.t2.t3 t50.t2.t4))
% 23.06/23.33  (step t50.t2.t6 (cl (= (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) false) (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) :rule equiv_simplify)
% 23.06/23.33  (step t50.t2.t7 (cl (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) false) (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) :rule equiv2 :premises (t50.t2.t6))
% 23.06/23.33  (step t50.t2.t8 (cl (not (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))))) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) :rule not_not)
% 23.06/23.33  (step t50.t2.t9 (cl (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) false) (tptp.member tptp.x (tptp.union tptp.y tptp.z))) :rule resolution :premises (t50.t2.t7 t50.t2.t8))
% 23.06/23.33  (step t50.t2.t10 (cl (= (tptp.member tptp.x (tptp.union tptp.y tptp.z)) false)) :rule resolution :premises (t50.t2.t9 t50.t2.a0))
% 23.06/23.33  (step t50.t2.t11 (cl (= (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) false)) :rule trans :premises (t50.t2.t5 t50.t2.t10))
% 23.06/23.33  (step t50.t2.t12 (cl (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t50.t2.t2 t50.t2.t11))
% 23.06/23.33  (step t50.t2 (cl (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule subproof :discharge (t50.t2.a0 t50.t2.a1))
% 23.06/23.33  (step t50.t3 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule and_pos)
% 23.06/23.33  (step t50.t4 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule and_pos)
% 23.06/23.33  (step t50.t5 (cl (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule resolution :premises (t50.t2 t50.t3 t50.t4))
% 23.06/23.33  (step t50.t6 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule reordering :premises (t50.t5))
% 23.06/23.33  (step t50.t7 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule contraction :premises (t50.t6))
% 23.06/23.33  (step t50.t8 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t50.t1 t50.t7))
% 23.06/23.33  (step t50.t9 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule implies_neg2)
% 23.06/23.33  (step t50.t10 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule resolution :premises (t50.t8 t50.t9))
% 23.06/23.33  (step t50.t11 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule contraction :premises (t50.t10))
% 23.06/23.33  (step t50.t12 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule implies :premises (t50.t11))
% 23.06/23.33  (step t50.t13 (cl (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule and_neg)
% 23.06/23.33  (step t50.t14 (cl (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t50.t13 t50.a0 t50.a1))
% 23.06/23.33  (step t50.t15 (cl (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t50.t12 t50.t14))
% 23.06/23.33  (step t50 (cl (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule subproof :discharge (t50.a0 t50.a1))
% 23.06/23.33  (step t51 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) :rule and_pos)
% 23.06/23.33  (step t52 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule and_pos)
% 23.06/23.33  (step t53 (cl (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule resolution :premises (t50 t51 t52))
% 23.06/23.33  (step t54 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule reordering :premises (t53))
% 23.06/23.33  (step t55 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule contraction :premises (t54))
% 23.06/23.33  (step t56 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t49 t55))
% 23.06/23.33  (step t57 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule implies_neg2)
% 23.06/23.33  (step t58 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule resolution :premises (t56 t57))
% 23.06/23.33  (step t59 (cl (=> (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule contraction :premises (t58))
% 23.06/23.33  (step t60 (cl (not (and (not (tptp.member tptp.x (tptp.union tptp.y tptp.z))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule implies :premises (t59))
% 23.06/23.33  (step t61 (cl (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t48 t60))
% 23.06/23.33  (step t62 (cl (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))))) :rule or_neg)
% 23.06/23.33  (step t63 (cl (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule or_neg)
% 23.06/23.33  (step t64 (cl (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (not (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule or_neg)
% 23.06/23.33  (step t65 (cl (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule resolution :premises (t61 t62 t63 t64))
% 23.06/23.33  (step t66 (cl (or (not (not (tptp.member tptp.x (tptp.union tptp.y tptp.z)))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule contraction :premises (t65))
% 23.06/23.33  (step t67 (cl (or (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule resolution :premises (t34 t47 t66))
% 23.06/23.33  (step t68 (cl (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule or :premises (t67))
% 23.06/23.33  (step t69 (cl (tptp.member tptp.x (tptp.union tptp.y tptp.z)) (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule reordering :premises (t68))
% 23.06/23.33  (step t70 (cl (not (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) (not (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule equiv_pos2)
% 23.06/23.33  (step t71 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))))) :rule refl)
% 23.06/23.33  (step t72 (cl (= (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z)) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule all_simplify)
% 23.06/23.33  (step t73 (cl (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))))) :rule cong :premises (t71 t72))
% 23.06/23.33  (step t74 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y)))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t75)
% 23.06/23.33  (assume t75.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))))
% 23.06/23.33  (step t75.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y)))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z)))) :rule forall_inst :args ((:= X tptp.y) (:= Y tptp.z)))
% 23.06/23.33  (step t75.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y)))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) :rule or :premises (t75.t1))
% 23.06/23.33  (step t75.t3 (cl (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) :rule resolution :premises (t75.t2 t75.a0))
% 23.06/23.33  (step t75 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y)))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) :rule subproof :discharge (t75.a0))
% 23.06/23.33  (step t76 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) :rule resolution :premises (t74 t75))
% 23.06/23.33  (step t77 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) (not (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z)))) :rule implies_neg2)
% 23.06/23.33  (step t78 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z)))) :rule resolution :premises (t76 t77))
% 23.06/23.33  (step t79 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))) (tptp.union tptp.y tptp.z)))) :rule contraction :premises (t78))
% 23.06/23.33  (step t80 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t70 t73 t79))
% 23.06/23.33  (step t81 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y)))) (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule implies :premises (t80))
% 23.06/23.33  (step t82 (cl (= (tptp.union tptp.y tptp.z) (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule resolution :premises (t81 a25))
% 23.06/23.33  (step t83 (cl (not (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t69 a113 t82))
% 23.06/23.33  (step t84 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X)))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t85)
% 23.06/23.33  (assume t85.a0 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))))
% 23.06/23.33  (step t85.t1 (cl (or (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X)))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule forall_inst :args ((:= Z tptp.x) (:= X (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))
% 23.06/23.33  (step t85.t2 (cl (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X)))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule or :premises (t85.t1))
% 23.06/23.33  (step t85.t3 (cl (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule resolution :premises (t85.t2 t85.a0))
% 23.06/23.33  (step t85 (cl (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X)))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule subproof :discharge (t85.a0))
% 23.06/23.33  (step t86 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule resolution :premises (t84 t85))
% 23.06/23.33  (step t87 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (not (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule implies_neg2)
% 23.06/23.33  (step t88 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule resolution :premises (t86 t87))
% 23.06/23.33  (step t89 (cl (=> (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))))) :rule contraction :premises (t88))
% 23.06/23.33  (step t90 (cl (not (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X)))) (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule implies :premises (t89))
% 23.06/23.33  (step t91 (cl (or (not (tptp.member tptp.x tptp.universal_class)) (tptp.member tptp.x (tptp.complement (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z)))) (tptp.member tptp.x (tptp.intersection (tptp.complement tptp.y) (tptp.complement tptp.z))))) :rule resolution :premises (t90 a24))
% 23.06/23.33  (step t92 (cl (not (tptp.member tptp.x tptp.universal_class))) :rule resolution :premises (t11 t33 t83 t91))
% 23.06/23.33  (step t93 (cl (=> (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class)) (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class))) :rule implies_neg1)
% 23.06/23.33  (anchor :step t94)
% 23.06/23.33  (assume t94.a0 (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)))
% 23.06/23.33  (step t94.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class))) (tptp.subclass tptp.y tptp.universal_class))) :rule forall_inst :args ((:= X tptp.y)))
% 23.06/23.33  (step t94.t2 (cl (not (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class))) (tptp.subclass tptp.y tptp.universal_class)) :rule or :premises (t94.t1))
% 23.06/23.33  (step t94.t3 (cl (tptp.subclass tptp.y tptp.universal_class)) :rule resolution :premises (t94.t2 t94.a0))
% 23.06/23.33  (step t94 (cl (not (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class))) (tptp.subclass tptp.y tptp.universal_class)) :rule subproof :discharge (t94.a0))
% 23.06/23.33  (step t95 (cl (=> (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class)) :rule resolution :premises (t93 t94))
% 23.06/23.33  (step t96 (cl (=> (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.subclass tptp.y tptp.universal_class))) :rule implies_neg2)
% 23.06/23.33  (step t97 (cl (=> (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class)) (=> (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class))) :rule resolution :premises (t95 t96))
% 23.06/23.33  (step t98 (cl (=> (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (tptp.subclass tptp.y tptp.universal_class))) :rule contraction :premises (t97))
% 23.06/23.33  (step t99 (cl (not (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class))) (tptp.subclass tptp.y tptp.universal_class)) :rule implies :premises (t98))
% 23.06/23.33  (step t100 (cl (tptp.subclass tptp.y tptp.universal_class)) :rule resolution :premises (t99 a3))
% 23.06/23.33  (step t101 (cl (not (or (not (tptp.subclass tptp.y tptp.universal_class)) (not (tptp.member tptp.x tptp.y)) (tptp.member tptp.x tptp.universal_class)))) :rule resolution :premises (t9 a112 t92 t100))
% 23.06/23.33  (step t102 (cl) :rule resolution :premises (t7 t101 a0))
% 23.06/23.33  
% 23.06/23.33  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.wdTPwhq5o2/cvc5---1.0.5_13970.smt2
% 23.06/23.34  % cvc5---1.0.5 exiting
% 23.06/23.34  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------