%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYO068^4.001 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n013.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 09:11:56 AM UTC 2026 % Result : Theorem 0.45s 0.66s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYO068^4.001 : TPTP v9.2.1. Released v4.0.0. % 0.13/0.14 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n013.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue Jun 2 23:57:15 EDT 2026 % 0.16/0.35 % CPUTime : % 0.27/0.51 %----Proving TH0 % 0.45/0.66 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.45/0.66 % SZS status Theorem % 0.45/0.66 % SZS output start Proof % 0.45/0.66 ( % 0.45/0.66 (declare-sort $$unsorted 0) % 0.45/0.66 (declare-const tptp.irel (-> $$unsorted $$unsorted Bool)) % 0.45/0.66 (declare-const tptp.p0 (-> $$unsorted Bool)) % 0.45/0.66 (declare-const tptp.p1 (-> $$unsorted Bool)) % 0.45/0.66 (declare-const tptp.ifalse (-> $$unsorted Bool)) % 0.45/0.66 (define tptp.mnot () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (not (_ _let_2 _let_1)))))) % 0.45/0.66 (define tptp.mor () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (or (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.45/0.66 (define tptp.mand () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.45/0.66 (define tptp.mimplies () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "V" (-> $$unsorted Bool)))) (let ((_let_3 (@var "U" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1)))))) % 0.45/0.66 (define tptp.mbox_s4 () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (lambda (@list _let_2 _let_3) (forall (@list _let_1) (=> (_ (_ tptp.irel _let_3) _let_1) (_ _let_2 _let_1)))))))) % 0.45/0.66 (define tptp.iatom () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (_ _let_2 _let_1))))) % 0.45/0.66 (define tptp.inot () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ tptp.mbox_s4 _let_2)) _let_1))))) % 0.45/0.66 (define tptp.itrue () (lambda (@list (@var "W" $$unsorted)) true)) % 0.45/0.66 (define tptp.iand () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mand _let_3) _let_2) _let_1)))))) % 0.45/0.66 (define tptp.ior () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mbox_s4 _let_3)) (_ tptp.mbox_s4 _let_2)) _let_1)))))) % 0.45/0.66 (define tptp.iimplies () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mimplies (_ tptp.mbox_s4 _let_3)) (_ tptp.mbox_s4 _let_2)) _let_1)))))) % 0.45/0.66 (define tptp.iimplied () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Q" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.iimplies _let_3) _let_2) _let_1)))))) % 0.45/0.66 (define tptp.iequiv () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Q" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.iand (_ (_ tptp.iimplies _let_2) _let_3)) (_ (_ tptp.iimplies _let_3) _let_2)) _let_1)))))) % 0.45/0.66 (define tptp.ixor () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.inot (_ (_ tptp.iequiv _let_3) _let_2)) _let_1)))))) % 0.45/0.66 (define tptp.ivalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ _let_2 _let_1)))))) % 0.45/0.66 (define tptp.isatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (_ _let_2 _let_1)))))) % 0.45/0.66 (define tptp.icountersatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.45/0.66 (define tptp.iinvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.45/0.66 (define @t1 () (@var "X" $$unsorted)) % 0.45/0.66 (define @t2 () (_ tptp.irel @t1)) % 0.45/0.66 (define @t3 () (_ @t2 @t1)) % 0.45/0.66 (define @t4 () (@list @t1)) % 0.45/0.66 (define @t5 () (forall @t4 @t3)) % 0.45/0.66 (define @t6 () (@var "Z" $$unsorted)) % 0.45/0.66 (define @t7 () (@var "Y" $$unsorted)) % 0.45/0.66 (define @t8 () (_ @t2 @t7)) % 0.45/0.66 (define @t9 () (_ tptp.iatom tptp.p1)) % 0.45/0.66 (define @t10 () (_ tptp.iatom tptp.p0)) % 0.45/0.66 (define @t11 () (_ tptp.iimplies @t9)) % 0.45/0.66 (define @t12 () (not (_ tptp.ivalid @t10))) % 0.45/0.66 (define @t13 () (@var "U" $$unsorted)) % 0.45/0.66 (define @t14 () (@var "X" (-> $$unsorted Bool))) % 0.45/0.66 (define @t15 () (_ @t14 @t13)) % 0.45/0.66 (define @t16 () (lambda (@list @t14 @t13) (not @t15))) % 0.45/0.66 (define @t17 () (@var "Y" (-> $$unsorted Bool))) % 0.45/0.66 (define @t18 () (_ @t17 @t13)) % 0.45/0.66 (define @t19 () (@list @t14 @t17 @t13)) % 0.45/0.66 (define @t20 () (lambda @t19 (or @t15 @t18))) % 0.45/0.66 (define @t21 () (lambda @t19 (and @t15 @t18))) % 0.45/0.66 (define @t22 () (@var "__flatten_var_0" $$unsorted)) % 0.45/0.66 (define @t23 () (@var "V" (-> $$unsorted Bool))) % 0.45/0.66 (define @t24 () (@var "U" (-> $$unsorted Bool))) % 0.45/0.66 (define @t25 () (@list @t24 @t23 @t22)) % 0.45/0.66 (define @t26 () (lambda @t25 (_ (_ (_ tptp.mor (_ tptp.mnot @t24)) @t23) @t22))) % 0.45/0.66 (define @t27 () (@var "P" (-> $$unsorted Bool))) % 0.45/0.66 (define @t28 () (_ @t27 @t7)) % 0.45/0.66 (define @t29 () (@list @t7)) % 0.45/0.66 (define @t30 () (forall @t29 (=> @t8 @t28))) % 0.45/0.66 (define @t31 () (@list @t27 @t1)) % 0.45/0.66 (define @t32 () (lambda @t31 @t30)) % 0.45/0.66 (define @t33 () (@list @t27 @t22)) % 0.45/0.66 (define @t34 () (lambda @t33 (_ @t27 @t22))) % 0.45/0.66 (define @t35 () (_ tptp.mbox_s4 @t27)) % 0.45/0.66 (define @t36 () (lambda @t33 (_ (_ tptp.mnot @t35) @t22))) % 0.45/0.66 (define @t37 () (@var "W" $$unsorted)) % 0.45/0.66 (define @t38 () (@list @t37)) % 0.45/0.66 (define @t39 () (lambda @t38 true)) % 0.45/0.66 (define @t40 () (@var "Q" (-> $$unsorted Bool))) % 0.45/0.66 (define @t41 () (@list @t27 @t40 @t22)) % 0.45/0.66 (define @t42 () (lambda @t41 (_ (_ (_ tptp.mand @t27) @t40) @t22))) % 0.45/0.66 (define @t43 () (_ tptp.mbox_s4 @t40)) % 0.45/0.66 (define @t44 () (lambda @t41 (_ (_ (_ tptp.mor @t35) @t43) @t22))) % 0.45/0.66 (define @t45 () (lambda @t41 (_ (_ (_ tptp.mimplies @t35) @t43) @t22))) % 0.45/0.66 (define @t46 () (_ (_ tptp.iimplies @t40) @t27)) % 0.45/0.66 (define @t47 () (lambda @t41 (_ @t46 @t22))) % 0.45/0.66 (define @t48 () (lambda @t41 (_ (_ (_ tptp.iand (_ (_ tptp.iimplies @t27) @t40)) @t46) @t22))) % 0.45/0.66 (define @t49 () (lambda @t41 (_ (_ tptp.inot (_ (_ tptp.iequiv @t27) @t40)) @t22))) % 0.45/0.66 (define @t50 () (@var "Phi" (-> $$unsorted Bool))) % 0.45/0.66 (define @t51 () (_ @t50 @t37)) % 0.45/0.66 (define @t52 () (forall @t38 @t51)) % 0.45/0.66 (define @t53 () (@list @t50)) % 0.45/0.66 (define @t54 () (lambda @t53 @t52)) % 0.45/0.66 (define @t55 () (lambda @t53 (exists @t38 @t51))) % 0.45/0.66 (define @t56 () (not @t51)) % 0.45/0.66 (define @t57 () (lambda @t53 (exists @t38 @t56))) % 0.45/0.66 (define @t58 () (lambda @t53 (forall @t38 @t56))) % 0.45/0.66 (define @t59 () (tptp.p1 @t37)) % 0.45/0.66 (define @t60 () (_ tptp.p1 @t37)) % 0.45/0.66 (define @t61 () (@list @t22)) % 0.45/0.66 (define @t62 () (lambda @t61 (_ tptp.p1 @t22))) % 0.45/0.66 (define @t63 () (_ @t62 @t37)) % 0.45/0.66 (define @t64 () (forall @t38 @t63)) % 0.45/0.66 (define @t65 () (_ @t50 @t37)) % 0.45/0.66 (define @t66 () (lambda @t53 (forall @t38 @t65))) % 0.45/0.66 (define @t67 () (tptp.p1 @t7)) % 0.45/0.66 (define @t68 () (tptp.p0 @t37)) % 0.45/0.66 (define @t69 () (@quantifiers_skolemize (forall @t38 @t68) 0)) % 0.45/0.66 (define @t70 () (forall @t29 (or (not (tptp.irel @t69 @t7)) @t67))) % 0.45/0.66 (define @t71 () (@list @t7)) % 0.45/0.66 (define @t72 () (@var "BOUND_VARIABLE_8076" $$unsorted)) % 0.45/0.66 (define @t73 () (@list @t72)) % 0.45/0.66 (define @t74 () (_ tptp.p0 @t37)) % 0.45/0.66 (define @t75 () (lambda @t61 (_ tptp.p0 @t22))) % 0.45/0.66 (define @t76 () (_ @t75 @t37)) % 0.45/0.66 (define @t77 () (forall @t38 @t76)) % 0.45/0.66 (define @t78 () (_ @t34 tptp.p0)) % 0.45/0.66 (define @t79 () (tptp.irel @t1 @t1)) % 0.45/0.66 (define @t80 () (@var "BOUND_VARIABLE_8128" $$unsorted)) % 0.45/0.66 (define @t81 () (tptp.p0 @t80)) % 0.45/0.66 (define @t82 () (@var "BOUND_VARIABLE_8126" $$unsorted)) % 0.45/0.66 (define @t83 () (not (tptp.irel @t82 @t80))) % 0.45/0.66 (define @t84 () (tptp.p1 @t72)) % 0.45/0.66 (define @t85 () (@list @t72)) % 0.45/0.66 (define @t86 () (not (forall @t85 (or (not (tptp.irel @t82 @t72)) @t84)))) % 0.45/0.66 (define @t87 () (not (tptp.irel @t37 @t82))) % 0.45/0.66 (define @t88 () (not (tptp.irel @t37 @t7))) % 0.45/0.66 (define @t89 () (not (forall @t29 (or @t88 @t67)))) % 0.45/0.66 (define @t90 () (or @t87 @t86 @t83 @t81)) % 0.45/0.66 (define @t91 () (or @t89 @t90)) % 0.45/0.66 (define @t92 () (forall (@list @t37 @t82 @t80) @t91)) % 0.45/0.66 (define @t93 () (@list @t82 @t80)) % 0.45/0.66 (define @t94 () (forall @t93 @t91)) % 0.45/0.66 (define @t95 () (forall @t93 @t90)) % 0.45/0.66 (define @t96 () (@var "BOUND_VARIABLE_8101" $$unsorted)) % 0.45/0.66 (define @t97 () (or @t89 @t95)) % 0.45/0.66 (define @t98 () (tptp.p0 @t96)) % 0.45/0.66 (define @t99 () (not (tptp.irel @t7 @t96))) % 0.45/0.66 (define @t100 () (not (forall @t85 (or (not (tptp.irel @t7 @t72)) @t84)))) % 0.45/0.66 (define @t101 () (@list @t7 @t96)) % 0.45/0.66 (define @t102 () (or @t89 (forall @t101 (or @t88 @t100 @t99 @t98)))) % 0.45/0.66 (define @t103 () (not (tptp.irel @t22 @t7))) % 0.45/0.66 (define @t104 () (or @t103 @t100 @t99 @t98)) % 0.45/0.66 (define @t105 () (forall @t29 (or @t103 @t67))) % 0.45/0.66 (define @t106 () (not @t105)) % 0.45/0.66 (define @t107 () (lambda @t61 (or @t106 (forall @t101 @t104)))) % 0.45/0.66 (define @t108 () (_ @t107 @t37)) % 0.45/0.66 (define @t109 () (forall @t38 @t108)) % 0.45/0.66 (define @t110 () (or @t99 @t98)) % 0.45/0.66 (define @t111 () (or @t103 @t100 @t110)) % 0.45/0.66 (define @t112 () (forall @t101 @t111)) % 0.45/0.66 (define @t113 () (@list @t96)) % 0.45/0.66 (define @t114 () (forall @t113 @t111)) % 0.45/0.66 (define @t115 () (forall @t113 @t110)) % 0.45/0.66 (define @t116 () (@var "BOUND_VARIABLE_8068" $$unsorted)) % 0.45/0.66 (define @t117 () (@list @t116)) % 0.45/0.66 (define @t118 () (or @t103 @t100 @t115)) % 0.45/0.66 (define @t119 () (tptp.p0 @t116)) % 0.45/0.66 (define @t120 () (@list @t116)) % 0.45/0.66 (define @t121 () (forall @t120 (or (not (tptp.irel @t7 @t116)) @t119))) % 0.45/0.66 (define @t122 () (or @t103 @t100 @t121)) % 0.45/0.66 (define @t123 () (or @t100 @t121)) % 0.45/0.66 (define @t124 () (tptp.p0 @t7)) % 0.45/0.66 (define @t125 () (forall @t29 (or @t103 @t124))) % 0.45/0.66 (define @t126 () (or @t106 @t125)) % 0.45/0.66 (define @t127 () (lambda @t61 @t126)) % 0.45/0.66 (define @t128 () (or @t103 (_ @t127 @t7))) % 0.45/0.66 (define @t129 () (forall @t29 @t128)) % 0.45/0.66 (define @t130 () (or @t106 @t129)) % 0.45/0.66 (define @t131 () (lambda @t61 @t130)) % 0.45/0.66 (define @t132 () (_ @t40 @t7)) % 0.45/0.66 (define @t133 () (forall @t29 (or @t103 @t132))) % 0.45/0.66 (define @t134 () (@list @t40 @t22)) % 0.45/0.66 (define @t135 () (lambda @t134 (or @t106 @t133))) % 0.45/0.66 (define @t136 () (_ tptp.p0 @t7)) % 0.45/0.66 (define @t137 () (or @t103 @t136)) % 0.45/0.66 (define @t138 () (_ @t75 @t7)) % 0.45/0.66 (define @t139 () (or @t103 @t138)) % 0.45/0.66 (define @t140 () (forall @t29 @t139)) % 0.45/0.66 (define @t141 () (or @t106 @t140)) % 0.45/0.66 (define @t142 () (lambda @t61 @t141)) % 0.45/0.66 (define @t143 () (_ tptp.p1 @t7)) % 0.45/0.66 (define @t144 () (or @t103 @t143)) % 0.45/0.66 (define @t145 () (_ @t62 @t7)) % 0.45/0.66 (define @t146 () (or @t103 @t145)) % 0.45/0.66 (define @t147 () (forall @t29 @t146)) % 0.45/0.66 (define @t148 () (not @t147)) % 0.45/0.66 (define @t149 () (or @t148 @t133)) % 0.45/0.66 (define @t150 () (lambda @t134 @t149)) % 0.45/0.66 (define @t151 () (_ @t27 @t7)) % 0.45/0.66 (define @t152 () (forall @t29 (or @t103 @t151))) % 0.45/0.66 (define @t153 () (not @t152)) % 0.45/0.66 (define @t154 () (or @t153 @t133)) % 0.45/0.66 (define @t155 () (lambda @t41 @t154)) % 0.45/0.66 (define @t156 () (tptp.irel @t1 @t7)) % 0.45/0.66 (define @t157 () (not @t156)) % 0.45/0.66 (define @t158 () (lambda @t4 (forall @t29 (or @t157 @t132)))) % 0.45/0.66 (define @t159 () (_ @t158 @t22)) % 0.45/0.66 (define @t160 () (or @t153 @t159)) % 0.45/0.66 (define @t161 () (lambda @t61 @t160)) % 0.45/0.66 (define @t162 () (_ @t23 @t22)) % 0.45/0.66 (define @t163 () (@list @t23 @t22)) % 0.45/0.66 (define @t164 () (forall @t29 (or @t157 @t151))) % 0.45/0.66 (define @t165 () (lambda @t31 @t164)) % 0.45/0.66 (define @t166 () (lambda @t4 @t164)) % 0.45/0.66 (define @t167 () (_ @t166 @t22)) % 0.45/0.66 (define @t168 () (not @t167)) % 0.45/0.66 (define @t169 () (or @t168 @t162)) % 0.45/0.66 (define @t170 () (lambda @t163 @t169)) % 0.45/0.66 (define @t171 () (or (not (_ @t24 @t22)) @t162)) % 0.45/0.66 (define @t172 () (lambda @t25 @t171)) % 0.45/0.66 (define @t173 () (not @t8)) % 0.45/0.66 (define @t174 () (or @t173 @t28)) % 0.45/0.66 (define @t175 () (not (_ @t24 @t13))) % 0.45/0.66 (define @t176 () (@list @t13)) % 0.45/0.66 (define @t177 () (lambda @t176 (or @t175 (_ @t23 @t13)))) % 0.45/0.66 (define @t178 () (@list @t17 @t13)) % 0.45/0.66 (define @t179 () (lambda @t176 @t175)) % 0.45/0.66 (define @t180 () (_ @t179 @t13)) % 0.45/0.66 (define @t181 () (or @t180 @t18)) % 0.45/0.66 (define @t182 () (lambda @t178 @t181)) % 0.45/0.66 (define @t183 () (tptp.p0 @t69)) % 0.45/0.66 (define @t184 () (tptp.irel @t69 @t69)) % 0.45/0.66 (define @t185 () (not @t184)) % 0.45/0.66 (define @t186 () (forall @t85 (or (not (tptp.irel @t69 @t72)) @t84))) % 0.45/0.66 (define @t187 () (not @t186)) % 0.45/0.66 (define @t188 () (not @t70)) % 0.45/0.66 (define @t189 () (or @t188 @t185 @t187 @t185 @t183)) % 0.45/0.66 (define @t190 () (@quantifiers_skolemize @t70 0)) % 0.45/0.66 (define @t191 () (tptp.p1 @t190)) % 0.45/0.66 (define @t192 () (or (not (tptp.irel @t69 @t190)) @t191)) % 0.45/0.66 (define @t193 () (forall @t38 @t59)) % 0.45/0.66 (assume @p1 @t5) % 0.45/0.66 (assume @p2 (forall (@list @t1 @t7 @t6) (=> (and @t8 (_ (_ tptp.irel @t7) @t6)) (_ @t2 @t6)))) % 0.45/0.66 (assume @p3 (= tptp.ifalse (_ tptp.inot tptp.itrue))) % 0.45/0.66 (assume @p4 (_ tptp.ivalid @t9)) % 0.45/0.66 (assume @p5 (_ tptp.ivalid (_ @t11 (_ @t11 @t10)))) % 0.45/0.66 (assume @p6 @t12) % 0.45/0.66 (assume @p7 true) % 0.45/0.66 (step @p8 (= tptp.mnot @t16) :rule refl :args (@t16)) % 0.45/0.66 (step @p9 (= tptp.mor @t20) :rule refl :args (@t20)) % 0.45/0.66 (step @p10 (= tptp.mand @t21) :rule refl :args (@t21)) % 0.45/0.66 (step @p11 (= tptp.mimplies @t26) :rule refl :args (@t26)) % 0.45/0.66 (step @p12 (= tptp.mbox_s4 @t32) :rule refl :args (@t32)) % 0.45/0.66 (step @p13 (= tptp.iatom @t34) :rule refl :args (@t34)) % 0.45/0.66 (step @p14 (= tptp.inot @t36) :rule refl :args (@t36)) % 0.45/0.66 (step @p15 (= tptp.itrue @t39) :rule refl :args (@t39)) % 0.45/0.66 (step @p16 (= tptp.iand @t42) :rule refl :args (@t42)) % 0.45/0.66 (step @p17 (= tptp.ior @t44) :rule refl :args (@t44)) % 0.45/0.66 (step @p18 (= tptp.iimplies @t45) :rule refl :args (@t45)) % 0.45/0.66 (step @p19 (= tptp.iimplied @t47) :rule refl :args (@t47)) % 0.45/0.66 (step @p20 (= tptp.iequiv @t48) :rule refl :args (@t48)) % 0.45/0.66 (step @p21 (= tptp.ixor @t49) :rule refl :args (@t49)) % 0.45/0.66 (step @p22 (= tptp.ivalid @t54) :rule refl :args (@t54)) % 0.45/0.66 (step @p23 (= tptp.isatisfiable @t55) :rule refl :args (@t55)) % 0.45/0.66 (step @p24 (= tptp.icountersatisfiable @t57) :rule refl :args (@t57)) % 0.45/0.66 (step @p25 (= tptp.iinvalid @t58) :rule refl :args (@t58)) % 0.45/0.66 (step @p26 :rule refl :args (@t59)) % 0.45/0.66 (step @p27 :rule refl :args (@t60)) % 0.45/0.66 (step @p28 :rule cong :premises (@p27 @p26) :args ((= @t60 @t59))) % 0.45/0.66 (step @p29 :rule symm :premises (@p28)) % 0.45/0.66 (step @p30 :rule eq_resolve :premises (@p27 @p29)) % 0.45/0.66 (step @p31 :rule cong :premises (@p30) :args ((forall @t38 @t60))) % 0.45/0.66 (step @p32 :rule beta-reduce :args ((= @t63 @t60))) % 0.45/0.66 (step @p33 :rule cong :premises (@p32) :args (@t64)) % 0.45/0.66 (step @p34 :rule trans :premises (@p33 @p31)) % 0.45/0.66 (step @p35 :rule beta-reduce :args ((= (_ @t66 @t62) @t64))) % 0.45/0.66 (step @p36 :rule trans :premises (@p35 @p34)) % 0.45/0.66 (step @p37 :rule beta-reduce :args ((= (_ @t34 tptp.p1) @t62))) % 0.45/0.66 (step @p38 :rule refl :args (@t66)) % 0.45/0.66 (step @p39 :rule ho_cong :premises (@p38 @p37)) % 0.45/0.66 (step @p40 :rule trans :premises (@p39 @p36)) % 0.45/0.66 (step @p41 :rule refl :args (tptp.p1)) % 0.45/0.66 (step @p42 :rule ho_cong :premises (@p13 @p41)) % 0.45/0.66 (step @p43 :rule refl :args (@t65)) % 0.45/0.66 (step @p44 :rule refl :args (@t51)) % 0.45/0.66 (step @p45 :rule cong :premises (@p44 @p43) :args ((= @t51 @t65))) % 0.45/0.66 (step @p46 :rule symm :premises (@p45)) % 0.45/0.66 (step @p47 :rule eq_resolve :premises (@p44 @p46)) % 0.45/0.66 (step @p48 :rule cong :premises (@p47) :args (@t52)) % 0.45/0.66 (step @p49 :rule cong :premises (@p48) :args (@t54)) % 0.45/0.66 (step @p50 :rule trans :premises (@p22 @p49)) % 0.45/0.66 (step @p51 :rule ho_cong :premises (@p50 @p42)) % 0.45/0.66 (step @p52 :rule trans :premises (@p51 @p40)) % 0.45/0.66 (step @p53 :rule eq_resolve :premises (@p4 @p52)) % 0.45/0.66 (step @p54 :rule alpha_equiv :args (@t70 @t71 @t73)) % 0.45/0.66 (step @p55 :rule equiv_elim1 :premises (@p54)) % 0.45/0.66 (step @p56 :rule refl :args (@t68)) % 0.45/0.66 (step @p57 :rule refl :args (@t74)) % 0.45/0.66 (step @p58 :rule cong :premises (@p57 @p56) :args ((= @t74 @t68))) % 0.45/0.66 (step @p59 :rule symm :premises (@p58)) % 0.45/0.66 (step @p60 :rule eq_resolve :premises (@p57 @p59)) % 0.45/0.66 (step @p61 :rule cong :premises (@p60) :args ((forall @t38 @t74))) % 0.45/0.66 (step @p62 :rule beta-reduce :args ((= @t76 @t74))) % 0.45/0.66 (step @p63 :rule cong :premises (@p62) :args (@t77)) % 0.45/0.66 (step @p64 :rule trans :premises (@p63 @p61)) % 0.45/0.66 (step @p65 :rule beta-reduce :args ((= (_ @t66 @t75) @t77))) % 0.45/0.66 (step @p66 :rule trans :premises (@p65 @p64)) % 0.45/0.66 (step @p67 :rule beta-reduce :args ((= @t78 @t75))) % 0.45/0.66 (step @p68 :rule ho_cong :premises (@p38 @p67)) % 0.45/0.66 (step @p69 :rule trans :premises (@p68 @p66)) % 0.45/0.66 (step @p70 :rule cong :premises (@p69) :args ((not (_ @t66 @t78)))) % 0.45/0.66 (step @p71 :rule refl :args (tptp.p0)) % 0.45/0.66 (step @p72 :rule ho_cong :premises (@p13 @p71)) % 0.45/0.66 (step @p73 :rule ho_cong :premises (@p50 @p72)) % 0.45/0.66 (step @p74 :rule cong :premises (@p73) :args (@t12)) % 0.45/0.66 (step @p75 :rule trans :premises (@p74 @p70)) % 0.45/0.66 (step @p76 :rule eq_resolve :premises (@p6 @p75)) % 0.45/0.66 (step @p77 :rule skolemize :premises (@p76)) % 0.45/0.66 (step @p78 :rule refl :args (@t79)) % 0.45/0.66 (step @p79 :rule refl :args (@t3)) % 0.45/0.66 (step @p80 :rule cong :premises (@p79 @p78) :args ((= @t3 @t79))) % 0.45/0.66 (step @p81 :rule symm :premises (@p80)) % 0.45/0.66 (step @p82 :rule eq_resolve :premises (@p79 @p81)) % 0.45/0.66 (step @p83 :rule cong :premises (@p82) :args (@t5)) % 0.45/0.66 (step @p84 :rule eq_resolve :premises (@p1 @p83)) % 0.45/0.66 (step @p85 :rule instantiate :premises (@p84) :args ((@list @t69))) % 0.45/0.66 (step @p86 :rule aci_norm :args ((= @t91 (or @t89 @t87 @t86 @t83 @t81)))) % 0.45/0.66 (step @p87 :rule cong :premises (@p86) :args (@t92)) % 0.45/0.66 (step @p88 :rule quant-merge-prenex :args ((= (forall @t38 @t94) @t92))) % 0.45/0.66 (step @p89 :rule alpha_equiv :args (@t95 (@list @t82 @t80) (@list @t7 @t96))) % 0.45/0.66 (step @p90 :rule refl :args (@t89)) % 0.45/0.66 (step @p91 :rule nary_cong :premises (@p90 @p89) :args (@t97)) % 0.45/0.66 (step @p92 :rule quant-miniscope-or :args ((= @t94 @t97))) % 0.45/0.66 (step @p93 :rule trans :premises (@p92 @p91)) % 0.45/0.66 (step @p94 :rule symm :premises (@p93)) % 0.45/0.66 (step @p95 :rule cong :premises (@p94) :args ((forall @t38 @t102))) % 0.45/0.66 (step @p96 :rule trans :premises (@p95 @p88)) % 0.45/0.66 (step @p97 :rule trans :premises (@p96 @p87)) % 0.45/0.66 (step @p98 :rule beta-reduce :args ((= @t108 @t102))) % 0.45/0.66 (step @p99 :rule cong :premises (@p98) :args (@t109)) % 0.45/0.66 (step @p100 :rule trans :premises (@p99 @p97)) % 0.45/0.66 (step @p101 :rule beta-reduce :args ((= (_ @t66 @t107) @t109))) % 0.45/0.66 (step @p102 :rule trans :premises (@p101 @p100)) % 0.45/0.66 (step @p103 :rule aci_norm :args ((= @t111 @t104))) % 0.45/0.66 (step @p104 :rule cong :premises (@p103) :args (@t112)) % 0.45/0.66 (step @p105 :rule quant-merge-prenex :args ((= (forall @t29 @t114) @t112))) % 0.45/0.66 (step @p106 :rule alpha_equiv :args (@t115 (@list @t96) @t117)) % 0.45/0.66 (step @p107 :rule refl :args (@t100)) % 0.45/0.66 (step @p108 :rule refl :args (@t103)) % 0.45/0.66 (step @p109 :rule nary_cong :premises (@p108 @p107 @p106) :args (@t118)) % 0.45/0.66 (step @p110 :rule quant-miniscope-or :args ((= @t114 @t118))) % 0.45/0.66 (step @p111 :rule trans :premises (@p110 @p109)) % 0.45/0.66 (step @p112 :rule symm :premises (@p111)) % 0.45/0.66 (step @p113 :rule cong :premises (@p112) :args ((forall @t29 @t122))) % 0.45/0.66 (step @p114 :rule trans :premises (@p113 @p105)) % 0.45/0.66 (step @p115 :rule trans :premises (@p114 @p104)) % 0.45/0.66 (step @p116 :rule aci_norm :args ((= (or @t103 @t123) @t122))) % 0.45/0.66 (step @p117 :rule beta-reduce :args ((= (_ (lambda @t61 (or (not (forall @t85 (or (not (tptp.irel @t22 @t72)) @t84))) (forall @t120 (or (not (tptp.irel @t22 @t116)) @t119)))) @t7) @t123))) % 0.45/0.66 (step @p118 :rule refl :args (@t7)) % 0.45/0.66 (step @p119 :rule alpha_equiv :args (@t125 @t71 @t117)) % 0.45/0.66 (step @p120 :rule alpha_equiv :args (@t105 @t71 @t73)) % 0.45/0.66 (step @p121 :rule cong :premises (@p120) :args (@t106)) % 0.45/0.66 (step @p122 :rule nary_cong :premises (@p121 @p119) :args (@t126)) % 0.45/0.66 (step @p123 :rule cong :premises (@p122) :args (@t127)) % 0.45/0.66 (step @p124 :rule ho_cong :premises (@p123 @p118)) % 0.45/0.66 (step @p125 :rule trans :premises (@p124 @p117)) % 0.45/0.66 (step @p126 :rule refl :args (@t103)) % 0.45/0.66 (step @p127 :rule nary_cong :premises (@p126 @p125) :args (@t128)) % 0.45/0.66 (step @p128 :rule trans :premises (@p127 @p116)) % 0.45/0.66 (step @p129 :rule cong :premises (@p128) :args (@t129)) % 0.45/0.66 (step @p130 :rule trans :premises (@p129 @p115)) % 0.45/0.66 (step @p131 :rule refl :args (@t106)) % 0.45/0.66 (step @p132 :rule nary_cong :premises (@p131 @p130) :args (@t130)) % 0.45/0.66 (step @p133 :rule cong :premises (@p132) :args (@t131)) % 0.45/0.66 (step @p134 :rule beta-reduce :args ((= (_ @t135 @t127) @t131))) % 0.45/0.66 (step @p135 :rule trans :premises (@p134 @p133)) % 0.45/0.66 (step @p136 :rule refl :args (@t124)) % 0.45/0.66 (step @p137 :rule refl :args (@t136)) % 0.45/0.66 (step @p138 :rule cong :premises (@p137 @p136) :args ((= @t136 @t124))) % 0.45/0.66 (step @p139 :rule symm :premises (@p138)) % 0.45/0.66 (step @p140 :rule eq_resolve :premises (@p137 @p139)) % 0.45/0.66 (step @p141 :rule nary_cong :premises (@p108 @p140) :args (@t137)) % 0.45/0.66 (step @p142 :rule cong :premises (@p141) :args ((forall @t29 @t137))) % 0.45/0.66 (step @p143 :rule beta-reduce :args ((= @t138 @t136))) % 0.45/0.66 (step @p144 :rule nary_cong :premises (@p126 @p143) :args (@t139)) % 0.45/0.66 (step @p145 :rule cong :premises (@p144) :args (@t140)) % 0.45/0.66 (step @p146 :rule trans :premises (@p145 @p142)) % 0.45/0.66 (step @p147 :rule nary_cong :premises (@p131 @p146) :args (@t141)) % 0.45/0.66 (step @p148 :rule cong :premises (@p147) :args (@t142)) % 0.45/0.66 (step @p149 :rule beta-reduce :args ((= (_ @t135 @t75) @t142))) % 0.45/0.66 (step @p150 :rule trans :premises (@p149 @p148)) % 0.45/0.66 (step @p151 :rule refl :args (@t133)) % 0.45/0.66 (step @p152 :rule refl :args (@t67)) % 0.45/0.66 (step @p153 :rule refl :args (@t143)) % 0.45/0.66 (step @p154 :rule cong :premises (@p153 @p152) :args ((= @t143 @t67))) % 0.45/0.66 (step @p155 :rule symm :premises (@p154)) % 0.45/0.66 (step @p156 :rule eq_resolve :premises (@p153 @p155)) % 0.45/0.66 (step @p157 :rule nary_cong :premises (@p108 @p156) :args (@t144)) % 0.45/0.66 (step @p158 :rule cong :premises (@p157) :args ((forall @t29 @t144))) % 0.45/0.66 (step @p159 :rule beta-reduce :args ((= @t145 @t143))) % 0.45/0.66 (step @p160 :rule nary_cong :premises (@p126 @p159) :args (@t146)) % 0.45/0.66 (step @p161 :rule cong :premises (@p160) :args (@t147)) % 0.45/0.66 (step @p162 :rule trans :premises (@p161 @p158)) % 0.45/0.66 (step @p163 :rule cong :premises (@p162) :args (@t148)) % 0.45/0.66 (step @p164 :rule nary_cong :premises (@p163 @p151) :args (@t149)) % 0.45/0.66 (step @p165 :rule cong :premises (@p164) :args (@t150)) % 0.45/0.66 (step @p166 :rule beta-reduce :args ((= (_ @t155 @t62) @t150))) % 0.45/0.66 (step @p167 :rule trans :premises (@p166 @p165)) % 0.45/0.66 (step @p168 :rule refl :args (@t155)) % 0.45/0.66 (step @p169 :rule ho_cong :premises (@p168 @p37)) % 0.45/0.66 (step @p170 :rule trans :premises (@p169 @p167)) % 0.45/0.66 (step @p171 :rule ho_cong :premises (@p170 @p67)) % 0.45/0.66 (step @p172 :rule trans :premises (@p171 @p150)) % 0.45/0.66 (step @p173 :rule ho_cong :premises (@p170 @p172)) % 0.45/0.66 (step @p174 :rule trans :premises (@p173 @p135)) % 0.45/0.66 (step @p175 :rule ho_cong :premises (@p38 @p174)) % 0.45/0.66 (step @p176 :rule trans :premises (@p175 @p102)) % 0.45/0.66 (step @p177 :rule beta-reduce :args ((= (_ (lambda @t61 @t154) @t22) @t154))) % 0.45/0.66 (step @p178 :rule refl :args (@t22)) % 0.45/0.66 (step @p179 :rule beta-reduce :args ((= @t159 @t133))) % 0.45/0.66 (step @p180 :rule refl :args (@t153)) % 0.45/0.66 (step @p181 :rule nary_cong :premises (@p180 @p179) :args (@t160)) % 0.45/0.66 (step @p182 :rule cong :premises (@p181) :args (@t161)) % 0.45/0.66 (step @p183 :rule beta-reduce :args ((= (_ (lambda @t163 (or @t153 @t162)) @t158) @t161))) % 0.45/0.66 (step @p184 :rule trans :premises (@p183 @p182)) % 0.45/0.66 (step @p185 :rule beta-reduce :args ((= (_ @t165 @t40) @t158))) % 0.45/0.66 (step @p186 :rule refl :args (@t162)) % 0.45/0.66 (step @p187 :rule beta-reduce :args ((= @t167 @t152))) % 0.45/0.66 (step @p188 :rule cong :premises (@p187) :args (@t168)) % 0.45/0.66 (step @p189 :rule nary_cong :premises (@p188 @p186) :args (@t169)) % 0.45/0.66 (step @p190 :rule cong :premises (@p189) :args (@t170)) % 0.45/0.66 (step @p191 :rule beta-reduce :args ((= (_ @t172 @t166) @t170))) % 0.45/0.66 (step @p192 :rule trans :premises (@p191 @p190)) % 0.45/0.66 (step @p193 :rule beta-reduce :args ((= (_ @t165 @t27) @t166))) % 0.45/0.66 (step @p194 :rule refl :args (@t172)) % 0.45/0.66 (step @p195 :rule ho_cong :premises (@p194 @p193)) % 0.45/0.66 (step @p196 :rule trans :premises (@p195 @p192)) % 0.45/0.66 (step @p197 :rule ho_cong :premises (@p196 @p185)) % 0.45/0.66 (step @p198 :rule trans :premises (@p197 @p184)) % 0.45/0.66 (step @p199 :rule ho_cong :premises (@p198 @p178)) % 0.45/0.66 (step @p200 :rule trans :premises (@p199 @p177)) % 0.45/0.66 (step @p201 :rule refl :args (@t40)) % 0.45/0.66 (step @p202 :rule refl :args (@t151)) % 0.45/0.66 (step @p203 :rule refl :args (@t28)) % 0.45/0.66 (step @p204 :rule cong :premises (@p203 @p202) :args ((= @t28 @t151))) % 0.45/0.66 (step @p205 :rule symm :premises (@p204)) % 0.45/0.66 (step @p206 :rule eq_resolve :premises (@p203 @p205)) % 0.45/0.66 (step @p207 :rule refl :args (@t156)) % 0.45/0.66 (step @p208 :rule refl :args (@t8)) % 0.45/0.66 (step @p209 :rule cong :premises (@p208 @p207) :args ((= @t8 @t156))) % 0.45/0.66 (step @p210 :rule symm :premises (@p209)) % 0.45/0.66 (step @p211 :rule eq_resolve :premises (@p208 @p210)) % 0.45/0.66 (step @p212 :rule cong :premises (@p211) :args (@t173)) % 0.45/0.66 (step @p213 :rule nary_cong :premises (@p212 @p206) :args (@t174)) % 0.45/0.66 (step @p214 :rule cong :premises (@p213) :args ((forall @t29 @t174))) % 0.45/0.66 (step @p215 :rule bool-impl-elim :args (@t8 @t28)) % 0.45/0.66 (step @p216 :rule cong :premises (@p215) :args (@t30)) % 0.45/0.66 (step @p217 :rule trans :premises (@p216 @p214)) % 0.45/0.66 (step @p218 :rule cong :premises (@p217) :args (@t32)) % 0.45/0.66 (step @p219 :rule trans :premises (@p12 @p218)) % 0.45/0.66 (step @p220 :rule ho_cong :premises (@p219 @p201)) % 0.45/0.66 (step @p221 :rule refl :args (@t27)) % 0.45/0.66 (step @p222 :rule ho_cong :premises (@p219 @p221)) % 0.45/0.66 (step @p223 :rule beta-reduce :args ((= (_ @t177 @t22) @t171))) % 0.45/0.66 (step @p224 :rule beta-reduce :args ((= (_ (lambda @t178 (or @t175 @t18)) @t23) @t177))) % 0.45/0.66 (step @p225 :rule refl :args (@t23)) % 0.45/0.66 (step @p226 :rule refl :args (@t18)) % 0.45/0.66 (step @p227 :rule beta-reduce :args ((= @t180 @t175))) % 0.45/0.66 (step @p228 :rule nary_cong :premises (@p227 @p226) :args (@t181)) % 0.45/0.66 (step @p229 :rule cong :premises (@p228) :args (@t182)) % 0.45/0.66 (step @p230 :rule beta-reduce :args ((= (_ @t20 @t179) @t182))) % 0.45/0.66 (step @p231 :rule trans :premises (@p230 @p229)) % 0.45/0.66 (step @p232 :rule beta-reduce :args ((= (_ @t16 @t24) @t179))) % 0.45/0.66 (step @p233 :rule refl :args (@t20)) % 0.45/0.66 (step @p234 :rule ho_cong :premises (@p233 @p232)) % 0.45/0.66 (step @p235 :rule trans :premises (@p234 @p231)) % 0.45/0.66 (step @p236 :rule ho_cong :premises (@p235 @p225)) % 0.45/0.66 (step @p237 :rule trans :premises (@p236 @p224)) % 0.45/0.66 (step @p238 :rule ho_cong :premises (@p237 @p178)) % 0.45/0.66 (step @p239 :rule trans :premises (@p238 @p223)) % 0.45/0.66 (step @p240 :rule refl :args (@t24)) % 0.45/0.66 (step @p241 :rule ho_cong :premises (@p8 @p240)) % 0.45/0.66 (step @p242 :rule ho_cong :premises (@p9 @p241)) % 0.45/0.66 (step @p243 :rule ho_cong :premises (@p242 @p225)) % 0.45/0.66 (step @p244 :rule ho_cong :premises (@p243 @p178)) % 0.45/0.66 (step @p245 :rule trans :premises (@p244 @p239)) % 0.45/0.66 (step @p246 :rule cong :premises (@p245) :args (@t26)) % 0.45/0.66 (step @p247 :rule trans :premises (@p11 @p246)) % 0.45/0.66 (step @p248 :rule ho_cong :premises (@p247 @p222)) % 0.45/0.66 (step @p249 :rule ho_cong :premises (@p248 @p220)) % 0.45/0.66 (step @p250 :rule ho_cong :premises (@p249 @p178)) % 0.45/0.66 (step @p251 :rule trans :premises (@p250 @p200)) % 0.45/0.66 (step @p252 :rule cong :premises (@p251) :args (@t45)) % 0.45/0.66 (step @p253 :rule trans :premises (@p18 @p252)) % 0.45/0.66 (step @p254 :rule ho_cong :premises (@p253 @p42)) % 0.45/0.66 (step @p255 :rule ho_cong :premises (@p254 @p72)) % 0.45/0.66 (step @p256 :rule ho_cong :premises (@p254 @p255)) % 0.45/0.66 (step @p257 :rule ho_cong :premises (@p50 @p256)) % 0.45/0.66 (step @p258 :rule trans :premises (@p257 @p176)) % 0.45/0.66 (step @p259 :rule eq_resolve :premises (@p5 @p258)) % 0.45/0.66 (step @p260 :rule instantiate :premises (@p259) :args ((@list @t69 @t69 @t69))) % 0.45/0.66 (step @p261 :rule cnf_or_pos :args (@t189)) % 0.45/0.66 (step @p262 :rule factoring :premises (@p261)) % 0.45/0.66 (step @p263 :rule reordering :premises (@p262) :args ((or @t183 @t185 @t188 @t187 (not @t189)))) % 0.45/0.66 (step @p264 :rule chain_m_resolution :premises (@p263 @p260 @p85 @p77 @p55) :args (@t188 (@list false false true false) (@list @t189 @t184 @t183 @t186))) % 0.45/0.66 (step @p265 :rule skolemize :premises (@p264)) % 0.45/0.66 (step @p266 :rule cnf_or_neg :args (@t192 1)) % 0.45/0.66 (step @p267 :rule chain_m_resolution :premises (@p266 @p265) :args ((not @t191) (@list true) (@list @t192))) % 0.45/0.66 (assume-push @p274 @t193) % 0.45/0.66 (step @p269 :rule instantiate :premises (@p53) :args ((@list @t190))) % 0.45/0.66 (step-pop @p275 :rule scope :premises (@p269)) % 0.45/0.66 (step @p270 :rule process_scope :premises (@p275) :args (@t191)) % 0.45/0.66 (step @p272 :rule implies_elim :premises (@p270)) % 0.45/0.66 (step @p273 false :rule chain_m_resolution :premises (@p272 @p267 @p53) :args (false (@list true false) (@list @t191 @t193))) % 0.45/0.66 ) % 0.45/0.66 % SZS output end Proof % 0.45/0.66 % cvc5 exiting %------------------------------------------------------------------------------