%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP137-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:00 AM UTC 2026 % Result : Unsatisfiable 0.28s 0.57s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP137-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.15/0.33 % Computer : n008.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Tue Jun 2 00:54:03 EDT 2026 % 0.15/0.34 % CPUTime : % 0.28/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.28/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.28/0.57 % SZS status Unsatisfiable % 0.28/0.57 % SZS output start Proof % 0.36/0.57 ( % 0.36/0.57 (declare-sort $$unsorted 0) % 0.36/0.57 (declare-const tptp.b $$unsorted) % 0.36/0.57 (declare-const tptp.a $$unsorted) % 0.36/0.57 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.57 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.57 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.36/0.57 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.57 (declare-const tptp.identity $$unsorted) % 0.36/0.57 (define @t1 () (@var "X" $$unsorted)) % 0.36/0.57 (define @t2 () (@list @t1)) % 0.36/0.57 (define @t3 () (@var "Z" $$unsorted)) % 0.36/0.57 (define @t4 () (@var "Y" $$unsorted)) % 0.36/0.57 (define @t5 () (tptp.multiply @t1 @t4)) % 0.36/0.57 (define @t6 () (@list @t1 @t4 @t3)) % 0.36/0.57 (define @t7 () (tptp.greatest_lower_bound @t1 @t4)) % 0.36/0.57 (define @t8 () (@list @t1 @t4)) % 0.36/0.57 (define @t9 () (tptp.least_upper_bound @t1 @t4)) % 0.36/0.57 (define @t10 () (tptp.greatest_lower_bound @t4 @t3)) % 0.36/0.57 (define @t11 () (tptp.least_upper_bound @t4 @t3)) % 0.36/0.57 (define @t12 () (tptp.multiply @t1 @t3)) % 0.36/0.57 (define @t13 () (tptp.multiply @t3 @t1)) % 0.36/0.57 (define @t14 () (tptp.multiply @t4 @t1)) % 0.36/0.57 (define @t15 () (@list @t4 @t3 @t1)) % 0.36/0.57 (define @t16 () (tptp.greatest_lower_bound tptp.a tptp.b)) % 0.36/0.57 (define @t17 () (= tptp.a tptp.b)) % 0.36/0.57 (define @t18 () (= tptp.a @t16)) % 0.36/0.57 (define @t19 () (= tptp.b @t16)) % 0.36/0.57 (define @t20 () (and @t18 @t19)) % 0.36/0.57 (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1))) % 0.36/0.57 (assume @p2 (forall @t2 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 0.36/0.57 (assume @p3 (forall @t6 (= (tptp.multiply @t5 @t3) (tptp.multiply @t1 (tptp.multiply @t4 @t3))))) % 0.36/0.57 (assume @p4 (forall @t8 (= @t7 (tptp.greatest_lower_bound @t4 @t1)))) % 0.36/0.57 (assume @p5 (forall @t8 (= @t9 (tptp.least_upper_bound @t4 @t1)))) % 0.36/0.57 (assume @p6 (forall @t6 (= (tptp.greatest_lower_bound @t1 @t10) (tptp.greatest_lower_bound @t7 @t3)))) % 0.36/0.57 (assume @p7 (forall @t6 (= (tptp.least_upper_bound @t1 @t11) (tptp.least_upper_bound @t9 @t3)))) % 0.36/0.57 (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 0.36/0.57 (assume @p9 (forall @t2 (= (tptp.greatest_lower_bound @t1 @t1) @t1))) % 0.36/0.57 (assume @p10 (forall @t8 (= (tptp.least_upper_bound @t1 @t7) @t1))) % 0.36/0.57 (assume @p11 (forall @t8 (= (tptp.greatest_lower_bound @t1 @t9) @t1))) % 0.36/0.57 (assume @p12 (forall @t6 (= (tptp.multiply @t1 @t11) (tptp.least_upper_bound @t5 @t12)))) % 0.36/0.57 (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t12)))) % 0.36/0.57 (assume @p14 (forall @t15 (= (tptp.multiply @t11 @t1) (tptp.least_upper_bound @t14 @t13)))) % 0.36/0.57 (assume @p15 (forall @t15 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t14 @t13)))) % 0.36/0.57 (assume @p16 (= @t16 tptp.a)) % 0.36/0.57 (assume @p17 (= @t16 tptp.b)) % 0.36/0.57 (assume @p18 (not @t17)) % 0.36/0.57 (step @p19 :rule symm :premises (@p16)) % 0.36/0.57 (step @p20 :rule symm :premises (@p17)) % 0.36/0.57 (assume-push @p32 @t18) % 0.36/0.57 (assume-push @p33 @t19) % 0.36/0.57 (step @p23 :rule trans :premises (@p19 @p17)) % 0.36/0.57 (step-pop @p34 :rule scope :premises (@p23)) % 0.36/0.57 (step-pop @p35 :rule scope :premises (@p34)) % 0.36/0.57 (step @p24 :rule process_scope :premises (@p35) :args (@t17)) % 0.36/0.57 (step @p27 :rule implies_elim :premises (@p24)) % 0.36/0.57 (step @p28 :rule cnf_and_neg :args (@t20)) % 0.36/0.57 (step @p29 :rule resolution :premises (@p28 @p27) :args (true @t20)) % 0.36/0.57 (step @p30 :rule reordering :premises (@p29) :args ((or @t17 (not @t18) (not @t19)))) % 0.36/0.57 (step @p31 false :rule chain_m_resolution :premises (@p30 @p18 @p20 @p19) :args (false (@list true false false) (@list @t17 @t19 @t18))) % 0.36/0.57 ) % 0.36/0.57 % SZS output end Proof % 0.36/0.57 % cvc5 exiting %------------------------------------------------------------------------------