%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n016.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:04:56 AM UTC 2026 % Result : Theorem 0.19s 0.55s % Output : Proof 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.05 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.12/0.37 % Computer : n016.cluster.edu % 0.12/0.37 % Model : x86_64 x86_64 % 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.37 % Memory : 8046.5625MB % 0.12/0.37 % OS : Linux 6.8.0-71-generic % 0.12/0.37 % CPULimit : 300 % 0.12/0.37 % WCLimit : 300 % 0.12/0.37 % DateTime : Mon Sep 7 13:59:02 UTC 2026 % 0.12/0.37 % CPUTime : % 0.15/0.44 %----Proving TF0_NAR, FOF, or CNF % 0.19/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.19/0.55 % SZS status Theorem % 0.19/0.55 % SZS output start Proof % 0.19/0.55 ( % 0.19/0.55 (declare-sort $$unsorted 0) % 0.19/0.55 (declare-const tptp.nsup $$unsorted) % 0.19/0.55 (declare-const tptp.ninf $$unsorted) % 0.19/0.55 (declare-const tptp.n0 $$unsorted) % 0.19/0.55 (declare-const tptp.completion_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted)) % 0.19/0.55 (declare-const tptp.less (-> $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.conflict $$unsorted) % 0.19/0.55 (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.completion_compatible (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.is_verdict (-> $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.compatible $$unsorted) % 0.19/0.55 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.19/0.55 (declare-const tptp.unknown $$unsorted) % 0.19/0.55 (define @t1 () (@var "X" $$unsorted)) % 0.19/0.55 (define @t2 () (@list @t1)) % 0.19/0.55 (define @t3 () (@var "Z" $$unsorted)) % 0.19/0.55 (define @t4 () (tptp.less @t1 @t3)) % 0.19/0.55 (define @t5 () (@var "Y" $$unsorted)) % 0.19/0.55 (define @t6 () (tptp.less @t5 @t3)) % 0.19/0.55 (define @t7 () (tptp.less @t1 @t5)) % 0.19/0.55 (define @t8 () (@list @t1 @t5 @t3)) % 0.19/0.55 (define @t9 () (= @t1 @t5)) % 0.19/0.55 (define @t10 () (@list @t1 @t5)) % 0.19/0.55 (define @t11 () (tptp.leq @t1 @t5)) % 0.19/0.55 (define @t12 () (forall @t10 (= @t11 (or @t7 @t9)))) % 0.19/0.55 (define @t13 () (tptp.leq @t5 @t3)) % 0.19/0.55 (define @t14 () (@var "B" $$unsorted)) % 0.19/0.55 (define @t15 () (tptp.leq @t1 @t14)) % 0.19/0.55 (define @t16 () (@var "A" $$unsorted)) % 0.19/0.55 (define @t17 () (tptp.leq @t16 @t1)) % 0.19/0.55 (define @t18 () (@list @t1 @t16 @t14)) % 0.19/0.55 (define @t19 () (tptp.less @t16 @t1)) % 0.19/0.55 (define @t20 () (tptp.less @t1 @t14)) % 0.19/0.55 (define @t21 () (@var "I2hi" $$unsorted)) % 0.19/0.55 (define @t22 () (@var "I2lo" $$unsorted)) % 0.19/0.55 (define @t23 () (tptp.in_closed @t1 @t22 @t21)) % 0.19/0.55 (define @t24 () (@var "I1hi" $$unsorted)) % 0.19/0.55 (define @t25 () (@var "I1lo" $$unsorted)) % 0.19/0.55 (define @t26 () (tptp.in_closed @t1 @t25 @t24)) % 0.19/0.55 (define @t27 () (exists @t2 (and @t26 @t23))) % 0.19/0.55 (define @t28 () (@list @t25 @t24 @t22 @t21)) % 0.19/0.55 (define @t29 () (@var "V" $$unsorted)) % 0.19/0.55 (define @t30 () (@list @t29)) % 0.19/0.55 (define @t31 () (@var "V2" $$unsorted)) % 0.19/0.55 (define @t32 () (@var "V1" $$unsorted)) % 0.19/0.55 (define @t33 () (tptp.box_verdict @t32 @t31)) % 0.19/0.55 (define @t34 () (= @t33 tptp.conflict)) % 0.19/0.55 (define @t35 () (= @t31 tptp.conflict)) % 0.19/0.55 (define @t36 () (= @t32 tptp.conflict)) % 0.19/0.55 (define @t37 () (tptp.is_verdict @t31)) % 0.19/0.55 (define @t38 () (tptp.is_verdict @t32)) % 0.19/0.55 (define @t39 () (@list @t32 @t31)) % 0.19/0.55 (define @t40 () (= @t33 tptp.compatible)) % 0.19/0.55 (define @t41 () (= @t33 tptp.unknown)) % 0.19/0.55 (define @t42 () (@var "SupD" $$unsorted)) % 0.19/0.55 (define @t43 () (@var "InfD" $$unsorted)) % 0.19/0.55 (define @t44 () (tptp.leq @t29 @t42)) % 0.19/0.55 (define @t45 () (tptp.leq @t43 @t29)) % 0.19/0.55 (define @t46 () (@var "U" $$unsorted)) % 0.19/0.55 (define @t47 () (tptp.completion_conflict @t46 @t29 @t43 @t42)) % 0.19/0.55 (define @t48 () (tptp.less @t46 @t29)) % 0.19/0.55 (define @t49 () (tptp.leq @t46 @t42)) % 0.19/0.55 (define @t50 () (tptp.leq @t43 @t46)) % 0.19/0.55 (define @t51 () (@list @t46 @t29 @t43 @t42)) % 0.19/0.55 (define @t52 () (tptp.completion_compatible @t46 @t43 @t42)) % 0.19/0.55 (define @t53 () (and @t50 @t49 @t48 @t44)) % 0.19/0.55 (define @t54 () (forall @t51 (=> @t53 @t52))) % 0.19/0.55 (define @t55 () (@var "A2hi" $$unsorted)) % 0.19/0.55 (define @t56 () (@var "A2lo" $$unsorted)) % 0.19/0.55 (define @t57 () (@var "A1hi" $$unsorted)) % 0.19/0.55 (define @t58 () (@var "A1lo" $$unsorted)) % 0.19/0.55 (define @t59 () (@var "A1phi" $$unsorted)) % 0.19/0.55 (define @t60 () (@var "A1plo" $$unsorted)) % 0.19/0.55 (define @t61 () (tptp.less tptp.ninf tptp.n0)) % 0.19/0.55 (define @t62 () (tptp.less tptp.n0 tptp.nsup)) % 0.19/0.55 (define @t63 () (tptp.completion_compatible @t29 tptp.ninf tptp.nsup)) % 0.19/0.55 (define @t64 () (tptp.leq @t29 tptp.nsup)) % 0.19/0.55 (define @t65 () (tptp.leq tptp.ninf @t29)) % 0.19/0.55 (define @t66 () (and @t65 @t64 @t63)) % 0.19/0.55 (define @t67 () (exists @t30 @t66)) % 0.19/0.55 (define @t68 () (not @t67)) % 0.19/0.55 (define @t69 () (not @t44)) % 0.19/0.55 (define @t70 () (not @t48)) % 0.19/0.55 (define @t71 () (not @t49)) % 0.19/0.55 (define @t72 () (not @t50)) % 0.19/0.55 (define @t73 () (or @t72 @t71 @t70 @t69)) % 0.19/0.55 (define @t74 () (not @t63)) % 0.19/0.55 (define @t75 () (not @t64)) % 0.19/0.55 (define @t76 () (not @t65)) % 0.19/0.55 (define @t77 () (or @t76 @t75 @t74)) % 0.19/0.55 (define @t78 () (forall @t30 (not @t66))) % 0.19/0.55 (define @t79 () (not @t78)) % 0.19/0.55 (define @t80 () (or @t62 (= tptp.n0 tptp.nsup))) % 0.19/0.55 (define @t81 () (not @t62)) % 0.19/0.55 (define @t82 () (@list false)) % 0.19/0.55 (define @t83 () (tptp.leq tptp.n0 tptp.nsup)) % 0.19/0.55 (define @t84 () (= @t83 @t80)) % 0.19/0.55 (define @t85 () (@list false false)) % 0.19/0.55 (define @t86 () (or @t61 (= tptp.ninf tptp.n0))) % 0.19/0.55 (define @t87 () (tptp.leq tptp.ninf tptp.n0)) % 0.19/0.55 (define @t88 () (= @t87 @t86)) % 0.19/0.55 (define @t89 () (tptp.completion_compatible tptp.n0 tptp.ninf tptp.nsup)) % 0.19/0.55 (define @t90 () (not @t89)) % 0.19/0.55 (define @t91 () (not @t83)) % 0.19/0.55 (define @t92 () (not @t87)) % 0.19/0.55 (define @t93 () (or @t92 @t91 @t90)) % 0.19/0.55 (define @t94 () (tptp.leq tptp.nsup tptp.nsup)) % 0.19/0.55 (define @t95 () (not @t94)) % 0.19/0.55 (define @t96 () (or @t92 @t91 @t81 @t95 @t89)) % 0.19/0.55 (define @t97 () (tptp.less tptp.nsup tptp.nsup)) % 0.19/0.55 (define @t98 () (or @t97 (= tptp.nsup tptp.nsup))) % 0.19/0.55 (define @t99 () (= @t94 @t98)) % 0.19/0.55 (assume @p1 (forall @t2 (not (tptp.less @t1 @t1)))) % 0.19/0.55 (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4))) % 0.19/0.55 (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1)))) % 0.19/0.55 (assume @p4 @t12) % 0.19/0.55 (assume @p5 (forall @t10 (=> (and @t11 (tptp.leq @t5 @t1)) @t9))) % 0.19/0.55 (assume @p6 (forall @t10 (=> @t7 @t11))) % 0.19/0.55 (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4))) % 0.19/0.55 (assume @p8 (forall @t8 (=> (and @t7 @t13) @t4))) % 0.19/0.55 (assume @p9 (forall @t8 (=> (and @t11 @t13) (tptp.leq @t1 @t3)))) % 0.19/0.55 (assume @p10 (forall @t10 (=> @t7 (exists (@list @t3) (and @t4 (tptp.less @t3 @t5)))))) % 0.19/0.55 (assume @p11 (forall @t18 (= (tptp.in_closed @t1 @t16 @t14) (and @t17 @t15)))) % 0.19/0.55 (assume @p12 (forall @t18 (= (tptp.in_lopen @t1 @t16 @t14) (and @t19 @t15)))) % 0.19/0.55 (assume @p13 (forall @t18 (= (tptp.in_ropen @t1 @t16 @t14) (and @t17 @t20)))) % 0.19/0.55 (assume @p14 (forall @t18 (= (tptp.in_open @t1 @t16 @t14) (and @t19 @t20)))) % 0.19/0.55 (assume @p15 (forall @t28 (= (tptp.axis_conflict @t25 @t24 @t22 @t21) (not @t27)))) % 0.19/0.55 (assume @p16 (forall @t28 (= (tptp.axis_compatible @t25 @t24 @t22 @t21) @t27))) % 0.19/0.55 (assume @p17 (forall @t28 (= (tptp.axis_subsumes @t25 @t24 @t22 @t21) (forall @t2 (=> @t26 @t23))))) % 0.19/0.55 (assume @p18 (tptp.is_verdict tptp.conflict)) % 0.19/0.55 (assume @p19 (tptp.is_verdict tptp.compatible)) % 0.19/0.55 (assume @p20 (tptp.is_verdict tptp.unknown)) % 0.19/0.55 (assume @p21 (not (= tptp.conflict tptp.compatible))) % 0.19/0.55 (assume @p22 (not (= tptp.conflict tptp.unknown))) % 0.19/0.55 (assume @p23 (not (= tptp.compatible tptp.unknown))) % 0.19/0.55 (assume @p24 (forall @t30 (=> (tptp.is_verdict @t29) (or (= @t29 tptp.conflict) (= @t29 tptp.compatible) (= @t29 tptp.unknown))))) % 0.19/0.55 (assume @p25 (forall @t39 (=> (and @t38 @t37 (or @t36 @t35)) @t34))) % 0.19/0.55 (assume @p26 (forall @t39 (=> (and @t38 @t37 (= @t32 tptp.compatible) (= @t31 tptp.compatible)) @t40))) % 0.19/0.55 (assume @p27 (forall @t39 (=> (and @t38 @t37 (or (= @t32 tptp.unknown) (= @t31 tptp.unknown)) (not @t36) (not @t35)) @t41))) % 0.19/0.55 (assume @p28 (forall @t39 (=> (and @t38 @t37) (or @t34 @t40 @t41)))) % 0.19/0.55 (assume @p29 (forall (@list @t29 @t43 @t42) (=> (and @t45 @t44) (tptp.completion_compatible @t29 @t43 @t42)))) % 0.19/0.55 (assume @p30 (forall @t51 (=> (and @t50 @t49 @t45 @t44 @t48) @t47))) % 0.19/0.55 (assume @p31 @t54) % 0.19/0.55 (assume @p32 (forall @t51 (=> @t53 @t47))) % 0.19/0.55 (assume @p33 (forall (@list @t58 @t57 @t60 @t59 @t56 @t55) (=> (and (tptp.axis_subsumes @t58 @t57 @t60 @t59) (tptp.axis_conflict @t60 @t59 @t56 @t55)) (tptp.axis_conflict @t58 @t57 @t56 @t55)))) % 0.19/0.55 (assume @p34 (forall (@list @t58 @t57 @t56 @t55) (=> (tptp.axis_subsumes @t58 @t57 @t56 @t55) (forall @t2 (=> (tptp.in_closed @t1 @t58 @t57) (tptp.in_closed @t1 @t56 @t55)))))) % 0.19/0.55 (assume @p35 @t61) % 0.19/0.55 (assume @p36 @t62) % 0.19/0.55 (assume @p37 (forall @t2 (tptp.leq tptp.ninf @t1))) % 0.19/0.55 (assume @p38 (forall @t2 (tptp.leq @t1 tptp.nsup))) % 0.19/0.55 (assume @p39 (= (tptp.box_verdict tptp.unknown tptp.unknown) tptp.unknown)) % 0.19/0.55 (assume @p40 @t68) % 0.19/0.55 (assume @p41 true) % 0.19/0.55 (step @p42 :rule aci_norm :args ((= (or @t73 @t52) (or @t72 @t71 @t70 @t69 @t52)))) % 0.19/0.55 (step @p43 :rule refl :args (@t52)) % 0.19/0.55 (step @p44 :rule aci_norm :args ((= (or @t72 (or @t71 (or @t70 @t69))) @t73))) % 0.19/0.55 (step @p45 :rule bool-and-de-morgan :args (@t48 @t44 true)) % 0.19/0.55 (step @p46 :rule refl :args (@t71)) % 0.19/0.55 (step @p47 :rule nary_cong :premises (@p46 @p45) :args ((or @t71 (not (and @t48 @t44))))) % 0.19/0.55 (step @p48 :rule bool-and-de-morgan :args (@t49 @t48 (and @t44))) % 0.19/0.55 (step @p49 :rule trans :premises (@p48 @p47)) % 0.19/0.55 (step @p50 :rule refl :args (@t72)) % 0.19/0.55 (step @p51 :rule nary_cong :premises (@p50 @p49) :args ((or @t72 (not (and @t49 @t48 @t44))))) % 0.19/0.55 (step @p52 :rule bool-and-de-morgan :args (@t50 @t49 (and @t48 @t44))) % 0.19/0.55 (step @p53 :rule trans :premises (@p52 @p51)) % 0.19/0.55 (step @p54 :rule trans :premises (@p53 @p44)) % 0.19/0.55 (step @p55 :rule nary_cong :premises (@p54 @p43) :args ((or (not @t53) @t52))) % 0.19/0.55 (step @p56 :rule trans :premises (@p55 @p42)) % 0.19/0.55 (step @p57 :rule bool-impl-elim :args (@t53 @t52)) % 0.19/0.55 (step @p58 :rule trans :premises (@p57 @p56)) % 0.19/0.55 (step @p59 :rule cong :premises (@p58) :args (@t54)) % 0.19/0.55 (step @p60 :rule eq_resolve :premises (@p31 @p59)) % 0.19/0.55 (step @p61 :rule instantiate :premises (@p60) :args ((@list tptp.n0 tptp.nsup tptp.ninf tptp.nsup))) % 0.19/0.55 (step @p62 :rule bool-double-not-elim :args ((forall @t30 @t77))) % 0.19/0.55 (step @p63 :rule aci_norm :args ((= (or @t76 (or @t75 @t74)) @t77))) % 0.19/0.55 (step @p64 :rule bool-and-de-morgan :args (@t64 @t63 true)) % 0.19/0.55 (step @p65 :rule refl :args (@t76)) % 0.19/0.55 (step @p66 :rule nary_cong :premises (@p65 @p64) :args ((or @t76 (not (and @t64 @t63))))) % 0.19/0.55 (step @p67 :rule bool-and-de-morgan :args (@t65 @t64 (and @t63))) % 0.19/0.55 (step @p68 :rule trans :premises (@p67 @p66)) % 0.19/0.55 (step @p69 :rule trans :premises (@p68 @p63)) % 0.19/0.55 (step @p70 :rule cong :premises (@p69) :args (@t78)) % 0.19/0.55 (step @p71 :rule cong :premises (@p70) :args (@t79)) % 0.19/0.55 (step @p72 :rule exists-elim :args ((= @t67 @t79))) % 0.19/0.55 (step @p73 :rule trans :premises (@p72 @p71)) % 0.19/0.55 (step @p74 :rule cong :premises (@p73) :args (@t68)) % 0.19/0.55 (step @p75 :rule trans :premises (@p74 @p62)) % 0.19/0.55 (step @p76 :rule eq_resolve :premises (@p40 @p75)) % 0.19/0.55 (step @p77 :rule instantiate :premises (@p76) :args ((@list tptp.n0))) % 0.19/0.55 (step @p78 :rule instantiate :premises (@p4) :args ((@list tptp.n0 tptp.nsup))) % 0.19/0.55 (step @p79 :rule cnf_or_neg :args (@t80 0)) % 0.19/0.55 (step @p80 :rule reordering :premises (@p79) :args ((or @t81 @t80))) % 0.19/0.55 (step @p81 :rule chain_m_resolution :premises (@p80 @p36) :args (@t80 @t82 (@list @t62))) % 0.19/0.55 (step @p82 :rule cnf_equiv_pos2 :args (@t84)) % 0.19/0.55 (step @p83 :rule reordering :premises (@p82) :args ((or @t83 (not @t80) (not @t84)))) % 0.19/0.55 (step @p84 :rule chain_m_resolution :premises (@p83 @p81 @p78) :args (@t83 @t85 (@list @t80 @t84))) % 0.19/0.55 (step @p85 :rule instantiate :premises (@p4) :args ((@list tptp.ninf tptp.n0))) % 0.19/0.55 (step @p86 :rule cnf_or_neg :args (@t86 0)) % 0.19/0.55 (step @p87 :rule reordering :premises (@p86) :args ((or (not @t61) @t86))) % 0.19/0.55 (step @p88 :rule chain_m_resolution :premises (@p87 @p35) :args (@t86 @t82 (@list @t61))) % 0.19/0.55 (step @p89 :rule cnf_equiv_pos2 :args (@t88)) % 0.19/0.55 (step @p90 :rule reordering :premises (@p89) :args ((or @t87 (not @t86) (not @t88)))) % 0.19/0.55 (step @p91 :rule chain_m_resolution :premises (@p90 @p88 @p85) :args (@t87 @t85 (@list @t86 @t88))) % 0.19/0.55 (step @p92 :rule cnf_or_pos :args (@t93)) % 0.19/0.55 (step @p93 :rule reordering :premises (@p92) :args ((or @t92 @t91 @t90 (not @t93)))) % 0.19/0.55 (step @p94 :rule chain_m_resolution :premises (@p93 @p91 @p84 @p77) :args (@t90 (@list false false false) (@list @t87 @t83 @t93))) % 0.19/0.55 (step @p95 :rule cnf_or_pos :args (@t96)) % 0.19/0.55 (step @p96 :rule reordering :premises (@p95) :args ((or @t81 @t92 @t91 @t95 @t89 (not @t96)))) % 0.19/0.55 (step @p97 :rule chain_m_resolution :premises (@p96 @p36 @p91 @p84 @p94 @p61) :args (@t95 (@list false false false true false) (@list @t62 @t87 @t83 @t89 @t96))) % 0.19/0.55 (step @p98 :rule bool-eq-true :args (@t94)) % 0.19/0.55 (step @p99 :rule absorb :args ((= (or @t97 true) true))) % 0.19/0.55 (step @p100 :rule eq-refl :args (tptp.nsup)) % 0.19/0.55 (step @p101 :rule refl :args (@t97)) % 0.19/0.55 (step @p102 :rule nary_cong :premises (@p101 @p100) :args (@t98)) % 0.19/0.55 (step @p103 :rule trans :premises (@p102 @p99)) % 0.19/0.55 (step @p104 :rule refl :args (@t94)) % 0.19/0.55 (step @p105 :rule cong :premises (@p104 @p103) :args (@t99)) % 0.19/0.55 (step @p106 :rule trans :premises (@p105 @p98)) % 0.19/0.55 (step @p107 :rule refl :args (@t12)) % 0.19/0.55 (step @p108 :rule cong :premises (@p107 @p106) :args ((=> @t12 @t99))) % 0.19/0.55 (assume-push @p116 @t12) % 0.19/0.55 (step @p110 :rule instantiate :premises (@p4) :args ((@list tptp.nsup tptp.nsup))) % 0.19/0.55 (step-pop @p117 :rule scope :premises (@p110)) % 0.19/0.55 (step @p111 :rule process_scope :premises (@p117) :args (@t99)) % 0.19/0.55 (step @p113 :rule eq_resolve :premises (@p111 @p108)) % 0.19/0.55 (step @p114 :rule implies_elim :premises (@p113)) % 0.19/0.55 (step @p115 false :rule chain_m_resolution :premises (@p114 @p97 @p4) :args (false (@list true false) (@list @t94 @t12))) % 0.19/0.55 ) % 0.19/0.55 % SZS output end Proof % 0.19/0.55 % cvc5 exiting %------------------------------------------------------------------------------