%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET103-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n017.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 : Thu Aug 31 14:37:43 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : SET103-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.35  % Computer : n017.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit   : 300
% 0.16/0.35  % WCLimit    : 300
% 0.16/0.35  % DateTime   : Sat Aug 26 15:49:56 EDT 2023
% 0.16/0.36  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.baJOUcSuWe/cvc5---1.0.5_29107.p...
% 0.21/0.53  ------- get file name : TPTP file name is SET103-7
% 0.21/0.53  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_29107.smt2...
% 0.21/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.62  % SZS status Unsatisfiable for SET103-7
% 0.21/0.62  % SZS output start Proof for SET103-7
% 0.21/0.63  (
% 0.21/0.63  (let ((_let_1 (tptp.member tptp.y tptp.universal_class))) (let ((_let_2 (not _let_1))) (let ((_let_3 (tptp.ordered_pair tptp.x tptp.y))) (let ((_let_4 (tptp.singleton tptp.x))) (let ((_let_5 (= (tptp.unordered_pair _let_4 (tptp.unordered_pair tptp.x tptp.null_class)) _let_3))) (let ((_let_6 (not _let_5))) (let ((_let_7 (forall ((X $$unsorted)) (or (tptp.member X tptp.universal_class) (= (tptp.singleton X) tptp.null_class))))) (let ((_let_8 (tptp.cross_product tptp.universal_class tptp.universal_class))) (let ((_let_9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair (tptp.singleton X) (tptp.unordered_pair X (tptp.singleton Y))) (tptp.ordered_pair X Y))))) (let ((_let_10 (tptp.singleton tptp.y))) (let ((_let_11 (= _let_3 (tptp.unordered_pair _let_4 (tptp.unordered_pair tptp.x _let_10))))) (let ((_let_12 (= tptp.null_class _let_10))) (let ((_let_13 (_let_9))) (let ((_let_14 (ASSUME :args _let_13))) (let ((_let_15 (or _let_1 _let_12))) (let ((_let_16 (forall ((X $$unsorted)) (or (tptp.member X tptp.universal_class) (= tptp.null_class (tptp.singleton X)))))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (and _let_11 _let_12))) (let ((_let_19 (_let_11 _let_12))) (let ((_let_20 (ASSUME :args (_let_11)))) (let ((_let_21 (APPLY_UF tptp.unordered_pair))) (let ((_let_22 (ASSUME :args (_let_12)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_18)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_20 _let_22) (SCOPE (TRANS (CONG (REFL :args (_let_4)) (CONG (REFL :args (tptp.x)) (SYMM (SYMM _let_22)) :args _let_21) :args _let_21) (SYMM _let_20)) :args _let_19)) :args _let_19)) :args (true _let_18)) :args ((or _let_5 (not _let_11) (not _let_12)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_15)) :args ((or _let_1 _let_12 (not _let_15)))) (ASSUME :args (_let_2)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (tptp.y QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.member X tptp.universal_class) true))))) :args (_let_16))) _let_17 :args (_let_15 false _let_16)) :args (_let_12 true _let_1 false _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_14 :args (tptp.x tptp.y QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.ordered_pair X Y)))) :args _let_13))) _let_14 :args (_let_11 false _let_9)) (ASSUME :args (_let_6)) :args (false false _let_12 false _let_11 true _let_5)) :args ((forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.member U X)) (tptp.member U Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member (tptp.not_subclass_element X Y) X) (tptp.subclass X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (tptp.subclass X Y))) (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= X Y)) (tptp.subclass Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.subclass Y X)) (= X Y))) (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.unordered_pair X Y))) (= U X) (= U Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.unordered_pair X Y)))) (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (tptp.member Y (tptp.unordered_pair X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X Y) tptp.universal_class)) (forall ((X $$unsorted)) (= (tptp.unordered_pair X X) (tptp.singleton X))) _let_9 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member U X))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member V Y))) (forall ((U $$unsorted) (X $$unsorted) (V $$unsorted) (Y $$unsorted)) (or (not (tptp.member U X)) (not (tptp.member V Y)) (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (= (tptp.ordered_pair (tptp.first Z) (tptp.second Z)) Z))) (tptp.subclass tptp.element_relation _let_8) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.element_relation)) (tptp.member X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.ordered_pair X Y))) (or (not (tptp.member _let_1 (tptp.cross_product tptp.universal_class tptp.universal_class))) (not (tptp.member X Y)) (tptp.member _let_1 tptp.element_relation)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z Y))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z X)) (not (tptp.member Z Y)) (tptp.member Z (tptp.intersection X Y)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (tptp.member Z (tptp.complement X)) (tptp.member Z X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))) (tptp.union X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.intersection (tptp.complement (tptp.intersection X Y)) (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y)))) (tptp.symmetric_difference X Y))) (forall ((Xr $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.intersection Xr (tptp.cross_product X Y)) (tptp.restrict Xr X Y))) (forall ((X $$unsorted) (Y $$unsorted) (Xr $$unsorted)) (= (tptp.intersection (tptp.cross_product X Y) Xr) (tptp.restrict Xr X Y))) (forall ((X $$unsorted) (Z $$unsorted)) (or (not (= (tptp.restrict X (tptp.singleton Z) tptp.universal_class) tptp.null_class)) (not (tptp.member Z (tptp.domain_of X))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z tptp.universal_class)) (= (tptp.restrict X (tptp.singleton Z) tptp.universal_class) tptp.null_class) (tptp.member Z (tptp.domain_of X)))) (forall ((X $$unsorted)) (tptp.subclass (tptp.rotate X) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.rotate X))) (tptp.member (tptp.ordered_pair (tptp.ordered_pair V W) U) X))) (forall ((V $$unsorted) (W $$unsorted) (U $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.ordered_pair (tptp.ordered_pair U V) W))) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair V W) U) X)) (not (tptp.member _let_1 (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (tptp.member _let_1 (tptp.rotate X))))) (forall ((X $$unsorted)) (tptp.subclass (tptp.flip X) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair U V) W) (tptp.flip X))) (tptp.member (tptp.ordered_pair (tptp.ordered_pair V U) W) X))) (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.ordered_pair (tptp.ordered_pair U V) W))) (or (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair V U) W) X)) (not (tptp.member _let_1 (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (tptp.member _let_1 (tptp.flip X))))) (forall ((Y $$unsorted)) (= (tptp.domain_of (tptp.flip (tptp.cross_product Y tptp.universal_class))) (tptp.inverse Y))) (forall ((Z $$unsorted)) (= (tptp.domain_of (tptp.inverse Z)) (tptp.range_of Z))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.first (tptp.not_subclass_element (tptp.restrict Z X (tptp.singleton Y)) tptp.null_class)) (tptp.domain Z X Y))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.second (tptp.not_subclass_element (tptp.restrict Z (tptp.singleton X) Y) tptp.null_class)) (tptp.range Z X Y))) (forall ((Xr $$unsorted) (X $$unsorted)) (= (tptp.range_of (tptp.restrict Xr X tptp.universal_class)) (tptp.image Xr X))) (forall ((X $$unsorted)) (= (tptp.union X (tptp.singleton X)) (tptp.successor X))) (tptp.subclass tptp.successor_relation _let_8) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) tptp.successor_relation)) (= (tptp.successor X) Y))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.ordered_pair X Y))) (or (not (= (tptp.successor X) Y)) (not (tptp.member _let_1 (tptp.cross_product tptp.universal_class tptp.universal_class))) (tptp.member _let_1 tptp.successor_relation)))) (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.member tptp.null_class X))) (forall ((X $$unsorted)) (or (not (tptp.inductive X)) (tptp.subclass (tptp.image tptp.successor_relation X) X))) (forall ((X $$unsorted)) (or (not (tptp.member tptp.null_class X)) (not (tptp.subclass (tptp.image tptp.successor_relation X) X)) (tptp.inductive X))) (tptp.inductive tptp.omega) (forall ((Y $$unsorted)) (or (not (tptp.inductive Y)) (tptp.subclass tptp.omega Y))) (tptp.member tptp.omega tptp.universal_class) (forall ((X $$unsorted)) (= (tptp.domain_of (tptp.restrict tptp.element_relation tptp.universal_class X)) (tptp.sum_class X))) (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.sum_class X) tptp.universal_class))) (forall ((X $$unsorted)) (= (tptp.complement (tptp.image tptp.element_relation (tptp.complement X))) (tptp.power_class X))) (forall ((U $$unsorted)) (or (not (tptp.member U tptp.universal_class)) (tptp.member (tptp.power_class U) tptp.universal_class))) (forall ((Yr $$unsorted) (Xr $$unsorted)) (tptp.subclass (tptp.compose Yr Xr) (tptp.cross_product tptp.universal_class tptp.universal_class))) (forall ((Y $$unsorted) (Z $$unsorted) (Yr $$unsorted) (Xr $$unsorted)) (or (not (tptp.member (tptp.ordered_pair Y Z) (tptp.compose Yr Xr))) (tptp.member Z (tptp.image Yr (tptp.image Xr (tptp.singleton Y)))))) (forall ((Z $$unsorted) (Yr $$unsorted) (Xr $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.ordered_pair Y Z))) (or (not (tptp.member Z (tptp.image Yr (tptp.image Xr (tptp.singleton Y))))) (not (tptp.member _let_1 (tptp.cross_product tptp.universal_class tptp.universal_class))) (tptp.member _let_1 (tptp.compose Yr Xr))))) (forall ((X $$unsorted)) (or (not (tptp.single_valued_class X)) (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation))) (forall ((X $$unsorted)) (or (not (tptp.subclass (tptp.compose X (tptp.inverse X)) tptp.identity_relation)) (tptp.single_valued_class X))) (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass Xf (tptp.cross_product tptp.universal_class tptp.universal_class)))) (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.subclass (tptp.compose Xf (tptp.inverse Xf)) tptp.identity_relation))) (forall ((Xf $$unsorted)) (or (not (tptp.subclass Xf (tptp.cross_product tptp.universal_class tptp.universal_class))) (not (tptp.subclass (tptp.compose Xf (tptp.inverse Xf)) tptp.identity_relation)) (tptp.function Xf))) (forall ((Xf $$unsorted) (X $$unsorted)) (or (not (tptp.function Xf)) (not (tptp.member X tptp.universal_class)) (tptp.member (tptp.image Xf X) tptp.universal_class))) (forall ((X $$unsorted)) (or (= X tptp.null_class) (tptp.member (tptp.regular X) X))) (forall ((X $$unsorted)) (or (= X tptp.null_class) (= (tptp.intersection X (tptp.regular X)) tptp.null_class))) (forall ((Xf $$unsorted) (Y $$unsorted)) (= (tptp.sum_class (tptp.image Xf (tptp.singleton Y))) (tptp.apply Xf Y))) (tptp.function tptp.choice) (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (= Y tptp.null_class) (tptp.member (tptp.apply tptp.choice Y) Y))) (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function Xf))) (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one Xf)) (tptp.function (tptp.inverse Xf)))) (forall ((Xf $$unsorted)) (or (not (tptp.function (tptp.inverse Xf))) (not (tptp.function Xf)) (tptp.one_to_one Xf))) (= (tptp.intersection _let_8 (tptp.intersection _let_8 (tptp.complement (tptp.compose (tptp.complement tptp.element_relation) (tptp.inverse tptp.element_relation))))) tptp.subset_relation) (= (tptp.intersection (tptp.inverse tptp.subset_relation) tptp.subset_relation) tptp.identity_relation) (forall ((Xr $$unsorted)) (= (tptp.complement (tptp.domain_of (tptp.intersection Xr tptp.identity_relation))) (tptp.diagonalise Xr))) (forall ((X $$unsorted)) (= (tptp.intersection (tptp.domain_of X) (tptp.diagonalise (tptp.compose (tptp.inverse tptp.element_relation) X))) (tptp.cantor X))) (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.function Xf))) (forall ((Xf $$unsorted)) (let ((_let_1 (tptp.domain_of Xf))) (let ((_let_2 (tptp.domain_of _let_1))) (or (not (tptp.operation Xf)) (= (tptp.cross_product _let_2 _let_2) _let_1))))) (forall ((Xf $$unsorted)) (or (not (tptp.operation Xf)) (tptp.subclass (tptp.range_of Xf) (tptp.domain_of (tptp.domain_of Xf))))) (forall ((Xf $$unsorted)) (let ((_let_1 (tptp.domain_of Xf))) (let ((_let_2 (tptp.domain_of _let_1))) (or (not (tptp.function Xf)) (not (= (tptp.cross_product _let_2 _let_2) _let_1)) (not (tptp.subclass (tptp.range_of Xf) _let_2)) (tptp.operation Xf))))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (tptp.function Xh))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (= (tptp.domain_of (tptp.domain_of Xf1)) (tptp.domain_of Xh)))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.compatible Xh Xf1 Xf2)) (tptp.subclass (tptp.range_of Xh) (tptp.domain_of (tptp.domain_of Xf2))))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.function Xh)) (not (= (tptp.domain_of (tptp.domain_of Xf1)) (tptp.domain_of Xh))) (not (tptp.subclass (tptp.range_of Xh) (tptp.domain_of (tptp.domain_of Xf2)))) (tptp.compatible Xh Xf1 Xf2))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf1))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.operation Xf2))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (tptp.compatible Xh Xf1 Xf2))) (forall ((Xh $$unsorted) (Xf1 $$unsorted) (Xf2 $$unsorted) (X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.ordered_pair X Y))) (or (not (tptp.homomorphism Xh Xf1 Xf2)) (not (tptp.member _let_1 (tptp.domain_of Xf1))) (= (tptp.apply Xf2 (tptp.ordered_pair (tptp.apply Xh X) (tptp.apply Xh Y))) (tptp.apply Xh (tptp.apply Xf1 _let_1)))))) (forall ((Xf1 $$unsorted) (Xf2 $$unsorted) (Xh $$unsorted)) (or (not (tptp.operation Xf1)) (not (tptp.operation Xf2)) (not (tptp.compatible Xh Xf1 Xf2)) (tptp.member (tptp.ordered_pair (tptp.not_homomorphism1 Xh Xf1 Xf2) (tptp.not_homomorphism2 Xh Xf1 Xf2)) (tptp.domain_of Xf1)) (tptp.homomorphism Xh Xf1 Xf2))) (forall ((Xf1 $$unsorted) (Xf2 $$unsorted) (Xh $$unsorted)) (let ((_let_1 (tptp.not_homomorphism2 Xh Xf1 Xf2))) (let ((_let_2 (tptp.not_homomorphism1 Xh Xf1 Xf2))) (or (not (tptp.operation Xf1)) (not (tptp.operation Xf2)) (not (tptp.compatible Xh Xf1 Xf2)) (not (= (tptp.apply Xf2 (tptp.ordered_pair (tptp.apply Xh _let_2) (tptp.apply Xh _let_1))) (tptp.apply Xh (tptp.apply Xf1 (tptp.ordered_pair _let_2 _let_1))))) (tptp.homomorphism Xh Xf1 Xf2))))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product U V))) (tptp.member X (tptp.unordered_pair X Y)))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product U V))) (tptp.member Y (tptp.unordered_pair X Y)))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member U tptp.universal_class))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y))) (tptp.member V tptp.universal_class))) (forall ((X $$unsorted)) (tptp.subclass X X)) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.subclass X Y)) (not (tptp.subclass Y Z)) (tptp.subclass X Z))) (forall ((X $$unsorted) (Y $$unsorted)) (or (= X Y) (tptp.member (tptp.not_subclass_element X Y) X) (tptp.member (tptp.not_subclass_element Y X) Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (= X Y) (tptp.member (tptp.not_subclass_element Y X) Y))) (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element Y X) X)) (= X Y) (tptp.member (tptp.not_subclass_element X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member (tptp.not_subclass_element X Y) Y)) (not (tptp.member (tptp.not_subclass_element Y X) X)) (= X Y))) (forall ((Y $$unsorted) (X $$unsorted)) (not (tptp.member Y (tptp.intersection (tptp.complement X) X)))) (forall ((Z $$unsorted)) (not (tptp.member Z tptp.null_class))) (forall ((X $$unsorted)) (tptp.subclass tptp.null_class X)) (forall ((X $$unsorted)) (or (not (tptp.subclass X tptp.null_class)) (= X tptp.null_class))) (forall ((Z $$unsorted)) (or (= Z tptp.null_class) (tptp.member (tptp.not_subclass_element Z tptp.null_class) Z))) (tptp.member tptp.null_class tptp.universal_class) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair X Y) (tptp.unordered_pair Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.subclass (tptp.singleton X) (tptp.unordered_pair X Y))) (forall ((Y $$unsorted) (X $$unsorted)) (tptp.subclass (tptp.singleton Y) (tptp.unordered_pair X Y))) (forall ((Y $$unsorted) (X $$unsorted)) (or (tptp.member Y tptp.universal_class) (= (tptp.unordered_pair X Y) (tptp.singleton X)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.member X tptp.universal_class) (= (tptp.unordered_pair X Y) (tptp.singleton Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (= (tptp.unordered_pair X Y) tptp.null_class) (tptp.member X tptp.universal_class) (tptp.member Y tptp.universal_class))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.unordered_pair X Y) (tptp.unordered_pair X Z))) (not (tptp.member (tptp.ordered_pair Y Z) (tptp.cross_product tptp.universal_class tptp.universal_class))) (= Y Z))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (not (= (tptp.unordered_pair X Z) (tptp.unordered_pair Y Z))) (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product tptp.universal_class tptp.universal_class))) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (not (= (tptp.unordered_pair X Y) tptp.null_class)))) (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (not (= (tptp.unordered_pair X Y) tptp.null_class)))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member (tptp.ordered_pair X Y) (tptp.cross_product U V))) (not (= (tptp.unordered_pair X Y) tptp.null_class)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Z)) (not (tptp.member Y Z)) (tptp.subclass (tptp.unordered_pair X Y) Z))) (forall ((X $$unsorted)) (tptp.member (tptp.singleton X) tptp.universal_class)) (forall ((Y $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.singleton Y))) (tptp.member _let_1 (tptp.unordered_pair X _let_1)))) (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (tptp.member X (tptp.singleton X)))) (forall ((X $$unsorted)) (or (not (tptp.member X tptp.universal_class)) (not (= (tptp.singleton X) tptp.null_class)))) (tptp.member tptp.null_class (tptp.singleton tptp.null_class)) (forall ((Y $$unsorted) (X $$unsorted)) (or (not (tptp.member Y (tptp.singleton X))) (= Y X))) _let_7 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member X tptp.universal_class)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.singleton X) (tptp.singleton Y))) (not (tptp.member Y tptp.universal_class)) (= X Y))) (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (= (tptp.unordered_pair Y Z) (tptp.singleton X))) (not (tptp.member X tptp.universal_class)) (= X Y) (= X Z))) (forall ((Y $$unsorted)) (or (not (tptp.member Y tptp.universal_class)) (tptp.member (tptp.member_of (tptp.singleton Y)) tptp.universal_class))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.singleton Y))) (or (not (tptp.member Y tptp.universal_class)) (= (tptp.singleton (tptp.member_of _let_1)) _let_1)))) (forall ((X $$unsorted)) (let ((_let_1 (tptp.member_of X))) (or (tptp.member _let_1 tptp.universal_class) (= _let_1 X)))) (forall ((X $$unsorted)) (let ((_let_1 (tptp.member_of X))) (or (= (tptp.singleton _let_1) X) (= _let_1 X)))) (forall ((U $$unsorted)) (or (not (tptp.member U tptp.universal_class)) (= (tptp.member_of (tptp.singleton U)) U))) (forall ((X $$unsorted)) (or (tptp.member (tptp.member_of1 X) tptp.universal_class) (= (tptp.member_of X) X))) (forall ((X $$unsorted)) (or (= (tptp.singleton (tptp.member_of1 X)) X) (= (tptp.member_of X) X))) (forall ((X $$unsorted)) (or (not (= (tptp.singleton (tptp.member_of X)) X)) (tptp.member X tptp.universal_class))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.member_of X))) (or (not (= (tptp.singleton _let_1) X)) (not (tptp.member Y X)) (= _let_1 Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Y)) (tptp.subclass (tptp.singleton X) Y))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.singleton Y))) (or (not (tptp.subclass X _let_1)) (= X tptp.null_class) (= _let_1 X)))) (forall ((X $$unsorted)) (let ((_let_1 (tptp.singleton (tptp.not_subclass_element X tptp.null_class)))) (let ((_let_2 (tptp.intersection (tptp.complement _let_1) X))) (or (tptp.member (tptp.not_subclass_element _let_2 tptp.null_class) _let_2) (= _let_1 X) (= X tptp.null_class))))) (forall ((X $$unsorted)) (let ((_let_1 (tptp.singleton (tptp.not_subclass_element X tptp.null_class)))) (or (tptp.member (tptp.not_subclass_element (tptp.intersection (tptp.complement _let_1) X) tptp.null_class) X) (= _let_1 X) (= X tptp.null_class)))) (forall ((X $$unsorted)) (let ((_let_1 (tptp.not_subclass_element X tptp.null_class))) (let ((_let_2 (tptp.singleton _let_1))) (or (not (= (tptp.not_subclass_element (tptp.intersection (tptp.complement _let_2) X) tptp.null_class) _let_1)) (= _let_2 X) (= X tptp.null_class))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.unordered_pair X Y) (tptp.union (tptp.singleton X) (tptp.singleton Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.ordered_pair X Y) tptp.universal_class)) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.singleton X) (tptp.ordered_pair X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X (tptp.singleton Y)) (tptp.ordered_pair X Y))) _let_6 _let_2)))))))))))))))))))))))))
% 0.21/0.63  )
% 0.21/0.63  % SZS output end Proof for SET103-7
% 0.21/0.63  % cvc5---1.0.5 exiting
% 0.21/0.64  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------