%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : HEN007-2 : TPTP v9.2.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n014.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:22:52 AM UTC 2026 % Result : Unsatisfiable 203.13s 203.33s % Output : Proof 203.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : HEN007-2 : TPTP v9.2.1. Released v1.0.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n014.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 02:15:43 EDT 2026 % 0.16/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 15.32/15.53 --- Run --no-e-matching --full-saturate-quant at 6... % 21.33/21.55 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 6... % 27.32/27.57 --- Run --finite-model-find --uf-ss=no-minimal at 6... % 33.75/33.90 --- Run --multi-trigger-when-single --full-saturate-quant at 30... % 63.73/63.94 --- Run --trigger-sel=max --full-saturate-quant at 15... % 78.74/78.96 --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 33... % 111.74/112.00 --- Run --multi-trigger-cache --full-saturate-quant at 15... % 126.86/127.07 --- Run --prenex-quant=none --full-saturate-quant at 30... % 156.85/157.12 --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 15... % 171.95/172.15 --- Run --relevant-triggers --full-saturate-quant at 30... % 201.95/202.19 --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 15... % 203.13/203.33 % SZS status Unsatisfiable % 203.13/203.33 % SZS output start Proof % 203.13/203.33 ( % 203.13/203.33 (declare-sort $$unsorted 0) % 203.13/203.33 (declare-const tptp.zQx $$unsorted) % 203.13/203.33 (declare-const tptp.zQy $$unsorted) % 203.13/203.33 (declare-const tptp.x $$unsorted) % 203.13/203.33 (declare-const tptp.y $$unsorted) % 203.13/203.33 (declare-const tptp.z $$unsorted) % 203.13/203.33 (declare-const tptp.divide (-> $$unsorted $$unsorted $$unsorted)) % 203.13/203.33 (declare-const tptp.identity $$unsorted) % 203.13/203.33 (declare-const tptp.less_equal (-> $$unsorted $$unsorted Bool)) % 203.13/203.33 (declare-const tptp.quotient (-> $$unsorted $$unsorted $$unsorted Bool)) % 203.13/203.33 (declare-const tptp.zero $$unsorted) % 203.13/203.33 (define @t1 () (@var "Y" $$unsorted)) % 203.13/203.33 (define @t2 () (@var "X" $$unsorted)) % 203.13/203.33 (define @t3 () (tptp.quotient @t2 @t1 tptp.zero)) % 203.13/203.33 (define @t4 () (tptp.less_equal @t2 @t1)) % 203.13/203.33 (define @t5 () (not @t4)) % 203.13/203.33 (define @t6 () (@list @t2 @t1)) % 203.13/203.33 (define @t7 () (@var "Z" $$unsorted)) % 203.13/203.33 (define @t8 () (not (tptp.quotient @t2 @t1 @t7))) % 203.13/203.33 (define @t9 () (@list @t2 @t1 @t7)) % 203.13/203.33 (define @t10 () (@var "V5" $$unsorted)) % 203.13/203.33 (define @t11 () (@var "V4" $$unsorted)) % 203.13/203.33 (define @t12 () (@var "V1" $$unsorted)) % 203.13/203.33 (define @t13 () (@var "V2" $$unsorted)) % 203.13/203.33 (define @t14 () (@var "V3" $$unsorted)) % 203.13/203.33 (define @t15 () (forall (@list @t2 @t1 @t12 @t7 @t13 @t14 @t11 @t10) (or (not (tptp.quotient @t2 @t1 @t12)) (not (tptp.quotient @t1 @t7 @t13)) (not (tptp.quotient @t2 @t7 @t14)) (not (tptp.quotient @t14 @t13 @t11)) (not (tptp.quotient @t12 @t7 @t10)) (tptp.less_equal @t11 @t10)))) % 203.13/203.33 (define @t16 () (@list @t2)) % 203.13/203.33 (define @t17 () (@var "W" $$unsorted)) % 203.13/203.33 (define @t18 () (@var "W2" $$unsorted)) % 203.13/203.33 (define @t19 () (@var "W1" $$unsorted)) % 203.13/203.33 (define @t20 () (tptp.less_equal tptp.x tptp.y)) % 203.13/203.33 (define @t21 () (tptp.quotient tptp.z tptp.y tptp.zQy)) % 203.13/203.33 (define @t22 () (tptp.quotient tptp.z tptp.x tptp.zQx)) % 203.13/203.33 (define @t23 () (tptp.less_equal tptp.zQy tptp.zQx)) % 203.13/203.33 (define @t24 () (tptp.divide tptp.zQx tptp.y)) % 203.13/203.33 (define @t25 () (tptp.less_equal @t24 tptp.zQx)) % 203.13/203.33 (define @t26 () (tptp.quotient tptp.zQx tptp.y @t24)) % 203.13/203.33 (define @t27 () (not @t26)) % 203.13/203.33 (define @t28 () (or @t27 @t25)) % 203.13/203.33 (define @t29 () (@list false false)) % 203.13/203.33 (define @t30 () (not @t25)) % 203.13/203.33 (define @t31 () (tptp.less_equal tptp.zQy @t24)) % 203.13/203.33 (define @t32 () (not @t31)) % 203.13/203.33 (define @t33 () (or @t32 @t30 @t23)) % 203.13/203.33 (define @t34 () (tptp.quotient tptp.x tptp.y tptp.zero)) % 203.13/203.33 (define @t35 () (not @t20)) % 203.13/203.33 (define @t36 () (or @t35 @t34)) % 203.13/203.33 (define @t37 () (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) % 203.13/203.33 (define @t38 () (not @t37)) % 203.13/203.33 (define @t39 () (not @t21)) % 203.13/203.33 (define @t40 () (not @t34)) % 203.13/203.33 (define @t41 () (not @t22)) % 203.13/203.33 (define @t42 () (or @t41 @t40 @t39 @t38 @t27 @t31)) % 203.13/203.33 (define @t43 () (not @t42)) % 203.13/203.33 (assume @p1 (forall @t6 (or @t5 @t3))) % 203.13/203.33 (assume @p2 (forall @t6 (or (not @t3) @t4))) % 203.13/203.33 (assume @p3 (forall @t9 (or @t8 (tptp.less_equal @t7 @t2)))) % 203.13/203.33 (assume @p4 @t15) % 203.13/203.33 (assume @p5 (forall @t16 (tptp.less_equal tptp.zero @t2))) % 203.13/203.33 (assume @p6 (forall @t6 (or @t5 (not (tptp.less_equal @t1 @t2)) (= @t2 @t1)))) % 203.13/203.33 (assume @p7 (forall @t16 (tptp.less_equal @t2 tptp.identity))) % 203.13/203.33 (assume @p8 (forall @t6 (tptp.quotient @t2 @t1 (tptp.divide @t2 @t1)))) % 203.13/203.33 (assume @p9 (forall (@list @t2 @t1 @t7 @t17) (or @t8 (not (tptp.quotient @t2 @t1 @t17)) (= @t7 @t17)))) % 203.13/203.33 (assume @p10 (forall @t16 (tptp.quotient @t2 tptp.identity tptp.zero))) % 203.13/203.33 (assume @p11 (forall @t16 (tptp.quotient tptp.zero @t2 tptp.zero))) % 203.13/203.33 (assume @p12 (forall @t16 (tptp.quotient @t2 @t2 tptp.zero))) % 203.13/203.33 (assume @p13 (forall @t16 (tptp.quotient @t2 tptp.zero @t2))) % 203.13/203.33 (assume @p14 (forall @t9 (or @t5 (not (tptp.less_equal @t1 @t7)) (tptp.less_equal @t2 @t7)))) % 203.13/203.33 (assume @p15 (forall (@list @t2 @t1 @t19 @t7 @t18) (or (not (tptp.quotient @t2 @t1 @t19)) (not (tptp.less_equal @t19 @t7)) (not (tptp.quotient @t2 @t7 @t18)) (tptp.less_equal @t18 @t1)))) % 203.13/203.33 (assume @p16 @t20) % 203.13/203.33 (assume @p17 @t21) % 203.13/203.33 (assume @p18 @t22) % 203.13/203.33 (assume @p19 (not @t23)) % 203.13/203.33 (step @p20 :rule instantiate :premises (@p14) :args ((@list tptp.zQy @t24 tptp.zQx))) % 203.13/203.33 (step @p21 :rule instantiate :premises (@p3) :args ((@list tptp.zQx tptp.y @t24))) % 203.13/203.33 (step @p22 :rule instantiate :premises (@p8) :args ((@list tptp.zQx tptp.y))) % 203.13/203.33 (step @p23 :rule cnf_or_pos :args (@t28)) % 203.13/203.33 (step @p24 :rule reordering :premises (@p23) :args ((or @t27 @t25 (not @t28)))) % 203.13/203.33 (step @p25 :rule chain_m_resolution :premises (@p24 @p22 @p21) :args (@t25 @t29 (@list @t26 @t28))) % 203.13/203.33 (step @p26 :rule cnf_or_pos :args (@t33)) % 203.13/203.33 (step @p27 :rule reordering :premises (@p26) :args ((or @t23 @t30 @t32 (not @t33)))) % 203.13/203.33 (step @p28 :rule chain_m_resolution :premises (@p27 @p19 @p25 @p20) :args (@t32 (@list true false false) (@list @t23 @t25 @t33))) % 203.13/203.33 (step @p29 :rule instantiate :premises (@p13) :args ((@list tptp.zQy))) % 203.13/203.33 (step @p30 :rule instantiate :premises (@p1) :args ((@list tptp.x tptp.y))) % 203.13/203.33 (step @p31 :rule cnf_or_pos :args (@t36)) % 203.13/203.33 (step @p32 :rule reordering :premises (@p31) :args ((or @t35 @t34 (not @t36)))) % 203.13/203.33 (step @p33 :rule chain_m_resolution :premises (@p32 @p16 @p30) :args (@t34 @t29 (@list @t20 @t36))) % 203.13/203.33 (step @p34 :rule cnf_or_pos :args (@t42)) % 203.13/203.33 (step @p35 :rule reordering :premises (@p34) :args ((or @t39 @t41 @t40 @t38 @t27 @t31 @t43))) % 203.13/203.33 (step @p36 :rule chain_m_resolution :premises (@p35 @p17 @p18 @p33 @p29 @p22 @p28) :args (@t43 (@list false false false false false true) (@list @t21 @t22 @t34 @t37 @t26 @t31))) % 203.13/203.33 (assume-push @p43 @t15) % 203.13/203.33 (step @p38 :rule instantiate :premises (@p4) :args ((@list tptp.z tptp.x tptp.zQx tptp.y tptp.zero tptp.zQy tptp.zQy @t24))) % 203.13/203.33 (step-pop @p44 :rule scope :premises (@p38)) % 203.13/203.33 (step @p39 :rule process_scope :premises (@p44) :args (@t42)) % 203.13/203.33 (step @p41 :rule implies_elim :premises (@p39)) % 203.13/203.33 (step @p42 false :rule chain_m_resolution :premises (@p41 @p36 @p4) :args (false (@list true false) (@list @t42 @t15))) % 203.13/203.33 ) % 203.13/203.33 % SZS output end Proof % 203.13/203.33 % cvc5 exiting %------------------------------------------------------------------------------