TSTP Solution File: RNG125+4 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : RNG125+4 : 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 : Thu Aug 31 13:50:12 EDT 2023
% Result : Theorem 0.21s 0.56s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG125+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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 : Sun Aug 27 02:26:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.56 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.5wjYFT6Dvi/cvc5---1.0.5_12250.p...
% 0.21/0.56 ------- get file name : TPTP file name is RNG125+4
% 0.21/0.56 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_12250.smt2...
% 0.21/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.56 % SZS status Theorem for RNG125+4
% 0.21/0.56 % SZS output start Proof for RNG125+4
% 0.21/0.56 (
% 0.21/0.56 (let ((_let_1 (tptp.doDivides0 tptp.xu tptp.xb))) (let ((_let_2 (not (not (and (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xb))) _let_1))))) (let ((_let_3 (tptp.doDivides0 tptp.xu tptp.xa))) (let ((_let_4 (not (not (and (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xa))) _let_3))))) (let ((_let_5 (tptp.aDivisorOf0 tptp.xu tptp.xb))) (let ((_let_6 (tptp.aDivisorOf0 tptp.xu tptp.xa))) (let ((_let_7 (not (and (or (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xa))) _let_3 _let_6) (or (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xb))) _let_1 _let_5))))) (let ((_let_8 (tptp.slsdtgt0 tptp.xb))) (let ((_let_9 (tptp.slsdtgt0 tptp.xa))) (let ((_let_10 (tptp.aElement0 tptp.xc))) (let ((_let_11 (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (= tptp.xb (tptp.sdtasdt0 tptp.xu W0))))))) (let ((_let_12 (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (= tptp.xb (tptp.sdtasdt0 tptp.xu W0))))))) (let ((_let_13 (not _let_12))) (let ((_let_14 (or _let_13 _let_1 _let_5))) (let ((_let_15 (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (= tptp.xa (tptp.sdtasdt0 tptp.xu W0))))))) (let ((_let_16 (not _let_15))) (let ((_let_17 (or _let_16 _let_3 _let_6))) (let ((_let_18 (0))) (let ((_let_19 (or))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args _let_18) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_12 (= W0 W0)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 0)) (CONG (REFL :args (_let_14)) (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_12))) :args _let_19)) :args ((or _let_12 _let_14))) (MACRO_RESOLUTION_TRUST (NOT_AND (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_17 0)) (CONG (REFL :args (_let_17)) (MACRO_SR_PRED_INTRO :args ((= (not _let_16) _let_15))) :args _let_19)) :args ((or _let_15 _let_17))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_15 (= W0 W0)))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))) :args _let_18) :args (_let_16 true (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (= tptp.xa (tptp.sdtasdt0 tptp.xu W0))))))) :args (_let_17 true _let_15)) :args ((not _let_14) false _let_17)) :args (_let_12 true _let_14)) :args (_let_11 false _let_12)) :args (false false _let_11)) :args ((forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) true)) (tptp.aElement0 tptp.sz00) (tptp.aElement0 tptp.sz10) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (tptp.aElement0 (tptp.smndt0 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (tptp.aElement0 (tptp.sdtpldt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (tptp.aElement0 (tptp.sdtasdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W1 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aElement0 W2)) (= (tptp.sdtpldt0 (tptp.sdtpldt0 W0 W1) W2) (tptp.sdtpldt0 W0 (tptp.sdtpldt0 W1 W2))))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (and (= (tptp.sdtpldt0 W0 tptp.sz00) W0) (= W0 (tptp.sdtpldt0 tptp.sz00 W0))))) (forall ((W0 $$unsorted)) (let ((_let_1 (tptp.smndt0 W0))) (=> (tptp.aElement0 W0) (and (= (tptp.sdtpldt0 W0 _let_1) tptp.sz00) (= tptp.sz00 (tptp.sdtpldt0 _let_1 W0)))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W1 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aElement0 W2)) (= (tptp.sdtasdt0 (tptp.sdtasdt0 W0 W1) W2) (tptp.sdtasdt0 W0 (tptp.sdtasdt0 W1 W2))))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz10) W0) (= W0 (tptp.sdtasdt0 tptp.sz10 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (let ((_let_1 (tptp.sdtpldt0 W1 W2))) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aElement0 W2)) (and (= (tptp.sdtasdt0 W0 _let_1) (tptp.sdtpldt0 (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W0 W2))) (= (tptp.sdtasdt0 _let_1 W0) (tptp.sdtpldt0 (tptp.sdtasdt0 W1 W0) (tptp.sdtasdt0 W2 W0))))))) (forall ((W0 $$unsorted)) (let ((_let_1 (tptp.smndt0 tptp.sz10))) (let ((_let_2 (tptp.smndt0 W0))) (=> (tptp.aElement0 W0) (and (= (tptp.sdtasdt0 _let_1 W0) _let_2) (= _let_2 (tptp.sdtasdt0 W0 _let_1))))))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (or (= W0 tptp.sz00) (= W1 tptp.sz00))))) (not (= tptp.sz10 tptp.sz00)) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) true)) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.aSet0 W1)) (=> (and (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 W0) (tptp.aElementOf0 W2 W1))) (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 W1) (tptp.aElementOf0 W2 W0)))) (= W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.aSet0 W1)) (forall ((W2 $$unsorted)) (= (= W2 (tptp.sdtpldt1 W0 W1)) (and (tptp.aSet0 W2) (forall ((W3 $$unsorted)) (= (tptp.aElementOf0 W3 W2) (exists ((W4 $$unsorted) (W5 $$unsorted)) (and (tptp.aElementOf0 W4 W0) (tptp.aElementOf0 W5 W1) (= (tptp.sdtpldt0 W4 W5) W3)))))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.aSet0 W1)) (forall ((W2 $$unsorted)) (= (= W2 (tptp.sdtasasdt0 W0 W1)) (and (tptp.aSet0 W2) (forall ((W3 $$unsorted)) (= (tptp.aElementOf0 W3 W2) (and (tptp.aElementOf0 W3 W0) (tptp.aElementOf0 W3 W1))))))))) (forall ((W0 $$unsorted)) (= (tptp.aIdeal0 W0) (and (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (and (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 W0) (tptp.aElementOf0 (tptp.sdtpldt0 W1 W2) W0))) (forall ((W2 $$unsorted)) (=> (tptp.aElement0 W2) (tptp.aElementOf0 (tptp.sdtasdt0 W2 W1) W0))))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aIdeal0 W0) (tptp.aIdeal0 W1)) (tptp.aIdeal0 (tptp.sdtpldt1 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aIdeal0 W0) (tptp.aIdeal0 W1)) (tptp.aIdeal0 (tptp.sdtasasdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aIdeal0 W2)) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aElementOf0 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)) W2)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aIdeal0 W0) (tptp.aIdeal0 W1)) (=> (forall ((W2 $$unsorted)) (=> (tptp.aElement0 W2) (tptp.aElementOf0 W2 (tptp.sdtpldt1 W0 W1)))) (forall ((W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aElement0 W2) (tptp.aElement0 W3)) (exists ((W4 $$unsorted)) (and (tptp.aElement0 W4) (tptp.sdteqdtlpzmzozddtrp0 W4 W2 W0) (tptp.sdteqdtlpzmzozddtrp0 W4 W3 W1)))))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) true)) (forall ((W0 $$unsorted)) (=> (and (tptp.aElement0 W0) (not (= W0 tptp.sz00))) (tptp.aNaturalNumber0 (tptp.sbrdtbr0 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (tptp.iLess0 W0 W1) true))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (not (= W1 tptp.sz00))) (exists ((W2 $$unsorted) (W3 $$unsorted)) (and (tptp.aElement0 W2) (tptp.aElement0 W3) (= W0 (tptp.sdtpldt0 (tptp.sdtasdt0 W2 W1) W3)) (=> (not (= W3 tptp.sz00)) (tptp.iLess0 (tptp.sbrdtbr0 W3) (tptp.sbrdtbr0 W1))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (= (tptp.doDivides0 W0 W1) (exists ((W2 $$unsorted)) (and (tptp.aElement0 W2) (= (tptp.sdtasdt0 W0 W2) W1)))))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aElement0 W1) (tptp.doDivides0 W1 W0)))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (forall ((W2 $$unsorted)) (= (tptp.aGcdOfAnd0 W2 W0 W1) (and (tptp.aDivisorOf0 W2 W0) (tptp.aDivisorOf0 W2 W1) (forall ((W3 $$unsorted)) (=> (and (tptp.aDivisorOf0 W3 W0) (tptp.aDivisorOf0 W3 W1)) (tptp.doDivides0 W3 W2)))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (= (tptp.misRelativelyPrime0 W0 W1) (tptp.aGcdOfAnd0 tptp.sz10 W0 W1)))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (forall ((W1 $$unsorted)) (= (= W1 (tptp.slsdtgt0 W0)) (and (tptp.aSet0 W1) (forall ((W2 $$unsorted)) (= (tptp.aElementOf0 W2 W1) (exists ((W3 $$unsorted)) (and (tptp.aElement0 W3) (= (tptp.sdtasdt0 W0 W3) W2)))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (tptp.aIdeal0 (tptp.slsdtgt0 W0)))) (and (tptp.aElement0 tptp.xa) (tptp.aElement0 tptp.xb)) (or (not (= tptp.xa tptp.sz00)) (not (= tptp.xb tptp.sz00))) (and _let_10 (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xc W0) tptp.xa))) (tptp.doDivides0 tptp.xc tptp.xa) (tptp.aDivisorOf0 tptp.xc tptp.xa) _let_10 (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xc W0) tptp.xb))) (tptp.doDivides0 tptp.xc tptp.xb) (tptp.aDivisorOf0 tptp.xc tptp.xb) (forall ((W0 $$unsorted)) (=> (and (or (and (tptp.aElement0 W0) (or (exists ((W1 $$unsorted)) (and (tptp.aElement0 W1) (= (tptp.sdtasdt0 W0 W1) tptp.xa))) (tptp.doDivides0 W0 tptp.xa))) (tptp.aDivisorOf0 W0 tptp.xa)) (or (exists ((W1 $$unsorted)) (and (tptp.aElement0 W1) (= (tptp.sdtasdt0 W0 W1) tptp.xb))) (tptp.doDivides0 W0 tptp.xb) (tptp.aDivisorOf0 W0 tptp.xb))) (and (exists ((W1 $$unsorted)) (and (tptp.aElement0 W1) (= (tptp.sdtasdt0 W0 W1) tptp.xc))) (tptp.doDivides0 W0 tptp.xc)))) (tptp.aGcdOfAnd0 tptp.xc tptp.xa tptp.xb)) (and (tptp.aSet0 tptp.xI) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xI) (and (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xI) (tptp.aElementOf0 (tptp.sdtpldt0 W0 W1) tptp.xI))) (forall ((W1 $$unsorted)) (=> (tptp.aElement0 W1) (tptp.aElementOf0 (tptp.sdtasdt0 W1 W0) tptp.xI)))))) (tptp.aIdeal0 tptp.xI) (forall ((W0 $$unsorted)) (= (tptp.aElementOf0 W0 (tptp.slsdtgt0 tptp.xa)) (exists ((W1 $$unsorted)) (and (tptp.aElement0 W1) (= (tptp.sdtasdt0 tptp.xa W1) W0))))) (forall ((W0 $$unsorted)) (= (tptp.aElementOf0 W0 (tptp.slsdtgt0 tptp.xb)) (exists ((W1 $$unsorted)) (and (tptp.aElement0 W1) (= (tptp.sdtasdt0 tptp.xb W1) W0))))) (forall ((W0 $$unsorted)) (= (tptp.aElementOf0 W0 tptp.xI) (exists ((W1 $$unsorted) (W2 $$unsorted)) (and (tptp.aElementOf0 W1 (tptp.slsdtgt0 tptp.xa)) (tptp.aElementOf0 W2 (tptp.slsdtgt0 tptp.xb)) (= (tptp.sdtpldt0 W1 W2) W0))))) (= tptp.xI (tptp.sdtpldt1 _let_9 _let_8))) (and (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xa W0) tptp.sz00))) (tptp.aElementOf0 tptp.sz00 _let_9) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xa W0) tptp.xa))) (tptp.aElementOf0 tptp.xa _let_9) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xb W0) tptp.sz00))) (tptp.aElementOf0 tptp.sz00 _let_8) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xb W0) tptp.xb))) (tptp.aElementOf0 tptp.xb _let_8)) (exists ((W0 $$unsorted)) (and (forall ((W1 $$unsorted)) (= (tptp.aElementOf0 W1 (tptp.slsdtgt0 tptp.xa)) (exists ((W2 $$unsorted)) (and (tptp.aElement0 W2) (= (tptp.sdtasdt0 tptp.xa W2) W1))))) (forall ((W1 $$unsorted)) (= (tptp.aElementOf0 W1 (tptp.slsdtgt0 tptp.xb)) (exists ((W2 $$unsorted)) (and (tptp.aElement0 W2) (= (tptp.sdtasdt0 tptp.xb W2) W1))))) (exists ((W1 $$unsorted) (W2 $$unsorted)) (and (tptp.aElementOf0 W1 (tptp.slsdtgt0 tptp.xa)) (tptp.aElementOf0 W2 (tptp.slsdtgt0 tptp.xb)) (= (tptp.sdtpldt0 W1 W2) W0))) (tptp.aElementOf0 W0 (tptp.sdtpldt1 (tptp.slsdtgt0 tptp.xa) (tptp.slsdtgt0 tptp.xb))) (not (= W0 tptp.sz00)))) (and (exists ((W0 $$unsorted) (W1 $$unsorted)) (and (tptp.aElementOf0 W0 (tptp.slsdtgt0 tptp.xa)) (tptp.aElementOf0 W1 (tptp.slsdtgt0 tptp.xb)) (= (tptp.sdtpldt0 W0 W1) tptp.xu))) (tptp.aElementOf0 tptp.xu tptp.xI) (not (= tptp.xu tptp.sz00)) (forall ((W0 $$unsorted)) (=> (and (or (exists ((W1 $$unsorted) (W2 $$unsorted)) (and (tptp.aElementOf0 W1 (tptp.slsdtgt0 tptp.xa)) (tptp.aElementOf0 W2 (tptp.slsdtgt0 tptp.xb)) (= (tptp.sdtpldt0 W1 W2) W0))) (tptp.aElementOf0 W0 tptp.xI)) (not (= W0 tptp.sz00))) (not (tptp.iLess0 (tptp.sbrdtbr0 W0) (tptp.sbrdtbr0 tptp.xu)))))) _let_7 (exists ((W0 $$unsorted) (W1 $$unsorted)) (and (tptp.aElement0 W0) (tptp.aElement0 W1) (= tptp.xu (tptp.sdtpldt0 (tptp.sdtasdt0 tptp.xa W0) (tptp.sdtasdt0 tptp.xb W1))))) _let_4 _let_2 (not false) true))))))))))))))))))))))
% 0.21/0.56 )
% 0.21/0.56 % SZS output end Proof for RNG125+4
% 0.21/0.56 % cvc5---1.0.5 exiting
% 0.21/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------