%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GRP193-2 : 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 : n025.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 16.15s 16.48s % Output : Proof 16.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP193-2 : TPTP v9.2.1. Bugfixed v1.2.1. % 0.14/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n025.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue Jun 2 00:57:31 EDT 2026 % 0.18/0.34 % CPUTime : % 0.32/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.32/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.35/16.31 --- Run --no-e-matching --full-saturate-quant at 6... % 16.15/16.48 % SZS status Unsatisfiable % 16.15/16.48 % SZS output start Proof % 16.15/16.49 ( % 16.15/16.49 (declare-sort $$unsorted 0) % 16.15/16.49 (declare-const tptp.c $$unsorted) % 16.15/16.49 (declare-const tptp.b $$unsorted) % 16.15/16.49 (declare-const tptp.a $$unsorted) % 16.15/16.49 (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted)) % 16.15/16.49 (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted)) % 16.15/16.49 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 16.15/16.49 (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted)) % 16.15/16.49 (declare-const tptp.identity $$unsorted) % 16.15/16.49 (define @t1 () (@var "X" $$unsorted)) % 16.15/16.49 (define @t2 () (tptp.multiply tptp.identity @t1)) % 16.15/16.49 (define @t3 () (@list @t1)) % 16.15/16.49 (define @t4 () (forall @t3 (= @t2 @t1))) % 16.15/16.49 (define @t5 () (@var "Z" $$unsorted)) % 16.15/16.49 (define @t6 () (@var "Y" $$unsorted)) % 16.15/16.49 (define @t7 () (tptp.multiply @t1 @t6)) % 16.15/16.49 (define @t8 () (@list @t1 @t6 @t5)) % 16.15/16.49 (define @t9 () (tptp.greatest_lower_bound @t1 @t6)) % 16.15/16.49 (define @t10 () (@list @t1 @t6)) % 16.15/16.49 (define @t11 () (tptp.least_upper_bound @t1 @t6)) % 16.15/16.49 (define @t12 () (tptp.greatest_lower_bound @t6 @t5)) % 16.15/16.49 (define @t13 () (tptp.least_upper_bound @t6 @t5)) % 16.15/16.49 (define @t14 () (tptp.greatest_lower_bound @t1 @t1)) % 16.15/16.49 (define @t15 () (forall @t3 (= @t14 @t1))) % 16.15/16.49 (define @t16 () (tptp.multiply @t1 @t5)) % 16.15/16.49 (define @t17 () (tptp.multiply @t5 @t1)) % 16.15/16.49 (define @t18 () (tptp.multiply @t6 @t1)) % 16.15/16.49 (define @t19 () (@list @t6 @t5 @t1)) % 16.15/16.49 (define @t20 () (tptp.greatest_lower_bound tptp.identity tptp.b)) % 16.15/16.49 (define @t21 () (tptp.greatest_lower_bound tptp.a tptp.b)) % 16.15/16.49 (define @t22 () (tptp.multiply tptp.b tptp.c)) % 16.15/16.49 (define @t23 () (tptp.greatest_lower_bound tptp.a @t22)) % 16.15/16.49 (define @t24 () (tptp.greatest_lower_bound tptp.a tptp.c)) % 16.15/16.49 (define @t25 () (tptp.multiply @t21 @t24)) % 16.15/16.49 (define @t26 () (tptp.greatest_lower_bound @t23 @t25)) % 16.15/16.49 (define @t27 () (= @t23 @t24)) % 16.15/16.49 (define @t28 () (not @t27)) % 16.15/16.49 (define @t29 () (= @t1 @t2)) % 16.15/16.49 (define @t30 () (tptp.greatest_lower_bound tptp.c @t22)) % 16.15/16.49 (define @t31 () (tptp.greatest_lower_bound @t30 tptp.a)) % 16.15/16.49 (define @t32 () (tptp.greatest_lower_bound @t22 tptp.a)) % 16.15/16.49 (define @t33 () (tptp.greatest_lower_bound tptp.c @t32)) % 16.15/16.49 (define @t34 () (= @t33 @t31)) % 16.15/16.49 (define @t35 () (not @t34)) % 16.15/16.49 (define @t36 () (tptp.greatest_lower_bound @t23 @t24)) % 16.15/16.49 (define @t37 () (= @t36 (tptp.greatest_lower_bound (tptp.greatest_lower_bound @t23 tptp.a) tptp.c))) % 16.15/16.49 (define @t38 () (not @t37)) % 16.15/16.49 (define @t39 () (tptp.greatest_lower_bound @t23 tptp.c)) % 16.15/16.49 (define @t40 () (= (tptp.greatest_lower_bound tptp.c @t23) @t39)) % 16.15/16.49 (define @t41 () (not @t40)) % 16.15/16.49 (define @t42 () (tptp.greatest_lower_bound @t32 tptp.a)) % 16.15/16.49 (define @t43 () (tptp.greatest_lower_bound tptp.a tptp.a)) % 16.15/16.49 (define @t44 () (= (tptp.greatest_lower_bound @t22 @t43) @t42)) % 16.15/16.49 (define @t45 () (not @t44)) % 16.15/16.49 (define @t46 () (tptp.multiply @t21 tptp.c)) % 16.15/16.49 (define @t47 () (tptp.greatest_lower_bound tptp.b @t21)) % 16.15/16.49 (define @t48 () (tptp.multiply @t47 tptp.c)) % 16.15/16.49 (define @t49 () (= @t48 (tptp.greatest_lower_bound @t22 @t46))) % 16.15/16.49 (define @t50 () (not @t49)) % 16.15/16.49 (define @t51 () (tptp.greatest_lower_bound @t22 tptp.c)) % 16.15/16.49 (define @t52 () (= @t30 @t51)) % 16.15/16.49 (define @t53 () (not @t52)) % 16.15/16.49 (define @t54 () (= @t23 @t32)) % 16.15/16.49 (define @t55 () (not @t54)) % 16.15/16.49 (define @t56 () (tptp.greatest_lower_bound tptp.b tptp.a)) % 16.15/16.49 (define @t57 () (tptp.greatest_lower_bound @t56 tptp.b)) % 16.15/16.49 (define @t58 () (= @t47 @t57)) % 16.15/16.49 (define @t59 () (not @t58)) % 16.15/16.49 (define @t60 () (= tptp.c @t46)) % 16.15/16.49 (define @t61 () (not @t60)) % 16.15/16.49 (define @t62 () (= @t24 (tptp.greatest_lower_bound tptp.c tptp.a))) % 16.15/16.49 (define @t63 () (not @t62)) % 16.15/16.49 (define @t64 () (= tptp.a @t43)) % 16.15/16.49 (define @t65 () (not @t64)) % 16.15/16.49 (define @t66 () (= @t21 @t56)) % 16.15/16.49 (define @t67 () (not @t66)) % 16.15/16.49 (define @t68 () (= @t24 @t25)) % 16.15/16.49 (define @t69 () (not @t68)) % 16.15/16.49 (define @t70 () (= @t21 (tptp.greatest_lower_bound @t21 tptp.b))) % 16.15/16.49 (define @t71 () (not @t70)) % 16.15/16.49 (define @t72 () (= @t23 @t26)) % 16.15/16.49 (define @t73 () (not @t72)) % 16.15/16.49 (define @t74 () (and @t28 @t72 @t70 @t68 @t66 @t64 @t62 @t60 @t58 @t54 @t52 @t49 @t44 @t40 @t37)) % 16.15/16.49 (assume @p1 @t4) % 16.15/16.49 (assume @p2 (forall @t3 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity))) % 16.15/16.49 (assume @p3 (forall @t8 (= (tptp.multiply @t7 @t5) (tptp.multiply @t1 (tptp.multiply @t6 @t5))))) % 16.15/16.49 (assume @p4 (forall @t10 (= @t9 (tptp.greatest_lower_bound @t6 @t1)))) % 16.15/16.49 (assume @p5 (forall @t10 (= @t11 (tptp.least_upper_bound @t6 @t1)))) % 16.15/16.49 (assume @p6 (forall @t8 (= (tptp.greatest_lower_bound @t1 @t12) (tptp.greatest_lower_bound @t9 @t5)))) % 16.15/16.49 (assume @p7 (forall @t8 (= (tptp.least_upper_bound @t1 @t13) (tptp.least_upper_bound @t11 @t5)))) % 16.15/16.49 (assume @p8 (forall @t3 (= (tptp.least_upper_bound @t1 @t1) @t1))) % 16.15/16.49 (assume @p9 @t15) % 16.15/16.49 (assume @p10 (forall @t10 (= (tptp.least_upper_bound @t1 @t9) @t1))) % 16.15/16.49 (assume @p11 (forall @t10 (= (tptp.greatest_lower_bound @t1 @t11) @t1))) % 16.15/16.49 (assume @p12 (forall @t8 (= (tptp.multiply @t1 @t13) (tptp.least_upper_bound @t7 @t16)))) % 16.15/16.49 (assume @p13 (forall @t8 (= (tptp.multiply @t1 @t12) (tptp.greatest_lower_bound @t7 @t16)))) % 16.15/16.49 (assume @p14 (forall @t19 (= (tptp.multiply @t13 @t1) (tptp.least_upper_bound @t18 @t17)))) % 16.15/16.49 (assume @p15 (forall @t19 (= (tptp.multiply @t12 @t1) (tptp.greatest_lower_bound @t18 @t17)))) % 16.15/16.49 (assume @p16 (= (tptp.greatest_lower_bound tptp.identity tptp.a) tptp.identity)) % 16.15/16.49 (assume @p17 (= @t20 tptp.identity)) % 16.15/16.49 (assume @p18 (= (tptp.greatest_lower_bound tptp.identity tptp.c) tptp.identity)) % 16.15/16.49 (assume @p19 (= @t21 tptp.identity)) % 16.15/16.49 (assume @p20 (= @t26 @t23)) % 16.15/16.49 (assume @p21 @t28) % 16.15/16.49 (step @p22 :rule refl :args (tptp.b)) % 16.15/16.49 (step @p23 :rule symm :premises (@p19)) % 16.15/16.49 (step @p24 :rule cong :premises (@p23 @p22) :args (@t20)) % 16.15/16.49 (step @p25 :rule cong :premises (@p23 @p24) :args ((= tptp.identity @t20))) % 16.15/16.49 (step @p26 :rule eq-symm :args (@t20 tptp.identity)) % 16.15/16.49 (step @p27 :rule trans :premises (@p26 @p25)) % 16.15/16.49 (step @p28 :rule eq_resolve :premises (@p17 @p27)) % 16.15/16.49 (step @p29 :rule symm :premises (@p20)) % 16.15/16.49 (step @p30 :rule refl :args (@t1)) % 16.15/16.49 (step @p31 :rule cong :premises (@p23 @p30) :args (@t2)) % 16.15/16.49 (step @p32 :rule cong :premises (@p30 @p31) :args (@t29)) % 16.15/16.49 (step @p33 :rule cong :premises (@p32) :args ((forall @t3 @t29))) % 16.15/16.49 (step @p34 :rule eq-symm :args (@t2 @t1)) % 16.15/16.49 (step @p35 :rule cong :premises (@p34) :args (@t4)) % 16.15/16.49 (step @p36 :rule trans :premises (@p35 @p33)) % 16.15/16.49 (step @p37 :rule eq_resolve :premises (@p1 @p36)) % 16.15/16.49 (step @p38 :rule instantiate :premises (@p37) :args ((@list @t24))) % 16.15/16.49 (step @p39 :rule instantiate :premises (@p4) :args ((@list tptp.a tptp.b))) % 16.15/16.49 (step @p40 :rule eq-symm :args (@t14 @t1)) % 16.15/16.49 (step @p41 :rule cong :premises (@p40) :args (@t15)) % 16.15/16.49 (step @p42 :rule eq_resolve :premises (@p9 @p41)) % 16.15/16.49 (step @p43 :rule instantiate :premises (@p42) :args ((@list tptp.a))) % 16.15/16.49 (step @p44 :rule instantiate :premises (@p4) :args ((@list tptp.a tptp.c))) % 16.15/16.49 (step @p45 :rule instantiate :premises (@p37) :args ((@list tptp.c))) % 16.15/16.49 (step @p46 :rule instantiate :premises (@p6) :args ((@list tptp.b tptp.a tptp.b))) % 16.15/16.49 (step @p47 :rule instantiate :premises (@p4) :args ((@list tptp.a @t22))) % 16.15/16.49 (step @p48 :rule instantiate :premises (@p4) :args ((@list tptp.c @t22))) % 16.15/16.49 (step @p49 :rule instantiate :premises (@p15) :args ((@list tptp.b @t21 tptp.c))) % 16.15/16.49 (step @p50 :rule instantiate :premises (@p6) :args ((@list @t22 tptp.a tptp.a))) % 16.15/16.49 (step @p51 :rule instantiate :premises (@p4) :args ((@list tptp.c @t23))) % 16.15/16.49 (step @p52 :rule instantiate :premises (@p6) :args ((@list @t23 tptp.a tptp.c))) % 16.15/16.49 (step @p53 :rule instantiate :premises (@p6) :args ((@list tptp.c @t22 tptp.a))) % 16.15/16.49 (step @p54 :rule refl :args (@t35)) % 16.15/16.49 (step @p55 :rule refl :args (@t38)) % 16.15/16.49 (step @p56 :rule refl :args (@t41)) % 16.15/16.49 (step @p57 :rule refl :args (@t45)) % 16.15/16.49 (step @p58 :rule refl :args (@t50)) % 16.15/16.49 (step @p59 :rule refl :args (@t53)) % 16.15/16.49 (step @p60 :rule refl :args (@t55)) % 16.15/16.49 (step @p61 :rule refl :args (@t59)) % 16.15/16.49 (step @p62 :rule refl :args (@t61)) % 16.15/16.49 (step @p63 :rule refl :args (@t63)) % 16.15/16.49 (step @p64 :rule refl :args (@t65)) % 16.15/16.49 (step @p65 :rule refl :args (@t67)) % 16.15/16.49 (step @p66 :rule refl :args (@t69)) % 16.15/16.49 (step @p67 :rule refl :args (@t71)) % 16.15/16.49 (step @p68 :rule refl :args (@t73)) % 16.15/16.49 (step @p69 :rule bool-double-not-elim :args (@t27)) % 16.15/16.49 (step @p70 :rule nary_cong :premises (@p69 @p68 @p67 @p66 @p65 @p64 @p63 @p62 @p61 @p60 @p59 @p58 @p57 @p56 @p55 @p54) :args ((or (not @t28) @t73 @t71 @t69 @t67 @t65 @t63 @t61 @t59 @t55 @t53 @t50 @t45 @t41 @t38 @t35))) % 16.15/16.49 (assume-push @p137 @t28) % 16.15/16.49 (assume-push @p138 @t72) % 16.15/16.49 (assume-push @p139 @t70) % 16.15/16.49 (assume-push @p140 @t68) % 16.15/16.49 (assume-push @p141 @t66) % 16.15/16.49 (assume-push @p142 @t64) % 16.15/16.49 (assume-push @p143 @t62) % 16.15/16.49 (assume-push @p144 @t60) % 16.15/16.49 (assume-push @p145 @t58) % 16.15/16.49 (assume-push @p146 @t54) % 16.15/16.49 (assume-push @p147 @t52) % 16.15/16.49 (assume-push @p148 @t49) % 16.15/16.49 (assume-push @p149 @t44) % 16.15/16.49 (assume-push @p150 @t40) % 16.15/16.49 (assume-push @p151 @t37) % 16.15/16.49 (step @p86 :rule false_intro :premises (@p21)) % 16.15/16.49 (step @p87 :rule symm :premises (@p44)) % 16.15/16.49 (step @p88 :rule refl :args (tptp.a)) % 16.15/16.49 (step @p89 :rule symm :premises (@p45)) % 16.15/16.49 (step @p90 :rule refl :args (tptp.c)) % 16.15/16.49 (step @p91 :rule symm :premises (@p28)) % 16.15/16.49 (step @p92 :rule symm :premises (@p39)) % 16.15/16.49 (step @p93 :rule cong :premises (@p92 @p22) :args (@t57)) % 16.15/16.49 (step @p94 :rule trans :premises (@p46 @p93 @p91)) % 16.15/16.49 (step @p95 :rule cong :premises (@p94 @p90) :args (@t48)) % 16.15/16.49 (step @p96 :rule symm :premises (@p49)) % 16.15/16.49 (step @p97 :rule refl :args (@t22)) % 16.15/16.49 (step @p98 :rule cong :premises (@p97 @p45) :args (@t51)) % 16.15/16.49 (step @p99 :rule trans :premises (@p48 @p98 @p96 @p95 @p89)) % 16.15/16.49 (step @p100 :rule cong :premises (@p99 @p88) :args (@t31)) % 16.15/16.49 (step @p101 :rule trans :premises (@p100 @p87)) % 16.15/16.49 (step @p102 :rule refl :args (@t23)) % 16.15/16.49 (step @p103 :rule cong :premises (@p102 @p38) :args (@t36)) % 16.15/16.49 (step @p104 :rule symm :premises (@p52)) % 16.15/16.49 (step @p105 :rule symm :premises (@p47)) % 16.15/16.49 (step @p106 :rule cong :premises (@p105 @p88) :args (@t42)) % 16.15/16.49 (step @p107 :rule cong :premises (@p97 @p43) :args (@t32)) % 16.15/16.49 (step @p108 :rule trans :premises (@p47 @p107 @p50 @p106)) % 16.15/16.49 (step @p109 :rule cong :premises (@p108 @p90) :args (@t39)) % 16.15/16.49 (step @p110 :rule cong :premises (@p90 @p105) :args (@t33)) % 16.15/16.49 (step @p111 :rule trans :premises (@p110 @p51 @p109 @p104 @p103 @p20)) % 16.15/16.49 (step @p112 :rule cong :premises (@p111 @p101) :args (@t34)) % 16.15/16.49 (step @p113 :rule trans :premises (@p112 @p86)) % 16.15/16.49 (step @p114 :rule false_elim :premises (@p113)) % 16.15/16.49 (step-pop @p152 :rule scope :premises (@p114)) % 16.15/16.49 (step-pop @p153 :rule scope :premises (@p152)) % 16.15/16.49 (step-pop @p154 :rule scope :premises (@p153)) % 16.15/16.49 (step-pop @p155 :rule scope :premises (@p154)) % 16.15/16.49 (step-pop @p156 :rule scope :premises (@p155)) % 16.15/16.49 (step-pop @p157 :rule scope :premises (@p156)) % 16.15/16.49 (step-pop @p158 :rule scope :premises (@p157)) % 16.15/16.49 (step-pop @p159 :rule scope :premises (@p158)) % 16.15/16.49 (step-pop @p160 :rule scope :premises (@p159)) % 16.15/16.49 (step-pop @p161 :rule scope :premises (@p160)) % 16.15/16.49 (step-pop @p162 :rule scope :premises (@p161)) % 16.15/16.49 (step-pop @p163 :rule scope :premises (@p162)) % 16.15/16.49 (step-pop @p164 :rule scope :premises (@p163)) % 16.15/16.49 (step-pop @p165 :rule scope :premises (@p164)) % 16.15/16.49 (step-pop @p166 :rule scope :premises (@p165)) % 16.15/16.49 (step @p115 :rule process_scope :premises (@p166) :args (@t35)) % 16.15/16.49 (step @p131 :rule implies_elim :premises (@p115)) % 16.15/16.49 (step @p132 :rule cnf_and_neg :args (@t74)) % 16.15/16.49 (step @p133 :rule resolution :premises (@p132 @p131) :args (true @t74)) % 16.15/16.49 (step @p134 :rule eq_resolve :premises (@p133 @p70)) % 16.15/16.49 (step @p135 :rule reordering :premises (@p134) :args ((or @t27 @t71 @t73 @t69 @t67 @t65 @t63 @t61 @t59 @t55 @t53 @t50 @t45 @t41 @t38 @t35))) % 16.15/16.49 (step @p136 false :rule chain_m_resolution :premises (@p135 @p53 @p52 @p51 @p50 @p49 @p48 @p47 @p46 @p45 @p44 @p43 @p39 @p38 @p21 @p29 @p28) :args (false (@list false false false false false false false false false false false false false true false false) (@list @t34 @t37 @t40 @t44 @t49 @t52 @t54 @t58 @t60 @t62 @t64 @t66 @t68 @t27 @t72 @t70))) % 16.15/16.49 ) % 16.15/16.49 % SZS output end Proof % 16.15/16.49 % cvc5 exiting %------------------------------------------------------------------------------