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

% Computer : n017.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:07 EDT 2023

% Result   : Theorem 0.22s 0.58s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : RNG112+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n017.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sun Aug 27 01:25:11 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.58  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.gHXg1C3ccW/cvc5---1.0.5_14952.p...
% 0.22/0.58  ------- get file name : TPTP file name is RNG112+1
% 0.22/0.58  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_14952.smt2...
% 0.22/0.58  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.58  % SZS status Theorem for RNG112+1
% 0.22/0.58  % SZS output start Proof for RNG112+1
% 0.22/0.58  (
% 0.22/0.58  (let ((_let_1 (not (exists ((W0 $$unsorted)) (and (tptp.aElementOf0 W0 tptp.xI) (not (= W0 tptp.sz00)) (forall ((W1 $$unsorted)) (=> (and (tptp.aElementOf0 W1 tptp.xI) (not (= W1 tptp.sz00))) (not (tptp.iLess0 (tptp.sbrdtbr0 W1) (tptp.sbrdtbr0 W0)))))))))) (let ((_let_2 (forall ((W0 $$unsorted)) (=> (and (tptp.aElementOf0 W0 tptp.xI) (not (= W0 tptp.sz00))) (exists ((W1 $$unsorted)) (and (tptp.aElementOf0 W1 tptp.xI) (not (= W1 tptp.sz00)) (forall ((W2 $$unsorted)) (=> (and (tptp.aElementOf0 W2 tptp.xI) (not (= W2 tptp.sz00))) (not (tptp.iLess0 (tptp.sbrdtbr0 W2) (tptp.sbrdtbr0 W1))))))))))) (let ((_let_3 (exists ((W0 $$unsorted)) (and (tptp.aElementOf0 W0 (tptp.sdtpldt1 (tptp.slsdtgt0 tptp.xa) (tptp.slsdtgt0 tptp.xb))) (not (= W0 tptp.sz00)))))) (let ((_let_4 (tptp.slsdtgt0 tptp.xb))) (let ((_let_5 (tptp.slsdtgt0 tptp.xa))) (let ((_let_6 (tptp.sdtpldt1 _let_5 _let_4))) (let ((_let_7 (= tptp.xI _let_6))) (let ((_let_8 (and (tptp.aIdeal0 tptp.xI) _let_7))) (let ((_let_9 (tptp.aElementOf0 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 _let_6))) (let ((_let_10 (tptp.aElementOf0 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 tptp.xI))) (let ((_let_11 (= tptp.sz00 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_12 (not _let_9))) (let ((_let_13 (or _let_12 _let_11))) (let ((_let_14 (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 (tptp.sdtpldt1 (tptp.slsdtgt0 tptp.xa) (tptp.slsdtgt0 tptp.xb)))) (= tptp.sz00 W0))))) (let ((_let_15 (not _let_13))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_17 (or))) (let ((_let_18 (not _let_14))) (let ((_let_19 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_16) :args (_let_18))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_18) _let_14))) (REFL :args (_let_15)) :args _let_17)) _let_16 :args (_let_15 true _let_14)))) (let ((_let_20 (not _let_10))) (let ((_let_21 (or _let_20 _let_11))) (let ((_let_22 (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xI)) (= tptp.sz00 W0))))) (let ((_let_23 (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xI)) (= tptp.sz00 W1) (not (forall ((W2 $$unsorted)) (or (not (tptp.aElementOf0 W2 tptp.xI)) (= tptp.sz00 W2) (not (tptp.iLess0 (tptp.sbrdtbr0 W2) (tptp.sbrdtbr0 W1)))))))))) (let ((_let_24 (_let_22))) (let ((_let_25 (ASSUME :args (_let_20)))) (let ((_let_26 (ASSUME :args (_let_7)))) (let ((_let_27 (ASSUME :args (_let_9)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_25 _let_26 _let_27) :args (_let_7 _let_9 _let_20)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO _let_27)) (CONG (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)) (SYMM _let_26) :args (APPLY_UF tptp.aElementOf0)) (FALSE_INTRO _let_25))) :args (_let_20 _let_7 _let_9)) :args ((not (and _let_7 _let_9 _let_20)) SB_LITERAL))) (CONG (REFL :args ((not _let_7))) (REFL :args (_let_12)) (MACRO_SR_PRED_INTRO :args ((= (not _let_20) _let_10))) :args _let_17)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_21)) :args ((or _let_11 _let_20 (not _let_21)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_13 1)) _let_19 :args ((not _let_11) true _let_13)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_24) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.aElementOf0 W0 tptp.xI) false))))) :args _let_24)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 (ALPHA_EQUIV :args (_let_23 (= W1 W0) (= W2 W1)))) (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (_let_23 false (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xI)) (= tptp.sz00 W0) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xI)) (= tptp.sz00 W1) (not (tptp.iLess0 (tptp.sbrdtbr0 W1) (tptp.sbrdtbr0 W0)))))))))) :args (_let_22 false _let_23)) :args (_let_21 false _let_22)) :args (_let_20 true _let_11 false _let_21)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_13 0)) (CONG (REFL :args (_let_13)) (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_9))) :args _let_17)) :args ((or _let_9 _let_13))) _let_19 :args (_let_9 true _let_13)) (AND_ELIM (ASSUME :args (_let_8)) :args (1)) :args (false true _let_10 false _let_9 false _let_7)) :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))) (tptp.aGcdOfAnd0 tptp.xc tptp.xa tptp.xb) _let_8 (and (tptp.aElementOf0 tptp.sz00 _let_5) (tptp.aElementOf0 tptp.xa _let_5) (tptp.aElementOf0 tptp.sz00 _let_4) (tptp.aElementOf0 tptp.xb _let_4)) _let_3 _let_2 _let_1 true))))))))))))))))))))))))))))))
% 0.22/0.59  )
% 0.22/0.59  % SZS output end Proof for RNG112+1
% 0.22/0.59  % cvc5---1.0.5 exiting
% 0.22/0.59  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------