%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP166-3 : 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 : n029.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:03 AM UTC 2026 % Result : Unsatisfiable 0.30s 0.55s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP166-3 : 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.16/0.34 % Computer : n029.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 00:54:32 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.48 %----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.30/0.55 % SZS status Unsatisfiable % 0.30/0.55 % SZS output start Proof % 0.37/0.55 ( % 0.37/0.55 (declare-sort $$unsorted 0) % 0.37/0.55 (declare-const tptp.b $$unsorted) % 0.37/0.55 (declare-const tptp.a $$unsorted) % 0.37/0.55 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.55 (declare-const tptp.identity $$unsorted) % 0.37/0.55 (define @t1 () (@var "X" $$unsorted)) % 0.37/0.55 (define @t2 () (tptp.multiply tptp.identity @t1)) % 0.37/0.55 (define @t3 () (@list @t1)) % 0.37/0.55 (define @t4 () (forall @t3 (= @t2 @t1))) % 0.37/0.55 (define @t5 () (@var "Z" $$unsorted)) % 0.37/0.55 (define @t6 () (@var "Y" $$unsorted)) % 0.37/0.55 (define @t7 () (tptp.multiply @t1 @t6)) % 0.37/0.55 (define @t8 () (@list @t1 @t6 @t5)) % 0.37/0.55 (define @t9 () (tptp.greatest_lower_bound @t1 @t6)) % 0.37/0.55 (define @t10 () (@list @t1 @t6)) % 0.37/0.55 (define @t11 () (tptp.least_upper_bound @t1 @t6)) % 0.37/0.55 (define @t12 () (tptp.greatest_lower_bound @t6 @t5)) % 0.37/0.55 (define @t13 () (tptp.least_upper_bound @t6 @t5)) % 0.37/0.55 (define @t14 () (tptp.multiply @t1 @t5)) % 0.37/0.55 (define @t15 () (tptp.multiply @t5 @t1)) % 0.37/0.55 (define @t16 () (tptp.multiply @t6 @t1)) % 0.37/0.55 (define @t17 () (@list @t6 @t5 @t1)) % 0.37/0.55 (define @t18 () (tptp.least_upper_bound tptp.b tptp.identity)) % 0.37/0.55 (define @t19 () (tptp.multiply tptp.b tptp.a)) % 0.37/0.55 (define @t20 () (tptp.least_upper_bound tptp.a @t19)) % 0.37/0.55 (define @t21 () (= tptp.b @t18)) % 0.37/0.55 (define @t22 () (= @t20 (tptp.least_upper_bound @t19 tptp.a))) % 0.37/0.55 (define @t23 () (tptp.multiply tptp.identity tptp.a)) % 0.37/0.55 (define @t24 () (tptp.least_upper_bound @t19 @t23)) % 0.37/0.55 (define @t25 () (tptp.multiply @t18 tptp.a)) % 0.37/0.55 (define @t26 () (= @t25 @t24)) % 0.37/0.55 (define @t27 () (= tptp.a @t23)) % 0.37/0.55 (define @t28 () (= @t19 @t20)) % 0.37/0.55 (define @t29 () (and @t21 @t22 @t26 @t27)) % 0.37/0.55 (assume @p1 @t4) % 0.37/0.55 (assume @p2 (forall @t3 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 0.37/0.55 (assume @p3 (forall @t8 (= (tptp.multiply @t7 @t5) (tptp.multiply @t1 (tptp.multiply @t6 @t5))))) % 0.37/0.55 (assume @p4 (forall @t10 (= @t9 (tptp.greatest_lower_bound @t6 @t1)))) % 0.37/0.55 (assume @p5 (forall @t10 (= @t11 (tptp.least_upper_bound @t6 @t1)))) % 0.37/0.55 (assume @p6 (forall @t8 (= (tptp.greatest_lower_bound @t1 @t12) (tptp.greatest_lower_bound @t9 @t5)))) % 0.37/0.55 (assume @p7 (forall @t8 (= (tptp.least_upper_bound @t1 @t13) (tptp.least_upper_bound @t11 @t5)))) % 0.37/0.55 (assume @p8 (forall @t3 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 0.37/0.55 (assume @p9 (forall @t3 (= (tptp.greatest_lower_bound @t1 @t1) @t1))) % 0.37/0.55 (assume @p10 (forall @t10 (= (tptp.least_upper_bound @t1 @t9) @t1))) % 0.37/0.55 (assume @p11 (forall @t10 (= (tptp.greatest_lower_bound @t1 @t11) @t1))) % 0.37/0.55 (assume @p12 (forall @t8 (= (tptp.multiply @t1 @t13) (tptp.least_upper_bound @t7 @t14)))) % 0.37/0.55 (assume @p13 (forall @t8 (= (tptp.multiply @t1 @t12) (tptp.greatest_lower_bound @t7 @t14)))) % 0.37/0.55 (assume @p14 (forall @t17 (= (tptp.multiply @t13 @t1) (tptp.least_upper_bound @t16 @t15)))) % 0.37/0.55 (assume @p15 (forall @t17 (= (tptp.multiply @t12 @t1) (tptp.greatest_lower_bound @t16 @t15)))) % 0.37/0.55 (assume @p16 (= (tptp.least_upper_bound tptp.a tptp.identity) tptp.a)) % 0.37/0.55 (assume @p17 (= @t18 tptp.b)) % 0.37/0.55 (assume @p18 (not (= @t20 @t19))) % 0.37/0.55 (step @p19 :rule symm :premises (@p17)) % 0.37/0.55 (step @p20 :rule symm :premises (@p18)) % 0.37/0.55 (step @p21 :rule instantiate :premises (@p5) :args ((@list tptp.a @t19))) % 0.37/0.55 (step @p22 :rule instantiate :premises (@p14) :args ((@list tptp.b tptp.identity tptp.a))) % 0.37/0.55 (step @p23 :rule eq-symm :args (@t2 @t1)) % 0.37/0.55 (step @p24 :rule cong :premises (@p23) :args (@t4)) % 0.37/0.55 (step @p25 :rule eq_resolve :premises (@p1 @p24)) % 0.37/0.55 (step @p26 :rule instantiate :premises (@p25) :args ((@list tptp.a))) % 0.37/0.55 (assume-push @p53 @t21) % 0.37/0.55 (assume-push @p54 @t22) % 0.37/0.55 (assume-push @p55 @t26) % 0.37/0.55 (assume-push @p56 @t27) % 0.37/0.55 (step @p31 :rule symm :premises (@p21)) % 0.37/0.55 (step @p32 :rule symm :premises (@p26)) % 0.37/0.55 (step @p33 :rule refl :args (tptp.a)) % 0.37/0.55 (step @p34 :rule cong :premises (@p17 @p33) :args (@t25)) % 0.37/0.55 (step @p35 :rule symm :premises (@p22)) % 0.37/0.55 (step @p36 :rule trans :premises (@p35 @p34)) % 0.37/0.55 (step @p37 :rule cong :premises (@p36 @p32) :args ((tptp.least_upper_bound @t24 @t23))) % 0.37/0.55 (step @p38 :rule refl :args (@t23)) % 0.37/0.55 (step @p39 :rule symm :premises (@p36)) % 0.37/0.55 (step @p40 :rule cong :premises (@p39 @p38) :args (@t24)) % 0.37/0.55 (step @p41 :rule symm :premises (@p34)) % 0.37/0.55 (step @p42 :rule trans :premises (@p41 @p22 @p40 @p37 @p31)) % 0.37/0.55 (step-pop @p57 :rule scope :premises (@p42)) % 0.37/0.55 (step-pop @p58 :rule scope :premises (@p57)) % 0.37/0.55 (step-pop @p59 :rule scope :premises (@p58)) % 0.37/0.55 (step-pop @p60 :rule scope :premises (@p59)) % 0.37/0.55 (step @p43 :rule process_scope :premises (@p60) :args (@t28)) % 0.37/0.55 (step @p48 :rule implies_elim :premises (@p43)) % 0.37/0.55 (step @p49 :rule cnf_and_neg :args (@t29)) % 0.37/0.55 (step @p50 :rule resolution :premises (@p49 @p48) :args (true @t29)) % 0.37/0.55 (step @p51 :rule reordering :premises (@p50) :args ((or @t28 (not @t21) (not @t22) (not @t26) (not @t27)))) % 0.37/0.55 (step @p52 false :rule chain_m_resolution :premises (@p51 @p26 @p22 @p21 @p20 @p19) :args (false (@list false false false true false) (@list @t27 @t26 @t22 @t28 @t21))) % 0.37/0.55 ) % 0.37/0.56 % SZS output end Proof % 0.37/0.56 % cvc5 exiting %------------------------------------------------------------------------------