TSTP Solution File: SET027-3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SET027-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n009.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:45 EDT 2024
% Result : Unsatisfiable 0.76s 0.99s
% Output : Proof 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SET027-3 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n009.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue May 28 10:07:54 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.76/0.99 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.mg9HmMMmw7/cvc5---1.0.5_10234.smt2
% 0.76/0.99 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.mg9HmMMmw7/cvc5---1.0.5_10234.smt2
% 0.76/1.00 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Y)) (tptp.little_set X))))
% 0.76/1.00 (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.little_set (tptp.f1 X Y)) (= X Y))))
% 0.76/1.00 (assume a2 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member (tptp.f1 X Y) X) (tptp.member (tptp.f1 X Y) Y) (= X Y))))
% 0.76/1.00 (assume a3 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.f1 X Y) X)) (not (tptp.member (tptp.f1 X Y) Y)) (= X Y))))
% 0.76/1.00 (assume a4 (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.non_ordered_pair X Y))) (= U X) (= U Y))))
% 0.76/1.00 (assume a5 (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member U (tptp.non_ordered_pair X Y)) (not (tptp.little_set U)) (not (= U X)))))
% 0.76/1.00 (assume a6 (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member U (tptp.non_ordered_pair X Y)) (not (tptp.little_set U)) (not (= U Y)))))
% 0.76/1.00 (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.little_set (tptp.non_ordered_pair X Y))))
% 0.76/1.00 (assume a8 (forall ((X $$unsorted)) (= (tptp.singleton_set X) (tptp.non_ordered_pair X X))))
% 0.76/1.00 (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.ordered_pair X Y) (tptp.non_ordered_pair (tptp.singleton_set X) (tptp.non_ordered_pair X Y)))))
% 0.76/1.00 (assume a10 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.f2 X)))))
% 0.76/1.00 (assume a11 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.f3 X)))))
% 0.76/1.00 (assume a12 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (= X (tptp.ordered_pair (tptp.f2 X) (tptp.f3 X))))))
% 0.76/1.00 (assume a13 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.ordered_pair_predicate X) (not (tptp.little_set Y)) (not (tptp.little_set Z)) (not (= X (tptp.ordered_pair Y Z))))))
% 0.76/1.00 (assume a14 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.little_set (tptp.f4 Z X)))))
% 0.76/1.00 (assume a15 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.little_set (tptp.f5 Z X)))))
% 0.76/1.00 (assume a16 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (= X (tptp.ordered_pair (tptp.f4 Z X) (tptp.f5 Z X))))))
% 0.76/1.00 (assume a17 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.member Z (tptp.f4 Z X)))))
% 0.76/1.00 (assume a18 (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted)) (or (tptp.member Z (tptp.first X)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (= X (tptp.ordered_pair U V))) (not (tptp.member Z U)))))
% 0.76/1.00 (assume a19 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.little_set (tptp.f6 Z X)))))
% 0.76/1.00 (assume a20 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.little_set (tptp.f7 Z X)))))
% 0.76/1.00 (assume a21 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (= X (tptp.ordered_pair (tptp.f6 Z X) (tptp.f7 Z X))))))
% 0.76/1.00 (assume a22 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.member Z (tptp.f7 Z X)))))
% 0.76/1.00 (assume a23 (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted)) (or (tptp.member Z (tptp.second X)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (= X (tptp.ordered_pair U V))) (not (tptp.member Z V)))))
% 0.76/1.00 (assume a24 (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.estin)) (tptp.ordered_pair_predicate Z))))
% 0.76/1.00 (assume a25 (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.estin)) (tptp.member (tptp.first Z) (tptp.second Z)))))
% 0.76/1.00 (assume a26 (forall ((Z $$unsorted)) (or (tptp.member Z tptp.estin) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (tptp.member (tptp.first Z) (tptp.second Z))))))
% 0.76/1.00 (assume a27 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))))
% 0.76/1.00 (assume a28 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z Y))))
% 0.76/1.00 (assume a29 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.intersection X Y)) (not (tptp.member Z X)) (not (tptp.member Z Y)))))
% 0.76/1.00 (assume a30 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))))
% 0.76/1.00 (assume a31 (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.complement X)) (not (tptp.little_set Z)) (tptp.member Z X))))
% 0.76/1.00 (assume a32 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.union X Y) (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))))))
% 0.76/1.00 (assume a33 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (tptp.ordered_pair_predicate (tptp.f8 Z X)))))
% 0.76/1.00 (assume a34 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (tptp.member (tptp.f8 Z X) X))))
% 0.76/1.00 (assume a35 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (= Z (tptp.first (tptp.f8 Z X))))))
% 0.76/1.00 (assume a36 (forall ((Z $$unsorted) (X $$unsorted) (Xp $$unsorted)) (or (tptp.member Z (tptp.domain_of X)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Xp)) (not (tptp.member Xp X)) (not (= Z (tptp.first Xp))))))
% 0.76/1.00 (assume a37 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.ordered_pair_predicate Z))))
% 0.76/1.00 (assume a38 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.member (tptp.first Z) X))))
% 0.76/1.00 (assume a39 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.member (tptp.second Z) Y))))
% 0.76/1.00 (assume a40 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.cross_product X Y)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (tptp.member (tptp.first Z) X)) (not (tptp.member (tptp.second Z) Y)))))
% 0.76/1.00 (assume a41 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.converse X))) (tptp.ordered_pair_predicate Z))))
% 0.76/1.00 (assume a42 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.converse X))) (tptp.member (tptp.ordered_pair (tptp.second Z) (tptp.first Z)) X))))
% 0.76/1.00 (assume a43 (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.converse X)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (tptp.member (tptp.ordered_pair (tptp.second Z) (tptp.first Z)) X)))))
% 0.76/1.00 (assume a44 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f9 Z X)))))
% 0.76/1.00 (assume a45 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f10 Z X)))))
% 0.76/1.00 (assume a46 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f11 Z X)))))
% 0.76/1.00 (assume a47 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (= Z (tptp.ordered_pair (tptp.f9 Z X) (tptp.ordered_pair (tptp.f10 Z X) (tptp.f11 Z X)))))))
% 0.76/1.00 (assume a48 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.member (tptp.ordered_pair (tptp.f10 Z X) (tptp.ordered_pair (tptp.f11 Z X) (tptp.f9 Z X))) X))))
% 0.76/1.00 (assume a49 (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.rotate_right X)) (not (tptp.little_set Z)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (tptp.little_set W)) (not (= Z (tptp.ordered_pair U (tptp.ordered_pair V W)))) (not (tptp.member (tptp.ordered_pair V (tptp.ordered_pair W U)) X)))))
% 0.76/1.00 (assume a50 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f12 Z X)))))
% 0.76/1.00 (assume a51 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f13 Z X)))))
% 0.76/1.00 (assume a52 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f14 Z X)))))
% 0.76/1.00 (assume a53 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (= Z (tptp.ordered_pair (tptp.f12 Z X) (tptp.ordered_pair (tptp.f13 Z X) (tptp.f14 Z X)))))))
% 0.76/1.00 (assume a54 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.member (tptp.ordered_pair (tptp.f12 Z X) (tptp.ordered_pair (tptp.f14 Z X) (tptp.f13 Z X))) X))))
% 0.76/1.00 (assume a55 (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.flip_range_of X)) (not (tptp.little_set Z)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (tptp.little_set W)) (not (= Z (tptp.ordered_pair U (tptp.ordered_pair V W)))) (not (tptp.member (tptp.ordered_pair U (tptp.ordered_pair W V)) X)))))
% 0.76/1.00 (assume a56 (forall ((X $$unsorted)) (= (tptp.successor X) (tptp.union X (tptp.singleton_set X)))))
% 0.76/1.00 (assume a57 (forall ((Z $$unsorted)) (not (tptp.member Z tptp.empty_set))))
% 0.76/1.00 (assume a58 (forall ((Z $$unsorted)) (or (tptp.member Z tptp.universal_set) (not (tptp.little_set Z)))))
% 0.76/1.00 (assume a59 (tptp.little_set tptp.infinity))
% 0.76/1.00 (assume a60 (tptp.member tptp.empty_set tptp.infinity))
% 0.76/1.00 (assume a61 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.infinity)) (tptp.member (tptp.successor X) tptp.infinity))))
% 0.76/1.00 (assume a62 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.sigma X))) (tptp.member (tptp.f16 Z X) X))))
% 0.76/1.00 (assume a63 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.sigma X))) (tptp.member Z (tptp.f16 Z X)))))
% 0.76/1.00 (assume a64 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.sigma X)) (not (tptp.member Y X)) (not (tptp.member Z Y)))))
% 0.76/1.00 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.little_set U)) (tptp.little_set (tptp.sigma U)))))
% 0.76/1.00 (assume a66 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))))
% 0.76/1.00 (assume a67 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))))
% 0.76/1.00 (assume a68 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))))
% 0.76/1.00 (assume a69 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.proper_subset X Y)) (tptp.subset X Y))))
% 0.76/1.00 (assume a70 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.proper_subset X Y)) (not (= X Y)))))
% 0.76/1.00 (assume a71 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.proper_subset X Y) (not (tptp.subset X Y)) (= X Y))))
% 0.76/1.00 (assume a72 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.powerset X))) (tptp.subset Z X))))
% 0.76/1.00 (assume a73 (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.powerset X)) (not (tptp.little_set Z)) (not (tptp.subset Z X)))))
% 0.76/1.00 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.little_set U)) (tptp.little_set (tptp.powerset U)))))
% 0.76/1.00 (assume a75 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.relation Z)) (not (tptp.member X Z)) (tptp.ordered_pair_predicate X))))
% 0.76/1.00 (assume a76 (forall ((Z $$unsorted)) (or (tptp.relation Z) (tptp.member (tptp.f18 Z) Z))))
% 0.76/1.00 (assume a77 (forall ((Z $$unsorted)) (or (tptp.relation Z) (not (tptp.ordered_pair_predicate (tptp.f18 Z))))))
% 0.76/1.00 (assume a78 (forall ((X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.single_valued_set X)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (tptp.little_set W)) (not (tptp.member (tptp.ordered_pair U V) X)) (not (tptp.member (tptp.ordered_pair U W) X)) (= V W))))
% 0.76/1.00 (assume a79 (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f19 X)))))
% 0.76/1.00 (assume a80 (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f20 X)))))
% 0.76/1.00 (assume a81 (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f21 X)))))
% 0.76/1.00 (assume a82 (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.member (tptp.ordered_pair (tptp.f19 X) (tptp.f20 X)) X))))
% 0.76/1.00 (assume a83 (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.member (tptp.ordered_pair (tptp.f19 X) (tptp.f21 X)) X))))
% 0.76/1.00 (assume a84 (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (not (= (tptp.f20 X) (tptp.f21 X))))))
% 0.76/1.00 (assume a85 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.relation Xf))))
% 0.76/1.00 (assume a86 (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.single_valued_set Xf))))
% 0.76/1.00 (assume a87 (forall ((Xf $$unsorted)) (or (tptp.function Xf) (not (tptp.relation Xf)) (not (tptp.single_valued_set Xf)))))
% 0.76/1.00 (assume a88 (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.ordered_pair_predicate (tptp.f22 Z X Xf)))))
% 0.76/1.00 (assume a89 (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.member (tptp.f22 Z X Xf) Xf))))
% 0.76/1.00 (assume a90 (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.member (tptp.first (tptp.f22 Z X Xf)) X))))
% 0.76/1.00 (assume a91 (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (= (tptp.second (tptp.f22 Z X Xf)) Z))))
% 0.76/1.00 (assume a92 (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.image X Xf)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Y)) (not (tptp.member Y Xf)) (not (tptp.member (tptp.first Y) X)) (not (= (tptp.second Y) Z)))))
% 0.76/1.00 (assume a93 (forall ((X $$unsorted) (Xf $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.function Xf)) (tptp.little_set (tptp.image X Xf)))))
% 0.76/1.00 (assume a94 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.disjoint X Y)) (not (tptp.member U X)) (not (tptp.member U Y)))))
% 0.76/1.00 (assume a95 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.disjoint X Y) (tptp.member (tptp.f23 X Y) X))))
% 0.76/1.00 (assume a96 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.disjoint X Y) (tptp.member (tptp.f23 X Y) Y))))
% 0.76/1.00 (assume a97 (forall ((X $$unsorted)) (or (= X tptp.empty_set) (tptp.member (tptp.f24 X) X))))
% 0.76/1.00 (assume a98 (forall ((X $$unsorted)) (or (= X tptp.empty_set) (tptp.disjoint (tptp.f24 X) X))))
% 0.76/1.00 (assume a99 (tptp.function tptp.f25))
% 0.76/1.00 (assume a100 (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (= X tptp.empty_set) (tptp.member (tptp.f26 X) X))))
% 0.76/1.00 (assume a101 (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (= X tptp.empty_set) (tptp.member (tptp.ordered_pair X (tptp.f26 X)) tptp.f25))))
% 0.76/1.00 (assume a102 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (tptp.ordered_pair_predicate (tptp.f27 Z X)))))
% 0.76/1.00 (assume a103 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (tptp.member (tptp.f27 Z X) X))))
% 0.76/1.00 (assume a104 (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (= Z (tptp.second (tptp.f27 Z X))))))
% 0.76/1.00 (assume a105 (forall ((Z $$unsorted) (X $$unsorted) (Xp $$unsorted)) (or (tptp.member Z (tptp.range_of X)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Xp)) (not (tptp.member Xp X)) (not (= Z (tptp.second Xp))))))
% 0.76/1.00 (assume a106 (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.identity_relation)) (tptp.ordered_pair_predicate Z))))
% 0.76/1.00 (assume a107 (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.identity_relation)) (= (tptp.first Z) (tptp.second Z)))))
% 0.76/1.00 (assume a108 (forall ((Z $$unsorted)) (or (tptp.member Z tptp.identity_relation) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (= (tptp.first Z) (tptp.second Z))))))
% 0.76/1.00 (assume a109 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.restrict X Y) (tptp.intersection X (tptp.cross_product Y tptp.universal_set)))))
% 0.76/1.00 (assume a110 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one_function Xf)) (tptp.function Xf))))
% 0.76/1.00 (assume a111 (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one_function Xf)) (tptp.function (tptp.converse Xf)))))
% 0.76/1.00 (assume a112 (forall ((Xf $$unsorted)) (or (tptp.one_to_one_function Xf) (not (tptp.function Xf)) (not (tptp.function (tptp.converse Xf))))))
% 0.76/1.00 (assume a113 (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.ordered_pair_predicate (tptp.f28 Z Xf Y)))))
% 0.76/1.00 (assume a114 (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.member (tptp.f28 Z Xf Y) Xf))))
% 0.76/1.00 (assume a115 (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (= (tptp.first (tptp.f28 Z Xf Y)) Y))))
% 0.76/1.00 (assume a116 (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.member Z (tptp.second (tptp.f28 Z Xf Y))))))
% 0.76/1.00 (assume a117 (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.apply Xf Y)) (not (tptp.ordered_pair_predicate W)) (not (tptp.member W Xf)) (not (= (tptp.first W) Y)) (not (tptp.member Z (tptp.second W))))))
% 0.76/1.00 (assume a118 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.apply_to_two_arguments Xf X Y) (tptp.apply Xf (tptp.ordered_pair X Y)))))
% 0.76/1.00 (assume a119 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.function Xf))))
% 0.76/1.00 (assume a120 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (= (tptp.domain_of Xf) X))))
% 0.76/1.00 (assume a121 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.subset (tptp.range_of Xf) Y))))
% 0.76/1.00 (assume a122 (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.maps Xf X Y) (not (tptp.function Xf)) (not (= (tptp.domain_of Xf) X)) (not (tptp.subset (tptp.range_of Xf) Y)))))
% 0.76/1.00 (assume a123 (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.little_set Xs))))
% 0.76/1.00 (assume a124 (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.little_set Xf))))
% 0.76/1.00 (assume a125 (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.maps Xf (tptp.cross_product Xs Xs) Xs))))
% 0.76/1.00 (assume a126 (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.closed Xs Xf) (not (tptp.little_set Xs)) (not (tptp.little_set Xf)) (not (tptp.maps Xf (tptp.cross_product Xs Xs) Xs)))))
% 0.76/1.00 (assume a127 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f29 Z Xf Xg)))))
% 0.76/1.00 (assume a128 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f30 Z Xf Xg)))))
% 0.76/1.00 (assume a129 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f31 Z Xf Xg)))))
% 0.76/1.00 (assume a130 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (= Z (tptp.ordered_pair (tptp.f29 Z Xf Xg) (tptp.f30 Z Xf Xg))))))
% 0.76/1.00 (assume a131 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.member (tptp.ordered_pair (tptp.f29 Z Xf Xg) (tptp.f31 Z Xf Xg)) Xf))))
% 0.76/1.00 (assume a132 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.member (tptp.ordered_pair (tptp.f31 Z Xf Xg) (tptp.f30 Z Xf Xg)) Xg))))
% 0.76/1.00 (assume a133 (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted) (X $$unsorted) (Y $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.compose Xf Xg)) (not (tptp.little_set Z)) (not (tptp.little_set X)) (not (tptp.little_set Y)) (not (tptp.little_set W)) (not (= Z (tptp.ordered_pair X Y))) (not (tptp.member (tptp.ordered_pair X W) Xf)) (not (tptp.member (tptp.ordered_pair W Y) Xg)))))
% 0.76/1.00 (assume a134 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.closed Xs1 Xf1))))
% 0.76/1.00 (assume a135 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.closed Xs2 Xf2))))
% 0.76/1.00 (assume a136 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.maps Xh Xs1 Xs2))))
% 0.76/1.00 (assume a137 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (not (tptp.member X Xs1)) (not (tptp.member Y Xs1)) (= (tptp.apply Xh (tptp.apply_to_two_arguments Xf1 X Y)) (tptp.apply_to_two_arguments Xf2 (tptp.apply Xh X) (tptp.apply Xh Y))))))
% 0.76/1.00 (assume a138 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2) (not (tptp.closed Xs1 Xf1)) (not (tptp.closed Xs2 Xf2)) (not (tptp.maps Xh Xs1 Xs2)) (tptp.member (tptp.f32 Xh Xs1 Xf1 Xs2 Xf2) Xs1))))
% 0.76/1.00 (assume a139 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2) (not (tptp.closed Xs1 Xf1)) (not (tptp.closed Xs2 Xf2)) (not (tptp.maps Xh Xs1 Xs2)) (tptp.member (tptp.f33 Xh Xs1 Xf1 Xs2 Xf2) Xs1))))
% 0.76/1.00 (assume a140 (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2) (not (tptp.closed Xs1 Xf1)) (not (tptp.closed Xs2 Xf2)) (not (tptp.maps Xh Xs1 Xs2)) (not (= (tptp.apply Xh (tptp.apply_to_two_arguments Xf1 (tptp.f32 Xh Xs1 Xf1 Xs2 Xf2) (tptp.f33 Xh Xs1 Xf1 Xs2 Xf2))) (tptp.apply_to_two_arguments Xf2 (tptp.apply Xh (tptp.f32 Xh Xs1 Xf1 Xs2 Xf2)) (tptp.apply Xh (tptp.f33 Xh Xs1 Xf1 Xs2 Xf2))))))))
% 0.76/1.00 (assume a141 (forall ((X $$unsorted) (U $$unsorted) (Y $$unsorted) (V $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set U)) (not (= (tptp.ordered_pair X Y) (tptp.ordered_pair U V))) (= X U))))
% 0.76/1.00 (assume a142 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (not (= (tptp.non_ordered_pair Z X) (tptp.non_ordered_pair Z Y))) (= X Y))))
% 0.76/1.00 (assume a143 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (= (tptp.ordered_pair X Y) (tptp.ordered_pair U V))) (= Y V))))
% 0.76/1.00 (assume a144 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.subset Y X)) (= X Y))))
% 0.76/1.00 (assume a145 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (= (tptp.first (tptp.ordered_pair X Y)) X))))
% 0.76/1.00 (assume a146 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (= (tptp.second (tptp.ordered_pair X Y)) Y))))
% 0.76/1.00 (assume a147 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.first X)))))
% 0.76/1.00 (assume a148 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.second X)))))
% 0.76/1.00 (assume a149 (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (tptp.member X (tptp.singleton_set X)))))
% 0.76/1.00 (assume a150 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.little_set (tptp.ordered_pair X Y))))
% 0.76/1.00 (assume a151 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set X))))
% 0.76/1.00 (assume a152 (tptp.subset tptp.a tptp.b))
% 0.76/1.00 (assume a153 (tptp.subset tptp.b tptp.c))
% 0.76/1.00 (assume a154 (not (tptp.subset tptp.a tptp.c)))
% 0.76/1.00 (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) :rule implies_neg1)
% 0.76/1.00 (anchor :step t2)
% 0.76/1.00 (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))))
% 0.76/1.00 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.c) (:= U (tptp.f17 tptp.a tptp.c))))
% 0.76/1.00 (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule or :premises (t2.t1))
% 0.76/1.00 (step t2.t3 (cl (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule resolution :premises (t2.t2 t2.a0))
% 0.76/1.00 (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule subproof :discharge (t2.a0))
% 0.76/1.00 (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule resolution :premises (t1 t2))
% 0.76/1.00 (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) (not (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule implies_neg2)
% 0.76/1.00 (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule resolution :premises (t3 t4))
% 0.76/1.00 (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule contraction :premises (t5))
% 0.76/1.00 (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule implies :premises (t6))
% 0.76/1.00 (step t8 (cl (not (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)) :rule or_pos)
% 0.76/1.00 (step t9 (cl (not (tptp.subset tptp.b tptp.c)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (not (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule reordering :premises (t8))
% 0.76/1.00 (step t10 (cl (not (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule or_pos)
% 0.76/1.00 (step t11 (cl (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)) (not (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))))) :rule reordering :premises (t10))
% 0.76/1.00 (step t12 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y))))) :rule implies_neg1)
% 0.76/1.00 (anchor :step t13)
% 0.76/1.00 (assume t13.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))))
% 0.76/1.00 (step t13.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y))))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.c)))
% 0.76/1.00 (step t13.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y))))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule or :premises (t13.t1))
% 0.76/1.00 (step t13.t3 (cl (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule resolution :premises (t13.t2 t13.a0))
% 0.76/1.00 (step t13 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y))))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule subproof :discharge (t13.a0))
% 0.76/1.00 (step t14 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule resolution :premises (t12 t13))
% 0.76/1.00 (step t15 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) (not (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))))) :rule implies_neg2)
% 0.76/1.00 (step t16 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))))) :rule resolution :premises (t14 t15))
% 0.76/1.00 (step t17 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))))) :rule contraction :premises (t16))
% 0.76/1.00 (step t18 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y))))) (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule implies :premises (t17))
% 0.76/1.00 (step t19 (cl (or (tptp.subset tptp.a tptp.c) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule resolution :premises (t18 a68))
% 0.76/1.00 (step t20 (cl (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c))) :rule resolution :premises (t11 a154 t19))
% 0.76/1.00 (step t21 (cl (not (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) :rule or_pos)
% 0.76/1.00 (step t22 (cl (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b) (not (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)))) :rule reordering :premises (t21))
% 0.76/1.00 (step t23 (cl (not (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) :rule or_pos)
% 0.76/1.00 (step t24 (cl (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a) (not (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)))) :rule reordering :premises (t23))
% 0.76/1.00 (step t25 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X)))) :rule implies_neg1)
% 0.76/1.00 (anchor :step t26)
% 0.76/1.00 (assume t26.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))))
% 0.76/1.00 (step t26.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X)))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.c)))
% 0.76/1.00 (step t26.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X)))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) :rule or :premises (t26.t1))
% 0.76/1.00 (step t26.t3 (cl (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) :rule resolution :premises (t26.t2 t26.a0))
% 0.76/1.00 (step t26 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X)))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) :rule subproof :discharge (t26.a0))
% 0.76/1.00 (step t27 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) :rule resolution :premises (t25 t26))
% 0.76/1.00 (step t28 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) (not (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)))) :rule implies_neg2)
% 0.76/1.00 (step t29 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)))) :rule resolution :premises (t27 t28))
% 0.76/1.00 (step t30 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)))) :rule contraction :premises (t29))
% 0.76/1.00 (step t31 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X)))) (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) :rule implies :premises (t30))
% 0.76/1.00 (step t32 (cl (or (tptp.subset tptp.a tptp.c) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a))) :rule resolution :premises (t31 a67))
% 0.76/1.00 (step t33 (cl (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) :rule resolution :premises (t24 a154 t32))
% 0.76/1.00 (step t34 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) :rule implies_neg1)
% 0.76/1.00 (anchor :step t35)
% 0.76/1.00 (assume t35.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))))
% 0.76/1.00 (step t35.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b) (:= U (tptp.f17 tptp.a tptp.c))))
% 0.76/1.00 (step t35.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) :rule or :premises (t35.t1))
% 0.76/1.00 (step t35.t3 (cl (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) :rule resolution :premises (t35.t2 t35.a0))
% 0.76/1.00 (step t35 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) :rule subproof :discharge (t35.a0))
% 0.76/1.00 (step t36 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) :rule resolution :premises (t34 t35))
% 0.76/1.00 (step t37 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) (not (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)))) :rule implies_neg2)
% 0.76/1.00 (step t38 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)))) :rule resolution :premises (t36 t37))
% 0.76/1.00 (step t39 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)))) :rule contraction :premises (t38))
% 0.76/1.00 (step t40 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y)))) (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) :rule implies :premises (t39))
% 0.76/1.00 (step t41 (cl (or (not (tptp.subset tptp.a tptp.b)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.a)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b))) :rule resolution :premises (t40 a66))
% 0.76/1.00 (step t42 (cl (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) :rule resolution :premises (t22 a152 t33 t41))
% 0.76/1.00 (step t43 (cl (not (or (not (tptp.subset tptp.b tptp.c)) (not (tptp.member (tptp.f17 tptp.a tptp.c) tptp.b)) (tptp.member (tptp.f17 tptp.a tptp.c) tptp.c)))) :rule resolution :premises (t9 a153 t20 t42))
% 0.76/1.00 (step t44 (cl) :rule resolution :premises (t7 t43 a66))
% 0.76/1.00
% 0.76/1.00 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.mg9HmMMmw7/cvc5---1.0.5_10234.smt2
% 0.83/1.01 % cvc5---1.0.5 exiting
% 0.83/1.01 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------