TSTP Solution File: SEU286+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU286+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n018.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:38 EDT 2023
% Result : Theorem 0.23s 0.55s
% Output : Proof 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU286+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n018.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 : Wed Aug 23 14:57:56 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.51 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.55 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.Nh8uEq1fwt/cvc5---1.0.5_8709.p...
% 0.23/0.55 ------- get file name : TPTP file name is SEU286+1
% 0.23/0.55 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_8709.smt2...
% 0.23/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.23/0.55 % SZS status Theorem for SEU286+1
% 0.23/0.55 % SZS output start Proof for SEU286+1
% 0.23/0.55 (
% 0.23/0.55 (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted)) (=> (and (not (tptp.empty A)) (tptp.relation B)) (forall ((C $$unsorted)) (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (=> (and (= D E) (exists ((G $$unsorted) (H $$unsorted)) (and (= (tptp.ordered_pair G H) E) (tptp.in G A) (exists ((I $$unsorted)) (and (= G I) (tptp.in H I) (forall ((J $$unsorted)) (=> (tptp.in J I) (tptp.in (tptp.ordered_pair H J) B))))))) (= D F) (exists ((K $$unsorted) (L $$unsorted)) (and (= (tptp.ordered_pair K L) F) (tptp.in K A) (exists ((M $$unsorted)) (and (= K M) (tptp.in L M) (forall ((N $$unsorted)) (=> (tptp.in N M) (tptp.in (tptp.ordered_pair L N) B)))))))) (= E F))) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (exists ((F $$unsorted)) (and (tptp.in F (tptp.cartesian_product2 A C)) (= F E) (exists ((O $$unsorted) (P $$unsorted)) (and (= (tptp.ordered_pair O P) E) (tptp.in O A) (exists ((Q $$unsorted)) (and (= O Q) (tptp.in P Q) (forall ((R $$unsorted)) (=> (tptp.in R Q) (tptp.in (tptp.ordered_pair P R) B)))))))))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (and (not (tptp.empty A)) (tptp.relation B)) (forall ((C $$unsorted)) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 A C)) (exists ((F $$unsorted) (G $$unsorted)) (and (= (tptp.ordered_pair F G) E) (tptp.in F A) (exists ((H $$unsorted)) (and (= F H) (tptp.in G H) (forall ((I $$unsorted)) (=> (tptp.in I H) (tptp.in (tptp.ordered_pair G I) B))))))))))))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (BOUND_VARIABLE_1232 $$unsorted)) (or (tptp.empty A) (not (tptp.relation B)) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (not (forall ((O $$unsorted) (P $$unsorted)) (or (not (= E (tptp.ordered_pair O P))) (not (tptp.in O A)) (not (tptp.in P O)) (not (forall ((R $$unsorted)) (or (not (tptp.in R O)) (tptp.in (tptp.ordered_pair P R) B))))))) (tptp.in E (tptp.cartesian_product2 A BOUND_VARIABLE_1232)))))))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (BOUND_VARIABLE_896 $$unsorted)) (or (tptp.empty A) (not (tptp.relation B)) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 A BOUND_VARIABLE_896)) (not (forall ((F $$unsorted) (G $$unsorted)) (or (not (= E (tptp.ordered_pair F G))) (not (tptp.in F A)) (not (tptp.in G F)) (not (forall ((I $$unsorted)) (or (not (tptp.in I F)) (tptp.in (tptp.ordered_pair G I) B))))))))))))))))) (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 (= D D) (= E E) (= F O) (= G P) (= I R) (= B B) (= A A) (= BOUND_VARIABLE_896 BOUND_VARIABLE_1232))) (MACRO_SR_PRED_INTRO :args ((= (forall ((A $$unsorted) (B $$unsorted) (BOUND_VARIABLE_1232 $$unsorted)) (or (tptp.empty A) (not (tptp.relation B)) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 A BOUND_VARIABLE_1232)) (not (forall ((O $$unsorted) (P $$unsorted)) (or (not (= E (tptp.ordered_pair O P))) (not (tptp.in O A)) (not (tptp.in P O)) (not (forall ((R $$unsorted)) (or (not (tptp.in R O)) (tptp.in (tptp.ordered_pair P R) B))))))))))))))) _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 (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A) (tptp.empty A) (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))) (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.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected 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))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) true true (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal 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))) _let_1 true)))))))
% 0.23/0.56 )
% 0.23/0.56 % SZS output end Proof for SEU286+1
% 0.23/0.56 % cvc5---1.0.5 exiting
% 0.23/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------