%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP185-2 : 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 : n006.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 0.44s 0.64s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP185-2 : 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.17/0.34 % Computer : n006.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:55:49 EDT 2026 % 0.17/0.34 % CPUTime : % 0.29/0.49 %----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.44/0.64 % SZS status Unsatisfiable % 0.44/0.64 % SZS output start Proof % 0.44/0.64 ( % 0.44/0.64 (declare-sort $$unsorted 0) % 0.44/0.64 (declare-const tptp.a $$unsorted) % 0.44/0.64 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.b $$unsorted) % 0.44/0.64 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.identity $$unsorted) % 0.44/0.64 (define @t1 () (@var "X" $$unsorted)) % 0.44/0.64 (define @t2 () (@list @t1)) % 0.44/0.64 (define @t3 () (tptp.inverse @t1)) % 0.44/0.64 (define @t4 () (tptp.multiply @t3 @t1)) % 0.44/0.64 (define @t5 () (forall @t2 (= @t4 tptp.identity))) % 0.44/0.64 (define @t6 () (@var "Z" $$unsorted)) % 0.44/0.64 (define @t7 () (@var "Y" $$unsorted)) % 0.44/0.64 (define @t8 () (tptp.multiply @t1 @t7)) % 0.44/0.64 (define @t9 () (@list @t1 @t7 @t6)) % 0.44/0.64 (define @t10 () (tptp.greatest_lower_bound @t1 @t7)) % 0.44/0.64 (define @t11 () (@list @t1 @t7)) % 0.44/0.64 (define @t12 () (tptp.least_upper_bound @t1 @t7)) % 0.44/0.64 (define @t13 () (tptp.greatest_lower_bound @t7 @t6)) % 0.44/0.64 (define @t14 () (tptp.least_upper_bound @t7 @t6)) % 0.44/0.64 (define @t15 () (forall @t9 (= (tptp.least_upper_bound @t1 @t14) (tptp.least_upper_bound @t12 @t6)))) % 0.44/0.64 (define @t16 () (tptp.least_upper_bound @t1 @t10)) % 0.44/0.64 (define @t17 () (forall @t11 (= @t16 @t1))) % 0.44/0.64 (define @t18 () (tptp.greatest_lower_bound @t1 @t12)) % 0.44/0.64 (define @t19 () (forall @t11 (= @t18 @t1))) % 0.44/0.64 (define @t20 () (tptp.multiply @t1 @t6)) % 0.44/0.64 (define @t21 () (tptp.multiply @t6 @t1)) % 0.44/0.64 (define @t22 () (tptp.multiply @t7 @t1)) % 0.44/0.64 (define @t23 () (@list @t7 @t6 @t1)) % 0.44/0.64 (define @t24 () (tptp.inverse tptp.identity)) % 0.44/0.64 (define @t25 () (tptp.least_upper_bound tptp.b tptp.identity)) % 0.44/0.64 (define @t26 () (tptp.least_upper_bound tptp.a tptp.identity)) % 0.44/0.64 (define @t27 () (tptp.multiply @t26 @t25)) % 0.44/0.64 (define @t28 () (tptp.multiply tptp.a tptp.b)) % 0.44/0.64 (define @t29 () (tptp.least_upper_bound @t28 tptp.identity)) % 0.44/0.64 (define @t30 () (tptp.multiply tptp.identity @t25)) % 0.44/0.64 (define @t31 () (tptp.multiply tptp.a @t25)) % 0.44/0.64 (define @t32 () (tptp.multiply tptp.a tptp.identity)) % 0.44/0.64 (define @t33 () (@list @t28 tptp.identity)) % 0.44/0.64 (define @t34 () (tptp.greatest_lower_bound @t28 @t29)) % 0.44/0.64 (define @t35 () (tptp.least_upper_bound tptp.identity @t28)) % 0.44/0.64 (define @t36 () (tptp.least_upper_bound tptp.identity @t31)) % 0.44/0.64 (define @t37 () (tptp.multiply @t26 tptp.b)) % 0.44/0.64 (define @t38 () (tptp.multiply tptp.identity tptp.identity)) % 0.44/0.64 (define @t39 () (tptp.least_upper_bound @t37 @t32)) % 0.44/0.64 (define @t40 () (tptp.least_upper_bound @t39 tptp.identity)) % 0.44/0.64 (define @t41 () (tptp.least_upper_bound tptp.identity tptp.a)) % 0.44/0.64 (define @t42 () (tptp.greatest_lower_bound tptp.identity @t41)) % 0.44/0.64 (define @t43 () (tptp.least_upper_bound @t40 @t42)) % 0.44/0.64 (define @t44 () (tptp.least_upper_bound @t39 (tptp.least_upper_bound tptp.identity @t42))) % 0.44/0.64 (define @t45 () (= @t44 @t43)) % 0.44/0.64 (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1))) % 0.44/0.64 (assume @p2 @t5) % 0.44/0.64 (assume @p3 (forall @t9 (= (tptp.multiply @t8 @t6) (tptp.multiply @t1 (tptp.multiply @t7 @t6))))) % 0.44/0.64 (assume @p4 (forall @t11 (= @t10 (tptp.greatest_lower_bound @t7 @t1)))) % 0.44/0.64 (assume @p5 (forall @t11 (= @t12 (tptp.least_upper_bound @t7 @t1)))) % 0.44/0.64 (assume @p6 (forall @t9 (= (tptp.greatest_lower_bound @t1 @t13) (tptp.greatest_lower_bound @t10 @t6)))) % 0.44/0.64 (assume @p7 @t15) % 0.44/0.64 (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 0.44/0.64 (assume @p9 (forall @t2 (= (tptp.greatest_lower_bound @t1 @t1) @t1))) % 0.44/0.64 (assume @p10 @t17) % 0.44/0.64 (assume @p11 @t19) % 0.44/0.64 (assume @p12 (forall @t9 (= (tptp.multiply @t1 @t14) (tptp.least_upper_bound @t8 @t20)))) % 0.44/0.64 (assume @p13 (forall @t9 (= (tptp.multiply @t1 @t13) (tptp.greatest_lower_bound @t8 @t20)))) % 0.44/0.64 (assume @p14 (forall @t23 (= (tptp.multiply @t14 @t1) (tptp.least_upper_bound @t22 @t21)))) % 0.44/0.64 (assume @p15 (forall @t23 (= (tptp.multiply @t13 @t1) (tptp.greatest_lower_bound @t22 @t21)))) % 0.44/0.64 (assume @p16 (= @t24 tptp.identity)) % 0.44/0.64 (assume @p17 (forall @t2 (= (tptp.inverse @t3) @t1))) % 0.44/0.64 (assume @p18 (forall @t11 (= (tptp.inverse @t8) (tptp.multiply (tptp.inverse @t7) @t3)))) % 0.44/0.64 (assume @p19 (not (= (tptp.least_upper_bound @t29 @t27) @t27))) % 0.44/0.64 (step @p20 :rule symm :premises (@p19)) % 0.44/0.64 (step @p21 :rule false_intro :premises (@p20)) % 0.44/0.64 (step @p22 :rule instantiate :premises (@p14) :args ((@list tptp.a tptp.identity @t25))) % 0.44/0.64 (step @p23 :rule symm :premises (@p22)) % 0.44/0.64 (step @p24 :rule refl :args (@t29)) % 0.44/0.64 (step @p25 :rule cong :premises (@p24 @p23) :args ((tptp.least_upper_bound @t29 (tptp.least_upper_bound @t31 @t30)))) % 0.44/0.64 (step @p26 :rule instantiate :premises (@p7) :args ((@list @t29 @t31 @t30))) % 0.44/0.64 (step @p27 :rule symm :premises (@p26)) % 0.44/0.64 (step @p28 :rule instantiate :premises (@p5) :args ((@list (tptp.least_upper_bound @t29 @t31) @t30))) % 0.44/0.64 (step @p29 :rule symm :premises (@p28)) % 0.44/0.64 (step @p30 :rule instantiate :premises (@p12) :args ((@list tptp.a tptp.b tptp.identity))) % 0.44/0.64 (step @p31 :rule symm :premises (@p30)) % 0.44/0.64 (step @p32 :rule cong :premises (@p24 @p31) :args ((tptp.least_upper_bound @t29 (tptp.least_upper_bound @t28 @t32)))) % 0.44/0.64 (step @p33 :rule instantiate :premises (@p7) :args ((@list @t29 @t28 @t32))) % 0.44/0.64 (step @p34 :rule symm :premises (@p33)) % 0.44/0.64 (step @p35 :rule refl :args (@t32)) % 0.44/0.64 (step @p36 :rule eq-symm :args (@t18 @t1)) % 0.44/0.64 (step @p37 :rule cong :premises (@p36) :args (@t19)) % 0.44/0.64 (step @p38 :rule eq_resolve :premises (@p11 @p37)) % 0.44/0.64 (step @p39 :rule instantiate :premises (@p38) :args (@t33)) % 0.44/0.64 (step @p40 :rule symm :premises (@p39)) % 0.44/0.64 (step @p41 :rule instantiate :premises (@p5) :args (@t33)) % 0.44/0.64 (step @p42 :rule symm :premises (@p41)) % 0.44/0.64 (step @p43 :rule cong :premises (@p42 @p40) :args ((tptp.least_upper_bound @t35 @t34))) % 0.44/0.64 (step @p44 :rule instantiate :premises (@p7) :args ((@list tptp.identity @t28 @t34))) % 0.44/0.64 (step @p45 :rule eq-symm :args (@t16 @t1)) % 0.44/0.64 (step @p46 :rule cong :premises (@p45) :args (@t17)) % 0.44/0.64 (step @p47 :rule eq_resolve :premises (@p10 @p46)) % 0.44/0.64 (step @p48 :rule instantiate :premises (@p47) :args ((@list @t28 @t29))) % 0.44/0.64 (step @p49 :rule refl :args (tptp.identity)) % 0.44/0.64 (step @p50 :rule cong :premises (@p49 @p48) :args (@t35)) % 0.44/0.64 (step @p51 :rule trans :premises (@p41 @p50 @p44 @p43)) % 0.44/0.64 (step @p52 :rule trans :premises (@p42 @p51)) % 0.44/0.64 (step @p53 :rule cong :premises (@p52 @p35) :args ((tptp.least_upper_bound @t35 @t32))) % 0.44/0.64 (step @p54 :rule instantiate :premises (@p7) :args ((@list tptp.identity @t28 @t32))) % 0.44/0.64 (step @p55 :rule cong :premises (@p49 @p30) :args (@t36)) % 0.44/0.64 (step @p56 :rule instantiate :premises (@p5) :args ((@list tptp.identity @t31))) % 0.44/0.64 (step @p57 :rule symm :premises (@p56)) % 0.44/0.64 (step @p58 :rule trans :premises (@p57 @p55 @p54 @p53 @p34 @p32)) % 0.44/0.64 (step @p59 :rule refl :args (@t30)) % 0.44/0.64 (step @p60 :rule cong :premises (@p59 @p58) :args ((tptp.least_upper_bound @t30 (tptp.least_upper_bound @t31 tptp.identity)))) % 0.44/0.64 (step @p61 :rule cong :premises (@p59 @p56) :args ((tptp.least_upper_bound @t30 @t36))) % 0.44/0.64 (step @p62 :rule instantiate :premises (@p5) :args ((@list @t36 @t30))) % 0.44/0.64 (step @p63 :rule instantiate :premises (@p7) :args ((@list tptp.identity @t31 @t30))) % 0.44/0.64 (step @p64 :rule cong :premises (@p49 @p22) :args ((tptp.least_upper_bound tptp.identity @t27))) % 0.44/0.64 (step @p65 :rule instantiate :premises (@p5) :args ((@list tptp.identity @t27))) % 0.44/0.64 (step @p66 :rule symm :premises (@p65)) % 0.44/0.64 (step @p67 :rule instantiate :premises (@p38) :args ((@list tptp.identity tptp.a))) % 0.44/0.64 (step @p68 :rule symm :premises (@p67)) % 0.44/0.64 (step @p69 :rule instantiate :premises (@p12) :args ((@list @t26 tptp.b tptp.identity))) % 0.44/0.64 (step @p70 :rule symm :premises (@p69)) % 0.44/0.64 (step @p71 :rule instantiate :premises (@p14) :args ((@list tptp.a tptp.identity tptp.identity))) % 0.44/0.64 (step @p72 :rule symm :premises (@p71)) % 0.44/0.64 (step @p73 :rule refl :args (@t37)) % 0.44/0.64 (step @p74 :rule cong :premises (@p73 @p72) :args ((tptp.least_upper_bound @t37 (tptp.least_upper_bound @t32 @t38)))) % 0.44/0.64 (step @p75 :rule instantiate :premises (@p7) :args ((@list @t37 @t32 @t38))) % 0.44/0.64 (step @p76 :rule symm :premises (@p75)) % 0.44/0.64 (step @p77 :rule cong :premises (@p16 @p49) :args ((tptp.multiply @t24 tptp.identity))) % 0.44/0.64 (step @p78 :rule eq-symm :args (@t4 tptp.identity)) % 0.44/0.64 (step @p79 :rule cong :premises (@p78) :args (@t5)) % 0.44/0.64 (step @p80 :rule eq_resolve :premises (@p2 @p79)) % 0.44/0.64 (step @p81 :rule instantiate :premises (@p80) :args ((@list tptp.identity))) % 0.44/0.64 (step @p82 :rule trans :premises (@p81 @p77)) % 0.44/0.64 (step @p83 :rule refl :args (@t39)) % 0.44/0.64 (step @p84 :rule cong :premises (@p83 @p82) :args (@t40)) % 0.44/0.64 (step @p85 :rule trans :premises (@p84 @p76 @p74 @p70)) % 0.44/0.64 (step @p86 :rule cong :premises (@p85 @p68) :args (@t43)) % 0.44/0.64 (step @p87 :rule trans :premises (@p86 @p66 @p64 @p63 @p62 @p61 @p60 @p29 @p27 @p25)) % 0.44/0.64 (step @p88 :rule instantiate :premises (@p47) :args ((@list tptp.identity @t41))) % 0.44/0.64 (step @p89 :rule symm :premises (@p88)) % 0.44/0.64 (step @p90 :rule trans :premises (@p89 @p81 @p77)) % 0.44/0.64 (step @p91 :rule cong :premises (@p83 @p90) :args (@t44)) % 0.44/0.64 (step @p92 :rule trans :premises (@p91 @p76 @p74 @p70)) % 0.44/0.64 (step @p93 :rule cong :premises (@p92 @p87) :args (@t45)) % 0.44/0.64 (step @p94 :rule trans :premises (@p93 @p21)) % 0.44/0.64 (step @p95 :rule false_elim :premises (@p94)) % 0.44/0.64 (assume-push @p102 @t15) % 0.44/0.64 (step @p97 :rule instantiate :premises (@p7) :args ((@list @t39 tptp.identity @t42))) % 0.44/0.64 (step-pop @p103 :rule scope :premises (@p97)) % 0.44/0.64 (step @p98 :rule process_scope :premises (@p103) :args (@t45)) % 0.44/0.64 (step @p100 :rule implies_elim :premises (@p98)) % 0.44/0.64 (step @p101 false :rule chain_m_resolution :premises (@p100 @p95 @p7) :args (false (@list true false) (@list @t45 @t15))) % 0.44/0.64 ) % 0.44/0.64 % SZS output end Proof % 0.44/0.65 % cvc5 exiting %------------------------------------------------------------------------------