↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU261+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 : n005.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:10 AM UTC 2026

% Result   : Theorem 0.40s 0.86s
% Output   : Proof 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU261+2 : 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.16/0.34  % Computer : n005.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue Jun  2 16:48:33 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.38/0.57  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.86  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.40/0.86  % SZS status Theorem
% 0.40/0.86  % SZS output start Proof
% 0.40/0.86  (
% 0.40/0.86  (declare-sort $$unsorted 0)
% 0.40/0.86  (declare-const tptp.are_equipotent (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.ordinal (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.connected (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.empty_set $$unsorted)
% 0.40/0.86  (declare-const tptp.relation_field (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.relation_rng_restriction (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.relation_dom (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.is_transitive_in (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.is_antisymmetric_in (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.union (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.is_connected_in (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.set_meet (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.subset_difference (-> $$unsorted $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.succ (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.function (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.relation_inverse_image (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.identity_relation (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.transitive (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.one_to_one (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.union_of_subsets (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.ordinal_subset (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.subset_complement (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.is_reflexive_in (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.epsilon_connected (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.antisymmetric (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.is_well_founded_in (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.relation_inverse (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.relation (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.cast_to_subset (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.well_orders (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.relation_image (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.powerset (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.unordered_triple (-> $$unsorted $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.complements_of_subsets (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.relation_dom_restriction (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.fiber (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.element (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.reflexive (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.relation_empty_yielding (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.well_founded_relation (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.well_ordering (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.relation_rng (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.being_limit_ordinal (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.epsilon_transitive (-> $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.relation_restriction (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.relation_composition (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.function_inverse (-> $$unsorted $$unsorted))
% 0.40/0.86  (declare-const tptp.relation_isomorphism (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.40/0.86  (declare-const tptp.meet_of_subsets (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.86  (define @t1 () (@var "A" $$unsorted))
% 0.40/0.86  (define @t2 () (@var "B" $$unsorted))
% 0.40/0.86  (define @t3 () (tptp.in @t2 @t1))
% 0.40/0.86  (define @t4 () (not @t3))
% 0.40/0.86  (define @t5 () (tptp.in @t1 @t2))
% 0.40/0.86  (define @t6 () (@list @t1 @t2))
% 0.40/0.86  (define @t7 () (tptp.proper_subset @t2 @t1))
% 0.40/0.86  (define @t8 () (tptp.proper_subset @t1 @t2))
% 0.40/0.86  (define @t9 () (tptp.function @t1))
% 0.40/0.86  (define @t10 () (tptp.empty @t1))
% 0.40/0.86  (define @t11 () (@list @t1))
% 0.40/0.86  (define @t12 () (tptp.epsilon_connected @t1))
% 0.40/0.86  (define @t13 () (tptp.epsilon_transitive @t1))
% 0.40/0.86  (define @t14 () (and @t13 @t12))
% 0.40/0.86  (define @t15 () (tptp.ordinal @t1))
% 0.40/0.86  (define @t16 () (tptp.relation @t1))
% 0.40/0.86  (define @t17 () (tptp.one_to_one @t1))
% 0.40/0.86  (define @t18 () (and @t16 @t9 @t17))
% 0.40/0.86  (define @t19 () (and @t16 @t10 @t9))
% 0.40/0.86  (define @t20 () (and @t13 @t12 @t15))
% 0.40/0.86  (define @t21 () (tptp.unordered_pair @t1 @t2))
% 0.40/0.86  (define @t22 () (tptp.set_union2 @t2 @t1))
% 0.40/0.86  (define @t23 () (tptp.set_union2 @t1 @t2))
% 0.40/0.86  (define @t24 () (tptp.set_intersection2 @t1 @t2))
% 0.40/0.86  (define @t25 () (tptp.ordinal_subset @t1 @t2))
% 0.40/0.86  (define @t26 () (tptp.ordinal @t2))
% 0.40/0.86  (define @t27 () (and @t15 @t26))
% 0.40/0.86  (define @t28 () (@var "D" $$unsorted))
% 0.40/0.86  (define @t29 () (@var "C" $$unsorted))
% 0.40/0.86  (define @t30 () (= @t29 @t28))
% 0.40/0.86  (define @t31 () (tptp.in @t29 @t1))
% 0.40/0.86  (define @t32 () (tptp.ordered_pair @t29 @t28))
% 0.40/0.86  (define @t33 () (tptp.in @t32 @t2))
% 0.40/0.86  (define @t34 () (@list @t29 @t28))
% 0.40/0.86  (define @t35 () (tptp.identity_relation @t1))
% 0.40/0.86  (define @t36 () (= @t2 @t35))
% 0.40/0.86  (define @t37 () (tptp.relation @t2))
% 0.40/0.86  (define @t38 () (tptp.subset @t2 @t1))
% 0.40/0.86  (define @t39 () (tptp.subset @t1 @t2))
% 0.40/0.86  (define @t40 () (= @t1 @t2))
% 0.40/0.86  (define @t41 () (@var "E" $$unsorted))
% 0.40/0.86  (define @t42 () (tptp.ordered_pair @t28 @t41))
% 0.40/0.86  (define @t43 () (tptp.in @t42 @t1))
% 0.40/0.86  (define @t44 () (tptp.in @t28 @t2))
% 0.40/0.86  (define @t45 () (tptp.in @t42 @t29))
% 0.40/0.86  (define @t46 () (@list @t28 @t41))
% 0.40/0.86  (define @t47 () (tptp.relation_dom_restriction @t1 @t2))
% 0.40/0.86  (define @t48 () (tptp.relation @t29))
% 0.40/0.86  (define @t49 () (@list @t2 @t29))
% 0.40/0.86  (define @t50 () (tptp.in @t41 @t2))
% 0.40/0.86  (define @t51 () (tptp.relation_dom @t1))
% 0.40/0.86  (define @t52 () (@list @t41))
% 0.40/0.86  (define @t53 () (tptp.in @t28 @t29))
% 0.40/0.86  (define @t54 () (@list @t28))
% 0.40/0.86  (define @t55 () (= @t29 (tptp.relation_image @t1 @t2)))
% 0.40/0.86  (define @t56 () (and @t16 @t9))
% 0.40/0.86  (define @t57 () (tptp.in @t41 @t1))
% 0.40/0.86  (define @t58 () (tptp.relation_rng_restriction @t1 @t2))
% 0.40/0.86  (define @t59 () (@list @t29))
% 0.40/0.86  (define @t60 () (tptp.relation_field @t1))
% 0.40/0.86  (define @t61 () (tptp.antisymmetric @t1))
% 0.40/0.86  (define @t62 () (tptp.apply @t1 @t28))
% 0.40/0.86  (define @t63 () (tptp.in @t28 @t51))
% 0.40/0.86  (define @t64 () (= @t29 (tptp.relation_inverse_image @t1 @t2)))
% 0.40/0.86  (define @t65 () (tptp.connected @t1))
% 0.40/0.86  (define @t66 () (tptp.transitive @t1))
% 0.40/0.86  (define @t67 () (tptp.in @t41 @t28))
% 0.40/0.86  (define @t68 () (@list @t1 @t2 @t29 @t28))
% 0.40/0.86  (define @t69 () (tptp.singleton @t1))
% 0.40/0.86  (define @t70 () (tptp.succ @t1))
% 0.40/0.86  (define @t71 () (@list @t2))
% 0.40/0.86  (define @t72 () (tptp.in @t29 @t2))
% 0.40/0.86  (define @t73 () (tptp.is_reflexive_in @t1 @t2))
% 0.40/0.86  (define @t74 () (= @t2 tptp.empty_set))
% 0.40/0.86  (define @t75 () (= @t2 (tptp.set_meet @t1)))
% 0.40/0.86  (define @t76 () (= @t1 tptp.empty_set))
% 0.40/0.86  (define @t77 () (tptp.in @t29 @t28))
% 0.40/0.86  (define @t78 () (tptp.in @t28 @t1))
% 0.40/0.86  (define @t79 () (not @t76))
% 0.40/0.86  (define @t80 () (= @t28 @t2))
% 0.40/0.86  (define @t81 () (tptp.powerset @t1))
% 0.40/0.86  (define @t82 () (tptp.in @t32 @t1))
% 0.40/0.86  (define @t83 () (tptp.empty @t2))
% 0.40/0.86  (define @t84 () (tptp.element @t2 @t1))
% 0.40/0.86  (define @t85 () (not @t10))
% 0.40/0.86  (define @t86 () (@list @t1 @t2 @t29))
% 0.40/0.86  (define @t87 () (not @t74))
% 0.40/0.86  (define @t88 () (tptp.well_founded_relation @t1))
% 0.40/0.86  (define @t89 () (@var "F" $$unsorted))
% 0.40/0.86  (define @t90 () (tptp.cartesian_product2 @t1 @t2))
% 0.40/0.86  (define @t91 () (not @t72))
% 0.40/0.86  (define @t92 () (= @t2 @t29))
% 0.40/0.86  (define @t93 () (not @t92))
% 0.40/0.86  (define @t94 () (tptp.in @t2 @t29))
% 0.40/0.86  (define @t95 () (forall @t59 (=> @t31 @t72)))
% 0.40/0.86  (define @t96 () (= @t29 tptp.empty_set))
% 0.40/0.86  (define @t97 () (tptp.subset @t29 @t2))
% 0.40/0.86  (define @t98 () (tptp.is_well_founded_in @t1 @t2))
% 0.40/0.86  (define @t99 () (tptp.apply @t1 @t2))
% 0.40/0.86  (define @t100 () (= @t29 @t99))
% 0.40/0.86  (define @t101 () (tptp.in @t2 @t51))
% 0.40/0.86  (define @t102 () (tptp.in (tptp.ordered_pair @t2 @t29) @t1))
% 0.40/0.87  (define @t103 () (tptp.in (tptp.ordered_pair @t28 @t29) @t1))
% 0.40/0.87  (define @t104 () (tptp.is_antisymmetric_in @t1 @t2))
% 0.40/0.87  (define @t105 () (tptp.cast_to_subset @t1))
% 0.40/0.87  (define @t106 () (tptp.union @t1))
% 0.40/0.87  (define @t107 () (tptp.reflexive @t1))
% 0.40/0.87  (define @t108 () (tptp.well_ordering @t1))
% 0.40/0.87  (define @t109 () (= @t108 (and @t107 @t66 @t61 @t65 @t88)))
% 0.40/0.87  (define @t110 () (forall @t11 (=> @t16 @t109)))
% 0.40/0.87  (define @t111 () (tptp.set_difference @t1 @t2))
% 0.40/0.87  (define @t112 () (and @t63 (= @t29 @t62)))
% 0.40/0.87  (define @t113 () (tptp.relation_rng @t1))
% 0.40/0.87  (define @t114 () (= @t2 @t113))
% 0.40/0.87  (define @t115 () (tptp.subset_complement @t1 @t2))
% 0.40/0.87  (define @t116 () (tptp.element @t2 @t81))
% 0.40/0.87  (define @t117 () (tptp.ordered_pair @t1 @t2))
% 0.40/0.87  (define @t118 () (tptp.is_connected_in @t1 @t2))
% 0.40/0.87  (define @t119 () (tptp.is_transitive_in @t1 @t2))
% 0.40/0.87  (define @t120 () (tptp.being_limit_ordinal @t1))
% 0.40/0.87  (define @t121 () (tptp.cartesian_product2 @t2 @t2))
% 0.40/0.87  (define @t122 () (tptp.relation_restriction @t1 @t2))
% 0.40/0.87  (define @t123 () (tptp.relation_inverse @t1))
% 0.40/0.87  (define @t124 () (tptp.apply @t29 @t28))
% 0.40/0.87  (define @t125 () (tptp.relation_field @t2))
% 0.40/0.87  (define @t126 () (tptp.relation_rng @t29))
% 0.40/0.87  (define @t127 () (tptp.relation_dom @t29))
% 0.40/0.87  (define @t128 () (tptp.relation_isomorphism @t1 @t2 @t29))
% 0.40/0.87  (define @t129 () (tptp.function @t29))
% 0.40/0.87  (define @t130 () (and @t48 @t129))
% 0.40/0.87  (define @t131 () (tptp.disjoint @t1 @t2))
% 0.40/0.87  (define @t132 () (tptp.relation_composition @t1 @t2))
% 0.40/0.87  (define @t133 () (tptp.complements_of_subsets @t1 @t2))
% 0.40/0.87  (define @t134 () (tptp.powerset @t81))
% 0.40/0.87  (define @t135 () (tptp.element @t2 @t134))
% 0.40/0.87  (define @t136 () (not @t40))
% 0.40/0.87  (define @t137 () (tptp.function_inverse @t1))
% 0.40/0.87  (define @t138 () (tptp.relation @t123))
% 0.40/0.87  (define @t139 () (tptp.relation @t132))
% 0.40/0.87  (define @t140 () (and @t16 @t37))
% 0.40/0.87  (define @t141 () (tptp.union_of_subsets @t1 @t2))
% 0.40/0.87  (define @t142 () (tptp.relation @t35))
% 0.40/0.87  (define @t143 () (tptp.meet_of_subsets @t1 @t2))
% 0.40/0.87  (define @t144 () (tptp.subset_difference @t1 @t2 @t29))
% 0.40/0.87  (define @t145 () (tptp.element @t29 @t81))
% 0.40/0.87  (define @t146 () (and @t116 @t145))
% 0.40/0.87  (define @t147 () (tptp.relation @t47))
% 0.40/0.87  (define @t148 () (tptp.relation @t58))
% 0.40/0.87  (define @t149 () (tptp.relation_composition @t2 @t1))
% 0.40/0.87  (define @t150 () (and @t10 @t37))
% 0.40/0.87  (define @t151 () (tptp.relation_empty_yielding tptp.empty_set))
% 0.40/0.87  (define @t152 () (tptp.relation tptp.empty_set))
% 0.40/0.87  (define @t153 () (tptp.empty tptp.empty_set))
% 0.40/0.87  (define @t154 () (tptp.relation_empty_yielding @t1))
% 0.40/0.87  (define @t155 () (and @t16 @t154))
% 0.40/0.87  (define @t156 () (tptp.function @t2))
% 0.40/0.87  (define @t157 () (not (tptp.empty @t70)))
% 0.40/0.87  (define @t158 () (not @t83))
% 0.40/0.87  (define @t159 () (and @t37 @t156))
% 0.40/0.87  (define @t160 () (tptp.empty @t51))
% 0.40/0.87  (define @t161 () (and @t85 @t16))
% 0.40/0.87  (define @t162 () (tptp.empty @t113))
% 0.40/0.87  (define @t163 () (tptp.in @t2 @t60))
% 0.40/0.87  (define @t164 () (tptp.disjoint @t69 @t2))
% 0.40/0.87  (define @t165 () (not @t5))
% 0.40/0.87  (define @t166 () (tptp.relation_dom @t2))
% 0.40/0.87  (define @t167 () (tptp.in (tptp.ordered_pair @t29 @t2) @t1))
% 0.40/0.87  (define @t168 () (not @t102))
% 0.40/0.87  (define @t169 () (tptp.singleton @t2))
% 0.40/0.87  (define @t170 () (tptp.union @t2))
% 0.40/0.87  (define @t171 () (tptp.in @t1 @t29))
% 0.40/0.87  (define @t172 () (tptp.element @t1 (tptp.powerset @t2)))
% 0.40/0.87  (define @t173 () (tptp.relation_dom_restriction @t29 @t1))
% 0.40/0.87  (define @t174 () (tptp.in @t2 (tptp.relation_dom @t173)))
% 0.40/0.87  (define @t175 () (tptp.set_difference @t2 @t29))
% 0.40/0.87  (define @t176 () (= @t1 @t29))
% 0.40/0.87  (define @t177 () (tptp.relation_rng @t58))
% 0.40/0.87  (define @t178 () (tptp.relation_rng @t2))
% 0.40/0.87  (define @t179 () (tptp.cartesian_product2 @t1 @t29))
% 0.40/0.87  (define @t180 () (forall @t59 (not (and @t97 (not (tptp.are_equipotent @t29 @t2)) @t91))))
% 0.40/0.87  (define @t181 () (tptp.powerset @t29))
% 0.40/0.87  (define @t182 () (forall @t34 (=> (and @t72 (tptp.subset @t28 @t29)) @t44)))
% 0.40/0.87  (define @t183 () (tptp.relation_dom_restriction @t29 @t2))
% 0.40/0.87  (define @t184 () (tptp.relation_image @t2 @t1))
% 0.40/0.87  (define @t185 () (tptp.relation_inverse_image @t2 @t1))
% 0.40/0.87  (define @t186 () (tptp.relation_image @t2 @t185))
% 0.40/0.87  (define @t187 () (tptp.set_intersection2 @t166 @t1))
% 0.40/0.87  (define @t188 () (tptp.subset @t1 @t178))
% 0.40/0.87  (define @t189 () (tptp.relation_rng @t132))
% 0.40/0.87  (define @t190 () (tptp.relation_inverse_image @t29 @t2))
% 0.40/0.87  (define @t191 () (tptp.relation_restriction @t29 @t2))
% 0.40/0.87  (define @t192 () (tptp.relation_restriction @t2 @t1))
% 0.40/0.87  (define @t193 () (tptp.relation_dom_restriction @t2 @t1))
% 0.40/0.87  (define @t194 () (tptp.relation_field @t29))
% 0.40/0.87  (define @t195 () (tptp.in @t1 @t194))
% 0.40/0.87  (define @t196 () (tptp.set_intersection2 @t2 @t29))
% 0.40/0.87  (define @t197 () (tptp.subset @t1 @t29))
% 0.40/0.87  (define @t198 () (tptp.element @t1 @t2))
% 0.40/0.87  (define @t199 () (tptp.in @t1 @t127))
% 0.40/0.87  (define @t200 () (tptp.in @t117 @t29))
% 0.40/0.87  (define @t201 () (tptp.relation_field @t192))
% 0.40/0.87  (define @t202 () (tptp.apply @t29 @t1))
% 0.40/0.87  (define @t203 () (tptp.relation_composition @t29 @t2))
% 0.40/0.87  (define @t204 () (tptp.in @t1 (tptp.relation_dom @t203)))
% 0.40/0.87  (define @t205 () (tptp.reflexive @t2))
% 0.40/0.87  (define @t206 () (tptp.connected @t2))
% 0.40/0.87  (define @t207 () (tptp.transitive @t2))
% 0.40/0.87  (define @t208 () (tptp.antisymmetric @t2))
% 0.40/0.87  (define @t209 () (tptp.well_founded_relation @t2))
% 0.40/0.87  (define @t210 () (tptp.well_ordering @t2))
% 0.40/0.87  (define @t211 () (tptp.apply @t2 @t29))
% 0.40/0.87  (define @t212 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1)))
% 0.40/0.87  (define @t213 () (and @t31 @t72))
% 0.40/0.87  (define @t214 () (not @t131))
% 0.40/0.87  (define @t215 () (tptp.succ @t2))
% 0.40/0.87  (define @t216 () (= @t1 @t215))
% 0.40/0.87  (define @t217 () (tptp.subset_complement @t1 @t29))
% 0.40/0.87  (define @t218 () (tptp.disjoint @t2 @t29))
% 0.40/0.87  (define @t219 () (tptp.relation_dom @t132))
% 0.40/0.87  (define @t220 () (tptp.element @t2 @t181))
% 0.40/0.87  (define @t221 () (tptp.in @t29 @t24))
% 0.40/0.87  (define @t222 () (and (=> @t107 @t205) (=> @t66 @t207) (=> @t65 @t206) (=> @t61 @t208) (=> @t88 @t209)))
% 0.40/0.87  (define @t223 () (=> @t128 @t222))
% 0.40/0.87  (define @t224 () (forall @t59 (=> @t130 @t223)))
% 0.40/0.87  (define @t225 () (=> @t37 @t224))
% 0.40/0.87  (define @t226 () (forall @t71 @t225))
% 0.40/0.87  (define @t227 () (=> @t16 @t226))
% 0.40/0.87  (define @t228 () (forall @t11 @t227))
% 0.40/0.87  (define @t229 () (and (tptp.in @t29 @t113) (= @t28 @t211)))
% 0.40/0.87  (define @t230 () (and @t108 @t128))
% 0.40/0.87  (define @t231 () (=> @t230 @t210))
% 0.40/0.87  (define @t232 () (forall @t59 (=> @t130 @t231)))
% 0.40/0.87  (define @t233 () (=> @t37 @t232))
% 0.40/0.87  (define @t234 () (forall @t71 @t233))
% 0.40/0.87  (define @t235 () (=> @t16 @t234))
% 0.40/0.87  (define @t236 () (forall @t11 @t235))
% 0.40/0.87  (define @t237 () (not @t236))
% 0.40/0.87  (define @t238 () (tptp.function_inverse @t2))
% 0.40/0.87  (define @t239 () (= @t113 tptp.empty_set))
% 0.40/0.87  (define @t240 () (= @t51 tptp.empty_set))
% 0.40/0.87  (define @t241 () (= (tptp.apply @t173 @t2) (tptp.apply @t29 @t2)))
% 0.40/0.87  (define @t242 () (= @t69 (tptp.unordered_pair @t2 @t29)))
% 0.40/0.87  (define @t243 () (@var "BOUND_VARIABLE_11762" $$unsorted))
% 0.40/0.87  (define @t244 () (@var "BOUND_VARIABLE_11760" $$unsorted))
% 0.40/0.87  (define @t245 () (not (tptp.relation_isomorphism @t1 @t244 @t243)))
% 0.40/0.87  (define @t246 () (not (tptp.function @t243)))
% 0.40/0.87  (define @t247 () (not (tptp.relation @t243)))
% 0.40/0.87  (define @t248 () (tptp.well_ordering @t244))
% 0.40/0.87  (define @t249 () (not (tptp.relation @t244)))
% 0.40/0.87  (define @t250 () (not @t108))
% 0.40/0.87  (define @t251 () (not @t16))
% 0.40/0.87  (define @t252 () (or @t251 @t250 @t249 @t248 @t247 @t246 @t245))
% 0.40/0.87  (define @t253 () (@list @t1 @t244 @t243))
% 0.40/0.87  (define @t254 () (forall @t253 @t252))
% 0.40/0.87  (define @t255 () (@quantifiers_skolemize @t254 1))
% 0.40/0.87  (define @t256 () (or @t249 @t248 @t247 @t246 @t245))
% 0.40/0.87  (define @t257 () (or @t251 @t250 @t256))
% 0.40/0.87  (define @t258 () (forall @t253 @t257))
% 0.40/0.87  (define @t259 () (@list @t244 @t243))
% 0.40/0.87  (define @t260 () (forall @t259 @t257))
% 0.40/0.87  (define @t261 () (forall @t259 @t256))
% 0.40/0.87  (define @t262 () (@var "BOUND_VARIABLE_11741" $$unsorted))
% 0.40/0.87  (define @t263 () (or @t251 @t250 @t261))
% 0.40/0.87  (define @t264 () (not (tptp.relation_isomorphism @t1 @t2 @t262)))
% 0.40/0.87  (define @t265 () (not (tptp.function @t262)))
% 0.40/0.87  (define @t266 () (not (tptp.relation @t262)))
% 0.40/0.87  (define @t267 () (not @t37))
% 0.40/0.87  (define @t268 () (or @t267 @t210 @t266 @t265 @t264))
% 0.40/0.87  (define @t269 () (@list @t2 @t262))
% 0.40/0.87  (define @t270 () (forall @t269 @t268))
% 0.40/0.87  (define @t271 () (or @t251 @t250 @t270))
% 0.40/0.87  (define @t272 () (or @t250 @t270))
% 0.40/0.87  (define @t273 () (or @t266 @t265 @t264))
% 0.40/0.87  (define @t274 () (or @t267 @t210 @t273))
% 0.40/0.87  (define @t275 () (forall @t269 @t274))
% 0.40/0.87  (define @t276 () (@list @t262))
% 0.40/0.87  (define @t277 () (forall @t276 @t274))
% 0.40/0.87  (define @t278 () (forall @t276 @t273))
% 0.40/0.87  (define @t279 () (@list @t29))
% 0.40/0.87  (define @t280 () (or @t267 @t210 @t278))
% 0.40/0.87  (define @t281 () (not @t128))
% 0.40/0.87  (define @t282 () (not @t129))
% 0.40/0.87  (define @t283 () (not @t48))
% 0.40/0.87  (define @t284 () (or @t283 @t282 @t281))
% 0.40/0.87  (define @t285 () (forall @t59 @t284))
% 0.40/0.87  (define @t286 () (or @t267 @t210 @t285))
% 0.40/0.87  (define @t287 () (forall @t71 @t286))
% 0.40/0.87  (define @t288 () (or @t250 @t287))
% 0.40/0.87  (define @t289 () (or @t250 @t286))
% 0.40/0.87  (define @t290 () (or @t267 @t250 @t210 @t285))
% 0.40/0.87  (define @t291 () (or @t250 @t210 @t285))
% 0.40/0.87  (define @t292 () (or @t250 @t210 @t284))
% 0.40/0.87  (define @t293 () (or @t283 @t282 @t250 @t281 @t210))
% 0.40/0.87  (define @t294 () (or @t250 @t281 @t210))
% 0.40/0.87  (define @t295 () (or @t283 @t282))
% 0.40/0.87  (define @t296 () (not @t130))
% 0.40/0.87  (define @t297 () (tptp.relation @t255))
% 0.40/0.87  (define @t298 () (@quantifiers_skolemize @t254 2))
% 0.40/0.87  (define @t299 () (@quantifiers_skolemize @t254 0))
% 0.40/0.87  (define @t300 () (tptp.relation_isomorphism @t299 @t255 @t298))
% 0.40/0.87  (define @t301 () (not @t300))
% 0.40/0.87  (define @t302 () (tptp.function @t298))
% 0.40/0.87  (define @t303 () (not @t302))
% 0.40/0.87  (define @t304 () (tptp.relation @t298))
% 0.40/0.87  (define @t305 () (not @t304))
% 0.40/0.87  (define @t306 () (tptp.well_ordering @t255))
% 0.40/0.87  (define @t307 () (not @t297))
% 0.40/0.87  (define @t308 () (tptp.well_ordering @t299))
% 0.40/0.87  (define @t309 () (not @t308))
% 0.40/0.87  (define @t310 () (tptp.relation @t299))
% 0.40/0.87  (define @t311 () (not @t310))
% 0.40/0.87  (define @t312 () (or @t311 @t309 @t307 @t306 @t305 @t303 @t301))
% 0.40/0.87  (define @t313 () (@list true))
% 0.40/0.87  (define @t314 () (@list @t312))
% 0.40/0.87  (define @t315 () (tptp.well_founded_relation @t255))
% 0.40/0.87  (define @t316 () (tptp.connected @t255))
% 0.40/0.87  (define @t317 () (tptp.antisymmetric @t255))
% 0.40/0.87  (define @t318 () (tptp.transitive @t255))
% 0.40/0.87  (define @t319 () (tptp.reflexive @t255))
% 0.40/0.87  (define @t320 () (and @t319 @t318 @t317 @t316 @t315))
% 0.40/0.87  (define @t321 () (= @t306 @t320))
% 0.40/0.87  (define @t322 () (or @t307 @t321))
% 0.40/0.87  (define @t323 () (@list false false))
% 0.40/0.87  (define @t324 () (not @t320))
% 0.40/0.87  (define @t325 () (@var "BOUND_VARIABLE_11580" $$unsorted))
% 0.40/0.87  (define @t326 () (@var "BOUND_VARIABLE_11578" $$unsorted))
% 0.40/0.87  (define @t327 () (not (tptp.relation_isomorphism @t1 @t326 @t325)))
% 0.40/0.87  (define @t328 () (not (tptp.function @t325)))
% 0.40/0.87  (define @t329 () (not (tptp.relation @t325)))
% 0.40/0.87  (define @t330 () (not @t88))
% 0.40/0.87  (define @t331 () (not @t61))
% 0.40/0.87  (define @t332 () (not @t65))
% 0.40/0.87  (define @t333 () (not @t66))
% 0.40/0.87  (define @t334 () (not @t107))
% 0.40/0.87  (define @t335 () (and (or @t334 (tptp.reflexive @t326)) (or @t333 (tptp.transitive @t326)) (or @t332 (tptp.connected @t326)) (or @t331 (tptp.antisymmetric @t326)) (or @t330 (tptp.well_founded_relation @t326))))
% 0.40/0.87  (define @t336 () (not (tptp.relation @t326)))
% 0.40/0.87  (define @t337 () (or @t336 @t335 @t329 @t328 @t327))
% 0.40/0.87  (define @t338 () (or @t251 @t337))
% 0.40/0.87  (define @t339 () (forall (@list @t1 @t326 @t325) @t338))
% 0.40/0.87  (define @t340 () (@list @t326 @t325))
% 0.40/0.87  (define @t341 () (forall @t340 @t338))
% 0.40/0.87  (define @t342 () (forall @t340 @t337))
% 0.40/0.87  (define @t343 () (@var "BOUND_VARIABLE_11560" $$unsorted))
% 0.40/0.87  (define @t344 () (or @t251 @t342))
% 0.40/0.87  (define @t345 () (not (tptp.relation_isomorphism @t1 @t2 @t343)))
% 0.40/0.87  (define @t346 () (not (tptp.function @t343)))
% 0.40/0.87  (define @t347 () (not (tptp.relation @t343)))
% 0.40/0.87  (define @t348 () (and (or @t334 @t205) (or @t333 @t207) (or @t332 @t206) (or @t331 @t208) (or @t330 @t209)))
% 0.40/0.87  (define @t349 () (or @t267 @t348 @t347 @t346 @t345))
% 0.40/0.87  (define @t350 () (@list @t2 @t343))
% 0.40/0.87  (define @t351 () (forall @t350 @t349))
% 0.40/0.87  (define @t352 () (or @t347 @t346 @t345))
% 0.40/0.87  (define @t353 () (or @t267 @t348 @t352))
% 0.40/0.87  (define @t354 () (forall @t350 @t353))
% 0.40/0.87  (define @t355 () (@list @t343))
% 0.40/0.87  (define @t356 () (forall @t355 @t353))
% 0.40/0.87  (define @t357 () (forall @t355 @t352))
% 0.40/0.87  (define @t358 () (or @t267 @t348 @t357))
% 0.40/0.87  (define @t359 () (or @t267 @t348 @t285))
% 0.40/0.87  (define @t360 () (or @t348 @t285))
% 0.40/0.87  (define @t361 () (or @t348 @t284))
% 0.40/0.87  (define @t362 () (or @t283 @t282 @t281 @t348))
% 0.40/0.87  (define @t363 () (tptp.well_founded_relation @t299))
% 0.40/0.87  (define @t364 () (not @t363))
% 0.40/0.87  (define @t365 () (or @t364 @t315))
% 0.40/0.87  (define @t366 () (tptp.antisymmetric @t299))
% 0.40/0.87  (define @t367 () (not @t366))
% 0.40/0.87  (define @t368 () (or @t367 @t317))
% 0.40/0.87  (define @t369 () (tptp.connected @t299))
% 0.40/0.87  (define @t370 () (not @t369))
% 0.40/0.87  (define @t371 () (or @t370 @t316))
% 0.40/0.87  (define @t372 () (tptp.transitive @t299))
% 0.40/0.87  (define @t373 () (not @t372))
% 0.40/0.87  (define @t374 () (or @t373 @t318))
% 0.40/0.87  (define @t375 () (tptp.reflexive @t299))
% 0.40/0.87  (define @t376 () (not @t375))
% 0.40/0.87  (define @t377 () (or @t376 @t319))
% 0.40/0.87  (define @t378 () (and @t377 @t374 @t371 @t368 @t365))
% 0.40/0.87  (define @t379 () (or @t311 @t307 @t378 @t305 @t303 @t301))
% 0.40/0.87  (define @t380 () (not @t378))
% 0.40/0.87  (define @t381 () (@list false))
% 0.40/0.87  (define @t382 () (@list @t378))
% 0.40/0.87  (define @t383 () (and @t375 @t372 @t366 @t369 @t363))
% 0.40/0.87  (define @t384 () (= @t308 @t383))
% 0.40/0.87  (define @t385 () (or @t311 @t384))
% 0.40/0.87  (define @t386 () (not @t383))
% 0.40/0.87  (define @t387 () (@list @t383))
% 0.40/0.87  (assume @p1 (forall @t6 (=> @t5 @t4)))
% 0.40/0.87  (assume @p2 (forall @t6 (=> @t8 (not @t7))))
% 0.40/0.87  (assume @p3 (forall @t11 (=> @t10 @t9)))
% 0.40/0.87  (assume @p4 (forall @t11 (=> @t15 @t14)))
% 0.40/0.87  (assume @p5 (forall @t11 (=> @t10 @t16)))
% 0.40/0.87  (assume @p6 (forall @t11 (=> @t19 @t18)))
% 0.40/0.87  (assume @p7 (forall @t11 (=> @t14 @t15)))
% 0.40/0.87  (assume @p8 (forall @t11 (=> @t10 @t20)))
% 0.40/0.87  (assume @p9 (forall @t6 (= @t21 (tptp.unordered_pair @t2 @t1))))
% 0.40/0.87  (assume @p10 (forall @t6 (= @t23 @t22)))
% 0.40/0.87  (assume @p11 (forall @t6 (= @t24 (tptp.set_intersection2 @t2 @t1))))
% 0.40/0.87  (assume @p12 (forall @t6 (=> @t27 (or @t25 (tptp.ordinal_subset @t2 @t1)))))
% 0.40/0.87  (assume @p13 (forall @t6 (=> @t37 (= @t36 (forall @t34 (= @t33 (and @t31 @t30)))))))
% 0.40/0.87  (assume @p14 (forall @t6 (= @t40 (and @t39 @t38))))
% 0.40/0.87  (assume @p15 (forall @t11 (=> @t16 (forall @t49 (=> @t48 (= (= @t29 @t47) (forall @t46 (= @t45 (and @t44 @t43)))))))))
% 0.40/0.87  (assume @p16 (forall @t11 (=> @t56 (forall @t49 (= @t55 (forall @t54 (= @t53 (exists @t52 (and (tptp.in @t41 @t51) @t50 (= @t28 (tptp.apply @t1 @t41)))))))))))
% 0.40/0.87  (assume @p17 (forall @t6 (=> @t37 (forall @t59 (=> @t48 (= (= @t29 @t58) (forall @t46 (= @t45 (and @t57 (tptp.in @t42 @t2))))))))))
% 0.40/0.87  (assume @p18 (forall @t11 (=> @t16 (= @t61 (tptp.is_antisymmetric_in @t1 @t60)))))
% 0.40/0.87  (assume @p19 (forall @t11 (=> @t56 (forall @t49 (= @t64 (forall @t54 (= @t53 (and @t63 (tptp.in @t62 @t2)))))))))
% 0.40/0.87  (assume @p20 (forall @t11 (=> @t16 (forall @t49 (= @t55 (forall @t54 (= @t53 (exists @t52 (and (tptp.in (tptp.ordered_pair @t41 @t28) @t1) @t50)))))))))
% 0.40/0.87  (assume @p21 (forall @t11 (=> @t16 (forall @t49 (= @t64 (forall @t54 (= @t53 (exists @t52 (and @t43 @t50)))))))))
% 0.40/0.87  (assume @p22 (forall @t11 (=> @t16 (= @t65 (tptp.is_connected_in @t1 @t60)))))
% 0.40/0.87  (assume @p23 (forall @t11 (=> @t16 (= @t66 (tptp.is_transitive_in @t1 @t60)))))
% 0.40/0.87  (assume @p24 (forall @t68 (= (= @t28 (tptp.unordered_triple @t1 @t2 @t29)) (forall @t52 (= @t67 (not (and (not (= @t41 @t1)) (not (= @t41 @t2)) (not (= @t41 @t29)))))))))
% 0.40/0.87  (assume @p25 (forall @t11 (= @t70 (tptp.set_union2 @t1 @t69))))
% 0.40/0.87  (assume @p26 (forall @t11 (= @t16 (forall @t71 (not (and @t3 (forall @t34 (not (= @t2 @t32)))))))))
% 0.40/0.87  (assume @p27 (forall @t11 (=> @t16 (forall @t71 (= @t73 (forall @t59 (=> @t72 (tptp.in (tptp.ordered_pair @t29 @t29) @t1))))))))
% 0.40/0.87  (assume @p28 (forall @t6 (and (=> @t79 (= @t75 (forall @t59 (= @t72 (forall @t54 (=> @t78 @t77)))))) (=> @t76 (= @t75 @t74)))))
% 0.40/0.87  (assume @p29 (forall @t6 (= (= @t2 @t69) (forall @t59 (= @t72 (= @t29 @t1))))))
% 0.40/0.87  (assume @p30 (forall @t11 (=> @t16 (forall @t49 (= (= @t29 (tptp.fiber @t1 @t2)) (forall @t54 (= @t53 (and (not @t80) (tptp.in (tptp.ordered_pair @t28 @t2) @t1)))))))))
% 0.40/0.87  (assume @p31 (forall @t11 (= @t76 (forall @t71 @t4))))
% 0.40/0.87  (assume @p32 (forall @t6 (= (= @t2 @t81) (forall @t59 (= @t72 (tptp.subset @t29 @t1))))))
% 0.40/0.87  (assume @p33 (forall @t11 (= @t13 (forall @t71 (=> @t3 @t38)))))
% 0.40/0.87  (assume @p34 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (= @t40 (forall @t34 (= @t82 @t33))))))))
% 0.40/0.87  (assume @p35 (forall @t6 (and (=> @t85 (= @t84 @t3)) (=> @t10 (= @t84 @t83)))))
% 0.40/0.87  (assume @p36 (forall @t86 (= (= @t29 @t21) (forall @t54 (= @t53 (or (= @t28 @t1) @t80))))))
% 0.40/0.87  (assume @p37 (forall @t11 (=> @t16 (= @t88 (forall @t71 (not (and (tptp.subset @t2 @t60) @t87 (forall @t59 (not (and @t72 (tptp.disjoint (tptp.fiber @t1 @t29) @t2)))))))))))
% 0.40/0.87  (assume @p38 (forall @t86 (= (= @t29 @t23) (forall @t54 (= @t53 (or @t78 @t44))))))
% 0.40/0.87  (assume @p39 (forall @t86 (= (= @t29 @t90) (forall @t54 (= @t53 (exists (@list @t41 @t89) (and @t57 (tptp.in @t89 @t2) (= @t28 (tptp.ordered_pair @t41 @t89)))))))))
% 0.40/0.87  (assume @p40 (forall @t11 (= @t12 (forall @t49 (not (and @t3 @t31 (not @t94) @t93 @t91))))))
% 0.40/0.87  (assume @p41 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (= @t39 (forall @t34 (=> @t82 @t33))))))))
% 0.40/0.87  (assume @p42 (forall @t6 (= @t39 @t95)))
% 0.40/0.87  (assume @p43 (forall @t11 (=> @t16 (forall @t71 (= @t98 (forall @t59 (not (and @t97 (not @t96) (forall @t54 (not (and @t53 (tptp.disjoint (tptp.fiber @t1 @t28) @t29))))))))))))
% 0.40/0.87  (assume @p44 (forall @t86 (= (= @t29 @t24) (forall @t54 (= @t53 (and @t78 @t44))))))
% 0.40/0.87  (assume @p45 (forall @t11 (=> @t56 (forall @t49 (and (=> @t101 (= @t100 @t102)) (=> (not @t101) (= @t100 @t96)))))))
% 0.40/0.87  (assume @p46 (forall @t11 (= @t15 @t14)))
% 0.40/0.87  (assume @p47 (forall @t11 (=> @t16 (forall @t71 (= (= @t2 @t51) (forall @t59 (= @t72 (exists @t54 @t82))))))))
% 0.40/0.87  (assume @p48 (forall @t11 (=> @t16 (forall @t71 (= @t104 (forall @t34 (=> (and @t72 @t44 @t82 @t103) @t30)))))))
% 0.40/0.87  (assume @p49 (forall @t11 (= @t105 @t1)))
% 0.40/0.87  (assume @p50 (forall @t6 (= (= @t2 @t106) (forall @t59 (= @t72 (exists @t54 (and @t77 @t78)))))))
% 0.40/0.87  (assume @p51 @t110)
% 0.40/0.87  (assume @p52 (forall @t86 (= (= @t29 @t111) (forall @t54 (= @t53 (and @t78 (not @t44)))))))
% 0.40/0.87  (assume @p53 (forall @t11 (=> @t56 (forall @t71 (= @t114 (forall @t59 (= @t72 (exists @t54 @t112))))))))
% 0.40/0.87  (assume @p54 (forall @t11 (=> @t16 (forall @t71 (= @t114 (forall @t59 (= @t72 (exists @t54 @t103))))))))
% 0.40/0.87  (assume @p55 (forall @t6 (=> @t116 (= @t115 @t111))))
% 0.40/0.87  (assume @p56 (forall @t6 (= @t117 (tptp.unordered_pair @t21 @t69))))
% 0.40/0.87  (assume @p57 (forall @t11 (=> @t16 (forall @t71 (= (tptp.well_orders @t1 @t2) (and @t73 @t119 @t104 @t118 @t98))))))
% 0.40/0.87  (assume @p58 (forall @t11 (= @t120 (= @t1 @t106))))
% 0.40/0.87  (assume @p59 (forall @t11 (=> @t16 (= @t60 (tptp.set_union2 @t51 @t113)))))
% 0.40/0.87  (assume @p60 (forall @t11 (=> @t16 (forall @t71 (= @t118 (forall @t34 (not (and @t72 @t44 (not @t30) (not @t82) (not @t103)))))))))
% 0.40/0.87  (assume @p61 (forall @t11 (=> @t16 (forall @t71 (= @t122 (tptp.set_intersection2 @t1 @t121))))))
% 0.40/0.87  (assume @p62 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (= (= @t2 @t123) (forall @t34 (= @t33 @t103))))))))
% 0.40/0.87  (assume @p63 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (forall @t59 (=> @t130 (= @t128 (and (= @t127 @t60) (= @t126 @t125) (tptp.one_to_one @t29) (forall @t46 (= @t43 (and (tptp.in @t28 @t60) (tptp.in @t41 @t60) (tptp.in (tptp.ordered_pair @t124 (tptp.apply @t29 @t41)) @t2)))))))))))))
% 0.40/0.87  (assume @p64 (forall @t6 (= @t131 (= @t24 tptp.empty_set))))
% 0.40/0.87  (assume @p65 (forall @t11 (=> @t56 (= @t17 (forall @t49 (=> (and @t101 (tptp.in @t29 @t51) (= @t99 (tptp.apply @t1 @t29))) @t92))))))
% 0.40/0.87  (assume @p66 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (forall @t59 (=> @t48 (= (= @t29 @t132) (forall @t46 (= @t45 (exists (@list @t89) (and (tptp.in (tptp.ordered_pair @t28 @t89) @t1) (tptp.in (tptp.ordered_pair @t89 @t41) @t2)))))))))))))
% 0.40/0.87  (assume @p67 (forall @t11 (=> @t16 (forall @t71 (= @t119 (forall (@list @t29 @t28 @t41) (=> (and @t72 @t44 @t50 @t82 @t43) (tptp.in (tptp.ordered_pair @t29 @t41) @t1))))))))
% 0.40/0.87  (assume @p68 (forall @t6 (=> @t135 (forall @t59 (=> (tptp.element @t29 @t134) (= (= @t29 @t133) (forall @t54 (=> (tptp.element @t28 @t81) (= @t53 (tptp.in (tptp.subset_complement @t1 @t28) @t2))))))))))
% 0.40/0.87  (assume @p69 (forall @t6 (= @t8 (and @t39 @t136))))
% 0.40/0.87  (assume @p70 (forall @t11 (=> @t56 (=> @t17 (= @t137 @t123)))))
% 0.40/0.87  (assume @p71 (forall @t11 (=> @t16 (= @t107 (tptp.is_reflexive_in @t1 @t60)))))
% 0.40/0.87  (assume @p72 true)
% 0.40/0.87  (assume @p73 (forall @t11 (=> @t56 (and (tptp.relation @t137) (tptp.function @t137)))))
% 0.40/0.87  (assume @p74 (forall @t11 (tptp.element @t105 @t81)))
% 0.40/0.87  (assume @p75 (forall @t6 (=> @t16 (tptp.relation @t122))))
% 0.40/0.87  (assume @p76 (forall @t6 (=> @t116 (tptp.element @t115 @t81))))
% 0.40/0.87  (assume @p77 (forall @t11 (=> @t16 @t138)))
% 0.40/0.87  (assume @p78 (forall @t6 (=> @t140 @t139)))
% 0.40/0.87  (assume @p79 (forall @t6 (=> @t135 (tptp.element @t141 @t81))))
% 0.40/0.87  (assume @p80 (forall @t11 @t142))
% 0.40/0.87  (assume @p81 (forall @t6 (=> @t135 (tptp.element @t143 @t81))))
% 0.40/0.87  (assume @p82 (forall @t86 (=> @t146 (tptp.element @t144 @t81))))
% 0.40/0.87  (assume @p83 (forall @t6 (=> @t16 @t147)))
% 0.40/0.87  (assume @p84 (forall @t6 (=> @t135 (tptp.element @t133 @t134))))
% 0.40/0.87  (assume @p85 (forall @t6 (=> @t37 @t148)))
% 0.40/0.87  (assume @p86 (forall @t11 (exists @t71 @t84)))
% 0.40/0.87  (assume @p87 (forall @t6 (=> @t150 (and (tptp.empty @t149) (tptp.relation @t149)))))
% 0.40/0.87  (assume @p88 (forall @t11 (=> @t10 (and (tptp.empty @t123) @t138))))
% 0.40/0.87  (assume @p89 (and @t153 @t152 @t151))
% 0.40/0.87  (assume @p90 (forall @t6 (=> @t155 (and @t147 (tptp.relation_empty_yielding @t47)))))
% 0.40/0.87  (assume @p91 (forall @t6 (=> (and @t16 @t9 @t37 @t156) (and @t139 (tptp.function @t132)))))
% 0.40/0.87  (assume @p92 (forall @t11 @t157))
% 0.40/0.87  (assume @p93 (forall @t6 (=> @t140 (tptp.relation @t24))))
% 0.40/0.87  (assume @p94 (forall @t11 (not (tptp.empty @t81))))
% 0.40/0.87  (assume @p95 @t153)
% 0.40/0.87  (assume @p96 (forall @t6 (not (tptp.empty @t117))))
% 0.40/0.87  (assume @p97 (forall @t11 (and @t142 (tptp.function @t35))))
% 0.40/0.87  (assume @p98 (and @t152 @t151 (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) @t153 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set)))
% 0.40/0.87  (assume @p99 (forall @t6 (=> @t140 (tptp.relation @t23))))
% 0.40/0.87  (assume @p100 (forall @t11 (not (tptp.empty @t69))))
% 0.40/0.87  (assume @p101 (forall @t6 (=> @t85 (not (tptp.empty @t23)))))
% 0.40/0.87  (assume @p102 (forall @t11 (=> @t18 (and @t138 (tptp.function @t123)))))
% 0.40/0.87  (assume @p103 (forall @t11 (=> @t15 (and @t157 (tptp.epsilon_transitive @t70) (tptp.epsilon_connected @t70) (tptp.ordinal @t70)))))
% 0.40/0.87  (assume @p104 (forall @t6 (=> @t140 (tptp.relation @t111))))
% 0.40/0.87  (assume @p105 (forall @t6 (not (tptp.empty @t21))))
% 0.40/0.87  (assume @p106 (forall @t6 (=> @t85 (not (tptp.empty @t22)))))
% 0.40/0.87  (assume @p107 (forall @t6 (=> @t56 (and @t147 (tptp.function @t47)))))
% 0.40/0.87  (assume @p108 (forall @t11 (=> @t15 (and (tptp.epsilon_transitive @t106) (tptp.epsilon_connected @t106) (tptp.ordinal @t106)))))
% 0.40/0.87  (assume @p109 (and @t153 @t152))
% 0.40/0.87  (assume @p110 (forall @t6 (=> (and @t85 @t158) (not (tptp.empty @t90)))))
% 0.40/0.87  (assume @p111 (forall @t6 (=> @t159 (and @t148 (tptp.function @t58)))))
% 0.40/0.87  (assume @p112 (forall @t11 (=> @t161 (not @t160))))
% 0.40/0.87  (assume @p113 (forall @t11 (=> @t161 (not @t162))))
% 0.40/0.87  (assume @p114 (forall @t11 (=> @t10 (and @t160 (tptp.relation @t51)))))
% 0.40/0.87  (assume @p115 (forall @t11 (=> @t10 (and @t162 (tptp.relation @t113)))))
% 0.40/0.87  (assume @p116 (forall @t6 (=> @t150 (and (tptp.empty @t132) @t139))))
% 0.40/0.87  (assume @p117 (forall @t6 (= (tptp.set_union2 @t1 @t1) @t1)))
% 0.40/0.87  (assume @p118 (forall @t6 (= (tptp.set_intersection2 @t1 @t1) @t1)))
% 0.40/0.87  (assume @p119 (forall @t6 (=> @t116 (= (tptp.subset_complement @t1 @t115) @t2))))
% 0.40/0.87  (assume @p120 (forall @t11 (=> @t16 (= (tptp.relation_inverse @t123) @t1))))
% 0.40/0.87  (assume @p121 (forall @t6 (=> @t135 (= (tptp.complements_of_subsets @t1 @t133) @t2))))
% 0.40/0.87  (assume @p122 (forall @t6 (not (tptp.proper_subset @t1 @t1))))
% 0.40/0.87  (assume @p123 (forall @t11 (=> @t16 (= @t107 (forall @t71 (=> @t163 (tptp.in (tptp.ordered_pair @t2 @t2) @t1)))))))
% 0.40/0.87  (assume @p124 (forall @t11 (not (= @t69 tptp.empty_set))))
% 0.40/0.87  (assume @p125 (forall @t6 (=> @t5 (= (tptp.set_union2 @t69 @t2) @t2))))
% 0.40/0.87  (assume @p126 (forall @t6 (not (and @t164 @t5))))
% 0.40/0.87  (assume @p127 (forall @t6 (=> @t165 @t164)))
% 0.40/0.87  (assume @p128 (forall @t6 (=> @t37 (tptp.subset (tptp.relation_dom @t58) @t166))))
% 0.40/0.87  (assume @p129 (forall @t11 (=> @t16 (= @t66 (forall (@list @t2 @t29 @t28) (=> (and @t102 @t82) (tptp.in (tptp.ordered_pair @t2 @t28) @t1)))))))
% 0.40/0.87  (assume @p130 (forall @t6 (= (tptp.subset @t69 @t2) @t5)))
% 0.40/0.87  (assume @p131 (forall @t6 (= (= @t111 tptp.empty_set) @t39)))
% 0.40/0.87  (assume @p132 (forall @t6 (=> @t116 (forall @t59 (=> @t72 @t31)))))
% 0.40/0.87  (assume @p133 (forall @t11 (=> @t16 (= @t61 (forall @t49 (=> (and @t102 @t167) @t92))))))
% 0.40/0.87  (assume @p134 (forall @t86 (=> @t39 (or @t31 (tptp.subset @t1 (tptp.set_difference @t2 (tptp.singleton @t29)))))))
% 0.40/0.87  (assume @p135 (forall @t11 (=> @t16 (= @t65 (forall @t49 (not (and @t163 (tptp.in @t29 @t60) @t93 @t168 (not @t167))))))))
% 0.40/0.87  (assume @p136 (forall @t6 (= (tptp.subset @t1 @t169) (or @t76 (= @t1 @t169)))))
% 0.40/0.87  (assume @p137 (forall @t6 (=> @t5 (tptp.subset @t1 @t170))))
% 0.40/0.87  (assume @p138 (forall @t68 (= (tptp.in @t117 (tptp.cartesian_product2 @t29 @t28)) (and @t171 (tptp.in @t2 @t28)))))
% 0.40/0.87  (assume @p139 (forall @t6 (=> @t95 @t172)))
% 0.40/0.87  (assume @p140 (forall @t86 (=> @t130 (= @t174 (and (tptp.in @t2 @t127) @t3)))))
% 0.40/0.87  (assume @p141 (exists @t11 @t56))
% 0.40/0.87  (assume @p142 (exists @t11 @t20))
% 0.40/0.87  (assume @p143 (exists @t11 (and @t10 @t16)))
% 0.40/0.87  (assume @p144 (forall @t11 (=> @t85 (exists @t71 (and @t116 @t158)))))
% 0.40/0.87  (assume @p145 (exists @t11 @t10))
% 0.40/0.87  (assume @p146 (exists @t11 @t19))
% 0.40/0.87  (assume @p147 (exists @t11 (and @t16 @t9 @t17 @t10 @t13 @t12 @t15)))
% 0.40/0.87  (assume @p148 (exists @t11 @t161))
% 0.40/0.87  (assume @p149 (forall @t11 (exists @t71 (and @t116 @t83))))
% 0.40/0.87  (assume @p150 (exists @t11 @t85))
% 0.40/0.87  (assume @p151 (exists @t11 @t18))
% 0.40/0.87  (assume @p152 (exists @t11 (and @t85 @t13 @t12 @t15)))
% 0.40/0.87  (assume @p153 (exists @t11 @t155))
% 0.40/0.87  (assume @p154 (exists @t11 (and @t16 @t154 @t9)))
% 0.40/0.87  (assume @p155 (forall @t6 (=> @t135 (= @t141 @t170))))
% 0.40/0.87  (assume @p156 (forall @t6 (=> @t135 (= @t143 (tptp.set_meet @t2)))))
% 0.40/0.87  (assume @p157 (forall @t86 (=> @t146 (= @t144 @t175))))
% 0.40/0.87  (assume @p158 (forall @t6 (=> @t27 (= @t25 @t39))))
% 0.40/0.87  (assume @p159 (forall @t6 (=> @t27 (tptp.ordinal_subset @t1 @t1))))
% 0.40/0.87  (assume @p160 (forall @t6 (tptp.subset @t1 @t1)))
% 0.40/0.87  (assume @p161 (forall @t6 (=> @t131 (tptp.disjoint @t2 @t1))))
% 0.40/0.87  (assume @p162 (forall @t11 (tptp.in @t1 @t70)))
% 0.40/0.87  (assume @p163 (forall @t68 (not (and (= @t21 (tptp.unordered_pair @t29 @t28)) (not @t176) (not (= @t1 @t28))))))
% 0.40/0.87  (assume @p164 (forall @t86 (=> @t48 (= (tptp.in @t1 (tptp.relation_rng (tptp.relation_rng_restriction @t2 @t29))) (and @t5 (tptp.in @t1 @t126))))))
% 0.40/0.87  (assume @p165 (forall @t6 (=> @t37 (tptp.subset @t177 @t1))))
% 0.40/0.87  (assume @p166 (forall @t6 (=> @t37 (tptp.subset @t58 @t2))))
% 0.40/0.87  (assume @p167 (forall @t6 (=> @t37 (tptp.subset @t177 @t178))))
% 0.40/0.87  (assume @p168 (forall @t86 (=> @t39 (and (tptp.subset @t179 (tptp.cartesian_product2 @t2 @t29)) (tptp.subset (tptp.cartesian_product2 @t29 @t1) (tptp.cartesian_product2 @t29 @t2))))))
% 0.40/0.87  (assume @p169 (forall @t6 (=> @t37 (= @t177 (tptp.set_intersection2 @t178 @t1)))))
% 0.40/0.87  (assume @p170 (forall @t68 (=> (and @t39 (tptp.subset @t29 @t28)) (tptp.subset @t179 (tptp.cartesian_product2 @t2 @t28)))))
% 0.40/0.87  (assume @p171 (forall @t6 (=> @t39 (= @t23 @t2))))
% 0.40/0.87  (assume @p172 (forall @t11 (exists @t71 (and @t5 @t182 (forall @t59 (=> @t72 (tptp.in @t181 @t2))) @t180))))
% 0.40/0.87  (assume @p173 (forall @t86 (=> @t48 (= (tptp.relation_dom_restriction (tptp.relation_rng_restriction @t1 @t29) @t2) (tptp.relation_rng_restriction @t1 @t183)))))
% 0.40/0.87  (assume @p174 (forall @t86 (=> @t48 (= (tptp.in @t1 (tptp.relation_image @t29 @t2)) (exists @t54 (and (tptp.in @t28 @t127) (tptp.in (tptp.ordered_pair @t28 @t1) @t29) @t44))))))
% 0.40/0.87  (assume @p175 (forall @t6 (=> @t37 (tptp.subset @t184 @t178))))
% 0.40/0.87  (assume @p176 (forall @t6 (=> @t159 (tptp.subset @t186 @t1))))
% 0.40/0.87  (assume @p177 (forall @t6 (=> @t37 (= @t184 (tptp.relation_image @t2 @t187)))))
% 0.40/0.87  (assume @p178 (forall @t6 (=> @t37 (=> (tptp.subset @t1 @t166) (tptp.subset @t1 (tptp.relation_inverse_image @t2 @t184))))))
% 0.40/0.87  (assume @p179 (forall @t11 (=> @t16 (= (tptp.relation_image @t1 @t51) @t113))))
% 0.40/0.87  (assume @p180 (forall @t6 (=> @t159 (=> @t188 (= @t186 @t1)))))
% 0.40/0.87  (assume @p181 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (= @t189 (tptp.relation_image @t2 @t113)))))))
% 0.40/0.87  (assume @p182 (forall @t86 (=> @t48 (= (tptp.in @t1 @t190) (exists @t54 (and (tptp.in @t28 @t126) (tptp.in (tptp.ordered_pair @t1 @t28) @t29) @t44))))))
% 0.40/0.87  (assume @p183 (forall @t6 (=> @t37 (tptp.subset @t185 @t166))))
% 0.40/0.87  (assume @p184 (forall @t86 (=> @t48 (= (tptp.in @t1 @t191) (and @t171 (tptp.in @t1 @t121))))))
% 0.40/0.87  (assume @p185 (forall @t6 (=> @t37 (not (and @t79 @t188 (= @t185 tptp.empty_set))))))
% 0.40/0.87  (assume @p186 (forall @t86 (=> @t48 (=> @t39 (tptp.subset (tptp.relation_inverse_image @t29 @t1) @t190)))))
% 0.40/0.87  (assume @p187 (forall @t6 (=> @t37 (= @t192 (tptp.relation_dom_restriction @t58 @t1)))))
% 0.40/0.87  (assume @p188 (forall @t6 (tptp.subset @t24 @t1)))
% 0.40/0.87  (assume @p189 (forall @t6 (=> @t37 (= @t192 (tptp.relation_rng_restriction @t1 @t193)))))
% 0.40/0.87  (assume @p190 (forall @t86 (=> @t48 (=> (tptp.in @t1 (tptp.relation_field @t191)) (and @t195 @t5)))))
% 0.40/0.87  (assume @p191 (forall @t86 (=> (and @t39 @t197) (tptp.subset @t1 @t196))))
% 0.40/0.87  (assume @p192 (forall @t11 (= (tptp.set_union2 @t1 tptp.empty_set) @t1)))
% 0.40/0.87  (assume @p193 (forall @t6 (=> @t5 @t198)))
% 0.40/0.87  (assume @p194 (forall @t86 (=> (and @t39 (tptp.subset @t2 @t29)) @t197)))
% 0.40/0.87  (assume @p195 (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set)))
% 0.40/0.87  (assume @p196 (forall @t86 (=> @t48 (=> @t200 (and @t199 (tptp.in @t2 @t126))))))
% 0.40/0.87  (assume @p197 (forall @t6 (=> @t37 (and (tptp.subset @t201 @t125) (tptp.subset @t201 @t1)))))
% 0.40/0.87  (assume @p198 (forall @t6 (=> @t159 (forall @t59 (=> @t130 (= @t204 (and @t199 (tptp.in @t202 @t166))))))))
% 0.40/0.87  (assume @p199 (forall @t11 (=> @t13 (forall @t71 (=> @t26 (=> @t8 @t5))))))
% 0.40/0.87  (assume @p200 (forall @t11 (=> @t16 (tptp.subset @t1 (tptp.cartesian_product2 @t51 @t113)))))
% 0.40/0.87  (assume @p201 (forall @t86 (=> @t48 (tptp.subset (tptp.fiber (tptp.relation_restriction @t29 @t1) @t2) (tptp.fiber @t29 @t2)))))
% 0.40/0.87  (assume @p202 (forall @t6 (=> @t159 (forall @t59 (=> @t130 (=> @t204 (= (tptp.apply @t203 @t1) (tptp.apply @t2 @t202))))))))
% 0.40/0.87  (assume @p203 (forall @t6 (=> @t37 (=> @t205 (tptp.reflexive @t192)))))
% 0.40/0.87  (assume @p204 (forall @t6 (=> @t159 (forall @t59 (=> @t130 (=> (tptp.in @t1 @t166) (= (tptp.apply (tptp.relation_composition @t2 @t29) @t1) (tptp.apply @t29 (tptp.apply @t2 @t1)))))))))
% 0.40/0.87  (assume @p205 (forall @t6 (=> @t26 (=> @t5 @t15))))
% 0.40/0.87  (assume @p206 (forall @t6 (=> @t37 (=> @t206 (tptp.connected @t192)))))
% 0.40/0.87  (assume @p207 (forall @t11 (=> @t15 (forall @t71 (=> @t26 (not (and @t165 @t136 @t4)))))))
% 0.40/0.87  (assume @p208 (forall @t6 (=> @t37 (=> @t207 (tptp.transitive @t192)))))
% 0.40/0.87  (assume @p209 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (=> @t39 (and (tptp.subset @t51 @t166) (tptp.subset @t113 @t178))))))))
% 0.40/0.87  (assume @p210 (forall @t6 (=> @t37 (=> @t208 (tptp.antisymmetric @t192)))))
% 0.40/0.87  (assume @p211 (forall @t86 (=> @t39 (tptp.subset (tptp.set_intersection2 @t1 @t29) @t196))))
% 0.40/0.87  (assume @p212 (forall @t6 (=> @t39 (= @t24 @t1))))
% 0.40/0.87  (assume @p213 (forall @t11 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set)))
% 0.40/0.87  (assume @p214 (forall @t6 (=> @t198 (or @t83 @t5))))
% 0.40/0.87  (assume @p215 (forall @t6 (=> (forall @t59 (= @t31 @t72)) @t40)))
% 0.40/0.87  (assume @p216 (forall @t11 (tptp.subset tptp.empty_set @t1)))
% 0.40/0.87  (assume @p217 (forall @t86 (=> @t48 (=> @t200 (and @t195 (tptp.in @t2 @t194))))))
% 0.40/0.87  (assume @p218 (forall @t11 (=> (forall @t71 (=> @t3 (and @t26 @t38))) @t15)))
% 0.40/0.87  (assume @p219 (forall @t6 (=> @t37 (=> @t209 (tptp.well_founded_relation @t192)))))
% 0.40/0.87  (assume @p220 (forall @t6 (=> @t26 (not (and @t39 @t79 (forall @t59 (=> (tptp.ordinal @t29) (not (and @t31 (forall @t54 (=> (tptp.ordinal @t28) (=> @t78 (tptp.ordinal_subset @t29 @t28)))))))))))))
% 0.40/0.87  (assume @p221 (forall @t6 (=> @t37 (=> @t210 (tptp.well_ordering @t192)))))
% 0.40/0.87  (assume @p222 (forall @t11 (=> @t15 (forall @t71 (=> @t26 (= @t5 (tptp.ordinal_subset @t70 @t2)))))))
% 0.40/0.87  (assume @p223 (forall @t86 (=> @t39 (tptp.subset (tptp.set_difference @t1 @t29) @t175))))
% 0.40/0.87  (assume @p224 (forall @t68 (=> (= @t117 @t32) (and @t176 (= @t2 @t28)))))
% 0.40/0.87  (assume @p225 (forall @t6 (=> @t159 (= @t36 (and (= @t166 @t1) (forall @t59 (=> @t31 (= @t211 @t29))))))))
% 0.40/0.87  (assume @p226 (forall @t6 (=> @t3 (= (tptp.apply @t35 @t2) @t2))))
% 0.40/0.87  (assume @p227 (forall @t6 (tptp.subset @t111 @t1)))
% 0.40/0.87  (assume @p228 (forall @t11 (=> @t16 (and (= @t113 (tptp.relation_dom @t123)) (= @t51 (tptp.relation_rng @t123))))))
% 0.40/0.87  (assume @p229 (forall @t86 (= (tptp.subset @t21 @t29) (and @t171 @t94))))
% 0.40/0.87  (assume @p230 (forall @t6 (=> @t37 (=> (and @t210 (tptp.subset @t1 @t125)) (= @t201 @t1)))))
% 0.40/0.87  (assume @p231 (forall @t6 (= @t212 @t23)))
% 0.40/0.87  (assume @p232 (forall @t11 (= (tptp.set_difference @t1 tptp.empty_set) @t1)))
% 0.40/0.87  (assume @p233 (forall @t86 (not (and @t5 @t94 @t31))))
% 0.40/0.87  (assume @p234 (forall @t6 (= @t172 @t39)))
% 0.40/0.87  (assume @p235 (forall @t6 (and (not (and @t214 (forall @t59 (not @t213)))) (not (and (exists @t59 @t213) @t131)))))
% 0.40/0.87  (assume @p236 (forall @t11 (=> (tptp.subset @t1 tptp.empty_set) @t76)))
% 0.40/0.87  (assume @p237 (forall @t6 (= (tptp.set_difference @t23 @t2) @t111)))
% 0.40/0.87  (assume @p238 (forall @t11 (=> @t15 (= @t120 (forall @t71 (=> @t26 (=> @t3 (tptp.in @t215 @t1))))))))
% 0.40/0.87  (assume @p239 (forall @t11 (=> @t15 (and (not (and (not @t120) (forall @t71 (=> @t26 (not @t216))))) (not (and (exists @t71 (and @t26 @t216)) @t120))))))
% 0.40/0.87  (assume @p240 (forall @t6 (=> @t116 (forall @t59 (=> @t145 (= @t218 (tptp.subset @t2 @t217)))))))
% 0.40/0.87  (assume @p241 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (tptp.subset @t219 @t51))))))
% 0.40/0.87  (assume @p242 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (tptp.subset @t189 @t178))))))
% 0.40/0.87  (assume @p243 (forall @t6 (=> @t39 (= @t2 @t212))))
% 0.40/0.87  (assume @p244 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (=> (tptp.subset @t113 @t166) (= @t219 @t51)))))))
% 0.40/0.87  (assume @p245 (forall @t6 (=> @t135 (not (and @t87 (= @t133 tptp.empty_set))))))
% 0.40/0.87  (assume @p246 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (=> (tptp.subset @t51 @t178) (= (tptp.relation_rng @t149) @t113)))))))
% 0.40/0.87  (assume @p247 (forall @t6 (=> @t135 (=> @t87 (= (tptp.subset_difference @t1 @t105 @t141) (tptp.meet_of_subsets @t1 @t133))))))
% 0.40/0.87  (assume @p248 (forall @t6 (=> @t135 (=> @t87 (= (tptp.union_of_subsets @t1 @t133) (tptp.subset_difference @t1 @t105 @t143))))))
% 0.40/0.87  (assume @p249 (forall @t6 (= (tptp.set_difference @t1 @t111) @t24)))
% 0.40/0.87  (assume @p250 (forall @t11 (=> @t16 (forall @t71 (=> @t37 (forall @t59 (=> @t130 (=> @t128 (tptp.relation_isomorphism @t2 @t1 (tptp.function_inverse @t29))))))))))
% 0.40/0.87  (assume @p251 (forall @t11 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set)))
% 0.40/0.87  (assume @p252 (forall @t86 (=> (and @t5 @t220) (tptp.element @t1 @t29))))
% 0.40/0.87  (assume @p253 (forall @t6 (and (not (and @t214 (forall @t59 (not @t221)))) (not (and (exists @t59 @t221) @t131)))))
% 0.40/0.87  (assume @p254 (forall @t11 (=> @t79 (forall @t71 (=> @t116 (forall @t59 (=> (tptp.element @t29 @t1) (=> @t91 (tptp.in @t29 @t115)))))))))
% 0.40/0.87  (assume @p255 @t228)
% 0.40/0.87  (assume @p256 (forall @t11 (=> @t56 (=> @t17 (forall @t71 (=> @t159 (= (= @t2 @t137) (and (= @t166 @t113) (forall @t34 (and (=> @t229 @t112) (=> @t112 @t229)))))))))))
% 0.40/0.87  (assume @p257 (forall @t86 (=> @t145 (not (and (tptp.in @t2 @t217) @t94)))))
% 0.40/0.87  (assume @p258 @t237)
% 0.40/0.87  (assume @p259 (forall @t11 (=> @t56 (=> @t17 (and (= @t113 (tptp.relation_dom @t137)) (= @t51 (tptp.relation_rng @t137)))))))
% 0.40/0.87  (assume @p260 (forall @t11 (=> @t16 (=> (forall @t49 @t168) @t76))))
% 0.40/0.87  (assume @p261 (forall @t6 (=> @t159 (=> (and (tptp.one_to_one @t2) (tptp.in @t1 @t178)) (and (= @t1 (tptp.apply @t2 (tptp.apply @t238 @t1))) (= @t1 (tptp.apply (tptp.relation_composition @t238 @t2) @t1)))))))
% 0.40/0.87  (assume @p262 (forall @t86 (not (and @t5 @t220 (tptp.empty @t29)))))
% 0.40/0.87  (assume @p263 (forall @t11 (=> @t16 (= @t88 (tptp.is_well_founded_in @t1 @t60)))))
% 0.40/0.87  (assume @p264 (and (= (tptp.relation_dom tptp.empty_set) tptp.empty_set) (= (tptp.relation_rng tptp.empty_set) tptp.empty_set)))
% 0.40/0.87  (assume @p265 (forall @t6 (not (and @t39 @t7))))
% 0.40/0.87  (assume @p266 (forall @t11 (=> @t56 (=> @t17 (tptp.one_to_one @t137)))))
% 0.40/0.87  (assume @p267 (forall @t86 (=> (and @t39 @t218) (tptp.disjoint @t1 @t29))))
% 0.40/0.87  (assume @p268 (forall @t11 (=> @t16 (=> (or @t240 @t239) @t76))))
% 0.40/0.87  (assume @p269 (forall @t11 (=> @t16 (= @t240 @t239))))
% 0.40/0.87  (assume @p270 (forall @t6 (= (= (tptp.set_difference @t1 @t169) @t1) @t4)))
% 0.40/0.87  (assume @p271 (forall @t6 (=> @t159 (forall @t59 (=> @t130 (= (= @t2 @t173) (and (= @t166 (tptp.set_intersection2 @t127 @t1)) (forall @t54 (=> (tptp.in @t28 @t166) (= (tptp.apply @t2 @t28) @t124))))))))))
% 0.40/0.87  (assume @p272 (forall @t11 (= (tptp.unordered_pair @t1 @t1) @t69)))
% 0.40/0.87  (assume @p273 (forall @t11 (=> @t10 @t76)))
% 0.40/0.87  (assume @p274 (forall @t6 (=> (tptp.subset @t69 @t169) @t40)))
% 0.40/0.87  (assume @p275 (forall @t86 (=> @t130 (=> @t174 @t241))))
% 0.40/0.87  (assume @p276 (forall @t11 (and (= (tptp.relation_dom @t35) @t1) (= (tptp.relation_rng @t35) @t1))))
% 0.40/0.87  (assume @p277 (forall @t86 (=> @t130 (=> @t3 @t241))))
% 0.40/0.87  (assume @p278 (forall @t68 (=> (tptp.relation @t28) (= (tptp.in @t117 (tptp.relation_composition (tptp.identity_relation @t29) @t28)) (and @t171 (tptp.in @t117 @t28))))))
% 0.40/0.87  (assume @p279 (forall @t6 (not (and @t5 @t83))))
% 0.40/0.87  (assume @p280 (forall @t6 (not (and @t5 (forall @t59 (not (and @t72 (forall @t54 (not (and @t44 @t53))))))))))
% 0.40/0.87  (assume @p281 (forall @t6 (tptp.subset @t1 @t23)))
% 0.40/0.87  (assume @p282 (forall @t6 (= @t131 (= @t111 @t1))))
% 0.40/0.87  (assume @p283 (forall @t86 (=> @t48 (= (tptp.in @t1 (tptp.relation_dom @t183)) (and @t5 @t199)))))
% 0.40/0.87  (assume @p284 (forall @t6 (=> @t37 (tptp.subset @t193 @t2))))
% 0.40/0.87  (assume @p285 (forall @t6 (not (and @t10 @t136 @t83))))
% 0.40/0.87  (assume @p286 (forall @t86 (=> @t130 (= @t200 (and @t199 (= @t2 @t202))))))
% 0.40/0.87  (assume @p287 (forall @t11 (=> @t16 (= (tptp.well_orders @t1 @t60) @t108))))
% 0.40/0.87  (assume @p288 (forall @t86 (=> (and @t39 @t97) (tptp.subset (tptp.set_union2 @t1 @t29) @t2))))
% 0.40/0.87  (assume @p289 (forall @t86 (=> @t242 @t40)))
% 0.40/0.87  (assume @p290 (forall @t6 (=> @t37 (= (tptp.relation_dom @t193) @t187))))
% 0.40/0.87  (assume @p291 (forall @t6 (=> @t37 (= @t193 (tptp.relation_composition @t35 @t2)))))
% 0.40/0.87  (assume @p292 (forall @t6 (=> @t37 (tptp.subset (tptp.relation_rng @t193) @t178))))
% 0.40/0.87  (assume @p293 (forall @t11 (= (tptp.union @t81) @t1)))
% 0.40/0.87  (assume @p294 (forall @t11 (exists @t71 (and @t5 @t182 (forall @t59 (not (and @t72 (forall @t54 (not (and @t44 (forall @t52 (=> (tptp.subset @t41 @t29) @t67)))))))) @t180))))
% 0.40/0.87  (assume @p295 (forall @t86 (=> @t242 @t92)))
% 0.40/0.87  (step @p296 :rule bool-impl-elim :args (@t16 @t109))
% 0.40/0.87  (step @p297 :rule cong :premises (@p296) :args (@t110))
% 0.40/0.87  (step @p298 :rule eq_resolve :premises (@p51 @p297))
% 0.40/0.87  (step @p299 :rule instantiate :premises (@p298) :args ((@list @t255)))
% 0.40/0.87  (step @p300 :rule aci_norm :args ((= @t257 @t252)))
% 0.40/0.87  (step @p301 :rule cong :premises (@p300) :args (@t258))
% 0.40/0.87  (step @p302 :rule quant-merge-prenex :args ((= (forall @t11 @t260) @t258)))
% 0.40/0.87  (step @p303 :rule alpha_equiv :args (@t261 (@list @t244 @t243) (@list @t2 @t262)))
% 0.40/0.87  (step @p304 :rule refl :args (@t250))
% 0.40/0.87  (step @p305 :rule refl :args (@t251))
% 0.40/0.87  (step @p306 :rule nary_cong :premises (@p305 @p304 @p303) :args (@t263))
% 0.40/0.87  (step @p307 :rule quant-miniscope-or :args ((= @t260 @t263)))
% 0.40/0.87  (step @p308 :rule trans :premises (@p307 @p306))
% 0.40/0.87  (step @p309 :rule symm :premises (@p308))
% 0.40/0.87  (step @p310 :rule cong :premises (@p309) :args ((forall @t11 @t271)))
% 0.40/0.87  (step @p311 :rule trans :premises (@p310 @p302))
% 0.40/0.87  (step @p312 :rule trans :premises (@p311 @p301))
% 0.40/0.87  (step @p313 :rule aci_norm :args ((= (or @t251 @t272) @t271)))
% 0.40/0.87  (step @p314 :rule bool-impl-elim :args (@t16 @t272))
% 0.40/0.87  (step @p315 :rule trans :premises (@p314 @p313))
% 0.40/0.87  (step @p316 :rule cong :premises (@p315) :args ((forall @t11 (=> @t16 @t272))))
% 0.40/0.87  (step @p317 :rule trans :premises (@p316 @p312))
% 0.40/0.87  (step @p318 :rule aci_norm :args ((= @t274 @t268)))
% 0.40/0.87  (step @p319 :rule cong :premises (@p318) :args (@t275))
% 0.40/0.87  (step @p320 :rule quant-merge-prenex :args ((= (forall @t71 @t277) @t275)))
% 0.40/0.87  (step @p321 :rule alpha_equiv :args (@t278 (@list @t262) @t279))
% 0.40/0.87  (step @p322 :rule refl :args (@t210))
% 0.40/0.87  (step @p323 :rule refl :args (@t267))
% 0.40/0.87  (step @p324 :rule nary_cong :premises (@p323 @p322 @p321) :args (@t280))
% 0.40/0.87  (step @p325 :rule quant-miniscope-or :args ((= @t277 @t280)))
% 0.40/0.87  (step @p326 :rule trans :premises (@p325 @p324))
% 0.40/0.87  (step @p327 :rule symm :premises (@p326))
% 0.40/0.87  (step @p328 :rule cong :premises (@p327) :args (@t287))
% 0.40/0.87  (step @p329 :rule trans :premises (@p328 @p320))
% 0.40/0.87  (step @p330 :rule trans :premises (@p329 @p319))
% 0.40/0.87  (step @p331 :rule refl :args (@t250))
% 0.40/0.87  (step @p332 :rule nary_cong :premises (@p331 @p330) :args (@t288))
% 0.40/0.87  (step @p333 :rule quant-miniscope-or :args ((= (forall @t71 @t289) @t288)))
% 0.40/0.87  (step @p334 :rule aci_norm :args ((= @t290 @t289)))
% 0.40/0.87  (step @p335 :rule cong :premises (@p334) :args ((forall @t71 @t290)))
% 0.40/0.87  (step @p336 :rule trans :premises (@p335 @p333))
% 0.40/0.87  (step @p337 :rule trans :premises (@p336 @p332))
% 0.40/0.87  (step @p338 :rule aci_norm :args ((= (or @t267 @t291) @t290)))
% 0.40/0.87  (step @p339 :rule bool-impl-elim :args (@t37 @t291))
% 0.40/0.87  (step @p340 :rule trans :premises (@p339 @p338))
% 0.40/0.87  (step @p341 :rule cong :premises (@p340) :args ((forall @t71 (=> @t37 @t291))))
% 0.40/0.87  (step @p342 :rule trans :premises (@p341 @p337))
% 0.40/0.87  (step @p343 :rule quant-miniscope-or :args ((= (forall @t59 @t292) @t291)))
% 0.40/0.87  (step @p344 :rule aci_norm :args ((= @t293 @t292)))
% 0.40/0.87  (step @p345 :rule cong :premises (@p344) :args ((forall @t59 @t293)))
% 0.40/0.87  (step @p346 :rule trans :premises (@p345 @p343))
% 0.40/0.87  (step @p347 :rule aci_norm :args ((= (or @t295 @t294) @t293)))
% 0.40/0.87  (step @p348 :rule aci_norm :args ((= (or (or @t250 @t281) @t210) @t294)))
% 0.40/0.87  (step @p349 :rule bool-and-de-morgan :args (@t108 @t128 true))
% 0.40/0.87  (step @p350 :rule nary_cong :premises (@p349 @p322) :args ((or (not @t230) @t210)))
% 0.40/0.87  (step @p351 :rule trans :premises (@p350 @p348))
% 0.40/0.87  (step @p352 :rule bool-impl-elim :args (@t230 @t210))
% 0.40/0.87  (step @p353 :rule trans :premises (@p352 @p351))
% 0.40/0.87  (step @p354 :rule bool-and-de-morgan :args (@t48 @t129 true))
% 0.40/0.87  (step @p355 :rule nary_cong :premises (@p354 @p353) :args ((or @t296 @t231)))
% 0.40/0.87  (step @p356 :rule trans :premises (@p355 @p347))
% 0.40/0.87  (step @p357 :rule bool-impl-elim :args (@t130 @t231))
% 0.40/0.87  (step @p358 :rule trans :premises (@p357 @p356))
% 0.40/0.87  (step @p359 :rule cong :premises (@p358) :args (@t232))
% 0.40/0.87  (step @p360 :rule trans :premises (@p359 @p346))
% 0.40/0.87  (step @p361 :rule refl :args (@t37))
% 0.40/0.87  (step @p362 :rule cong :premises (@p361 @p360) :args (@t233))
% 0.40/0.87  (step @p363 :rule cong :premises (@p362) :args (@t234))
% 0.40/0.87  (step @p364 :rule trans :premises (@p363 @p342))
% 0.40/0.87  (step @p365 :rule refl :args (@t16))
% 0.40/0.87  (step @p366 :rule cong :premises (@p365 @p364) :args (@t235))
% 0.40/0.87  (step @p367 :rule cong :premises (@p366) :args (@t236))
% 0.40/0.87  (step @p368 :rule trans :premises (@p367 @p317))
% 0.40/0.87  (step @p369 :rule cong :premises (@p368) :args (@t237))
% 0.40/0.87  (step @p370 :rule eq_resolve :premises (@p258 @p369))
% 0.40/0.87  (step @p371 :rule skolemize :premises (@p370))
% 0.40/0.87  (step @p372 :rule bool-double-not-elim :args (@t297))
% 0.40/0.87  (step @p373 :rule refl :args (@t312))
% 0.40/0.87  (step @p374 :rule nary_cong :premises (@p373 @p372) :args ((or @t312 (not @t307))))
% 0.40/0.87  (step @p375 :rule cnf_or_neg :args (@t312 2))
% 0.40/0.87  (step @p376 :rule eq_resolve :premises (@p375 @p374))
% 0.40/0.87  (step @p377 :rule reordering :premises (@p376) :args ((or @t297 @t312)))
% 0.40/0.87  (step @p378 :rule chain_m_resolution :premises (@p377 @p371) :args (@t297 @t313 @t314))
% 0.40/0.87  (step @p379 :rule cnf_or_pos :args (@t322))
% 0.40/0.87  (step @p380 :rule reordering :premises (@p379) :args ((or @t307 @t321 (not @t322))))
% 0.40/0.87  (step @p381 :rule chain_m_resolution :premises (@p380 @p378 @p299) :args (@t321 @t323 (@list @t297 @t322)))
% 0.40/0.87  (step @p382 :rule cnf_or_neg :args (@t312 3))
% 0.40/0.87  (step @p383 :rule chain_m_resolution :premises (@p382 @p371) :args ((not @t306) @t313 @t314))
% 0.40/0.87  (step @p384 :rule cnf_equiv_pos2 :args (@t321))
% 0.40/0.87  (step @p385 :rule reordering :premises (@p384) :args ((or @t306 @t324 (not @t321))))
% 0.40/0.87  (step @p386 :rule chain_m_resolution :premises (@p385 @p383 @p381) :args (@t324 (@list true false) (@list @t306 @t321)))
% 0.40/0.87  (step @p387 :rule aci_norm :args ((= @t338 (or @t251 @t336 @t335 @t329 @t328 @t327))))
% 0.40/0.87  (step @p388 :rule cong :premises (@p387) :args (@t339))
% 0.40/0.87  (step @p389 :rule quant-merge-prenex :args ((= (forall @t11 @t341) @t339)))
% 0.40/0.87  (step @p390 :rule alpha_equiv :args (@t342 (@list @t326 @t325) (@list @t2 @t343)))
% 0.40/0.87  (step @p391 :rule nary_cong :premises (@p305 @p390) :args (@t344))
% 0.40/0.87  (step @p392 :rule quant-miniscope-or :args ((= @t341 @t344)))
% 0.40/0.87  (step @p393 :rule trans :premises (@p392 @p391))
% 0.40/0.87  (step @p394 :rule symm :premises (@p393))
% 0.40/0.87  (step @p395 :rule cong :premises (@p394) :args ((forall @t11 (or @t251 @t351))))
% 0.40/0.87  (step @p396 :rule trans :premises (@p395 @p389))
% 0.40/0.87  (step @p397 :rule trans :premises (@p396 @p388))
% 0.40/0.87  (step @p398 :rule bool-impl-elim :args (@t16 @t351))
% 0.40/0.87  (step @p399 :rule cong :premises (@p398) :args ((forall @t11 (=> @t16 @t351))))
% 0.40/0.87  (step @p400 :rule trans :premises (@p399 @p397))
% 0.40/0.87  (step @p401 :rule aci_norm :args ((= @t353 @t349)))
% 0.40/0.87  (step @p402 :rule cong :premises (@p401) :args (@t354))
% 0.40/0.87  (step @p403 :rule quant-merge-prenex :args ((= (forall @t71 @t356) @t354)))
% 0.40/0.87  (step @p404 :rule alpha_equiv :args (@t357 (@list @t343) @t279))
% 0.40/0.87  (step @p405 :rule refl :args (@t348))
% 0.40/0.87  (step @p406 :rule nary_cong :premises (@p323 @p405 @p404) :args (@t358))
% 0.40/0.87  (step @p407 :rule quant-miniscope-or :args ((= @t356 @t358)))
% 0.40/0.87  (step @p408 :rule trans :premises (@p407 @p406))
% 0.40/0.87  (step @p409 :rule symm :premises (@p408))
% 0.40/0.87  (step @p410 :rule cong :premises (@p409) :args ((forall @t71 @t359)))
% 0.40/0.87  (step @p411 :rule trans :premises (@p410 @p403))
% 0.40/0.87  (step @p412 :rule trans :premises (@p411 @p402))
% 0.40/0.87  (step @p413 :rule aci_norm :args ((= (or @t267 @t360) @t359)))
% 0.40/0.87  (step @p414 :rule bool-impl-elim :args (@t37 @t360))
% 0.40/0.87  (step @p415 :rule trans :premises (@p414 @p413))
% 0.40/0.87  (step @p416 :rule cong :premises (@p415) :args ((forall @t71 (=> @t37 @t360))))
% 0.40/0.87  (step @p417 :rule trans :premises (@p416 @p412))
% 0.40/0.87  (step @p418 :rule quant-miniscope-or :args ((= (forall @t59 @t361) @t360)))
% 0.40/0.87  (step @p419 :rule aci_norm :args ((= @t362 @t361)))
% 0.40/0.87  (step @p420 :rule cong :premises (@p419) :args ((forall @t59 @t362)))
% 0.40/0.87  (step @p421 :rule trans :premises (@p420 @p418))
% 0.40/0.87  (step @p422 :rule aci_norm :args ((= (or @t295 (or @t281 @t348)) @t362)))
% 0.40/0.87  (step @p423 :rule bool-impl-elim :args (@t88 @t209))
% 0.40/0.87  (step @p424 :rule bool-impl-elim :args (@t61 @t208))
% 0.40/0.87  (step @p425 :rule bool-impl-elim :args (@t65 @t206))
% 0.40/0.87  (step @p426 :rule bool-impl-elim :args (@t66 @t207))
% 0.40/0.87  (step @p427 :rule bool-impl-elim :args (@t107 @t205))
% 0.40/0.87  (step @p428 :rule nary_cong :premises (@p427 @p426 @p425 @p424 @p423) :args (@t222))
% 0.40/0.87  (step @p429 :rule refl :args (@t281))
% 0.40/0.87  (step @p430 :rule nary_cong :premises (@p429 @p428) :args ((or @t281 @t222)))
% 0.40/0.87  (step @p431 :rule bool-impl-elim :args (@t128 @t222))
% 0.40/0.87  (step @p432 :rule trans :premises (@p431 @p430))
% 0.40/0.87  (step @p433 :rule nary_cong :premises (@p354 @p432) :args ((or @t296 @t223)))
% 0.40/0.87  (step @p434 :rule trans :premises (@p433 @p422))
% 0.40/0.87  (step @p435 :rule bool-impl-elim :args (@t130 @t223))
% 0.40/0.87  (step @p436 :rule trans :premises (@p435 @p434))
% 0.40/0.87  (step @p437 :rule cong :premises (@p436) :args (@t224))
% 0.40/0.87  (step @p438 :rule trans :premises (@p437 @p421))
% 0.40/0.87  (step @p439 :rule cong :premises (@p361 @p438) :args (@t225))
% 0.40/0.87  (step @p440 :rule cong :premises (@p439) :args (@t226))
% 0.40/0.87  (step @p441 :rule trans :premises (@p440 @p417))
% 0.40/0.87  (step @p442 :rule cong :premises (@p365 @p441) :args (@t227))
% 0.40/0.87  (step @p443 :rule cong :premises (@p442) :args (@t228))
% 0.40/0.87  (step @p444 :rule trans :premises (@p443 @p400))
% 0.40/0.87  (step @p445 :rule eq_resolve :premises (@p255 @p444))
% 0.40/0.87  (step @p446 :rule instantiate :premises (@p445) :args ((@list @t299 @t255 @t298)))
% 0.40/0.87  (step @p447 :rule bool-double-not-elim :args (@t300))
% 0.40/0.87  (step @p448 :rule nary_cong :premises (@p373 @p447) :args ((or @t312 (not @t301))))
% 0.40/0.87  (step @p449 :rule cnf_or_neg :args (@t312 6))
% 0.40/0.87  (step @p450 :rule eq_resolve :premises (@p449 @p448))
% 0.40/0.87  (step @p451 :rule reordering :premises (@p450) :args ((or @t300 @t312)))
% 0.40/0.87  (step @p452 :rule chain_m_resolution :premises (@p451 @p371) :args (@t300 @t313 @t314))
% 0.40/0.87  (step @p453 :rule bool-double-not-elim :args (@t302))
% 0.40/0.87  (step @p454 :rule nary_cong :premises (@p373 @p453) :args ((or @t312 (not @t303))))
% 0.40/0.87  (step @p455 :rule cnf_or_neg :args (@t312 5))
% 0.40/0.87  (step @p456 :rule eq_resolve :premises (@p455 @p454))
% 0.40/0.87  (step @p457 :rule reordering :premises (@p456) :args ((or @t302 @t312)))
% 0.40/0.87  (step @p458 :rule chain_m_resolution :premises (@p457 @p371) :args (@t302 @t313 @t314))
% 0.40/0.87  (step @p459 :rule bool-double-not-elim :args (@t304))
% 0.40/0.87  (step @p460 :rule nary_cong :premises (@p373 @p459) :args ((or @t312 (not @t305))))
% 0.40/0.87  (step @p461 :rule cnf_or_neg :args (@t312 4))
% 0.40/0.87  (step @p462 :rule eq_resolve :premises (@p461 @p460))
% 0.40/0.87  (step @p463 :rule reordering :premises (@p462) :args ((or @t304 @t312)))
% 0.40/0.87  (step @p464 :rule chain_m_resolution :premises (@p463 @p371) :args (@t304 @t313 @t314))
% 0.40/0.87  (step @p465 :rule bool-double-not-elim :args (@t310))
% 0.40/0.87  (step @p466 :rule nary_cong :premises (@p373 @p465) :args ((or @t312 (not @t311))))
% 0.40/0.87  (step @p467 :rule cnf_or_neg :args (@t312 0))
% 0.40/0.87  (step @p468 :rule eq_resolve :premises (@p467 @p466))
% 0.40/0.87  (step @p469 :rule reordering :premises (@p468) :args ((or @t310 @t312)))
% 0.40/0.87  (step @p470 :rule chain_m_resolution :premises (@p469 @p371) :args (@t310 @t313 @t314))
% 0.40/0.87  (step @p471 :rule cnf_or_pos :args (@t379))
% 0.40/0.87  (step @p472 :rule reordering :premises (@p471) :args ((or @t311 @t307 @t305 @t303 @t301 @t378 (not @t379))))
% 0.40/0.87  (step @p473 :rule chain_m_resolution :premises (@p472 @p470 @p378 @p464 @p458 @p452 @p446) :args (@t378 (@list false false false false false false) (@list @t310 @t297 @t304 @t302 @t300 @t379)))
% 0.40/0.87  (step @p474 :rule cnf_and_pos :args (@t378 0))
% 0.40/0.87  (step @p475 :rule reordering :premises (@p474) :args ((or @t377 @t380)))
% 0.40/0.87  (step @p476 :rule chain_m_resolution :premises (@p475 @p473) :args (@t377 @t381 @t382))
% 0.40/0.87  (step @p477 :rule instantiate :premises (@p298) :args ((@list @t299)))
% 0.40/0.87  (step @p478 :rule cnf_or_pos :args (@t385))
% 0.40/0.87  (step @p479 :rule reordering :premises (@p478) :args ((or @t311 @t384 (not @t385))))
% 0.40/0.87  (step @p480 :rule chain_m_resolution :premises (@p479 @p470 @p477) :args (@t384 @t323 (@list @t310 @t385)))
% 0.40/0.87  (step @p481 :rule bool-double-not-elim :args (@t308))
% 0.40/0.87  (step @p482 :rule nary_cong :premises (@p373 @p481) :args ((or @t312 (not @t309))))
% 0.40/0.87  (step @p483 :rule cnf_or_neg :args (@t312 1))
% 0.40/0.87  (step @p484 :rule eq_resolve :premises (@p483 @p482))
% 0.40/0.87  (step @p485 :rule reordering :premises (@p484) :args ((or @t308 @t312)))
% 0.40/0.87  (step @p486 :rule chain_m_resolution :premises (@p485 @p371) :args (@t308 @t313 @t314))
% 0.40/0.87  (step @p487 :rule cnf_equiv_pos1 :args (@t384))
% 0.40/0.87  (step @p488 :rule reordering :premises (@p487) :args ((or @t309 @t383 (not @t384))))
% 0.40/0.87  (step @p489 :rule chain_m_resolution :premises (@p488 @p486 @p480) :args (@t383 @t323 (@list @t308 @t384)))
% 0.40/0.87  (step @p490 :rule cnf_and_pos :args (@t383 0))
% 0.40/0.87  (step @p491 :rule reordering :premises (@p490) :args ((or @t375 @t386)))
% 0.40/0.87  (step @p492 :rule chain_m_resolution :premises (@p491 @p489) :args (@t375 @t381 @t387))
% 0.40/0.87  (step @p493 :rule cnf_or_pos :args (@t377))
% 0.40/0.87  (step @p494 :rule reordering :premises (@p493) :args ((or @t319 @t376 (not @t377))))
% 0.40/0.87  (step @p495 :rule chain_m_resolution :premises (@p494 @p492 @p476) :args (@t319 @t323 (@list @t375 @t377)))
% 0.40/0.87  (step @p496 :rule cnf_and_pos :args (@t378 4))
% 0.40/0.87  (step @p497 :rule reordering :premises (@p496) :args ((or @t365 @t380)))
% 0.40/0.87  (step @p498 :rule chain_m_resolution :premises (@p497 @p473) :args (@t365 @t381 @t382))
% 0.40/0.87  (step @p499 :rule cnf_and_pos :args (@t383 4))
% 0.40/0.87  (step @p500 :rule reordering :premises (@p499) :args ((or @t363 @t386)))
% 0.40/0.87  (step @p501 :rule chain_m_resolution :premises (@p500 @p489) :args (@t363 @t381 @t387))
% 0.40/0.87  (step @p502 :rule cnf_or_pos :args (@t365))
% 0.40/0.87  (step @p503 :rule reordering :premises (@p502) :args ((or @t315 @t364 (not @t365))))
% 0.40/0.87  (step @p504 :rule chain_m_resolution :premises (@p503 @p501 @p498) :args (@t315 @t323 (@list @t363 @t365)))
% 0.40/0.87  (step @p505 :rule cnf_and_pos :args (@t378 1))
% 0.40/0.87  (step @p506 :rule reordering :premises (@p505) :args ((or @t374 @t380)))
% 0.40/0.87  (step @p507 :rule chain_m_resolution :premises (@p506 @p473) :args (@t374 @t381 @t382))
% 0.40/0.87  (step @p508 :rule cnf_and_pos :args (@t383 1))
% 0.40/0.87  (step @p509 :rule reordering :premises (@p508) :args ((or @t372 @t386)))
% 0.40/0.87  (step @p510 :rule chain_m_resolution :premises (@p509 @p489) :args (@t372 @t381 @t387))
% 0.40/0.87  (step @p511 :rule cnf_or_pos :args (@t374))
% 0.40/0.87  (step @p512 :rule reordering :premises (@p511) :args ((or @t318 @t373 (not @t374))))
% 0.40/0.87  (step @p513 :rule chain_m_resolution :premises (@p512 @p510 @p507) :args (@t318 @t323 (@list @t372 @t374)))
% 0.40/0.87  (step @p514 :rule cnf_and_pos :args (@t378 3))
% 0.40/0.87  (step @p515 :rule reordering :premises (@p514) :args ((or @t368 @t380)))
% 0.40/0.87  (step @p516 :rule chain_m_resolution :premises (@p515 @p473) :args (@t368 @t381 @t382))
% 0.40/0.87  (step @p517 :rule cnf_and_pos :args (@t383 2))
% 0.40/0.87  (step @p518 :rule reordering :premises (@p517) :args ((or @t366 @t386)))
% 0.40/0.87  (step @p519 :rule chain_m_resolution :premises (@p518 @p489) :args (@t366 @t381 @t387))
% 0.40/0.87  (step @p520 :rule cnf_or_pos :args (@t368))
% 0.40/0.87  (step @p521 :rule reordering :premises (@p520) :args ((or @t317 @t367 (not @t368))))
% 0.40/0.87  (step @p522 :rule chain_m_resolution :premises (@p521 @p519 @p516) :args (@t317 @t323 (@list @t366 @t368)))
% 0.40/0.87  (step @p523 :rule cnf_and_pos :args (@t378 2))
% 0.40/0.87  (step @p524 :rule reordering :premises (@p523) :args ((or @t371 @t380)))
% 0.40/0.87  (step @p525 :rule chain_m_resolution :premises (@p524 @p473) :args (@t371 @t381 @t382))
% 0.40/0.87  (step @p526 :rule cnf_and_pos :args (@t383 3))
% 0.40/0.87  (step @p527 :rule reordering :premises (@p526) :args ((or @t369 @t386)))
% 0.40/0.87  (step @p528 :rule chain_m_resolution :premises (@p527 @p489) :args (@t369 @t381 @t387))
% 0.40/0.87  (step @p529 :rule cnf_or_pos :args (@t371))
% 0.40/0.87  (step @p530 :rule reordering :premises (@p529) :args ((or @t316 @t370 (not @t371))))
% 0.40/0.87  (step @p531 :rule chain_m_resolution :premises (@p530 @p528 @p525) :args (@t316 @t323 (@list @t369 @t371)))
% 0.40/0.87  (step @p532 :rule cnf_and_neg :args (@t320))
% 0.40/0.87  (step @p533 :rule reordering :premises (@p532) :args ((or @t320 (not @t317) (not @t316) (not @t318) (not @t315) (not @t319))))
% 0.40/0.87  (step @p534 false :rule chain_m_resolution :premises (@p533 @p531 @p522 @p513 @p504 @p495 @p386) :args (false (@list false false false false false true) (@list @t316 @t317 @t318 @t315 @t319 @t320)))
% 0.40/0.87  )
% 0.40/0.87  % SZS output end Proof
% 0.40/0.87  % cvc5 exiting
%------------------------------------------------------------------------------