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