%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP156-1 : 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 : n023.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:02 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 : GRP156-1 : TPTP v9.2.1. Bugfixed v1.2.1. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.15/0.34 % Computer : n023.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue Jun 2 00:54:58 EDT 2026 % 0.15/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.c $$unsorted) % 0.29/0.54 (declare-const tptp.a $$unsorted) % 0.29/0.54 (declare-const tptp.b $$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.greatest_lower_bound @t1 @t9)) % 0.29/0.54 (define @t13 () (forall @t8 (= @t12 @t1))) % 0.29/0.54 (define @t14 () (tptp.multiply @t1 @t3)) % 0.29/0.54 (define @t15 () (tptp.multiply @t3 @t1)) % 0.29/0.54 (define @t16 () (tptp.multiply @t4 @t1)) % 0.29/0.54 (define @t17 () (@list @t4 @t3 @t1)) % 0.29/0.54 (define @t18 () (forall @t17 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t16 @t15)))) % 0.29/0.54 (define @t19 () (tptp.least_upper_bound tptp.a tptp.b)) % 0.29/0.54 (define @t20 () (tptp.multiply tptp.a tptp.c)) % 0.29/0.54 (define @t21 () (tptp.greatest_lower_bound @t20 (tptp.multiply tptp.b tptp.c))) % 0.29/0.54 (define @t22 () (tptp.multiply (tptp.greatest_lower_bound tptp.a tptp.b) tptp.c)) % 0.29/0.54 (define @t23 () (= @t22 @t21)) % 0.29/0.54 (define @t24 () (@list tptp.a tptp.b tptp.c)) % 0.29/0.54 (define @t25 () (= @t21 @t22)) % 0.29/0.54 (define @t26 () (= tptp.b @t19)) % 0.29/0.54 (define @t27 () (tptp.greatest_lower_bound tptp.a @t19)) % 0.29/0.54 (define @t28 () (= tptp.a @t27)) % 0.29/0.54 (define @t29 () (= @t20 @t21)) % 0.29/0.54 (define @t30 () (and @t26 @t28 @t25)) % 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 @t13) % 0.29/0.54 (assume @p12 (forall @t6 (= (tptp.multiply @t1 @t11) (tptp.least_upper_bound @t5 @t14)))) % 0.29/0.54 (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t14)))) % 0.29/0.54 (assume @p14 (forall @t17 (= (tptp.multiply @t11 @t1) (tptp.least_upper_bound @t16 @t15)))) % 0.29/0.54 (assume @p15 @t18) % 0.29/0.54 (assume @p16 (= @t19 tptp.b)) % 0.29/0.54 (assume @p17 (not (= @t21 @t20))) % 0.29/0.54 (step @p18 :rule symm :premises (@p16)) % 0.29/0.54 (step @p19 :rule symm :premises (@p17)) % 0.29/0.54 (step @p20 :rule eq-symm :args (@t12 @t1)) % 0.29/0.54 (step @p21 :rule cong :premises (@p20) :args (@t13)) % 0.29/0.54 (step @p22 :rule eq_resolve :premises (@p11 @p21)) % 0.29/0.54 (step @p23 :rule instantiate :premises (@p22) :args ((@list tptp.a tptp.b))) % 0.29/0.54 (step @p24 :rule eq-symm :args (@t22 @t21)) % 0.29/0.54 (step @p25 :rule refl :args (@t18)) % 0.29/0.54 (step @p26 :rule cong :premises (@p25 @p24) :args ((=> @t18 @t23))) % 0.29/0.54 (assume-push @p52 @t18) % 0.29/0.54 (step @p28 :rule instantiate :premises (@p15) :args (@t24)) % 0.29/0.54 (step-pop @p53 :rule scope :premises (@p28)) % 0.29/0.54 (step @p29 :rule process_scope :premises (@p53) :args (@t23)) % 0.29/0.54 (step @p31 :rule eq_resolve :premises (@p29 @p26)) % 0.29/0.54 (step @p32 :rule implies_elim :premises (@p31)) % 0.29/0.54 (step @p33 :rule chain_m_resolution :premises (@p32 @p15) :args (@t25 (@list false) (@list @t18))) % 0.29/0.54 (assume-push @p54 @t26) % 0.29/0.54 (assume-push @p55 @t28) % 0.29/0.54 (assume-push @p56 @t25) % 0.29/0.54 (step @p28 :rule instantiate :premises (@p15) :args (@t24)) % 0.29/0.54 (step @p37 :rule refl :args (tptp.c)) % 0.29/0.54 (step @p38 :rule refl :args (tptp.a)) % 0.29/0.54 (step @p39 :rule cong :premises (@p38 @p16) :args (@t27)) % 0.29/0.54 (step @p40 :rule trans :premises (@p23 @p39)) % 0.29/0.54 (step @p41 :rule cong :premises (@p40 @p37) :args (@t20)) % 0.29/0.54 (step @p42 :rule trans :premises (@p41 @p28)) % 0.29/0.54 (step-pop @p57 :rule scope :premises (@p42)) % 0.29/0.54 (step-pop @p58 :rule scope :premises (@p57)) % 0.29/0.54 (step-pop @p59 :rule scope :premises (@p58)) % 0.29/0.54 (step @p43 :rule process_scope :premises (@p59) :args (@t29)) % 0.29/0.54 (step @p47 :rule implies_elim :premises (@p43)) % 0.29/0.54 (step @p48 :rule cnf_and_neg :args (@t30)) % 0.29/0.54 (step @p49 :rule resolution :premises (@p48 @p47) :args (true @t30)) % 0.29/0.54 (step @p50 :rule reordering :premises (@p49) :args ((or @t29 (not @t26) (not @t28) (not @t25)))) % 0.29/0.54 (step @p51 false :rule chain_m_resolution :premises (@p50 @p33 @p23 @p19 @p18) :args (false (@list false false true false) (@list @t25 @t28 @t29 @t26))) % 0.29/0.54 ) % 0.29/0.55 % SZS output end Proof % 0.29/0.55 % cvc5 exiting %------------------------------------------------------------------------------