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

% Computer : n005.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:03 EDT 2023

% Result   : Theorem 0.19s 0.50s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : RNG102+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command    : do_cvc5 %s %d
% 0.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun Aug 27 02:31:23 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.47  %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.50  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.xpRdTyEeLp/cvc5---1.0.5_6954.p...
% 0.19/0.50  ------- get file name : TPTP file name is RNG102+2
% 0.19/0.50  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_6954.smt2...
% 0.19/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.50  % SZS status Theorem for RNG102+2
% 0.19/0.50  % SZS output start Proof for RNG102+2
% 0.19/0.50  (
% 0.19/0.50  (let ((_let_1 (not (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xc W0) tptp.xy)))))) (let ((_let_2 (tptp.slsdtgt0 tptp.xc))) (let ((_let_3 (and (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xc W0) tptp.xx))) (tptp.aElementOf0 tptp.xx _let_2) (exists ((W0 $$unsorted)) (and (tptp.aElement0 W0) (= (tptp.sdtasdt0 tptp.xc W0) tptp.xy))) (tptp.aElementOf0 tptp.xy _let_2) (tptp.aElement0 tptp.xz)))) (let ((_let_4 (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (= tptp.xy (tptp.sdtasdt0 tptp.xc W0))))))) (let ((_let_5 (forall ((W0 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (= tptp.xy (tptp.sdtasdt0 tptp.xc W0))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 (ALPHA_EQUIV :args (_let_5 (= W0 W0)))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))) :args (2)) :args ((not _let_4) true _let_5)) :args (false true _let_4)) :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)))))))))) (tptp.aElement0 tptp.xc) _let_3 (and (tptp.aElement0 tptp.xu) (= (tptp.sdtasdt0 tptp.xc tptp.xu) tptp.xx)) _let_1 true))))))))
% 0.19/0.50  )
% 0.19/0.50  % SZS output end Proof for RNG102+2
% 0.19/0.50  % cvc5---1.0.5 exiting
% 0.19/0.51  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------