%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : FLD030-2 : TPTP v9.2.1. Bugfixed v2.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n016.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:15:26 AM UTC 2026 % Result : Unsatisfiable 0.72s 0.91s % Output : Proof 0.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : FLD030-2 : TPTP v9.2.1. Bugfixed v2.1.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n016.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Mon Jun 1 22:35:54 EDT 2026 % 0.17/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.72/0.91 % SZS status Unsatisfiable % 0.72/0.91 % SZS output start Proof % 0.72/0.91 ( % 0.72/0.91 (declare-sort $$unsorted 0) % 0.72/0.91 (declare-const tptp.d $$unsorted) % 0.72/0.91 (declare-const tptp.c $$unsorted) % 0.72/0.91 (declare-const tptp.multiplicative_inverse (-> $$unsorted $$unsorted)) % 0.72/0.91 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.72/0.91 (declare-const tptp.additive_inverse (-> $$unsorted $$unsorted)) % 0.72/0.91 (declare-const tptp.a $$unsorted) % 0.72/0.91 (declare-const tptp.less_or_equal (-> $$unsorted $$unsorted Bool)) % 0.72/0.91 (declare-const tptp.equalish (-> $$unsorted $$unsorted Bool)) % 0.72/0.91 (declare-const tptp.add (-> $$unsorted $$unsorted $$unsorted)) % 0.72/0.91 (declare-const tptp.b $$unsorted) % 0.72/0.91 (declare-const tptp.multiplicative_identity $$unsorted) % 0.72/0.91 (declare-const tptp.additive_identity $$unsorted) % 0.72/0.91 (declare-const tptp.defined (-> $$unsorted Bool)) % 0.72/0.91 (define @t1 () (@var "Z" $$unsorted)) % 0.72/0.91 (define @t2 () (not (tptp.defined @t1))) % 0.72/0.91 (define @t3 () (@var "Y" $$unsorted)) % 0.72/0.91 (define @t4 () (not (tptp.defined @t3))) % 0.72/0.91 (define @t5 () (@var "X" $$unsorted)) % 0.72/0.91 (define @t6 () (not (tptp.defined @t5))) % 0.72/0.91 (define @t7 () (tptp.add @t5 @t3)) % 0.72/0.91 (define @t8 () (tptp.add @t3 @t1)) % 0.72/0.91 (define @t9 () (@list @t5 @t3 @t1)) % 0.72/0.91 (define @t10 () (@list @t5)) % 0.72/0.91 (define @t11 () (tptp.additive_inverse @t5)) % 0.72/0.91 (define @t12 () (@list @t5 @t3)) % 0.72/0.91 (define @t13 () (tptp.multiply @t5 @t3)) % 0.72/0.91 (define @t14 () (tptp.multiply @t3 @t1)) % 0.72/0.91 (define @t15 () (tptp.equalish @t5 tptp.additive_identity)) % 0.72/0.91 (define @t16 () (tptp.multiplicative_inverse @t5)) % 0.72/0.91 (define @t17 () (tptp.multiply @t5 @t1)) % 0.72/0.91 (define @t18 () (@list @t5 @t1 @t3)) % 0.72/0.91 (define @t19 () (tptp.less_or_equal @t3 @t5)) % 0.72/0.91 (define @t20 () (tptp.less_or_equal @t5 @t3)) % 0.72/0.91 (define @t21 () (not @t20)) % 0.72/0.91 (define @t22 () (tptp.equalish @t5 @t3)) % 0.72/0.91 (define @t23 () (tptp.less_or_equal @t3 @t1)) % 0.72/0.91 (define @t24 () (tptp.less_or_equal @t5 @t1)) % 0.72/0.91 (define @t25 () (tptp.add @t5 @t1)) % 0.72/0.91 (define @t26 () (not @t22)) % 0.72/0.91 (define @t27 () (forall @t18 (or (tptp.equalish @t17 @t14) @t2 @t26))) % 0.72/0.91 (define @t28 () (tptp.defined tptp.b)) % 0.72/0.91 (define @t29 () (tptp.multiply tptp.a tptp.b)) % 0.72/0.91 (define @t30 () (tptp.equalish @t29 tptp.c)) % 0.72/0.91 (define @t31 () (tptp.equalish tptp.a tptp.d)) % 0.72/0.91 (define @t32 () (tptp.multiply tptp.d tptp.b)) % 0.72/0.91 (define @t33 () (tptp.equalish @t32 tptp.c)) % 0.72/0.91 (define @t34 () (not @t30)) % 0.72/0.91 (define @t35 () (tptp.equalish tptp.c @t29)) % 0.72/0.91 (define @t36 () (or @t35 @t34)) % 0.72/0.91 (define @t37 () (tptp.equalish tptp.c @t32)) % 0.72/0.91 (define @t38 () (not @t37)) % 0.72/0.91 (define @t39 () (or @t33 @t38)) % 0.72/0.91 (define @t40 () (@list true false)) % 0.72/0.91 (define @t41 () (tptp.equalish @t29 @t32)) % 0.72/0.91 (define @t42 () (not @t41)) % 0.72/0.91 (define @t43 () (not @t35)) % 0.72/0.91 (define @t44 () (or @t37 @t43 @t42)) % 0.72/0.91 (define @t45 () (not @t31)) % 0.72/0.91 (define @t46 () (not @t28)) % 0.72/0.91 (define @t47 () (or @t41 @t46 @t45)) % 0.72/0.91 (define @t48 () (not @t47)) % 0.72/0.91 (assume @p1 (forall @t9 (or (tptp.equalish (tptp.add @t5 @t8) (tptp.add @t7 @t1)) @t6 @t4 @t2))) % 0.72/0.91 (assume @p2 (forall @t10 (or (tptp.equalish (tptp.add tptp.additive_identity @t5) @t5) @t6))) % 0.72/0.91 (assume @p3 (forall @t10 (or (tptp.equalish (tptp.add @t5 @t11) tptp.additive_identity) @t6))) % 0.72/0.91 (assume @p4 (forall @t12 (or (tptp.equalish @t7 (tptp.add @t3 @t5)) @t6 @t4))) % 0.72/0.91 (assume @p5 (forall @t9 (or (tptp.equalish (tptp.multiply @t5 @t14) (tptp.multiply @t13 @t1)) @t6 @t4 @t2))) % 0.72/0.91 (assume @p6 (forall @t10 (or (tptp.equalish (tptp.multiply tptp.multiplicative_identity @t5) @t5) @t6))) % 0.72/0.91 (assume @p7 (forall @t10 (or (tptp.equalish (tptp.multiply @t5 @t16) tptp.multiplicative_identity) @t6 @t15))) % 0.72/0.91 (assume @p8 (forall @t12 (or (tptp.equalish @t13 (tptp.multiply @t3 @t5)) @t6 @t4))) % 0.72/0.91 (assume @p9 (forall @t18 (or (tptp.equalish (tptp.add @t17 @t14) (tptp.multiply @t7 @t1)) @t6 @t4 @t2))) % 0.72/0.91 (assume @p10 (forall @t12 (or (tptp.defined @t7) @t6 @t4))) % 0.72/0.91 (assume @p11 (tptp.defined tptp.additive_identity)) % 0.72/0.91 (assume @p12 (forall @t10 (or (tptp.defined @t11) @t6))) % 0.72/0.91 (assume @p13 (forall @t12 (or (tptp.defined @t13) @t6 @t4))) % 0.72/0.91 (assume @p14 (tptp.defined tptp.multiplicative_identity)) % 0.72/0.91 (assume @p15 (forall @t10 (or (tptp.defined @t16) @t6 @t15))) % 0.72/0.91 (assume @p16 (forall @t12 (or @t22 @t21 (not @t19)))) % 0.72/0.91 (assume @p17 (forall @t18 (or @t24 @t21 (not @t23)))) % 0.72/0.91 (assume @p18 (forall @t12 (or @t20 @t19 @t6 @t4))) % 0.72/0.91 (assume @p19 (forall @t18 (or (tptp.less_or_equal @t25 @t8) @t2 @t21))) % 0.72/0.91 (assume @p20 (forall (@list @t3 @t1) (or (tptp.less_or_equal tptp.additive_identity @t14) (not (tptp.less_or_equal tptp.additive_identity @t3)) (not (tptp.less_or_equal tptp.additive_identity @t1))))) % 0.72/0.91 (assume @p21 (forall @t10 (or (tptp.equalish @t5 @t5) @t6))) % 0.72/0.91 (assume @p22 (forall @t12 (or @t22 (not (tptp.equalish @t3 @t5))))) % 0.72/0.91 (assume @p23 (forall @t18 (or (tptp.equalish @t5 @t1) @t26 (not (tptp.equalish @t3 @t1))))) % 0.72/0.91 (assume @p24 (forall @t18 (or (tptp.equalish @t25 @t8) @t2 @t26))) % 0.72/0.91 (assume @p25 @t27) % 0.72/0.91 (assume @p26 (forall (@list @t3 @t1 @t5) (or @t23 (not @t24) @t26))) % 0.72/0.91 (assume @p27 (not (tptp.equalish tptp.additive_identity tptp.multiplicative_identity))) % 0.72/0.91 (assume @p28 (tptp.defined tptp.a)) % 0.72/0.91 (assume @p29 @t28) % 0.72/0.91 (assume @p30 (tptp.defined tptp.c)) % 0.72/0.91 (assume @p31 (tptp.defined tptp.d)) % 0.72/0.91 (assume @p32 @t30) % 0.72/0.91 (assume @p33 @t31) % 0.72/0.91 (assume @p34 (not @t33)) % 0.72/0.91 (step @p35 :rule instantiate :premises (@p23) :args ((@list tptp.c @t32 @t29))) % 0.72/0.91 (step @p36 :rule instantiate :premises (@p22) :args ((@list tptp.c @t29))) % 0.72/0.91 (step @p37 :rule cnf_or_pos :args (@t36)) % 0.72/0.91 (step @p38 :rule reordering :premises (@p37) :args ((or @t34 @t35 (not @t36)))) % 0.72/0.91 (step @p39 :rule chain_m_resolution :premises (@p38 @p32 @p36) :args (@t35 (@list false false) (@list @t30 @t36))) % 0.72/0.91 (step @p40 :rule instantiate :premises (@p22) :args ((@list @t32 tptp.c))) % 0.72/0.91 (step @p41 :rule cnf_or_pos :args (@t39)) % 0.72/0.91 (step @p42 :rule reordering :premises (@p41) :args ((or @t33 @t38 (not @t39)))) % 0.72/0.91 (step @p43 :rule chain_m_resolution :premises (@p42 @p34 @p40) :args (@t38 @t40 (@list @t33 @t39))) % 0.72/0.91 (step @p44 :rule cnf_or_pos :args (@t44)) % 0.72/0.91 (step @p45 :rule reordering :premises (@p44) :args ((or @t37 @t43 @t42 (not @t44)))) % 0.72/0.91 (step @p46 :rule chain_m_resolution :premises (@p45 @p43 @p39 @p35) :args (@t42 (@list true false false) (@list @t37 @t35 @t44))) % 0.72/0.91 (step @p47 :rule cnf_or_pos :args (@t47)) % 0.72/0.91 (step @p48 :rule reordering :premises (@p47) :args ((or @t46 @t45 @t41 @t48))) % 0.72/0.91 (step @p49 :rule chain_m_resolution :premises (@p48 @p29 @p33 @p46) :args (@t48 (@list false false true) (@list @t28 @t31 @t41))) % 0.72/0.91 (assume-push @p56 @t27) % 0.72/0.91 (step @p51 :rule instantiate :premises (@p25) :args ((@list tptp.a tptp.b tptp.d))) % 0.72/0.91 (step-pop @p57 :rule scope :premises (@p51)) % 0.72/0.91 (step @p52 :rule process_scope :premises (@p57) :args (@t47)) % 0.72/0.91 (step @p54 :rule implies_elim :premises (@p52)) % 0.72/0.91 (step @p55 false :rule chain_m_resolution :premises (@p54 @p49 @p25) :args (false @t40 (@list @t47 @t27))) % 0.72/0.91 ) % 0.72/0.92 % SZS output end Proof % 0.72/0.92 % cvc5 exiting %------------------------------------------------------------------------------