↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU188+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 : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Jun  3 08:50:53 AM UTC 2026

% Result   : Theorem 0.25s 0.48s
% Output   : Proof 0.25s
% Verified : 
% SZS Type : -

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