TSTP Solution File: COM018+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : COM018+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n025.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 : Wed Aug 30 18:36:59 EDT 2023
% Result : Theorem 10.56s 10.88s
% Output : Proof 10.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM018+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 13:15:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 %----Proving TF0_NAR, FOF, or CNF
% 10.56/10.88 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.3XD7jZDlKS/cvc5---1.0.5_2187.p...
% 10.56/10.88 ------- get file name : TPTP file name is COM018+1
% 10.56/10.88 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_2187.smt2...
% 10.56/10.88 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.56/10.88 --- Run --no-e-matching --full-saturate-quant at 5...
% 10.56/10.88 % SZS status Theorem for COM018+1
% 10.56/10.88 % SZS output start Proof for COM018+1
% 10.56/10.88 (
% 10.56/10.88 (let ((_let_1 (not (exists ((W0 $$unsorted)) (tptp.aNormalFormOfIn0 W0 tptp.xw tptp.xR))))) (let ((_let_2 (tptp.aElement0 tptp.xw))) (let ((_let_3 (and _let_2 (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR tptp.xw) (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR tptp.xw)))) (let ((_let_4 (tptp.isTerminating0 tptp.xR))) (let ((_let_5 (and (tptp.isLocallyConfluent0 tptp.xR) _let_4))) (let ((_let_6 (tptp.aRewritingSystem0 tptp.xR))) (let ((_let_7 (forall ((W0 $$unsorted)) (=> (and (tptp.aRewritingSystem0 W0) (tptp.isTerminating0 W0)) (forall ((W1 $$unsorted)) (=> (tptp.aElement0 W1) (exists ((W2 $$unsorted)) (tptp.aNormalFormOfIn0 W2 W1 W0)))))))) (let ((_let_8 (forall ((W2 $$unsorted)) (not (tptp.aNormalFormOfIn0 W2 tptp.xw tptp.xR))))) (let ((_let_9 (not _let_8))) (let ((_let_10 (not _let_2))) (let ((_let_11 (not _let_4))) (let ((_let_12 (not _let_6))) (let ((_let_13 (or _let_12 _let_11 _let_10 _let_9))) (let ((_let_14 (forall ((W0 $$unsorted)) (not (tptp.aNormalFormOfIn0 W0 tptp.xw tptp.xR))))) (let ((_let_15 (forall ((W0 $$unsorted) (BOUND_VARIABLE_1069 $$unsorted)) (or (not (tptp.aRewritingSystem0 W0)) (not (tptp.isTerminating0 W0)) (not (tptp.aElement0 BOUND_VARIABLE_1069)) (not (forall ((W2 $$unsorted)) (not (tptp.aNormalFormOfIn0 W2 BOUND_VARIABLE_1069 W0)))))))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_13)) :args ((or _let_12 _let_11 _let_10 _let_9 (not _let_13)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_16 :args (tptp.xR tptp.xw QUANTIFIERS_INST_ENUM)) :args (_let_15))) _let_16 :args (_let_13 false _let_15)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_14 (= W0 W2)))) (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (_let_8 false _let_14)) (AND_ELIM (ASSUME :args (_let_3)) :args (0)) (AND_ELIM (ASSUME :args (_let_5)) :args (1)) (ASSUME :args (_let_6)) :args (false false _let_13 false _let_8 false _let_2 false _let_4 false _let_6)) :args ((forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) true)) (forall ((W0 $$unsorted)) (=> (tptp.aRewritingSystem0 W0) true)) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1)) (forall ((W2 $$unsorted)) (=> (tptp.aReductOfIn0 W2 W0 W1) (tptp.aElement0 W2))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (tptp.iLess0 W0 W1) true))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1) (tptp.aElement0 W2)) (=> (tptp.sdtmndtplgtdt0 W0 W1 W2) true))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1) (tptp.aElement0 W2)) (= (tptp.sdtmndtplgtdt0 W0 W1 W2) (or (tptp.aReductOfIn0 W2 W0 W1) (exists ((W3 $$unsorted)) (and (tptp.aElement0 W3) (tptp.aReductOfIn0 W3 W0 W1) (tptp.sdtmndtplgtdt0 W3 W1 W2))))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1) (tptp.aElement0 W2) (tptp.aElement0 W3)) (=> (and (tptp.sdtmndtplgtdt0 W0 W1 W2) (tptp.sdtmndtplgtdt0 W2 W1 W3)) (tptp.sdtmndtplgtdt0 W0 W1 W3)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1) (tptp.aElement0 W2)) (= (tptp.sdtmndtasgtdt0 W0 W1 W2) (or (= W0 W2) (tptp.sdtmndtplgtdt0 W0 W1 W2))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1) (tptp.aElement0 W2) (tptp.aElement0 W3)) (=> (and (tptp.sdtmndtasgtdt0 W0 W1 W2) (tptp.sdtmndtasgtdt0 W2 W1 W3)) (tptp.sdtmndtasgtdt0 W0 W1 W3)))) (forall ((W0 $$unsorted)) (=> (tptp.aRewritingSystem0 W0) (= (tptp.isConfluent0 W0) (forall ((W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aElement0 W1) (tptp.aElement0 W2) (tptp.aElement0 W3) (tptp.sdtmndtasgtdt0 W1 W0 W2) (tptp.sdtmndtasgtdt0 W1 W0 W3)) (exists ((W4 $$unsorted)) (and (tptp.aElement0 W4) (tptp.sdtmndtasgtdt0 W2 W0 W4) (tptp.sdtmndtasgtdt0 W3 W0 W4)))))))) (forall ((W0 $$unsorted)) (=> (tptp.aRewritingSystem0 W0) (= (tptp.isLocallyConfluent0 W0) (forall ((W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aElement0 W1) (tptp.aElement0 W2) (tptp.aElement0 W3) (tptp.aReductOfIn0 W2 W1 W0) (tptp.aReductOfIn0 W3 W1 W0)) (exists ((W4 $$unsorted)) (and (tptp.aElement0 W4) (tptp.sdtmndtasgtdt0 W2 W0 W4) (tptp.sdtmndtasgtdt0 W3 W0 W4)))))))) (forall ((W0 $$unsorted)) (=> (tptp.aRewritingSystem0 W0) (= (tptp.isTerminating0 W0) (forall ((W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W1) (tptp.aElement0 W2)) (=> (tptp.sdtmndtplgtdt0 W1 W0 W2) (tptp.iLess0 W2 W1))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aRewritingSystem0 W1)) (forall ((W2 $$unsorted)) (= (tptp.aNormalFormOfIn0 W2 W0 W1) (and (tptp.aElement0 W2) (tptp.sdtmndtasgtdt0 W0 W1 W2) (not (exists ((W3 $$unsorted)) (tptp.aReductOfIn0 W3 W2 W1)))))))) _let_7 _let_6 _let_5 (and (tptp.aElement0 tptp.xa) (tptp.aElement0 tptp.xb) (tptp.aElement0 tptp.xc)) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aElement0 W2) (tptp.sdtmndtasgtdt0 W0 tptp.xR W1) (tptp.sdtmndtasgtdt0 W0 tptp.xR W2)) (=> (tptp.iLess0 W0 tptp.xa) (exists ((W3 $$unsorted)) (and (tptp.aElement0 W3) (tptp.sdtmndtasgtdt0 W1 tptp.xR W3) (tptp.sdtmndtasgtdt0 W2 tptp.xR W3)))))) (and (tptp.sdtmndtplgtdt0 tptp.xa tptp.xR tptp.xb) (tptp.sdtmndtplgtdt0 tptp.xa tptp.xR tptp.xc)) (and (tptp.aElement0 tptp.xu) (tptp.aReductOfIn0 tptp.xu tptp.xa tptp.xR) (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR tptp.xb)) (and (tptp.aElement0 tptp.xv) (tptp.aReductOfIn0 tptp.xv tptp.xa tptp.xR) (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR tptp.xc)) _let_3 _let_1 true)))))))))))))))))))
% 10.56/10.88 )
% 10.56/10.88 % SZS output end Proof for COM018+1
% 10.56/10.88 % cvc5---1.0.5 exiting
% 10.56/10.89 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------