TSTP Solution File: RNG123+4 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : RNG123+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n023.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:11 EDT 2023

% Result   : Theorem 0.35s 0.66s
% Output   : Proof 0.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : RNG123+4 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun Aug 27 02:24:41 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.35/0.66  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.25gDFyc8PD/cvc5---1.0.5_28461.p...
% 0.35/0.66  ------- get file name : TPTP file name is RNG123+4
% 0.35/0.66  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_28461.smt2...
% 0.35/0.66  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.35/0.66  % SZS status Theorem for RNG123+4
% 0.35/0.66  % SZS output start Proof for RNG123+4
% 0.35/0.66  (
% 0.35/0.66  (let ((_let_1 (tptp.aElementOf0 tptp.xr tptp.xI))) (let ((_let_2 (not (or (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.xr))) _let_1)))) (let ((_let_3 (tptp.sdtasdt0 tptp.xq tptp.xu))) (let ((_let_4 (tptp.smndt0 _let_3))) (let ((_let_5 (tptp.sdtpldt0 _let_4 tptp.xb))) (let ((_let_6 (= tptp.xr _let_5))) (let ((_let_7 (tptp.aElementOf0 tptp.xb tptp.xI))) (let ((_let_8 (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.xb))) (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.xb))) _let_7))) (let ((_let_9 (tptp.aElementOf0 _let_4 tptp.xI))) (let ((_let_10 (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.smndt0 (tptp.sdtasdt0 tptp.xq tptp.xu))))) _let_9))) (let ((_let_11 (= tptp.xr tptp.sz00))) (let ((_let_12 (tptp.doDivides0 tptp.xu tptp.xb))) (let ((_let_13 (tptp.doDivides0 tptp.xu tptp.xa))) (let ((_let_14 (tptp.slsdtgt0 tptp.xb))) (let ((_let_15 (tptp.slsdtgt0 tptp.xa))) (let ((_let_16 (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_15 _let_14))))) (let ((_let_17 (tptp.aElement0 tptp.xc))) (let ((_let_18 (tptp.aElement0 tptp.sz10))) (let ((_let_19 (tptp.aElementOf0 _let_5 tptp.xI))) (let ((_let_20 (ASSUME :args (_let_6)))) (let ((_let_21 (1))) (let ((_let_22 (not _let_7))) (let ((_let_23 (or _let_22 _let_19))) (let ((_let_24 (and _let_23 (or (not _let_18) (tptp.aElementOf0 (tptp.sdtasdt0 tptp.sz10 _let_4) tptp.xI))))) (let ((_let_25 (not _let_9))) (let ((_let_26 (or _let_25 _let_24))) (let ((_let_27 (forall ((W0 $$unsorted) (BOUND_VARIABLE_2098 $$unsorted) (BOUND_VARIABLE_2091 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xI)) (and (or (not (tptp.aElementOf0 BOUND_VARIABLE_2091 tptp.xI)) (tptp.aElementOf0 (tptp.sdtpldt0 W0 BOUND_VARIABLE_2091) tptp.xI)) (or (not (tptp.aElement0 BOUND_VARIABLE_2098)) (tptp.aElementOf0 (tptp.sdtasdt0 BOUND_VARIABLE_2098 W0) tptp.xI))))))) (let ((_let_28 (_let_27))) (let ((_let_29 (not _let_19))) (let ((_let_30 (not _let_6))) (let ((_let_31 (not _let_1))) (let ((_let_32 (ASSUME :args (_let_19)))) (let ((_let_33 (ASSUME :args (_let_31)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_32 _let_20 _let_33) :args (_let_6 _let_31 _let_19)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_33)) (CONG (SYMM (SYMM _let_20)) (REFL :args (tptp.xI)) :args (APPLY_UF tptp.aElementOf0)) (TRUE_INTRO _let_32))) :args (_let_19 _let_6 _let_31)) :args ((not (and _let_6 _let_31 _let_19)) SB_LITERAL))) (CONG (REFL :args (_let_30)) (MACRO_SR_PRED_INTRO :args ((= (not _let_31) _let_1))) (REFL :args (_let_29)) :args (or))) :args ((or _let_1 _let_30 _let_29))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_23)) :args ((or _let_22 _let_19 (not _let_23)))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))) :args (2)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_24 0)) :args ((or _let_23 (not _let_24)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_25 _let_24 (not _let_26)))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_10)) (MACRO_SR_EQ_INTRO :args (_let_10 SB_DEFAULT SBA_FIXPOINT))) :args _let_21) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_28) :args (_let_4 tptp.sz10 tptp.xb QUANTIFIERS_INST_E_MATCHING ((tptp.sdtpldt0 W0 BOUND_VARIABLE_2091) (tptp.aElement0 BOUND_VARIABLE_2098)))) :args _let_28)) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_16)) (MACRO_SR_EQ_INTRO :args (_let_16 SB_DEFAULT SBA_FIXPOINT))) :args _let_21) :args (_let_26 false _let_27)) :args (_let_24 false _let_9 false _let_26)) :args (_let_23 false _let_24)) :args (_let_19 false _let_7 false _let_23)) (NOT_OR_ELIM (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args _let_21) _let_20 :args (false false _let_19 true _let_1 false _let_6)) :args ((forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) true)) (tptp.aElement0 tptp.sz00) _let_18 (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_17 (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_17 (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)) _let_16 (and (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xa W0) tptp.sz00))) (tptp.aElementOf0 tptp.sz00 _let_15) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xa W0) tptp.xa))) (tptp.aElementOf0 tptp.xa _let_15) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xb W0) tptp.sz00))) (tptp.aElementOf0 tptp.sz00 _let_14) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xb W0) tptp.xb))) (tptp.aElementOf0 tptp.xb _let_14)) (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)))))) (not (and (or (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xa))) _let_13 (tptp.aDivisorOf0 tptp.xu tptp.xa)) (or (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xb))) _let_12 (tptp.aDivisorOf0 tptp.xu tptp.xb)))) (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))))) (not (not (and (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xa))) _let_13))) (not (or (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xu W0) tptp.xb))) _let_12)) (and (tptp.aElement0 tptp.xq) (tptp.aElement0 tptp.xr) (= tptp.xb (tptp.sdtpldt0 _let_3 tptp.xr)) (or _let_11 (tptp.iLess0 (tptp.sbrdtbr0 tptp.xr) (tptp.sbrdtbr0 tptp.xu)))) (not _let_11) _let_10 _let_8 _let_6 _let_2 true))))))))))))))))))))))))))))))))))))
% 0.35/0.66  )
% 0.35/0.66  % SZS output end Proof for RNG123+4
% 0.35/0.66  % cvc5---1.0.5 exiting
% 0.35/0.66  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------