%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP193-1 : 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 : n009.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:11 AM UTC 2026 % Result : Unsatisfiable 1.02s 1.30s % Output : Proof 1.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP193-1 : 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.15/0.34 % Computer : n009.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue Jun 2 00:56:59 EDT 2026 % 0.15/0.34 % CPUTime : % 0.29/0.48 %----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... % 1.02/1.30 % SZS status Unsatisfiable % 1.02/1.30 % SZS output start Proof % 1.13/1.30 ( % 1.13/1.30 (declare-sort $$unsorted 0) % 1.13/1.30 (declare-const tptp.c $$unsorted) % 1.13/1.30 (declare-const tptp.b $$unsorted) % 1.13/1.30 (declare-const tptp.a $$unsorted) % 1.13/1.30 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 1.13/1.30 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 1.13/1.30 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 1.13/1.30 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 1.13/1.30 (declare-const tptp.identity $$unsorted) % 1.13/1.30 (define @t1 () (@var "X" $$unsorted)) % 1.13/1.30 (define @t2 () (tptp.multiply tptp.identity @t1)) % 1.13/1.30 (define @t3 () (@list @t1)) % 1.13/1.30 (define @t4 () (forall @t3 (= @t2 @t1))) % 1.13/1.30 (define @t5 () (@var "Z" $$unsorted)) % 1.13/1.30 (define @t6 () (@var "Y" $$unsorted)) % 1.13/1.30 (define @t7 () (tptp.multiply @t1 @t6)) % 1.13/1.30 (define @t8 () (@list @t1 @t6 @t5)) % 1.13/1.30 (define @t9 () (tptp.greatest_lower_bound @t1 @t6)) % 1.13/1.30 (define @t10 () (@list @t1 @t6)) % 1.13/1.30 (define @t11 () (tptp.least_upper_bound @t1 @t6)) % 1.13/1.30 (define @t12 () (tptp.greatest_lower_bound @t6 @t5)) % 1.13/1.30 (define @t13 () (forall @t8 (= (tptp.greatest_lower_bound @t1 @t12) (tptp.greatest_lower_bound @t9 @t5)))) % 1.13/1.30 (define @t14 () (tptp.least_upper_bound @t6 @t5)) % 1.13/1.30 (define @t15 () (tptp.least_upper_bound @t1 @t1)) % 1.13/1.30 (define @t16 () (forall @t3 (= @t15 @t1))) % 1.13/1.30 (define @t17 () (tptp.least_upper_bound @t1 @t9)) % 1.13/1.30 (define @t18 () (forall @t10 (= @t17 @t1))) % 1.13/1.30 (define @t19 () (tptp.greatest_lower_bound @t1 @t11)) % 1.13/1.30 (define @t20 () (forall @t10 (= @t19 @t1))) % 1.13/1.30 (define @t21 () (tptp.multiply @t1 @t5)) % 1.13/1.30 (define @t22 () (tptp.multiply @t5 @t1)) % 1.13/1.30 (define @t23 () (tptp.multiply @t6 @t1)) % 1.13/1.30 (define @t24 () (@list @t6 @t5 @t1)) % 1.13/1.30 (define @t25 () (tptp.greatest_lower_bound tptp.a tptp.b)) % 1.13/1.30 (define @t26 () (tptp.greatest_lower_bound tptp.a tptp.c)) % 1.13/1.30 (define @t27 () (tptp.multiply @t25 @t26)) % 1.13/1.30 (define @t28 () (tptp.multiply tptp.b tptp.c)) % 1.13/1.30 (define @t29 () (tptp.greatest_lower_bound tptp.a @t28)) % 1.13/1.30 (define @t30 () (tptp.multiply tptp.identity tptp.c)) % 1.13/1.30 (define @t31 () (tptp.greatest_lower_bound @t28 tptp.a)) % 1.13/1.30 (define @t32 () (tptp.least_upper_bound @t31 @t30)) % 1.13/1.30 (define @t33 () (tptp.greatest_lower_bound @t29 @t32)) % 1.13/1.30 (define @t34 () (tptp.least_upper_bound @t29 @t29)) % 1.13/1.30 (define @t35 () (tptp.multiply @t25 @t34)) % 1.13/1.30 (define @t36 () (tptp.greatest_lower_bound @t28 @t32)) % 1.13/1.30 (define @t37 () (tptp.greatest_lower_bound tptp.a @t36)) % 1.13/1.30 (define @t38 () (= @t37 @t33)) % 1.13/1.30 (assume @p1 @t4) % 1.13/1.30 (assume @p2 (forall @t3 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 1.13/1.30 (assume @p3 (forall @t8 (= (tptp.multiply @t7 @t5) (tptp.multiply @t1 (tptp.multiply @t6 @t5))))) % 1.13/1.30 (assume @p4 (forall @t10 (= @t9 (tptp.greatest_lower_bound @t6 @t1)))) % 1.13/1.30 (assume @p5 (forall @t10 (= @t11 (tptp.least_upper_bound @t6 @t1)))) % 1.13/1.30 (assume @p6 @t13) % 1.13/1.30 (assume @p7 (forall @t8 (= (tptp.least_upper_bound @t1 @t14) (tptp.least_upper_bound @t11 @t5)))) % 1.13/1.30 (assume @p8 @t16) % 1.13/1.30 (assume @p9 (forall @t3 (= (tptp.greatest_lower_bound @t1 @t1) @t1))) % 1.13/1.30 (assume @p10 @t18) % 1.13/1.30 (assume @p11 @t20) % 1.13/1.30 (assume @p12 (forall @t8 (= (tptp.multiply @t1 @t14) (tptp.least_upper_bound @t7 @t21)))) % 1.13/1.30 (assume @p13 (forall @t8 (= (tptp.multiply @t1 @t12) (tptp.greatest_lower_bound @t7 @t21)))) % 1.13/1.30 (assume @p14 (forall @t24 (= (tptp.multiply @t14 @t1) (tptp.least_upper_bound @t23 @t22)))) % 1.13/1.30 (assume @p15 (forall @t24 (= (tptp.multiply @t12 @t1) (tptp.greatest_lower_bound @t23 @t22)))) % 1.13/1.30 (assume @p16 (= (tptp.least_upper_bound tptp.identity tptp.a) tptp.a)) % 1.13/1.30 (assume @p17 (= (tptp.least_upper_bound tptp.identity tptp.b) tptp.b)) % 1.13/1.30 (assume @p18 (= (tptp.least_upper_bound tptp.identity tptp.c) tptp.c)) % 1.13/1.30 (assume @p19 (= @t25 tptp.identity)) % 1.13/1.30 (assume @p20 (= (tptp.least_upper_bound @t29 @t27) @t27)) % 1.13/1.30 (assume @p21 (not (= @t29 @t26))) % 1.13/1.30 (step @p22 :rule symm :premises (@p21)) % 1.13/1.30 (step @p23 :rule false_intro :premises (@p22)) % 1.13/1.30 (step @p24 :rule instantiate :premises (@p4) :args ((@list tptp.a @t28))) % 1.13/1.30 (step @p25 :rule symm :premises (@p24)) % 1.13/1.30 (step @p26 :rule eq-symm :args (@t19 @t1)) % 1.13/1.30 (step @p27 :rule cong :premises (@p26) :args (@t20)) % 1.13/1.30 (step @p28 :rule eq_resolve :premises (@p11 @p27)) % 1.13/1.30 (step @p29 :rule instantiate :premises (@p28) :args ((@list @t31 @t30))) % 1.13/1.30 (step @p30 :rule symm :premises (@p29)) % 1.13/1.30 (step @p31 :rule refl :args (@t32)) % 1.13/1.30 (step @p32 :rule cong :premises (@p24 @p31) :args (@t33)) % 1.13/1.30 (step @p33 :rule trans :premises (@p32 @p30 @p25)) % 1.13/1.30 (step @p34 :rule eq-symm :args (@t2 @t1)) % 1.13/1.30 (step @p35 :rule cong :premises (@p34) :args (@t4)) % 1.13/1.30 (step @p36 :rule eq_resolve :premises (@p1 @p35)) % 1.13/1.30 (step @p37 :rule instantiate :premises (@p36) :args ((@list tptp.c))) % 1.13/1.30 (step @p38 :rule symm :premises (@p37)) % 1.13/1.30 (step @p39 :rule instantiate :premises (@p28) :args ((@list @t30 @t28))) % 1.13/1.30 (step @p40 :rule symm :premises (@p39)) % 1.13/1.30 (step @p41 :rule instantiate :premises (@p4) :args ((@list @t30 (tptp.least_upper_bound @t30 @t28)))) % 1.13/1.30 (step @p42 :rule symm :premises (@p41)) % 1.13/1.30 (step @p43 :rule eq-symm :args (@t17 @t1)) % 1.13/1.30 (step @p44 :rule cong :premises (@p43) :args (@t18)) % 1.13/1.30 (step @p45 :rule eq_resolve :premises (@p10 @p44)) % 1.13/1.30 (step @p46 :rule instantiate :premises (@p45) :args ((@list tptp.c tptp.a))) % 1.13/1.30 (step @p47 :rule symm :premises (@p46)) % 1.13/1.30 (step @p48 :rule instantiate :premises (@p4) :args ((@list tptp.a tptp.c))) % 1.13/1.30 (step @p49 :rule instantiate :premises (@p36) :args ((@list @t26))) % 1.13/1.30 (step @p50 :rule symm :premises (@p49)) % 1.13/1.30 (step @p51 :rule refl :args (@t26)) % 1.13/1.30 (step @p52 :rule cong :premises (@p19 @p51) :args (@t27)) % 1.13/1.30 (step @p53 :rule instantiate :premises (@p5) :args ((@list @t29 @t27))) % 1.13/1.30 (step @p54 :rule symm :premises (@p53)) % 1.13/1.30 (step @p55 :rule trans :premises (@p54 @p20 @p52 @p50 @p48)) % 1.13/1.30 (step @p56 :rule refl :args (tptp.c)) % 1.13/1.30 (step @p57 :rule cong :premises (@p56 @p55) :args ((tptp.least_upper_bound tptp.c (tptp.least_upper_bound @t27 @t29)))) % 1.13/1.30 (step @p58 :rule instantiate :premises (@p7) :args ((@list tptp.c @t27 @t29))) % 1.13/1.30 (step @p59 :rule symm :premises (@p58)) % 1.13/1.30 (step @p60 :rule symm :premises (@p52)) % 1.13/1.30 (step @p61 :rule symm :premises (@p48)) % 1.13/1.30 (step @p62 :rule trans :premises (@p61 @p49 @p60)) % 1.13/1.30 (step @p63 :rule cong :premises (@p56 @p62) :args ((tptp.least_upper_bound tptp.c (tptp.greatest_lower_bound tptp.c tptp.a)))) % 1.13/1.30 (step @p64 :rule trans :premises (@p46 @p63)) % 1.13/1.30 (step @p65 :rule trans :premises (@p38 @p64)) % 1.13/1.30 (step @p66 :rule cong :premises (@p65 @p25) :args ((tptp.least_upper_bound @t30 @t31))) % 1.13/1.30 (step @p67 :rule eq-symm :args (@t15 @t1)) % 1.13/1.30 (step @p68 :rule cong :premises (@p67) :args (@t16)) % 1.13/1.30 (step @p69 :rule eq_resolve :premises (@p8 @p68)) % 1.13/1.30 (step @p70 :rule instantiate :premises (@p69) :args ((@list @t29))) % 1.13/1.30 (step @p71 :rule symm :premises (@p70)) % 1.13/1.30 (step @p72 :rule instantiate :premises (@p36) :args ((@list @t34))) % 1.13/1.30 (step @p73 :rule symm :premises (@p72)) % 1.13/1.30 (step @p74 :rule cong :premises (@p19 @p70) :args ((tptp.multiply @t25 @t29))) % 1.13/1.30 (step @p75 :rule refl :args (@t25)) % 1.13/1.30 (step @p76 :rule cong :premises (@p75 @p71) :args (@t35)) % 1.13/1.30 (step @p77 :rule trans :premises (@p76 @p74 @p73 @p71 @p24)) % 1.13/1.30 (step @p78 :rule cong :premises (@p37 @p77) :args ((tptp.least_upper_bound tptp.c @t35))) % 1.13/1.30 (step @p79 :rule instantiate :premises (@p5) :args ((@list tptp.c @t35))) % 1.13/1.30 (step @p80 :rule symm :premises (@p79)) % 1.13/1.30 (step @p81 :rule symm :premises (@p77)) % 1.13/1.30 (step @p82 :rule cong :premises (@p81 @p38) :args (@t32)) % 1.13/1.30 (step @p83 :rule trans :premises (@p82 @p80 @p78 @p66 @p59 @p57 @p47 @p37)) % 1.13/1.30 (step @p84 :rule instantiate :premises (@p14) :args ((@list tptp.identity tptp.b tptp.c))) % 1.13/1.30 (step @p85 :rule symm :premises (@p17)) % 1.13/1.30 (step @p86 :rule cong :premises (@p85 @p56) :args (@t28)) % 1.13/1.30 (step @p87 :rule trans :premises (@p86 @p84)) % 1.13/1.30 (step @p88 :rule cong :premises (@p87 @p83) :args (@t36)) % 1.13/1.30 (step @p89 :rule trans :premises (@p88 @p42 @p40 @p38)) % 1.13/1.30 (step @p90 :rule refl :args (tptp.a)) % 1.13/1.30 (step @p91 :rule cong :premises (@p90 @p89) :args (@t37)) % 1.13/1.30 (step @p92 :rule cong :premises (@p91 @p33) :args (@t38)) % 1.13/1.30 (step @p93 :rule trans :premises (@p92 @p23)) % 1.13/1.30 (step @p94 :rule false_elim :premises (@p93)) % 1.13/1.30 (assume-push @p101 @t13) % 1.13/1.30 (step @p96 :rule instantiate :premises (@p6) :args ((@list tptp.a @t28 @t32))) % 1.13/1.30 (step-pop @p102 :rule scope :premises (@p96)) % 1.13/1.30 (step @p97 :rule process_scope :premises (@p102) :args (@t38)) % 1.13/1.30 (step @p99 :rule implies_elim :premises (@p97)) % 1.13/1.30 (step @p100 false :rule chain_m_resolution :premises (@p99 @p94 @p6) :args (false (@list true false) (@list @t38 @t13))) % 1.13/1.30 ) % 1.13/1.31 % SZS output end Proof % 1.13/1.31 % cvc5 exiting %------------------------------------------------------------------------------