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

% Computer : n022.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 10:43:40 EDT 2023

% Result   : Theorem 0.22s 0.56s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : NUM395+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.37  % Computer : n022.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Fri Aug 25 14:26:25 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.56  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.Y97ZwFCY7I/cvc5---1.0.5_18124.p...
% 0.22/0.56  ------- get file name : TPTP file name is NUM395+1
% 0.22/0.56  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_18124.smt2...
% 0.22/0.56  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.56  % SZS status Theorem for NUM395+1
% 0.22/0.56  % SZS output start Proof for NUM395+1
% 0.22/0.56  (
% 0.22/0.56  (let ((_let_1 (tptp.epsilon_connected tptp.empty_set))) (let ((_let_2 (tptp.epsilon_transitive tptp.empty_set))) (let ((_let_3 (and _let_2 _let_1))) (let ((_let_4 (tptp.ordinal tptp.empty_set))) (let ((_let_5 (not _let_4))) (let ((_let_6 (tptp.empty tptp.empty_set))) (let ((_let_7 (tptp.relation tptp.empty_set))) (let ((_let_8 (forall ((A $$unsorted)) (=> (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)) (tptp.ordinal A))))) (let ((_let_9 (forall ((A $$unsorted)) (or (not (tptp.epsilon_transitive A)) (not (tptp.epsilon_connected A)) (tptp.ordinal A))))) (let ((_let_10 (not _let_1))) (let ((_let_11 (not _let_2))) (let ((_let_12 (or _let_11 _let_10 _let_4))) (let ((_let_13 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_14 (not _let_12))) (let ((_let_15 (ASSUME :args (_let_3)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_13 :args (tptp.empty_set QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.epsilon_transitive A) false))))) :args (_let_9))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_12)) :args ((or _let_4 _let_11 _let_10 _let_14))) (ASSUME :args (_let_5)) (AND_ELIM _let_15 :args (0)) (AND_ELIM _let_15 :args (1)) :args (_let_14 true _let_4 false _let_2 false _let_1)) _let_13 :args (false true _let_12 false _let_9)) :args ((forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element A B) (or (tptp.empty B) (tptp.in A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.element A B))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.function A))) (let ((_let_2 (tptp.relation A))) (=> (and _let_2 (tptp.empty A) _let_1) (and _let_2 _let_1 (tptp.one_to_one A)))))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.relation A))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.in A B) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)))) _let_8 (exists ((A $$unsorted)) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.empty A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_non_empty A) (tptp.function A))) (and _let_6 _let_7) (and _let_6 _let_7 (tptp.relation_empty_yielding tptp.empty_set)) (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))) _let_6 (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (= A tptp.empty_set))) _let_5 (forall ((A $$unsorted)) (= (tptp.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)))) _let_3 true))))))))))))))))))
% 0.22/0.56  )
% 0.22/0.56  % SZS output end Proof for NUM395+1
% 0.22/0.56  % cvc5---1.0.5 exiting
% 0.22/0.57  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------