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