%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n018.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:57 AM UTC 2026 % Result : Theorem 0.30s 0.61s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.10/0.36 % Computer : n018.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Mon Sep 7 14:21:22 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.44 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.61 % SZS status Theorem % 0.30/0.61 % SZS output start Proof % 0.30/0.61 ( % 0.30/0.61 (declare-sort $$unsorted 0) % 0.30/0.61 (declare-const tptp.v400 $$unsorted) % 0.30/0.61 (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.61 (declare-const tptp.less (-> $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.val (-> $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.conflict $$unsorted) % 0.30/0.61 (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.v0 $$unsorted) % 0.30/0.61 (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.v50 $$unsorted) % 0.30/0.61 (declare-const tptp.is_verdict (-> $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.v100 $$unsorted) % 0.30/0.61 (declare-const tptp.compatible $$unsorted) % 0.30/0.61 (declare-const tptp.v200 $$unsorted) % 0.30/0.61 (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.61 (declare-const tptp.unknown $$unsorted) % 0.30/0.61 (define @t1 () (@var "X" $$unsorted)) % 0.30/0.61 (define @t2 () (@list @t1)) % 0.30/0.61 (define @t3 () (@var "Z" $$unsorted)) % 0.30/0.61 (define @t4 () (tptp.less @t1 @t3)) % 0.30/0.61 (define @t5 () (@var "Y" $$unsorted)) % 0.30/0.61 (define @t6 () (tptp.less @t5 @t3)) % 0.30/0.61 (define @t7 () (tptp.less @t1 @t5)) % 0.30/0.61 (define @t8 () (@list @t1 @t5 @t3)) % 0.30/0.61 (define @t9 () (= @t1 @t5)) % 0.30/0.61 (define @t10 () (@list @t1 @t5)) % 0.30/0.61 (define @t11 () (tptp.leq @t1 @t5)) % 0.30/0.61 (define @t12 () (tptp.leq @t5 @t1)) % 0.30/0.61 (define @t13 () (and @t11 @t12)) % 0.30/0.61 (define @t14 () (forall @t10 (=> @t13 @t9))) % 0.30/0.61 (define @t15 () (tptp.leq @t5 @t3)) % 0.30/0.61 (define @t16 () (tptp.leq @t1 @t3)) % 0.30/0.61 (define @t17 () (and @t11 @t15)) % 0.30/0.61 (define @t18 () (forall @t8 (=> @t17 @t16))) % 0.30/0.61 (define @t19 () (@var "B" $$unsorted)) % 0.30/0.61 (define @t20 () (tptp.leq @t1 @t19)) % 0.30/0.61 (define @t21 () (@var "A" $$unsorted)) % 0.30/0.61 (define @t22 () (tptp.leq @t21 @t1)) % 0.30/0.61 (define @t23 () (@list @t1 @t21 @t19)) % 0.30/0.61 (define @t24 () (tptp.less @t21 @t1)) % 0.30/0.61 (define @t25 () (tptp.less @t1 @t19)) % 0.30/0.61 (define @t26 () (@var "I2hi" $$unsorted)) % 0.30/0.61 (define @t27 () (@var "I2lo" $$unsorted)) % 0.30/0.61 (define @t28 () (tptp.in_closed @t1 @t27 @t26)) % 0.30/0.61 (define @t29 () (@var "I1hi" $$unsorted)) % 0.30/0.61 (define @t30 () (@var "I1lo" $$unsorted)) % 0.30/0.61 (define @t31 () (tptp.in_closed @t1 @t30 @t29)) % 0.30/0.61 (define @t32 () (exists @t2 (and @t31 @t28))) % 0.30/0.61 (define @t33 () (@list @t30 @t29 @t27 @t26)) % 0.30/0.61 (define @t34 () (@var "V" $$unsorted)) % 0.30/0.61 (define @t35 () (@var "V2" $$unsorted)) % 0.30/0.61 (define @t36 () (@var "V1" $$unsorted)) % 0.30/0.61 (define @t37 () (tptp.box_verdict @t36 @t35)) % 0.30/0.61 (define @t38 () (= @t37 tptp.conflict)) % 0.30/0.61 (define @t39 () (= @t35 tptp.conflict)) % 0.30/0.61 (define @t40 () (= @t36 tptp.conflict)) % 0.30/0.61 (define @t41 () (tptp.is_verdict @t35)) % 0.30/0.61 (define @t42 () (tptp.is_verdict @t36)) % 0.30/0.61 (define @t43 () (@list @t36 @t35)) % 0.30/0.61 (define @t44 () (= @t37 tptp.compatible)) % 0.30/0.61 (define @t45 () (= @t37 tptp.unknown)) % 0.30/0.61 (define @t46 () (tptp.less tptp.v50 tptp.v100)) % 0.30/0.61 (define @t47 () (tptp.less tptp.v100 tptp.v200)) % 0.30/0.61 (define @t48 () (tptp.less tptp.v200 tptp.v400)) % 0.30/0.61 (define @t49 () (= tptp.v200 tptp.v400)) % 0.30/0.61 (define @t50 () (= tptp.v100 tptp.v200)) % 0.30/0.61 (define @t51 () (= tptp.v50 tptp.v100)) % 0.30/0.61 (define @t52 () (tptp.leq tptp.v100 @t3)) % 0.30/0.61 (define @t53 () (tptp.leq tptp.v200 @t5)) % 0.30/0.61 (define @t54 () (tptp.leq tptp.v400 @t1)) % 0.30/0.61 (define @t55 () (tptp.in_lopen @t3 tptp.v0 tptp.v50)) % 0.30/0.61 (define @t56 () (tptp.in_lopen @t5 tptp.v0 tptp.v100)) % 0.30/0.61 (define @t57 () (tptp.in_lopen @t1 tptp.v0 tptp.v200)) % 0.30/0.61 (define @t58 () (or @t57 @t56 @t55)) % 0.30/0.61 (define @t59 () (and @t58 @t54 @t53 @t52)) % 0.30/0.61 (define @t60 () (exists @t8 @t59)) % 0.30/0.61 (define @t61 () (not @t12)) % 0.30/0.61 (define @t62 () (not @t11)) % 0.30/0.61 (define @t63 () (or @t62 @t61 @t9)) % 0.30/0.61 (define @t64 () (not @t15)) % 0.30/0.61 (define @t65 () (not @t52)) % 0.30/0.61 (define @t66 () (not @t53)) % 0.30/0.61 (define @t67 () (not @t54)) % 0.30/0.61 (define @t68 () (not @t55)) % 0.30/0.61 (define @t69 () (not @t56)) % 0.30/0.61 (define @t70 () (not @t57)) % 0.30/0.61 (define @t71 () (and @t70 @t69 @t68)) % 0.30/0.61 (define @t72 () (forall @t8 (or @t71 @t67 @t66 @t65))) % 0.30/0.61 (define @t73 () (@quantifiers_skolemize @t72 0)) % 0.30/0.61 (define @t74 () (@list tptp.v200 tptp.v400)) % 0.30/0.61 (define @t75 () (or @t48 @t49)) % 0.30/0.61 (define @t76 () (@list false)) % 0.30/0.61 (define @t77 () (tptp.leq tptp.v200 tptp.v400)) % 0.30/0.61 (define @t78 () (= @t77 @t75)) % 0.30/0.61 (define @t79 () (@list false false)) % 0.30/0.61 (define @t80 () (not @t58)) % 0.30/0.61 (define @t81 () (or @t80 @t67 @t66 @t65)) % 0.30/0.61 (define @t82 () (forall @t8 (not @t59))) % 0.30/0.61 (define @t83 () (not @t82)) % 0.30/0.61 (define @t84 () (tptp.leq tptp.v400 @t73)) % 0.30/0.61 (define @t85 () (@quantifiers_skolemize @t72 2)) % 0.30/0.61 (define @t86 () (tptp.leq tptp.v100 @t85)) % 0.30/0.61 (define @t87 () (not @t86)) % 0.30/0.61 (define @t88 () (@quantifiers_skolemize @t72 1)) % 0.30/0.61 (define @t89 () (tptp.leq tptp.v200 @t88)) % 0.30/0.61 (define @t90 () (not @t89)) % 0.30/0.61 (define @t91 () (not @t84)) % 0.30/0.61 (define @t92 () (tptp.in_lopen @t85 tptp.v0 tptp.v50)) % 0.30/0.61 (define @t93 () (not @t92)) % 0.30/0.61 (define @t94 () (tptp.in_lopen @t88 tptp.v0 tptp.v100)) % 0.30/0.61 (define @t95 () (not @t94)) % 0.30/0.61 (define @t96 () (tptp.in_lopen @t73 tptp.v0 tptp.v200)) % 0.30/0.61 (define @t97 () (not @t96)) % 0.30/0.61 (define @t98 () (and @t97 @t95 @t93)) % 0.30/0.61 (define @t99 () (or @t98 @t91 @t90 @t87)) % 0.30/0.61 (define @t100 () (@list true)) % 0.30/0.61 (define @t101 () (@list @t99)) % 0.30/0.61 (define @t102 () (tptp.leq tptp.v200 @t73)) % 0.30/0.61 (define @t103 () (not @t77)) % 0.30/0.61 (define @t104 () (or @t103 @t91 @t102)) % 0.30/0.61 (define @t105 () (tptp.leq tptp.v400 tptp.v200)) % 0.30/0.61 (define @t106 () (not @t105)) % 0.30/0.61 (define @t107 () (or @t103 @t106 @t49)) % 0.30/0.61 (define @t108 () (@list true false false)) % 0.30/0.61 (define @t109 () (= tptp.v200 @t73)) % 0.30/0.61 (define @t110 () (not @t109)) % 0.30/0.61 (define @t111 () (and @t106 @t109 @t84)) % 0.30/0.61 (define @t112 () (@list tptp.v50 tptp.v100)) % 0.30/0.61 (define @t113 () (or @t46 @t51)) % 0.30/0.61 (define @t114 () (tptp.leq tptp.v50 tptp.v100)) % 0.30/0.61 (define @t115 () (= @t114 @t113)) % 0.30/0.61 (define @t116 () (tptp.leq tptp.v100 tptp.v50)) % 0.30/0.61 (define @t117 () (not @t116)) % 0.30/0.61 (define @t118 () (not @t114)) % 0.30/0.61 (define @t119 () (or @t118 @t117 @t51)) % 0.30/0.61 (define @t120 () (tptp.leq @t85 tptp.v50)) % 0.30/0.61 (define @t121 () (not @t120)) % 0.30/0.61 (define @t122 () (or @t87 @t121 @t116)) % 0.30/0.61 (define @t123 () (@list false true false)) % 0.30/0.61 (define @t124 () (and (tptp.less tptp.v0 @t85) @t120)) % 0.30/0.61 (define @t125 () (not @t124)) % 0.30/0.61 (define @t126 () (= @t92 @t124)) % 0.30/0.61 (define @t127 () (@list true false)) % 0.30/0.61 (define @t128 () (@list tptp.v100 tptp.v200)) % 0.30/0.61 (define @t129 () (or @t47 @t50)) % 0.30/0.61 (define @t130 () (tptp.leq tptp.v100 tptp.v200)) % 0.30/0.61 (define @t131 () (= @t130 @t129)) % 0.30/0.61 (define @t132 () (tptp.leq tptp.v200 tptp.v100)) % 0.30/0.61 (define @t133 () (not @t132)) % 0.30/0.61 (define @t134 () (not @t130)) % 0.30/0.61 (define @t135 () (or @t134 @t133 @t50)) % 0.30/0.61 (define @t136 () (tptp.leq @t88 tptp.v100)) % 0.30/0.61 (define @t137 () (not @t136)) % 0.30/0.61 (define @t138 () (or @t90 @t137 @t132)) % 0.30/0.61 (define @t139 () (and (tptp.less tptp.v0 @t88) @t136)) % 0.30/0.61 (define @t140 () (not @t139)) % 0.30/0.61 (define @t141 () (= @t94 @t139)) % 0.30/0.61 (define @t142 () (tptp.leq @t73 tptp.v200)) % 0.30/0.61 (define @t143 () (and (tptp.less tptp.v0 @t73) @t142)) % 0.30/0.61 (define @t144 () (= @t96 @t143)) % 0.30/0.61 (define @t145 () (not @t142)) % 0.30/0.61 (define @t146 () (not @t102)) % 0.30/0.61 (define @t147 () (or @t146 @t145 @t109)) % 0.30/0.61 (define @t148 () (not @t147)) % 0.30/0.61 (define @t149 () (forall @t10 @t63)) % 0.30/0.61 (assume @p1 (forall @t2 (not (tptp.less @t1 @t1)))) % 0.30/0.61 (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4))) % 0.30/0.61 (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1)))) % 0.30/0.61 (assume @p4 (forall @t10 (= @t11 (or @t7 @t9)))) % 0.30/0.61 (assume @p5 @t14) % 0.30/0.61 (assume @p6 (forall @t10 (=> @t7 @t11))) % 0.30/0.61 (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4))) % 0.30/0.61 (assume @p8 (forall @t8 (=> (and @t7 @t15) @t4))) % 0.30/0.61 (assume @p9 @t18) % 0.30/0.61 (assume @p10 (forall @t23 (= (tptp.in_closed @t1 @t21 @t19) (and @t22 @t20)))) % 0.30/0.61 (assume @p11 (forall @t23 (= (tptp.in_lopen @t1 @t21 @t19) (and @t24 @t20)))) % 0.30/0.61 (assume @p12 (forall @t23 (= (tptp.in_ropen @t1 @t21 @t19) (and @t22 @t25)))) % 0.30/0.61 (assume @p13 (forall @t23 (= (tptp.in_open @t1 @t21 @t19) (and @t24 @t25)))) % 0.30/0.61 (assume @p14 (forall @t33 (= (tptp.axis_conflict @t30 @t29 @t27 @t26) (not @t32)))) % 0.30/0.61 (assume @p15 (forall @t33 (= (tptp.axis_compatible @t30 @t29 @t27 @t26) @t32))) % 0.30/0.61 (assume @p16 (forall @t33 (= (tptp.axis_subsumes @t30 @t29 @t27 @t26) (forall @t2 (=> @t31 @t28))))) % 0.30/0.61 (assume @p17 (tptp.is_verdict tptp.conflict)) % 0.30/0.61 (assume @p18 (tptp.is_verdict tptp.compatible)) % 0.30/0.61 (assume @p19 (tptp.is_verdict tptp.unknown)) % 0.30/0.61 (assume @p20 (not (= tptp.conflict tptp.compatible))) % 0.30/0.61 (assume @p21 (not (= tptp.conflict tptp.unknown))) % 0.30/0.61 (assume @p22 (not (= tptp.compatible tptp.unknown))) % 0.30/0.61 (assume @p23 (forall (@list @t34) (=> (tptp.is_verdict @t34) (or (= @t34 tptp.conflict) (= @t34 tptp.compatible) (= @t34 tptp.unknown))))) % 0.30/0.61 (assume @p24 (forall @t43 (=> (and @t42 @t41 (or @t40 @t39)) @t38))) % 0.30/0.61 (assume @p25 (forall @t43 (=> (and @t42 @t41 (= @t36 tptp.compatible) (= @t35 tptp.compatible)) @t44))) % 0.30/0.61 (assume @p26 (forall @t43 (=> (and @t42 @t41 (or (= @t36 tptp.unknown) (= @t35 tptp.unknown)) (not @t40) (not @t39)) @t45))) % 0.30/0.61 (assume @p27 (forall @t43 (=> (and @t42 @t41) (or @t38 @t44 @t45)))) % 0.30/0.61 (assume @p28 (tptp.val tptp.v0)) % 0.30/0.61 (assume @p29 (tptp.val tptp.v50)) % 0.30/0.61 (assume @p30 (tptp.val tptp.v100)) % 0.30/0.61 (assume @p31 (tptp.val tptp.v200)) % 0.30/0.61 (assume @p32 (tptp.val tptp.v400)) % 0.30/0.61 (assume @p33 (tptp.less tptp.v0 tptp.v50)) % 0.30/0.61 (assume @p34 (tptp.less tptp.v0 tptp.v100)) % 0.30/0.61 (assume @p35 (tptp.less tptp.v0 tptp.v200)) % 0.30/0.61 (assume @p36 (tptp.less tptp.v0 tptp.v400)) % 0.30/0.61 (assume @p37 @t46) % 0.30/0.61 (assume @p38 (tptp.less tptp.v50 tptp.v200)) % 0.30/0.61 (assume @p39 (tptp.less tptp.v50 tptp.v400)) % 0.30/0.61 (assume @p40 @t47) % 0.30/0.61 (assume @p41 (tptp.less tptp.v100 tptp.v400)) % 0.30/0.61 (assume @p42 @t48) % 0.30/0.61 (assume @p43 (and (not (= tptp.v0 tptp.v50)) (not (= tptp.v0 tptp.v100)) (not (= tptp.v0 tptp.v200)) (not (= tptp.v0 tptp.v400)) (not @t51) (not (= tptp.v50 tptp.v200)) (not (= tptp.v50 tptp.v400)) (not @t50) (not (= tptp.v100 tptp.v400)) (not @t49))) % 0.30/0.61 (assume @p44 (not (not @t60))) % 0.30/0.61 (assume @p45 true) % 0.30/0.61 (step @p46 :rule aci_norm :args ((= (or (or @t62 @t61) @t9) @t63))) % 0.30/0.61 (step @p47 :rule refl :args (@t9)) % 0.30/0.61 (step @p48 :rule bool-and-de-morgan :args (@t11 @t12 true)) % 0.30/0.61 (step @p49 :rule nary_cong :premises (@p48 @p47) :args ((or (not @t13) @t9))) % 0.30/0.61 (step @p50 :rule trans :premises (@p49 @p46)) % 0.30/0.61 (step @p51 :rule bool-impl-elim :args (@t13 @t9)) % 0.30/0.61 (step @p52 :rule trans :premises (@p51 @p50)) % 0.30/0.61 (step @p53 :rule cong :premises (@p52) :args (@t14)) % 0.30/0.61 (step @p54 :rule eq_resolve :premises (@p5 @p53)) % 0.30/0.61 (step @p55 :rule aci_norm :args ((= (or (or @t62 @t64) @t16) (or @t62 @t64 @t16)))) % 0.30/0.61 (step @p56 :rule refl :args (@t16)) % 0.30/0.61 (step @p57 :rule bool-and-de-morgan :args (@t11 @t15 true)) % 0.30/0.61 (step @p58 :rule nary_cong :premises (@p57 @p56) :args ((or (not @t17) @t16))) % 0.30/0.61 (step @p59 :rule trans :premises (@p58 @p55)) % 0.30/0.61 (step @p60 :rule bool-impl-elim :args (@t17 @t16)) % 0.30/0.61 (step @p61 :rule trans :premises (@p60 @p59)) % 0.30/0.61 (step @p62 :rule cong :premises (@p61) :args (@t18)) % 0.30/0.61 (step @p63 :rule eq_resolve :premises (@p9 @p62)) % 0.30/0.61 (step @p64 :rule instantiate :premises (@p63) :args ((@list tptp.v200 tptp.v400 @t73))) % 0.30/0.61 (step @p65 :rule instantiate :premises (@p4) :args (@t74)) % 0.30/0.61 (step @p66 :rule cnf_or_neg :args (@t75 0)) % 0.30/0.61 (step @p67 :rule reordering :premises (@p66) :args ((or (not @t48) @t75))) % 0.30/0.61 (step @p68 :rule chain_m_resolution :premises (@p67 @p42) :args (@t75 @t76 (@list @t48))) % 0.30/0.61 (step @p69 :rule cnf_equiv_pos2 :args (@t78)) % 0.30/0.61 (step @p70 :rule reordering :premises (@p69) :args ((or @t77 (not @t75) (not @t78)))) % 0.30/0.61 (step @p71 :rule chain_m_resolution :premises (@p70 @p68 @p65) :args (@t77 @t79 (@list @t75 @t78))) % 0.30/0.61 (step @p72 :rule refl :args (@t65)) % 0.30/0.61 (step @p73 :rule refl :args (@t66)) % 0.30/0.61 (step @p74 :rule refl :args (@t67)) % 0.30/0.61 (step @p75 :rule aci_norm :args ((= (and @t70 (and @t69 @t68)) @t71))) % 0.30/0.61 (step @p76 :rule bool-or-de-morgan :args (@t56 @t55 false)) % 0.30/0.61 (step @p77 :rule refl :args (@t70)) % 0.30/0.61 (step @p78 :rule nary_cong :premises (@p77 @p76) :args ((and @t70 (not (or @t56 @t55))))) % 0.30/0.61 (step @p79 :rule bool-or-de-morgan :args (@t57 @t56 (or @t55))) % 0.30/0.61 (step @p80 :rule trans :premises (@p79 @p78)) % 0.30/0.61 (step @p81 :rule trans :premises (@p80 @p75)) % 0.30/0.61 (step @p82 :rule nary_cong :premises (@p81 @p74 @p73 @p72) :args (@t81)) % 0.30/0.61 (step @p83 :rule aci_norm :args ((= (or @t80 (or @t67 (or @t66 @t65))) @t81))) % 0.30/0.61 (step @p84 :rule bool-and-de-morgan :args (@t53 @t52 true)) % 0.30/0.61 (step @p85 :rule nary_cong :premises (@p74 @p84) :args ((or @t67 (not (and @t53 @t52))))) % 0.30/0.61 (step @p86 :rule bool-and-de-morgan :args (@t54 @t53 (and @t52))) % 0.30/0.61 (step @p87 :rule trans :premises (@p86 @p85)) % 0.30/0.61 (step @p88 :rule refl :args (@t80)) % 0.30/0.61 (step @p89 :rule nary_cong :premises (@p88 @p87) :args ((or @t80 (not (and @t54 @t53 @t52))))) % 0.30/0.61 (step @p90 :rule bool-and-de-morgan :args (@t58 @t54 (and @t53 @t52))) % 0.30/0.61 (step @p91 :rule trans :premises (@p90 @p89)) % 0.30/0.61 (step @p92 :rule trans :premises (@p91 @p83)) % 0.30/0.61 (step @p93 :rule trans :premises (@p92 @p82)) % 0.30/0.61 (step @p94 :rule cong :premises (@p93) :args (@t82)) % 0.30/0.61 (step @p95 :rule cong :premises (@p94) :args (@t83)) % 0.30/0.61 (step @p96 :rule exists-elim :args ((= @t60 @t83))) % 0.30/0.61 (step @p97 :rule trans :premises (@p96 @p95)) % 0.30/0.61 (step @p98 :rule bool-double-not-elim :args (@t60)) % 0.30/0.61 (step @p99 :rule trans :premises (@p98 @p97)) % 0.30/0.61 (step @p100 :rule eq_resolve :premises (@p44 @p99)) % 0.30/0.61 (step @p101 :rule skolemize :premises (@p100)) % 0.30/0.61 (step @p102 :rule bool-double-not-elim :args (@t84)) % 0.30/0.61 (step @p103 :rule refl :args (@t99)) % 0.30/0.61 (step @p104 :rule nary_cong :premises (@p103 @p102) :args ((or @t99 (not @t91)))) % 0.30/0.61 (step @p105 :rule cnf_or_neg :args (@t99 1)) % 0.30/0.61 (step @p106 :rule eq_resolve :premises (@p105 @p104)) % 0.30/0.61 (step @p107 :rule reordering :premises (@p106) :args ((or @t84 @t99))) % 0.30/0.61 (step @p108 :rule chain_m_resolution :premises (@p107 @p101) :args (@t84 @t100 @t101)) % 0.30/0.61 (step @p109 :rule cnf_or_pos :args (@t104)) % 0.30/0.61 (step @p110 :rule reordering :premises (@p109) :args ((or @t91 @t103 @t102 (not @t104)))) % 0.30/0.61 (step @p111 :rule chain_m_resolution :premises (@p110 @p108 @p71 @p64) :args (@t102 (@list false false false) (@list @t84 @t77 @t104))) % 0.30/0.61 (step @p112 :rule instantiate :premises (@p54) :args (@t74)) % 0.30/0.61 (step @p113 :rule and_elim :premises (@p43) :args (9)) % 0.30/0.61 (step @p114 :rule cnf_or_pos :args (@t107)) % 0.30/0.61 (step @p115 :rule reordering :premises (@p114) :args ((or @t49 @t103 @t106 (not @t107)))) % 0.30/0.61 (step @p116 :rule chain_m_resolution :premises (@p115 @p113 @p71 @p112) :args (@t106 @t108 (@list @t49 @t77 @t107))) % 0.30/0.61 (step @p117 :rule bool-double-not-elim :args (@t105)) % 0.30/0.61 (step @p118 :rule refl :args (@t110)) % 0.30/0.61 (step @p119 :rule refl :args (@t91)) % 0.30/0.61 (step @p120 :rule nary_cong :premises (@p119 @p118 @p117) :args ((or @t91 @t110 (not @t106)))) % 0.30/0.61 (assume-push @p236 @t106) % 0.30/0.61 (assume-push @p237 @t109) % 0.30/0.61 (assume-push @p238 @t84) % 0.30/0.61 (step @p124 :rule evaluate :args ((= true false))) % 0.30/0.61 (step @p125 :rule false_intro :premises (@p116)) % 0.30/0.61 (step @p126 :rule symm :premises (@p237)) % 0.30/0.61 (step @p127 :rule refl :args (tptp.v400)) % 0.30/0.61 (step @p128 :rule cong :premises (@p127 @p126) :args (@t84)) % 0.30/0.61 (step @p129 :rule true_intro :premises (@p108)) % 0.30/0.61 (step @p130 :rule symm :premises (@p129)) % 0.30/0.61 (step @p131 :rule trans :premises (@p130 @p128 @p125)) % 0.30/0.61 (step @p132 false :rule eq_resolve :premises (@p131 @p124)) % 0.30/0.61 (step-pop @p239 :rule scope :premises (@p132)) % 0.30/0.61 (step-pop @p240 :rule scope :premises (@p239)) % 0.30/0.61 (step-pop @p241 :rule scope :premises (@p240)) % 0.30/0.61 (step @p133 :rule process_scope :premises (@p241) :args (false)) % 0.30/0.61 (assume-push @p242 @t84) % 0.30/0.61 (assume-push @p243 @t109) % 0.30/0.61 (assume-push @p244 @t106) % 0.30/0.61 (step @p140 :rule and_intro :premises (@p116 @p243 @p108)) % 0.30/0.61 (step-pop @p245 :rule scope :premises (@p140)) % 0.30/0.61 (step-pop @p246 :rule scope :premises (@p245)) % 0.30/0.61 (step-pop @p247 :rule scope :premises (@p246)) % 0.30/0.61 (step @p141 :rule process_scope :premises (@p247) :args (@t111)) % 0.30/0.61 (step @p145 :rule implies_elim :premises (@p141)) % 0.30/0.61 (step @p146 :rule resolution :premises (@p145 @p133) :args (true @t111)) % 0.30/0.61 (step @p147 :rule not_and :premises (@p146)) % 0.30/0.61 (step @p148 :rule eq_resolve :premises (@p147 @p120)) % 0.30/0.61 (step @p149 :rule reordering :premises (@p148) :args ((or @t91 @t105 @t110))) % 0.30/0.61 (step @p150 :rule chain_m_resolution :premises (@p149 @p108 @p116) :args (@t110 (@list false true) (@list @t84 @t105))) % 0.30/0.61 (step @p151 :rule instantiate :premises (@p11) :args ((@list @t73 tptp.v0 tptp.v200))) % 0.30/0.61 (step @p152 :rule cnf_or_neg :args (@t99 0)) % 0.30/0.61 (step @p153 :rule chain_m_resolution :premises (@p152 @p101) :args ((not @t98) @t100 @t101)) % 0.30/0.61 (step @p154 :rule instantiate :premises (@p11) :args ((@list @t85 tptp.v0 tptp.v50))) % 0.30/0.61 (step @p155 :rule instantiate :premises (@p63) :args ((@list tptp.v100 @t85 tptp.v50))) % 0.30/0.61 (step @p156 :rule instantiate :premises (@p54) :args (@t112)) % 0.30/0.61 (step @p157 :rule instantiate :premises (@p4) :args (@t112)) % 0.30/0.61 (step @p158 :rule cnf_or_neg :args (@t113 0)) % 0.30/0.61 (step @p159 :rule reordering :premises (@p158) :args ((or (not @t46) @t113))) % 0.30/0.61 (step @p160 :rule chain_m_resolution :premises (@p159 @p37) :args (@t113 @t76 (@list @t46))) % 0.30/0.61 (step @p161 :rule cnf_equiv_pos2 :args (@t115)) % 0.30/0.61 (step @p162 :rule reordering :premises (@p161) :args ((or @t114 (not @t113) (not @t115)))) % 0.30/0.61 (step @p163 :rule chain_m_resolution :premises (@p162 @p160 @p157) :args (@t114 @t79 (@list @t113 @t115))) % 0.30/0.61 (step @p164 :rule and_elim :premises (@p43) :args (4)) % 0.30/0.61 (step @p165 :rule cnf_or_pos :args (@t119)) % 0.30/0.61 (step @p166 :rule reordering :premises (@p165) :args ((or @t51 @t118 @t117 (not @t119)))) % 0.30/0.61 (step @p167 :rule chain_m_resolution :premises (@p166 @p164 @p163 @p156) :args (@t117 @t108 (@list @t51 @t114 @t119))) % 0.30/0.61 (step @p168 :rule bool-double-not-elim :args (@t86)) % 0.30/0.61 (step @p169 :rule nary_cong :premises (@p103 @p168) :args ((or @t99 (not @t87)))) % 0.30/0.61 (step @p170 :rule cnf_or_neg :args (@t99 3)) % 0.30/0.61 (step @p171 :rule eq_resolve :premises (@p170 @p169)) % 0.30/0.61 (step @p172 :rule reordering :premises (@p171) :args ((or @t86 @t99))) % 0.30/0.61 (step @p173 :rule chain_m_resolution :premises (@p172 @p101) :args (@t86 @t100 @t101)) % 0.30/0.61 (step @p174 :rule cnf_or_pos :args (@t122)) % 0.30/0.61 (step @p175 :rule reordering :premises (@p174) :args ((or @t87 @t121 @t116 (not @t122)))) % 0.30/0.61 (step @p176 :rule chain_m_resolution :premises (@p175 @p173 @p167 @p155) :args (@t121 @t123 (@list @t86 @t116 @t122))) % 0.30/0.61 (step @p177 :rule cnf_and_pos :args (@t124 1)) % 0.30/0.61 (step @p178 :rule reordering :premises (@p177) :args ((or @t120 @t125))) % 0.30/0.61 (step @p179 :rule chain_m_resolution :premises (@p178 @p176) :args (@t125 @t100 (@list @t120))) % 0.30/0.61 (step @p180 :rule cnf_equiv_pos1 :args (@t126)) % 0.30/0.61 (step @p181 :rule reordering :premises (@p180) :args ((or @t93 @t124 (not @t126)))) % 0.30/0.61 (step @p182 :rule chain_m_resolution :premises (@p181 @p179 @p154) :args (@t93 @t127 (@list @t124 @t126))) % 0.30/0.61 (step @p183 :rule instantiate :premises (@p11) :args ((@list @t88 tptp.v0 tptp.v100))) % 0.30/0.61 (step @p184 :rule instantiate :premises (@p63) :args ((@list tptp.v200 @t88 tptp.v100))) % 0.30/0.61 (step @p185 :rule instantiate :premises (@p54) :args (@t128)) % 0.30/0.61 (step @p186 :rule instantiate :premises (@p4) :args (@t128)) % 0.30/0.61 (step @p187 :rule cnf_or_neg :args (@t129 0)) % 0.30/0.61 (step @p188 :rule reordering :premises (@p187) :args ((or (not @t47) @t129))) % 0.30/0.61 (step @p189 :rule chain_m_resolution :premises (@p188 @p40) :args (@t129 @t76 (@list @t47))) % 0.30/0.61 (step @p190 :rule cnf_equiv_pos2 :args (@t131)) % 0.30/0.61 (step @p191 :rule reordering :premises (@p190) :args ((or @t130 (not @t129) (not @t131)))) % 0.30/0.61 (step @p192 :rule chain_m_resolution :premises (@p191 @p189 @p186) :args (@t130 @t79 (@list @t129 @t131))) % 0.30/0.61 (step @p193 :rule and_elim :premises (@p43) :args (7)) % 0.30/0.61 (step @p194 :rule cnf_or_pos :args (@t135)) % 0.30/0.61 (step @p195 :rule reordering :premises (@p194) :args ((or @t50 @t134 @t133 (not @t135)))) % 0.30/0.61 (step @p196 :rule chain_m_resolution :premises (@p195 @p193 @p192 @p185) :args (@t133 @t108 (@list @t50 @t130 @t135))) % 0.30/0.61 (step @p197 :rule bool-double-not-elim :args (@t89)) % 0.30/0.61 (step @p198 :rule nary_cong :premises (@p103 @p197) :args ((or @t99 (not @t90)))) % 0.30/0.61 (step @p199 :rule cnf_or_neg :args (@t99 2)) % 0.30/0.61 (step @p200 :rule eq_resolve :premises (@p199 @p198)) % 0.30/0.61 (step @p201 :rule reordering :premises (@p200) :args ((or @t89 @t99))) % 0.30/0.61 (step @p202 :rule chain_m_resolution :premises (@p201 @p101) :args (@t89 @t100 @t101)) % 0.30/0.61 (step @p203 :rule cnf_or_pos :args (@t138)) % 0.30/0.61 (step @p204 :rule reordering :premises (@p203) :args ((or @t90 @t137 @t132 (not @t138)))) % 0.30/0.61 (step @p205 :rule chain_m_resolution :premises (@p204 @p202 @p196 @p184) :args (@t137 @t123 (@list @t89 @t132 @t138))) % 0.30/0.61 (step @p206 :rule cnf_and_pos :args (@t139 1)) % 0.30/0.61 (step @p207 :rule reordering :premises (@p206) :args ((or @t136 @t140))) % 0.30/0.61 (step @p208 :rule chain_m_resolution :premises (@p207 @p205) :args (@t140 @t100 (@list @t136))) % 0.30/0.61 (step @p209 :rule cnf_equiv_pos1 :args (@t141)) % 0.30/0.61 (step @p210 :rule reordering :premises (@p209) :args ((or @t95 @t139 (not @t141)))) % 0.30/0.61 (step @p211 :rule chain_m_resolution :premises (@p210 @p208 @p183) :args (@t95 @t127 (@list @t139 @t141))) % 0.30/0.61 (step @p212 :rule bool-double-not-elim :args (@t92)) % 0.30/0.61 (step @p213 :rule bool-double-not-elim :args (@t94)) % 0.30/0.61 (step @p214 :rule bool-double-not-elim :args (@t96)) % 0.30/0.61 (step @p215 :rule refl :args (@t98)) % 0.30/0.62 (step @p216 :rule nary_cong :premises (@p215 @p214 @p213 @p212) :args ((or @t98 (not @t97) (not @t95) (not @t93)))) % 0.30/0.62 (step @p217 :rule cnf_and_neg :args (@t98)) % 0.30/0.62 (step @p218 :rule eq_resolve :premises (@p217 @p216)) % 0.30/0.62 (step @p219 :rule reordering :premises (@p218) :args ((or @t96 @t94 @t92 @t98))) % 0.30/0.62 (step @p220 :rule chain_m_resolution :premises (@p219 @p211 @p182 @p153) :args (@t96 (@list true true true) (@list @t94 @t92 @t98))) % 0.30/0.62 (step @p221 :rule cnf_equiv_pos1 :args (@t144)) % 0.30/0.62 (step @p222 :rule reordering :premises (@p221) :args ((or @t97 @t143 (not @t144)))) % 0.30/0.62 (step @p223 :rule chain_m_resolution :premises (@p222 @p220 @p151) :args (@t143 @t79 (@list @t96 @t144))) % 0.30/0.62 (step @p224 :rule cnf_and_pos :args (@t143 1)) % 0.30/0.62 (step @p225 :rule reordering :premises (@p224) :args ((or @t142 (not @t143)))) % 0.30/0.62 (step @p226 :rule chain_m_resolution :premises (@p225 @p223) :args (@t142 @t76 (@list @t143))) % 0.30/0.62 (step @p227 :rule cnf_or_pos :args (@t147)) % 0.30/0.62 (step @p228 :rule reordering :premises (@p227) :args ((or @t145 @t109 @t146 @t148))) % 0.30/0.62 (step @p229 :rule chain_m_resolution :premises (@p228 @p226 @p150 @p111) :args (@t148 @t123 (@list @t142 @t109 @t102))) % 0.30/0.62 (assume-push @p248 @t149) % 0.30/0.62 (step @p231 :rule instantiate :premises (@p54) :args ((@list tptp.v200 @t73))) % 0.30/0.62 (step-pop @p249 :rule scope :premises (@p231)) % 0.30/0.62 (step @p232 :rule process_scope :premises (@p249) :args (@t147)) % 0.30/0.62 (step @p234 :rule implies_elim :premises (@p232)) % 0.30/0.62 (step @p235 false :rule chain_m_resolution :premises (@p234 @p229 @p54) :args (false @t127 (@list @t147 @t149))) % 0.30/0.62 ) % 0.30/0.62 % SZS output end Proof % 0.30/0.62 % cvc5 exiting %------------------------------------------------------------------------------