%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP138-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 : n010.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.38s 0.58s % Output : Proof 0.38s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP138-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.17/0.34 % Computer : n010.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:53:40 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----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.38/0.58 % SZS status Unsatisfiable % 0.38/0.58 % SZS output start Proof % 0.38/0.58 ( % 0.38/0.58 (declare-sort $$unsorted 0) % 0.38/0.58 (declare-const tptp.b $$unsorted) % 0.38/0.58 (declare-const tptp.c $$unsorted) % 0.38/0.58 (declare-const tptp.a $$unsorted) % 0.38/0.58 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.38/0.58 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.38/0.58 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.38/0.58 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.38/0.58 (declare-const tptp.identity $$unsorted) % 0.38/0.58 (define @t1 () (@var "X" $$unsorted)) % 0.38/0.58 (define @t2 () (@list @t1)) % 0.38/0.58 (define @t3 () (@var "Z" $$unsorted)) % 0.38/0.58 (define @t4 () (@var "Y" $$unsorted)) % 0.38/0.58 (define @t5 () (tptp.multiply @t1 @t4)) % 0.38/0.58 (define @t6 () (@list @t1 @t4 @t3)) % 0.38/0.58 (define @t7 () (tptp.greatest_lower_bound @t1 @t4)) % 0.38/0.58 (define @t8 () (@list @t1 @t4)) % 0.38/0.58 (define @t9 () (tptp.least_upper_bound @t1 @t4)) % 0.38/0.58 (define @t10 () (tptp.greatest_lower_bound @t4 @t3)) % 0.38/0.58 (define @t11 () (tptp.least_upper_bound @t4 @t3)) % 0.38/0.58 (define @t12 () (tptp.least_upper_bound @t1 @t7)) % 0.38/0.58 (define @t13 () (forall @t8 (= @t12 @t1))) % 0.38/0.58 (define @t14 () (tptp.greatest_lower_bound @t1 @t9)) % 0.38/0.58 (define @t15 () (forall @t8 (= @t14 @t1))) % 0.38/0.58 (define @t16 () (tptp.multiply @t1 @t3)) % 0.38/0.58 (define @t17 () (tptp.multiply @t3 @t1)) % 0.38/0.58 (define @t18 () (tptp.multiply @t4 @t1)) % 0.38/0.58 (define @t19 () (@list @t4 @t3 @t1)) % 0.38/0.58 (define @t20 () (tptp.least_upper_bound tptp.a tptp.c)) % 0.38/0.58 (define @t21 () (tptp.greatest_lower_bound tptp.a tptp.b)) % 0.38/0.58 (define @t22 () (tptp.least_upper_bound @t21 tptp.c)) % 0.38/0.58 (define @t23 () (tptp.least_upper_bound tptp.c tptp.b)) % 0.38/0.58 (define @t24 () (tptp.least_upper_bound tptp.c @t21)) % 0.38/0.58 (define @t25 () (tptp.greatest_lower_bound @t24 @t23)) % 0.38/0.58 (define @t26 () (@list @t21 tptp.c)) % 0.38/0.58 (define @t27 () (tptp.least_upper_bound @t25 (tptp.greatest_lower_bound @t25 tptp.c))) % 0.38/0.58 (define @t28 () (= @t25 @t27)) % 0.38/0.58 (define @t29 () (forall @t8 (= @t1 @t12))) % 0.38/0.58 (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1))) % 0.38/0.58 (assume @p2 (forall @t2 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 0.38/0.58 (assume @p3 (forall @t6 (= (tptp.multiply @t5 @t3) (tptp.multiply @t1 (tptp.multiply @t4 @t3))))) % 0.38/0.58 (assume @p4 (forall @t8 (= @t7 (tptp.greatest_lower_bound @t4 @t1)))) % 0.38/0.58 (assume @p5 (forall @t8 (= @t9 (tptp.least_upper_bound @t4 @t1)))) % 0.38/0.58 (assume @p6 (forall @t6 (= (tptp.greatest_lower_bound @t1 @t10) (tptp.greatest_lower_bound @t7 @t3)))) % 0.38/0.58 (assume @p7 (forall @t6 (= (tptp.least_upper_bound @t1 @t11) (tptp.least_upper_bound @t9 @t3)))) % 0.38/0.58 (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 0.38/0.58 (assume @p9 (forall @t2 (= (tptp.greatest_lower_bound @t1 @t1) @t1))) % 0.38/0.58 (assume @p10 @t13) % 0.38/0.58 (assume @p11 @t15) % 0.38/0.58 (assume @p12 (forall @t6 (= (tptp.multiply @t1 @t11) (tptp.least_upper_bound @t5 @t16)))) % 0.38/0.58 (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t16)))) % 0.38/0.58 (assume @p14 (forall @t19 (= (tptp.multiply @t11 @t1) (tptp.least_upper_bound @t18 @t17)))) % 0.38/0.58 (assume @p15 (forall @t19 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t18 @t17)))) % 0.38/0.58 (assume @p16 (= @t20 tptp.a)) % 0.38/0.58 (assume @p17 (= (tptp.least_upper_bound tptp.b tptp.c) tptp.b)) % 0.38/0.58 (assume @p18 (not (= @t22 @t21))) % 0.38/0.58 (step @p19 :rule eq-symm :args (@t12 @t1)) % 0.38/0.58 (step @p20 :rule cong :premises (@p19) :args (@t13)) % 0.38/0.58 (step @p21 :rule eq_resolve :premises (@p10 @p20)) % 0.38/0.58 (step @p22 :rule symm :premises (@p18)) % 0.38/0.58 (step @p23 :rule false_intro :premises (@p22)) % 0.38/0.58 (step @p24 :rule eq-symm :args (@t14 @t1)) % 0.38/0.58 (step @p25 :rule cong :premises (@p24) :args (@t15)) % 0.38/0.58 (step @p26 :rule eq_resolve :premises (@p11 @p25)) % 0.38/0.58 (step @p27 :rule instantiate :premises (@p26) :args ((@list tptp.c tptp.b))) % 0.38/0.58 (step @p28 :rule symm :premises (@p27)) % 0.38/0.58 (step @p29 :rule refl :args (@t23)) % 0.38/0.58 (step @p30 :rule instantiate :premises (@p26) :args ((@list tptp.c @t21))) % 0.38/0.58 (step @p31 :rule symm :premises (@p30)) % 0.38/0.58 (step @p32 :rule cong :premises (@p31 @p29) :args ((tptp.greatest_lower_bound (tptp.greatest_lower_bound tptp.c @t24) @t23))) % 0.38/0.58 (step @p33 :rule instantiate :premises (@p6) :args ((@list tptp.c @t24 @t23))) % 0.38/0.58 (step @p34 :rule instantiate :premises (@p4) :args ((@list tptp.c @t25))) % 0.38/0.58 (step @p35 :rule symm :premises (@p34)) % 0.38/0.58 (step @p36 :rule trans :premises (@p35 @p33 @p32 @p28)) % 0.38/0.58 (step @p37 :rule instantiate :premises (@p26) :args (@t26)) % 0.38/0.58 (step @p38 :rule symm :premises (@p37)) % 0.38/0.58 (step @p39 :rule instantiate :premises (@p4) :args ((@list @t21 @t22))) % 0.38/0.58 (step @p40 :rule symm :premises (@p39)) % 0.38/0.58 (step @p41 :rule instantiate :premises (@p6) :args ((@list @t22 tptp.a tptp.b))) % 0.38/0.58 (step @p42 :rule symm :premises (@p41)) % 0.38/0.58 (step @p43 :rule instantiate :premises (@p4) :args ((@list (tptp.greatest_lower_bound @t22 tptp.a) tptp.b))) % 0.38/0.58 (step @p44 :rule symm :premises (@p43)) % 0.38/0.58 (step @p45 :rule refl :args (tptp.c)) % 0.38/0.58 (step @p46 :rule cong :premises (@p16 @p45) :args ((tptp.least_upper_bound @t20 tptp.c))) % 0.38/0.58 (step @p47 :rule symm :premises (@p16)) % 0.38/0.58 (step @p48 :rule instantiate :premises (@p21) :args ((@list tptp.a tptp.b))) % 0.38/0.58 (step @p49 :rule symm :premises (@p48)) % 0.38/0.58 (step @p50 :rule trans :premises (@p49 @p47)) % 0.38/0.58 (step @p51 :rule cong :premises (@p50 @p45) :args ((tptp.least_upper_bound (tptp.least_upper_bound tptp.a @t21) tptp.c))) % 0.38/0.58 (step @p52 :rule instantiate :premises (@p7) :args ((@list tptp.a @t21 tptp.c))) % 0.38/0.58 (step @p53 :rule instantiate :premises (@p5) :args ((@list tptp.a @t22))) % 0.38/0.58 (step @p54 :rule symm :premises (@p53)) % 0.38/0.58 (step @p55 :rule trans :premises (@p54 @p52 @p51 @p46 @p16)) % 0.38/0.58 (step @p56 :rule refl :args (@t22)) % 0.38/0.58 (step @p57 :rule cong :premises (@p56 @p55) :args ((tptp.greatest_lower_bound @t22 (tptp.least_upper_bound @t22 tptp.a)))) % 0.38/0.58 (step @p58 :rule instantiate :premises (@p26) :args ((@list @t22 tptp.a))) % 0.38/0.58 (step @p59 :rule trans :premises (@p58 @p57)) % 0.38/0.58 (step @p60 :rule refl :args (tptp.b)) % 0.38/0.58 (step @p61 :rule cong :premises (@p60 @p59) :args ((tptp.greatest_lower_bound tptp.b @t22))) % 0.38/0.58 (step @p62 :rule instantiate :premises (@p4) :args ((@list tptp.b @t22))) % 0.38/0.58 (step @p63 :rule symm :premises (@p62)) % 0.38/0.58 (step @p64 :rule instantiate :premises (@p5) :args ((@list tptp.b tptp.c))) % 0.38/0.58 (step @p65 :rule symm :premises (@p64)) % 0.38/0.58 (step @p66 :rule trans :premises (@p65 @p17)) % 0.38/0.58 (step @p67 :rule instantiate :premises (@p5) :args (@t26)) % 0.38/0.58 (step @p68 :rule symm :premises (@p67)) % 0.38/0.58 (step @p69 :rule cong :premises (@p68 @p66) :args (@t25)) % 0.38/0.58 (step @p70 :rule trans :premises (@p69 @p63 @p61 @p44 @p42 @p40 @p38)) % 0.38/0.58 (step @p71 :rule cong :premises (@p70 @p36) :args (@t27)) % 0.38/0.58 (step @p72 :rule cong :premises (@p70 @p71) :args (@t28)) % 0.38/0.58 (step @p73 :rule trans :premises (@p72 @p23)) % 0.38/0.58 (step @p74 :rule false_elim :premises (@p73)) % 0.38/0.58 (assume-push @p81 @t29) % 0.38/0.58 (step @p76 :rule instantiate :premises (@p21) :args ((@list @t25 tptp.c))) % 0.38/0.58 (step-pop @p82 :rule scope :premises (@p76)) % 0.38/0.58 (step @p77 :rule process_scope :premises (@p82) :args (@t28)) % 0.38/0.58 (step @p79 :rule implies_elim :premises (@p77)) % 0.38/0.58 (step @p80 false :rule chain_m_resolution :premises (@p79 @p74 @p21) :args (false (@list true false) (@list @t28 @t29))) % 0.38/0.58 ) % 0.38/0.58 % SZS output end Proof % 0.38/0.59 % cvc5 exiting %------------------------------------------------------------------------------