TSTP Solution File: SEU177+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU177+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n018.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:29:50 EDT 2023
% Result : Theorem 10.49s 10.75s
% Output : Proof 10.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU177+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n018.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 : Thu Aug 24 01:57:57 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 10.49/10.75 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.LOvVhw8SF3/cvc5---1.0.5_24369.p...
% 10.49/10.75 ------- get file name : TPTP file name is SEU177+2
% 10.49/10.75 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24369.smt2...
% 10.49/10.75 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.49/10.75 --- Run --no-e-matching --full-saturate-quant at 5...
% 10.49/10.75 % SZS status Theorem for SEU177+2
% 10.49/10.75 % SZS output start Proof for SEU177+2
% 10.49/10.75 (
% 10.49/10.75 (let ((_let_1 (not (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))))))))) (let ((_let_2 (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)))))))))) (let ((_let_3 (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)))))))))) (let ((_let_4 (tptp.in (tptp.ordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_5 (forall ((D $$unsorted)) (not (tptp.in (tptp.ordered_pair D SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))))) (let ((_let_6 (tptp.relation_rng SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_7 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 _let_6))) (let ((_let_8 (tptp.relation_dom SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_9 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 _let_8))) (let ((_let_10 (and _let_9 _let_7))) (let ((_let_11 (not _let_4))) (let ((_let_12 (tptp.relation SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_13 (not _let_12))) (let ((_let_14 (or _let_13 _let_11 _let_10))) (let ((_let_15 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.relation C)) (not (tptp.in (tptp.ordered_pair A B) C)) (and (tptp.in A (tptp.relation_dom C)) (tptp.in B (tptp.relation_rng C))))))) (let ((_let_16 (not _let_14))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (or))) (let ((_let_19 (not _let_15))) (let ((_let_20 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_17) :args (_let_19))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_15))) (REFL :args (_let_16)) :args _let_18)) _let_17 :args (_let_16 true _let_15)))) (let ((_let_21 (REFL :args (_let_14)))) (let ((_let_22 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 1)) (CONG _let_21 (MACRO_SR_PRED_INTRO :args ((= (not _let_11) _let_4))) :args _let_18)) :args ((or _let_4 _let_14))) _let_20 :args (_let_4 true _let_14)))) (let ((_let_23 (not _let_5))) (let ((_let_24 (= _let_7 _let_23))) (let ((_let_25 (forall ((C $$unsorted)) (= (not (forall ((D $$unsorted)) (not (tptp.in (tptp.ordered_pair D C) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)))) (tptp.in C (tptp.relation_rng SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)))))) (let ((_let_26 (or _let_13 _let_25))) (let ((_let_27 (forall ((A $$unsorted) (BOUND_VARIABLE_2174 $$unsorted)) (or (not (tptp.relation A)) (= (= (tptp.relation_rng A) BOUND_VARIABLE_2174) (forall ((C $$unsorted)) (= (not (forall ((D $$unsorted)) (not (tptp.in (tptp.ordered_pair D C) A)))) (tptp.in C BOUND_VARIABLE_2174)))))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_29 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 0)) (CONG _let_21 (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_12))) :args _let_18)) :args ((or _let_12 _let_14))) _let_20 :args (_let_12 true _let_14)))) (let ((_let_30 (_let_25))) (let ((_let_31 (forall ((D $$unsorted)) (not (tptp.in (tptp.ordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 D) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))))) (let ((_let_32 (not _let_31))) (let ((_let_33 (= _let_9 _let_32))) (let ((_let_34 (forall ((C $$unsorted)) (= (not (forall ((D $$unsorted)) (not (tptp.in (tptp.ordered_pair C D) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)))) (tptp.in C (tptp.relation_dom SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)))))) (let ((_let_35 (or _let_13 _let_34))) (let ((_let_36 (forall ((A $$unsorted) (BOUND_VARIABLE_2129 $$unsorted)) (or (not (tptp.relation A)) (= (= (tptp.relation_dom A) BOUND_VARIABLE_2129) (forall ((C $$unsorted)) (= (not (forall ((D $$unsorted)) (not (tptp.in (tptp.ordered_pair C D) A)))) (tptp.in C BOUND_VARIABLE_2129)))))))) (let ((_let_37 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_38 (_let_34))) (let ((_let_39 (_let_31))) (let ((_let_40 (not _let_33))) (let ((_let_41 (not _let_24))) (let ((_let_42 (_let_5))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_42) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_42)) :args ((or _let_11 _let_23))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_EQUIV_POS2 :args (_let_24)) (CONG (REFL :args (_let_41)) (REFL :args (_let_7)) (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_5))) :args _let_18)) :args ((or _let_7 _let_5 _let_41))) (MACRO_RESOLUTION_TRUST (CNF_AND_NEG :args (_let_10)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_14 2)) _let_20 :args ((not _let_10) true _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_EQUIV_POS2 :args (_let_33)) (CONG (REFL :args (_let_40)) (REFL :args (_let_9)) (MACRO_SR_PRED_INTRO :args ((= (not _let_32) _let_31))) :args _let_18)) :args ((or _let_9 _let_31 _let_40))) (MACRO_RESOLUTION_TRUST (REORDERING (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_39) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_39)) :args ((or _let_11 _let_32))) _let_22 :args (_let_32 false _let_4)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_38) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_CBQI_PROP)) :args _let_38))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_35)) :args ((or _let_13 _let_34 (not _let_35)))) _let_29 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_37 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7 _let_8 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_36)))) _let_37 :args (_let_35 false _let_36)) :args (_let_34 false _let_12 false _let_35)) :args (_let_33 false _let_34)) :args (_let_9 true _let_31 false _let_33)) :args ((not _let_7) true _let_10 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_30) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_CBQI_PROP)) :args _let_30))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_13 _let_25 (not _let_26)))) _let_29 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_28 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7 _let_6 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_27)))) _let_28 :args (_let_26 false _let_27)) :args (_let_25 false _let_12 false _let_26)) :args (_let_24 false _let_25)) :args (_let_5 true _let_7 false _let_24)) _let_22 :args (false false _let_5 false _let_4)) :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) (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)) (= (= A B) (and (tptp.subset A B) (tptp.subset B 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)) (= (= 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) (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) (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) (B $$unsorted)) (= (tptp.subset A B) (forall ((C $$unsorted)) (=> (tptp.in C A) (tptp.in C B))))) (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)))))) _let_3 (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) (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))))))) _let_2 (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) (B $$unsorted)) (= (tptp.disjoint A B) (= (tptp.set_intersection2 A B) tptp.empty_set))) (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))))) true true true true true true (forall ((A $$unsorted)) (tptp.element (tptp.cast_to_subset A) (tptp.powerset A))) 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 true true (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) (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)) (let ((_let_1 (tptp.powerset (tptp.powerset A)))) (=> (tptp.element B _let_1) (tptp.element (tptp.complements_of_subsets A B) _let_1)))) true (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) (tptp.empty tptp.empty_set) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.ordered_pair 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) (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)) (= (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) (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)) (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.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) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (or (tptp.in C A) (tptp.subset A (tptp.set_difference B (tptp.singleton C)))))) (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)))) (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) (B $$unsorted)) (=> (forall ((C $$unsorted)) (=> (tptp.in C A) (tptp.in C B))) (tptp.element A (tptp.powerset B)))) (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)) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (exists ((A $$unsorted)) (not (tptp.empty 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)) (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) (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.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) (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)) (tptp.subset (tptp.set_intersection2 A B) A)) (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)) _let_1 (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)) (=> (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)) (tptp.subset (tptp.set_difference A B) A)) (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)) (= (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) (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) (B $$unsorted)) (=> (tptp.subset A B) (= B (tptp.set_union2 A (tptp.set_difference B 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) (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) (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) (B $$unsorted) (C $$unsorted)) (not (and (tptp.in A B) (tptp.element B (tptp.powerset C)) (tptp.empty C)))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.subset A B) (tptp.proper_subset B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.disjoint B C)) (tptp.disjoint A C))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A (tptp.singleton B)) A) (not (tptp.in B A)))) (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)) (not (and (tptp.in A B) (tptp.empty B)))) (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)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) (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.in A B) (tptp.subset A (tptp.union 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)))))))))))))))))))))))))))))))))))))))))))))
% 10.49/10.75 )
% 10.49/10.75 % SZS output end Proof for SEU177+2
% 10.49/10.75 % cvc5---1.0.5 exiting
% 10.49/10.76 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------