TSTP Solution File: SEU277+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU277+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n024.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:35 EDT 2023
% Result : Theorem 0.23s 0.56s
% Output : Proof 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : SEU277+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.17 % Command : do_cvc5 %s %d
% 0.16/0.38 % Computer : n024.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Wed Aug 23 18:46:10 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.52 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.56 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.dM3zFI12oL/cvc5---1.0.5_10930.p...
% 0.23/0.56 ------- get file name : TPTP file name is SEU277+1
% 0.23/0.56 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_10930.smt2...
% 0.23/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.23/0.56 % SZS status Theorem for SEU277+1
% 0.23/0.56 % SZS output start Proof for SEU277+1
% 0.23/0.56 (
% 0.23/0.56 (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.relation B) (tptp.relation C) (tptp.function C)) (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (=> (and (= D E) (exists ((G $$unsorted) (H $$unsorted)) (and (= E (tptp.ordered_pair G H)) (tptp.in (tptp.ordered_pair (tptp.apply C G) (tptp.apply C H)) B))) (= D F) (exists ((I $$unsorted) (J $$unsorted)) (and (= F (tptp.ordered_pair I J)) (tptp.in (tptp.ordered_pair (tptp.apply C I) (tptp.apply C J)) B)))) (= E F))) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (exists ((F $$unsorted)) (and (tptp.in F (tptp.cartesian_product2 A A)) (= F E) (exists ((K $$unsorted) (L $$unsorted)) (and (= E (tptp.ordered_pair K L)) (tptp.in (tptp.ordered_pair (tptp.apply C K) (tptp.apply C L)) B))))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.relation B) (tptp.relation C) (tptp.function C)) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 A A)) (exists ((F $$unsorted) (G $$unsorted)) (and (= E (tptp.ordered_pair F G)) (tptp.in (tptp.ordered_pair (tptp.apply C F) (tptp.apply C G)) B)))))))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.relation B)) (not (tptp.relation C)) (not (tptp.function C)) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (not (forall ((K $$unsorted) (L $$unsorted)) (or (not (= E (tptp.ordered_pair K L))) (not (tptp.in (tptp.ordered_pair (tptp.apply C K) (tptp.apply C L)) B))))) (tptp.in E (tptp.cartesian_product2 A A)))))))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.relation B)) (not (tptp.relation C)) (not (tptp.function C)) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 A A)) (not (forall ((F $$unsorted) (G $$unsorted)) (or (not (= E (tptp.ordered_pair F G))) (not (tptp.in (tptp.ordered_pair (tptp.apply C F) (tptp.apply C G)) 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 (= C C) (= B B) (= D D) (= E E) (= A A) (= F K) (= G L))) (MACRO_SR_PRED_INTRO :args ((= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.relation B)) (not (tptp.relation C)) (not (tptp.function C)) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 A A)) (not (forall ((K $$unsorted) (L $$unsorted)) (or (not (= E (tptp.ordered_pair K L))) (not (tptp.in (tptp.ordered_pair (tptp.apply C K) (tptp.apply C L)) 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))) (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 (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 (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (forall ((A $$unsorted)) (=> (tptp.empty 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.empty A) (and (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 true true (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.ordered_pair A B)))) _let_1 true)))))))
% 0.23/0.56 )
% 0.23/0.56 % SZS output end Proof for SEU277+1
% 0.23/0.56 % cvc5---1.0.5 exiting
% 0.23/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------