%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET023-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n010.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:36:54 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET023-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : do_cvc5 %s %d
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 14:42:50 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.48  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.8zt1VtnigT/cvc5---1.0.5_9767.p...
% 0.20/0.50  ------- get file name : TPTP file name is SET023-3
% 0.20/0.50  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_9767.smt2...
% 0.20/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.59  % SZS status Unsatisfiable for SET023-3
% 0.20/0.59  % SZS output start Proof for SET023-3
% 0.20/0.60  (
% 0.20/0.60  (let ((_let_1 (tptp.little_set (tptp.second tptp.a)))) (let ((_let_2 (not _let_1))) (let ((_let_3 (tptp.ordered_pair_predicate tptp.a))) (let ((_let_4 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (= (tptp.second (tptp.ordered_pair X Y)) Y))))) (let ((_let_5 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (= X (tptp.ordered_pair (tptp.f2 X) (tptp.f3 X))))))) (let ((_let_6 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.f3 X)))))) (let ((_let_7 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.f2 X)))))) (let ((_let_8 (tptp.f3 tptp.a))) (let ((_let_9 (tptp.little_set _let_8))) (let ((_let_10 (tptp.f2 tptp.a))) (let ((_let_11 (tptp.ordered_pair _let_10 _let_8))) (let ((_let_12 (= tptp.a _let_11))) (let ((_let_13 (= _let_8 (tptp.second _let_11)))) (let ((_let_14 (ASSUME :args (_let_2)))) (let ((_let_15 (not _let_3))) (let ((_let_16 (or _let_15 _let_9))) (let ((_let_17 (_let_6))) (let ((_let_18 (ASSUME :args _let_17))) (let ((_let_19 (ASSUME :args (_let_3)))) (let ((_let_20 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_16)) :args ((or _let_15 _let_9 (not _let_16)))) _let_19 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_18 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.ordered_pair_predicate X) false))))) :args _let_17)) _let_18 :args (_let_16 false _let_6)) :args (_let_9 false _let_3 false _let_16)))) (let ((_let_21 (or _let_15 _let_12))) (let ((_let_22 (_let_5))) (let ((_let_23 (ASSUME :args _let_22))) (let ((_let_24 (not _let_9))) (let ((_let_25 (tptp.little_set _let_10))) (let ((_let_26 (not _let_25))) (let ((_let_27 (or _let_26 _let_24 _let_13))) (let ((_let_28 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (= Y (tptp.second (tptp.ordered_pair X Y))))))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_30 (or _let_15 _let_25))) (let ((_let_31 (_let_7))) (let ((_let_32 (ASSUME :args _let_31))) (let ((_let_33 (ASSUME :args (_let_12)))) (let ((_let_34 (ASSUME :args (_let_13)))) (let ((_let_35 (ASSUME :args (_let_9)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_14 _let_33 _let_34 _let_35) :args (_let_2 _let_9 _let_12 _let_13)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO _let_35)) (CONG (TRANS (SYMM (SYMM _let_34)) (CONG (SYMM _let_33) :args (APPLY_UF tptp.second))) :args (APPLY_UF tptp.little_set)) (FALSE_INTRO _let_14))) :args (_let_2 _let_12 _let_13 _let_9)) :args ((not (and _let_2 _let_9 _let_12 _let_13)) SB_LITERAL))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args (_let_24)) (REFL :args ((not _let_12))) (REFL :args ((not _let_13))) :args (or))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_27)) :args ((or _let_26 _let_24 _let_13 (not _let_27)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_30)) :args ((or _let_15 _let_25 (not _let_30)))) _let_19 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_32 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.ordered_pair_predicate X) false))))) :args _let_31)) _let_32 :args (_let_30 false _let_7)) :args (_let_25 false _let_3 false _let_30)) _let_20 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_29 :args (_let_10 _let_8 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.ordered_pair X Y)))) :args (_let_28))) _let_29 :args (_let_27 false _let_28)) :args (_let_13 false _let_25 false _let_9 false _let_27)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_21)) :args ((or _let_15 _let_12 (not _let_21)))) _let_19 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.ordered_pair_predicate X) false))))) :args _let_22)) _let_23 :args (_let_21 false _let_5)) :args (_let_12 false _let_3 false _let_21)) _let_20 _let_14 :args (false false _let_13 false _let_12 false _let_9 true _let_1)) :args ((forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Y)) (tptp.little_set X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.little_set (tptp.f1 X Y)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.f1 X Y))) (or (tptp.member _let_1 X) (tptp.member _let_1 Y) (= X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.f1 X Y))) (or (not (tptp.member _let_1 X)) (not (tptp.member _let_1 Y)) (= X Y)))) (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.non_ordered_pair X Y))) (= U X) (= U Y))) (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)))) (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)))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.little_set (tptp.non_ordered_pair X Y))) (forall ((X $$unsorted)) (= (tptp.singleton_set X) (tptp.non_ordered_pair X X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.ordered_pair X Y) (tptp.non_ordered_pair (tptp.singleton_set X) (tptp.non_ordered_pair X Y)))) _let_7 _let_6 _let_5 (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))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.little_set (tptp.f4 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.little_set (tptp.f5 Z X)))) (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))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.member Z (tptp.f4 Z X)))) (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)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.little_set (tptp.f6 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.little_set (tptp.f7 Z X)))) (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))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.member Z (tptp.f7 Z X)))) (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)))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.estin)) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.estin)) (tptp.member (tptp.first Z) (tptp.second Z)))) (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))))) (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 (tptp.member Z (tptp.intersection X Y)) (not (tptp.member Z X)) (not (tptp.member Z 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 (tptp.member Z (tptp.complement X)) (not (tptp.little_set Z)) (tptp.member Z X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.union X Y) (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (tptp.ordered_pair_predicate (tptp.f8 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (tptp.member (tptp.f8 Z X) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (= Z (tptp.first (tptp.f8 Z X))))) (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))))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.member (tptp.first Z) X))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.member (tptp.second Z) Y))) (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)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.converse X))) (tptp.ordered_pair_predicate Z))) (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))) (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)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f9 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f10 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f11 Z X)))) (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)))))) (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))) (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)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f12 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f13 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f14 Z X)))) (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)))))) (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))) (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)))) (forall ((X $$unsorted)) (= (tptp.successor X) (tptp.union X (tptp.singleton_set X)))) (forall ((Z $$unsorted)) (not (tptp.member Z tptp.empty_set))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.universal_set) (not (tptp.little_set Z)))) (tptp.little_set tptp.infinity) (tptp.member tptp.empty_set tptp.infinity) (forall ((X $$unsorted)) (or (not (tptp.member X tptp.infinity)) (tptp.member (tptp.successor X) tptp.infinity))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.sigma X))) (tptp.member (tptp.f16 Z X) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.sigma X))) (tptp.member Z (tptp.f16 Z X)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.sigma X)) (not (tptp.member Y X)) (not (tptp.member Z Y)))) (forall ((U $$unsorted)) (or (not (tptp.little_set U)) (tptp.little_set (tptp.sigma U)))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.proper_subset X Y)) (tptp.subset X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.proper_subset X Y)) (not (= X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.proper_subset X Y) (not (tptp.subset X Y)) (= X Y))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.powerset X))) (tptp.subset Z X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.powerset X)) (not (tptp.little_set Z)) (not (tptp.subset Z X)))) (forall ((U $$unsorted)) (or (not (tptp.little_set U)) (tptp.little_set (tptp.powerset U)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.relation Z)) (not (tptp.member X Z)) (tptp.ordered_pair_predicate X))) (forall ((Z $$unsorted)) (or (tptp.relation Z) (tptp.member (tptp.f18 Z) Z))) (forall ((Z $$unsorted)) (or (tptp.relation Z) (not (tptp.ordered_pair_predicate (tptp.f18 Z))))) (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))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f19 X)))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f20 X)))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f21 X)))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.member (tptp.ordered_pair (tptp.f19 X) (tptp.f20 X)) X))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.member (tptp.ordered_pair (tptp.f19 X) (tptp.f21 X)) X))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (not (= (tptp.f20 X) (tptp.f21 X))))) (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.relation Xf))) (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.single_valued_set Xf))) (forall ((Xf $$unsorted)) (or (tptp.function Xf) (not (tptp.relation Xf)) (not (tptp.single_valued_set Xf)))) (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)))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.member (tptp.f22 Z X Xf) Xf))) (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))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (= (tptp.second (tptp.f22 Z X Xf)) Z))) (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)))) (forall ((X $$unsorted) (Xf $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.function Xf)) (tptp.little_set (tptp.image X Xf)))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.disjoint X Y)) (not (tptp.member U X)) (not (tptp.member U Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.disjoint X Y) (tptp.member (tptp.f23 X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.disjoint X Y) (tptp.member (tptp.f23 X Y) Y))) (forall ((X $$unsorted)) (or (= X tptp.empty_set) (tptp.member (tptp.f24 X) X))) (forall ((X $$unsorted)) (or (= X tptp.empty_set) (tptp.disjoint (tptp.f24 X) X))) (tptp.function tptp.f25) (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (= X tptp.empty_set) (tptp.member (tptp.f26 X) X))) (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (= X tptp.empty_set) (tptp.member (tptp.ordered_pair X (tptp.f26 X)) tptp.f25))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (tptp.ordered_pair_predicate (tptp.f27 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (tptp.member (tptp.f27 Z X) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (= Z (tptp.second (tptp.f27 Z X))))) (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))))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.identity_relation)) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.identity_relation)) (= (tptp.first Z) (tptp.second Z)))) (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))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.restrict X Y) (tptp.intersection X (tptp.cross_product Y tptp.universal_set)))) (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one_function Xf)) (tptp.function Xf))) (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one_function Xf)) (tptp.function (tptp.converse Xf)))) (forall ((Xf $$unsorted)) (or (tptp.one_to_one_function Xf) (not (tptp.function Xf)) (not (tptp.function (tptp.converse Xf))))) (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)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.member (tptp.f28 Z Xf Y) Xf))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (= (tptp.first (tptp.f28 Z Xf Y)) Y))) (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))))) (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))))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.apply_to_two_arguments Xf X Y) (tptp.apply Xf (tptp.ordered_pair X Y)))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.function Xf))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (= (tptp.domain_of Xf) X))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.subset (tptp.range_of Xf) Y))) (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)))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.little_set Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.little_set Xf))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.maps Xf (tptp.cross_product Xs Xs) Xs))) (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)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f29 Z Xf Xg)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f30 Z Xf Xg)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f31 Z Xf Xg)))) (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))))) (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))) (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))) (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)))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.closed Xs1 Xf1))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.closed Xs2 Xf2))) (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))) (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))))) (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))) (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))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (let ((_let_1 (tptp.f33 Xh Xs1 Xf1 Xs2 Xf2))) (let ((_let_2 (tptp.f32 Xh Xs1 Xf1 Xs2 Xf2))) (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 _let_2 _let_1)) (tptp.apply_to_two_arguments Xf2 (tptp.apply Xh _let_2) (tptp.apply Xh _let_1)))))))) (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))) (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))) (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))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.subset Y X)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.little_set Y)) (= (tptp.first (tptp.ordered_pair X Y)) X))) _let_4 (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.first X)))) _let_3 _let_2))))))))))))))))))))))))))))))))))))))
% 0.20/0.60  )
% 0.20/0.60  % SZS output end Proof for SET023-3
% 0.20/0.60  % cvc5---1.0.5 exiting
% 0.20/0.61  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------