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

% Computer : n019.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:35 EDT 2023

% Result   : Theorem 0.21s 0.58s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15  % Problem    : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.16  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n019.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 19:34:13 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.21/0.52  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.58  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.5q1BYLhYWH/cvc5---1.0.5_11619.p...
% 0.21/0.58  ------- get file name : TPTP file name is SEU150+2
% 0.21/0.58  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_11619.smt2...
% 0.21/0.58  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.58  % SZS status Theorem for SEU150+2
% 0.21/0.58  % SZS output start Proof for SEU150+2
% 0.21/0.58  (
% 0.21/0.58  (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= B C)))))) (let ((_let_2 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= A B))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.unordered_pair A B) (tptp.unordered_pair B A))))) (let ((_let_4 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_5 (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_6 (tptp.singleton SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_7 (= _let_6 _let_5))) (let ((_let_8 (not _let_7))) (let ((_let_9 (or _let_8 _let_4))) (let ((_let_10 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (= (tptp.singleton A) (tptp.unordered_pair B C))) (= A B))))) (let ((_let_11 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_12 (_let_10))) (let ((_let_13 ((tptp.singleton A) (tptp.unordered_pair B C)))) (let ((_let_14 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_15 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_16 (not _let_4))) (let ((_let_17 (tptp.unordered_pair SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_18 (= _let_6 _let_17))) (let ((_let_19 (not _let_18))) (let ((_let_20 (or _let_19 _let_14))) (let ((_let_21 (or _let_19 _let_15))) (let ((_let_22 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (= (tptp.singleton A) (tptp.unordered_pair B C))) (= B C))))) (let ((_let_23 (not _let_21))) (let ((_let_24 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_25 (or))) (let ((_let_26 (not _let_22))) (let ((_let_27 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_24) :args (_let_26))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_26) _let_22))) (REFL :args (_let_23)) :args _let_25)) _let_24 :args (_let_23 true _let_22)))) (let ((_let_28 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_21 0)) (CONG (REFL :args (_let_21)) (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_18))) :args _let_25)) :args ((or _let_18 _let_21))) _let_27 :args (_let_18 true _let_21)))) (let ((_let_29 (not _let_15))) (let ((_let_30 (and _let_29 _let_14))) (let ((_let_31 (ASSUME :args (_let_29)))) (let ((_let_32 (ASSUME :args (_let_14)))) (let ((_let_33 (= _let_17 _let_5))) (let ((_let_34 (_let_3))) (let ((_let_35 (ASSUME :args _let_34))) (let ((_let_36 (and _let_18 _let_33))) (let ((_let_37 (ASSUME :args (_let_33)))) (let ((_let_38 (ASSUME :args (_let_18)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_9)) :args ((or _let_8 _let_4 (not _let_9)))) (MACRO_RESOLUTION_TRUST (RESOLUTION (CNF_AND_NEG :args (_let_36)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_37 _let_38) (SCOPE (TRANS (SYMM (SYMM _let_38)) (SYMM (SYMM _let_37))) :args (_let_33 _let_18))) :args (_let_18 _let_33))) :args (true _let_36)) _let_28 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.unordered_pair A B)))) :args _let_34)) _let_35 :args (_let_33 false _let_3)) :args (_let_7 false _let_18 false _let_33)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_30)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_32 _let_31) (SCOPE (FALSE_ELIM (TRANS (CONG (SYMM (SYMM _let_32)) (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6)) :args (=)) (FALSE_INTRO _let_31))) :args (_let_14 _let_29))) :args (_let_29 _let_14))) :args (true _let_30)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_29) _let_15))) (REFL :args ((not _let_14))) (REFL :args (_let_16)) :args _let_25)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_21 1)) _let_27 :args (_let_29 true _let_21)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_20)) :args ((or _let_19 _let_14 (not _let_20)))) _let_28 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_11 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_E_MATCHING _let_13)) :args _let_12)) _let_11 :args (_let_20 false _let_10)) :args (_let_14 false _let_18 false _let_20)) :args (_let_16 true _let_15 false _let_14)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_11 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING _let_13)) :args _let_12)) _let_11 :args (_let_9 false _let_10)) :args (false false _let_7 true _let_4 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)))) _let_3 (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)) (= (= 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) (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)) (= (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_2 _let_1 true)))))))))))))))))))))))))))))))))))))))))
% 0.21/0.59  )
% 0.21/0.59  % SZS output end Proof for SEU150+2
% 0.21/0.59  % cvc5---1.0.5 exiting
% 0.21/0.59  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------