%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET988+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n025.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 14:41:15 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET988+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sat Aug 26 12:58:23 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.53  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.t8HvOa4WvX/cvc5---1.0.5_2091.p...
% 0.21/0.53  ------- get file name : TPTP file name is SET988+1
% 0.21/0.53  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_2091.smt2...
% 0.21/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.53  % SZS status Theorem for SET988+1
% 0.21/0.53  % SZS output start Proof for SET988+1
% 0.21/0.53  (
% 0.21/0.53  (let ((_let_1 (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))))))))))) (let ((_let_2 (forall ((A $$unsorted)) (= (tptp.function A) (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.in (tptp.ordered_pair B C) A) (tptp.in (tptp.ordered_pair B D) A)) (= C D))))))) (let ((_let_3 (not (forall ((A $$unsorted)) (=> (and (forall ((B $$unsorted)) (not (and (tptp.in B A) (forall ((C $$unsorted) (D $$unsorted)) (not (= (tptp.ordered_pair C D) B)))))) (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.in (tptp.ordered_pair B C) A) (tptp.in (tptp.ordered_pair B D) A)) (= C D)))) (and (tptp.relation A) (tptp.function A))))))) (let ((_let_4 (tptp.empty tptp.empty_set))) (let ((_let_5 (tptp.relation tptp.empty_set))) (let ((_let_6 (tptp.function SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8))) (let ((_let_7 (tptp.relation SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8))) (let ((_let_8 (and _let_7 _let_6))) (let ((_let_9 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.in (tptp.ordered_pair B C) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) (not (tptp.in (tptp.ordered_pair B D) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) (= C D))))) (let ((_let_10 (not _let_9))) (let ((_let_11 (forall ((B $$unsorted)) (or (not (tptp.in B SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) (not (forall ((C $$unsorted) (D $$unsorted)) (not (= B (tptp.ordered_pair C D))))))))) (let ((_let_12 (not _let_11))) (let ((_let_13 (or _let_12 _let_10 _let_8))) (let ((_let_14 (forall ((A $$unsorted)) (or (not (forall ((B $$unsorted)) (or (not (tptp.in B A)) (not (forall ((C $$unsorted) (D $$unsorted)) (not (= B (tptp.ordered_pair C D)))))))) (not (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.in (tptp.ordered_pair B C) A)) (not (tptp.in (tptp.ordered_pair B D) A)) (= C D)))) (and (tptp.relation A) (tptp.function A)))))) (let ((_let_15 (not _let_13))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_17 (or))) (let ((_let_18 (not _let_14))) (let ((_let_19 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_16) :args (_let_18))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_18) _let_14))) (REFL :args (_let_15)) :args _let_17)) _let_16 :args (_let_15 true _let_14)))) (let ((_let_20 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.in (tptp.ordered_pair B C) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) (not (tptp.in (tptp.ordered_pair B D) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) (= C D))))) (let ((_let_21 (= _let_6 _let_20))) (let ((_let_22 (forall ((A $$unsorted)) (= (tptp.function A) (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.in (tptp.ordered_pair B C) A)) (not (tptp.in (tptp.ordered_pair B D) A)) (= C D))))))) (let ((_let_23 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_24 (REFL :args (_let_13)))) (let ((_let_25 (forall ((B $$unsorted)) (or (not (tptp.in B SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) (not (forall ((C $$unsorted) (D $$unsorted)) (not (= B (tptp.ordered_pair C D))))))))) (let ((_let_26 (= _let_7 _let_25))) (let ((_let_27 (forall ((A $$unsorted)) (= (tptp.relation A) (forall ((B $$unsorted)) (or (not (tptp.in B A)) (not (forall ((C $$unsorted) (D $$unsorted)) (not (= B (tptp.ordered_pair C D))))))))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (CNF_AND_NEG :args (_let_8)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_26)) :args ((or _let_7 (not _let_25) (not _let_26)))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_11 (= B B) (= C C) (= D D)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_13 0)) (CONG _let_24 (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_11))) :args _let_17)) :args ((or _let_11 _let_13))) _let_19 :args (_let_11 true _let_13)) :args (_let_25 false _let_11)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.relation A)))) :args (_let_27))) _let_28 :args (_let_26 false _let_27)) :args (_let_7 false _let_25 false _let_26)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_21)) :args ((or _let_6 (not _let_20) (not _let_21)))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_9 (= B B) (= C C) (= D D)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_13 1)) (CONG _let_24 (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_9))) :args _let_17)) :args ((or _let_9 _let_13))) _let_19 :args (_let_9 true _let_13)) :args (_let_20 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.function A)))) :args (_let_22))) _let_23 :args (_let_21 false _let_22)) :args (_let_6 false _let_20 false _let_21)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_13 2)) _let_19 :args ((not _let_8) true _let_13)) :args (false false _let_7 false _let_6 true _let_8)) :args ((forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) (and _let_4 _let_5) (and _let_4 _let_5 (tptp.relation_empty_yielding tptp.empty_set)) _let_4 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.unordered_pair A B) (tptp.unordered_pair B A))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.singleton A)))) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.unordered_pair A B)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.relation A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element A B) (or (tptp.empty B) (tptp.in A B)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.element A (tptp.powerset B)) (tptp.subset A B))) (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) (C $$unsorted)) (not (and (tptp.in A B) (tptp.element B (tptp.powerset C)) (tptp.empty C)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (= A tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)))))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (exists ((A $$unsorted)) (and (tptp.empty A) (tptp.relation A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.relation A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A))) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.ordered_pair A B)))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.element A B))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.in A B) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.ordered_pair A B) (tptp.unordered_pair (tptp.unordered_pair A B) (tptp.singleton A)))) _let_3 _let_2 _let_1 true)))))))))))))))))))))))))))))))
% 0.21/0.53  )
% 0.21/0.53  % SZS output end Proof for SET988+1
% 0.21/0.53  % cvc5---1.0.5 exiting
% 0.21/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------