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