%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP029-1 : TPTP v9.2.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n017.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:19:38 AM UTC 2026 % Result : Unsatisfiable 0.40s 0.58s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP029-1 : TPTP v9.2.1. Released v1.0.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 : n017.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 : Tue Jun 2 00:39:31 EDT 2026 % 0.17/0.34 % CPUTime : % 0.31/0.48 %----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... % 0.40/0.58 % SZS status Unsatisfiable % 0.40/0.58 % SZS output start Proof % 0.40/0.58 ( % 0.40/0.58 (declare-sort $$unsorted 0) % 0.40/0.58 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.40/0.58 (declare-const tptp.identity $$unsorted) % 0.40/0.58 (declare-const tptp.product (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.not_right_identity (-> $$unsorted $$unsorted)) % 0.40/0.58 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.58 (define @t1 () (@var "Y" $$unsorted)) % 0.40/0.58 (define @t2 () (@var "X" $$unsorted)) % 0.40/0.58 (define @t3 () (@var "W" $$unsorted)) % 0.40/0.58 (define @t4 () (@var "Z" $$unsorted)) % 0.40/0.58 (define @t5 () (forall (@list @t2 @t1 @t4 @t3) (or (not (tptp.product @t2 @t1 @t4)) (not (tptp.product @t2 @t1 @t3)) (= @t4 @t3)))) % 0.40/0.58 (define @t6 () (@var "V" $$unsorted)) % 0.40/0.58 (define @t7 () (tptp.product @t2 @t6 @t3)) % 0.40/0.58 (define @t8 () (@var "U" $$unsorted)) % 0.40/0.58 (define @t9 () (tptp.product @t8 @t4 @t3)) % 0.40/0.58 (define @t10 () (not (tptp.product @t1 @t4 @t6))) % 0.40/0.58 (define @t11 () (not (tptp.product @t2 @t1 @t8))) % 0.40/0.58 (define @t12 () (@list @t2 @t1 @t8 @t4 @t6 @t3)) % 0.40/0.58 (define @t13 () (@var "A" $$unsorted)) % 0.40/0.58 (define @t14 () (@list @t13)) % 0.40/0.58 (define @t15 () (tptp.not_right_identity @t13)) % 0.40/0.58 (define @t16 () (tptp.not_right_identity tptp.identity)) % 0.40/0.58 (define @t17 () (tptp.multiply tptp.identity tptp.identity)) % 0.40/0.58 (define @t18 () (tptp.inverse @t16)) % 0.40/0.58 (define @t19 () (tptp.inverse @t18)) % 0.40/0.58 (define @t20 () (@list @t16)) % 0.40/0.58 (define @t21 () (tptp.product @t19 tptp.identity @t16)) % 0.40/0.58 (define @t22 () (tptp.product tptp.identity @t16 @t16)) % 0.40/0.58 (define @t23 () (not @t22)) % 0.40/0.58 (define @t24 () (tptp.product @t18 @t16 tptp.identity)) % 0.40/0.58 (define @t25 () (not @t24)) % 0.40/0.58 (define @t26 () (tptp.product @t19 @t18 tptp.identity)) % 0.40/0.58 (define @t27 () (not @t26)) % 0.40/0.58 (define @t28 () (or @t27 @t25 @t23 @t21)) % 0.40/0.58 (define @t29 () (@list tptp.identity)) % 0.40/0.58 (define @t30 () (tptp.product @t16 tptp.identity @t16)) % 0.40/0.58 (define @t31 () (not (tptp.product @t19 @t17 @t16))) % 0.40/0.58 (define @t32 () (tptp.product tptp.identity tptp.identity @t17)) % 0.40/0.58 (define @t33 () (not @t32)) % 0.40/0.58 (define @t34 () (not @t21)) % 0.40/0.58 (define @t35 () (or @t34 @t33 @t31 @t30)) % 0.40/0.58 (define @t36 () (tptp.product tptp.identity tptp.identity tptp.identity)) % 0.40/0.58 (define @t37 () (not @t36)) % 0.40/0.58 (define @t38 () (or @t33 @t37 (= @t17 tptp.identity))) % 0.40/0.58 (define @t39 () (= tptp.identity @t17)) % 0.40/0.58 (define @t40 () (or @t33 @t37 @t39)) % 0.40/0.58 (assume @p1 (forall (@list @t2 @t1) (tptp.product @t2 @t1 (tptp.multiply @t2 @t1)))) % 0.40/0.58 (assume @p2 @t5) % 0.40/0.58 (assume @p3 (forall @t12 (or @t11 @t10 (not @t9) @t7))) % 0.40/0.58 (assume @p4 (forall @t12 (or @t11 @t10 (not @t7) @t9))) % 0.40/0.58 (assume @p5 (forall @t14 (tptp.product tptp.identity @t13 @t13))) % 0.40/0.58 (assume @p6 (forall @t14 (tptp.product (tptp.inverse @t13) @t13 tptp.identity))) % 0.40/0.58 (assume @p7 (forall @t14 (not (tptp.product @t15 @t13 @t15)))) % 0.40/0.58 (step @p8 :rule evaluate :args ((= true false))) % 0.40/0.58 (step @p9 :rule instantiate :premises (@p4) :args ((@list @t19 tptp.identity @t16 tptp.identity @t17 @t16))) % 0.40/0.58 (step @p10 :rule instantiate :premises (@p3) :args ((@list @t19 @t18 tptp.identity @t16 tptp.identity @t16))) % 0.40/0.58 (step @p11 :rule instantiate :premises (@p6) :args ((@list @t18))) % 0.40/0.58 (step @p12 :rule instantiate :premises (@p6) :args (@t20)) % 0.40/0.58 (step @p13 :rule instantiate :premises (@p5) :args (@t20)) % 0.40/0.58 (step @p14 :rule cnf_or_pos :args (@t28)) % 0.40/0.59 (step @p15 :rule reordering :premises (@p14) :args ((or @t23 @t25 @t27 @t21 (not @t28)))) % 0.40/0.59 (step @p16 :rule chain_m_resolution :premises (@p15 @p13 @p12 @p11 @p10) :args (@t21 (@list false false false false) (@list @t22 @t24 @t26 @t28))) % 0.40/0.59 (step @p17 :rule instantiate :premises (@p1) :args ((@list tptp.identity tptp.identity))) % 0.40/0.59 (step @p18 :rule instantiate :premises (@p7) :args (@t29)) % 0.40/0.59 (step @p19 :rule cnf_or_pos :args (@t35)) % 0.40/0.59 (step @p20 :rule reordering :premises (@p19) :args ((or @t30 @t33 @t34 @t31 (not @t35)))) % 0.40/0.59 (step @p21 :rule chain_m_resolution :premises (@p20 @p18 @p17 @p16 @p9) :args (@t31 (@list true false false false) (@list @t30 @t32 @t21 @t35))) % 0.40/0.59 (step @p22 :rule false_intro :premises (@p21)) % 0.40/0.59 (step @p23 :rule refl :args (@t16)) % 0.40/0.59 (step @p24 :rule eq-symm :args (@t17 tptp.identity)) % 0.40/0.59 (step @p25 :rule refl :args (@t37)) % 0.40/0.59 (step @p26 :rule refl :args (@t33)) % 0.40/0.59 (step @p27 :rule nary_cong :premises (@p26 @p25 @p24) :args (@t38)) % 0.40/0.59 (step @p28 :rule refl :args (@t5)) % 0.40/0.59 (step @p29 :rule cong :premises (@p28 @p27) :args ((=> @t5 @t38))) % 0.40/0.59 (assume-push @p47 @t5) % 0.40/0.59 (step @p31 :rule instantiate :premises (@p2) :args ((@list tptp.identity tptp.identity @t17 tptp.identity))) % 0.40/0.59 (step-pop @p48 :rule scope :premises (@p31)) % 0.40/0.59 (step @p32 :rule process_scope :premises (@p48) :args (@t38)) % 0.40/0.59 (step @p34 :rule eq_resolve :premises (@p32 @p29)) % 0.40/0.59 (step @p35 :rule implies_elim :premises (@p34)) % 0.40/0.59 (step @p36 :rule chain_m_resolution :premises (@p35 @p2) :args (@t40 (@list false) (@list @t5))) % 0.40/0.59 (step @p37 :rule instantiate :premises (@p5) :args (@t29)) % 0.40/0.59 (step @p38 :rule cnf_or_pos :args (@t40)) % 0.40/0.59 (step @p39 :rule reordering :premises (@p38) :args ((or @t37 @t33 @t39 (not @t40)))) % 0.40/0.59 (step @p40 :rule chain_m_resolution :premises (@p39 @p37 @p17 @p36) :args (@t39 (@list false false false) (@list @t36 @t32 @t40))) % 0.40/0.59 (step @p41 :rule refl :args (@t19)) % 0.40/0.59 (step @p42 :rule cong :premises (@p41 @p40 @p23) :args (@t21)) % 0.40/0.59 (step @p43 :rule true_intro :premises (@p16)) % 0.40/0.59 (step @p44 :rule symm :premises (@p43)) % 0.40/0.59 (step @p45 :rule trans :premises (@p44 @p42 @p22)) % 0.40/0.59 (step @p46 false :rule eq_resolve :premises (@p45 @p8)) % 0.40/0.59 ) % 0.40/0.59 % SZS output end Proof % 0.40/0.59 % cvc5 exiting %------------------------------------------------------------------------------