TSTP Solution File: SEU253+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU253+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n012.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 16:30:25 EDT 2023
% Result : Theorem 26.66s 26.84s
% Output : Proof 26.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.15/0.17 % Problem : SEU253+2 : TPTP v8.1.2. Released v3.3.0.
% 0.15/0.18 % Command : do_cvc5 %s %d
% 0.18/0.39 % Computer : n012.cluster.edu
% 0.18/0.39 % Model : x86_64 x86_64
% 0.18/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39 % Memory : 8042.1875MB
% 0.18/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Wed Aug 23 14:37:57 EDT 2023
% 0.18/0.40 % CPUTime :
% 0.25/0.56 %----Proving TF0_NAR, FOF, or CNF
% 26.66/26.84 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.fgHQd2JJxH/cvc5---1.0.5_23628.p...
% 26.66/26.84 ------- get file name : TPTP file name is SEU253+2
% 26.66/26.84 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_23628.smt2...
% 26.66/26.84 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 26.66/26.84 --- Run --no-e-matching --full-saturate-quant at 5...
% 26.66/26.84 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 26.66/26.84 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 26.66/26.84 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 26.66/26.84 % SZS status Theorem for SEU253+2
% 26.66/26.84 % SZS output start Proof for SEU253+2
% 26.66/26.84 (
% 26.66/26.84 (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (=> (tptp.connected B) (tptp.connected (tptp.relation_restriction B A)))))))) (let ((_let_2 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (=> (tptp.in A (tptp.relation_field (tptp.relation_restriction C B))) (and (tptp.in A (tptp.relation_field C)) (tptp.in A B))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (tptp.in A (tptp.relation_restriction C B)) (and (tptp.in A C) (tptp.in A (tptp.cartesian_product2 B B)))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (= (tptp.in (tptp.ordered_pair A B) (tptp.cartesian_product2 C D)) (and (tptp.in A C) (tptp.in B D)))))) (let ((_let_5 (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.connected A) (forall ((B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_field A))) (not (and (tptp.in B _let_1) (tptp.in C _let_1) (not (= B C)) (not (tptp.in (tptp.ordered_pair B C) A)) (not (tptp.in (tptp.ordered_pair C B) A))))))))))) (let ((_let_6 (tptp.relation tptp.empty_set))) (let ((_let_7 (tptp.empty tptp.empty_set))) (let ((_let_8 (tptp.relation_empty_yielding tptp.empty_set))) (let ((_let_9 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation A) (tptp.relation (tptp.relation_restriction A B)))))) (let ((_let_10 (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14))) (let ((_let_11 (tptp.ordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21))) (let ((_let_12 (tptp.in _let_11 _let_10))) (let ((_let_13 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14))) (let ((_let_14 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14))) (let ((_let_15 (and _let_14 _let_13))) (let ((_let_16 (= _let_12 _let_15))) (let ((_let_17 (tptp.in _let_11 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15))) (let ((_let_18 (and _let_17 _let_12))) (let ((_let_19 (tptp.ordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22))) (let ((_let_20 (tptp.in _let_19 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15))) (let ((_let_21 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22))) (let ((_let_22 (tptp.relation_field SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15))) (let ((_let_23 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 _let_22))) (let ((_let_24 (not _let_23))) (let ((_let_25 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 _let_22))) (let ((_let_26 (not _let_25))) (let ((_let_27 (or _let_26 _let_24 _let_21 _let_20 _let_17))) (let ((_let_28 (forall ((B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_field SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15))) (or (not (tptp.in B _let_1)) (not (tptp.in C _let_1)) (= B C) (tptp.in (tptp.ordered_pair B C) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15) (tptp.in (tptp.ordered_pair C B) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15)))))) (let ((_let_29 (tptp.connected SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15))) (let ((_let_30 (= _let_29 _let_28))) (let ((_let_31 (tptp.relation SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15))) (let ((_let_32 (not _let_31))) (let ((_let_33 (or _let_32 _let_30))) (let ((_let_34 (forall ((A $$unsorted)) (or (not (tptp.relation A)) (= (tptp.connected A) (forall ((B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_field A))) (or (not (tptp.in B _let_1)) (not (tptp.in C _let_1)) (= B C) (tptp.in (tptp.ordered_pair B C) A) (tptp.in (tptp.ordered_pair C B) A))))))))) (let ((_let_35 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_36 (_let_34))) (let ((_let_37 (tptp.relation_restriction SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14))) (let ((_let_38 (tptp.connected _let_37))) (let ((_let_39 (not _let_29))) (let ((_let_40 (or _let_32 _let_39 _let_38))) (let ((_let_41 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.relation B)) (not (tptp.connected B)) (tptp.connected (tptp.relation_restriction B A)))))) (let ((_let_42 (not _let_40))) (let ((_let_43 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_44 (or))) (let ((_let_45 (not _let_41))) (let ((_let_46 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_43) :args (_let_45))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_45) _let_41))) (REFL :args (_let_42)) :args _let_44)) _let_43 :args (_let_42 true _let_41)))) (let ((_let_47 (REFL :args (_let_40)))) (let ((_let_48 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_40 0)) (CONG _let_47 (MACRO_SR_PRED_INTRO :args ((= (not _let_32) _let_31))) :args _let_44)) :args ((or _let_31 _let_40))) _let_46 :args (_let_31 true _let_40)))) (let ((_let_49 (_let_28))) (let ((_let_50 (and _let_23 _let_14))) (let ((_let_51 (tptp.relation_field _let_37))) (let ((_let_52 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 _let_51))) (let ((_let_53 (not _let_52))) (let ((_let_54 (or _let_32 _let_53 _let_50))) (let ((_let_55 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.relation C)) (not (tptp.in A (tptp.relation_field (tptp.relation_restriction C B)))) (and (tptp.in A (tptp.relation_field C)) (tptp.in A B)))))) (let ((_let_56 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_57 (_let_55))) (let ((_let_58 ((not (= (tptp.in A (tptp.relation_field (tptp.relation_restriction C B))) false))))) (let ((_let_59 (tptp.in _let_11 _let_37))) (let ((_let_60 (tptp.in _let_19 _let_37))) (let ((_let_61 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 _let_51))) (let ((_let_62 (not _let_61))) (let ((_let_63 (or _let_62 _let_53 _let_21 _let_60 _let_59))) (let ((_let_64 (forall ((B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_restriction SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14))) (let ((_let_2 (tptp.relation_field _let_1))) (or (not (tptp.in B _let_2)) (not (tptp.in C _let_2)) (= B C) (tptp.in (tptp.ordered_pair B C) _let_1) (tptp.in (tptp.ordered_pair C B) _let_1))))))) (let ((_let_65 (not _let_63))) (let ((_let_66 (= _let_38 _let_64))) (let ((_let_67 (not _let_64))) (let ((_let_68 (tptp.relation _let_37))) (let ((_let_69 (not _let_68))) (let ((_let_70 (or _let_69 _let_66))) (let ((_let_71 (or _let_32 _let_68))) (let ((_let_72 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.relation A)) (tptp.relation (tptp.relation_restriction A B)))))) (let ((_let_73 (EQ_RESOLVE (ASSUME :args (_let_9)) (MACRO_SR_EQ_INTRO :args (_let_9 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_74 (_let_67))) (let ((_let_75 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_74)) :args _let_74)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_67) _let_64))) (REFL :args (_let_65)) :args _let_44)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_66)) :args ((or _let_38 _let_67 (not _let_66)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_40 2)) _let_46 :args ((not _let_38) true _let_40)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_70)) :args ((or _let_69 _let_66 (not _let_70)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_71)) :args ((or _let_32 _let_68 (not _let_71)))) _let_48 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_73 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.relation_restriction A B)))) :args (_let_72))) _let_73 :args (_let_71 false _let_72)) :args (_let_68 false _let_31 false _let_71)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (_let_37 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.connected A)))) :args _let_36)) _let_35 :args (_let_70 false _let_34)) :args (_let_66 false _let_68 false _let_70)) :args (_let_67 true _let_38 false _let_66)) :args (_let_65 true _let_64)))) (let ((_let_76 (REFL :args (_let_63)))) (let ((_let_77 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_54)) :args ((or _let_32 _let_53 _let_50 (not _let_54)))) _let_48 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_63 1)) (CONG _let_76 (MACRO_SR_PRED_INTRO :args ((= (not _let_53) _let_52))) :args _let_44)) :args ((or _let_52 _let_63))) _let_75 :args (_let_52 true _let_63)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_56 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 QUANTIFIERS_INST_E_MATCHING _let_58)) :args _let_57)) _let_56 :args (_let_54 false _let_55)) :args (_let_50 false _let_31 false _let_52 false _let_54)))) (let ((_let_78 (not _let_50))) (let ((_let_79 (and _let_25 _let_13))) (let ((_let_80 (or _let_32 _let_62 _let_79))) (let ((_let_81 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_80)) :args ((or _let_32 _let_62 _let_79 (not _let_80)))) _let_48 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_63 0)) (CONG _let_76 (MACRO_SR_PRED_INTRO :args ((= (not _let_62) _let_61))) :args _let_44)) :args ((or _let_61 _let_63))) _let_75 :args (_let_61 true _let_63)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_56 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 QUANTIFIERS_INST_E_MATCHING _let_58)) :args _let_57)) _let_56 :args (_let_80 false _let_55)) :args (_let_79 false _let_31 false _let_61 false _let_80)))) (let ((_let_82 (not _let_79))) (let ((_let_83 (tptp.in _let_19 _let_10))) (let ((_let_84 (and _let_20 _let_83))) (let ((_let_85 (and _let_13 _let_14))) (let ((_let_86 (= _let_83 _let_85))) (let ((_let_87 (_let_4))) (let ((_let_88 (ASSUME :args _let_87))) (let ((_let_89 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_50 1)) :args ((or _let_14 _let_78))) _let_77 :args (_let_14 false _let_50)))) (let ((_let_90 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_79 1)) :args ((or _let_13 _let_82))) _let_81 :args (_let_13 false _let_79)))) (let ((_let_91 (not _let_14))) (let ((_let_92 (not _let_13))) (let ((_let_93 (= _let_60 _let_84))) (let ((_let_94 (not _let_84))) (let ((_let_95 (or _let_32 _let_93))) (let ((_let_96 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.relation C)) (= (tptp.in A (tptp.relation_restriction C B)) (and (tptp.in A C) (tptp.in A (tptp.cartesian_product2 B B)))))))) (let ((_let_97 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_98 (_let_96))) (let ((_let_99 ((tptp.in A (tptp.relation_restriction C B))))) (let ((_let_100 (= _let_59 _let_18))) (let ((_let_101 (not _let_18))) (let ((_let_102 (or _let_32 _let_100))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_16)) :args ((or _let_12 (not _let_15) (not _let_16)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_88 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_87)) _let_88 :args (_let_16 false _let_4)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_NEG :args (_let_15)) :args ((or _let_92 _let_91 _let_15))) _let_90 _let_89 :args (_let_15 false _let_13 false _let_14)) (MACRO_RESOLUTION_TRUST (CNF_AND_NEG :args (_let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_100)) :args ((or _let_59 _let_101 (not _let_100)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_63 4)) _let_75 :args ((not _let_59) true _let_63)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_102)) :args ((or _let_32 _let_100 (not _let_102)))) _let_48 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_97 :args (_let_11 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 QUANTIFIERS_INST_E_MATCHING _let_99)) :args _let_98)) _let_97 :args (_let_102 false _let_96)) :args (_let_100 false _let_31 false _let_102)) :args (_let_101 true _let_59 false _let_100)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_27)) :args ((or _let_21 _let_20 _let_17 _let_26 _let_24 (not _let_27)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_63 2)) _let_75 :args ((not _let_21) true _let_63)) (MACRO_RESOLUTION_TRUST (CNF_AND_NEG :args (_let_84)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_93)) :args ((or _let_60 _let_94 (not _let_93)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_63 3)) _let_75 :args ((not _let_60) true _let_63)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_95)) :args ((or _let_32 _let_93 (not _let_95)))) _let_48 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_97 :args (_let_19 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 QUANTIFIERS_INST_E_MATCHING _let_99)) :args _let_98)) _let_97 :args (_let_95 false _let_96)) :args (_let_93 false _let_31 false _let_95)) :args (_let_94 true _let_60 false _let_93)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_86)) :args ((or _let_83 (not _let_85) (not _let_86)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_NEG :args (_let_85)) :args ((or _let_92 _let_91 _let_85))) _let_90 _let_89 :args (_let_85 false _let_13 false _let_14)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_88 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_14 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_87)) _let_88 :args (_let_86 false _let_4)) :args (_let_83 false _let_85 false _let_86)) :args ((not _let_20) true _let_84 false _let_83)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_79 0)) :args ((or _let_25 _let_82))) _let_81 :args (_let_25 false _let_79)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_50 0)) :args ((or _let_23 _let_78))) _let_77 :args (_let_23 false _let_50)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_49) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_21 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_22 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.ordered_pair B C)))) :args _let_49)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_30)) :args ((or _let_39 _let_28 (not _let_30)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_40 1)) (CONG _let_47 (MACRO_SR_PRED_INTRO :args ((= (not _let_39) _let_29))) :args _let_44)) :args ((or _let_29 _let_40))) _let_46 :args (_let_29 true _let_40)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_33)) :args ((or _let_32 _let_30 (not _let_33)))) _let_48 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_15 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.relation A) false))))) :args _let_36)) _let_35 :args (_let_33 false _let_34)) :args (_let_30 false _let_31 false _let_33)) :args (_let_28 false _let_29 false _let_30)) :args (_let_27 false _let_28)) :args (_let_17 true _let_21 true _let_20 false _let_25 false _let_23 false _let_27)) :args ((not _let_12) true _let_18 false _let_17)) :args (false false _let_16 false _let_15 true _let_12)) :args ((forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.proper_subset A B) (not (tptp.proper_subset B A)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.relation A))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.function A))) (let ((_let_2 (tptp.relation A))) (=> (and _let_2 (tptp.empty A) _let_1) (and _let_2 _let_1 (tptp.one_to_one A)))))) (forall ((A $$unsorted)) (=> (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)) (tptp.ordinal A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.unordered_pair A B) (tptp.unordered_pair B A))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A B) (tptp.set_union2 B A))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_intersection2 A B) (tptp.set_intersection2 B A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.ordinal A) (tptp.ordinal B)) (or (tptp.ordinal_subset A B) (tptp.ordinal_subset B A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (= B (tptp.identity_relation A)) (forall ((C $$unsorted) (D $$unsorted)) (= (tptp.in (tptp.ordered_pair C D) B) (and (tptp.in C A) (= C D))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (= A B) (and (tptp.subset A B) (tptp.subset B A)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (= C (tptp.relation_dom_restriction A B)) (forall ((D $$unsorted) (E $$unsorted)) (let ((_let_1 (tptp.ordered_pair D E))) (= (tptp.in _let_1 C) (and (tptp.in D B) (tptp.in _let_1 A)))))))))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (forall ((B $$unsorted) (C $$unsorted)) (= (= C (tptp.relation_image A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted)) (and (tptp.in E (tptp.relation_dom A)) (tptp.in E B) (= D (tptp.apply A E)))))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (forall ((C $$unsorted)) (=> (tptp.relation C) (= (= C (tptp.relation_rng_restriction A B)) (forall ((D $$unsorted) (E $$unsorted)) (let ((_let_1 (tptp.ordered_pair D E))) (= (tptp.in _let_1 C) (and (tptp.in E A) (tptp.in _let_1 B)))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.antisymmetric A) (tptp.is_antisymmetric_in A (tptp.relation_field A))))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (forall ((B $$unsorted) (C $$unsorted)) (= (= C (tptp.relation_inverse_image A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D (tptp.relation_dom A)) (tptp.in (tptp.apply A D) B)))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted) (C $$unsorted)) (= (= C (tptp.relation_image A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted)) (and (tptp.in (tptp.ordered_pair E D) A) (tptp.in E B))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted) (C $$unsorted)) (= (= C (tptp.relation_inverse_image A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted)) (and (tptp.in (tptp.ordered_pair D E) A) (tptp.in E B))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.connected A) (tptp.is_connected_in A (tptp.relation_field A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.transitive A) (tptp.is_transitive_in A (tptp.relation_field A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (= (= D (tptp.unordered_triple A B C)) (forall ((E $$unsorted)) (= (tptp.in E D) (not (and (not (= E A)) (not (= E B)) (not (= E C)))))))) (forall ((A $$unsorted)) (= (tptp.succ A) (tptp.set_union2 A (tptp.singleton A)))) (forall ((A $$unsorted)) (= (tptp.relation A) (forall ((B $$unsorted)) (not (and (tptp.in B A) (forall ((C $$unsorted) (D $$unsorted)) (not (= B (tptp.ordered_pair C D))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.is_reflexive_in A B) (forall ((C $$unsorted)) (=> (tptp.in C B) (tptp.in (tptp.ordered_pair C C) A))))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (= B (tptp.set_meet A)))) (let ((_let_2 (= A tptp.empty_set))) (and (=> (not _let_2) (= _let_1 (forall ((C $$unsorted)) (= (tptp.in C B) (forall ((D $$unsorted)) (=> (tptp.in D A) (tptp.in C D))))))) (=> _let_2 (= _let_1 (= B tptp.empty_set))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.singleton A)) (forall ((C $$unsorted)) (= (tptp.in C B) (= C A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted) (C $$unsorted)) (= (= C (tptp.fiber A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (not (= D B)) (tptp.in (tptp.ordered_pair D B) A)))))))) (forall ((A $$unsorted)) (= (= A tptp.empty_set) (forall ((B $$unsorted)) (not (tptp.in B A))))) (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.powerset A)) (forall ((C $$unsorted)) (= (tptp.in C B) (tptp.subset C A))))) (forall ((A $$unsorted)) (= (tptp.epsilon_transitive A) (forall ((B $$unsorted)) (=> (tptp.in B A) (tptp.subset B A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (= (= A B) (forall ((C $$unsorted) (D $$unsorted)) (let ((_let_1 (tptp.ordered_pair C D))) (= (tptp.in _let_1 A) (tptp.in _let_1 B))))))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.element B A))) (let ((_let_2 (tptp.empty A))) (and (=> (not _let_2) (= _let_1 (tptp.in B A))) (=> _let_2 (= _let_1 (tptp.empty B))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.unordered_pair A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (or (= D A) (= D B)))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.well_founded_relation A) (forall ((B $$unsorted)) (not (and (tptp.subset B (tptp.relation_field A)) (not (= B tptp.empty_set)) (forall ((C $$unsorted)) (not (and (tptp.in C B) (tptp.disjoint (tptp.fiber A C) B)))))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.set_union2 A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (or (tptp.in D A) (tptp.in D B)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.cartesian_product2 A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted) (F $$unsorted)) (and (tptp.in E A) (tptp.in F B) (= D (tptp.ordered_pair E F)))))))) (forall ((A $$unsorted)) (= (tptp.epsilon_connected A) (forall ((B $$unsorted) (C $$unsorted)) (not (and (tptp.in B A) (tptp.in C A) (not (tptp.in B C)) (not (= B C)) (not (tptp.in C B))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (= (tptp.subset A B) (forall ((C $$unsorted) (D $$unsorted)) (let ((_let_1 (tptp.ordered_pair C D))) (=> (tptp.in _let_1 A) (tptp.in _let_1 B))))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((C $$unsorted)) (=> (tptp.in C A) (tptp.in C B))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.is_well_founded_in A B) (forall ((C $$unsorted)) (not (and (tptp.subset C B) (not (= C tptp.empty_set)) (forall ((D $$unsorted)) (not (and (tptp.in D C) (tptp.disjoint (tptp.fiber A D) C))))))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.set_intersection2 A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D A) (tptp.in D B)))))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (forall ((B $$unsorted) (C $$unsorted)) (let ((_let_1 (= C (tptp.apply A B)))) (let ((_let_2 (tptp.in B (tptp.relation_dom A)))) (and (=> _let_2 (= _let_1 (tptp.in (tptp.ordered_pair B C) A))) (=> (not _let_2) (= _let_1 (= C tptp.empty_set))))))))) (forall ((A $$unsorted)) (= (tptp.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (= B (tptp.relation_dom A)) (forall ((C $$unsorted)) (= (tptp.in C B) (exists ((D $$unsorted)) (tptp.in (tptp.ordered_pair C D) A)))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.is_antisymmetric_in A B) (forall ((C $$unsorted) (D $$unsorted)) (=> (and (tptp.in C B) (tptp.in D B) (tptp.in (tptp.ordered_pair C D) A) (tptp.in (tptp.ordered_pair D C) A)) (= C D))))))) (forall ((A $$unsorted)) (= (tptp.cast_to_subset A) A)) (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.union A)) (forall ((C $$unsorted)) (= (tptp.in C B) (exists ((D $$unsorted)) (and (tptp.in C D) (tptp.in D A))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.well_ordering A) (and (tptp.reflexive A) (tptp.transitive A) (tptp.antisymmetric A) (tptp.connected A) (tptp.well_founded_relation A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.set_difference A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D A) (not (tptp.in D B))))))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (forall ((B $$unsorted)) (= (= B (tptp.relation_rng A)) (forall ((C $$unsorted)) (= (tptp.in C B) (exists ((D $$unsorted)) (and (tptp.in D (tptp.relation_dom A)) (= C (tptp.apply A D)))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (= B (tptp.relation_rng A)) (forall ((C $$unsorted)) (= (tptp.in C B) (exists ((D $$unsorted)) (tptp.in (tptp.ordered_pair D C) A)))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (= (tptp.subset_complement A B) (tptp.set_difference A B)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.ordered_pair A B) (tptp.unordered_pair (tptp.unordered_pair A B) (tptp.singleton A)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.well_orders A B) (and (tptp.is_reflexive_in A B) (tptp.is_transitive_in A B) (tptp.is_antisymmetric_in A B) (tptp.is_connected_in A B) (tptp.is_well_founded_in A B)))))) (forall ((A $$unsorted)) (= (tptp.being_limit_ordinal A) (= A (tptp.union A)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.relation_field A) (tptp.set_union2 (tptp.relation_dom A) (tptp.relation_rng A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.is_connected_in A B) (forall ((C $$unsorted) (D $$unsorted)) (not (and (tptp.in C B) (tptp.in D B) (not (= C D)) (not (tptp.in (tptp.ordered_pair C D) A)) (not (tptp.in (tptp.ordered_pair D C) A))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.relation_restriction A B) (tptp.set_intersection2 A (tptp.cartesian_product2 B B)))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (= (= B (tptp.relation_inverse A)) (forall ((C $$unsorted) (D $$unsorted)) (= (tptp.in (tptp.ordered_pair C D) B) (tptp.in (tptp.ordered_pair D C) A)))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.disjoint A B) (= (tptp.set_intersection2 A B) tptp.empty_set))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (= (tptp.one_to_one A) (forall ((B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_dom A))) (=> (and (tptp.in B _let_1) (tptp.in C _let_1) (= (tptp.apply A B) (tptp.apply A C))) (= B C))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (forall ((C $$unsorted)) (=> (tptp.relation C) (= (= C (tptp.relation_composition A B)) (forall ((D $$unsorted) (E $$unsorted)) (= (tptp.in (tptp.ordered_pair D E) C) (exists ((F $$unsorted)) (and (tptp.in (tptp.ordered_pair D F) A) (tptp.in (tptp.ordered_pair F E) B)))))))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.is_transitive_in A B) (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (=> (and (tptp.in C B) (tptp.in D B) (tptp.in E B) (tptp.in (tptp.ordered_pair C D) A) (tptp.in (tptp.ordered_pair D E) A)) (tptp.in (tptp.ordered_pair C E) A))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (forall ((C $$unsorted)) (=> (tptp.element C (tptp.powerset (tptp.powerset A))) (= (= C (tptp.complements_of_subsets A B)) (forall ((D $$unsorted)) (=> (tptp.element D (tptp.powerset A)) (= (tptp.in D C) (tptp.in (tptp.subset_complement A D) B))))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.proper_subset A B) (and (tptp.subset A B) (not (= A B))))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (=> (tptp.one_to_one A) (= (tptp.function_inverse A) (tptp.relation_inverse A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.reflexive A) (tptp.is_reflexive_in A (tptp.relation_field A))))) true true true true true true true true true true (forall ((A $$unsorted)) (let ((_let_1 (tptp.function_inverse A))) (=> (and (tptp.relation A) (tptp.function A)) (and (tptp.relation _let_1) (tptp.function _let_1))))) true (forall ((A $$unsorted)) (tptp.element (tptp.cast_to_subset A) (tptp.powerset A))) true _let_9 true true true (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.powerset A))) (=> (tptp.element B _let_1) (tptp.element (tptp.subset_complement A B) _let_1)))) true true (forall ((A $$unsorted)) (=> (tptp.relation A) (tptp.relation (tptp.relation_inverse A)))) true true (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation A) (tptp.relation B)) (tptp.relation (tptp.relation_composition A B)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.powerset A))) (=> (tptp.element B (tptp.powerset _let_1)) (tptp.element (tptp.union_of_subsets A B) _let_1)))) (forall ((A $$unsorted)) (tptp.relation (tptp.identity_relation A))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.powerset A))) (=> (tptp.element B (tptp.powerset _let_1)) (tptp.element (tptp.meet_of_subsets A B) _let_1)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.powerset A))) (=> (and (tptp.element B _let_1) (tptp.element C _let_1)) (tptp.element (tptp.subset_difference A B C) _let_1)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation A) (tptp.relation (tptp.relation_dom_restriction A B)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.powerset (tptp.powerset A)))) (=> (tptp.element B _let_1) (tptp.element (tptp.complements_of_subsets A B) _let_1)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.relation (tptp.relation_rng_restriction A B)))) true true (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_composition B A))) (=> (and (tptp.empty A) (tptp.relation B)) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_inverse A))) (=> (tptp.empty A) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (and _let_7 _let_6 _let_8) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_dom_restriction A B))) (=> (and (tptp.relation A) (tptp.relation_empty_yielding A)) (and (tptp.relation _let_1) (tptp.relation_empty_yielding _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_composition A B))) (=> (and (tptp.relation A) (tptp.function A) (tptp.relation B) (tptp.function B)) (and (tptp.relation _let_1) (tptp.function _let_1))))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.succ A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation A) (tptp.relation B)) (tptp.relation (tptp.set_intersection2 A B)))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) _let_7 (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.ordered_pair A B)))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.identity_relation A))) (and (tptp.relation _let_1) (tptp.function _let_1)))) (and _let_6 _let_8 (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) _let_7 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation A) (tptp.relation B)) (tptp.relation (tptp.set_union2 A B)))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.singleton A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (not (tptp.empty A)) (not (tptp.empty (tptp.set_union2 A B))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_inverse A))) (=> (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A)) (and (tptp.relation _let_1) (tptp.function _let_1))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.succ A))) (=> (tptp.ordinal A) (and (not (tptp.empty _let_1)) (tptp.epsilon_transitive _let_1) (tptp.epsilon_connected _let_1) (tptp.ordinal _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation A) (tptp.relation B)) (tptp.relation (tptp.set_difference A B)))) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.unordered_pair A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (not (tptp.empty A)) (not (tptp.empty (tptp.set_union2 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_dom_restriction A B))) (=> (and (tptp.relation A) (tptp.function A)) (and (tptp.relation _let_1) (tptp.function _let_1))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.union A))) (=> (tptp.ordinal A) (and (tptp.epsilon_transitive _let_1) (tptp.epsilon_connected _let_1) (tptp.ordinal _let_1))))) (and _let_7 _let_6) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (not (tptp.empty A)) (not (tptp.empty B))) (not (tptp.empty (tptp.cartesian_product2 A B))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_rng_restriction A B))) (=> (and (tptp.relation B) (tptp.function B)) (and (tptp.relation _let_1) (tptp.function _let_1))))) (forall ((A $$unsorted)) (=> (and (not (tptp.empty A)) (tptp.relation A)) (not (tptp.empty (tptp.relation_dom A))))) (forall ((A $$unsorted)) (=> (and (not (tptp.empty A)) (tptp.relation A)) (not (tptp.empty (tptp.relation_rng A))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_dom A))) (=> (tptp.empty A) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_rng A))) (=> (tptp.empty A) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_composition A B))) (=> (and (tptp.empty A) (tptp.relation B)) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A A) A)) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_intersection2 A A) A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (= (tptp.subset_complement A (tptp.subset_complement A B)) B))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.relation_inverse (tptp.relation_inverse A)) A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (= (tptp.complements_of_subsets A (tptp.complements_of_subsets A B)) B))) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.proper_subset A A))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.reflexive A) (forall ((B $$unsorted)) (=> (tptp.in B (tptp.relation_field A)) (tptp.in (tptp.ordered_pair B B) A)))))) (forall ((A $$unsorted)) (not (= (tptp.singleton A) tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (= (tptp.set_union2 (tptp.singleton A) B) B))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.disjoint (tptp.singleton A) B) (tptp.in A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (not (tptp.in A B)) (tptp.disjoint (tptp.singleton A) B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_dom (tptp.relation_rng_restriction A B)) (tptp.relation_dom B)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.transitive A) (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.in (tptp.ordered_pair B C) A) (tptp.in (tptp.ordered_pair C D) A)) (tptp.in (tptp.ordered_pair B D) A)))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset (tptp.singleton A) B) (tptp.in A B))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A B) tptp.empty_set) (tptp.subset A B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (forall ((C $$unsorted)) (=> (tptp.in C B) (tptp.in C A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.antisymmetric A) (forall ((B $$unsorted) (C $$unsorted)) (=> (and (tptp.in (tptp.ordered_pair B C) A) (tptp.in (tptp.ordered_pair C B) A)) (= B C)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (or (tptp.in C A) (tptp.subset A (tptp.set_difference B (tptp.singleton C)))))) _let_5 (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.singleton B))) (= (tptp.subset A _let_1) (or (= A tptp.empty_set) (= A _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.subset A (tptp.union B)))) _let_4 (forall ((A $$unsorted) (B $$unsorted)) (=> (forall ((C $$unsorted)) (=> (tptp.in C A) (tptp.in C B))) (tptp.element A (tptp.powerset B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.relation C) (tptp.function C)) (= (tptp.in B (tptp.relation_dom (tptp.relation_dom_restriction C A))) (and (tptp.in B (tptp.relation_dom C)) (tptp.in B A))))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.empty A) (tptp.relation A))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)))))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.empty A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A) (tptp.empty A) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.relation A))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (exists ((A $$unsorted)) (not (tptp.empty A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A) (tptp.function A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (= (tptp.union_of_subsets A B) (tptp.union B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (= (tptp.meet_of_subsets A B) (tptp.set_meet B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.powerset A))) (=> (and (tptp.element B _let_1) (tptp.element C _let_1)) (= (tptp.subset_difference A B C) (tptp.set_difference B C))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.ordinal A) (tptp.ordinal B)) (= (tptp.ordinal_subset A B) (tptp.subset A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.ordinal A) (tptp.ordinal B)) (tptp.ordinal_subset A A))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.disjoint A B) (tptp.disjoint B A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (= (tptp.in (tptp.ordered_pair A B) (tptp.cartesian_product2 C D)) (and (tptp.in A C) (tptp.in B D)))) (forall ((A $$unsorted)) (tptp.in A (tptp.succ A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (not (and (= (tptp.unordered_pair A B) (tptp.unordered_pair C D)) (not (= A C)) (not (= A D))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (tptp.in A (tptp.relation_rng (tptp.relation_rng_restriction B C))) (and (tptp.in A B) (tptp.in A (tptp.relation_rng C)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_rng (tptp.relation_rng_restriction A B)) A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_rng_restriction A B) B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_rng (tptp.relation_rng_restriction A B)) (tptp.relation_rng B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (and (tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B C)) (tptp.subset (tptp.cartesian_product2 C A) (tptp.cartesian_product2 C B))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_rng (tptp.relation_rng_restriction A B)) (tptp.set_intersection2 (tptp.relation_rng B) A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset C D)) (tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B D)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= (tptp.set_union2 A B) B))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.in A B) (forall ((C $$unsorted) (D $$unsorted)) (=> (and (tptp.in C B) (tptp.subset D C)) (tptp.in D B))) (forall ((C $$unsorted)) (=> (tptp.in C B) (tptp.in (tptp.powerset C) B))) (forall ((C $$unsorted)) (not (and (tptp.subset C B) (not (tptp.are_equipotent C B)) (not (tptp.in C B)))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (tptp.relation_dom_restriction (tptp.relation_rng_restriction A C) B) (tptp.relation_rng_restriction A (tptp.relation_dom_restriction C B))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (tptp.in A (tptp.relation_image C B)) (exists ((D $$unsorted)) (and (tptp.in D (tptp.relation_dom C)) (tptp.in (tptp.ordered_pair D A) C) (tptp.in D B)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_image B A) (tptp.relation_rng B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (tptp.subset (tptp.relation_image B (tptp.relation_inverse_image B A)) A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_image B A) (tptp.relation_image B (tptp.set_intersection2 (tptp.relation_dom B) A))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (=> (tptp.subset A (tptp.relation_dom B)) (tptp.subset A (tptp.relation_inverse_image B (tptp.relation_image B A)))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.relation_image A (tptp.relation_dom A)) (tptp.relation_rng A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (=> (tptp.subset A (tptp.relation_rng B)) (= (tptp.relation_image B (tptp.relation_inverse_image B A)) A)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_rng (tptp.relation_composition A B)) (tptp.relation_image B (tptp.relation_rng A))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (tptp.in A (tptp.relation_inverse_image C B)) (exists ((D $$unsorted)) (and (tptp.in D (tptp.relation_rng C)) (tptp.in (tptp.ordered_pair A D) C) (tptp.in D B)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_inverse_image B A) (tptp.relation_dom B)))) _let_3 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (not (and (not (= A tptp.empty_set)) (tptp.subset A (tptp.relation_rng B)) (= (tptp.relation_inverse_image B A) tptp.empty_set))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (=> (tptp.subset A B) (tptp.subset (tptp.relation_inverse_image C A) (tptp.relation_inverse_image C B))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_restriction B A) (tptp.relation_dom_restriction (tptp.relation_rng_restriction A B) A)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset (tptp.set_intersection2 A B) A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_restriction B A) (tptp.relation_rng_restriction A (tptp.relation_dom_restriction B A))))) _let_2 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset A C)) (tptp.subset A (tptp.set_intersection2 B C)))) (forall ((A $$unsorted)) (= (tptp.set_union2 A tptp.empty_set) A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.element A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset B C)) (tptp.subset A C))) (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (=> (tptp.in (tptp.ordered_pair A B) C) (and (tptp.in A (tptp.relation_dom C)) (tptp.in B (tptp.relation_rng C)))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.relation_field (tptp.relation_restriction B A)))) (=> (tptp.relation B) (and (tptp.subset _let_1 (tptp.relation_field B)) (tptp.subset _let_1 A))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (forall ((C $$unsorted)) (=> (and (tptp.relation C) (tptp.function C)) (= (tptp.in A (tptp.relation_dom (tptp.relation_composition C B))) (and (tptp.in A (tptp.relation_dom C)) (tptp.in (tptp.apply C A) (tptp.relation_dom B)))))))) (forall ((A $$unsorted)) (=> (tptp.epsilon_transitive A) (forall ((B $$unsorted)) (=> (tptp.ordinal B) (=> (tptp.proper_subset A B) (tptp.in A B)))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (tptp.subset A (tptp.cartesian_product2 (tptp.relation_dom A) (tptp.relation_rng A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (tptp.subset (tptp.fiber (tptp.relation_restriction C A) B) (tptp.fiber C B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (forall ((C $$unsorted)) (let ((_let_1 (tptp.relation_composition C B))) (=> (and (tptp.relation C) (tptp.function C)) (=> (tptp.in A (tptp.relation_dom _let_1)) (= (tptp.apply _let_1 A) (tptp.apply B (tptp.apply C A))))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (=> (tptp.reflexive B) (tptp.reflexive (tptp.relation_restriction B A))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (forall ((C $$unsorted)) (=> (and (tptp.relation C) (tptp.function C)) (=> (tptp.in A (tptp.relation_dom B)) (= (tptp.apply (tptp.relation_composition B C) A) (tptp.apply C (tptp.apply B A)))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.ordinal B) (=> (tptp.in A B) (tptp.ordinal A)))) _let_1 (forall ((A $$unsorted)) (=> (tptp.ordinal A) (forall ((B $$unsorted)) (=> (tptp.ordinal B) (not (and (not (tptp.in A B)) (not (= A B)) (not (tptp.in B A)))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (=> (tptp.subset A B) (and (tptp.subset (tptp.relation_dom A) (tptp.relation_dom B)) (tptp.subset (tptp.relation_rng A) (tptp.relation_rng B)))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (tptp.subset (tptp.set_intersection2 A C) (tptp.set_intersection2 B C)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= (tptp.set_intersection2 A B) A))) (forall ((A $$unsorted)) (= (tptp.set_intersection2 A tptp.empty_set) tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element A B) (or (tptp.empty B) (tptp.in A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (forall ((C $$unsorted)) (= (tptp.in C A) (tptp.in C B))) (= A B))) (forall ((A $$unsorted)) (tptp.subset tptp.empty_set A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_field C))) (=> (tptp.relation C) (=> (tptp.in (tptp.ordered_pair A B) C) (and (tptp.in A _let_1) (tptp.in B _let_1)))))) (forall ((A $$unsorted)) (=> (forall ((B $$unsorted)) (=> (tptp.in B A) (and (tptp.ordinal B) (tptp.subset B A)))) (tptp.ordinal A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.ordinal B) (not (and (tptp.subset A B) (not (= A tptp.empty_set)) (forall ((C $$unsorted)) (=> (tptp.ordinal C) (not (and (tptp.in C A) (forall ((D $$unsorted)) (=> (tptp.ordinal D) (=> (tptp.in D A) (tptp.ordinal_subset C D)))))))))))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (forall ((B $$unsorted)) (=> (tptp.ordinal B) (= (tptp.in A B) (tptp.ordinal_subset (tptp.succ A) B)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (tptp.subset (tptp.set_difference A C) (tptp.set_difference B C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (= (tptp.ordered_pair A B) (tptp.ordered_pair C D)) (and (= A C) (= B D)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (= (= B (tptp.identity_relation A)) (and (= (tptp.relation_dom B) A) (forall ((C $$unsorted)) (=> (tptp.in C A) (= (tptp.apply B C) C))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in B A) (= (tptp.apply (tptp.identity_relation A) B) B))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset (tptp.set_difference A B) A)) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_inverse A))) (=> (tptp.relation A) (and (= (tptp.relation_rng A) (tptp.relation_dom _let_1)) (= (tptp.relation_dom A) (tptp.relation_rng _let_1)))))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A B) tptp.empty_set) (tptp.subset A B))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset (tptp.singleton A) B) (tptp.in A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.subset (tptp.unordered_pair A B) C) (and (tptp.in A C) (tptp.in B C)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A (tptp.set_difference B A)) (tptp.set_union2 A B))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.singleton B))) (= (tptp.subset A _let_1) (or (= A tptp.empty_set) (= A _let_1))))) (forall ((A $$unsorted)) (= (tptp.set_difference A tptp.empty_set) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (not (and (tptp.in A B) (tptp.in B C) (tptp.in C A)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.element A (tptp.powerset B)) (tptp.subset A B))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.disjoint A B))) (and (not (and (not _let_1) (forall ((C $$unsorted)) (not (and (tptp.in C A) (tptp.in C B)))))) (not (and (exists ((C $$unsorted)) (and (tptp.in C A) (tptp.in C B))) _let_1))))) (forall ((A $$unsorted)) (=> (tptp.subset A tptp.empty_set) (= A tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_difference (tptp.set_union2 A B) B) (tptp.set_difference A B))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (= (tptp.being_limit_ordinal A) (forall ((B $$unsorted)) (=> (tptp.ordinal B) (=> (tptp.in B A) (tptp.in (tptp.succ B) A))))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.being_limit_ordinal A))) (=> (tptp.ordinal A) (and (not (and (not _let_1) (forall ((B $$unsorted)) (=> (tptp.ordinal B) (not (= A (tptp.succ B))))))) (not (and (exists ((B $$unsorted)) (and (tptp.ordinal B) (= A (tptp.succ B)))) _let_1)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (forall ((C $$unsorted)) (=> (tptp.element C (tptp.powerset A)) (= (tptp.disjoint B C) (tptp.subset B (tptp.subset_complement A C))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_dom (tptp.relation_composition A B)) (tptp.relation_dom A)))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_rng (tptp.relation_composition A B)) (tptp.relation_rng B)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= B (tptp.set_union2 A (tptp.set_difference B A))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (=> (tptp.subset (tptp.relation_rng A) (tptp.relation_dom B)) (= (tptp.relation_dom (tptp.relation_composition A B)) (tptp.relation_dom A))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (not (and (not (= B tptp.empty_set)) (= (tptp.complements_of_subsets A B) tptp.empty_set))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (= (tptp.set_union2 (tptp.singleton A) B) B))) (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (=> (tptp.relation B) (=> (tptp.subset (tptp.relation_dom A) (tptp.relation_rng B)) (= (tptp.relation_rng (tptp.relation_composition B A)) (tptp.relation_rng A))))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (=> (not (= B tptp.empty_set)) (= (tptp.subset_difference A (tptp.cast_to_subset A) (tptp.union_of_subsets A B)) (tptp.meet_of_subsets A (tptp.complements_of_subsets A B)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset (tptp.powerset A))) (=> (not (= B tptp.empty_set)) (= (tptp.union_of_subsets A (tptp.complements_of_subsets A B)) (tptp.subset_difference A (tptp.cast_to_subset A) (tptp.meet_of_subsets A B)))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_difference A (tptp.set_difference A B)) (tptp.set_intersection2 A B))) (forall ((A $$unsorted)) (= (tptp.set_difference tptp.empty_set A) tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.in A B) (tptp.element B (tptp.powerset C))) (tptp.element A C))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.disjoint A B))) (and (not (and (not _let_1) (forall ((C $$unsorted)) (not (tptp.in C (tptp.set_intersection2 A B)))))) (not (and (exists ((C $$unsorted)) (tptp.in C (tptp.set_intersection2 A B))) _let_1))))) (forall ((A $$unsorted)) (=> (not (= A tptp.empty_set)) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (forall ((C $$unsorted)) (=> (tptp.element C A) (=> (not (tptp.in C B)) (tptp.in C (tptp.subset_complement A B))))))))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (=> (tptp.one_to_one A) (forall ((B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (= (= B (tptp.function_inverse A)) (and (= (tptp.relation_dom B) (tptp.relation_rng A)) (forall ((C $$unsorted) (D $$unsorted)) (let ((_let_1 (and (tptp.in C (tptp.relation_rng A)) (= D (tptp.apply B C))))) (let ((_let_2 (and (tptp.in D (tptp.relation_dom A)) (= C (tptp.apply A D))))) (and (=> _let_1 _let_2) (=> _let_2 _let_1)))))))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.element C (tptp.powerset A)) (not (and (tptp.in B (tptp.subset_complement A C)) (tptp.in B C))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.function_inverse A))) (=> (and (tptp.relation A) (tptp.function A)) (=> (tptp.one_to_one A) (and (= (tptp.relation_rng A) (tptp.relation_dom _let_1)) (= (tptp.relation_dom A) (tptp.relation_rng _let_1))))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (=> (forall ((B $$unsorted) (C $$unsorted)) (not (tptp.in (tptp.ordered_pair B C) A))) (= A tptp.empty_set)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.function_inverse B))) (=> (and (tptp.relation B) (tptp.function B)) (=> (and (tptp.one_to_one B) (tptp.in A (tptp.relation_rng B))) (and (= A (tptp.apply B (tptp.apply _let_1 A))) (= A (tptp.apply (tptp.relation_composition _let_1 B) A))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (not (and (tptp.in A B) (tptp.element B (tptp.powerset C)) (tptp.empty C)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.well_founded_relation A) (tptp.is_well_founded_in A (tptp.relation_field A))))) (and (= (tptp.relation_dom tptp.empty_set) tptp.empty_set) (= (tptp.relation_rng tptp.empty_set) tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.subset A B) (tptp.proper_subset B A)))) (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (=> (tptp.one_to_one A) (tptp.one_to_one (tptp.function_inverse A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.disjoint B C)) (tptp.disjoint A C))) (forall ((A $$unsorted)) (=> (tptp.relation A) (=> (or (= (tptp.relation_dom A) tptp.empty_set) (= (tptp.relation_rng A) tptp.empty_set)) (= A tptp.empty_set)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (= (tptp.relation_dom A) tptp.empty_set) (= (tptp.relation_rng A) tptp.empty_set)))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A (tptp.singleton B)) A) (not (tptp.in B A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (forall ((C $$unsorted)) (=> (and (tptp.relation C) (tptp.function C)) (= (= B (tptp.relation_dom_restriction C A)) (and (= (tptp.relation_dom B) (tptp.set_intersection2 (tptp.relation_dom C) A)) (forall ((D $$unsorted)) (=> (tptp.in D (tptp.relation_dom B)) (= (tptp.apply B D) (tptp.apply C D)))))))))) (forall ((A $$unsorted)) (= (tptp.unordered_pair A A) (tptp.singleton A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (= A tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset (tptp.singleton A) (tptp.singleton B)) (= A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.relation_dom_restriction C A))) (=> (and (tptp.relation C) (tptp.function C)) (=> (tptp.in B (tptp.relation_dom _let_1)) (= (tptp.apply _let_1 B) (tptp.apply C B)))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.identity_relation A))) (and (= (tptp.relation_dom _let_1) A) (= (tptp.relation_rng _let_1) A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.relation C) (tptp.function C)) (=> (tptp.in B A) (= (tptp.apply (tptp.relation_dom_restriction C A) B) (tptp.apply C B))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (let ((_let_1 (tptp.ordered_pair A B))) (=> (tptp.relation D) (= (tptp.in _let_1 (tptp.relation_composition (tptp.identity_relation C) D)) (and (tptp.in A C) (tptp.in _let_1 D)))))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.in A B) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.in A B) (forall ((C $$unsorted)) (not (and (tptp.in C B) (forall ((D $$unsorted)) (not (and (tptp.in D B) (tptp.in D C)))))))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A (tptp.set_union2 A B))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.disjoint A B) (= (tptp.set_difference A B) A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.relation C) (= (tptp.in A (tptp.relation_dom (tptp.relation_dom_restriction C B))) (and (tptp.in A B) (tptp.in A (tptp.relation_dom C)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_dom_restriction B A) B))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.relation C) (tptp.function C)) (= (tptp.in (tptp.ordered_pair A B) C) (and (tptp.in A (tptp.relation_dom C)) (= B (tptp.apply C A)))))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.well_orders A (tptp.relation_field A)) (tptp.well_ordering A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset C B)) (tptp.subset (tptp.set_union2 A C) B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= A B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_dom (tptp.relation_dom_restriction B A)) (tptp.set_intersection2 (tptp.relation_dom B) A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.subset A (tptp.union B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (= (tptp.relation_dom_restriction B A) (tptp.relation_composition (tptp.identity_relation A) B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.relation B) (tptp.subset (tptp.relation_rng (tptp.relation_dom_restriction B A)) (tptp.relation_rng B)))) (forall ((A $$unsorted)) (= (tptp.union (tptp.powerset A)) A)) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.in A B) (forall ((C $$unsorted) (D $$unsorted)) (=> (and (tptp.in C B) (tptp.subset D C)) (tptp.in D B))) (forall ((C $$unsorted)) (not (and (tptp.in C B) (forall ((D $$unsorted)) (not (and (tptp.in D B) (forall ((E $$unsorted)) (=> (tptp.subset E C) (tptp.in E D))))))))) (forall ((C $$unsorted)) (not (and (tptp.subset C B) (not (tptp.are_equipotent C B)) (not (tptp.in C B)))))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= B C))) true)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 26.66/26.85 )
% 26.66/26.85 % SZS output end Proof for SEU253+2
% 26.66/26.85 % cvc5---1.0.5 exiting
% 26.71/26.85 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------