%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET787-2 : TPTP v8.2.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n028.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:45:42 EDT 2024

% Result   : Unsatisfiable 0.39s 0.62s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET787-2 : TPTP v8.2.0. Released v2.7.0.
% 0.03/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n028.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue May 28 10:41:39 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.52  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.39/0.62  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.jFvf0Vn2Cj/cvc5---1.0.5_8526.smt2
% 0.39/0.62  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.jFvf0Vn2Cj/cvc5---1.0.5_8526.smt2
% 0.45/0.64  (assume a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.member U (tptp.cons U V))))
% 0.45/0.64  (assume a1 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.cons W V)))))
% 0.45/0.64  (assume a2 (forall ((U $$unsorted)) (or (not (tptp.member U tptp.nat)) (tptp.member (tptp.succ U) tptp.nat))))
% 0.45/0.64  (assume a3 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (= (tptp.inr U) (tptp.inr V)))))
% 0.45/0.64  (assume a4 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (= (tptp.inl U) (tptp.inl V)))))
% 0.45/0.64  (assume a5 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member (tptp.inl U) (tptp.disjsum V W)))))
% 0.45/0.64  (assume a6 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member (tptp.inr U) (tptp.disjsum W V)))))
% 0.45/0.64  (assume a7 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (= (tptp.cons U tptp.eptset) (tptp.cons V tptp.eptset)))))
% 0.45/0.64  (assume a8 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.succ V)))))
% 0.45/0.64  (assume a9 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (tptp.member U (tptp.succ V)))))
% 0.45/0.64  (assume a10 (forall ((U $$unsorted)) (tptp.member U (tptp.cons U tptp.eptset))))
% 0.45/0.64  (assume a11 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.cons W V)))))
% 0.45/0.64  (assume a12 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (tptp.member U (tptp.cons V W)))))
% 0.45/0.64  (assume a13 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U W) (tptp.member U (tptp.diff V W)))))
% 0.45/0.64  (assume a14 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (not (tptp.member U W)) (tptp.member U (tptp.int V W)))))
% 0.45/0.64  (assume a15 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))))
% 0.45/0.64  (assume a16 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))))
% 0.45/0.64  (assume a17 (forall ((U $$unsorted) (V $$unsorted)) (or (tptp.member (tptp.powI_sk1 U V) U) (tptp.member U (tptp.pow V)))))
% 0.45/0.64  (assume a18 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.powI_sk1 U V) V)) (tptp.member U (tptp.pow V)))))
% 0.45/0.64  (assume a19 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member (tptp.interI_sk1 W V) V) (tptp.member W (tptp.inter V)))))
% 0.45/0.64  (assume a20 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.interI_sk1 U V))) (not (tptp.member W V)) (tptp.member U (tptp.inter V)))))
% 0.45/0.64  (assume a21 (forall ((U $$unsorted)) (or (tptp.member (tptp.card_Union_sk1 U) U) (tptp.card (tptp.union U)))))
% 0.45/0.64  (assume a22 (forall ((U $$unsorted)) (or (not (tptp.card (tptp.card_Union_sk1 U))) (tptp.card (tptp.union U)))))
% 0.45/0.64  (assume a23 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.fin V))) (tptp.member (tptp.int U W) (tptp.fin V)))))
% 0.45/0.64  (assume a24 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.fin V))) (tptp.member (tptp.int W U) (tptp.fin V)))))
% 0.45/0.64  (assume a25 (forall ((U $$unsorted)) (or (tptp.member (tptp.order_Inter_sk1 U) U) (tptp.ord (tptp.inter U)))))
% 0.45/0.64  (assume a26 (forall ((U $$unsorted)) (or (not (tptp.ord (tptp.order_Inter_sk1 U))) (tptp.ord (tptp.inter U)))))
% 0.45/0.64  (assume a27 (forall ((U $$unsorted)) (or (tptp.member (tptp.order_Union_sk1 U) U) (tptp.ord (tptp.union U)))))
% 0.45/0.64  (assume a28 (forall ((U $$unsorted)) (or (not (tptp.ord (tptp.order_Union_sk1 U))) (tptp.ord (tptp.union U)))))
% 0.45/0.64  (assume a29 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ord U)) (not (tptp.ord V)) (tptp.ord (tptp.un U V)))))
% 0.45/0.64  (assume a30 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.pair U V) W)) (not (tptp.member (tptp.pair V X) Y)) (tptp.member (tptp.pair U X) (tptp.comp Y W)))))
% 0.45/0.64  (assume a31 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.pair U V) W)) (not (tptp.member V X)) (tptp.member U (tptp.vimage W X)))))
% 0.45/0.64  (assume a32 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.pair U V) W)) (not (tptp.member U X)) (tptp.member V (tptp.image W X)))))
% 0.45/0.64  (assume a33 (forall ((U $$unsorted) (V $$unsorted)) (not (= (tptp.qInr U) (tptp.qInl V)))))
% 0.45/0.64  (assume a34 (forall ((U $$unsorted) (V $$unsorted)) (not (= (tptp.qInl U) (tptp.qInr V)))))
% 0.45/0.64  (assume a35 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.qInr U) (tptp.qInr V))) (= U V))))
% 0.45/0.64  (assume a36 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.qInl U) (tptp.qInl V))) (= U V))))
% 0.45/0.64  (assume a37 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.qsum V W))) (tptp.member (tptp.qsumE_sk1 U V W) V) (tptp.member (tptp.qsumE_sk2 U V W) W))))
% 0.45/0.64  (assume a38 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.qsum V W))) (tptp.member (tptp.qsumE_sk1 U V W) V) (= U (tptp.qInr (tptp.qsumE_sk2 U V W))))))
% 0.45/0.64  (assume a39 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.qsum V W))) (= U (tptp.qInl (tptp.qsumE_sk1 U V W))) (tptp.member (tptp.qsumE_sk2 U V W) W))))
% 0.45/0.64  (assume a40 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.qsum V W))) (= U (tptp.qInl (tptp.qsumE_sk1 U V W))) (= U (tptp.qInr (tptp.qsumE_sk2 U V W))))))
% 0.45/0.64  (assume a41 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.qconverse V))) (= U (tptp.qPair (tptp.qconverseE_sk2 U V) (tptp.qconverseE_sk1 U V))))))
% 0.45/0.64  (assume a42 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.qconverse V))) (tptp.member (tptp.qPair (tptp.qconverseE_sk1 U V) (tptp.qconverseE_sk2 U V)) V))))
% 0.45/0.64  (assume a43 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member (tptp.qPair U V) (tptp.qconverse W))) (tptp.member (tptp.qPair V U) W))))
% 0.45/0.64  (assume a44 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.qPair U V) (tptp.qPair W X))) (= U W))))
% 0.45/0.64  (assume a45 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.qPair U V) (tptp.qPair W X))) (= V X))))
% 0.45/0.64  (assume a46 (forall ((U $$unsorted)) (or (not (tptp.member (tptp.succ U) tptp.nat)) (tptp.member U tptp.nat))))
% 0.45/0.64  (assume a47 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.pair U V) (tptp.pair W X)) (tptp.rmult Y Z X1 X2))) (tptp.rmultE_c1 U V W X Y Z X1 X2) (tptp.rmultE_c2 U V W X Y Z X1 X2))))
% 0.45/0.64  (assume a48 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c1 U V W X Y Z X1 X2)) (tptp.member (tptp.pair U W) Z))))
% 0.45/0.64  (assume a49 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c1 U V W X Y Z X1 X2)) (tptp.member U Y))))
% 0.45/0.64  (assume a50 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c1 U V W X Y Z X1 X2)) (tptp.member W Y))))
% 0.45/0.64  (assume a51 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c1 U V W X Y Z X1 X2)) (tptp.member V X1))))
% 0.45/0.64  (assume a52 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c1 U V W X Y Z X1 X2)) (tptp.member X X1))))
% 0.45/0.64  (assume a53 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c2 U V W X Y Z X1 X2)) (tptp.member (tptp.pair V X) X2))))
% 0.45/0.64  (assume a54 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c2 U V W X Y Z X1 X2)) (tptp.member W Y))))
% 0.45/0.64  (assume a55 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c2 U V W X Y Z X1 X2)) (= U W))))
% 0.45/0.64  (assume a56 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c2 U V W X Y Z X1 X2)) (tptp.member V X1))))
% 0.45/0.64  (assume a57 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.rmultE_c2 U V W X Y Z X1 X2)) (tptp.member X X1))))
% 0.45/0.64  (assume a58 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (not (tptp.member (tptp.pair (tptp.inr U) (tptp.inl V)) (tptp.radd W X Y Z)))))
% 0.45/0.64  (assume a59 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inr U) (tptp.inr V)) (tptp.radd W X Y Z))) (tptp.member U Y))))
% 0.45/0.64  (assume a60 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inr U) (tptp.inr V)) (tptp.radd W X Y Z))) (tptp.member V Y))))
% 0.45/0.64  (assume a61 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inr U) (tptp.inr V)) (tptp.radd W X Y Z))) (tptp.member (tptp.pair U V) Z))))
% 0.45/0.64  (assume a62 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inl U) (tptp.inl V)) (tptp.radd W X Y Z))) (tptp.member U W))))
% 0.45/0.64  (assume a63 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inl U) (tptp.inl V)) (tptp.radd W X Y Z))) (tptp.member V W))))
% 0.45/0.64  (assume a64 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inl U) (tptp.inl V)) (tptp.radd W X Y Z))) (tptp.member (tptp.pair U V) X))))
% 0.45/0.64  (assume a65 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inl U) (tptp.inr V)) (tptp.radd W X Y Z))) (tptp.member U W))))
% 0.45/0.64  (assume a66 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.member (tptp.pair (tptp.inl U) (tptp.inr V)) (tptp.radd W X Y Z))) (tptp.member V Y))))
% 0.45/0.64  (assume a67 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.le (tptp.succ U) V)) (tptp.lt U V))))
% 0.45/0.64  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.le tptp.eptset (tptp.succ U))) (tptp.ord U))))
% 0.45/0.64  (assume a69 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member (tptp.pair U V) (tptp.memrel W))) (tptp.member U W))))
% 0.45/0.64  (assume a70 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member (tptp.pair U V) (tptp.memrel W))) (tptp.member V W))))
% 0.45/0.64  (assume a71 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member (tptp.pair U V) (tptp.memrel W))) (tptp.member U V))))
% 0.45/0.64  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.le U tptp.eptset)) (= U tptp.eptset))))
% 0.45/0.64  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.le U U)) (tptp.ord U))))
% 0.45/0.64  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ord (tptp.succ U))) (tptp.ord U))))
% 0.45/0.64  (assume a75 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.comp V W))) (= U (tptp.pair (tptp.compE_sk1 U V W) (tptp.compE_sk3 U V W))))))
% 0.45/0.64  (assume a76 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.comp V W))) (tptp.member (tptp.pair (tptp.compE_sk1 U V W) (tptp.compE_sk2 U V W)) W))))
% 0.45/0.64  (assume a77 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.comp V W))) (tptp.member (tptp.pair (tptp.compE_sk2 U V W) (tptp.compE_sk3 U V W)) V))))
% 0.45/0.64  (assume a78 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.id V))) (tptp.member (tptp.idE_sk1 U V) V))))
% 0.45/0.64  (assume a79 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.id V))) (= U (tptp.pair (tptp.idE_sk1 U V) (tptp.idE_sk1 U V))))))
% 0.45/0.64  (assume a80 (forall ((U $$unsorted) (V $$unsorted)) (not (= (tptp.inr U) (tptp.inl V)))))
% 0.45/0.64  (assume a81 (forall ((U $$unsorted) (V $$unsorted)) (not (= (tptp.inl U) (tptp.inr V)))))
% 0.45/0.64  (assume a82 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.inr U) (tptp.inr V))) (= U V))))
% 0.45/0.64  (assume a83 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.inl U) (tptp.inl V))) (= U V))))
% 0.45/0.64  (assume a84 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.disjsum V W))) (tptp.member (tptp.sumE_sk1 U V W) V) (tptp.member (tptp.sumE_sk2 U V W) W))))
% 0.45/0.64  (assume a85 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.disjsum V W))) (tptp.member (tptp.sumE_sk1 U V W) V) (= U (tptp.inr (tptp.sumE_sk2 U V W))))))
% 0.45/0.64  (assume a86 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.disjsum V W))) (= U (tptp.inl (tptp.sumE_sk1 U V W))) (tptp.member (tptp.sumE_sk2 U V W) W))))
% 0.45/0.64  (assume a87 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.disjsum V W))) (= U (tptp.inl (tptp.sumE_sk1 U V W))) (= U (tptp.inr (tptp.sumE_sk2 U V W))))))
% 0.45/0.64  (assume a88 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.pair U V) (tptp.pair W X))) (= U W))))
% 0.45/0.64  (assume a89 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.pair U V) (tptp.pair W X))) (= V X))))
% 0.45/0.64  (assume a90 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.eptset) (tptp.cons V tptp.eptset))) (= U V))))
% 0.45/0.64  (assume a91 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.succ U) (tptp.succ V))) (= U V))))
% 0.45/0.64  (assume a92 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.succ V))) (= U V) (tptp.member U V))))
% 0.45/0.64  (assume a93 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))))
% 0.45/0.64  (assume a94 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))))
% 0.45/0.64  (assume a95 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.diff V W))) (tptp.member U V))))
% 0.45/0.64  (assume a96 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.diff V W))) (not (tptp.member U W)))))
% 0.45/0.64  (assume a97 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.int V W))) (tptp.member U V))))
% 0.45/0.64  (assume a98 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.int V W))) (tptp.member U W))))
% 0.45/0.64  (assume a99 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.un V W))) (tptp.member U V) (tptp.member U W))))
% 0.45/0.64  (assume a100 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.pow V))) (not (tptp.member W U)) (tptp.member W V))))
% 0.45/0.64  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))))
% 0.45/0.64  (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))))
% 0.45/0.64  (assume a103 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U tptp.eptset)) (not (tptp.member V U)))))
% 0.45/0.64  (assume a104 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.inter V))) (not (tptp.member W V)) (tptp.member U W))))
% 0.45/0.64  (assume a105 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member (tptp.subsetD_sk1 V W U) V) (tptp.member U W))))
% 0.45/0.64  (assume a106 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member (tptp.subsetD_sk1 U V W) V)) (not (tptp.member W U)) (tptp.member W V))))
% 0.45/0.64  (assume a107 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.member C A)) (tptp.member C B))))
% 0.45/0.64  (assume a108 (forall ((C $$unsorted) (A $$unsorted) (R $$unsorted)) (or (not (tptp.member (tptp.pair C A) R)) (tptp.member A (tptp.field R)))))
% 0.45/0.64  (assume a109 (forall ((A $$unsorted) (B $$unsorted) (R $$unsorted)) (or (not (tptp.member (tptp.pair A B) R)) (tptp.member A (tptp.field R)))))
% 0.45/0.64  (assume a110 (forall ((A $$unsorted) (B $$unsorted)) (not (= (tptp.pair A B) tptp.eptset))))
% 0.45/0.64  (assume a111 (forall ((A $$unsorted) (B $$unsorted)) (not (= (tptp.pair A B) A))))
% 0.45/0.64  (assume a112 (forall ((A $$unsorted) (B $$unsorted)) (not (= (tptp.pair A B) B))))
% 0.45/0.64  (assume a113 (forall ((A $$unsorted) (C $$unsorted) (B $$unsorted) (D $$unsorted)) (or (not (= A C)) (not (= B D)) (= (tptp.pair A B) (tptp.pair C D)))))
% 0.45/0.64  (assume a114 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.member (tptp.subsetI_sk1 A B) A) (tptp.subset A B))))
% 0.45/0.64  (assume a115 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.member (tptp.subsetI_sk1 A B) B)) (tptp.subset A B))))
% 0.45/0.64  (assume a116 (forall ((A $$unsorted)) (tptp.subset A A)))
% 0.45/0.64  (assume a117 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.subset B C)) (tptp.subset A C))))
% 0.45/0.64  (assume a118 (forall ((X $$unsorted) (A $$unsorted)) (or (not (tptp.member X tptp.eptset)) (tptp.member X A))))
% 0.45/0.64  (assume a119 (forall ((A $$unsorted)) (tptp.subset tptp.eptset A)))
% 0.45/0.64  (assume a120 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.member C A)) (tptp.member C B))))
% 0.45/0.64  (assume a121 (forall ((A $$unsorted) (B $$unsorted)) (tptp.member A (tptp.upair A B))))
% 0.45/0.64  (assume a122 (forall ((B $$unsorted) (A $$unsorted)) (tptp.member B (tptp.upair A B))))
% 0.45/0.64  (assume a123 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.member A (tptp.upair B C))) (= A B) (= A C))))
% 0.45/0.64  (assume a124 (forall ((I $$unsorted)) (tptp.member I (tptp.succ I))))
% 0.45/0.64  (assume a125 (forall ((I $$unsorted) (J $$unsorted)) (or (not (tptp.member I J)) (tptp.member I (tptp.succ J)))))
% 0.45/0.64  (assume a126 (forall ((B $$unsorted) (C $$unsorted) (A $$unsorted)) (or (not (tptp.member B C)) (not (tptp.member A B)) (tptp.member A (tptp.union C)))))
% 0.45/0.64  (assume a127 (forall ((C $$unsorted) (A $$unsorted) (B $$unsorted)) (or (not (tptp.member C (tptp.sigma A B))) (tptp.member (tptp.sigmaE_sk1x A B C) A))))
% 0.45/0.64  (assume a128 (forall ((C $$unsorted) (A $$unsorted) (B $$unsorted)) (or (not (tptp.member C (tptp.sigma A B))) (tptp.member (tptp.sigmaE_sk1y A B C) (tptp.apply B (tptp.sigmaE_sk1x A B C))))))
% 0.45/0.64  (assume a129 (forall ((C $$unsorted) (A $$unsorted) (B $$unsorted)) (or (not (tptp.member C (tptp.sigma A B))) (= C (tptp.pair (tptp.sigmaE_sk1x A B C) (tptp.sigmaE_sk1y A B C))))))
% 0.45/0.64  (assume a130 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.subset B A)) (= A B))))
% 0.45/0.64  (assume a131 (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.subset A B))))
% 0.45/0.64  (assume a132 (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.subset B A))))
% 0.45/0.64  (assume a133 (forall ((B $$unsorted)) (tptp.member tptp.eptset (tptp.pow B))))
% 0.45/0.64  (assume a134 (forall ((A $$unsorted)) (tptp.member A (tptp.pow A))))
% 0.45/0.64  (assume a135 (forall ((V_a $$unsorted) (A $$unsorted) (V_b $$unsorted) (B $$unsorted)) (or (not (tptp.member V_a A)) (not (tptp.member V_b (tptp.apply B V_a))) (tptp.member (tptp.pair V_a V_b) (tptp.sigma A B)))))
% 0.45/0.64  (assume a136 (forall ((P $$unsorted) (A $$unsorted) (B $$unsorted)) (or (not (tptp.member P (tptp.sigma A B))) (tptp.member (tptp.fst P) A))))
% 0.45/0.64  (assume a137 (forall ((P $$unsorted) (A $$unsorted) (B $$unsorted)) (or (not (tptp.member P (tptp.sigma A B))) (tptp.member (tptp.snd P) (tptp.apply B (tptp.fst P))))))
% 0.45/0.64  (assume a138 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.fst (tptp.pair A B)) A)))
% 0.45/0.64  (assume a139 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.snd (tptp.pair A B)) B)))
% 0.45/0.64  (assume a140 (forall ((X $$unsorted)) (not (tptp.member X tptp.eptset))))
% 0.45/0.64  (assume a141 (forall ((C $$unsorted) (A $$unsorted) (B $$unsorted)) (or (not (tptp.member C A)) (tptp.member C (tptp.un A B)))))
% 0.45/0.64  (assume a142 (forall ((C $$unsorted) (B $$unsorted) (A $$unsorted)) (or (not (tptp.member C B)) (tptp.member C (tptp.un A B)))))
% 0.45/0.64  (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member (tptp.pair U V) W)) (tptp.member (tptp.pair V U) (tptp.converse W)))))
% 0.45/0.64  (assume a144 (forall ((A $$unsorted) (B $$unsorted) (R $$unsorted)) (or (not (tptp.member (tptp.pair A B) (tptp.converse R))) (tptp.member (tptp.pair B A) R))))
% 0.45/0.64  (assume a145 (forall ((YX $$unsorted) (R $$unsorted)) (or (not (tptp.member YX (tptp.converse R))) (= YX (tptp.pair (tptp.converseE_sk2 YX) (tptp.converseE_sk1 YX))))))
% 0.45/0.64  (assume a146 (forall ((YX $$unsorted) (R $$unsorted)) (or (not (tptp.member YX (tptp.converse R))) (tptp.member (tptp.pair (tptp.converse_sk1 YX) (tptp.converse_sk2 YX)) R))))
% 0.45/0.64  (assume a147 (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (assume a148 (not (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))
% 0.45/0.64  (step t1 (cl (not (= (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (tptp.member tptp.sk2 tptp.b) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (not (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) (or (tptp.member tptp.sk2 tptp.b) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv_pos2)
% 0.45/0.64  (step t2 (cl (= (= (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b)) true) (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b)))) :rule equiv_simplify)
% 0.45/0.64  (step t3 (cl (not (= (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b)) true)) (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b))) :rule equiv1 :premises (t2))
% 0.45/0.64  (step t4 (cl (= (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b)) (= (tptp.member tptp.sk2 tptp.b) (not (not (tptp.member tptp.sk2 tptp.b)))))) :rule all_simplify)
% 0.45/0.64  (step t5 (cl (= (tptp.member tptp.sk2 tptp.b) (tptp.member tptp.sk2 tptp.b))) :rule refl)
% 0.45/0.64  (step t6 (cl (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b))) :rule all_simplify)
% 0.45/0.64  (step t7 (cl (= (= (tptp.member tptp.sk2 tptp.b) (not (not (tptp.member tptp.sk2 tptp.b)))) (= (tptp.member tptp.sk2 tptp.b) (tptp.member tptp.sk2 tptp.b)))) :rule cong :premises (t5 t6))
% 0.45/0.64  (step t8 (cl (= (= (tptp.member tptp.sk2 tptp.b) (tptp.member tptp.sk2 tptp.b)) true)) :rule all_simplify)
% 0.45/0.64  (step t9 (cl (= (= (tptp.member tptp.sk2 tptp.b) (not (not (tptp.member tptp.sk2 tptp.b)))) true)) :rule trans :premises (t7 t8))
% 0.45/0.64  (step t10 (cl (= (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b)) true)) :rule trans :premises (t4 t9))
% 0.45/0.64  (step t11 (cl (= (not (not (tptp.member tptp.sk2 tptp.b))) (tptp.member tptp.sk2 tptp.b))) :rule resolution :premises (t3 t10))
% 0.45/0.64  (step t12 (cl (= (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule refl)
% 0.45/0.64  (step t13 (cl (= (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule refl)
% 0.45/0.64  (step t14 (cl (= (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (tptp.member tptp.sk2 tptp.b) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule cong :premises (t11 t12 t13))
% 0.45/0.64  (step t15 (cl (not (= (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (not (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv_pos2)
% 0.45/0.64  (step t16 (cl (= (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule refl)
% 0.45/0.64  (step t17 (cl (= (= (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule equiv_simplify)
% 0.45/0.64  (step t18 (cl (= (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule equiv2 :premises (t17))
% 0.45/0.64  (step t19 (cl (not (not (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule not_not)
% 0.45/0.64  (step t20 (cl (= (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t18 t19))
% 0.45/0.64  (step t21 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t22)
% 0.45/0.64  (assume t22.a0 (not (tptp.member tptp.sk2 tptp.b)))
% 0.45/0.64  (assume t22.a1 (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (assume t22.a2 (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (step t22.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 0.45/0.64  (step t22.t2 (cl (= (= true false) false)) :rule all_simplify)
% 0.45/0.64  (step t22.t3 (cl (= (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) true) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule equiv_simplify)
% 0.45/0.64  (step t22.t4 (cl (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) true) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule equiv2 :premises (t22.t3))
% 0.45/0.64  (step t22.t5 (cl (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) true)) :rule resolution :premises (t22.t4 t22.a2))
% 0.45/0.64  (step t22.t6 (cl (= true (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule symm :premises (t22.t5))
% 0.45/0.64  (step t22.t7 (cl (= tptp.sk2 tptp.sk2)) :rule refl)
% 0.45/0.64  (step t22.t8 (cl (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)) :rule symm :premises (t22.a1))
% 0.45/0.64  (step t22.t9 (cl (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 tptp.b))) :rule cong :premises (t22.t7 t22.t8))
% 0.45/0.64  (step t22.t10 (cl (= (= (tptp.member tptp.sk2 tptp.b) false) (not (tptp.member tptp.sk2 tptp.b)))) :rule equiv_simplify)
% 0.45/0.64  (step t22.t11 (cl (= (tptp.member tptp.sk2 tptp.b) false) (not (not (tptp.member tptp.sk2 tptp.b)))) :rule equiv2 :premises (t22.t10))
% 0.45/0.64  (step t22.t12 (cl (not (not (not (tptp.member tptp.sk2 tptp.b)))) (tptp.member tptp.sk2 tptp.b)) :rule not_not)
% 0.45/0.64  (step t22.t13 (cl (= (tptp.member tptp.sk2 tptp.b) false) (tptp.member tptp.sk2 tptp.b)) :rule resolution :premises (t22.t11 t22.t12))
% 0.45/0.64  (step t22.t14 (cl (= (tptp.member tptp.sk2 tptp.b) false)) :rule resolution :premises (t22.t13 t22.a0))
% 0.45/0.64  (step t22.t15 (cl (= true false)) :rule trans :premises (t22.t6 t22.t9 t22.t14))
% 0.45/0.64  (step t22.t16 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t15))
% 0.45/0.64  (step t22 (cl (not (not (tptp.member tptp.sk2 tptp.b))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 0.45/0.64  (step t23 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (tptp.member tptp.sk2 tptp.b))) :rule and_pos)
% 0.45/0.64  (step t24 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t25 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t26 (cl false (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t22 t23 t24 t25))
% 0.45/0.64  (step t27 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) false) :rule reordering :premises (t26))
% 0.45/0.64  (step t28 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) false) :rule contraction :premises (t27))
% 0.45/0.64  (step t29 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) false) :rule resolution :premises (t21 t28))
% 0.45/0.64  (step t30 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not false)) :rule implies_neg2)
% 0.45/0.64  (step t31 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) :rule resolution :premises (t29 t30))
% 0.45/0.64  (step t32 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) :rule contraction :premises (t31))
% 0.45/0.64  (step t33 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule implies_simplify)
% 0.45/0.64  (step t34 (cl (not (=> (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv1 :premises (t33))
% 0.45/0.64  (step t35 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t32 t34))
% 0.45/0.64  (step t36 (cl (= (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) :rule resolution :premises (t20 t35))
% 0.45/0.64  (step t37 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false))) :rule cong :premises (t16 t36))
% 0.45/0.64  (step t38 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule all_simplify)
% 0.45/0.64  (step t39 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule trans :premises (t37 t38))
% 0.45/0.64  (step t40 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t41)
% 0.45/0.64  (assume t41.a0 (not (tptp.member tptp.sk2 tptp.b)))
% 0.45/0.64  (assume t41.a1 (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (assume t41.a2 (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (step t41.t1 (cl (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (not (tptp.member tptp.sk2 tptp.b))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule and_neg)
% 0.45/0.64  (step t41.t2 (cl (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t41.t1 t41.a0 t41.a2 t41.a1))
% 0.45/0.64  (step t41 (cl (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 0.45/0.64  (step t42 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (tptp.member tptp.sk2 tptp.b))) :rule and_pos)
% 0.45/0.64  (step t43 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t44 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t45 (cl (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t41 t42 t43 t44))
% 0.45/0.64  (step t46 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule reordering :premises (t45))
% 0.45/0.64  (step t47 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule contraction :premises (t46))
% 0.45/0.64  (step t48 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t40 t47))
% 0.45/0.64  (step t49 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule implies_neg2)
% 0.45/0.64  (step t50 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t48 t49))
% 0.45/0.64  (step t51 (cl (=> (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.b)) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule contraction :premises (t50))
% 0.45/0.64  (step t52 (cl (not (and (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t15 t39 t51))
% 0.45/0.64  (step t53 (cl (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule not_and :premises (t52))
% 0.45/0.64  (step t54 (cl (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (not (not (tptp.member tptp.sk2 tptp.b))))) :rule or_neg)
% 0.45/0.64  (step t55 (cl (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule or_neg)
% 0.45/0.64  (step t56 (cl (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule or_neg)
% 0.45/0.64  (step t57 (cl (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t53 t54 t55 t56))
% 0.45/0.64  (step t58 (cl (or (not (not (tptp.member tptp.sk2 tptp.b))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule contraction :premises (t57))
% 0.45/0.64  (step t59 (cl (or (tptp.member tptp.sk2 tptp.b) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t1 t14 t58))
% 0.45/0.64  (step t60 (cl (tptp.member tptp.sk2 tptp.b) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule or :premises (t59))
% 0.45/0.64  (step t61 (cl (not (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule or_pos)
% 0.45/0.64  (step t62 (cl (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (not (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule reordering :premises (t61))
% 0.45/0.64  (step t63 (cl (not (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) :rule or_pos)
% 0.45/0.64  (step t64 (cl (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (not (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule reordering :premises (t63))
% 0.45/0.64  (step t65 (cl (not (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) :rule or_pos)
% 0.45/0.64  (step t66 (cl (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (not (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule reordering :premises (t65))
% 0.45/0.64  (step t67 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V)))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t68)
% 0.45/0.64  (assume t68.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))))
% 0.45/0.64  (step t68.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule forall_inst :args ((:= U tptp.sk2) (:= V (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (step t68.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule or :premises (t68.t1))
% 0.45/0.64  (step t68.t3 (cl (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t68.t2 t68.a0))
% 0.45/0.64  (step t68 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule subproof :discharge (t68.a0))
% 0.45/0.64  (step t69 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t67 t68))
% 0.45/0.64  (step t70 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies_neg2)
% 0.45/0.64  (step t71 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t69 t70))
% 0.45/0.64  (step t72 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule contraction :premises (t71))
% 0.45/0.64  (step t73 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member (tptp.unionE_sk1 U V) V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule implies :premises (t72))
% 0.45/0.64  (step t74 (cl (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t73 a102))
% 0.45/0.64  (step t75 (cl (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) :rule resolution :premises (t66 a147 t74))
% 0.45/0.64  (step t76 (cl (not (= (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (tptp.member tptp.sk2 tptp.a) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (not (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) (or (tptp.member tptp.sk2 tptp.a) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv_pos2)
% 0.45/0.64  (step t77 (cl (= (= (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a)) true) (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a)))) :rule equiv_simplify)
% 0.45/0.64  (step t78 (cl (not (= (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a)) true)) (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a))) :rule equiv1 :premises (t77))
% 0.45/0.64  (step t79 (cl (= (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a)) (= (tptp.member tptp.sk2 tptp.a) (not (not (tptp.member tptp.sk2 tptp.a)))))) :rule all_simplify)
% 0.45/0.64  (step t80 (cl (= (tptp.member tptp.sk2 tptp.a) (tptp.member tptp.sk2 tptp.a))) :rule refl)
% 0.45/0.64  (step t81 (cl (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a))) :rule all_simplify)
% 0.45/0.64  (step t82 (cl (= (= (tptp.member tptp.sk2 tptp.a) (not (not (tptp.member tptp.sk2 tptp.a)))) (= (tptp.member tptp.sk2 tptp.a) (tptp.member tptp.sk2 tptp.a)))) :rule cong :premises (t80 t81))
% 0.45/0.64  (step t83 (cl (= (= (tptp.member tptp.sk2 tptp.a) (tptp.member tptp.sk2 tptp.a)) true)) :rule all_simplify)
% 0.45/0.64  (step t84 (cl (= (= (tptp.member tptp.sk2 tptp.a) (not (not (tptp.member tptp.sk2 tptp.a)))) true)) :rule trans :premises (t82 t83))
% 0.45/0.64  (step t85 (cl (= (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a)) true)) :rule trans :premises (t79 t84))
% 0.45/0.64  (step t86 (cl (= (not (not (tptp.member tptp.sk2 tptp.a))) (tptp.member tptp.sk2 tptp.a))) :rule resolution :premises (t78 t85))
% 0.45/0.64  (step t87 (cl (= (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule refl)
% 0.45/0.64  (step t88 (cl (= (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (tptp.member tptp.sk2 tptp.a) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule cong :premises (t86 t12 t87))
% 0.45/0.64  (step t89 (cl (not (= (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (not (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv_pos2)
% 0.45/0.64  (step t90 (cl (= (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule refl)
% 0.45/0.64  (step t91 (cl (= (= (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule equiv_simplify)
% 0.45/0.64  (step t92 (cl (= (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule equiv2 :premises (t91))
% 0.45/0.64  (step t93 (cl (not (not (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule not_not)
% 0.45/0.64  (step t94 (cl (= (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t92 t93))
% 0.45/0.64  (step t95 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t96)
% 0.45/0.64  (assume t96.a0 (not (tptp.member tptp.sk2 tptp.a)))
% 0.45/0.64  (assume t96.a1 (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (assume t96.a2 (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (step t96.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 0.45/0.64  (step t96.t2 (cl (= (= true false) false)) :rule all_simplify)
% 0.45/0.64  (step t96.t3 (cl (= (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) true) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule equiv_simplify)
% 0.45/0.64  (step t96.t4 (cl (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) true) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule equiv2 :premises (t96.t3))
% 0.45/0.64  (step t96.t5 (cl (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) true)) :rule resolution :premises (t96.t4 t96.a2))
% 0.45/0.64  (step t96.t6 (cl (= true (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule symm :premises (t96.t5))
% 0.45/0.64  (step t96.t7 (cl (= tptp.sk2 tptp.sk2)) :rule refl)
% 0.45/0.64  (step t96.t8 (cl (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a)) :rule symm :premises (t96.a1))
% 0.45/0.64  (step t96.t9 (cl (= (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 tptp.a))) :rule cong :premises (t96.t7 t96.t8))
% 0.45/0.64  (step t96.t10 (cl (= (= (tptp.member tptp.sk2 tptp.a) false) (not (tptp.member tptp.sk2 tptp.a)))) :rule equiv_simplify)
% 0.45/0.64  (step t96.t11 (cl (= (tptp.member tptp.sk2 tptp.a) false) (not (not (tptp.member tptp.sk2 tptp.a)))) :rule equiv2 :premises (t96.t10))
% 0.45/0.64  (step t96.t12 (cl (not (not (not (tptp.member tptp.sk2 tptp.a)))) (tptp.member tptp.sk2 tptp.a)) :rule not_not)
% 0.45/0.64  (step t96.t13 (cl (= (tptp.member tptp.sk2 tptp.a) false) (tptp.member tptp.sk2 tptp.a)) :rule resolution :premises (t96.t11 t96.t12))
% 0.45/0.64  (step t96.t14 (cl (= (tptp.member tptp.sk2 tptp.a) false)) :rule resolution :premises (t96.t13 t96.a0))
% 0.45/0.64  (step t96.t15 (cl (= true false)) :rule trans :premises (t96.t6 t96.t9 t96.t14))
% 0.45/0.64  (step t96.t16 (cl false) :rule resolution :premises (t96.t1 t96.t2 t96.t15))
% 0.45/0.64  (step t96 (cl (not (not (tptp.member tptp.sk2 tptp.a))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) :rule subproof :discharge (t96.a0 t96.a1 t96.a2))
% 0.45/0.64  (step t97 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (tptp.member tptp.sk2 tptp.a))) :rule and_pos)
% 0.45/0.64  (step t98 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t99 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t100 (cl false (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t96 t97 t98 t99))
% 0.45/0.64  (step t101 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) false) :rule reordering :premises (t100))
% 0.45/0.64  (step t102 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) false) :rule contraction :premises (t101))
% 0.45/0.64  (step t103 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) false) :rule resolution :premises (t95 t102))
% 0.45/0.64  (step t104 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not false)) :rule implies_neg2)
% 0.45/0.64  (step t105 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) :rule resolution :premises (t103 t104))
% 0.45/0.64  (step t106 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) :rule contraction :premises (t105))
% 0.45/0.64  (step t107 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule implies_simplify)
% 0.45/0.64  (step t108 (cl (not (=> (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv1 :premises (t107))
% 0.45/0.64  (step t109 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t106 t108))
% 0.45/0.64  (step t110 (cl (= (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false)) :rule resolution :premises (t94 t109))
% 0.45/0.64  (step t111 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false))) :rule cong :premises (t90 t110))
% 0.45/0.64  (step t112 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) false) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule all_simplify)
% 0.45/0.64  (step t113 (cl (= (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule trans :premises (t111 t112))
% 0.45/0.64  (step t114 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t115)
% 0.45/0.64  (assume t115.a0 (not (tptp.member tptp.sk2 tptp.a)))
% 0.45/0.64  (assume t115.a1 (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (assume t115.a2 (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (step t115.t1 (cl (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (not (tptp.member tptp.sk2 tptp.a))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule and_neg)
% 0.45/0.64  (step t115.t2 (cl (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t115.t1 t115.a0 t115.a2 t115.a1))
% 0.45/0.64  (step t115 (cl (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule subproof :discharge (t115.a0 t115.a1 t115.a2))
% 0.45/0.64  (step t116 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (tptp.member tptp.sk2 tptp.a))) :rule and_pos)
% 0.45/0.64  (step t117 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t118 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule and_pos)
% 0.45/0.64  (step t119 (cl (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t115 t116 t117 t118))
% 0.45/0.64  (step t120 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule reordering :premises (t119))
% 0.45/0.64  (step t121 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule contraction :premises (t120))
% 0.45/0.64  (step t122 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t114 t121))
% 0.45/0.64  (step t123 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule implies_neg2)
% 0.45/0.64  (step t124 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t122 t123))
% 0.45/0.64  (step t125 (cl (=> (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (and (not (tptp.member tptp.sk2 tptp.a)) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule contraction :premises (t124))
% 0.45/0.64  (step t126 (cl (not (and (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t89 t113 t125))
% 0.45/0.64  (step t127 (cl (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule not_and :premises (t126))
% 0.45/0.64  (step t128 (cl (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (not (not (tptp.member tptp.sk2 tptp.a))))) :rule or_neg)
% 0.45/0.64  (step t129 (cl (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule or_neg)
% 0.45/0.64  (step t130 (cl (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule or_neg)
% 0.45/0.64  (step t131 (cl (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t127 t128 t129 t130))
% 0.45/0.64  (step t132 (cl (or (not (not (tptp.member tptp.sk2 tptp.a))) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule contraction :premises (t131))
% 0.45/0.64  (step t133 (cl (or (tptp.member tptp.sk2 tptp.a) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t76 t88 t132))
% 0.45/0.64  (step t134 (cl (tptp.member tptp.sk2 tptp.a) (not (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule or :premises (t133))
% 0.45/0.64  (step t135 (cl (not (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))) :rule or_pos)
% 0.45/0.64  (step t136 (cl (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)) (not (tptp.member tptp.sk2 tptp.a)) (not (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule reordering :premises (t135))
% 0.45/0.64  (step t137 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t138)
% 0.45/0.64  (assume t138.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))))
% 0.45/0.64  (step t138.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W))))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule forall_inst :args ((:= U tptp.sk2) (:= V tptp.a) (:= W tptp.b)))
% 0.45/0.64  (step t138.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W))))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule or :premises (t138.t1))
% 0.45/0.64  (step t138.t3 (cl (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule resolution :premises (t138.t2 t138.a0))
% 0.45/0.64  (step t138 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W))))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule subproof :discharge (t138.a0))
% 0.45/0.64  (step t139 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule resolution :premises (t137 t138))
% 0.45/0.64  (step t140 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (not (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule implies_neg2)
% 0.45/0.64  (step t141 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule resolution :premises (t139 t140))
% 0.45/0.64  (step t142 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W)))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule contraction :premises (t141))
% 0.45/0.64  (step t143 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un V W))))) (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule implies :premises (t142))
% 0.45/0.64  (step t144 (cl (or (not (tptp.member tptp.sk2 tptp.a)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule resolution :premises (t143 a16))
% 0.45/0.64  (step t145 (cl (not (tptp.member tptp.sk2 tptp.a))) :rule resolution :premises (t136 a148 t144))
% 0.45/0.64  (step t146 (cl (not (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule or_pos)
% 0.45/0.64  (step t147 (cl (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (not (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule reordering :premises (t146))
% 0.45/0.64  (step t148 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t149)
% 0.45/0.64  (assume t149.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))))
% 0.45/0.64  (step t149.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V))))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule forall_inst :args ((:= U tptp.sk2) (:= V (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))
% 0.45/0.64  (step t149.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V))))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule or :premises (t149.t1))
% 0.45/0.64  (step t149.t3 (cl (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t149.t2 t149.a0))
% 0.45/0.64  (step t149 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V))))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule subproof :discharge (t149.a0))
% 0.45/0.64  (step t150 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t148 t149))
% 0.45/0.64  (step t151 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (not (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule implies_neg2)
% 0.45/0.64  (step t152 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t150 t151))
% 0.45/0.64  (step t153 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V)))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule contraction :premises (t152))
% 0.45/0.64  (step t154 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.union V))) (tptp.member U (tptp.unionE_sk1 U V))))) (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies :premises (t153))
% 0.45/0.64  (step t155 (cl (or (not (tptp.member tptp.sk2 (tptp.union (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t154 a101))
% 0.45/0.64  (step t156 (cl (tptp.member tptp.sk2 (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t147 a147 t155))
% 0.45/0.64  (step t157 (cl (not (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t134 t145 t156))
% 0.45/0.64  (step t158 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))))) (not (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule equiv_pos2)
% 0.45/0.64  (step t159 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))))) :rule refl)
% 0.45/0.64  (step t160 (cl (= (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule refl)
% 0.45/0.64  (step t161 (cl (= (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule all_simplify)
% 0.45/0.64  (step t162 (cl (= (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule refl)
% 0.45/0.64  (step t163 (cl (= (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule cong :premises (t160 t161 t162))
% 0.45/0.64  (step t164 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))))) :rule cong :premises (t159 t163))
% 0.45/0.64  (step t165 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W)))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t166)
% 0.45/0.64  (assume t166.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))))
% 0.45/0.64  (step t166.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule forall_inst :args ((:= U (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (:= V tptp.a) (:= W (tptp.cons tptp.b tptp.eptset))))
% 0.45/0.64  (step t166.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule or :premises (t166.t1))
% 0.45/0.64  (step t166.t3 (cl (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule resolution :premises (t166.t2 t166.a0))
% 0.45/0.64  (step t166 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule subproof :discharge (t166.a0))
% 0.45/0.64  (step t167 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule resolution :premises (t165 t166))
% 0.45/0.64  (step t168 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (not (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule implies_neg2)
% 0.45/0.64  (step t169 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t167 t168))
% 0.45/0.64  (step t170 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.a) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule contraction :premises (t169))
% 0.45/0.64  (step t171 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t158 t164 t170))
% 0.45/0.64  (step t172 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U (tptp.cons V W))) (= U V) (tptp.member U W)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule implies :premises (t171))
% 0.45/0.64  (step t173 (cl (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (= tptp.a (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset)))) :rule resolution :premises (t172 a94))
% 0.45/0.64  (step t174 (cl (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) :rule resolution :premises (t64 t75 t157 t173))
% 0.45/0.64  (step t175 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule equiv_pos2)
% 0.45/0.64  (step t176 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))))) :rule refl)
% 0.45/0.64  (step t177 (cl (= (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))))) :rule refl)
% 0.45/0.64  (step t178 (cl (= (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule all_simplify)
% 0.45/0.64  (step t179 (cl (= (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule cong :premises (t177 t178))
% 0.45/0.64  (step t180 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))))) :rule cong :premises (t176 t179))
% 0.45/0.64  (step t181 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V)))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t182)
% 0.45/0.64  (assume t182.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))))
% 0.45/0.64  (step t182.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)))) :rule forall_inst :args ((:= U (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))) (:= V tptp.b)))
% 0.45/0.64  (step t182.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) :rule or :premises (t182.t1))
% 0.45/0.64  (step t182.t3 (cl (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) :rule resolution :premises (t182.t2 t182.a0))
% 0.45/0.64  (step t182 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) :rule subproof :discharge (t182.a0))
% 0.45/0.64  (step t183 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) :rule resolution :premises (t181 t182))
% 0.45/0.64  (step t184 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) (not (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)))) :rule implies_neg2)
% 0.45/0.64  (step t185 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)))) :rule resolution :premises (t183 t184))
% 0.45/0.64  (step t186 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) tptp.b)))) :rule contraction :premises (t185))
% 0.45/0.64  (step t187 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))))) :rule resolution :premises (t175 t180 t186))
% 0.45/0.64  (step t188 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.member U (tptp.cons V tptp.eptset))) (= U V)))) (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule implies :premises (t187))
% 0.45/0.64  (step t189 (cl (or (not (tptp.member (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))) (tptp.cons tptp.b tptp.eptset))) (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset)))))) :rule resolution :premises (t188 a93))
% 0.45/0.64  (step t190 (cl (= tptp.b (tptp.unionE_sk1 tptp.sk2 (tptp.cons tptp.a (tptp.cons tptp.b tptp.eptset))))) :rule resolution :premises (t62 t174 t189))
% 0.45/0.64  (step t191 (cl (not (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))) :rule or_pos)
% 0.45/0.64  (step t192 (cl (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)) (not (tptp.member tptp.sk2 tptp.b)) (not (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule reordering :premises (t191))
% 0.45/0.64  (step t193 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V))))) :rule implies_neg1)
% 0.45/0.64  (anchor :step t194)
% 0.45/0.64  (assume t194.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))))
% 0.45/0.64  (step t194.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V))))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule forall_inst :args ((:= U tptp.sk2) (:= V tptp.b) (:= W tptp.a)))
% 0.45/0.64  (step t194.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V))))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule or :premises (t194.t1))
% 0.45/0.64  (step t194.t3 (cl (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule resolution :premises (t194.t2 t194.a0))
% 0.45/0.64  (step t194 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V))))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule subproof :discharge (t194.a0))
% 0.45/0.64  (step t195 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule resolution :premises (t193 t194))
% 0.45/0.64  (step t196 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (not (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule implies_neg2)
% 0.45/0.64  (step t197 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule resolution :premises (t195 t196))
% 0.45/0.64  (step t198 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V)))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b))))) :rule contraction :premises (t197))
% 0.45/0.64  (step t199 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.member U V)) (tptp.member U (tptp.un W V))))) (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule implies :premises (t198))
% 0.45/0.64  (step t200 (cl (or (not (tptp.member tptp.sk2 tptp.b)) (tptp.member tptp.sk2 (tptp.un tptp.a tptp.b)))) :rule resolution :premises (t199 a15))
% 0.45/0.64  (step t201 (cl (not (tptp.member tptp.sk2 tptp.b))) :rule resolution :premises (t192 a148 t200))
% 0.45/0.64  (step t202 (cl) :rule resolution :premises (t60 t190 t156 t201))
% 0.45/0.64  
% 0.45/0.64  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.jFvf0Vn2Cj/cvc5---1.0.5_8526.smt2
% 0.45/0.64  % cvc5---1.0.5 exiting
% 0.45/0.65  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------