TSTP Solution File: SET015-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SET015-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n019.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:37 EDT 2024
% Result : Unsatisfiable 0.37s 0.54s
% Output : Proof 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET015-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 28 10:12:24 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.37/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.hciK2BYCfa/cvc5---1.0.5_21543.smt2
% 0.37/0.54 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.hciK2BYCfa/cvc5---1.0.5_21543.smt2
% 0.37/0.55 (assume a0 (forall ((X $$unsorted)) (not (tptp.member X tptp.empty_set))))
% 0.37/0.55 (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.37/0.55 (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.37/0.55 (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.37/0.55 (assume a4 (forall ((X $$unsorted) (Xs $$unsorted)) (or (tptp.member X Xs) (tptp.member X (tptp.complement Xs)))))
% 0.37/0.55 (assume a5 (forall ((X $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Xs)) (not (tptp.member X (tptp.complement Xs))))))
% 0.37/0.55 (assume a6 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))))
% 0.37/0.55 (assume a7 (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))))
% 0.37/0.55 (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.37/0.55 (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.37/0.55 (assume a10 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Xs))))
% 0.37/0.55 (assume a11 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.intersection Xs Ys))) (tptp.member X Ys))))
% 0.37/0.55 (assume a12 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (not (tptp.equal_sets Subset Superset)) (tptp.subset Subset Superset))))
% 0.37/0.55 (assume a13 (forall ((Superset $$unsorted) (Subset $$unsorted)) (or (not (tptp.equal_sets Superset Subset)) (tptp.subset Subset Superset))))
% 0.37/0.55 (assume a14 (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))))
% 0.37/0.55 (assume a15 (forall ((Xs $$unsorted)) (tptp.equal_sets Xs Xs)))
% 0.37/0.55 (assume a16 (forall ((Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.equal_sets Xs Ys)) (tptp.equal_sets Ys Xs))))
% 0.37/0.55 (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.37/0.55 (assume a18 (forall ((X $$unsorted)) (tptp.equal_elements X X)))
% 0.37/0.55 (assume a19 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equal_elements X Y)) (tptp.equal_elements Y X))))
% 0.37/0.55 (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.37/0.55 (assume a21 (not (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))
% 0.37/0.55 (step t1 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) :rule implies_neg1)
% 0.37/0.55 (anchor :step t2)
% 0.37/0.55 (assume t2.a0 (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.37/0.55 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (:= Xs tptp.as) (:= Ys tptp.bs)))
% 0.37/0.55 (step t2.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) :rule or :premises (t2.t1))
% 0.37/0.55 (step t2.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) :rule resolution :premises (t2.t2 t2.a0))
% 0.37/0.55 (step t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) :rule subproof :discharge (t2.a0))
% 0.37/0.55 (step t3 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) :rule resolution :premises (t1 t2))
% 0.37/0.55 (step t4 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)))) :rule implies_neg2)
% 0.37/0.55 (step t5 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)))) :rule resolution :premises (t3 t4))
% 0.37/0.55 (step t6 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)))) :rule contraction :premises (t5))
% 0.37/0.55 (step t7 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) :rule implies :premises (t6))
% 0.37/0.55 (step t8 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) :rule or_pos)
% 0.37/0.55 (step t9 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)))) :rule reordering :premises (t8))
% 0.37/0.55 (step t10 (cl (not (or (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) :rule or_pos)
% 0.37/0.55 (step t11 (cl (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)) (not (or (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))))) :rule reordering :premises (t10))
% 0.37/0.55 (step t12 (cl (not (or (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) :rule or_pos)
% 0.37/0.55 (step t13 (cl (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (not (or (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule reordering :premises (t12))
% 0.37/0.55 (step t14 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) :rule or_pos)
% 0.37/0.55 (step t15 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)))) :rule reordering :premises (t14))
% 0.37/0.55 (step t16 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) :rule implies_neg1)
% 0.37/0.55 (anchor :step t17)
% 0.37/0.55 (assume t17.a0 (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.37/0.55 (step t17.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (:= Xs tptp.bs) (:= Ys tptp.as)))
% 0.37/0.55 (step t17.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) :rule or :premises (t17.t1))
% 0.37/0.55 (step t17.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) :rule resolution :premises (t17.t2 t17.a0))
% 0.37/0.55 (step t17 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) :rule subproof :discharge (t17.a0))
% 0.37/0.55 (step t18 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) :rule resolution :premises (t16 t17))
% 0.37/0.55 (step t19 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)))) :rule implies_neg2)
% 0.37/0.55 (step t20 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)))) :rule resolution :premises (t18 t19))
% 0.37/0.55 (step t21 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)))) :rule contraction :premises (t20))
% 0.37/0.55 (step t22 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X (tptp.union Xs Ys))) (tptp.member X Xs) (tptp.member X Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) :rule implies :premises (t21))
% 0.37/0.55 (step t23 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as))) :rule resolution :premises (t22 a8))
% 0.37/0.55 (step t24 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) :rule or_pos)
% 0.37/0.55 (step t25 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule reordering :premises (t24))
% 0.37/0.55 (step t26 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) :rule implies_neg1)
% 0.37/0.55 (anchor :step t27)
% 0.37/0.55 (assume t27.a0 (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))))
% 0.37/0.55 (step t27.t1 (cl (or (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (:= Ys tptp.bs) (:= Xs tptp.as)))
% 0.37/0.55 (step t27.t2 (cl (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule or :premises (t27.t1))
% 0.37/0.55 (step t27.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t27.t2 t27.a0))
% 0.37/0.55 (step t27 (cl (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule subproof :discharge (t27.a0))
% 0.37/0.55 (step t28 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t26 t27))
% 0.37/0.55 (step t29 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule implies_neg2)
% 0.37/0.55 (step t30 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule resolution :premises (t28 t29))
% 0.37/0.55 (step t31 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule contraction :premises (t30))
% 0.37/0.55 (step t32 (cl (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule implies :premises (t31))
% 0.37/0.55 (step t33 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t32 a7))
% 0.37/0.55 (step t34 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) :rule or_pos)
% 0.37/0.55 (step t35 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule reordering :premises (t34))
% 0.37/0.55 (step t36 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) :rule implies_neg1)
% 0.37/0.55 (anchor :step t37)
% 0.37/0.55 (assume t37.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))))
% 0.37/0.55 (step t37.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (:= Xs tptp.as) (:= Ys tptp.bs)))
% 0.37/0.55 (step t37.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule or :premises (t37.t1))
% 0.37/0.55 (step t37.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t37.t2 t37.a0))
% 0.37/0.55 (step t37 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule subproof :discharge (t37.a0))
% 0.37/0.55 (step t38 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t36 t37))
% 0.37/0.55 (step t39 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule implies_neg2)
% 0.37/0.55 (step t40 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule resolution :premises (t38 t39))
% 0.37/0.55 (step t41 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))))) :rule contraction :premises (t40))
% 0.37/0.55 (step t42 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule implies :premises (t41))
% 0.37/0.55 (step t43 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t42 a6))
% 0.37/0.55 (step t44 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) :rule resolution :premises (t15 t23 t25 t33 t35 t43))
% 0.37/0.55 (step t45 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) :rule contraction :premises (t44))
% 0.37/0.55 (step t46 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) :rule or_pos)
% 0.37/0.55 (step t47 (cl (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))))) :rule reordering :premises (t46))
% 0.37/0.55 (step t48 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union 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.37/0.55 (anchor :step t49)
% 0.37/0.55 (assume t49.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.37/0.55 (step t49.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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))))) :rule forall_inst :args ((:= Subset (tptp.union tptp.bs tptp.as)) (:= Superset (tptp.union tptp.as tptp.bs))))
% 0.37/0.55 (step t49.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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) :rule or :premises (t49.t1))
% 0.37/0.55 (step t49.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t49.t2 t49.a0))
% 0.37/0.55 (step t49 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) :rule subproof :discharge (t49.a0))
% 0.37/0.55 (step t50 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t48 t49))
% 0.37/0.55 (step t51 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))))) :rule implies_neg2)
% 0.37/0.55 (step t52 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union 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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))))) :rule resolution :premises (t50 t51))
% 0.37/0.55 (step t53 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))))) :rule contraction :premises (t52))
% 0.37/0.55 (step t54 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) :rule implies :premises (t53))
% 0.37/0.55 (step t55 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.as tptp.bs))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t54 a3))
% 0.37/0.55 (step t56 (cl (not (or (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))) :rule or_pos)
% 0.37/0.55 (step t57 (cl (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)) (not (or (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))))) :rule reordering :premises (t56))
% 0.37/0.55 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union 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.37/0.55 (anchor :step t59)
% 0.37/0.55 (assume t59.a0 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))))
% 0.37/0.55 (step t59.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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))))) :rule forall_inst :args ((:= Subset (tptp.union tptp.bs tptp.as)) (:= Superset (tptp.union tptp.as tptp.bs))))
% 0.37/0.55 (step t59.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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) :rule or :premises (t59.t1))
% 0.37/0.55 (step t59.t3 (cl (or (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t59.t2 t59.a0))
% 0.37/0.55 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) :rule subproof :discharge (t59.a0))
% 0.37/0.55 (step t60 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) (or (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t58 t59))
% 0.37/0.55 (step t61 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) (not (or (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))))) :rule implies_neg2)
% 0.37/0.55 (step t62 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union 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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))))) :rule resolution :premises (t60 t61))
% 0.37/0.55 (step t63 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as))))) :rule contraction :premises (t62))
% 0.37/0.55 (step t64 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) :rule implies :premises (t63))
% 0.37/0.55 (step t65 (cl (or (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t64 a2))
% 0.37/0.55 (step t66 (cl (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs)) (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) :rule resolution :premises (t45 t47 t55 t57 t65))
% 0.37/0.55 (step t67 (cl (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) :rule contraction :premises (t66))
% 0.37/0.55 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union 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.37/0.55 (anchor :step t69)
% 0.37/0.55 (assume t69.a0 (forall ((Set1 $$unsorted) (Set2 $$unsorted)) (or (not (tptp.subset Set1 Set2)) (not (tptp.subset Set2 Set1)) (tptp.equal_sets Set2 Set1))))
% 0.37/0.55 (step t69.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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule forall_inst :args ((:= Set1 (tptp.union tptp.bs tptp.as)) (:= Set2 (tptp.union tptp.as tptp.bs))))
% 0.37/0.55 (step t69.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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule or :premises (t69.t1))
% 0.37/0.55 (step t69.t3 (cl (or (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t69.t2 t69.a0))
% 0.37/0.55 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule subproof :discharge (t69.a0))
% 0.37/0.55 (step t70 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) (or (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t68 t69))
% 0.37/0.55 (step t71 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) (not (or (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule implies_neg2)
% 0.37/0.55 (step t72 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union 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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule resolution :premises (t70 t71))
% 0.37/0.55 (step t73 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule contraction :premises (t72))
% 0.37/0.55 (step t74 (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.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule implies :premises (t73))
% 0.37/0.55 (step t75 (cl (or (not (tptp.subset (tptp.union tptp.bs tptp.as) (tptp.union tptp.as tptp.bs))) (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (tptp.equal_sets (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t74 a14))
% 0.37/0.55 (step t76 (cl (not (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t13 a21 t67 t75))
% 0.37/0.55 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union 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.37/0.55 (anchor :step t78)
% 0.37/0.55 (assume t78.a0 (forall ((Subset $$unsorted) (Superset $$unsorted)) (or (tptp.subset Subset Superset) (tptp.member (tptp.member_of_1_not_of_2 Subset Superset) Subset))))
% 0.37/0.55 (step t78.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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))))) :rule forall_inst :args ((:= Subset (tptp.union tptp.as tptp.bs)) (:= Superset (tptp.union tptp.bs tptp.as))))
% 0.37/0.55 (step t78.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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) :rule or :premises (t78.t1))
% 0.37/0.55 (step t78.t3 (cl (or (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t78.t2 t78.a0))
% 0.37/0.55 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) :rule subproof :discharge (t78.a0))
% 0.37/0.55 (step t79 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) (or (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t77 t78))
% 0.37/0.55 (step t80 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) (not (or (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))))) :rule implies_neg2)
% 0.37/0.55 (step t81 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union 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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))))) :rule resolution :premises (t79 t80))
% 0.37/0.55 (step t82 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))))) :rule contraction :premises (t81))
% 0.37/0.55 (step t83 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) :rule implies :premises (t82))
% 0.37/0.55 (step t84 (cl (or (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs)))) :rule resolution :premises (t83 a2))
% 0.37/0.55 (step t85 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) :rule resolution :premises (t11 t76 t84))
% 0.37/0.55 (step t86 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) :rule or_pos)
% 0.37/0.55 (step t87 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule reordering :premises (t86))
% 0.37/0.55 (step t88 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) :rule or_pos)
% 0.37/0.55 (step t89 (cl (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule reordering :premises (t88))
% 0.37/0.55 (step t90 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union 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.37/0.55 (anchor :step t91)
% 0.37/0.55 (assume t91.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.37/0.55 (step t91.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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule forall_inst :args ((:= Subset (tptp.union tptp.as tptp.bs)) (:= Superset (tptp.union tptp.bs tptp.as))))
% 0.37/0.55 (step t91.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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule or :premises (t91.t1))
% 0.37/0.55 (step t91.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t91.t2 t91.a0))
% 0.37/0.55 (step t91 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule subproof :discharge (t91.a0))
% 0.37/0.55 (step t92 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t90 t91))
% 0.37/0.55 (step t93 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule implies_neg2)
% 0.37/0.55 (step t94 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union 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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule resolution :premises (t92 t93))
% 0.37/0.55 (step t95 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))))) :rule contraction :premises (t94))
% 0.37/0.55 (step t96 (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.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule implies :premises (t95))
% 0.37/0.55 (step t97 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) (tptp.subset (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t96 a3))
% 0.37/0.55 (step t98 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t89 t76 t97))
% 0.37/0.55 (step t99 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) :rule implies_neg1)
% 0.37/0.55 (anchor :step t100)
% 0.37/0.55 (assume t100.a0 (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))))
% 0.37/0.55 (step t100.t1 (cl (or (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (:= Xs tptp.bs) (:= Ys tptp.as)))
% 0.37/0.55 (step t100.t2 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule or :premises (t100.t1))
% 0.37/0.55 (step t100.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t100.t2 t100.a0))
% 0.37/0.55 (step t100 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule subproof :discharge (t100.a0))
% 0.37/0.55 (step t101 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t99 t100))
% 0.37/0.55 (step t102 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule implies_neg2)
% 0.37/0.55 (step t103 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule resolution :premises (t101 t102))
% 0.37/0.55 (step t104 (cl (=> (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule contraction :premises (t103))
% 0.37/0.55 (step t105 (cl (not (forall ((X $$unsorted) (Xs $$unsorted) (Ys $$unsorted)) (or (not (tptp.member X Xs)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule implies :premises (t104))
% 0.37/0.55 (step t106 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t105 a6))
% 0.37/0.55 (step t107 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs))) :rule resolution :premises (t87 t98 t106))
% 0.37/0.55 (step t108 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))) :rule or_pos)
% 0.37/0.55 (step t109 (cl (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)) (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule reordering :premises (t108))
% 0.37/0.55 (step t110 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) :rule implies_neg1)
% 0.37/0.55 (anchor :step t111)
% 0.37/0.55 (assume t111.a0 (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))))
% 0.37/0.55 (step t111.t1 (cl (or (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule forall_inst :args ((:= X (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as))) (:= Ys tptp.as) (:= Xs tptp.bs)))
% 0.37/0.55 (step t111.t2 (cl (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule or :premises (t111.t1))
% 0.37/0.55 (step t111.t3 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t111.t2 t111.a0))
% 0.37/0.55 (step t111 (cl (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule subproof :discharge (t111.a0))
% 0.37/0.55 (step t112 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t110 t111))
% 0.37/0.55 (step t113 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule implies_neg2)
% 0.37/0.55 (step t114 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule resolution :premises (t112 t113))
% 0.37/0.55 (step t115 (cl (=> (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys)))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as))))) :rule contraction :premises (t114))
% 0.37/0.55 (step t116 (cl (not (forall ((X $$unsorted) (Ys $$unsorted) (Xs $$unsorted)) (or (not (tptp.member X Ys)) (tptp.member X (tptp.union Xs Ys))))) (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule implies :premises (t115))
% 0.37/0.55 (step t117 (cl (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as)) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.bs tptp.as)))) :rule resolution :premises (t116 a7))
% 0.37/0.55 (step t118 (cl (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as))) :rule resolution :premises (t109 t98 t117))
% 0.37/0.55 (step t119 (cl (not (or (not (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) (tptp.union tptp.as tptp.bs))) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.as) (tptp.member (tptp.member_of_1_not_of_2 (tptp.union tptp.as tptp.bs) (tptp.union tptp.bs tptp.as)) tptp.bs)))) :rule resolution :premises (t9 t85 t107 t118))
% 0.37/0.55 (step t120 (cl) :rule resolution :premises (t7 t119 a8))
% 0.37/0.55
% 0.37/0.55 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.hciK2BYCfa/cvc5---1.0.5_21543.smt2
% 0.40/0.55 % cvc5---1.0.5 exiting
% 0.40/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------