%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : NUM430+3 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n028.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 : Wed Jun 3 08:39:23 AM UTC 2026 % Result : Theorem 0.30s 0.55s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM430+3 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.33 % Computer : n028.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 11:18:35 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Theorem % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.xa $$unsorted) % 0.30/0.55 (declare-const tptp.xq $$unsorted) % 0.30/0.55 (declare-const tptp.xc $$unsorted) % 0.30/0.55 (declare-const tptp.xn $$unsorted) % 0.30/0.55 (declare-const tptp.xb $$unsorted) % 0.30/0.55 (declare-const tptp.sdtasdt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.sdtpldt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.smndt0 (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.sz10 $$unsorted) % 0.30/0.55 (declare-const tptp.sdteqdtlpzmzozddtrp0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.sz00 $$unsorted) % 0.30/0.55 (declare-const tptp.aDivisorOf0 (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.aInteger0 (-> $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "W0" $$unsorted)) % 0.30/0.55 (define @t2 () (tptp.aInteger0 @t1)) % 0.30/0.55 (define @t3 () (@list @t1)) % 0.30/0.55 (define @t4 () (tptp.smndt0 @t1)) % 0.30/0.55 (define @t5 () (@var "W1" $$unsorted)) % 0.30/0.55 (define @t6 () (tptp.sdtpldt0 @t1 @t5)) % 0.30/0.55 (define @t7 () (tptp.aInteger0 @t5)) % 0.30/0.55 (define @t8 () (and @t2 @t7)) % 0.30/0.55 (define @t9 () (@list @t1 @t5)) % 0.30/0.55 (define @t10 () (tptp.sdtasdt0 @t1 @t5)) % 0.30/0.55 (define @t11 () (@var "W2" $$unsorted)) % 0.30/0.55 (define @t12 () (tptp.sdtpldt0 @t5 @t11)) % 0.30/0.55 (define @t13 () (tptp.aInteger0 @t11)) % 0.30/0.55 (define @t14 () (and @t2 @t7 @t13)) % 0.30/0.55 (define @t15 () (@list @t1 @t5 @t11)) % 0.30/0.55 (define @t16 () (tptp.sdtasdt0 @t5 @t11)) % 0.30/0.55 (define @t17 () (tptp.sdtasdt0 @t1 @t11)) % 0.30/0.55 (define @t18 () (tptp.smndt0 tptp.sz10)) % 0.30/0.55 (define @t19 () (= @t5 tptp.sz00)) % 0.30/0.55 (define @t20 () (not @t19)) % 0.30/0.55 (define @t21 () (tptp.sdteqdtlpzmzozddtrp0 @t1 @t5 @t11)) % 0.30/0.55 (define @t22 () (and @t2 @t7 @t13 (not (= @t11 tptp.sz00)))) % 0.30/0.55 (define @t23 () (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) % 0.30/0.55 (define @t24 () (tptp.sdtasdt0 tptp.xq @t1)) % 0.30/0.55 (define @t25 () (= @t24 @t23)) % 0.30/0.55 (define @t26 () (and @t2 @t25)) % 0.30/0.55 (define @t27 () (exists @t3 @t26)) % 0.30/0.55 (define @t28 () (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) % 0.30/0.55 (define @t29 () (not @t27)) % 0.30/0.55 (define @t30 () (forall @t3 (not @t26))) % 0.30/0.55 (define @t31 () (not @t30)) % 0.30/0.55 (define @t32 () (forall @t3 (or (not @t2) (not @t25)))) % 0.30/0.55 (assume @p1 (forall @t3 (=> @t2 true))) % 0.30/0.55 (assume @p2 (tptp.aInteger0 tptp.sz00)) % 0.30/0.55 (assume @p3 (tptp.aInteger0 tptp.sz10)) % 0.30/0.55 (assume @p4 (forall @t3 (=> @t2 (tptp.aInteger0 @t4)))) % 0.30/0.55 (assume @p5 (forall @t9 (=> @t8 (tptp.aInteger0 @t6)))) % 0.30/0.55 (assume @p6 (forall @t9 (=> @t8 (tptp.aInteger0 @t10)))) % 0.30/0.55 (assume @p7 (forall @t15 (=> @t14 (= (tptp.sdtpldt0 @t1 @t12) (tptp.sdtpldt0 @t6 @t11))))) % 0.30/0.55 (assume @p8 (forall @t9 (=> @t8 (= @t6 (tptp.sdtpldt0 @t5 @t1))))) % 0.30/0.55 (assume @p9 (forall @t3 (=> @t2 (and (= (tptp.sdtpldt0 @t1 tptp.sz00) @t1) (= @t1 (tptp.sdtpldt0 tptp.sz00 @t1)))))) % 0.30/0.55 (assume @p10 (forall @t3 (=> @t2 (and (= (tptp.sdtpldt0 @t1 @t4) tptp.sz00) (= tptp.sz00 (tptp.sdtpldt0 @t4 @t1)))))) % 0.30/0.55 (assume @p11 (forall @t15 (=> @t14 (= (tptp.sdtasdt0 @t1 @t16) (tptp.sdtasdt0 @t10 @t11))))) % 0.30/0.55 (assume @p12 (forall @t9 (=> @t8 (= @t10 (tptp.sdtasdt0 @t5 @t1))))) % 0.30/0.55 (assume @p13 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t1 tptp.sz10) @t1) (= @t1 (tptp.sdtasdt0 tptp.sz10 @t1)))))) % 0.30/0.55 (assume @p14 (forall @t15 (=> @t14 (and (= (tptp.sdtasdt0 @t1 @t12) (tptp.sdtpldt0 @t10 @t17)) (= (tptp.sdtasdt0 @t6 @t11) (tptp.sdtpldt0 @t17 @t16)))))) % 0.30/0.55 (assume @p15 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t1 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 @t1)))))) % 0.30/0.55 (assume @p16 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t18 @t1) @t4) (= @t4 (tptp.sdtasdt0 @t1 @t18)))))) % 0.30/0.55 (assume @p17 (forall @t9 (=> @t8 (=> (= @t10 tptp.sz00) (or (= @t1 tptp.sz00) @t19))))) % 0.30/0.55 (assume @p18 (forall @t3 (=> @t2 (forall (@list @t5) (= (tptp.aDivisorOf0 @t5 @t1) (and @t7 @t20 (exists (@list @t11) (and @t13 (= @t16 @t1))))))))) % 0.30/0.55 (assume @p19 (forall @t15 (=> @t22 (= @t21 (tptp.aDivisorOf0 @t11 (tptp.sdtpldt0 @t1 (tptp.smndt0 @t5))))))) % 0.30/0.55 (assume @p20 (forall @t9 (=> (and @t2 @t7 @t20) (tptp.sdteqdtlpzmzozddtrp0 @t1 @t1 @t5)))) % 0.30/0.55 (assume @p21 (forall @t15 (=> @t22 (=> @t21 (tptp.sdteqdtlpzmzozddtrp0 @t5 @t1 @t11))))) % 0.30/0.55 (assume @p22 (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)) (tptp.aInteger0 tptp.xc))) % 0.30/0.55 (assume @p23 (and (exists @t3 (and @t2 (= @t24 @t28))) (tptp.aDivisorOf0 tptp.xq @t28) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) @t27 (tptp.aDivisorOf0 tptp.xq @t23) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq))) % 0.30/0.55 (assume @p24 (and (tptp.aInteger0 tptp.xn) (= (tptp.sdtasdt0 tptp.xq tptp.xn) @t28))) % 0.30/0.55 (assume @p25 @t29) % 0.30/0.55 (assume @p26 true) % 0.30/0.55 (step @p27 :rule bool-and-de-morgan :args (@t2 @t25 true)) % 0.30/0.55 (step @p28 :rule cong :premises (@p27) :args (@t30)) % 0.30/0.55 (step @p29 :rule cong :premises (@p28) :args (@t31)) % 0.30/0.55 (step @p30 :rule exists-elim :args ((= @t27 @t31))) % 0.30/0.55 (step @p31 :rule trans :premises (@p30 @p29)) % 0.30/0.55 (step @p32 :rule and_elim :premises (@p23) :args (3)) % 0.30/0.55 (step @p33 :rule eq_resolve :premises (@p32 @p31)) % 0.30/0.55 (step @p34 :rule bool-double-not-elim :args (@t32)) % 0.30/0.55 (step @p35 :rule cong :premises (@p31) :args (@t29)) % 0.30/0.55 (step @p36 :rule trans :premises (@p35 @p34)) % 0.30/0.55 (step @p37 :rule eq_resolve :premises (@p25 @p36)) % 0.30/0.55 (step @p38 false :rule chain_m_resolution :premises (@p37 @p33) :args (false (@list true) (@list @t32))) % 0.36/0.55 ) % 0.36/0.55 % SZS output end Proof % 0.36/0.55 % cvc5 exiting %------------------------------------------------------------------------------