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

% Computer : n023.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:30:33 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : SEU272+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Wed Aug 23 21:49:27 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.20/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.kb6foy1VQK/cvc5---1.0.5_7960.p...
% 0.20/0.53  ------- get file name : TPTP file name is SEU272+1
% 0.20/0.53  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_7960.smt2...
% 0.20/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53  % SZS status Theorem for SEU272+1
% 0.20/0.53  % SZS output start Proof for SEU272+1
% 0.20/0.53  (
% 0.20/0.53  (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.ordinal B) (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (=> (and (= C D) (exists ((F $$unsorted)) (and (tptp.ordinal F) (= D F) (tptp.in F A))) (= C E) (exists ((G $$unsorted)) (and (tptp.ordinal G) (= E G) (tptp.in G A)))) (= D E))) (exists ((C $$unsorted)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted)) (and (tptp.in E (tptp.succ B)) (= E D) (exists ((H $$unsorted)) (and (tptp.ordinal H) (= D H) (tptp.in H A))))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.ordinal B) (exists ((C $$unsorted)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D (tptp.succ B)) (exists ((E $$unsorted)) (and (tptp.ordinal E) (= D E) (tptp.in E A)))))))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ordinal B)) (not (forall ((C $$unsorted)) (not (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.ordinal D) (tptp.in D A) (tptp.in D (tptp.succ B)))))))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ordinal B)) (not (forall ((C $$unsorted)) (not (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D (tptp.succ B)) (tptp.ordinal D) (tptp.in D A))))))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 (TRANS (ALPHA_EQUIV :args (_let_4 (= C C) (= D D) (= A A) (= B B))) (MACRO_SR_PRED_INTRO :args ((= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ordinal B)) (not (forall ((C $$unsorted)) (not (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D (tptp.succ B)) (tptp.ordinal D) (tptp.in D A))))))))) _let_3) SB_DEFAULT SBA_SEQUENTIAL RW_EXT_REWRITE)))) (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args ((not _let_3) true _let_4)) :args (false true _let_3)) :args (_let_2 (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (=> (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A)))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) true (forall ((A $$unsorted)) (not (tptp.empty (tptp.succ A)))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.succ A))) (=> (tptp.ordinal A) (and (not (tptp.empty _let_1)) (tptp.epsilon_transitive _let_1) (tptp.epsilon_connected _let_1) (tptp.ordinal _let_1))))) _let_1 true)))))))
% 0.20/0.53  )
% 0.20/0.53  % SZS output end Proof for SEU272+1
% 0.20/0.53  % cvc5---1.0.5 exiting
% 0.20/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------