%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : NUM025-2 : TPTP v9.2.1. Bugfixed v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n029.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:23 AM UTC 2026 % Result : Unsatisfiable 0.30s 0.55s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM025-2 : TPTP v9.2.1. Bugfixed v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n029.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:20:02 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.51 --- 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.37/0.55 ( % 0.37/0.55 (declare-sort $$unsorted 0) % 0.37/0.55 (declare-const tptp.a $$unsorted) % 0.37/0.55 (declare-const tptp.greater_or_equalish (-> $$unsorted $$unsorted Bool)) % 0.37/0.55 (declare-const tptp.successor (-> $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.equalish (-> $$unsorted $$unsorted Bool)) % 0.37/0.55 (declare-const tptp.b $$unsorted) % 0.37/0.55 (declare-const tptp.predecessor_of_1st_minus_2nd (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.add (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.n0 $$unsorted) % 0.37/0.55 (define @t1 () (@var "A" $$unsorted)) % 0.37/0.55 (define @t2 () (@list @t1)) % 0.37/0.55 (define @t3 () (@var "B" $$unsorted)) % 0.37/0.55 (define @t4 () (tptp.successor @t3)) % 0.37/0.55 (define @t5 () (@list @t1 @t3)) % 0.37/0.55 (define @t6 () (tptp.equalish @t1 @t3)) % 0.37/0.55 (define @t7 () (tptp.successor @t1)) % 0.37/0.55 (define @t8 () (tptp.equalish @t7 @t4)) % 0.37/0.55 (define @t9 () (@var "X" $$unsorted)) % 0.37/0.55 (define @t10 () (@var "Y" $$unsorted)) % 0.37/0.55 (define @t11 () (not (tptp.equalish @t9 @t10))) % 0.37/0.55 (define @t12 () (@var "Z" $$unsorted)) % 0.37/0.55 (define @t13 () (@var "C" $$unsorted)) % 0.37/0.55 (define @t14 () (tptp.greater_or_equalish @t1 @t3)) % 0.37/0.55 (define @t15 () (@list @t1 @t3 @t13)) % 0.37/0.55 (define @t16 () (forall @t2 (tptp.greater_or_equalish @t1 @t1))) % 0.37/0.55 (define @t17 () (tptp.greater_or_equalish tptp.a tptp.b)) % 0.37/0.55 (define @t18 () (tptp.greater_or_equalish tptp.b tptp.a)) % 0.37/0.55 (define @t19 () (tptp.greater_or_equalish tptp.a tptp.a)) % 0.37/0.55 (define @t20 () (not @t19)) % 0.37/0.55 (define @t21 () (or @t18 @t17 @t20)) % 0.37/0.55 (assume @p1 (forall @t2 (tptp.equalish (tptp.add @t1 tptp.n0) @t1))) % 0.37/0.55 (assume @p2 (forall @t5 (tptp.equalish (tptp.add @t1 @t4) (tptp.successor (tptp.add @t1 @t3))))) % 0.37/0.55 (assume @p3 (forall @t2 (tptp.equalish (tptp.multiply @t1 tptp.n0) tptp.n0))) % 0.37/0.55 (assume @p4 (forall @t5 (tptp.equalish (tptp.multiply @t1 @t4) (tptp.add (tptp.multiply @t1 @t3) @t1)))) % 0.37/0.55 (assume @p5 (forall @t5 (or (not @t8) @t6))) % 0.37/0.55 (assume @p6 (forall @t5 (or (not @t6) @t8))) % 0.37/0.55 (assume @p7 (forall (@list @t9) (tptp.equalish @t9 @t9))) % 0.37/0.55 (assume @p8 (forall (@list @t9 @t10) (or @t11 (tptp.equalish @t10 @t9)))) % 0.37/0.55 (assume @p9 (forall (@list @t9 @t10 @t12) (or @t11 (not (tptp.equalish @t10 @t12)) (tptp.equalish @t9 @t12)))) % 0.37/0.55 (assume @p10 (forall @t15 (or @t14 (tptp.greater_or_equalish @t13 @t1) (not (tptp.greater_or_equalish @t13 @t3))))) % 0.37/0.55 (assume @p11 (forall @t15 (or (not (tptp.equalish (tptp.add @t7 @t3) @t13)) (not (tptp.greater_or_equalish @t3 @t13))))) % 0.37/0.55 (assume @p12 (forall @t5 (or @t14 (tptp.equalish (tptp.add (tptp.successor (tptp.predecessor_of_1st_minus_2nd @t3 @t1)) @t1) @t3)))) % 0.37/0.55 (assume @p13 (forall @t2 (not (tptp.equalish @t7 tptp.n0)))) % 0.37/0.55 (assume @p14 @t16) % 0.37/0.55 (assume @p15 (not @t17)) % 0.37/0.55 (assume @p16 (not @t18)) % 0.37/0.55 (step @p17 :rule instantiate :premises (@p10) :args ((@list tptp.b tptp.a tptp.a))) % 0.37/0.55 (step @p18 :rule cnf_or_pos :args (@t21)) % 0.37/0.55 (step @p19 :rule reordering :premises (@p18) :args ((or @t17 @t18 @t20 (not @t21)))) % 0.37/0.55 (step @p20 :rule chain_m_resolution :premises (@p19 @p15 @p16 @p17) :args (@t20 (@list true true false) (@list @t17 @t18 @t21))) % 0.37/0.55 (assume-push @p27 @t16) % 0.37/0.55 (step @p22 :rule instantiate :premises (@p14) :args ((@list tptp.a))) % 0.37/0.55 (step-pop @p28 :rule scope :premises (@p22)) % 0.37/0.55 (step @p23 :rule process_scope :premises (@p28) :args (@t19)) % 0.37/0.55 (step @p25 :rule implies_elim :premises (@p23)) % 0.37/0.55 (step @p26 false :rule chain_m_resolution :premises (@p25 @p20 @p14) :args (false (@list true false) (@list @t19 @t16))) % 0.37/0.55 ) % 0.37/0.56 % SZS output end Proof % 0.37/0.56 % cvc5 exiting %------------------------------------------------------------------------------