%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SEU142+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n013.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:31 EDT 2023

% Result   : Theorem 10.64s 11.02s
% Output   : Proof 10.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : SEU142+2 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Wed Aug 23 12:36:47 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.21/0.51  %----Proving TF0_NAR, FOF, or CNF
% 10.64/11.02  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.hzzonFQt3B/cvc5---1.0.5_3328.p...
% 10.64/11.02  ------- get file name : TPTP file name is SEU142+2
% 10.64/11.02  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_3328.smt2...
% 10.64/11.02  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.64/11.02  --- Run --no-e-matching --full-saturate-quant at 5...
% 10.64/11.02  % SZS status Theorem for SEU142+2
% 10.64/11.02  % SZS output start Proof for SEU142+2
% 10.64/11.02  (
% 10.64/11.02  (let ((_let_1 (forall ((A $$unsorted)) (= (tptp.unordered_pair A A) (tptp.singleton A))))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (=> (forall ((C $$unsorted)) (= (tptp.in C A) (tptp.in C B))) (= A B))))) (let ((_let_4 (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)))))))) (let ((_let_5 (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.singleton A)) (forall ((C $$unsorted)) (= (tptp.in C B) (= C A))))))) (let ((_let_6 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_102))) (let ((_let_7 (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_8 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_102 _let_7))) (let ((_let_9 (= _let_8 _let_6))) (let ((_let_10 (forall ((D $$unsorted)) (= (= D SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4) (tptp.in D (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))))) (let ((_let_11 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.unordered_pair A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (or (= A D) (= B D)))))))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_13 (_let_10))) (let ((_let_14 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_13) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_102 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_13))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_12 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 _let_7 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_11)))) _let_12 :args (_let_10 false _let_11)) :args (_let_9 false _let_10)))) (let ((_let_15 (tptp.singleton SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_16 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_102 _let_15))) (let ((_let_17 (= _let_16 _let_8))) (let ((_let_18 (not _let_8))) (let ((_let_19 (= _let_16 _let_6))) (let ((_let_20 (forall ((C $$unsorted)) (= (tptp.in C (tptp.singleton SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)) (tptp.in C (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))))) (let ((_let_21 (not _let_17))) (let ((_let_22 (= _let_7 _let_15))) (let ((_let_23 (not _let_20))) (let ((_let_24 (or _let_23 _let_22))) (let ((_let_25 (forall ((A $$unsorted) (B $$unsorted)) (or (not (forall ((C $$unsorted)) (= (tptp.in C A) (tptp.in C B)))) (= A B))))) (let ((_let_26 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_27 (not _let_22))) (let ((_let_28 (_let_2))) (let ((_let_29 (ASSUME :args _let_28))) (let ((_let_30 (or))) (let ((_let_31 (_let_23))) (let ((_let_32 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_31)) :args _let_31)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_20))) (REFL :args (_let_21)) :args _let_30)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_24)) :args ((or _let_22 _let_23 (not _let_24)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_29) :args _let_28)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args (_let_27)) :args _let_30)) _let_29 :args (_let_27 true _let_1)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_26 :args (_let_15 _let_7 QUANTIFIERS_INST_ENUM)) :args (_let_25)))) _let_26 :args (_let_24 false _let_25)) :args (_let_23 true _let_22 false _let_24)) :args (_let_21 true _let_20)))) (let ((_let_33 (_let_17))) (let ((_let_34 (forall ((C $$unsorted)) (= (= C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4) (tptp.in C (tptp.singleton SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))))) (let ((_let_35 (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.singleton A)) (forall ((C $$unsorted)) (= (tptp.in C B) (= A C))))))) (let ((_let_36 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_37 (_let_34))) (let ((_let_38 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_37) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_102 QUANTIFIERS_INST_CBQI_PROP)) :args _let_37))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_36 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 _let_15 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_35)))) _let_36 :args (_let_34 false _let_35)) :args (_let_19 false _let_34)))) (let ((_let_39 (not _let_19))) (let ((_let_40 (not _let_6))) (let ((_let_41 (_let_19))) (let ((_let_42 (not _let_9))) (let ((_let_43 (_let_9))) (let ((_let_44 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args _let_43) :args ((or _let_18 _let_6 _let_42))) _let_14 (REORDERING (CNF_EQUIV_POS2 :args _let_41) :args ((or _let_16 _let_40 _let_39))) _let_38 (REORDERING (CNF_EQUIV_NEG1 :args _let_33) :args ((or _let_16 _let_8 _let_17))) _let_32 :args (_let_16 false _let_9 true _let_6 false _let_19 false _let_8 true _let_17)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args _let_43) :args ((or _let_8 _let_40 _let_42))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args _let_41) :args ((or (not _let_16) _let_6 _let_39))) _let_44 _let_38 :args (_let_6 false _let_16 false _let_19)) (MACRO_RESOLUTION_TRUST (CNF_EQUIV_NEG2 :args _let_33) _let_32 _let_44 :args (_let_18 true _let_17 false _let_16)) _let_14 :args (false false _let_6 true _let_8 false _let_9)) :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)))) _let_5 (forall ((A $$unsorted)) (= (= A tptp.empty_set) (forall ((B $$unsorted)) (not (tptp.in B A))))) _let_4 (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)) (= (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)))))) (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) (B $$unsorted)) (= (tptp.disjoint A B) (= (tptp.set_intersection2 A B) tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.proper_subset A B) (and (tptp.subset A B) (not (= A B))))) true true true true true true (tptp.empty tptp.empty_set) (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 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)) (not (tptp.proper_subset A A))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A B) tptp.empty_set) (tptp.subset A B))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty 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)) (=> (tptp.subset A B) (= (tptp.set_union2 A B) 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) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset B C)) (tptp.subset A C))) (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)) _let_3 (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)) (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.set_union2 A (tptp.set_difference B A)) (tptp.set_union2 A B))) (forall ((A $$unsorted)) (= (tptp.set_difference A tptp.empty_set) A)) (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.subset A B) (= B (tptp.set_union2 A (tptp.set_difference B A))))) (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)) (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) (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))) _let_2 (forall ((A $$unsorted)) (=> (tptp.empty A) (= A tptp.empty_set))) (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))) true)))))))))))))))))))))))))))))))))))))))))))))))
% 10.64/11.03  )
% 10.64/11.03  % SZS output end Proof for SEU142+2
% 10.64/11.03  % cvc5---1.0.5 exiting
% 10.88/11.03  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------