TSTP Solution File: COM017+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : COM017+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n021.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 11.33s 11.53s
% Output : Proof 11.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : COM017+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 13:05:00 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.22/0.51 %----Proving TF0_NAR, FOF, or CNF
% 11.33/11.53 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.mTcpYBj4j7/cvc5---1.0.5_20965.p...
% 11.33/11.53 ------- get file name : TPTP file name is COM017+1
% 11.33/11.53 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_20965.smt2...
% 11.33/11.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 11.33/11.53 --- Run --no-e-matching --full-saturate-quant at 5...
% 11.33/11.53 % SZS status Theorem for COM017+1
% 11.33/11.53 % SZS output start Proof for COM017+1
% 11.33/11.53 (
% 11.33/11.53 (let ((_let_1 (not (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR W0) (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR W0)))))) (let ((_let_2 (tptp.aReductOfIn0 tptp.xv tptp.xa tptp.xR))) (let ((_let_3 (tptp.aElement0 tptp.xv))) (let ((_let_4 (and _let_3 _let_2 (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR tptp.xc)))) (let ((_let_5 (tptp.aReductOfIn0 tptp.xu tptp.xa tptp.xR))) (let ((_let_6 (tptp.aElement0 tptp.xu))) (let ((_let_7 (and _let_6 _let_5 (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR tptp.xb)))) (let ((_let_8 (tptp.aElement0 tptp.xa))) (let ((_let_9 (and _let_8 (tptp.aElement0 tptp.xb) (tptp.aElement0 tptp.xc)))) (let ((_let_10 (tptp.isLocallyConfluent0 tptp.xR))) (let ((_let_11 (and _let_10 (tptp.isTerminating0 tptp.xR)))) (let ((_let_12 (tptp.aRewritingSystem0 tptp.xR))) (let ((_let_13 (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)))))))))) (let ((_let_14 (forall ((W4 $$unsorted)) (or (not (tptp.aElement0 W4)) (not (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR W4)) (not (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR W4)))))) (let ((_let_15 (not _let_14))) (let ((_let_16 (not _let_2))) (let ((_let_17 (not _let_5))) (let ((_let_18 (not _let_3))) (let ((_let_19 (not _let_6))) (let ((_let_20 (not _let_8))) (let ((_let_21 (or _let_20 _let_19 _let_18 _let_17 _let_16 _let_15))) (let ((_let_22 (0))) (let ((_let_23 (ASSUME :args (_let_7)))) (let ((_let_24 (1))) (let ((_let_25 (ASSUME :args (_let_4)))) (let ((_let_26 (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR W0)) (not (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR W0)))))) (let ((_let_27 (forall ((W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (or (not (tptp.aElement0 W1)) (not (tptp.aElement0 W2)) (not (tptp.aElement0 W3)) (not (tptp.aReductOfIn0 W2 W1 tptp.xR)) (not (tptp.aReductOfIn0 W3 W1 tptp.xR)) (not (forall ((W4 $$unsorted)) (or (not (tptp.aElement0 W4)) (not (tptp.sdtmndtasgtdt0 W2 tptp.xR W4)) (not (tptp.sdtmndtasgtdt0 W3 tptp.xR W4))))))))) (let ((_let_28 (= _let_10 _let_27))) (let ((_let_29 (not _let_12))) (let ((_let_30 (or _let_29 _let_28))) (let ((_let_31 (forall ((W0 $$unsorted)) (or (not (tptp.aRewritingSystem0 W0)) (= (tptp.isLocallyConfluent0 W0) (forall ((W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (or (not (tptp.aElement0 W1)) (not (tptp.aElement0 W2)) (not (tptp.aElement0 W3)) (not (tptp.aReductOfIn0 W2 W1 W0)) (not (tptp.aReductOfIn0 W3 W1 W0)) (not (forall ((W4 $$unsorted)) (or (not (tptp.aElement0 W4)) (not (tptp.sdtmndtasgtdt0 W2 W0 W4)) (not (tptp.sdtmndtasgtdt0 W3 W0 W4)))))))))))) (let ((_let_32 (EQ_RESOLVE (ASSUME :args (_let_13)) (MACRO_SR_EQ_INTRO :args (_let_13 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_33 (_let_27))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_21)) :args ((or _let_20 _let_19 _let_17 _let_18 _let_16 _let_15 (not _let_21)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_33) :args (tptp.xa tptp.xu tptp.xv QUANTIFIERS_INST_ENUM)) :args _let_33)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_28)) :args ((or (not _let_10) _let_27 (not _let_28)))) (AND_ELIM (ASSUME :args (_let_11)) :args _let_22) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_30)) :args ((or _let_29 _let_28 (not _let_30)))) (ASSUME :args (_let_12)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_32 :args (tptp.xR QUANTIFIERS_INST_ENUM)) :args (_let_31))) _let_32 :args (_let_30 false _let_31)) :args (_let_28 false _let_12 false _let_30)) :args (_let_27 false _let_10 false _let_28)) :args (_let_21 false _let_27)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_26 (= W0 W4)))) (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (_let_14 false _let_26)) (AND_ELIM _let_25 :args _let_24) (AND_ELIM _let_25 :args _let_22) (AND_ELIM _let_23 :args _let_24) (AND_ELIM _let_23 :args _let_22) (AND_ELIM (ASSUME :args (_let_9)) :args _let_22) :args (false false _let_21 false _let_14 false _let_2 false _let_3 false _let_5 false _let_6 false _let_8)) :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)))))))) _let_13 (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)))))))) (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_12 _let_11 _let_9 (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)) _let_7 _let_4 _let_1 true))))))))))))))))))))))))))))))))))))
% 11.33/11.54 )
% 11.33/11.54 % SZS output end Proof for COM017+1
% 11.33/11.54 % cvc5---1.0.5 exiting
% 11.33/11.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------