%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET013-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n018.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:43:35 EDT 2024

% Result   : Unsatisfiable 0.20s 0.53s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SET013-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n018.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 09:51:39 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.6z8FzyFW4L/cvc5---1.0.5_18153.smt2
% 0.20/0.53  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.6z8FzyFW4L/cvc5---1.0.5_18153.smt2
% 0.20/0.54  (assume a0 (forall ((X $$unsorted)) (not (tptp.member X tptp.empty_set))))
% 0.20/0.54  (assume a1 (forall ((Element $$unsorted) (Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member Element Subset)) (not (tptp.subset Subset Superset)) (tptp.member Element Superset))))
% 0.20/0.54  (assume a2 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))))
% 0.20/0.54  (assume a3 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))))
% 0.20/0.54  (assume a4 (forall ((X $$unsorted) (Xs $$unsorted)) (or (tptp.member X Xs) (tptp.member X (tptp.complement Xs)))))
% 0.20/0.54  (assume a5 (forall ((X $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X (tptp.complement Xs))))))
% 0.20/0.54  (assume a6 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))))
% 0.20/0.54  (assume a7 (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))))
% 0.20/0.54  (assume a8 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))))
% 0.20/0.54  (assume a9 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))))
% 0.20/0.54  (assume a10 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))))
% 0.20/0.54  (assume a11 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))))
% 0.20/0.54  (assume a12 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.equal_sets Subset Superset)) (tptp.subset Subset Superset))))
% 0.20/0.54  (assume a13 (forall ((Superset $$unsorted) (Subset $$unsorted)) (or (not (tptp.equal_sets Superset Subset)) (tptp.subset Subset Superset))))
% 0.20/0.54  (assume a14 (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))))
% 0.20/0.54  (assume a15 (forall ((Xs $$unsorted)) (tptp.equal_sets Xs Xs)))
% 0.20/0.54  (assume a16 (forall ((Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.equal_sets Xs Ys)) (tptp.equal_sets Ys Xs))))
% 0.20/0.54  (assume a17 (forall ((Xs $$unsorted) (Ys $$unsorted) (Zs $$unsorted)) (or (not (tptp.equal_sets Xs Ys)) (not (tptp.equal_sets Ys Zs)) (tptp.equal_sets Xs Zs))))
% 0.20/0.54  (assume a18 (forall ((X $$unsorted)) (tptp.equal_elements X X)))
% 0.20/0.54  (assume a19 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equal_elements X Y)) (tptp.equal_elements Y X))))
% 0.20/0.54  (assume a20 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equal_elements X Y)) (not (tptp.equal_elements Y Z)) (tptp.equal_elements X Z))))
% 0.20/0.54  (assume a21 (not (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))
% 0.20/0.54  (step t1 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) :rule or_pos)
% 0.20/0.54  (step t2 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))))) :rule reordering :premises (t1))
% 0.20/0.54  (step t3 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) :rule or_pos)
% 0.20/0.54  (step t4 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)))) :rule reordering :premises (t3))
% 0.20/0.54  (step t5 (cl (not (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) :rule or_pos)
% 0.20/0.54  (step t6 (cl (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)) (not (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))))) :rule reordering :premises (t5))
% 0.20/0.54  (step t7 (cl (not (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) :rule or_pos)
% 0.20/0.54  (step t8 (cl (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (not (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule reordering :premises (t7))
% 0.20/0.54  (step t9 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) :rule or_pos)
% 0.20/0.54  (step t10 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))))) :rule reordering :premises (t9))
% 0.20/0.54  (step t11 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t12)
% 0.20/0.54  (assume t12.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))))
% 0.20/0.54  (step t12.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (:= Xs tptp.as) (:= Ys tptp.bs)))
% 0.20/0.54  (step t12.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) :rule or :premises (t12.t1))
% 0.20/0.54  (step t12.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t12.t2 t12.a0))
% 0.20/0.54  (step t12 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) :rule subproof :discharge (t12.a0))
% 0.20/0.54  (step t13 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t11 t12))
% 0.20/0.54  (step t14 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))))) :rule implies_neg2)
% 0.20/0.54  (step t15 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))))) :rule resolution :premises (t13 t14))
% 0.20/0.54  (step t16 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))))) :rule contraction :premises (t15))
% 0.20/0.54  (step t17 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) :rule implies :premises (t16))
% 0.20/0.54  (step t18 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t17 a9))
% 0.20/0.54  (step t19 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)) :rule or_pos)
% 0.20/0.54  (step t20 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)))) :rule reordering :premises (t19))
% 0.20/0.54  (step t21 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t22)
% 0.20/0.54  (assume t22.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))))
% 0.20/0.54  (step t22.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (:= Xs tptp.bs) (:= Ys tptp.as)))
% 0.20/0.54  (step t22.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) :rule or :premises (t22.t1))
% 0.20/0.54  (step t22.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) :rule resolution :premises (t22.t2 t22.a0))
% 0.20/0.54  (step t22 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) :rule subproof :discharge (t22.a0))
% 0.20/0.54  (step t23 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) :rule resolution :premises (t21 t22))
% 0.20/0.54  (step t24 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)))) :rule implies_neg2)
% 0.20/0.54  (step t25 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)))) :rule resolution :premises (t23 t24))
% 0.20/0.54  (step t26 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as)))) :rule contraction :premises (t25))
% 0.20/0.54  (step t27 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) :rule implies :premises (t26))
% 0.20/0.54  (step t28 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.as))) :rule resolution :premises (t27 a11))
% 0.20/0.54  (step t29 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)) :rule or_pos)
% 0.20/0.54  (step t30 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)))) :rule reordering :premises (t29))
% 0.20/0.54  (step t31 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t32)
% 0.20/0.54  (assume t32.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))))
% 0.20/0.54  (step t32.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (:= Xs tptp.bs) (:= Ys tptp.as)))
% 0.20/0.54  (step t32.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) :rule or :premises (t32.t1))
% 0.20/0.54  (step t32.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) :rule resolution :premises (t32.t2 t32.a0))
% 0.20/0.54  (step t32 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) :rule subproof :discharge (t32.a0))
% 0.20/0.54  (step t33 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) :rule resolution :premises (t31 t32))
% 0.20/0.54  (step t34 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)))) :rule implies_neg2)
% 0.20/0.54  (step t35 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)))) :rule resolution :premises (t33 t34))
% 0.20/0.54  (step t36 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs)))) :rule contraction :premises (t35))
% 0.20/0.54  (step t37 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) :rule implies :premises (t36))
% 0.20/0.54  (step t38 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) tptp.bs))) :rule resolution :premises (t37 a10))
% 0.20/0.54  (step t39 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) :rule or_pos)
% 0.20/0.54  (step t40 (cl (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))))) :rule reordering :premises (t39))
% 0.20/0.54  (step t41 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t42)
% 0.20/0.54  (assume t42.a0 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))))
% 0.20/0.54  (step t42.t1 (cl (or (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))))) :rule forall_inst :args ((:= Subset (tptp.intersection tptp.bs tptp.as)) (:= Superset (tptp.intersection tptp.as tptp.bs))))
% 0.20/0.54  (step t42.t2 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) :rule or :premises (t42.t1))
% 0.20/0.54  (step t42.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t42.t2 t42.a0))
% 0.20/0.54  (step t42 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) :rule subproof :discharge (t42.a0))
% 0.20/0.54  (step t43 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t41 t42))
% 0.20/0.54  (step t44 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))))) :rule implies_neg2)
% 0.20/0.54  (step t45 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))))) :rule resolution :premises (t43 t44))
% 0.20/0.54  (step t46 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))))) :rule contraction :premises (t45))
% 0.20/0.54  (step t47 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) :rule implies :premises (t46))
% 0.20/0.54  (step t48 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.as tptp.bs))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t47 a3))
% 0.20/0.54  (step t49 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) :rule resolution :premises (t10 t18 t20 t28 t30 t38 t40 t48))
% 0.20/0.54  (step t50 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) :rule contraction :premises (t49))
% 0.20/0.54  (step t51 (cl (not (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))) :rule or_pos)
% 0.20/0.54  (step t52 (cl (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)) (not (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))))) :rule reordering :premises (t51))
% 0.20/0.54  (step t53 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t54)
% 0.20/0.54  (assume t54.a0 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))))
% 0.20/0.54  (step t54.t1 (cl (or (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))))) :rule forall_inst :args ((:= Subset (tptp.intersection tptp.bs tptp.as)) (:= Superset (tptp.intersection tptp.as tptp.bs))))
% 0.20/0.54  (step t54.t2 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) :rule or :premises (t54.t1))
% 0.20/0.54  (step t54.t3 (cl (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t54.t2 t54.a0))
% 0.20/0.54  (step t54 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) :rule subproof :discharge (t54.a0))
% 0.20/0.54  (step t55 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t53 t54))
% 0.20/0.54  (step t56 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) (not (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))))) :rule implies_neg2)
% 0.20/0.54  (step t57 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))))) :rule resolution :premises (t55 t56))
% 0.20/0.54  (step t58 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as))))) :rule contraction :premises (t57))
% 0.20/0.54  (step t59 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) :rule implies :premises (t58))
% 0.20/0.54  (step t60 (cl (or (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t59 a2))
% 0.20/0.54  (step t61 (cl (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs)) (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) :rule resolution :premises (t50 t52 t60))
% 0.20/0.54  (step t62 (cl (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) :rule contraction :premises (t61))
% 0.20/0.54  (step t63 (cl (=> (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t64)
% 0.20/0.54  (assume t64.a0 (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))))
% 0.20/0.54  (step t64.t1 (cl (or (not (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1)))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule forall_inst :args ((:= Set1 (tptp.intersection tptp.bs tptp.as)) (:= Set2 (tptp.intersection tptp.as tptp.bs))))
% 0.20/0.54  (step t64.t2 (cl (not (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1)))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule or :premises (t64.t1))
% 0.20/0.54  (step t64.t3 (cl (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t64.t2 t64.a0))
% 0.20/0.54  (step t64 (cl (not (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1)))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule subproof :discharge (t64.a0))
% 0.20/0.54  (step t65 (cl (=> (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t63 t64))
% 0.20/0.54  (step t66 (cl (=> (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (not (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule implies_neg2)
% 0.20/0.54  (step t67 (cl (=> (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (=> (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule resolution :premises (t65 t66))
% 0.20/0.54  (step t68 (cl (=> (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule contraction :premises (t67))
% 0.20/0.54  (step t69 (cl (not (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1)))) (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule implies :premises (t68))
% 0.20/0.54  (step t70 (cl (or (not (tptp.subset (tptp.intersection tptp.bs tptp.as) (tptp.intersection tptp.as tptp.bs))) (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (tptp.equal_sets (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t69 a14))
% 0.20/0.54  (step t71 (cl (not (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t8 a21 t62 t70))
% 0.20/0.54  (step t72 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t73)
% 0.20/0.54  (assume t73.a0 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))))
% 0.20/0.54  (step t73.t1 (cl (or (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))))) :rule forall_inst :args ((:= Subset (tptp.intersection tptp.as tptp.bs)) (:= Superset (tptp.intersection tptp.bs tptp.as))))
% 0.20/0.54  (step t73.t2 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) :rule or :premises (t73.t1))
% 0.20/0.54  (step t73.t3 (cl (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t73.t2 t73.a0))
% 0.20/0.54  (step t73 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) :rule subproof :discharge (t73.a0))
% 0.20/0.54  (step t74 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t72 t73))
% 0.20/0.54  (step t75 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) (not (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))))) :rule implies_neg2)
% 0.20/0.54  (step t76 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))))) :rule resolution :premises (t74 t75))
% 0.20/0.54  (step t77 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))))) :rule contraction :premises (t76))
% 0.20/0.54  (step t78 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset)))) (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) :rule implies :premises (t77))
% 0.20/0.54  (step t79 (cl (or (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs)))) :rule resolution :premises (t78 a2))
% 0.20/0.54  (step t80 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) :rule resolution :premises (t6 t71 t79))
% 0.20/0.54  (step t81 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t82)
% 0.20/0.54  (assume t82.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))))
% 0.20/0.54  (step t82.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (:= Xs tptp.as) (:= Ys tptp.bs)))
% 0.20/0.54  (step t82.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) :rule or :premises (t82.t1))
% 0.20/0.54  (step t82.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) :rule resolution :premises (t82.t2 t82.a0))
% 0.20/0.54  (step t82 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) :rule subproof :discharge (t82.a0))
% 0.20/0.54  (step t83 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) :rule resolution :premises (t81 t82))
% 0.20/0.54  (step t84 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)))) :rule implies_neg2)
% 0.20/0.54  (step t85 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)))) :rule resolution :premises (t83 t84))
% 0.20/0.54  (step t86 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)))) :rule contraction :premises (t85))
% 0.20/0.54  (step t87 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) :rule implies :premises (t86))
% 0.20/0.54  (step t88 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs))) :rule resolution :premises (t87 a11))
% 0.20/0.54  (step t89 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) :rule resolution :premises (t4 t80 t88))
% 0.20/0.54  (step t90 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) :rule or_pos)
% 0.20/0.54  (step t91 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)))) :rule reordering :premises (t90))
% 0.20/0.54  (step t92 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t93)
% 0.20/0.54  (assume t93.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))))
% 0.20/0.54  (step t93.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (:= Xs tptp.as) (:= Ys tptp.bs)))
% 0.20/0.54  (step t93.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) :rule or :premises (t93.t1))
% 0.20/0.54  (step t93.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) :rule resolution :premises (t93.t2 t93.a0))
% 0.20/0.54  (step t93 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) :rule subproof :discharge (t93.a0))
% 0.20/0.54  (step t94 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) :rule resolution :premises (t92 t93))
% 0.20/0.54  (step t95 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)))) :rule implies_neg2)
% 0.20/0.54  (step t96 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)))) :rule resolution :premises (t94 t95))
% 0.20/0.54  (step t97 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)))) :rule contraction :premises (t96))
% 0.20/0.54  (step t98 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) :rule implies :premises (t97))
% 0.20/0.54  (step t99 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as))) :rule resolution :premises (t98 a10))
% 0.20/0.54  (step t100 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) :rule resolution :premises (t91 t80 t99))
% 0.20/0.54  (step t101 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t102)
% 0.20/0.54  (assume t102.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))))
% 0.20/0.54  (step t102.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) (:= Xs tptp.bs) (:= Ys tptp.as)))
% 0.20/0.54  (step t102.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule or :premises (t102.t1))
% 0.20/0.54  (step t102.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t102.t2 t102.a0))
% 0.20/0.54  (step t102 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule subproof :discharge (t102.a0))
% 0.20/0.54  (step t103 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t101 t102))
% 0.20/0.54  (step t104 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))))) :rule implies_neg2)
% 0.20/0.54  (step t105 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))))) :rule resolution :premises (t103 t104))
% 0.20/0.54  (step t106 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))))) :rule contraction :premises (t105))
% 0.20/0.54  (step t107 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X Ys)) (tptp.member X (tptp.intersection Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule implies :premises (t106))
% 0.20/0.54  (step t108 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t107 a9))
% 0.20/0.54  (step t109 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))) :rule or_pos)
% 0.20/0.54  (step t110 (cl (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule reordering :premises (t109))
% 0.20/0.54  (step t111 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) :rule implies_neg1)
% 0.20/0.54  (anchor :step t112)
% 0.20/0.54  (assume t112.a0 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))))
% 0.20/0.54  (step t112.t1 (cl (or (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule forall_inst :args ((:= Subset (tptp.intersection tptp.as tptp.bs)) (:= Superset (tptp.intersection tptp.bs tptp.as))))
% 0.20/0.54  (step t112.t2 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule or :premises (t112.t1))
% 0.20/0.54  (step t112.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t112.t2 t112.a0))
% 0.20/0.54  (step t112 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule subproof :discharge (t112.a0))
% 0.20/0.54  (step t113 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t111 t112))
% 0.20/0.54  (step t114 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule implies_neg2)
% 0.20/0.54  (step t115 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule resolution :premises (t113 t114))
% 0.20/0.54  (step t116 (cl (=> (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as))))) :rule contraction :premises (t115))
% 0.20/0.54  (step t117 (cl (not (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Superset)) (tptp.subset Subset Superset)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule implies :premises (t116))
% 0.20/0.54  (step t118 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as))) (tptp.subset (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t117 a3))
% 0.20/0.54  (step t119 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.intersection tptp.as tptp.bs) (tptp.intersection tptp.bs tptp.as)) (tptp.intersection tptp.bs tptp.as)))) :rule resolution :premises (t110 t71 t118))
% 0.20/0.54  (step t120 (cl) :rule resolution :premises (t2 t89 t100 t108 t119))
% 0.20/0.54  
% 0.20/0.55  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.6z8FzyFW4L/cvc5---1.0.5_18153.smt2
% 0.20/0.55  % cvc5---1.0.5 exiting
% 0.20/0.56  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------