TSTP Solution File: NUM430+3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM430+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n002.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 10:43:51 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM430+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 25 10:51:17 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.53 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.koVDqqKHls/cvc5---1.0.5_18197.p...
% 0.22/0.53 ------- get file name : TPTP file name is NUM430+3
% 0.22/0.53 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_18197.smt2...
% 0.22/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.53 % SZS status Theorem for NUM430+3
% 0.22/0.53 % SZS output start Proof for NUM430+3
% 0.22/0.53 (
% 0.22/0.53 (let ((_let_1 (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) (let ((_let_2 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (let ((_let_3 (and (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (tptp.aDivisorOf0 tptp.xq _let_2) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)))) (let ((_let_4 (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W0))))))) (let ((_let_5 (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) (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 (TRANS (ALPHA_EQUIV :args (_let_5 (= W0 W0))) (MACRO_SR_PRED_INTRO :args ((= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) _let_4) SB_DEFAULT SBA_SEQUENTIAL RW_EXT_REWRITE)))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))) :args (3)) :args ((not _let_4) true _let_5)) :args (false true _let_4)) :args ((forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) true)) (tptp.aInteger0 tptp.sz00) (tptp.aInteger0 tptp.sz10) (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2)) (= (tptp.sdtpldt0 W0 (tptp.sdtpldt0 W1 W2)) (tptp.sdtpldt0 (tptp.sdtpldt0 W0 W1) W2)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W1 W0)))) (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtpldt0 W0 tptp.sz00) W0) (= W0 (tptp.sdtpldt0 tptp.sz00 W0))))) (forall ((W0 $$unsorted)) (let ((_let_1 (tptp.smndt0 W0))) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtpldt0 W0 _let_1) tptp.sz00) (= tptp.sz00 (tptp.sdtpldt0 _let_1 W0)))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2)) (= (tptp.sdtasdt0 W0 (tptp.sdtasdt0 W1 W2)) (tptp.sdtasdt0 (tptp.sdtasdt0 W0 W1) W2)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W1 W0)))) (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 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.sdtasdt0 W0 W2))) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2)) (and (= (tptp.sdtasdt0 W0 (tptp.sdtpldt0 W1 W2)) (tptp.sdtpldt0 (tptp.sdtasdt0 W0 W1) _let_1)) (= (tptp.sdtasdt0 (tptp.sdtpldt0 W0 W1) W2) (tptp.sdtpldt0 _let_1 (tptp.sdtasdt0 W1 W2))))))) (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 W0))))) (forall ((W0 $$unsorted)) (let ((_let_1 (tptp.smndt0 tptp.sz10))) (let ((_let_2 (tptp.smndt0 W0))) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 _let_1 W0) _let_2) (= _let_2 (tptp.sdtasdt0 W0 _let_1))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (=> (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (or (= W0 tptp.sz00) (= W1 tptp.sz00))))) (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (not (= W1 tptp.sz00))) (tptp.sdteqdtlpzmzozddtrp0 W0 W0 W1))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (=> (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.sdteqdtlpzmzozddtrp0 W1 W0 W2)))) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)) (tptp.aInteger0 tptp.xc)) _let_3 (and (tptp.aInteger0 tptp.xn) (= (tptp.sdtasdt0 tptp.xq tptp.xn) _let_2)) _let_1 true))))))))
% 0.22/0.54 )
% 0.22/0.54 % SZS output end Proof for NUM430+3
% 0.22/0.54 % cvc5---1.0.5 exiting
% 0.22/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------