%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP017-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 : n010.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:36 AM UTC 2026 % Result : Unsatisfiable 0.85s 1.12s % Output : Proof 0.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP017-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.18/0.34 % Computer : n010.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue Jun 2 00:39:55 EDT 2026 % 0.18/0.35 % CPUTime : % 0.28/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.28/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.85/1.12 % SZS status Unsatisfiable % 0.85/1.12 % SZS output start Proof % 0.95/1.12 ( % 0.95/1.12 (declare-sort $$unsorted 0) % 0.95/1.12 (declare-const tptp.c $$unsorted) % 0.95/1.12 (declare-const tptp.a $$unsorted) % 0.95/1.12 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.95/1.12 (declare-const tptp.b $$unsorted) % 0.95/1.12 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.95/1.12 (declare-const tptp.product (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.95/1.12 (declare-const tptp.identity $$unsorted) % 0.95/1.12 (define @t1 () (@var "X" $$unsorted)) % 0.95/1.12 (define @t2 () (@list @t1)) % 0.95/1.12 (define @t3 () (tptp.inverse @t1)) % 0.95/1.12 (define @t4 () (@var "Y" $$unsorted)) % 0.95/1.12 (define @t5 () (@var "W" $$unsorted)) % 0.95/1.12 (define @t6 () (@var "Z" $$unsorted)) % 0.95/1.12 (define @t7 () (forall (@list @t1 @t4 @t6 @t5) (or (not (tptp.product @t1 @t4 @t6)) (not (tptp.product @t1 @t4 @t5)) (= @t6 @t5)))) % 0.95/1.12 (define @t8 () (@var "V" $$unsorted)) % 0.95/1.12 (define @t9 () (tptp.product @t1 @t8 @t5)) % 0.95/1.12 (define @t10 () (@var "U" $$unsorted)) % 0.95/1.12 (define @t11 () (tptp.product @t10 @t6 @t5)) % 0.95/1.12 (define @t12 () (not (tptp.product @t4 @t6 @t8))) % 0.95/1.12 (define @t13 () (not (tptp.product @t1 @t4 @t10))) % 0.95/1.12 (define @t14 () (@list @t1 @t4 @t10 @t6 @t8 @t5)) % 0.95/1.12 (define @t15 () (tptp.product tptp.b tptp.a tptp.identity)) % 0.95/1.12 (define @t16 () (tptp.product tptp.a tptp.c tptp.identity)) % 0.95/1.12 (define @t17 () (= tptp.b tptp.c)) % 0.95/1.12 (define @t18 () (tptp.product tptp.identity tptp.c tptp.b)) % 0.95/1.12 (define @t19 () (tptp.product tptp.b tptp.identity tptp.b)) % 0.95/1.12 (define @t20 () (not @t19)) % 0.95/1.12 (define @t21 () (not @t16)) % 0.95/1.12 (define @t22 () (not @t15)) % 0.95/1.12 (define @t23 () (or @t22 @t21 @t20 @t18)) % 0.95/1.12 (define @t24 () (tptp.product tptp.identity tptp.c tptp.c)) % 0.95/1.12 (define @t25 () (not @t24)) % 0.95/1.12 (define @t26 () (not @t18)) % 0.95/1.12 (define @t27 () (or @t26 @t25 @t17)) % 0.95/1.12 (define @t28 () (not @t27)) % 0.95/1.12 (assume @p1 (forall @t2 (tptp.product tptp.identity @t1 @t1))) % 0.95/1.12 (assume @p2 (forall @t2 (tptp.product @t1 tptp.identity @t1))) % 0.95/1.12 (assume @p3 (forall @t2 (tptp.product @t3 @t1 tptp.identity))) % 0.95/1.12 (assume @p4 (forall @t2 (tptp.product @t1 @t3 tptp.identity))) % 0.95/1.12 (assume @p5 (forall (@list @t1 @t4) (tptp.product @t1 @t4 (tptp.multiply @t1 @t4)))) % 0.95/1.12 (assume @p6 @t7) % 0.95/1.12 (assume @p7 (forall @t14 (or @t13 @t12 (not @t11) @t9))) % 0.95/1.12 (assume @p8 (forall @t14 (or @t13 @t12 (not @t9) @t11))) % 0.95/1.12 (assume @p9 (tptp.product tptp.a tptp.b tptp.identity)) % 0.95/1.12 (assume @p10 @t15) % 0.95/1.12 (assume @p11 @t16) % 0.95/1.12 (assume @p12 (tptp.product tptp.c tptp.a tptp.identity)) % 0.95/1.12 (assume @p13 (not @t17)) % 0.95/1.12 (step @p14 :rule instantiate :premises (@p1) :args ((@list tptp.c))) % 0.95/1.12 (step @p15 :rule instantiate :premises (@p8) :args ((@list tptp.b tptp.a tptp.identity tptp.c tptp.identity tptp.b))) % 0.95/1.12 (step @p16 :rule instantiate :premises (@p2) :args ((@list tptp.b))) % 0.95/1.12 (step @p17 :rule cnf_or_pos :args (@t23)) % 0.95/1.12 (step @p18 :rule reordering :premises (@p17) :args ((or @t22 @t21 @t20 @t18 (not @t23)))) % 0.95/1.12 (step @p19 :rule chain_m_resolution :premises (@p18 @p10 @p11 @p16 @p15) :args (@t18 (@list false false false false) (@list @t15 @t16 @t19 @t23))) % 0.95/1.12 (step @p20 :rule cnf_or_pos :args (@t27)) % 0.95/1.12 (step @p21 :rule reordering :premises (@p20) :args ((or @t17 @t26 @t25 @t28))) % 0.95/1.12 (step @p22 :rule chain_m_resolution :premises (@p21 @p13 @p19 @p14) :args (@t28 (@list true false false) (@list @t17 @t18 @t24))) % 0.95/1.12 (assume-push @p29 @t7) % 0.95/1.12 (step @p24 :rule instantiate :premises (@p6) :args ((@list tptp.identity tptp.c tptp.b tptp.c))) % 0.95/1.13 (step-pop @p30 :rule scope :premises (@p24)) % 0.95/1.13 (step @p25 :rule process_scope :premises (@p30) :args (@t27)) % 0.95/1.13 (step @p27 :rule implies_elim :premises (@p25)) % 0.95/1.13 (step @p28 false :rule chain_m_resolution :premises (@p27 @p22 @p6) :args (false (@list true false) (@list @t27 @t7))) % 0.95/1.13 ) % 0.95/1.13 % SZS output end Proof % 0.95/1.13 % cvc5 exiting %------------------------------------------------------------------------------