↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU167+2 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n020.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:50:49 AM UTC 2026

% Result   : Theorem 2.12s 2.38s
% Output   : Proof 2.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU167+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.14  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.35  % Computer : n020.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Tue Jun  2 16:33:40 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.28/0.53  %----Proving TF0_NAR, FOF, or CNF
% 2.12/2.38  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 2.12/2.38  % SZS status Theorem
% 2.12/2.38  % SZS output start Proof
% 2.12/2.38  (
% 2.12/2.38  (declare-sort $$unsorted 0)
% 2.12/2.38  (declare-const tptp.empty (-> $$unsorted Bool))
% 2.12/2.38  (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool))
% 2.12/2.38  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 2.12/2.38  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 2.12/2.38  (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool))
% 2.12/2.38  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.powerset (-> $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.union (-> $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.empty_set $$unsorted)
% 2.12/2.38  (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted))
% 2.12/2.38  (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted))
% 2.12/2.38  (define @t1 () (@var "A" $$unsorted))
% 2.12/2.38  (define @t2 () (@var "B" $$unsorted))
% 2.12/2.38  (define @t3 () (not (tptp.in @t2 @t1)))
% 2.12/2.38  (define @t4 () (tptp.in @t1 @t2))
% 2.12/2.38  (define @t5 () (@list @t1 @t2))
% 2.12/2.38  (define @t6 () (tptp.proper_subset @t2 @t1))
% 2.12/2.38  (define @t7 () (tptp.proper_subset @t1 @t2))
% 2.12/2.38  (define @t8 () (tptp.unordered_pair @t1 @t2))
% 2.12/2.38  (define @t9 () (tptp.set_union2 @t2 @t1))
% 2.12/2.38  (define @t10 () (tptp.set_union2 @t1 @t2))
% 2.12/2.38  (define @t11 () (tptp.set_intersection2 @t1 @t2))
% 2.12/2.38  (define @t12 () (tptp.subset @t1 @t2))
% 2.12/2.38  (define @t13 () (= @t1 @t2))
% 2.12/2.38  (define @t14 () (@var "C" $$unsorted))
% 2.12/2.38  (define @t15 () (tptp.in @t14 @t2))
% 2.12/2.38  (define @t16 () (@list @t14))
% 2.12/2.38  (define @t17 () (tptp.singleton @t1))
% 2.12/2.38  (define @t18 () (= @t1 tptp.empty_set))
% 2.12/2.38  (define @t19 () (@list @t1))
% 2.12/2.38  (define @t20 () (tptp.powerset @t1))
% 2.12/2.38  (define @t21 () (@var "D" $$unsorted))
% 2.12/2.38  (define @t22 () (tptp.in @t21 @t14))
% 2.12/2.38  (define @t23 () (@list @t21))
% 2.12/2.38  (define @t24 () (@list @t1 @t2 @t14))
% 2.12/2.38  (define @t25 () (tptp.in @t21 @t2))
% 2.12/2.38  (define @t26 () (tptp.in @t21 @t1))
% 2.12/2.38  (define @t27 () (@var "F" $$unsorted))
% 2.12/2.38  (define @t28 () (@var "E" $$unsorted))
% 2.12/2.38  (define @t29 () (tptp.in @t14 @t1))
% 2.12/2.38  (define @t30 () (forall @t16 (=> @t29 @t15)))
% 2.12/2.38  (define @t31 () (= @t12 @t30))
% 2.12/2.38  (define @t32 () (forall @t5 @t31))
% 2.12/2.38  (define @t33 () (tptp.set_difference @t1 @t2))
% 2.12/2.38  (define @t34 () (tptp.ordered_pair @t1 @t2))
% 2.12/2.38  (define @t35 () (tptp.disjoint @t1 @t2))
% 2.12/2.38  (define @t36 () (not @t13))
% 2.12/2.38  (define @t37 () (tptp.empty @t1))
% 2.12/2.38  (define @t38 () (not @t37))
% 2.12/2.38  (define @t39 () (tptp.disjoint @t17 @t2))
% 2.12/2.38  (define @t40 () (forall @t5 (not (and @t39 @t4))))
% 2.12/2.38  (define @t41 () (not @t4))
% 2.12/2.38  (define @t42 () (forall @t5 (=> @t41 @t39)))
% 2.12/2.38  (define @t43 () (tptp.subset @t17 @t2))
% 2.12/2.38  (define @t44 () (forall @t5 (= @t43 @t4)))
% 2.12/2.38  (define @t45 () (tptp.singleton @t2))
% 2.12/2.38  (define @t46 () (tptp.in @t1 @t14))
% 2.12/2.38  (define @t47 () (@list @t1 @t2 @t14 @t21))
% 2.12/2.38  (define @t48 () (= @t1 @t14))
% 2.12/2.38  (define @t49 () (tptp.cartesian_product2 @t1 @t14))
% 2.12/2.38  (define @t50 () (and (tptp.subset @t49 (tptp.cartesian_product2 @t2 @t14)) (tptp.subset (tptp.cartesian_product2 @t14 @t1) (tptp.cartesian_product2 @t14 @t2))))
% 2.12/2.38  (define @t51 () (forall @t24 (=> @t12 @t50)))
% 2.12/2.38  (define @t52 () (tptp.subset @t49 (tptp.cartesian_product2 @t2 @t21)))
% 2.12/2.38  (define @t53 () (tptp.subset @t14 @t21))
% 2.12/2.38  (define @t54 () (and @t12 @t53))
% 2.12/2.38  (define @t55 () (forall @t47 (=> @t54 @t52)))
% 2.12/2.38  (define @t56 () (not @t55))
% 2.12/2.38  (define @t57 () (tptp.set_intersection2 @t2 @t14))
% 2.12/2.38  (define @t58 () (tptp.subset @t1 @t14))
% 2.12/2.38  (define @t59 () (=> @t12 (= @t11 @t1)))
% 2.12/2.38  (define @t60 () (forall @t5 @t59))
% 2.12/2.38  (define @t61 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1)))
% 2.12/2.38  (define @t62 () (and @t29 @t15))
% 2.12/2.38  (define @t63 () (exists @t16 @t62))
% 2.12/2.38  (define @t64 () (and @t63 @t35))
% 2.12/2.38  (define @t65 () (not @t64))
% 2.12/2.38  (define @t66 () (forall @t16 (not @t62)))
% 2.12/2.38  (define @t67 () (not @t35))
% 2.12/2.38  (define @t68 () (and @t67 @t66))
% 2.12/2.38  (define @t69 () (not @t68))
% 2.12/2.38  (define @t70 () (and @t69 @t65))
% 2.12/2.38  (define @t71 () (forall @t5 @t70))
% 2.12/2.38  (define @t72 () (tptp.in @t14 @t11))
% 2.12/2.38  (define @t73 () (exists @t16 @t72))
% 2.12/2.38  (define @t74 () (and @t73 @t35))
% 2.12/2.38  (define @t75 () (not @t74))
% 2.12/2.38  (define @t76 () (forall @t16 (not @t72)))
% 2.12/2.38  (define @t77 () (not (and @t67 @t76)))
% 2.12/2.38  (define @t78 () (and @t77 @t75))
% 2.12/2.38  (define @t79 () (forall @t5 @t78))
% 2.12/2.38  (define @t80 () (tptp.empty @t2))
% 2.12/2.38  (define @t81 () (= @t17 (tptp.unordered_pair @t2 @t14)))
% 2.12/2.38  (define @t82 () (not @t53))
% 2.12/2.38  (define @t83 () (not @t12))
% 2.12/2.38  (define @t84 () (or @t83 @t82 @t52))
% 2.12/2.38  (define @t85 () (forall @t47 @t84))
% 2.12/2.38  (define @t86 () (@quantifiers_skolemize @t85 3))
% 2.12/2.38  (define @t87 () (@quantifiers_skolemize @t85 1))
% 2.12/2.38  (define @t88 () (tptp.cartesian_product2 @t87 @t86))
% 2.12/2.38  (define @t89 () (@quantifiers_skolemize @t85 2))
% 2.12/2.38  (define @t90 () (tptp.cartesian_product2 @t87 @t89))
% 2.12/2.38  (define @t91 () (tptp.subset @t89 @t86))
% 2.12/2.38  (define @t92 () (@quantifiers_skolemize @t85 0))
% 2.12/2.38  (define @t93 () (tptp.cartesian_product2 @t92 @t89))
% 2.12/2.38  (define @t94 () (tptp.subset @t93 @t88))
% 2.12/2.38  (define @t95 () (not @t91))
% 2.12/2.38  (define @t96 () (tptp.subset @t92 @t87))
% 2.12/2.38  (define @t97 () (not @t96))
% 2.12/2.38  (define @t98 () (or @t97 @t95 @t94))
% 2.12/2.38  (define @t99 () (@list true))
% 2.12/2.38  (define @t100 () (@list @t98))
% 2.12/2.38  (define @t101 () (tptp.subset @t90 @t88))
% 2.12/2.38  (define @t102 () (tptp.cartesian_product2 @t89 @t87))
% 2.12/2.38  (define @t103 () (and (tptp.subset @t102 (tptp.cartesian_product2 @t86 @t87)) @t101))
% 2.12/2.38  (define @t104 () (or @t95 @t103))
% 2.12/2.38  (define @t105 () (@list false false))
% 2.12/2.38  (define @t106 () (@list false))
% 2.12/2.38  (define @t107 () (tptp.in @t14 @t88))
% 2.12/2.38  (define @t108 () (tptp.in @t14 @t90))
% 2.12/2.38  (define @t109 () (forall @t16 (or (not @t108) @t107)))
% 2.12/2.38  (define @t110 () (= @t101 @t109))
% 2.12/2.38  (define @t111 () (tptp.subset @t93 @t90))
% 2.12/2.38  (define @t112 () (and @t111 (tptp.subset (tptp.cartesian_product2 @t89 @t92) @t102)))
% 2.12/2.38  (define @t113 () (or @t97 @t112))
% 2.12/2.38  (define @t114 () (tptp.in @t14 @t93))
% 2.12/2.38  (define @t115 () (not @t114))
% 2.12/2.38  (define @t116 () (forall @t16 (or @t115 @t108)))
% 2.12/2.38  (define @t117 () (= @t111 @t116))
% 2.12/2.38  (define @t118 () (forall @t16 (or @t115 @t107)))
% 2.12/2.38  (define @t119 () (@quantifiers_skolemize @t118 0))
% 2.12/2.38  (define @t120 () (tptp.singleton @t119))
% 2.12/2.38  (define @t121 () (tptp.set_intersection2 @t120 @t93))
% 2.12/2.38  (define @t122 () (forall @t16 (not (tptp.in @t14 @t121))))
% 2.12/2.38  (define @t123 () (@quantifiers_skolemize @t122 0))
% 2.12/2.38  (define @t124 () (@list @t123))
% 2.12/2.38  (define @t125 () (@list @t120 @t93))
% 2.12/2.38  (define @t126 () (@list @t119 @t93))
% 2.12/2.38  (define @t127 () (= @t94 @t118))
% 2.12/2.38  (define @t128 () (not @t118))
% 2.12/2.38  (define @t129 () (@list true false))
% 2.12/2.38  (define @t130 () (tptp.in @t119 @t93))
% 2.12/2.38  (define @t131 () (tptp.in @t119 @t88))
% 2.12/2.38  (define @t132 () (not @t130))
% 2.12/2.38  (define @t133 () (or @t132 @t131))
% 2.12/2.38  (define @t134 () (@list @t133))
% 2.12/2.38  (define @t135 () (tptp.subset @t120 @t93))
% 2.12/2.38  (define @t136 () (= @t130 @t135))
% 2.12/2.38  (define @t137 () (forall @t16 (or (not (tptp.in @t14 @t120)) @t114)))
% 2.12/2.38  (define @t138 () (= @t135 @t137))
% 2.12/2.38  (define @t139 () (not @t135))
% 2.12/2.38  (define @t140 () (@var "BOUND_VARIABLE_8088" $$unsorted))
% 2.12/2.38  (define @t141 () (@var "BOUND_VARIABLE_8086" $$unsorted))
% 2.12/2.38  (define @t142 () (not (tptp.disjoint @t141 @t140)))
% 2.12/2.38  (define @t143 () (tptp.set_intersection2 @t141 @t140))
% 2.12/2.38  (define @t144 () (@var "BOUND_VARIABLE_8100" $$unsorted))
% 2.12/2.38  (define @t145 () (not (tptp.in @t144 @t143)))
% 2.12/2.38  (define @t146 () (or @t145 @t142))
% 2.12/2.38  (define @t147 () (@list @t144))
% 2.12/2.38  (define @t148 () (forall @t147 @t146))
% 2.12/2.38  (define @t149 () (@list @t141 @t140))
% 2.12/2.38  (define @t150 () (forall @t147 @t145))
% 2.12/2.38  (define @t151 () (@list @t14))
% 2.12/2.38  (define @t152 () (or @t150 @t142))
% 2.12/2.38  (define @t153 () (forall @t149 (or (forall @t16 (not (tptp.in @t14 @t143))) @t142)))
% 2.12/2.38  (define @t154 () (@var "BOUND_VARIABLE_8075" $$unsorted))
% 2.12/2.38  (define @t155 () (@var "BOUND_VARIABLE_8073" $$unsorted))
% 2.12/2.38  (define @t156 () (forall (@list @t155 @t154) (or (tptp.disjoint @t155 @t154) (not (forall @t16 (not (tptp.in @t14 (tptp.set_intersection2 @t155 @t154))))))))
% 2.12/2.38  (define @t157 () (or @t76 @t67))
% 2.12/2.38  (define @t158 () (forall @t5 @t157))
% 2.12/2.38  (define @t159 () (@list @t1 @t2))
% 2.12/2.38  (define @t160 () (not @t76))
% 2.12/2.38  (define @t161 () (or @t35 @t160))
% 2.12/2.38  (define @t162 () (forall @t5 @t161))
% 2.12/2.38  (define @t163 () (and @t162 @t158))
% 2.12/2.38  (define @t164 () (not @t67))
% 2.12/2.38  (define @t165 () (and @t77 (not (and @t160 @t35))))
% 2.12/2.38  (define @t166 () (tptp.disjoint @t120 @t93))
% 2.12/2.38  (define @t167 () (not @t166))
% 2.12/2.38  (define @t168 () (or @t167 @t132))
% 2.12/2.38  (define @t169 () (not @t122))
% 2.12/2.38  (define @t170 () (or @t166 @t169))
% 2.12/2.38  (define @t171 () (tptp.in @t123 @t121))
% 2.12/2.38  (define @t172 () (not (not @t171)))
% 2.12/2.38  (define @t173 () (= @t1 @t11))
% 2.12/2.38  (define @t174 () (= @t120 @t121))
% 2.12/2.38  (define @t175 () (or @t139 @t174))
% 2.12/2.38  (define @t176 () (tptp.in @t123 @t120))
% 2.12/2.38  (define @t177 () (tptp.in @t123 @t93))
% 2.12/2.38  (define @t178 () (not @t176))
% 2.12/2.38  (define @t179 () (or @t178 @t177))
% 2.12/2.38  (define @t180 () (tptp.in @t123 @t90))
% 2.12/2.38  (define @t181 () (not @t177))
% 2.12/2.38  (define @t182 () (or @t181 @t180))
% 2.12/2.38  (define @t183 () (@var "BOUND_VARIABLE_8020" $$unsorted))
% 2.12/2.38  (define @t184 () (@var "BOUND_VARIABLE_8034" $$unsorted))
% 2.12/2.38  (define @t185 () (not (tptp.in @t184 @t183)))
% 2.12/2.38  (define @t186 () (@var "BOUND_VARIABLE_8018" $$unsorted))
% 2.12/2.38  (define @t187 () (not (tptp.in @t184 @t186)))
% 2.12/2.38  (define @t188 () (not (tptp.disjoint @t186 @t183)))
% 2.12/2.38  (define @t189 () (or @t187 @t185))
% 2.12/2.38  (define @t190 () (or @t189 @t188))
% 2.12/2.38  (define @t191 () (forall (@list @t186 @t183 @t184) @t190))
% 2.12/2.38  (define @t192 () (@list @t184))
% 2.12/2.38  (define @t193 () (forall @t192 @t190))
% 2.12/2.38  (define @t194 () (@list @t186 @t183))
% 2.12/2.38  (define @t195 () (forall @t192 @t189))
% 2.12/2.38  (define @t196 () (or @t195 @t188))
% 2.12/2.38  (define @t197 () (forall @t194 (or (forall @t16 (or (not (tptp.in @t14 @t186)) (not (tptp.in @t14 @t183)))) @t188)))
% 2.12/2.38  (define @t198 () (@var "BOUND_VARIABLE_8005" $$unsorted))
% 2.12/2.38  (define @t199 () (@var "BOUND_VARIABLE_8003" $$unsorted))
% 2.12/2.38  (define @t200 () (forall (@list @t199 @t198) (or (tptp.disjoint @t199 @t198) (not (forall @t16 (or (not (tptp.in @t14 @t199)) (not (tptp.in @t14 @t198))))))))
% 2.12/2.38  (define @t201 () (forall @t16 (or (not @t29) (not @t15))))
% 2.12/2.38  (define @t202 () (or @t201 @t67))
% 2.12/2.38  (define @t203 () (forall @t5 @t202))
% 2.12/2.38  (define @t204 () (not @t201))
% 2.12/2.38  (define @t205 () (or @t35 @t204))
% 2.12/2.38  (define @t206 () (forall @t5 @t205))
% 2.12/2.38  (define @t207 () (and @t206 @t203))
% 2.12/2.38  (define @t208 () (and (not (and @t67 @t201)) (not (and @t204 @t35))))
% 2.12/2.38  (define @t209 () (not @t66))
% 2.12/2.38  (define @t210 () (tptp.disjoint @t120 @t88))
% 2.12/2.38  (define @t211 () (or @t131 @t210))
% 2.12/2.38  (define @t212 () (tptp.in @t123 @t88))
% 2.12/2.38  (define @t213 () (not @t212))
% 2.12/2.38  (define @t214 () (not @t210))
% 2.12/2.38  (define @t215 () (or @t214 @t178 @t213))
% 2.12/2.38  (define @t216 () (not @t180))
% 2.12/2.38  (define @t217 () (or @t216 @t212))
% 2.12/2.38  (define @t218 () (not @t217))
% 2.12/2.38  (assume @p1 (forall @t5 (=> @t4 @t3)))
% 2.12/2.38  (assume @p2 (forall @t5 (=> @t7 (not @t6))))
% 2.12/2.38  (assume @p3 (forall @t5 (= @t8 (tptp.unordered_pair @t2 @t1))))
% 2.12/2.38  (assume @p4 (forall @t5 (= @t10 @t9)))
% 2.12/2.38  (assume @p5 (forall @t5 (= @t11 (tptp.set_intersection2 @t2 @t1))))
% 2.12/2.38  (assume @p6 (forall @t5 (= @t13 (and @t12 (tptp.subset @t2 @t1)))))
% 2.12/2.38  (assume @p7 (forall @t5 (= (= @t2 @t17) (forall @t16 (= @t15 (= @t14 @t1))))))
% 2.12/2.38  (assume @p8 (forall @t19 (= @t18 (forall (@list @t2) @t3))))
% 2.12/2.38  (assume @p9 (forall @t5 (= (= @t2 @t20) (forall @t16 (= @t15 (tptp.subset @t14 @t1))))))
% 2.12/2.38  (assume @p10 (forall @t24 (= (= @t14 @t8) (forall @t23 (= @t22 (or (= @t21 @t1) (= @t21 @t2)))))))
% 2.12/2.38  (assume @p11 (forall @t24 (= (= @t14 @t10) (forall @t23 (= @t22 (or @t26 @t25))))))
% 2.12/2.38  (assume @p12 (forall @t24 (= (= @t14 (tptp.cartesian_product2 @t1 @t2)) (forall @t23 (= @t22 (exists (@list @t28 @t27) (and (tptp.in @t28 @t1) (tptp.in @t27 @t2) (= @t21 (tptp.ordered_pair @t28 @t27)))))))))
% 2.12/2.38  (assume @p13 @t32)
% 2.12/2.38  (assume @p14 (forall @t24 (= (= @t14 @t11) (forall @t23 (= @t22 (and @t26 @t25))))))
% 2.12/2.38  (assume @p15 (forall @t5 (= (= @t2 (tptp.union @t1)) (forall @t16 (= @t15 (exists @t23 (and (tptp.in @t14 @t21) @t26)))))))
% 2.12/2.38  (assume @p16 (forall @t24 (= (= @t14 @t33) (forall @t23 (= @t22 (and @t26 (not @t25)))))))
% 2.12/2.38  (assume @p17 (forall @t5 (= @t34 (tptp.unordered_pair @t8 @t17))))
% 2.12/2.38  (assume @p18 (forall @t5 (= @t35 (= @t11 tptp.empty_set))))
% 2.12/2.38  (assume @p19 (forall @t5 (= @t7 (and @t12 @t36))))
% 2.12/2.38  (assume @p20 true)
% 2.12/2.38  (assume @p21 (tptp.empty tptp.empty_set))
% 2.12/2.38  (assume @p22 (forall @t5 (not (tptp.empty @t34))))
% 2.12/2.38  (assume @p23 (forall @t5 (=> @t38 (not (tptp.empty @t10)))))
% 2.12/2.38  (assume @p24 (forall @t5 (=> @t38 (not (tptp.empty @t9)))))
% 2.12/2.38  (assume @p25 (forall @t5 (= (tptp.set_union2 @t1 @t1) @t1)))
% 2.12/2.38  (assume @p26 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1)))
% 2.12/2.38  (assume @p27 (forall @t5 (not (tptp.proper_subset @t1 @t1))))
% 2.12/2.38  (assume @p28 (forall @t19 (not (= @t17 tptp.empty_set))))
% 2.12/2.38  (assume @p29 (forall @t5 (=> @t4 (= (tptp.set_union2 @t17 @t2) @t2))))
% 2.12/2.38  (assume @p30 @t40)
% 2.12/2.38  (assume @p31 @t42)
% 2.12/2.38  (assume @p32 @t44)
% 2.12/2.38  (assume @p33 (forall @t5 (= (= @t33 tptp.empty_set) @t12)))
% 2.12/2.38  (assume @p34 (forall @t24 (=> @t12 (or @t29 (tptp.subset @t1 (tptp.set_difference @t2 (tptp.singleton @t14)))))))
% 2.12/2.38  (assume @p35 (forall @t5 (= (tptp.subset @t1 @t45) (or @t18 (= @t1 @t45)))))
% 2.12/2.38  (assume @p36 (forall @t5 (=> @t4 (tptp.subset @t1 (tptp.union @t2)))))
% 2.12/2.38  (assume @p37 (forall @t47 (= (tptp.in @t34 (tptp.cartesian_product2 @t14 @t21)) (and @t46 (tptp.in @t2 @t21)))))
% 2.12/2.38  (assume @p38 (exists @t19 @t37))
% 2.12/2.38  (assume @p39 (exists @t19 @t38))
% 2.12/2.38  (assume @p40 (forall @t5 (tptp.subset @t1 @t1)))
% 2.12/2.38  (assume @p41 (forall @t5 (=> @t35 (tptp.disjoint @t2 @t1))))
% 2.12/2.38  (assume @p42 (forall @t47 (not (and (= @t8 (tptp.unordered_pair @t14 @t21)) (not @t48) (not (= @t1 @t21))))))
% 2.12/2.38  (assume @p43 @t51)
% 2.12/2.38  (assume @p44 @t56)
% 2.12/2.38  (assume @p45 (forall @t5 (=> @t12 (= @t10 @t2))))
% 2.12/2.38  (assume @p46 (forall @t5 (tptp.subset @t11 @t1)))
% 2.12/2.38  (assume @p47 (forall @t24 (=> (and @t12 @t58) (tptp.subset @t1 @t57))))
% 2.12/2.38  (assume @p48 (forall @t19 (= (tptp.set_union2 @t1 tptp.empty_set) @t1)))
% 2.12/2.38  (assume @p49 (forall @t24 (=> (and @t12 (tptp.subset @t2 @t14)) @t58)))
% 2.12/2.38  (assume @p50 (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set)))
% 2.12/2.38  (assume @p51 (forall @t24 (=> @t12 (tptp.subset (tptp.set_intersection2 @t1 @t14) @t57))))
% 2.12/2.38  (assume @p52 @t60)
% 2.12/2.38  (assume @p53 (forall @t19 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set)))
% 2.12/2.38  (assume @p54 (forall @t5 (=> (forall @t16 (= @t29 @t15)) @t13)))
% 2.12/2.38  (assume @p55 (forall @t19 (tptp.subset tptp.empty_set @t1)))
% 2.12/2.38  (assume @p56 (forall @t24 (=> @t12 (tptp.subset (tptp.set_difference @t1 @t14) (tptp.set_difference @t2 @t14)))))
% 2.12/2.38  (assume @p57 (forall @t47 (=> (= @t34 (tptp.ordered_pair @t14 @t21)) (and @t48 (= @t2 @t21)))))
% 2.12/2.38  (assume @p58 (forall @t5 (tptp.subset @t33 @t1)))
% 2.12/2.38  (assume @p59 (forall @t24 (= (tptp.subset @t8 @t14) (and @t46 (tptp.in @t2 @t14)))))
% 2.12/2.38  (assume @p60 (forall @t5 (= @t61 @t10)))
% 2.12/2.38  (assume @p61 (forall @t19 (= (tptp.set_difference @t1 tptp.empty_set) @t1)))
% 2.12/2.38  (assume @p62 @t71)
% 2.12/2.38  (assume @p63 (forall @t19 (=> (tptp.subset @t1 tptp.empty_set) @t18)))
% 2.12/2.38  (assume @p64 (forall @t5 (= (tptp.set_difference @t10 @t2) @t33)))
% 2.12/2.38  (assume @p65 (forall @t5 (=> @t12 (= @t2 @t61))))
% 2.12/2.38  (assume @p66 (forall @t5 (= (tptp.set_difference @t1 @t33) @t11)))
% 2.12/2.38  (assume @p67 (forall @t19 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set)))
% 2.12/2.38  (assume @p68 @t79)
% 2.12/2.38  (assume @p69 (forall @t5 (not (and @t12 @t6))))
% 2.12/2.38  (assume @p70 (forall @t24 (=> (and @t12 (tptp.disjoint @t2 @t14)) (tptp.disjoint @t1 @t14))))
% 2.12/2.38  (assume @p71 (forall @t5 (= (= (tptp.set_difference @t1 @t45) @t1) @t3)))
% 2.12/2.38  (assume @p72 (forall @t19 (= (tptp.unordered_pair @t1 @t1) @t17)))
% 2.12/2.38  (assume @p73 (forall @t19 (=> @t37 @t18)))
% 2.12/2.38  (assume @p74 (forall @t5 (=> (tptp.subset @t17 @t45) @t13)))
% 2.12/2.38  (assume @p75 (forall @t5 (not (and @t4 @t80))))
% 2.12/2.38  (assume @p76 (forall @t5 (tptp.subset @t1 @t10)))
% 2.12/2.38  (assume @p77 (forall @t5 (= @t35 (= @t33 @t1))))
% 2.12/2.38  (assume @p78 (forall @t5 (not (and @t37 @t36 @t80))))
% 2.12/2.38  (assume @p79 (forall @t24 (=> (and @t12 (tptp.subset @t14 @t2)) (tptp.subset (tptp.set_union2 @t1 @t14) @t2))))
% 2.12/2.38  (assume @p80 (forall @t24 (=> @t81 @t13)))
% 2.12/2.38  (assume @p81 (forall @t19 (= (tptp.union @t20) @t1)))
% 2.12/2.38  (assume @p82 (forall @t24 (=> @t81 (= @t2 @t14))))
% 2.12/2.38  (step @p83 :rule bool-impl-elim :args (@t29 @t15))
% 2.12/2.38  (step @p84 :rule cong :premises (@p83) :args (@t30))
% 2.12/2.38  (step @p85 :rule refl :args (@t12))
% 2.12/2.38  (step @p86 :rule cong :premises (@p85 @p84) :args (@t31))
% 2.12/2.38  (step @p87 :rule cong :premises (@p86) :args (@t32))
% 2.12/2.38  (step @p88 :rule eq_resolve :premises (@p13 @p87))
% 2.12/2.38  (step @p89 :rule instantiate :premises (@p88) :args ((@list @t90 @t88)))
% 2.12/2.38  (step @p90 :rule bool-impl-elim :args (@t12 @t50))
% 2.12/2.38  (step @p91 :rule cong :premises (@p90) :args (@t51))
% 2.12/2.38  (step @p92 :rule eq_resolve :premises (@p43 @p91))
% 2.12/2.38  (step @p93 :rule instantiate :premises (@p92) :args ((@list @t89 @t86 @t87)))
% 2.12/2.38  (step @p94 :rule aci_norm :args ((= (or (or @t83 @t82) @t52) @t84)))
% 2.12/2.38  (step @p95 :rule refl :args (@t52))
% 2.12/2.38  (step @p96 :rule bool-and-de-morgan :args (@t12 @t53 true))
% 2.12/2.38  (step @p97 :rule nary_cong :premises (@p96 @p95) :args ((or (not @t54) @t52)))
% 2.12/2.38  (step @p98 :rule trans :premises (@p97 @p94))
% 2.12/2.38  (step @p99 :rule bool-impl-elim :args (@t54 @t52))
% 2.12/2.38  (step @p100 :rule trans :premises (@p99 @p98))
% 2.12/2.38  (step @p101 :rule cong :premises (@p100) :args (@t55))
% 2.12/2.38  (step @p102 :rule cong :premises (@p101) :args (@t56))
% 2.12/2.38  (step @p103 :rule eq_resolve :premises (@p44 @p102))
% 2.12/2.38  (step @p104 :rule skolemize :premises (@p103))
% 2.12/2.38  (step @p105 :rule bool-double-not-elim :args (@t91))
% 2.12/2.38  (step @p106 :rule refl :args (@t98))
% 2.12/2.38  (step @p107 :rule nary_cong :premises (@p106 @p105) :args ((or @t98 (not @t95))))
% 2.12/2.38  (step @p108 :rule cnf_or_neg :args (@t98 1))
% 2.12/2.38  (step @p109 :rule eq_resolve :premises (@p108 @p107))
% 2.12/2.38  (step @p110 :rule reordering :premises (@p109) :args ((or @t91 @t98)))
% 2.12/2.38  (step @p111 :rule chain_m_resolution :premises (@p110 @p104) :args (@t91 @t99 @t100))
% 2.12/2.38  (step @p112 :rule cnf_or_pos :args (@t104))
% 2.12/2.38  (step @p113 :rule reordering :premises (@p112) :args ((or @t95 @t103 (not @t104))))
% 2.12/2.38  (step @p114 :rule chain_m_resolution :premises (@p113 @p111 @p93) :args (@t103 @t105 (@list @t91 @t104)))
% 2.12/2.38  (step @p115 :rule cnf_and_pos :args (@t103 1))
% 2.12/2.38  (step @p116 :rule reordering :premises (@p115) :args ((or @t101 (not @t103))))
% 2.12/2.38  (step @p117 :rule chain_m_resolution :premises (@p116 @p114) :args (@t101 @t106 (@list @t103)))
% 2.12/2.38  (step @p118 :rule cnf_equiv_pos1 :args (@t110))
% 2.12/2.38  (step @p119 :rule reordering :premises (@p118) :args ((or (not @t101) @t109 (not @t110))))
% 2.12/2.38  (step @p120 :rule chain_m_resolution :premises (@p119 @p117 @p89) :args (@t109 @t105 (@list @t101 @t110)))
% 2.12/2.38  (step @p121 :rule instantiate :premises (@p88) :args ((@list @t93 @t90)))
% 2.12/2.38  (step @p122 :rule instantiate :premises (@p92) :args ((@list @t92 @t87 @t89)))
% 2.12/2.38  (step @p123 :rule bool-double-not-elim :args (@t96))
% 2.12/2.38  (step @p124 :rule nary_cong :premises (@p106 @p123) :args ((or @t98 (not @t97))))
% 2.12/2.38  (step @p125 :rule cnf_or_neg :args (@t98 0))
% 2.12/2.38  (step @p126 :rule eq_resolve :premises (@p125 @p124))
% 2.12/2.38  (step @p127 :rule reordering :premises (@p126) :args ((or @t96 @t98)))
% 2.12/2.38  (step @p128 :rule chain_m_resolution :premises (@p127 @p104) :args (@t96 @t99 @t100))
% 2.12/2.38  (step @p129 :rule cnf_or_pos :args (@t113))
% 2.12/2.38  (step @p130 :rule reordering :premises (@p129) :args ((or @t97 @t112 (not @t113))))
% 2.12/2.38  (step @p131 :rule chain_m_resolution :premises (@p130 @p128 @p122) :args (@t112 @t105 (@list @t96 @t113)))
% 2.12/2.38  (step @p132 :rule cnf_and_pos :args (@t112 0))
% 2.12/2.38  (step @p133 :rule reordering :premises (@p132) :args ((or @t111 (not @t112))))
% 2.12/2.38  (step @p134 :rule chain_m_resolution :premises (@p133 @p131) :args (@t111 @t106 (@list @t112)))
% 2.12/2.38  (step @p135 :rule cnf_equiv_pos1 :args (@t117))
% 2.12/2.38  (step @p136 :rule reordering :premises (@p135) :args ((or (not @t111) @t116 (not @t117))))
% 2.12/2.38  (step @p137 :rule chain_m_resolution :premises (@p136 @p134 @p121) :args (@t116 @t105 (@list @t111 @t117)))
% 2.12/2.38  (step @p138 :rule instantiate :premises (@p137) :args (@t124))
% 2.12/2.38  (step @p139 :rule instantiate :premises (@p88) :args (@t125))
% 2.12/2.38  (step @p140 :rule eq-symm :args (@t43 @t4))
% 2.12/2.38  (step @p141 :rule cong :premises (@p140) :args (@t44))
% 2.12/2.38  (step @p142 :rule eq_resolve :premises (@p32 @p141))
% 2.12/2.38  (step @p143 :rule instantiate :premises (@p142) :args (@t126))
% 2.12/2.38  (step @p144 :rule instantiate :premises (@p88) :args ((@list @t93 @t88)))
% 2.12/2.38  (step @p145 :rule cnf_or_neg :args (@t98 2))
% 2.12/2.38  (step @p146 :rule chain_m_resolution :premises (@p145 @p104) :args ((not @t94) @t99 @t100))
% 2.12/2.38  (step @p147 :rule cnf_equiv_pos2 :args (@t127))
% 2.12/2.38  (step @p148 :rule reordering :premises (@p147) :args ((or @t94 @t128 (not @t127))))
% 2.12/2.38  (step @p149 :rule chain_m_resolution :premises (@p148 @p146 @p144) :args (@t128 @t129 (@list @t94 @t127)))
% 2.12/2.38  (step @p150 :rule skolemize :premises (@p149))
% 2.12/2.38  (step @p151 :rule bool-double-not-elim :args (@t130))
% 2.12/2.38  (step @p152 :rule refl :args (@t133))
% 2.12/2.38  (step @p153 :rule nary_cong :premises (@p152 @p151) :args ((or @t133 (not @t132))))
% 2.12/2.38  (step @p154 :rule cnf_or_neg :args (@t133 0))
% 2.12/2.38  (step @p155 :rule eq_resolve :premises (@p154 @p153))
% 2.12/2.38  (step @p156 :rule reordering :premises (@p155) :args ((or @t130 @t133)))
% 2.12/2.38  (step @p157 :rule chain_m_resolution :premises (@p156 @p150) :args (@t130 @t99 @t134))
% 2.12/2.38  (step @p158 :rule cnf_equiv_pos1 :args (@t136))
% 2.12/2.38  (step @p159 :rule reordering :premises (@p158) :args ((or @t132 @t135 (not @t136))))
% 2.12/2.38  (step @p160 :rule chain_m_resolution :premises (@p159 @p157 @p143) :args (@t135 @t105 (@list @t130 @t136)))
% 2.12/2.38  (step @p161 :rule cnf_equiv_pos1 :args (@t138))
% 2.12/2.38  (step @p162 :rule reordering :premises (@p161) :args ((or @t139 @t137 (not @t138))))
% 2.12/2.38  (step @p163 :rule chain_m_resolution :premises (@p162 @p160 @p139) :args (@t137 @t105 (@list @t135 @t138)))
% 2.12/2.38  (step @p164 :rule instantiate :premises (@p163) :args (@t124))
% 2.12/2.38  (step @p165 :rule quant-merge-prenex :args ((= (forall @t149 @t148) (forall (@list @t141 @t140 @t144) @t146))))
% 2.12/2.38  (step @p166 :rule refl :args (@t142))
% 2.12/2.38  (step @p167 :rule alpha_equiv :args (@t150 (@list @t144) @t151))
% 2.12/2.38  (step @p168 :rule nary_cong :premises (@p167 @p166) :args (@t152))
% 2.12/2.38  (step @p169 :rule quant-miniscope-or :args ((= @t148 @t152)))
% 2.12/2.38  (step @p170 :rule trans :premises (@p169 @p168))
% 2.12/2.38  (step @p171 :rule symm :premises (@p170))
% 2.12/2.38  (step @p172 :rule cong :premises (@p171) :args (@t153))
% 2.12/2.38  (step @p173 :rule trans :premises (@p172 @p165))
% 2.12/2.38  (step @p174 :rule refl :args (@t156))
% 2.12/2.38  (step @p175 :rule nary_cong :premises (@p174 @p173) :args ((and @t156 @t153)))
% 2.12/2.38  (step @p176 :rule alpha_equiv :args (@t158 @t159 (@list @t141 @t140)))
% 2.12/2.38  (step @p177 :rule alpha_equiv :args (@t162 @t159 (@list @t155 @t154)))
% 2.12/2.38  (step @p178 :rule nary_cong :premises (@p177 @p176) :args (@t163))
% 2.12/2.38  (step @p179 :rule quant-miniscope-and :args ((= (forall @t5 (and @t161 @t157)) @t163)))
% 2.12/2.38  (step @p180 :rule trans :premises (@p179 @p178))
% 2.12/2.38  (step @p181 :rule trans :premises (@p180 @p175))
% 2.12/2.38  (step @p182 :rule refl :args (@t67))
% 2.12/2.38  (step @p183 :rule bool-double-not-elim :args (@t76))
% 2.12/2.38  (step @p184 :rule nary_cong :premises (@p183 @p182) :args ((or (not @t160) @t67)))
% 2.12/2.38  (step @p185 :rule bool-and-de-morgan :args (@t160 @t35 true))
% 2.12/2.38  (step @p186 :rule trans :premises (@p185 @p184))
% 2.12/2.38  (step @p187 :rule refl :args (@t160))
% 2.12/2.38  (step @p188 :rule bool-double-not-elim :args (@t35))
% 2.12/2.38  (step @p189 :rule nary_cong :premises (@p188 @p187) :args ((or @t164 @t160)))
% 2.12/2.38  (step @p190 :rule bool-and-de-morgan :args (@t67 @t76 true))
% 2.12/2.38  (step @p191 :rule trans :premises (@p190 @p189))
% 2.12/2.38  (step @p192 :rule nary_cong :premises (@p191 @p186) :args (@t165))
% 2.12/2.38  (step @p193 :rule cong :premises (@p192) :args ((forall @t5 @t165)))
% 2.12/2.38  (step @p194 :rule trans :premises (@p193 @p181))
% 2.12/2.38  (step @p195 :rule refl :args (@t35))
% 2.12/2.38  (step @p196 :rule exists-elim :args ((= @t73 @t160)))
% 2.12/2.38  (step @p197 :rule nary_cong :premises (@p196 @p195) :args (@t74))
% 2.12/2.38  (step @p198 :rule cong :premises (@p197) :args (@t75))
% 2.12/2.38  (step @p199 :rule refl :args (@t77))
% 2.12/2.38  (step @p200 :rule nary_cong :premises (@p199 @p198) :args (@t78))
% 2.12/2.38  (step @p201 :rule cong :premises (@p200) :args (@t79))
% 2.12/2.38  (step @p202 :rule trans :premises (@p201 @p194))
% 2.12/2.38  (step @p203 :rule eq_resolve :premises (@p68 @p202))
% 2.12/2.38  (step @p204 :rule and_elim :premises (@p203) :args (0))
% 2.12/2.38  (step @p205 :rule instantiate :premises (@p204) :args (@t125))
% 2.12/2.38  (step @p206 :rule bool-and-de-morgan :args (@t39 @t4 true))
% 2.12/2.38  (step @p207 :rule cong :premises (@p206) :args (@t40))
% 2.12/2.38  (step @p208 :rule eq_resolve :premises (@p30 @p207))
% 2.12/2.38  (step @p209 :rule instantiate :premises (@p208) :args (@t126))
% 2.12/2.38  (step @p210 :rule cnf_or_pos :args (@t168))
% 2.12/2.38  (step @p211 :rule reordering :premises (@p210) :args ((or @t132 @t167 (not @t168))))
% 2.12/2.38  (step @p212 :rule chain_m_resolution :premises (@p211 @p157 @p209) :args (@t167 @t105 (@list @t130 @t168)))
% 2.12/2.38  (step @p213 :rule cnf_or_pos :args (@t170))
% 2.12/2.38  (step @p214 :rule reordering :premises (@p213) :args ((or @t166 @t169 (not @t170))))
% 2.12/2.38  (step @p215 :rule chain_m_resolution :premises (@p214 @p212 @p205) :args (@t169 @t129 (@list @t166 @t170)))
% 2.12/2.38  (step @p216 :rule refl :args (@t171))
% 2.12/2.38  (step @p217 :rule bool-double-not-elim :args (@t122))
% 2.12/2.38  (step @p218 :rule nary_cong :premises (@p217 @p216) :args ((or (not @t169) @t171)))
% 2.12/2.38  (step @p219 :rule bool-double-not-elim :args (@t171))
% 2.12/2.38  (step @p220 :rule refl :args (@t169))
% 2.12/2.38  (step @p221 :rule cong :premises (@p220 @p219) :args ((=> @t169 @t172)))
% 2.12/2.38  (assume-push @p324 @t169)
% 2.12/2.38  (step @p223 :rule skolemize :premises (@p215))
% 2.12/2.38  (step-pop @p325 :rule scope :premises (@p223))
% 2.12/2.38  (step @p224 :rule process_scope :premises (@p325) :args (@t172))
% 2.12/2.38  (step @p226 :rule eq_resolve :premises (@p224 @p221))
% 2.12/2.38  (step @p227 :rule implies_elim :premises (@p226))
% 2.12/2.38  (step @p228 :rule eq_resolve :premises (@p227 @p218))
% 2.12/2.38  (step @p229 :rule chain_m_resolution :premises (@p228 @p215) :args (@t171 @t99 (@list @t122)))
% 2.12/2.38  (step @p230 :rule true_intro :premises (@p229))
% 2.12/2.38  (step @p231 :rule bool-impl-elim :args (@t12 @t173))
% 2.12/2.38  (step @p232 :rule cong :premises (@p231) :args ((forall @t5 (=> @t12 @t173))))
% 2.12/2.38  (step @p233 :rule eq-symm :args (@t11 @t1))
% 2.12/2.38  (step @p234 :rule cong :premises (@p85 @p233) :args (@t59))
% 2.12/2.38  (step @p235 :rule cong :premises (@p234) :args (@t60))
% 2.12/2.38  (step @p236 :rule trans :premises (@p235 @p232))
% 2.12/2.38  (step @p237 :rule eq_resolve :premises (@p52 @p236))
% 2.12/2.38  (step @p238 :rule instantiate :premises (@p237) :args (@t125))
% 2.12/2.38  (step @p239 :rule cnf_or_pos :args (@t175))
% 2.12/2.38  (step @p240 :rule reordering :premises (@p239) :args ((or @t139 @t174 (not @t175))))
% 2.12/2.38  (step @p241 :rule chain_m_resolution :premises (@p240 @p160 @p238) :args (@t174 @t105 (@list @t135 @t175)))
% 2.12/2.38  (step @p242 :rule refl :args (@t123))
% 2.12/2.38  (step @p243 :rule cong :premises (@p242 @p241) :args (@t176))
% 2.12/2.38  (step @p244 :rule trans :premises (@p243 @p230))
% 2.12/2.38  (step @p245 :rule true_elim :premises (@p244))
% 2.12/2.38  (step @p246 :rule cnf_or_pos :args (@t179))
% 2.12/2.38  (step @p247 :rule reordering :premises (@p246) :args ((or @t178 @t177 (not @t179))))
% 2.12/2.38  (step @p248 :rule chain_m_resolution :premises (@p247 @p245 @p164) :args (@t177 @t105 (@list @t176 @t179)))
% 2.12/2.38  (step @p249 :rule cnf_or_pos :args (@t182))
% 2.12/2.38  (step @p250 :rule reordering :premises (@p249) :args ((or @t181 @t180 (not @t182))))
% 2.12/2.38  (step @p251 :rule chain_m_resolution :premises (@p250 @p248 @p138) :args (@t180 @t105 (@list @t177 @t182)))
% 2.12/2.38  (step @p252 :rule aci_norm :args ((= @t190 (or @t188 @t187 @t185))))
% 2.12/2.38  (step @p253 :rule cong :premises (@p252) :args (@t191))
% 2.12/2.38  (step @p254 :rule quant-merge-prenex :args ((= (forall @t194 @t193) @t191)))
% 2.12/2.38  (step @p255 :rule refl :args (@t188))
% 2.12/2.38  (step @p256 :rule alpha_equiv :args (@t195 (@list @t184) @t151))
% 2.12/2.38  (step @p257 :rule nary_cong :premises (@p256 @p255) :args (@t196))
% 2.12/2.38  (step @p258 :rule quant-miniscope-or :args ((= @t193 @t196)))
% 2.12/2.38  (step @p259 :rule trans :premises (@p258 @p257))
% 2.12/2.38  (step @p260 :rule symm :premises (@p259))
% 2.12/2.38  (step @p261 :rule cong :premises (@p260) :args (@t197))
% 2.12/2.38  (step @p262 :rule trans :premises (@p261 @p254))
% 2.12/2.38  (step @p263 :rule trans :premises (@p262 @p253))
% 2.12/2.38  (step @p264 :rule refl :args (@t200))
% 2.12/2.38  (step @p265 :rule nary_cong :premises (@p264 @p263) :args ((and @t200 @t197)))
% 2.12/2.38  (step @p266 :rule alpha_equiv :args (@t203 @t159 (@list @t186 @t183)))
% 2.12/2.38  (step @p267 :rule alpha_equiv :args (@t206 @t159 (@list @t199 @t198)))
% 2.12/2.38  (step @p268 :rule nary_cong :premises (@p267 @p266) :args (@t207))
% 2.12/2.38  (step @p269 :rule quant-miniscope-and :args ((= (forall @t5 (and @t205 @t202)) @t207)))
% 2.12/2.38  (step @p270 :rule trans :premises (@p269 @p268))
% 2.12/2.38  (step @p271 :rule trans :premises (@p270 @p265))
% 2.12/2.38  (step @p272 :rule bool-double-not-elim :args (@t201))
% 2.12/2.38  (step @p273 :rule nary_cong :premises (@p272 @p182) :args ((or (not @t204) @t67)))
% 2.12/2.38  (step @p274 :rule bool-and-de-morgan :args (@t204 @t35 true))
% 2.12/2.38  (step @p275 :rule trans :premises (@p274 @p273))
% 2.12/2.38  (step @p276 :rule refl :args (@t204))
% 2.12/2.38  (step @p277 :rule nary_cong :premises (@p188 @p276) :args ((or @t164 @t204)))
% 2.12/2.38  (step @p278 :rule bool-and-de-morgan :args (@t67 @t201 true))
% 2.12/2.38  (step @p279 :rule trans :premises (@p278 @p277))
% 2.12/2.38  (step @p280 :rule nary_cong :premises (@p279 @p275) :args (@t208))
% 2.12/2.38  (step @p281 :rule cong :premises (@p280) :args ((forall @t5 @t208)))
% 2.12/2.38  (step @p282 :rule trans :premises (@p281 @p271))
% 2.12/2.38  (step @p283 :rule bool-and-de-morgan :args (@t29 @t15 true))
% 2.12/2.38  (step @p284 :rule cong :premises (@p283) :args (@t66))
% 2.12/2.38  (step @p285 :rule cong :premises (@p284) :args (@t209))
% 2.12/2.38  (step @p286 :rule exists-elim :args ((= @t63 @t209)))
% 2.12/2.38  (step @p287 :rule trans :premises (@p286 @p285))
% 2.12/2.38  (step @p288 :rule nary_cong :premises (@p287 @p195) :args (@t64))
% 2.12/2.38  (step @p289 :rule cong :premises (@p288) :args (@t65))
% 2.12/2.38  (step @p290 :rule refl :args (@t67))
% 2.12/2.38  (step @p291 :rule nary_cong :premises (@p290 @p284) :args (@t68))
% 2.12/2.38  (step @p292 :rule cong :premises (@p291) :args (@t69))
% 2.12/2.39  (step @p293 :rule nary_cong :premises (@p292 @p289) :args (@t70))
% 2.12/2.39  (step @p294 :rule cong :premises (@p293) :args (@t71))
% 2.12/2.39  (step @p295 :rule trans :premises (@p294 @p282))
% 2.12/2.39  (step @p296 :rule eq_resolve :premises (@p62 @p295))
% 2.12/2.39  (step @p297 :rule and_elim :premises (@p296) :args (1))
% 2.12/2.39  (step @p298 :rule instantiate :premises (@p297) :args ((@list @t120 @t88 @t123)))
% 2.12/2.39  (step @p299 :rule refl :args (@t39))
% 2.12/2.39  (step @p300 :rule bool-double-not-elim :args (@t4))
% 2.12/2.39  (step @p301 :rule nary_cong :premises (@p300 @p299) :args ((or (not @t41) @t39)))
% 2.12/2.39  (step @p302 :rule bool-impl-elim :args (@t41 @t39))
% 2.12/2.39  (step @p303 :rule trans :premises (@p302 @p301))
% 2.12/2.39  (step @p304 :rule cong :premises (@p303) :args (@t42))
% 2.12/2.39  (step @p305 :rule eq_resolve :premises (@p31 @p304))
% 2.12/2.39  (step @p306 :rule instantiate :premises (@p305) :args ((@list @t119 @t88)))
% 2.12/2.39  (step @p307 :rule cnf_or_neg :args (@t133 1))
% 2.12/2.39  (step @p308 :rule chain_m_resolution :premises (@p307 @p150) :args ((not @t131) @t99 @t134))
% 2.12/2.39  (step @p309 :rule cnf_or_pos :args (@t211))
% 2.12/2.39  (step @p310 :rule reordering :premises (@p309) :args ((or @t131 @t210 (not @t211))))
% 2.12/2.39  (step @p311 :rule chain_m_resolution :premises (@p310 @p308 @p306) :args (@t210 @t129 (@list @t131 @t211)))
% 2.12/2.39  (step @p312 :rule cnf_or_pos :args (@t215))
% 2.12/2.39  (step @p313 :rule reordering :premises (@p312) :args ((or @t214 @t178 @t213 (not @t215))))
% 2.12/2.39  (step @p314 :rule chain_m_resolution :premises (@p313 @p311 @p245 @p298) :args (@t213 (@list false false false) (@list @t210 @t176 @t215)))
% 2.12/2.39  (step @p315 :rule cnf_or_pos :args (@t217))
% 2.12/2.39  (step @p316 :rule reordering :premises (@p315) :args ((or @t212 @t216 @t218)))
% 2.12/2.39  (step @p317 :rule chain_m_resolution :premises (@p316 @p314 @p251) :args (@t218 @t129 (@list @t212 @t180)))
% 2.12/2.39  (assume-push @p326 @t109)
% 2.12/2.39  (step @p319 :rule instantiate :premises (@p120) :args (@t124))
% 2.12/2.39  (step-pop @p327 :rule scope :premises (@p319))
% 2.12/2.39  (step @p320 :rule process_scope :premises (@p327) :args (@t217))
% 2.12/2.39  (step @p322 :rule implies_elim :premises (@p320))
% 2.12/2.39  (step @p323 false :rule chain_m_resolution :premises (@p322 @p317 @p120) :args (false @t129 (@list @t217 @t109)))
% 2.12/2.39  )
% 2.12/2.39  % SZS output end Proof
% 2.12/2.39  % cvc5 exiting
%------------------------------------------------------------------------------