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

% Computer : n028.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:31:11 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : SEU364+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n028.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % 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 14:26:18 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.55  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.Dema6JOR0Q/cvc5---1.0.5_18366.p...
% 0.21/0.55  ------- get file name : TPTP file name is SEU364+1
% 0.21/0.55  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_18366.smt2...
% 0.21/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.55  % SZS status Theorem for SEU364+1
% 0.21/0.55  % SZS output start Proof for SEU364+1
% 0.21/0.55  (
% 0.21/0.55  (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (not (tptp.empty_carrier A)) (tptp.transitive_relstr A) (tptp.rel_str A) (tptp.element B (tptp.powerset (tptp.the_carrier A))) (tptp.finite C) (tptp.element C (tptp.powerset B))) (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (=> (and (= D E) (exists ((G $$unsorted)) (and (= G E) (exists ((H $$unsorted)) (and (tptp.element H (tptp.the_carrier A)) (tptp.in H B) (tptp.relstr_set_smaller A G H))))) (= D F) (exists ((I $$unsorted)) (and (= I F) (exists ((J $$unsorted)) (and (tptp.element J (tptp.the_carrier A)) (tptp.in J B) (tptp.relstr_set_smaller A I J)))))) (= E F))) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (exists ((F $$unsorted)) (and (tptp.in F (tptp.powerset C)) (= F E) (exists ((K $$unsorted)) (and (= K E) (exists ((L $$unsorted)) (and (tptp.element L (tptp.the_carrier A)) (tptp.in L B) (tptp.relstr_set_smaller A K L))))))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (not (tptp.empty_carrier A)) (tptp.transitive_relstr A) (tptp.rel_str A) (tptp.element B (tptp.powerset (tptp.the_carrier A))) (tptp.finite C) (tptp.element C (tptp.powerset B))) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.powerset C)) (exists ((F $$unsorted)) (and (= F E) (exists ((G $$unsorted)) (and (tptp.element G (tptp.the_carrier A)) (tptp.in G B) (tptp.relstr_set_smaller A F G)))))))))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.empty_carrier A) (not (tptp.transitive_relstr A)) (not (tptp.rel_str A)) (not (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (not (tptp.finite C)) (not (tptp.element C (tptp.powerset B))) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (not (forall ((BOUND_VARIABLE_1184 $$unsorted)) (or (not (tptp.element BOUND_VARIABLE_1184 (tptp.the_carrier A))) (not (tptp.in BOUND_VARIABLE_1184 B)) (not (tptp.relstr_set_smaller A E BOUND_VARIABLE_1184))))) (tptp.in E (tptp.powerset C)))))))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.empty_carrier A) (not (tptp.transitive_relstr A)) (not (tptp.rel_str A)) (not (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (not (tptp.finite C)) (not (tptp.element C (tptp.powerset B))) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.powerset C)) (not (forall ((BOUND_VARIABLE_869 $$unsorted)) (or (not (tptp.element BOUND_VARIABLE_869 (tptp.the_carrier A))) (not (tptp.in BOUND_VARIABLE_869 B)) (not (tptp.relstr_set_smaller A E BOUND_VARIABLE_869))))))))))))))) (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 (= A A) (= B B) (= C C) (= D D) (= E E) (= BOUND_VARIABLE_869 BOUND_VARIABLE_1184))) (MACRO_SR_PRED_INTRO :args ((= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.empty_carrier A) (not (tptp.transitive_relstr A)) (not (tptp.rel_str A)) (not (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (not (tptp.finite C)) (not (tptp.element C (tptp.powerset B))) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.powerset C)) (not (forall ((BOUND_VARIABLE_1184 $$unsorted)) (or (not (tptp.element BOUND_VARIABLE_1184 (tptp.the_carrier A))) (not (tptp.in BOUND_VARIABLE_1184 B)) (not (tptp.relstr_set_smaller A E BOUND_VARIABLE_1184))))))))))))) _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 true (exists ((A $$unsorted)) (and (tptp.one_sorted_str A) (not (tptp.empty_carrier A)))) (forall ((A $$unsorted)) (=> (and (not (tptp.empty_carrier A)) (tptp.one_sorted_str A)) (not (tptp.empty (tptp.the_carrier A))))) (forall ((A $$unsorted)) (=> (and (not (tptp.empty_carrier A)) (tptp.one_sorted_str A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset (tptp.the_carrier A))) (not (tptp.empty B)))))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.finite A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.finite A))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)) (tptp.finite B))))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)) (tptp.finite B))))) (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)) (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)) (=> (tptp.rel_str A) (tptp.one_sorted_str A))) true true (forall ((A $$unsorted)) (=> (tptp.finite A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (tptp.finite B))))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) _let_1 true)))))))
% 0.21/0.55  )
% 0.21/0.55  % SZS output end Proof for SEU364+1
% 0.21/0.55  % cvc5---1.0.5 exiting
% 0.21/0.56  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------