%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP031-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:39 AM UTC 2026 % Result : Unsatisfiable 0.45s 0.69s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP031-1 : TPTP v9.2.1. Released v1.0.0. % 0.11/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:46 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----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.45/0.69 % SZS status Unsatisfiable % 0.45/0.69 % SZS output start Proof % 0.45/0.69 ( % 0.45/0.69 (declare-sort $$unsorted 0) % 0.45/0.69 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.45/0.69 (declare-const tptp.identity $$unsorted) % 0.45/0.69 (declare-const tptp.product (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.69 (declare-const tptp.a $$unsorted) % 0.45/0.69 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.69 (define @t1 () (@var "Y" $$unsorted)) % 0.45/0.69 (define @t2 () (@var "X" $$unsorted)) % 0.45/0.69 (define @t3 () (@var "W" $$unsorted)) % 0.45/0.69 (define @t4 () (@var "Z" $$unsorted)) % 0.45/0.69 (define @t5 () (forall (@list @t2 @t1 @t4 @t3) (or (not (tptp.product @t2 @t1 @t4)) (not (tptp.product @t2 @t1 @t3)) (= @t4 @t3)))) % 0.45/0.69 (define @t6 () (@var "V" $$unsorted)) % 0.45/0.69 (define @t7 () (tptp.product @t2 @t6 @t3)) % 0.45/0.69 (define @t8 () (@var "U" $$unsorted)) % 0.45/0.69 (define @t9 () (tptp.product @t8 @t4 @t3)) % 0.45/0.69 (define @t10 () (not (tptp.product @t1 @t4 @t6))) % 0.45/0.69 (define @t11 () (not (tptp.product @t2 @t1 @t8))) % 0.45/0.69 (define @t12 () (@list @t2 @t1 @t8 @t4 @t6 @t3)) % 0.45/0.69 (define @t13 () (@var "A" $$unsorted)) % 0.45/0.69 (define @t14 () (@list @t13)) % 0.45/0.69 (define @t15 () (tptp.inverse tptp.a)) % 0.45/0.69 (define @t16 () (tptp.multiply tptp.a tptp.identity)) % 0.45/0.69 (define @t17 () (tptp.multiply tptp.identity tptp.identity)) % 0.45/0.69 (define @t18 () (tptp.inverse @t15)) % 0.45/0.69 (define @t19 () (@list @t15)) % 0.45/0.69 (define @t20 () (tptp.product tptp.a @t15 tptp.identity)) % 0.45/0.69 (define @t21 () (tptp.product @t16 @t15 tptp.identity)) % 0.45/0.69 (define @t22 () (not @t21)) % 0.45/0.69 (define @t23 () (tptp.product tptp.identity @t15 @t15)) % 0.45/0.69 (define @t24 () (not @t23)) % 0.45/0.69 (define @t25 () (tptp.product tptp.a tptp.identity @t16)) % 0.45/0.69 (define @t26 () (not @t25)) % 0.45/0.69 (define @t27 () (or @t26 @t24 @t22 @t20)) % 0.45/0.69 (define @t28 () (@list tptp.a)) % 0.45/0.69 (define @t29 () (tptp.product tptp.identity @t16 @t16)) % 0.45/0.69 (define @t30 () (tptp.product tptp.identity tptp.a tptp.a)) % 0.45/0.69 (define @t31 () (not @t30)) % 0.45/0.69 (define @t32 () (or @t31 @t26 @t26 @t29)) % 0.45/0.69 (define @t33 () (@list false false false)) % 0.45/0.69 (define @t34 () (tptp.product @t15 @t16 @t17)) % 0.45/0.69 (define @t35 () (tptp.product tptp.identity tptp.identity @t17)) % 0.45/0.69 (define @t36 () (not @t35)) % 0.45/0.69 (define @t37 () (tptp.product @t15 tptp.a tptp.identity)) % 0.45/0.69 (define @t38 () (not @t37)) % 0.45/0.69 (define @t39 () (or @t38 @t26 @t36 @t34)) % 0.45/0.69 (define @t40 () (@list false false false false)) % 0.45/0.69 (define @t41 () (tptp.product @t18 @t17 @t16)) % 0.45/0.69 (define @t42 () (not @t29)) % 0.45/0.69 (define @t43 () (not @t34)) % 0.45/0.69 (define @t44 () (tptp.product @t18 @t15 tptp.identity)) % 0.45/0.69 (define @t45 () (not @t44)) % 0.45/0.69 (define @t46 () (or @t45 @t43 @t42 @t41)) % 0.45/0.69 (define @t47 () (not (tptp.product @t17 @t15 @t15))) % 0.45/0.69 (define @t48 () (not @t41)) % 0.45/0.69 (define @t49 () (or @t48 @t47 @t45 @t21)) % 0.45/0.69 (define @t50 () (tptp.product tptp.identity tptp.identity tptp.identity)) % 0.45/0.69 (define @t51 () (not @t50)) % 0.45/0.69 (define @t52 () (or @t36 @t51 (= @t17 tptp.identity))) % 0.45/0.69 (define @t53 () (= tptp.identity @t17)) % 0.45/0.69 (define @t54 () (or @t36 @t51 @t53)) % 0.45/0.69 (assume @p1 (forall (@list @t2 @t1) (tptp.product @t2 @t1 (tptp.multiply @t2 @t1)))) % 0.45/0.69 (assume @p2 @t5) % 0.45/0.69 (assume @p3 (forall @t12 (or @t11 @t10 (not @t9) @t7))) % 0.45/0.69 (assume @p4 (forall @t12 (or @t11 @t10 (not @t7) @t9))) % 0.45/0.69 (assume @p5 (forall @t14 (tptp.product tptp.identity @t13 @t13))) % 0.45/0.69 (assume @p6 (forall @t14 (tptp.product (tptp.inverse @t13) @t13 tptp.identity))) % 0.45/0.69 (assume @p7 (forall @t14 (not (tptp.product tptp.a @t13 tptp.identity)))) % 0.45/0.69 (step @p8 :rule evaluate :args ((= true false))) % 0.45/0.69 (step @p9 :rule instantiate :premises (@p4) :args ((@list @t18 @t17 @t16 @t15 @t15 tptp.identity))) % 0.45/0.69 (step @p10 :rule instantiate :premises (@p3) :args ((@list tptp.a tptp.identity @t16 @t15 @t15 tptp.identity))) % 0.45/0.69 (step @p11 :rule instantiate :premises (@p5) :args (@t19)) % 0.45/0.69 (step @p12 :rule instantiate :premises (@p7) :args (@t19)) % 0.45/0.69 (step @p13 :rule instantiate :premises (@p1) :args ((@list tptp.a tptp.identity))) % 0.45/0.69 (step @p14 :rule cnf_or_pos :args (@t27)) % 0.45/0.69 (step @p15 :rule reordering :premises (@p14) :args ((or @t26 @t20 @t24 @t22 (not @t27)))) % 0.45/0.69 (step @p16 :rule chain_m_resolution :premises (@p15 @p13 @p12 @p11 @p10) :args (@t22 (@list false true false false) (@list @t25 @t20 @t23 @t27))) % 0.45/0.69 (step @p17 :rule instantiate :premises (@p3) :args ((@list @t18 @t15 tptp.identity @t16 @t17 @t16))) % 0.45/0.69 (step @p18 :rule instantiate :premises (@p3) :args ((@list tptp.identity tptp.a tptp.a tptp.identity @t16 @t16))) % 0.45/0.69 (step @p19 :rule instantiate :premises (@p5) :args (@t28)) % 0.45/0.69 (step @p20 :rule cnf_or_pos :args (@t32)) % 0.45/0.69 (step @p21 :rule factoring :premises (@p20)) % 0.45/0.69 (step @p22 :rule reordering :premises (@p21) :args ((or @t31 @t26 @t29 (not @t32)))) % 0.45/0.69 (step @p23 :rule chain_m_resolution :premises (@p22 @p19 @p13 @p18) :args (@t29 @t33 (@list @t30 @t25 @t32))) % 0.45/0.69 (step @p24 :rule instantiate :premises (@p3) :args ((@list @t15 tptp.a tptp.identity tptp.identity @t16 @t17))) % 0.45/0.69 (step @p25 :rule instantiate :premises (@p6) :args (@t28)) % 0.45/0.69 (step @p26 :rule instantiate :premises (@p1) :args ((@list tptp.identity tptp.identity))) % 0.45/0.69 (step @p27 :rule cnf_or_pos :args (@t39)) % 0.45/0.69 (step @p28 :rule reordering :premises (@p27) :args ((or @t36 @t38 @t26 @t34 (not @t39)))) % 0.45/0.69 (step @p29 :rule chain_m_resolution :premises (@p28 @p26 @p25 @p13 @p24) :args (@t34 @t40 (@list @t35 @t37 @t25 @t39))) % 0.45/0.69 (step @p30 :rule instantiate :premises (@p6) :args (@t19)) % 0.45/0.69 (step @p31 :rule cnf_or_pos :args (@t46)) % 0.45/0.69 (step @p32 :rule reordering :premises (@p31) :args ((or @t45 @t43 @t42 @t41 (not @t46)))) % 0.45/0.69 (step @p33 :rule chain_m_resolution :premises (@p32 @p30 @p29 @p23 @p17) :args (@t41 @t40 (@list @t44 @t34 @t29 @t46))) % 0.45/0.69 (step @p34 :rule cnf_or_pos :args (@t49)) % 0.45/0.69 (step @p35 :rule reordering :premises (@p34) :args ((or @t45 @t48 @t21 @t47 (not @t49)))) % 0.45/0.69 (step @p36 :rule chain_m_resolution :premises (@p35 @p30 @p33 @p16 @p9) :args (@t47 (@list false false true false) (@list @t44 @t41 @t21 @t49))) % 0.45/0.69 (step @p37 :rule false_intro :premises (@p36)) % 0.45/0.69 (step @p38 :rule refl :args (@t15)) % 0.45/0.69 (step @p39 :rule eq-symm :args (@t17 tptp.identity)) % 0.45/0.69 (step @p40 :rule refl :args (@t51)) % 0.45/0.69 (step @p41 :rule refl :args (@t36)) % 0.45/0.69 (step @p42 :rule nary_cong :premises (@p41 @p40 @p39) :args (@t52)) % 0.45/0.69 (step @p43 :rule refl :args (@t5)) % 0.45/0.69 (step @p44 :rule cong :premises (@p43 @p42) :args ((=> @t5 @t52))) % 0.45/0.69 (assume-push @p61 @t5) % 0.45/0.69 (step @p46 :rule instantiate :premises (@p2) :args ((@list tptp.identity tptp.identity @t17 tptp.identity))) % 0.45/0.69 (step-pop @p62 :rule scope :premises (@p46)) % 0.45/0.69 (step @p47 :rule process_scope :premises (@p62) :args (@t52)) % 0.45/0.69 (step @p49 :rule eq_resolve :premises (@p47 @p44)) % 0.45/0.69 (step @p50 :rule implies_elim :premises (@p49)) % 0.45/0.69 (step @p51 :rule chain_m_resolution :premises (@p50 @p2) :args (@t54 (@list false) (@list @t5))) % 0.45/0.69 (step @p52 :rule instantiate :premises (@p5) :args ((@list tptp.identity))) % 0.45/0.69 (step @p53 :rule cnf_or_pos :args (@t54)) % 0.45/0.69 (step @p54 :rule reordering :premises (@p53) :args ((or @t51 @t36 @t53 (not @t54)))) % 0.45/0.69 (step @p55 :rule chain_m_resolution :premises (@p54 @p52 @p26 @p51) :args (@t53 @t33 (@list @t50 @t35 @t54))) % 0.45/0.69 (step @p56 :rule cong :premises (@p55 @p38 @p38) :args (@t23)) % 0.45/0.69 (step @p57 :rule true_intro :premises (@p11)) % 0.45/0.69 (step @p58 :rule symm :premises (@p57)) % 0.45/0.69 (step @p59 :rule trans :premises (@p58 @p56 @p37)) % 0.45/0.69 (step @p60 false :rule eq_resolve :premises (@p59 @p8)) % 0.45/0.69 ) % 0.45/0.69 % SZS output end Proof % 0.45/0.69 % cvc5 exiting %------------------------------------------------------------------------------