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

% Computer : n031.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:34 EDT 2023

% Result   : Theorem 10.61s 10.93s
% Output   : Proof 10.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n031.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 15:38:20 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 10.61/10.93  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.vBFGskylUR/cvc5---1.0.5_876.p...
% 10.61/10.93  ------- get file name : TPTP file name is SEU149+2
% 10.61/10.93  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_876.smt2...
% 10.61/10.93  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.61/10.93  --- Run --no-e-matching --full-saturate-quant at 5...
% 10.61/10.93  % SZS status Theorem for SEU149+2
% 10.61/10.93  % SZS output start Proof for SEU149+2
% 10.61/10.93  (
% 10.61/10.93  (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= A B)))))) (let ((_let_2 (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_3 (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.singleton A)) (forall ((C $$unsorted)) (= (tptp.in C B) (= C A))))))) (let ((_let_4 (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_5 (tptp.singleton SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_6 (= _let_5 _let_4))) (let ((_let_7 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 _let_4))) (let ((_let_8 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 _let_5))) (let ((_let_9 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_10 (not _let_6))) (let ((_let_11 (or _let_10 _let_9))) (let ((_let_12 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (= (tptp.singleton A) (tptp.unordered_pair B C))) (= A B))))) (let ((_let_13 (not _let_11))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_15 (or))) (let ((_let_16 (not _let_12))) (let ((_let_17 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_14) :args (_let_16))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_16) _let_12))) (REFL :args (_let_13)) :args _let_15)) _let_14 :args (_let_13 true _let_12)))) (let ((_let_18 (forall ((D $$unsorted)) (= (tptp.in D (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6)) (or (= D SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5) (= D SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6)))))) (let ((_let_19 (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_20 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_21 (_let_18))) (let ((_let_22 (= _let_9 _let_8))) (let ((_let_23 (not _let_8))) (let ((_let_24 (forall ((C $$unsorted)) (= (tptp.in C (tptp.singleton SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)) (= C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))))) (let ((_let_25 (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.singleton A)) (forall ((C $$unsorted)) (= (tptp.in C B) (= A C))))))) (let ((_let_26 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_27 (_let_24))) (let ((_let_28 (ASSUME :args (_let_23)))) (let ((_let_29 (ASSUME :args (_let_6)))) (let ((_let_30 (ASSUME :args (_let_7)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_28 _let_29 _let_30) :args (_let_6 _let_7 _let_23)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO _let_30)) (CONG (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5)) (SYMM _let_29) :args (APPLY_UF tptp.in)) (FALSE_INTRO _let_28))) :args (_let_23 _let_6 _let_7)) :args ((not (and _let_6 _let_7 _let_23)) SB_LITERAL))) (CONG (REFL :args (_let_10)) (REFL :args ((not _let_7))) (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_8))) :args _let_15)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_22)) :args ((or _let_9 _let_23 (not _let_22)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_11 1)) _let_17 :args ((not _let_9) true _let_11)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_27) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_27))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_26 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 _let_5 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_25)))) _let_26 :args (_let_24 false _let_25)) :args (_let_22 false _let_24)) :args (_let_23 true _let_9 false _let_22)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_21) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_ENUM)) :args _let_21))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_20 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 _let_4 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_19)))) _let_20 :args (_let_18 false _let_19)) :args (_let_7 false _let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_11 0)) (CONG (REFL :args (_let_11)) (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_6))) :args _let_15)) :args ((or _let_6 _let_11))) _let_17 :args (_let_6 true _let_11)) :args (false true _let_8 false _let_7 false _let_6)) :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_3 (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))))) _let_2 (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 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)) (not (= (tptp.singleton A) tptp.empty_set))) (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) (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))))) (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))) (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set)) (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)) (=> (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)) (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))) (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))) _let_1 true)))))))))))))))))))))))))))))))))
% 10.61/10.94  )
% 10.61/10.94  % SZS output end Proof for SEU149+2
% 10.61/10.94  % cvc5---1.0.5 exiting
% 10.61/10.94  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------