%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP176-1 : TPTP v9.2.1. Bugfixed v1.2.1. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n008.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:20:06 AM UTC 2026 % Result : Unsatisfiable 0.29s 0.54s % Output : Proof 0.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP176-1 : TPTP v9.2.1. Bugfixed v1.2.1. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.14/0.34 % Computer : n008.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Jun 2 00:54:48 EDT 2026 % 0.14/0.34 % CPUTime : % 0.29/0.48 %----Proving TF0_NAR, FOF, or CNF % 0.29/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.29/0.54 % SZS status Unsatisfiable % 0.29/0.54 % SZS output start Proof % 0.29/0.54 ( % 0.29/0.54 (declare-sort $$unsorted 0) % 0.29/0.54 (declare-const tptp.a $$unsorted) % 0.29/0.54 (declare-const tptp.c $$unsorted) % 0.29/0.54 (declare-const tptp.b $$unsorted) % 0.29/0.54 (declare-const tptp.d $$unsorted) % 0.29/0.54 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.29/0.54 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.29/0.54 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.29/0.54 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.29/0.54 (declare-const tptp.identity $$unsorted) % 0.29/0.54 (define @t1 () (@var "X" $$unsorted)) % 0.29/0.54 (define @t2 () (@list @t1)) % 0.29/0.54 (define @t3 () (@var "Z" $$unsorted)) % 0.29/0.54 (define @t4 () (@var "Y" $$unsorted)) % 0.29/0.54 (define @t5 () (tptp.multiply @t1 @t4)) % 0.29/0.54 (define @t6 () (@list @t1 @t4 @t3)) % 0.29/0.54 (define @t7 () (tptp.greatest_lower_bound @t1 @t4)) % 0.29/0.54 (define @t8 () (@list @t1 @t4)) % 0.29/0.54 (define @t9 () (tptp.least_upper_bound @t1 @t4)) % 0.29/0.54 (define @t10 () (tptp.greatest_lower_bound @t4 @t3)) % 0.29/0.54 (define @t11 () (tptp.least_upper_bound @t4 @t3)) % 0.29/0.54 (define @t12 () (tptp.multiply @t1 @t3)) % 0.29/0.54 (define @t13 () (forall @t6 (= (tptp.multiply @t1 @t11) (tptp.least_upper_bound @t5 @t12)))) % 0.29/0.54 (define @t14 () (tptp.multiply @t3 @t1)) % 0.29/0.54 (define @t15 () (tptp.multiply @t4 @t1)) % 0.29/0.54 (define @t16 () (@list @t4 @t3 @t1)) % 0.29/0.54 (define @t17 () (tptp.multiply tptp.b tptp.d)) % 0.29/0.54 (define @t18 () (tptp.multiply tptp.a tptp.d)) % 0.29/0.54 (define @t19 () (tptp.least_upper_bound (tptp.multiply tptp.c @t18) (tptp.multiply tptp.c @t17))) % 0.29/0.54 (define @t20 () (tptp.multiply (tptp.least_upper_bound tptp.a tptp.b) tptp.d)) % 0.29/0.54 (define @t21 () (tptp.multiply tptp.c @t20)) % 0.29/0.54 (define @t22 () (= @t21 @t19)) % 0.29/0.54 (define @t23 () (tptp.least_upper_bound @t18 @t17)) % 0.29/0.54 (define @t24 () (tptp.multiply tptp.c @t23)) % 0.29/0.54 (define @t25 () (= @t24 @t19)) % 0.29/0.54 (define @t26 () (@list tptp.c @t18 @t17)) % 0.29/0.54 (define @t27 () (= @t19 @t24)) % 0.29/0.54 (define @t28 () (= @t20 @t23)) % 0.29/0.54 (define @t29 () (and @t27 @t28)) % 0.29/0.54 (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1))) % 0.29/0.54 (assume @p2 (forall @t2 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 0.29/0.54 (assume @p3 (forall @t6 (= (tptp.multiply @t5 @t3) (tptp.multiply @t1 (tptp.multiply @t4 @t3))))) % 0.29/0.54 (assume @p4 (forall @t8 (= @t7 (tptp.greatest_lower_bound @t4 @t1)))) % 0.29/0.54 (assume @p5 (forall @t8 (= @t9 (tptp.least_upper_bound @t4 @t1)))) % 0.29/0.54 (assume @p6 (forall @t6 (= (tptp.greatest_lower_bound @t1 @t10) (tptp.greatest_lower_bound @t7 @t3)))) % 0.29/0.54 (assume @p7 (forall @t6 (= (tptp.least_upper_bound @t1 @t11) (tptp.least_upper_bound @t9 @t3)))) % 0.29/0.54 (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 0.29/0.54 (assume @p9 (forall @t2 (= (tptp.greatest_lower_bound @t1 @t1) @t1))) % 0.29/0.54 (assume @p10 (forall @t8 (= (tptp.least_upper_bound @t1 @t7) @t1))) % 0.29/0.54 (assume @p11 (forall @t8 (= (tptp.greatest_lower_bound @t1 @t9) @t1))) % 0.29/0.54 (assume @p12 @t13) % 0.29/0.54 (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t12)))) % 0.29/0.54 (assume @p14 (forall @t16 (= (tptp.multiply @t11 @t1) (tptp.least_upper_bound @t15 @t14)))) % 0.29/0.54 (assume @p15 (forall @t16 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t15 @t14)))) % 0.29/0.54 (assume @p16 (not @t22)) % 0.29/0.54 (step @p17 :rule eq-symm :args (@t24 @t19)) % 0.29/0.54 (step @p18 :rule refl :args (@t13)) % 0.29/0.54 (step @p19 :rule cong :premises (@p18 @p17) :args ((=> @t13 @t25))) % 0.29/0.54 (assume-push @p41 @t13) % 0.29/0.54 (step @p21 :rule instantiate :premises (@p12) :args (@t26)) % 0.29/0.54 (step-pop @p42 :rule scope :premises (@p21)) % 0.29/0.54 (step @p22 :rule process_scope :premises (@p42) :args (@t25)) % 0.29/0.54 (step @p24 :rule eq_resolve :premises (@p22 @p19)) % 0.29/0.54 (step @p25 :rule implies_elim :premises (@p24)) % 0.29/0.54 (step @p26 :rule chain_m_resolution :premises (@p25 @p12) :args (@t27 (@list false) (@list @t13))) % 0.29/0.54 (step @p27 :rule instantiate :premises (@p14) :args ((@list tptp.a tptp.b tptp.d))) % 0.29/0.54 (assume-push @p43 @t27) % 0.29/0.54 (assume-push @p44 @t28) % 0.29/0.54 (step @p21 :rule instantiate :premises (@p12) :args (@t26)) % 0.29/0.54 (step @p30 :rule refl :args (tptp.c)) % 0.29/0.54 (step @p31 :rule cong :premises (@p30 @p27) :args (@t21)) % 0.29/0.54 (step @p32 :rule trans :premises (@p31 @p21)) % 0.29/0.54 (step-pop @p45 :rule scope :premises (@p32)) % 0.29/0.54 (step-pop @p46 :rule scope :premises (@p45)) % 0.29/0.54 (step @p33 :rule process_scope :premises (@p46) :args (@t22)) % 0.29/0.54 (step @p36 :rule implies_elim :premises (@p33)) % 0.29/0.54 (step @p37 :rule cnf_and_neg :args (@t29)) % 0.29/0.54 (step @p38 :rule resolution :premises (@p37 @p36) :args (true @t29)) % 0.29/0.54 (step @p39 :rule reordering :premises (@p38) :args ((or @t22 (not @t27) (not @t28)))) % 0.29/0.54 (step @p40 false :rule chain_m_resolution :premises (@p39 @p27 @p26 @p16) :args (false (@list false false true) (@list @t28 @t27 @t22))) % 0.29/0.54 ) % 0.29/0.55 % SZS output end Proof % 0.29/0.55 % cvc5 exiting %------------------------------------------------------------------------------