%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : NUM020-1 : TPTP v9.2.1. Bugfixed 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 : n007.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:38:22 AM UTC 2026 % Result : Unsatisfiable 0.30s 0.55s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM020-1 : TPTP v9.2.1. Bugfixed 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.34 % Computer : n007.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % 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 10:18:41 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.48 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Unsatisfiable % 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.n1 $$unsorted) % 0.30/0.55 (declare-const tptp.successor (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.equalish (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.a $$unsorted) % 0.30/0.55 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.add (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.n0 $$unsorted) % 0.30/0.55 (define @t1 () (@var "A" $$unsorted)) % 0.30/0.55 (define @t2 () (@list @t1)) % 0.30/0.55 (define @t3 () (@var "B" $$unsorted)) % 0.30/0.55 (define @t4 () (tptp.successor @t3)) % 0.30/0.55 (define @t5 () (@list @t1 @t3)) % 0.30/0.55 (define @t6 () (tptp.equalish @t1 @t3)) % 0.30/0.55 (define @t7 () (tptp.successor @t1)) % 0.30/0.55 (define @t8 () (tptp.equalish @t7 @t4)) % 0.30/0.55 (define @t9 () (forall @t5 (or (not @t6) @t8))) % 0.30/0.55 (define @t10 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t11 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t12 () (not (tptp.equalish @t10 @t11))) % 0.30/0.55 (define @t13 () (@var "Z" $$unsorted)) % 0.30/0.55 (define @t14 () (tptp.successor tptp.n0)) % 0.30/0.55 (define @t15 () (tptp.successor tptp.a)) % 0.30/0.55 (define @t16 () (tptp.add tptp.a @t14)) % 0.30/0.55 (define @t17 () (tptp.equalish @t16 @t15)) % 0.30/0.55 (define @t18 () (tptp.add tptp.a tptp.n0)) % 0.30/0.55 (define @t19 () (tptp.successor @t18)) % 0.30/0.55 (define @t20 () (tptp.equalish @t19 @t15)) % 0.30/0.55 (define @t21 () (not @t20)) % 0.30/0.55 (define @t22 () (tptp.equalish @t16 @t19)) % 0.30/0.55 (define @t23 () (not @t22)) % 0.30/0.55 (define @t24 () (or @t23 @t21 @t17)) % 0.30/0.55 (define @t25 () (tptp.equalish @t18 tptp.a)) % 0.30/0.55 (define @t26 () (not @t25)) % 0.30/0.55 (define @t27 () (or @t26 @t20)) % 0.30/0.55 (define @t28 () (not @t27)) % 0.30/0.55 (assume @p1 (forall @t2 (tptp.equalish (tptp.add @t1 tptp.n0) @t1))) % 0.30/0.55 (assume @p2 (forall @t5 (tptp.equalish (tptp.add @t1 @t4) (tptp.successor (tptp.add @t1 @t3))))) % 0.30/0.55 (assume @p3 (forall @t2 (tptp.equalish (tptp.multiply @t1 tptp.n0) tptp.n0))) % 0.30/0.55 (assume @p4 (forall @t5 (tptp.equalish (tptp.multiply @t1 @t4) (tptp.add (tptp.multiply @t1 @t3) @t1)))) % 0.30/0.55 (assume @p5 (forall @t5 (or (not @t8) @t6))) % 0.30/0.55 (assume @p6 @t9) % 0.30/0.55 (assume @p7 (forall (@list @t10) (tptp.equalish @t10 @t10))) % 0.30/0.55 (assume @p8 (forall (@list @t10 @t11) (or @t12 (tptp.equalish @t11 @t10)))) % 0.30/0.55 (assume @p9 (forall (@list @t10 @t11 @t13) (or @t12 (not (tptp.equalish @t11 @t13)) (tptp.equalish @t10 @t13)))) % 0.30/0.55 (assume @p10 (tptp.equalish tptp.n1 @t14)) % 0.30/0.55 (assume @p11 (not @t17)) % 0.30/0.55 (assume @p12 (forall @t2 (not (tptp.equalish @t7 tptp.n0)))) % 0.30/0.55 (step @p13 :rule instantiate :premises (@p9) :args ((@list @t16 @t19 @t15))) % 0.30/0.55 (step @p14 :rule instantiate :premises (@p2) :args ((@list tptp.a tptp.n0))) % 0.30/0.55 (step @p15 :rule cnf_or_pos :args (@t24)) % 0.30/0.55 (step @p16 :rule reordering :premises (@p15) :args ((or @t17 @t23 @t21 (not @t24)))) % 0.30/0.55 (step @p17 :rule chain_m_resolution :premises (@p16 @p11 @p14 @p13) :args (@t21 (@list true false false) (@list @t17 @t22 @t24))) % 0.30/0.55 (step @p18 :rule instantiate :premises (@p1) :args ((@list tptp.a))) % 0.30/0.55 (step @p19 :rule cnf_or_pos :args (@t27)) % 0.30/0.55 (step @p20 :rule reordering :premises (@p19) :args ((or @t26 @t20 @t28))) % 0.30/0.55 (step @p21 :rule chain_m_resolution :premises (@p20 @p18 @p17) :args (@t28 (@list false true) (@list @t25 @t20))) % 0.30/0.55 (assume-push @p28 @t9) % 0.30/0.55 (step @p23 :rule instantiate :premises (@p6) :args ((@list @t18 tptp.a))) % 0.30/0.55 (step-pop @p29 :rule scope :premises (@p23)) % 0.30/0.55 (step @p24 :rule process_scope :premises (@p29) :args (@t27)) % 0.30/0.55 (step @p26 :rule implies_elim :premises (@p24)) % 0.30/0.55 (step @p27 false :rule chain_m_resolution :premises (@p26 @p21 @p6) :args (false (@list true false) (@list @t27 @t9))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------