↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : KRS203+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n027.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:29:07 AM UTC 2026

% Result   : Theorem 206.37s 206.64s
% Output   : Proof 206.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS203+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.34  % Computer : n027.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Tue Jun  2 05:29:06 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.28/0.49  %----Proving TF0_NAR, FOF, or CNF
% 206.37/206.64  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 206.37/206.64  --- Run --no-e-matching --full-saturate-quant at 6...
% 206.37/206.64  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 6...
% 206.37/206.64  --- Run --finite-model-find --uf-ss=no-minimal at 6...
% 206.37/206.64  --- Run --multi-trigger-when-single --full-saturate-quant at 30...
% 206.37/206.64  --- Run --trigger-sel=max --full-saturate-quant at 15...
% 206.37/206.64  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 33...
% 206.37/206.64  --- Run --multi-trigger-cache --full-saturate-quant at 15...
% 206.37/206.64  --- Run --prenex-quant=none --full-saturate-quant at 30...
% 206.37/206.64  --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 15...
% 206.37/206.64  --- Run --relevant-triggers --full-saturate-quant at 30...
% 206.37/206.64  --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 15...
% 206.37/206.64  % SZS status Theorem
% 206.37/206.64  % SZS output start Proof
% 206.37/206.64  (
% 206.37/206.64  (declare-sort $$unsorted 0)
% 206.37/206.64  (declare-const tptp.xora (-> $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.nevera (-> $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.nota (-> $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.mighta (-> $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.noc $$unsorted)
% 206.37/206.64  (declare-const tptp.uns $$unsorted)
% 206.37/206.64  (declare-const tptp.not (-> $$unsorted $$unsorted))
% 206.37/206.64  (declare-const tptp.tca $$unsorted)
% 206.37/206.64  (declare-const tptp.sca $$unsorted)
% 206.37/206.64  (declare-const tptp.wth $$unsorted)
% 206.37/206.64  (declare-const tptp.unp $$unsorted)
% 206.37/206.64  (declare-const tptp.wca $$unsorted)
% 206.37/206.64  (declare-const tptp.wec $$unsorted)
% 206.37/206.64  (declare-const tptp.sap $$unsorted)
% 206.37/206.64  (declare-const tptp.wtc $$unsorted)
% 206.37/206.64  (declare-const tptp.model (-> $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.sat $$unsorted)
% 206.37/206.64  (declare-const tptp.cax $$unsorted)
% 206.37/206.64  (declare-const tptp.eqv $$unsorted)
% 206.37/206.64  (declare-const tptp.esa $$unsorted)
% 206.37/206.64  (declare-const tptp.csa $$unsorted)
% 206.37/206.64  (declare-const tptp.status (-> $$unsorted $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.thm $$unsorted)
% 206.37/206.64  (declare-const tptp.isa (-> $$unsorted $$unsorted Bool))
% 206.37/206.64  (declare-const tptp.eth $$unsorted)
% 206.37/206.64  (declare-const tptp.tac $$unsorted)
% 206.37/206.64  (declare-const tptp.tau $$unsorted)
% 206.37/206.64  (define @t1 () (@var "C" $$unsorted))
% 206.37/206.64  (define @t2 () (@var "Ax" $$unsorted))
% 206.37/206.64  (define @t3 () (@var "I2" $$unsorted))
% 206.37/206.64  (define @t4 () (tptp.model @t3 @t1))
% 206.37/206.64  (define @t5 () (@list @t3))
% 206.37/206.64  (define @t6 () (exists @t5 @t4))
% 206.37/206.64  (define @t7 () (@var "I1" $$unsorted))
% 206.37/206.64  (define @t8 () (tptp.model @t7 @t2))
% 206.37/206.64  (define @t9 () (@list @t7))
% 206.37/206.64  (define @t10 () (exists @t9 @t8))
% 206.37/206.64  (define @t11 () (not @t10))
% 206.37/206.64  (define @t12 () (@list @t2 @t1))
% 206.37/206.64  (define @t13 () (tptp.status @t2 @t1 tptp.sat))
% 206.37/206.64  (define @t14 () (tptp.model @t7 @t1))
% 206.37/206.64  (define @t15 () (and @t8 @t14))
% 206.37/206.64  (define @t16 () (exists @t9 @t15))
% 206.37/206.64  (define @t17 () (= @t16 @t13))
% 206.37/206.64  (define @t18 () (forall @t12 @t17))
% 206.37/206.64  (define @t19 () (tptp.status @t2 @t1 tptp.thm))
% 206.37/206.64  (define @t20 () (forall @t9 (=> @t8 @t14)))
% 206.37/206.64  (define @t21 () (= @t20 @t19))
% 206.37/206.64  (define @t22 () (forall @t12 @t21))
% 206.37/206.64  (define @t23 () (tptp.model @t3 @t2))
% 206.37/206.64  (define @t24 () (forall @t5 @t4))
% 206.37/206.64  (define @t25 () (@var "I3" $$unsorted))
% 206.37/206.64  (define @t26 () (tptp.model @t25 @t2))
% 206.37/206.64  (define @t27 () (not @t26))
% 206.37/206.64  (define @t28 () (tptp.model @t25 @t1))
% 206.37/206.64  (define @t29 () (@list @t25))
% 206.37/206.64  (define @t30 () (exists @t29 (and @t28 @t27)))
% 206.37/206.64  (define @t31 () (forall @t5 (=> @t23 @t4)))
% 206.37/206.64  (define @t32 () (not @t23))
% 206.37/206.64  (define @t33 () (exists @t5 @t32))
% 206.37/206.64  (define @t34 () (@var "I4" $$unsorted))
% 206.37/206.64  (define @t35 () (tptp.model @t34 @t1))
% 206.37/206.64  (define @t36 () (not @t35))
% 206.37/206.64  (define @t37 () (@list @t34))
% 206.37/206.64  (define @t38 () (exists @t37 @t36))
% 206.37/206.64  (define @t39 () (not @t28))
% 206.37/206.64  (define @t40 () (tptp.not @t1))
% 206.37/206.64  (define @t41 () (tptp.model @t3 @t40))
% 206.37/206.64  (define @t42 () (@var "S2" $$unsorted))
% 206.37/206.64  (define @t43 () (@var "S1" $$unsorted))
% 206.37/206.64  (define @t44 () (tptp.status @t2 @t1 @t42))
% 206.37/206.64  (define @t45 () (tptp.status @t2 @t1 @t43))
% 206.37/206.64  (define @t46 () (@list @t43 @t42))
% 206.37/206.64  (define @t47 () (tptp.nota @t43 @t42))
% 206.37/206.64  (define @t48 () (not @t44))
% 206.37/206.64  (define @t49 () (and @t45 @t48))
% 206.37/206.64  (define @t50 () (exists @t12 @t49))
% 206.37/206.64  (define @t51 () (= @t50 @t47))
% 206.37/206.64  (define @t52 () (forall @t46 @t51))
% 206.37/206.64  (define @t53 () (@var "F" $$unsorted))
% 206.37/206.64  (define @t54 () (@var "I" $$unsorted))
% 206.37/206.64  (define @t55 () (tptp.model @t54 (tptp.not @t53)))
% 206.37/206.64  (define @t56 () (tptp.model @t54 @t53))
% 206.37/206.64  (define @t57 () (@list @t54 @t53))
% 206.37/206.64  (define @t58 () (@list @t54))
% 206.37/206.64  (define @t59 () (forall @t58 @t56))
% 206.37/206.64  (define @t60 () (@list @t53))
% 206.37/206.64  (define @t61 () (exists @t60 @t59))
% 206.37/206.64  (define @t62 () (and @t27 @t28))
% 206.37/206.64  (define @t63 () (exists @t29 @t62))
% 206.37/206.64  (define @t64 () (and @t10 @t31 @t63 @t38))
% 206.37/206.64  (define @t65 () (exists @t12 @t64))
% 206.37/206.64  (define @t66 () (not @t14))
% 206.37/206.64  (define @t67 () (not (tptp.nota tptp.sat tptp.thm)))
% 206.37/206.64  (define @t68 () (@var "b_I1" it_8_$$unsorted))
% 206.37/206.64  (define @t69 () (@const 0 (-> it_8_$$unsorted $$unsorted Bool)))
% 206.37/206.64  (define @t70 () (@list @t68))
% 206.37/206.64  (define @t71 () (@const 1 it_7_$$unsorted))
% 206.37/206.64  (define @t72 () (@const 2 (-> $$unsorted $$unsorted it_7_$$unsorted Bool)))
% 206.37/206.64  (define @t73 () (_ @t72 @t2 @t1 @t71))
% 206.37/206.64  (define @t74 () (not @t8))
% 206.37/206.64  (define @t75 () (forall @t9 (or @t74 @t14)))
% 206.37/206.64  (define @t76 () (@var "b_BOUND_VARIABLE_7929" it_8_$$unsorted))
% 206.37/206.64  (define @t77 () (@var "b_BOUND_VARIABLE_7935" it_8_$$unsorted))
% 206.37/206.64  (define @t78 () (@var "b_I2" it_8_$$unsorted))
% 206.37/206.64  (define @t79 () (@list @t78))
% 206.37/206.64  (define @t80 () (@var "b_BOUND_VARIABLE_7925" it_8_$$unsorted))
% 206.37/206.64  (define @t81 () (forall (@list @t2 @t1 @t80 @t76 @t77) (or (not (_ @t69 @t80 @t2)) (not (forall @t79 (or (not (_ @t69 @t78 @t2)) (_ @t69 @t78 @t1)))) (_ @t69 @t77 @t1) (_ @t69 @t76 @t2) (not (_ @t69 @t76 @t1)))))
% 206.37/206.64  (define @t82 () (@quantifiers_skolemize @t81 1))
% 206.37/206.64  (define @t83 () (@var "b_I" it_8_$$unsorted))
% 206.37/206.64  (define @t84 () (@list @t83))
% 206.37/206.64  (define @t85 () (forall @t60 (not (forall @t84 (_ @t69 @t83 @t53)))))
% 206.37/206.64  (define @t86 () (@quantifiers_skolemize @t85 0))
% 206.37/206.64  (define @t87 () (@list @t86 @t82))
% 206.37/206.64  (define @t88 () (@var "b_S2" it_7_$$unsorted))
% 206.37/206.64  (define @t89 () (@var "b_S1" it_7_$$unsorted))
% 206.37/206.64  (define @t90 () (@const 3 (-> it_7_$$unsorted it_7_$$unsorted Bool)))
% 206.37/206.64  (define @t91 () (not @t45))
% 206.37/206.64  (define @t92 () (not (forall @t12 (or @t91 @t44))))
% 206.37/206.64  (define @t93 () (forall @t12 (not @t49)))
% 206.37/206.64  (define @t94 () (not @t93))
% 206.37/206.64  (define @t95 () (@const 4 it_7_$$unsorted))
% 206.37/206.64  (define @t96 () (_ @t90 @t95 @t71))
% 206.37/206.64  (define @t97 () (_ @t72 @t2 @t1 @t95))
% 206.37/206.64  (define @t98 () (forall @t12 (or (not @t97) @t73)))
% 206.37/206.64  (define @t99 () (not @t98))
% 206.37/206.64  (define @t100 () (= @t96 @t99))
% 206.37/206.64  (define @t101 () (not @t100))
% 206.37/206.64  (define @t102 () (@list true false))
% 206.37/206.64  (define @t103 () (@var "b_I1" it_8_$$unsorted))
% 206.37/206.64  (define @t104 () (@list @t103))
% 206.37/206.64  (define @t105 () (not (forall @t9 (or @t74 @t66))))
% 206.37/206.64  (define @t106 () (forall @t9 (not @t15)))
% 206.37/206.64  (define @t107 () (not @t106))
% 206.37/206.64  (define @t108 () (not @t85))
% 206.37/206.64  (define @t109 () (not (forall @t60 (not @t59))))
% 206.37/206.64  (define @t110 () (forall @t84 (_ @t69 @t83 @t86)))
% 206.37/206.64  (define @t111 () (not (not @t110)))
% 206.37/206.64  (define @t112 () (@list true))
% 206.37/206.64  (define @t113 () (@quantifiers_skolemize @t81 3))
% 206.37/206.64  (define @t114 () (@list @t113))
% 206.37/206.64  (define @t115 () (@var "BOUND_VARIABLE_7929" $$unsorted))
% 206.37/206.64  (define @t116 () (not (tptp.model @t115 @t1)))
% 206.37/206.64  (define @t117 () (tptp.model @t115 @t2))
% 206.37/206.64  (define @t118 () (@var "BOUND_VARIABLE_7935" $$unsorted))
% 206.37/206.64  (define @t119 () (tptp.model @t118 @t1))
% 206.37/206.64  (define @t120 () (forall @t5 (or @t32 @t4)))
% 206.37/206.64  (define @t121 () (not @t120))
% 206.37/206.64  (define @t122 () (@var "BOUND_VARIABLE_7925" $$unsorted))
% 206.37/206.64  (define @t123 () (not (tptp.model @t122 @t2)))
% 206.37/206.64  (define @t124 () (or @t123 @t121 @t119 @t117 @t116))
% 206.37/206.64  (define @t125 () (@list @t2 @t1 @t122 @t115 @t118))
% 206.37/206.64  (define @t126 () (or @t117 @t116))
% 206.37/206.64  (define @t127 () (or @t123 @t121 @t126 @t119))
% 206.37/206.64  (define @t128 () (forall @t125 @t127))
% 206.37/206.64  (define @t129 () (forall (@list @t122 @t115 @t118) @t127))
% 206.37/206.64  (define @t130 () (forall (@list @t118) @t119))
% 206.37/206.64  (define @t131 () (forall (@list @t115) @t126))
% 206.37/206.64  (define @t132 () (forall (@list @t122) @t123))
% 206.37/206.64  (define @t133 () (or @t132 @t121 @t131 @t130))
% 206.37/206.64  (define @t134 () (forall @t37 @t35))
% 206.37/206.64  (define @t135 () (forall @t29 (or @t26 @t39)))
% 206.37/206.64  (define @t136 () (forall @t9 @t74))
% 206.37/206.64  (define @t137 () (not @t134))
% 206.37/206.64  (define @t138 () (not @t137))
% 206.37/206.64  (define @t139 () (not @t135))
% 206.37/206.64  (define @t140 () (not @t139))
% 206.37/206.64  (define @t141 () (not @t136))
% 206.37/206.64  (define @t142 () (not @t141))
% 206.37/206.64  (define @t143 () (or @t142 @t121 @t140 @t138))
% 206.37/206.64  (define @t144 () (and @t141 @t120 @t139 @t137))
% 206.37/206.64  (define @t145 () (forall @t12 (not @t144)))
% 206.37/206.64  (define @t146 () (not @t145))
% 206.37/206.64  (define @t147 () (forall @t37 (not @t36)))
% 206.37/206.64  (define @t148 () (not @t147))
% 206.37/206.64  (define @t149 () (forall @t29 (not @t62)))
% 206.37/206.64  (define @t150 () (not @t149))
% 206.37/206.64  (define @t151 () (_ @t69 @t113 @t82))
% 206.37/206.64  (define @t152 () (not @t151))
% 206.37/206.64  (define @t153 () (@quantifiers_skolemize @t81 0))
% 206.37/206.64  (define @t154 () (@quantifiers_skolemize @t81 4))
% 206.37/206.64  (define @t155 () (_ @t69 @t154 @t82))
% 206.37/206.64  (define @t156 () (or (not (_ @t69 (@quantifiers_skolemize @t81 2) @t153)) (not (forall @t79 (or (not (_ @t69 @t78 @t153)) (_ @t69 @t78 @t82)))) @t155 (_ @t69 @t113 @t153) @t152))
% 206.37/206.64  (define @t157 () (@list @t156))
% 206.37/206.64  (define @t158 () (_ @t69 @t113 @t86))
% 206.37/206.64  (define @t159 () (not @t158))
% 206.37/206.64  (define @t160 () (or @t152 @t159))
% 206.37/206.64  (define @t161 () (not @t160))
% 206.37/206.64  (define @t162 () (@list false false))
% 206.37/206.64  (define @t163 () (not (_ @t69 @t103 @t86)))
% 206.37/206.64  (define @t164 () (not (_ @t69 @t103 @t82)))
% 206.37/206.64  (define @t165 () (or @t164 @t163))
% 206.37/206.64  (define @t166 () (forall @t104 @t165))
% 206.37/206.64  (define @t167 () (or @t163 @t164))
% 206.37/206.64  (define @t168 () (forall @t104 @t167))
% 206.37/206.64  (define @t169 () (not @t168))
% 206.37/206.64  (define @t170 () (_ @t72 @t86 @t82 @t95))
% 206.37/206.64  (define @t171 () (= @t170 @t169))
% 206.37/206.64  (define @t172 () (not @t171))
% 206.37/206.64  (define @t173 () (_ @t72 @t86 @t82 @t71))
% 206.37/206.64  (define @t174 () (not @t170))
% 206.37/206.64  (define @t175 () (or @t174 @t173))
% 206.37/206.64  (define @t176 () (forall @t70 (or (not (_ @t69 @t68 @t86)) (_ @t69 @t68 @t82))))
% 206.37/206.64  (define @t177 () (= @t173 @t176))
% 206.37/206.64  (define @t178 () (@list @t154))
% 206.37/206.64  (define @t179 () (_ @t69 @t154 @t86))
% 206.37/206.64  (define @t180 () (not @t179))
% 206.37/206.64  (define @t181 () (or @t180 @t155))
% 206.37/206.64  (define @t182 () (not @t181))
% 206.37/206.64  (assume @p1 (forall @t12 (= (=> @t11 (not @t6)) (tptp.status @t2 @t1 tptp.unp))))
% 206.37/206.64  (assume @p2 (forall @t12 (= (=> @t10 @t6) (tptp.status @t2 @t1 tptp.sap))))
% 206.37/206.64  (assume @p3 (forall @t12 (= (= @t10 @t6) (tptp.status @t2 @t1 tptp.esa))))
% 206.37/206.64  (assume @p4 @t18)
% 206.37/206.64  (assume @p5 @t22)
% 206.37/206.64  (assume @p6 (forall @t12 (= (and @t10 (forall @t5 (= @t23 @t4))) (tptp.status @t2 @t1 tptp.eqv))))
% 206.37/206.64  (assume @p7 (forall @t12 (= (and @t10 @t24) (tptp.status @t2 @t1 tptp.tac))))
% 206.37/206.64  (assume @p8 (forall @t12 (= (and @t10 @t31 @t30) (tptp.status @t2 @t1 tptp.wec))))
% 206.37/206.64  (assume @p9 (forall @t12 (= (and @t10 @t33 (forall @t29 (= @t26 @t28))) (tptp.status @t2 @t1 tptp.eth))))
% 206.37/206.64  (assume @p10 (forall @t12 (= (forall @t9 @t15) (tptp.status @t2 @t1 tptp.tau))))
% 206.37/206.64  (assume @p11 (forall @t12 (= (and @t10 @t33 (forall @t29 @t28)) (tptp.status @t2 @t1 tptp.wtc))))
% 206.37/206.64  (assume @p12 (forall @t12 (= (and @t10 @t31 @t30 @t38) (tptp.status @t2 @t1 tptp.wth))))
% 206.37/206.64  (assume @p13 (forall @t12 (= @t11 (tptp.status @t2 @t1 tptp.cax))))
% 206.37/206.64  (assume @p14 (forall @t12 (= (and @t11 @t6) (tptp.status @t2 @t1 tptp.sca))))
% 206.37/206.64  (assume @p15 (forall @t12 (= (and @t11 @t24) (tptp.status @t2 @t1 tptp.tca))))
% 206.37/206.64  (assume @p16 (forall @t12 (= (and @t11 @t6 (exists @t29 @t39)) (tptp.status @t2 @t1 tptp.wca))))
% 206.37/206.64  (assume @p17 (forall @t12 (= (exists @t9 (and @t8 (tptp.model @t7 @t40))) (tptp.status @t2 @t1 tptp.csa))))
% 206.37/206.64  (assume @p18 (forall @t12 (= (and (forall @t9 @t8) (forall @t5 @t41)) (tptp.status @t2 @t1 tptp.uns))))
% 206.37/206.64  (assume @p19 (forall @t12 (= (and @t16 (exists @t5 (and @t23 @t41))) (tptp.status @t2 @t1 tptp.noc))))
% 206.37/206.64  (assume @p20 (forall @t46 (= (exists @t12 (and @t45 @t44)) (tptp.mighta @t43 @t42))))
% 206.37/206.64  (assume @p21 (forall @t46 (= (forall @t12 (=> @t45 @t44)) (tptp.isa @t43 @t42))))
% 206.37/206.64  (assume @p22 @t52)
% 206.37/206.64  (assume @p23 (forall @t46 (= (forall @t12 (=> @t45 @t48)) (tptp.nevera @t43 @t42))))
% 206.37/206.64  (assume @p24 (forall @t46 (= (forall @t12 (xor @t45 @t44)) (tptp.xora @t43 @t42))))
% 206.37/206.64  (assume @p25 (forall @t57 (xor @t56 @t55)))
% 206.37/206.64  (assume @p26 (forall @t57 (= @t56 (not @t55))))
% 206.37/206.64  (assume @p27 @t61)
% 206.37/206.64  (assume @p28 (exists @t60 (and (exists @t9 (tptp.model @t7 @t53)) (exists @t5 (not (tptp.model @t3 @t53))))))
% 206.37/206.64  (assume @p29 (exists @t60 (forall @t58 (not @t56))))
% 206.37/206.64  (assume @p30 (exists @t12 (and @t16 (exists @t5 (or @t32 (not @t4))))))
% 206.37/206.64  (assume @p31 @t65)
% 206.37/206.64  (assume @p32 (exists (@list @t7 @t2 @t1) (and @t8 @t66 @t6)))
% 206.37/206.64  (assume @p33 @t67)
% 206.37/206.64  (assume @p34 true)
% 206.37/206.64  ; WARNING: add trust step for TRUST
% 206.37/206.64  ; trust TRUST PREPROCESS_SORT_INFER
% 206.37/206.64  (step @p35 :rule trust :premises () :args ((= (forall @t12 (= @t19 @t75)) (forall @t12 (= @t73 (forall @t70 (or (not (_ @t69 @t68 @t2)) (_ @t69 @t68 @t1))))))))
% 206.37/206.64  (step @p36 :rule eq-symm :args (@t75 @t19))
% 206.37/206.64  (step @p37 :rule refl :args (@t19))
% 206.37/206.64  (step @p38 :rule bool-impl-elim :args (@t8 @t14))
% 206.37/206.64  (step @p39 :rule cong :premises (@p38) :args (@t20))
% 206.37/206.64  (step @p40 :rule cong :premises (@p39 @p37) :args (@t21))
% 206.37/206.64  (step @p41 :rule trans :premises (@p40 @p36))
% 206.37/206.64  (step @p42 :rule cong :premises (@p41) :args (@t22))
% 206.37/206.64  (step @p43 :rule trans :premises (@p42 @p35))
% 206.37/206.64  (step @p44 :rule eq_resolve :premises (@p5 @p43))
% 206.37/206.64  (step @p45 :rule instantiate :premises (@p44) :args (@t87))
% 206.37/206.64  ; trust TRUST PREPROCESS_SORT_INFER
% 206.37/206.64  (step @p46 :rule trust :premises () :args ((= (forall @t46 (= @t47 @t92)) (forall (@list @t89 @t88) (= (_ @t90 @t89 @t88) (not (forall @t12 (or (not (_ @t72 @t2 @t1 @t89)) (_ @t72 @t2 @t1 @t88)))))))))
% 206.37/206.64  (step @p47 :rule eq-symm :args (@t92 @t47))
% 206.37/206.64  (step @p48 :rule refl :args (@t47))
% 206.37/206.64  (step @p49 :rule bool-double-not-elim :args (@t44))
% 206.37/206.64  (step @p50 :rule refl :args (@t91))
% 206.37/206.64  (step @p51 :rule nary_cong :premises (@p50 @p49) :args ((or @t91 (not @t48))))
% 206.37/206.64  (step @p52 :rule bool-and-de-morgan :args (@t45 @t48 true))
% 206.37/206.64  (step @p53 :rule trans :premises (@p52 @p51))
% 206.37/206.64  (step @p54 :rule cong :premises (@p53) :args (@t93))
% 206.37/206.64  (step @p55 :rule cong :premises (@p54) :args (@t94))
% 206.37/206.64  (step @p56 :rule exists-elim :args ((= @t50 @t94)))
% 206.37/206.64  (step @p57 :rule trans :premises (@p56 @p55))
% 206.37/206.64  (step @p58 :rule cong :premises (@p57 @p48) :args (@t51))
% 206.37/206.64  (step @p59 :rule trans :premises (@p58 @p47))
% 206.37/206.64  (step @p60 :rule cong :premises (@p59) :args (@t52))
% 206.37/206.64  (step @p61 :rule trans :premises (@p60 @p46))
% 206.37/206.64  (step @p62 :rule eq_resolve :premises (@p22 @p61))
% 206.37/206.64  (step @p63 :rule instantiate :premises (@p62) :args ((@list @t95 @t71)))
% 206.37/206.64  ; trust TRUST PREPROCESS_SORT_INFER
% 206.37/206.64  (step @p64 :rule trust :premises () :args ((= @t67 (not @t96))))
% 206.37/206.64  (step @p65 :rule eq_resolve :premises (@p33 @p64))
% 206.37/206.64  (step @p66 :rule bool-double-not-elim :args (@t98))
% 206.37/206.64  (step @p67 :rule refl :args (@t96))
% 206.37/206.64  (step @p68 :rule refl :args (@t101))
% 206.37/206.64  (step @p69 :rule nary_cong :premises (@p68 @p67 @p66) :args ((or @t101 @t96 (not @t99))))
% 206.37/206.64  (step @p70 :rule cnf_equiv_pos2 :args (@t100))
% 206.37/206.64  (step @p71 :rule eq_resolve :premises (@p70 @p69))
% 206.37/206.64  (step @p72 :rule reordering :premises (@p71) :args ((or @t96 @t98 @t101)))
% 206.37/206.64  (step @p73 :rule chain_m_resolution :premises (@p72 @p65 @p63) :args (@t98 @t102 (@list @t96 @t100)))
% 206.37/206.64  (step @p74 :rule instantiate :premises (@p73) :args (@t87))
% 206.37/206.64  ; trust TRUST PREPROCESS_SORT_INFER
% 206.37/206.64  (step @p75 :rule trust :premises () :args ((= (forall @t12 (= @t13 @t105)) (forall @t12 (= @t97 (not (forall @t104 (or (not (_ @t69 @t103 @t2)) (not (_ @t69 @t103 @t1))))))))))
% 206.37/206.64  (step @p76 :rule eq-symm :args (@t105 @t13))
% 206.37/206.64  (step @p77 :rule refl :args (@t13))
% 206.37/206.64  (step @p78 :rule bool-and-de-morgan :args (@t8 @t14 true))
% 206.37/206.64  (step @p79 :rule cong :premises (@p78) :args (@t106))
% 206.37/206.64  (step @p80 :rule cong :premises (@p79) :args (@t107))
% 206.37/206.64  (step @p81 :rule exists-elim :args ((= @t16 @t107)))
% 206.37/206.64  (step @p82 :rule trans :premises (@p81 @p80))
% 206.37/206.64  (step @p83 :rule cong :premises (@p82 @p77) :args (@t17))
% 206.37/206.64  (step @p84 :rule trans :premises (@p83 @p76))
% 206.37/206.64  (step @p85 :rule cong :premises (@p84) :args (@t18))
% 206.37/206.64  (step @p86 :rule trans :premises (@p85 @p75))
% 206.37/206.64  (step @p87 :rule eq_resolve :premises (@p4 @p86))
% 206.37/206.64  (step @p88 :rule instantiate :premises (@p87) :args (@t87))
% 206.37/206.64  ; trust TRUST PREPROCESS_SORT_INFER
% 206.37/206.64  (step @p89 :rule trust :premises () :args ((= @t109 @t108)))
% 206.37/206.64  (step @p90 :rule exists-elim :args ((= @t61 @t109)))
% 206.37/206.64  (step @p91 :rule trans :premises (@p90 @p89))
% 206.37/206.64  (step @p92 :rule eq_resolve :premises (@p27 @p91))
% 206.37/206.64  (step @p93 :rule refl :args (@t110))
% 206.37/206.64  (step @p94 :rule bool-double-not-elim :args (@t85))
% 206.37/206.64  (step @p95 :rule nary_cong :premises (@p94 @p93) :args ((or (not @t108) @t110)))
% 206.37/206.64  (step @p96 :rule bool-double-not-elim :args (@t110))
% 206.37/206.64  (step @p97 :rule refl :args (@t108))
% 206.37/206.64  (step @p98 :rule cong :premises (@p97 @p96) :args ((=> @t108 @t111)))
% 206.37/206.64  (assume-push @p216 @t108)
% 206.37/206.64  (step @p100 :rule skolemize :premises (@p92))
% 206.37/206.64  (step-pop @p217 :rule scope :premises (@p100))
% 206.37/206.64  (step @p101 :rule process_scope :premises (@p217) :args (@t111))
% 206.37/206.64  (step @p103 :rule eq_resolve :premises (@p101 @p98))
% 206.37/206.64  (step @p104 :rule implies_elim :premises (@p103))
% 206.37/206.64  (step @p105 :rule eq_resolve :premises (@p104 @p95))
% 206.37/206.64  (step @p106 :rule chain_m_resolution :premises (@p105 @p92) :args (@t110 @t112 (@list @t85)))
% 206.37/206.64  (step @p107 :rule instantiate :premises (@p106) :args (@t114))
% 206.37/206.64  ; trust TRUST PREPROCESS_SORT_INFER
% 206.37/206.64  (step @p108 :rule trust :premises () :args ((= (not (forall @t125 @t124)) (not @t81))))
% 206.37/206.64  (step @p109 :rule aci_norm :args ((= @t127 @t124)))
% 206.37/206.64  (step @p110 :rule cong :premises (@p109) :args (@t128))
% 206.37/206.64  (step @p111 :rule quant-merge-prenex :args ((= (forall @t12 @t129) @t128)))
% 206.37/206.64  (step @p112 :rule alpha_equiv :args (@t130 (@list @t118) (@list @t34)))
% 206.37/206.64  (step @p113 :rule alpha_equiv :args (@t131 (@list @t115) (@list @t25)))
% 206.37/206.64  (step @p114 :rule refl :args (@t121))
% 206.37/206.64  (step @p115 :rule alpha_equiv :args (@t132 (@list @t122) (@list @t7)))
% 206.37/206.64  (step @p116 :rule nary_cong :premises (@p115 @p114 @p113 @p112) :args (@t133))
% 206.37/206.64  (step @p117 :rule quant-miniscope-or :args ((= @t129 @t133)))
% 206.37/206.64  (step @p118 :rule trans :premises (@p117 @p116))
% 206.37/206.64  (step @p119 :rule symm :premises (@p118))
% 206.37/206.64  (step @p120 :rule cong :premises (@p119) :args ((forall @t12 (or @t136 @t121 @t135 @t134))))
% 206.37/206.64  (step @p121 :rule trans :premises (@p120 @p111))
% 206.37/206.64  (step @p122 :rule trans :premises (@p121 @p110))
% 206.37/206.64  (step @p123 :rule bool-double-not-elim :args (@t134))
% 206.37/206.64  (step @p124 :rule bool-double-not-elim :args (@t135))
% 206.37/206.64  (step @p125 :rule bool-double-not-elim :args (@t136))
% 206.37/206.64  (step @p126 :rule nary_cong :premises (@p125 @p114 @p124 @p123) :args (@t143))
% 206.37/206.64  (step @p127 :rule aci_norm :args ((= (or @t142 (or @t121 (or @t140 @t138))) @t143)))
% 206.37/206.64  (step @p128 :rule trans :premises (@p127 @p126))
% 206.37/206.64  (step @p129 :rule bool-and-de-morgan :args (@t139 @t137 true))
% 206.37/206.64  (step @p130 :rule nary_cong :premises (@p114 @p129) :args ((or @t121 (not (and @t139 @t137)))))
% 206.37/206.64  (step @p131 :rule bool-and-de-morgan :args (@t120 @t139 (and @t137)))
% 206.37/206.64  (step @p132 :rule trans :premises (@p131 @p130))
% 206.37/206.64  (step @p133 :rule refl :args (@t142))
% 206.37/206.64  (step @p134 :rule nary_cong :premises (@p133 @p132) :args ((or @t142 (not (and @t120 @t139 @t137)))))
% 206.37/206.64  (step @p135 :rule bool-and-de-morgan :args (@t141 @t120 (and @t139 @t137)))
% 206.37/206.64  (step @p136 :rule trans :premises (@p135 @p134))
% 206.37/206.64  (step @p137 :rule trans :premises (@p136 @p128))
% 206.37/206.64  (step @p138 :rule cong :premises (@p137) :args (@t145))
% 206.37/206.64  (step @p139 :rule trans :premises (@p138 @p122))
% 206.37/206.64  (step @p140 :rule cong :premises (@p139) :args (@t146))
% 206.37/206.64  (step @p141 :rule exists-elim :args ((= (exists @t12 @t144) @t146)))
% 206.37/206.64  (step @p142 :rule trans :premises (@p141 @p140))
% 206.37/206.64  (step @p143 :rule bool-double-not-elim :args (@t35))
% 206.37/206.64  (step @p144 :rule cong :premises (@p143) :args (@t147))
% 206.37/206.64  (step @p145 :rule cong :premises (@p144) :args (@t148))
% 206.37/206.64  (step @p146 :rule exists-elim :args ((= @t38 @t148)))
% 206.37/206.64  (step @p147 :rule trans :premises (@p146 @p145))
% 206.37/206.64  (step @p148 :rule refl :args (@t39))
% 206.37/206.64  (step @p149 :rule bool-double-not-elim :args (@t26))
% 206.37/206.64  (step @p150 :rule nary_cong :premises (@p149 @p148) :args ((or (not @t27) @t39)))
% 206.37/206.64  (step @p151 :rule bool-and-de-morgan :args (@t27 @t28 true))
% 206.37/206.64  (step @p152 :rule trans :premises (@p151 @p150))
% 206.37/206.64  (step @p153 :rule cong :premises (@p152) :args (@t149))
% 206.37/206.64  (step @p154 :rule cong :premises (@p153) :args (@t150))
% 206.37/206.64  (step @p155 :rule exists-elim :args ((= @t63 @t150)))
% 206.37/206.64  (step @p156 :rule trans :premises (@p155 @p154))
% 206.37/206.64  (step @p157 :rule bool-impl-elim :args (@t23 @t4))
% 206.37/206.64  (step @p158 :rule cong :premises (@p157) :args (@t31))
% 206.37/206.64  (step @p159 :rule exists-elim :args ((= @t10 @t141)))
% 206.37/206.64  (step @p160 :rule nary_cong :premises (@p159 @p158 @p156 @p147) :args (@t64))
% 206.37/206.64  (step @p161 :rule cong :premises (@p160) :args (@t65))
% 206.37/206.64  (step @p162 :rule trans :premises (@p161 @p142))
% 206.37/206.64  (step @p163 :rule trans :premises (@p162 @p108))
% 206.37/206.64  (step @p164 :rule eq_resolve :premises (@p31 @p163))
% 206.37/206.64  (step @p165 :rule skolemize :premises (@p164))
% 206.37/206.64  (step @p166 :rule bool-double-not-elim :args (@t151))
% 206.37/206.64  (step @p167 :rule refl :args (@t156))
% 206.37/206.64  (step @p168 :rule nary_cong :premises (@p167 @p166) :args ((or @t156 (not @t152))))
% 206.37/206.64  (step @p169 :rule cnf_or_neg :args (@t156 4))
% 206.37/206.64  (step @p170 :rule eq_resolve :premises (@p169 @p168))
% 206.37/206.64  (step @p171 :rule reordering :premises (@p170) :args ((or @t151 @t156)))
% 206.37/206.64  (step @p172 :rule chain_m_resolution :premises (@p171 @p165) :args (@t151 @t112 @t157))
% 206.37/206.64  (step @p173 :rule cnf_or_pos :args (@t160))
% 206.37/206.64  (step @p174 :rule reordering :premises (@p173) :args ((or @t152 @t159 @t161)))
% 206.37/206.65  (step @p175 :rule chain_m_resolution :premises (@p174 @p172 @p107) :args (@t161 @t162 (@list @t151 @t158)))
% 206.37/206.65  (assume-push @p218 @t166)
% 206.37/206.65  (step @p177 :rule instantiate :premises (@p218) :args (@t114))
% 206.37/206.65  (step-pop @p219 :rule scope :premises (@p177))
% 206.37/206.65  (step @p178 :rule process_scope :premises (@p219) :args (@t160))
% 206.37/206.65  (step @p180 :rule implies_elim :premises (@p178))
% 206.37/206.65  (step @p181 :rule chain_m_resolution :premises (@p180 @p175) :args ((not @t166) @t112 (@list @t160)))
% 206.37/206.65  (step @p182 :rule aci_norm :args ((= @t167 @t165)))
% 206.37/206.65  (step @p183 :rule cong :premises (@p182) :args (@t168))
% 206.37/206.65  (step @p184 :rule true_intro :premises (@p183))
% 206.37/206.65  (step @p185 :rule eq-symm :args (@t166 @t168))
% 206.37/206.65  (step @p186 :rule trans :premises (@p185 @p184))
% 206.37/206.65  (step @p187 :rule true_elim :premises (@p186))
% 206.37/206.65  (step @p188 :rule equiv_elim2 :premises (@p187))
% 206.37/206.65  (step @p189 :rule chain_m_resolution :premises (@p188 @p181) :args (@t169 @t112 (@list @t166)))
% 206.37/206.65  (step @p190 :rule bool-double-not-elim :args (@t168))
% 206.37/206.65  (step @p191 :rule refl :args (@t170))
% 206.37/206.65  (step @p192 :rule refl :args (@t172))
% 206.37/206.65  (step @p193 :rule nary_cong :premises (@p192 @p191 @p190) :args ((or @t172 @t170 (not @t169))))
% 206.37/206.65  (step @p194 :rule cnf_equiv_pos2 :args (@t171))
% 206.37/206.65  (step @p195 :rule eq_resolve :premises (@p194 @p193))
% 206.37/206.65  (step @p196 :rule reordering :premises (@p195) :args ((or @t170 @t168 @t172)))
% 206.37/206.65  (step @p197 :rule chain_m_resolution :premises (@p196 @p189 @p88) :args (@t170 @t102 (@list @t168 @t171)))
% 206.37/206.65  (step @p198 :rule cnf_or_pos :args (@t175))
% 206.37/206.65  (step @p199 :rule reordering :premises (@p198) :args ((or @t173 @t174 (not @t175))))
% 206.37/206.65  (step @p200 :rule chain_m_resolution :premises (@p199 @p197 @p74) :args (@t173 @t162 (@list @t170 @t175)))
% 206.37/206.65  (step @p201 :rule cnf_equiv_pos1 :args (@t177))
% 206.37/206.65  (step @p202 :rule reordering :premises (@p201) :args ((or @t176 (not @t173) (not @t177))))
% 206.37/206.65  (step @p203 :rule chain_m_resolution :premises (@p202 @p200 @p45) :args (@t176 @t162 (@list @t173 @t177)))
% 206.37/206.65  (step @p204 :rule instantiate :premises (@p106) :args (@t178))
% 206.37/206.65  (step @p205 :rule cnf_or_neg :args (@t156 2))
% 206.37/206.65  (step @p206 :rule chain_m_resolution :premises (@p205 @p165) :args ((not @t155) @t112 @t157))
% 206.37/206.65  (step @p207 :rule cnf_or_pos :args (@t181))
% 206.37/206.65  (step @p208 :rule reordering :premises (@p207) :args ((or @t155 @t180 @t182)))
% 206.37/206.65  (step @p209 :rule chain_m_resolution :premises (@p208 @p206 @p204) :args (@t182 @t102 (@list @t155 @t179)))
% 206.37/206.65  (assume-push @p220 @t176)
% 206.37/206.65  (step @p211 :rule instantiate :premises (@p220) :args (@t178))
% 206.37/206.65  (step-pop @p221 :rule scope :premises (@p211))
% 206.37/206.65  (step @p212 :rule process_scope :premises (@p221) :args (@t181))
% 206.37/206.65  (step @p214 :rule implies_elim :premises (@p212))
% 206.37/206.65  (step @p215 false :rule chain_m_resolution :premises (@p214 @p209 @p203) :args (false @t102 (@list @t181 @t176)))
% 206.37/206.65  )
% 206.37/206.65  % SZS output end Proof
% 206.37/206.65  % cvc5 exiting
%------------------------------------------------------------------------------