↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n015.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 09:01:22 AM UTC 2026

% Result   : Theorem 0.45s 0.66s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV406+1 : TPTP v9.2.1. Released v3.3.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n015.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 20:06:49 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.27/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.45/0.66  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.45/0.66  % SZS status Theorem
% 0.45/0.66  % SZS output start Proof
% 0.45/0.66  (
% 0.45/0.66  (declare-sort $$unsorted 0)
% 0.45/0.66  (declare-const tptp.findmin_cpq_res (-> $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.check_cpq (-> $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.triple (-> $$unsorted $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.removemin_cpq_eff (-> $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.findmin_cpq_eff (-> $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.remove_cpq (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.insert_pqp (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.insert_cpq (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.less_than (-> $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.strictly_less_than (-> $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.findmin_pqp_res (-> $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.bottom $$unsorted)
% 0.45/0.66  (declare-const tptp.create_slb $$unsorted)
% 0.45/0.66  (declare-const tptp.lookup_slb (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.isnonempty_slb (-> $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.removemin_cpq_res (-> $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.remove_pqp (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.contains_cpq (-> $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.pair (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.insert_slb (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.ok (-> $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.contains_slb (-> $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.succ_cpq (-> $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.pair_in_list (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.45/0.66  (declare-const tptp.bad $$unsorted)
% 0.45/0.66  (declare-const tptp.remove_slb (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (declare-const tptp.update_slb (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.66  (define @t1 () (@var "W" $$unsorted))
% 0.45/0.66  (define @t2 () (@var "U" $$unsorted))
% 0.45/0.66  (define @t3 () (@var "V" $$unsorted))
% 0.45/0.66  (define @t4 () (tptp.less_than @t2 @t3))
% 0.45/0.66  (define @t5 () (@list @t2 @t3 @t1))
% 0.45/0.66  (define @t6 () (tptp.less_than @t3 @t2))
% 0.45/0.66  (define @t7 () (@list @t2 @t3))
% 0.45/0.66  (define @t8 () (@list @t2))
% 0.45/0.66  (define @t9 () (tptp.pair @t3 @t1))
% 0.45/0.66  (define @t10 () (tptp.insert_slb @t2 @t9))
% 0.45/0.66  (define @t11 () (= @t3 @t1))
% 0.45/0.66  (define @t12 () (tptp.contains_slb @t2 @t1))
% 0.45/0.66  (define @t13 () (@var "X" $$unsorted))
% 0.45/0.66  (define @t14 () (tptp.pair @t3 @t13))
% 0.45/0.66  (define @t15 () (tptp.insert_slb @t2 @t14))
% 0.45/0.66  (define @t16 () (@list @t2 @t3 @t1 @t13))
% 0.45/0.66  (define @t17 () (@var "Y" $$unsorted))
% 0.45/0.66  (define @t18 () (@list @t2 @t3 @t1 @t13 @t17))
% 0.45/0.66  (define @t19 () (forall @t18 (= (tptp.pair_in_list @t15 @t1 @t17) (or (tptp.pair_in_list @t2 @t1 @t17) (and @t11 (= @t13 @t17))))))
% 0.45/0.66  (define @t20 () (and (not @t11) @t12))
% 0.45/0.66  (define @t21 () (tptp.update_slb @t2 @t1))
% 0.45/0.66  (define @t22 () (tptp.update_slb @t15 @t1))
% 0.45/0.66  (define @t23 () (tptp.succ_cpq @t2 @t3))
% 0.45/0.66  (define @t24 () (tptp.triple @t2 tptp.create_slb @t3))
% 0.45/0.66  (define @t25 () (tptp.triple @t2 @t3 @t1))
% 0.45/0.66  (define @t26 () (tptp.check_cpq (tptp.triple @t2 (tptp.insert_slb @t3 (tptp.pair @t13 @t17)) @t1)))
% 0.45/0.66  (define @t27 () (= @t26 (tptp.check_cpq @t25)))
% 0.45/0.66  (define @t28 () (tptp.less_than @t17 @t13))
% 0.45/0.66  (define @t29 () (forall @t18 (=> @t28 @t27)))
% 0.45/0.66  (define @t30 () (tptp.strictly_less_than @t13 @t17))
% 0.45/0.66  (define @t31 () (=> @t30 (= @t26 false)))
% 0.45/0.66  (define @t32 () (forall @t18 @t31))
% 0.45/0.66  (define @t33 () (tptp.contains_slb @t3 @t13))
% 0.45/0.66  (define @t34 () (tptp.triple @t2 @t3 tptp.bad))
% 0.45/0.66  (define @t35 () (tptp.remove_cpq @t25 @t13))
% 0.45/0.66  (define @t36 () (tptp.remove_slb @t3 @t13))
% 0.45/0.66  (define @t37 () (tptp.remove_pqp @t2 @t13))
% 0.45/0.66  (define @t38 () (tptp.lookup_slb @t3 @t13))
% 0.45/0.66  (define @t39 () (tptp.findmin_pqp_res @t2))
% 0.45/0.66  (define @t40 () (tptp.update_slb @t3 @t39))
% 0.45/0.66  (define @t41 () (tptp.findmin_cpq_eff @t25))
% 0.45/0.66  (define @t42 () (= @t41 (tptp.triple @t2 @t40 tptp.bad)))
% 0.45/0.66  (define @t43 () (tptp.contains_slb @t3 @t39))
% 0.45/0.66  (define @t44 () (not (= @t3 tptp.create_slb)))
% 0.45/0.66  (define @t45 () (tptp.lookup_slb @t3 @t39))
% 0.45/0.66  (define @t46 () (tptp.findmin_cpq_res @t2))
% 0.45/0.66  (define @t47 () (@var "X4" $$unsorted))
% 0.45/0.66  (define @t48 () (@var "X5" $$unsorted))
% 0.45/0.66  (define @t49 () (tptp.less_than @t48 @t47))
% 0.45/0.66  (define @t50 () (@var "X3" $$unsorted))
% 0.45/0.66  (define @t51 () (@var "X2" $$unsorted))
% 0.45/0.66  (define @t52 () (tptp.insert_slb @t2 (tptp.pair @t51 @t50)))
% 0.45/0.66  (define @t53 () (tptp.pair_in_list @t52 @t47 @t48))
% 0.45/0.66  (define @t54 () (@list @t47 @t48))
% 0.45/0.66  (define @t55 () (forall @t54 (=> @t53 @t49)))
% 0.45/0.66  (define @t56 () (@var "X1" $$unsorted))
% 0.45/0.66  (define @t57 () (@var "Z" $$unsorted))
% 0.45/0.66  (define @t58 () (tptp.check_cpq (tptp.triple @t57 @t52 @t56)))
% 0.45/0.66  (define @t59 () (= @t58 @t55))
% 0.45/0.66  (define @t60 () (@list @t57 @t56 @t51 @t50))
% 0.45/0.66  (define @t61 () (forall @t60 @t59))
% 0.45/0.66  (define @t62 () (tptp.pair_in_list @t2 @t13 @t17))
% 0.45/0.66  (define @t63 () (@list @t13 @t17))
% 0.45/0.66  (define @t64 () (forall @t63 (=> @t62 @t28)))
% 0.45/0.66  (define @t65 () (tptp.check_cpq (tptp.triple @t3 @t2 @t1)))
% 0.45/0.66  (define @t66 () (= @t65 @t64))
% 0.45/0.66  (define @t67 () (@list @t3 @t1))
% 0.45/0.66  (define @t68 () (forall @t67 @t66))
% 0.45/0.66  (define @t69 () (=> @t68 @t61))
% 0.45/0.66  (define @t70 () (forall @t8 @t69))
% 0.45/0.66  (define @t71 () (not @t70))
% 0.45/0.66  (define @t72 () (not @t26))
% 0.45/0.66  (define @t73 () (@var "BOUND_VARIABLE_7813" $$unsorted))
% 0.45/0.66  (define @t74 () (@var "BOUND_VARIABLE_7811" $$unsorted))
% 0.45/0.67  (define @t75 () (tptp.insert_slb @t2 (tptp.pair @t74 @t73)))
% 0.45/0.67  (define @t76 () (@var "BOUND_VARIABLE_7809" $$unsorted))
% 0.45/0.67  (define @t77 () (@var "BOUND_VARIABLE_7807" $$unsorted))
% 0.45/0.67  (define @t78 () (= (tptp.check_cpq (tptp.triple @t77 @t75 @t76)) (forall @t54 (or (not (tptp.pair_in_list @t75 @t47 @t48)) @t49))))
% 0.45/0.67  (define @t79 () (forall @t67 (= @t65 (forall @t63 (or (not @t62) @t28)))))
% 0.45/0.67  (define @t80 () (not @t79))
% 0.45/0.67  (define @t81 () (or @t80 @t78))
% 0.45/0.67  (define @t82 () (forall (@list @t2 @t77 @t76 @t74 @t73) @t81))
% 0.45/0.67  (define @t83 () (@quantifiers_skolemize @t82 4))
% 0.45/0.67  (define @t84 () (@quantifiers_skolemize @t82 3))
% 0.45/0.67  (define @t85 () (@list @t84 @t83))
% 0.45/0.67  (define @t86 () (@quantifiers_skolemize @t82 2))
% 0.45/0.67  (define @t87 () (@quantifiers_skolemize @t82 0))
% 0.45/0.67  (define @t88 () (@quantifiers_skolemize @t82 1))
% 0.45/0.67  (define @t89 () (@list @t88 @t87 @t86 @t84 @t83))
% 0.45/0.67  (define @t90 () (tptp.check_cpq (tptp.triple @t88 @t87 @t86)))
% 0.45/0.67  (define @t91 () (tptp.insert_slb @t87 (tptp.pair @t84 @t83)))
% 0.45/0.67  (define @t92 () (tptp.check_cpq (tptp.triple @t88 @t91 @t86)))
% 0.45/0.67  (define @t93 () (= @t92 @t90))
% 0.45/0.67  (define @t94 () (tptp.less_than @t83 @t84))
% 0.45/0.67  (define @t95 () (not @t94))
% 0.45/0.67  (define @t96 () (or @t95 @t93))
% 0.45/0.67  (define @t97 () (tptp.less_than @t84 @t83))
% 0.45/0.67  (define @t98 () (and @t97 @t95))
% 0.45/0.67  (define @t99 () (not @t98))
% 0.45/0.67  (define @t100 () (tptp.strictly_less_than @t84 @t83))
% 0.45/0.67  (define @t101 () (= @t100 @t98))
% 0.45/0.67  (define @t102 () (not @t101))
% 0.45/0.67  (define @t103 () (not @t100))
% 0.45/0.67  (define @t104 () (@list @t77 @t76 @t74 @t73))
% 0.45/0.67  (define @t105 () (forall @t104 @t81))
% 0.45/0.67  (define @t106 () (forall @t104 @t78))
% 0.45/0.67  (define @t107 () (or @t80 @t106))
% 0.45/0.67  (define @t108 () (forall @t60 (= @t58 (forall @t54 (or (not @t53) @t49)))))
% 0.45/0.67  (define @t109 () (forall @t54 (or (not (tptp.pair_in_list @t91 @t47 @t48)) @t49)))
% 0.45/0.67  (define @t110 () (= @t92 @t109))
% 0.45/0.67  (define @t111 () (forall @t63 (or (not (tptp.pair_in_list @t87 @t13 @t17)) @t28)))
% 0.45/0.67  (define @t112 () (forall @t67 (= (tptp.check_cpq (tptp.triple @t3 @t87 @t1)) @t111)))
% 0.45/0.67  (define @t113 () (not @t112))
% 0.45/0.67  (define @t114 () (or @t113 @t110))
% 0.45/0.67  (define @t115 () (@list true))
% 0.45/0.67  (define @t116 () (@list @t114))
% 0.45/0.67  (define @t117 () (@quantifiers_skolemize @t111 1))
% 0.45/0.67  (define @t118 () (@quantifiers_skolemize @t111 0))
% 0.45/0.67  (define @t119 () (tptp.less_than @t117 @t118))
% 0.45/0.67  (define @t120 () (tptp.pair_in_list @t91 @t118 @t117))
% 0.45/0.67  (define @t121 () (not @t120))
% 0.45/0.67  (define @t122 () (or @t121 @t119))
% 0.45/0.67  (define @t123 () (not @t93))
% 0.45/0.67  (define @t124 () (not @t90))
% 0.45/0.67  (define @t125 () (= @t90 @t111))
% 0.45/0.67  (define @t126 () (= @t111 @t90))
% 0.45/0.67  (define @t127 () (@list false))
% 0.45/0.67  (define @t128 () (not @t126))
% 0.45/0.67  (define @t129 () (not @t111))
% 0.45/0.67  (define @t130 () (tptp.pair_in_list @t87 @t118 @t117))
% 0.45/0.67  (define @t131 () (not @t130))
% 0.45/0.67  (define @t132 () (or @t131 @t119))
% 0.45/0.67  (define @t133 () (not @t132))
% 0.45/0.67  (define @t134 () (or @t130 (and (= @t84 @t118) (= @t83 @t117))))
% 0.45/0.67  (define @t135 () (= @t120 @t134))
% 0.45/0.67  (define @t136 () (not @t109))
% 0.45/0.67  (define @t137 () (@quantifiers_skolemize @t109 0))
% 0.45/0.67  (define @t138 () (@quantifiers_skolemize @t109 1))
% 0.45/0.67  (define @t139 () (tptp.less_than @t138 @t137))
% 0.45/0.67  (define @t140 () (tptp.pair_in_list @t91 @t137 @t138))
% 0.45/0.67  (define @t141 () (not @t140))
% 0.45/0.67  (define @t142 () (or @t141 @t139))
% 0.45/0.67  (define @t143 () (not @t142))
% 0.45/0.67  (define @t144 () (not @t92))
% 0.45/0.67  (define @t145 () (= @t83 @t138))
% 0.45/0.67  (define @t146 () (= @t84 @t137))
% 0.45/0.67  (define @t147 () (and @t146 @t145))
% 0.45/0.67  (define @t148 () (tptp.pair_in_list @t87 @t137 @t138))
% 0.45/0.67  (define @t149 () (or @t148 @t147))
% 0.45/0.67  (define @t150 () (= @t140 @t149))
% 0.45/0.67  (define @t151 () (tptp.less_than @t137 @t138))
% 0.45/0.67  (define @t152 () (or @t139 @t151))
% 0.45/0.67  (define @t153 () (@list @t137 @t138))
% 0.45/0.67  (define @t154 () (not @t148))
% 0.45/0.67  (define @t155 () (or @t154 @t139))
% 0.45/0.67  (define @t156 () (not @t151))
% 0.45/0.67  (define @t157 () (not @t139))
% 0.45/0.67  (define @t158 () (and @t151 @t157))
% 0.45/0.67  (define @t159 () (tptp.strictly_less_than @t137 @t138))
% 0.45/0.67  (define @t160 () (= @t159 @t158))
% 0.45/0.67  (define @t161 () (not @t147))
% 0.45/0.67  (define @t162 () (not @t145))
% 0.45/0.67  (define @t163 () (not @t146))
% 0.45/0.67  (define @t164 () (not @t159))
% 0.45/0.67  (define @t165 () (and @t103 @t146 @t145 @t159))
% 0.45/0.67  (define @t166 () (or @t94 @t97))
% 0.45/0.67  (define @t167 () (@list true false))
% 0.45/0.67  (define @t168 () (not @t97))
% 0.45/0.67  (define @t169 () (@list false false))
% 0.45/0.67  (define @t170 () (tptp.pair_in_list @t91 @t84 @t83))
% 0.45/0.67  (define @t171 () (tptp.pair_in_list @t87 @t84 @t83))
% 0.45/0.67  (define @t172 () (and (= @t84 @t84) (= @t83 @t83)))
% 0.45/0.67  (define @t173 () (or @t171 @t172))
% 0.45/0.67  (define @t174 () (= @t170 @t173))
% 0.45/0.67  (define @t175 () (not @t170))
% 0.45/0.67  (define @t176 () (or @t175 @t94))
% 0.45/0.67  (define @t177 () (not @t176))
% 0.45/0.67  (define @t178 () (or @t103 @t144))
% 0.45/0.67  (define @t179 () (not @t178))
% 0.45/0.67  (define @t180 () (forall @t18 (or (not @t30) @t72)))
% 0.45/0.67  (assume @p1 (forall @t5 (=> (and @t4 (tptp.less_than @t3 @t1)) (tptp.less_than @t2 @t1))))
% 0.45/0.67  (assume @p2 (forall @t7 (or @t4 @t6)))
% 0.45/0.67  (assume @p3 (forall @t8 (tptp.less_than @t2 @t2)))
% 0.45/0.67  (assume @p4 (forall @t7 (= (tptp.strictly_less_than @t2 @t3) (and @t4 (not @t6)))))
% 0.45/0.67  (assume @p5 (forall @t8 (tptp.less_than tptp.bottom @t2)))
% 0.45/0.67  (assume @p6 (not (tptp.isnonempty_slb tptp.create_slb)))
% 0.45/0.67  (assume @p7 (forall @t5 (tptp.isnonempty_slb @t10)))
% 0.45/0.67  (assume @p8 (forall @t8 (not (tptp.contains_slb tptp.create_slb @t2))))
% 0.45/0.67  (assume @p9 (forall @t16 (= (tptp.contains_slb @t15 @t1) (or @t12 @t11))))
% 0.45/0.67  (assume @p10 (forall @t7 (not (tptp.pair_in_list tptp.create_slb @t2 @t3))))
% 0.45/0.67  (assume @p11 @t19)
% 0.45/0.67  (assume @p12 (forall @t5 (= (tptp.remove_slb @t10 @t3) @t2)))
% 0.45/0.67  (assume @p13 (forall @t16 (=> @t20 (= (tptp.remove_slb @t15 @t1) (tptp.insert_slb (tptp.remove_slb @t2 @t1) @t14)))))
% 0.45/0.67  (assume @p14 (forall @t5 (= (tptp.lookup_slb @t10 @t3) @t1)))
% 0.45/0.67  (assume @p15 (forall @t16 (=> @t20 (= (tptp.lookup_slb @t15 @t1) (tptp.lookup_slb @t2 @t1)))))
% 0.45/0.67  (assume @p16 (forall @t8 (= (tptp.update_slb tptp.create_slb @t2) tptp.create_slb)))
% 0.45/0.67  (assume @p17 (forall @t16 (=> (tptp.strictly_less_than @t13 @t1) (= @t22 (tptp.insert_slb @t21 @t9)))))
% 0.45/0.67  (assume @p18 (forall @t16 (=> (tptp.less_than @t1 @t13) (= @t22 (tptp.insert_slb @t21 @t14)))))
% 0.45/0.67  (assume @p19 (forall @t8 (tptp.succ_cpq @t2 @t2)))
% 0.45/0.67  (assume @p20 (forall @t5 (=> @t23 (tptp.succ_cpq @t2 (tptp.insert_cpq @t3 @t1)))))
% 0.45/0.67  (assume @p21 (forall @t5 (=> @t23 (tptp.succ_cpq @t2 (tptp.remove_cpq @t3 @t1)))))
% 0.45/0.67  (assume @p22 (forall @t7 (=> @t23 (tptp.succ_cpq @t2 (tptp.findmin_cpq_eff @t3)))))
% 0.45/0.67  (assume @p23 (forall @t7 (=> @t23 (tptp.succ_cpq @t2 (tptp.removemin_cpq_eff @t3)))))
% 0.45/0.67  (assume @p24 (forall @t7 (tptp.check_cpq @t24)))
% 0.45/0.67  (assume @p25 @t29)
% 0.45/0.67  (assume @p26 @t32)
% 0.45/0.67  (assume @p27 (forall @t16 (= (tptp.contains_cpq @t25 @t13) @t33)))
% 0.45/0.67  (assume @p28 (forall @t7 (= (tptp.ok @t34) false)))
% 0.45/0.67  (assume @p29 (forall @t5 (=> (not (tptp.ok @t25)) (= @t1 tptp.bad))))
% 0.45/0.67  (assume @p30 (forall @t16 (= (tptp.insert_cpq @t25 @t13) (tptp.triple (tptp.insert_pqp @t2 @t13) (tptp.insert_slb @t3 (tptp.pair @t13 tptp.bottom)) @t1))))
% 0.45/0.67  (assume @p31 (forall @t16 (=> (not @t33) (= @t35 @t34))))
% 0.45/0.67  (assume @p32 (forall @t16 (=> (and @t33 (tptp.less_than @t38 @t13)) (= @t35 (tptp.triple @t37 @t36 @t1)))))
% 0.45/0.67  (assume @p33 (forall @t16 (=> (and @t33 (tptp.strictly_less_than @t13 @t38)) (= @t35 (tptp.triple @t37 @t36 tptp.bad)))))
% 0.45/0.67  (assume @p34 (forall @t7 (= (tptp.findmin_cpq_eff @t24) (tptp.triple @t2 tptp.create_slb tptp.bad))))
% 0.45/0.67  (assume @p35 (forall @t16 (=> (and @t44 (not @t43)) @t42)))
% 0.45/0.67  (assume @p36 (forall @t16 (=> (and @t44 @t43 (tptp.strictly_less_than @t39 @t45)) @t42)))
% 0.45/0.67  (assume @p37 (forall @t16 (=> (and @t44 @t43 (tptp.less_than @t45 @t39)) (= @t41 (tptp.triple @t2 @t40 @t1)))))
% 0.45/0.67  (assume @p38 (forall @t7 (= (tptp.findmin_cpq_res @t24) tptp.bottom)))
% 0.45/0.67  (assume @p39 (forall @t16 (=> @t44 (= (tptp.findmin_cpq_res @t25) @t39))))
% 0.45/0.67  (assume @p40 (forall @t8 (= (tptp.removemin_cpq_eff @t2) (tptp.remove_cpq (tptp.findmin_cpq_eff @t2) @t46))))
% 0.45/0.67  (assume @p41 (forall @t8 (= (tptp.removemin_cpq_res @t2) @t46)))
% 0.45/0.67  (assume @p42 @t71)
% 0.45/0.67  (assume @p43 true)
% 0.45/0.67  (step @p44 :rule bool-impl-elim :args (@t30 @t72))
% 0.45/0.67  (step @p45 :rule cong :premises (@p44) :args ((forall @t18 (=> @t30 @t72))))
% 0.45/0.67  (step @p46 :rule bool-eq-false :args (@t26))
% 0.45/0.67  (step @p47 :rule refl :args (@t30))
% 0.45/0.67  (step @p48 :rule cong :premises (@p47 @p46) :args (@t31))
% 0.45/0.67  (step @p49 :rule cong :premises (@p48) :args (@t32))
% 0.45/0.67  (step @p50 :rule trans :premises (@p49 @p45))
% 0.45/0.67  (step @p51 :rule eq_resolve :premises (@p26 @p50))
% 0.45/0.67  (step @p52 :rule instantiate :premises (@p4) :args (@t85))
% 0.45/0.67  (step @p53 :rule instantiate :premises (@p2) :args ((@list @t83 @t84)))
% 0.45/0.67  (step @p54 :rule bool-impl-elim :args (@t28 @t27))
% 0.45/0.67  (step @p55 :rule cong :premises (@p54) :args (@t29))
% 0.45/0.67  (step @p56 :rule eq_resolve :premises (@p25 @p55))
% 0.45/0.67  (step @p57 :rule instantiate :premises (@p56) :args (@t89))
% 0.45/0.67  (step @p58 :rule cnf_or_pos :args (@t96))
% 0.45/0.67  (step @p59 :rule reordering :premises (@p58) :args ((or @t95 @t93 (not @t96))))
% 0.45/0.67  (step @p60 :rule cnf_and_pos :args (@t98 1))
% 0.45/0.67  (step @p61 :rule reordering :premises (@p60) :args ((or @t95 @t99)))
% 0.45/0.67  (step @p62 :rule cnf_equiv_pos1 :args (@t101))
% 0.45/0.67  (step @p63 :rule reordering :premises (@p62) :args ((or @t98 @t103 @t102)))
% 0.45/0.67  (step @p64 :rule quant-merge-prenex :args ((= (forall @t8 @t105) @t82)))
% 0.45/0.67  (step @p65 :rule alpha_equiv :args (@t106 (@list @t77 @t76 @t74 @t73) (@list @t57 @t56 @t51 @t50)))
% 0.45/0.67  (step @p66 :rule refl :args (@t80))
% 0.45/0.67  (step @p67 :rule nary_cong :premises (@p66 @p65) :args (@t107))
% 0.45/0.67  (step @p68 :rule quant-miniscope-or :args ((= @t105 @t107)))
% 0.45/0.67  (step @p69 :rule trans :premises (@p68 @p67))
% 0.45/0.67  (step @p70 :rule symm :premises (@p69))
% 0.45/0.67  (step @p71 :rule cong :premises (@p70) :args ((forall @t8 (or @t80 @t108))))
% 0.45/0.67  (step @p72 :rule trans :premises (@p71 @p64))
% 0.45/0.67  (step @p73 :rule bool-impl-elim :args (@t79 @t108))
% 0.45/0.67  (step @p74 :rule cong :premises (@p73) :args ((forall @t8 (=> @t79 @t108))))
% 0.45/0.67  (step @p75 :rule trans :premises (@p74 @p72))
% 0.45/0.67  (step @p76 :rule bool-impl-elim :args (@t53 @t49))
% 0.45/0.67  (step @p77 :rule cong :premises (@p76) :args (@t55))
% 0.45/0.67  (step @p78 :rule refl :args (@t58))
% 0.45/0.67  (step @p79 :rule cong :premises (@p78 @p77) :args (@t59))
% 0.45/0.67  (step @p80 :rule cong :premises (@p79) :args (@t61))
% 0.45/0.67  (step @p81 :rule bool-impl-elim :args (@t62 @t28))
% 0.45/0.67  (step @p82 :rule cong :premises (@p81) :args (@t64))
% 0.45/0.67  (step @p83 :rule refl :args (@t65))
% 0.45/0.67  (step @p84 :rule cong :premises (@p83 @p82) :args (@t66))
% 0.45/0.67  (step @p85 :rule cong :premises (@p84) :args (@t68))
% 0.45/0.67  (step @p86 :rule cong :premises (@p85 @p80) :args (@t69))
% 0.45/0.67  (step @p87 :rule cong :premises (@p86) :args (@t70))
% 0.45/0.67  (step @p88 :rule trans :premises (@p87 @p75))
% 0.45/0.67  (step @p89 :rule cong :premises (@p88) :args (@t71))
% 0.45/0.67  (step @p90 :rule eq_resolve :premises (@p42 @p89))
% 0.45/0.67  (step @p91 :rule skolemize :premises (@p90))
% 0.45/0.67  (step @p92 :rule cnf_or_neg :args (@t114 1))
% 0.45/0.67  (step @p93 :rule chain_m_resolution :premises (@p92 @p91) :args ((not @t110) @t115 @t116))
% 0.45/0.67  (step @p94 :rule cnf_equiv_neg2 :args (@t110))
% 0.45/0.67  (assume-push @p289 @t109)
% 0.45/0.67  (step @p96 :rule instantiate :premises (@p289) :args ((@list @t118 @t117)))
% 0.45/0.67  (step-pop @p290 :rule scope :premises (@p96))
% 0.45/0.67  (step @p97 :rule process_scope :premises (@p290) :args (@t122))
% 0.45/0.67  (step @p99 :rule implies_elim :premises (@p97))
% 0.45/0.67  (step @p100 :rule cnf_equiv_pos2 :args (@t93))
% 0.45/0.67  (step @p101 :rule reordering :premises (@p100) :args ((or @t92 @t124 @t123)))
% 0.45/0.67  (step @p102 :rule bool-double-not-elim :args (@t112))
% 0.45/0.67  (step @p103 :rule refl :args (@t114))
% 0.45/0.67  (step @p104 :rule nary_cong :premises (@p103 @p102) :args ((or @t114 (not @t113))))
% 0.45/0.67  (step @p105 :rule cnf_or_neg :args (@t114 0))
% 0.45/0.67  (step @p106 :rule eq_resolve :premises (@p105 @p104))
% 0.45/0.67  (step @p107 :rule reordering :premises (@p106) :args ((or @t112 @t114)))
% 0.45/0.67  (step @p108 :rule chain_m_resolution :premises (@p107 @p91) :args (@t112 @t115 @t116))
% 0.45/0.67  (step @p109 :rule eq-symm :args (@t90 @t111))
% 0.45/0.67  (step @p110 :rule refl :args (@t112))
% 0.45/0.67  (step @p111 :rule cong :premises (@p110 @p109) :args ((=> @t112 @t125)))
% 0.45/0.67  (assume-push @p291 @t112)
% 0.45/0.67  (step @p113 :rule instantiate :premises (@p108) :args ((@list @t88 @t86)))
% 0.45/0.67  (step-pop @p292 :rule scope :premises (@p113))
% 0.45/0.67  (step @p114 :rule process_scope :premises (@p292) :args (@t125))
% 0.45/0.67  (step @p116 :rule eq_resolve :premises (@p114 @p111))
% 0.45/0.67  (step @p117 :rule implies_elim :premises (@p116))
% 0.45/0.67  (step @p118 :rule chain_m_resolution :premises (@p117 @p108) :args (@t126 @t127 (@list @t112)))
% 0.45/0.67  (step @p119 :rule cnf_equiv_pos1 :args (@t126))
% 0.45/0.67  (step @p120 :rule reordering :premises (@p119) :args ((or @t90 @t129 @t128)))
% 0.45/0.67  (step @p121 :rule refl :args (@t133))
% 0.45/0.67  (step @p122 :rule bool-double-not-elim :args (@t111))
% 0.45/0.67  (step @p123 :rule nary_cong :premises (@p122 @p121) :args ((or (not @t129) @t133)))
% 0.45/0.67  (assume-push @p293 @t129)
% 0.45/0.67  (step @p125 :rule skolemize :premises (@p293))
% 0.45/0.67  (step-pop @p294 :rule scope :premises (@p125))
% 0.45/0.67  (step @p126 :rule process_scope :premises (@p294) :args (@t133))
% 0.45/0.67  (step @p128 :rule implies_elim :premises (@p126))
% 0.45/0.67  (step @p129 :rule eq_resolve :premises (@p128 @p123))
% 0.45/0.67  (step @p130 :rule bool-double-not-elim :args (@t130))
% 0.45/0.67  (step @p131 :rule refl :args (@t132))
% 0.45/0.67  (step @p132 :rule nary_cong :premises (@p131 @p130) :args ((or @t132 (not @t131))))
% 0.45/0.67  (step @p133 :rule cnf_or_neg :args (@t132 0))
% 0.45/0.67  (step @p134 :rule eq_resolve :premises (@p133 @p132))
% 0.45/0.67  (step @p135 :rule reordering :premises (@p134) :args ((or @t130 @t132)))
% 0.45/0.67  (step @p136 :rule cnf_or_neg :args (@t132 1))
% 0.45/0.67  (step @p137 :rule cnf_or_neg :args (@t134 0))
% 0.45/0.67  (step @p138 :rule reordering :premises (@p137) :args ((or @t131 @t134)))
% 0.45/0.67  (step @p139 :rule cnf_or_pos :args (@t122))
% 0.45/0.67  (step @p140 :rule reordering :premises (@p139) :args ((or @t119 @t121 (not @t122))))
% 0.45/0.67  (step @p141 :rule instantiate :premises (@p11) :args ((@list @t87 @t84 @t118 @t83 @t117)))
% 0.45/0.67  (step @p142 :rule cnf_equiv_pos2 :args (@t135))
% 0.45/0.67  (step @p143 :rule reordering :premises (@p142) :args ((or @t120 (not @t134) (not @t135))))
% 0.45/0.67  (step @p144 :rule chain_m_resolution :premises (@p143 @p141 @p140 @p138 @p136 @p135 @p129 @p120 @p118 @p101 @p99 @p94 @p93) :args ((or @t136 @t123) (@list false true false true false true true false true false true true) (@list @t135 @t120 @t134 @t119 @t130 @t132 @t111 @t126 @t90 @t122 @t92 @t110)))
% 0.45/0.67  (step @p145 :rule cnf_equiv_neg1 :args (@t110))
% 0.45/0.67  (step @p146 :rule reordering :premises (@p145) :args ((or @t92 @t109 @t110)))
% 0.45/0.67  (step @p147 :rule refl :args (@t143))
% 0.45/0.67  (step @p148 :rule bool-double-not-elim :args (@t109))
% 0.45/0.67  (step @p149 :rule nary_cong :premises (@p148 @p147) :args ((or (not @t136) @t143)))
% 0.45/0.67  (assume-push @p295 @t136)
% 0.45/0.67  (step @p151 :rule skolemize :premises (@p295))
% 0.45/0.67  (step-pop @p296 :rule scope :premises (@p151))
% 0.45/0.67  (step @p152 :rule process_scope :premises (@p296) :args (@t143))
% 0.45/0.67  (step @p154 :rule implies_elim :premises (@p152))
% 0.45/0.67  (step @p155 :rule eq_resolve :premises (@p154 @p149))
% 0.45/0.67  (step @p156 :rule cnf_equiv_pos1 :args (@t93))
% 0.45/0.67  (step @p157 :rule reordering :premises (@p156) :args ((or @t144 @t90 @t123)))
% 0.45/0.67  (step @p158 :rule bool-double-not-elim :args (@t140))
% 0.45/0.67  (step @p159 :rule refl :args (@t142))
% 0.45/0.67  (step @p160 :rule nary_cong :premises (@p159 @p158) :args ((or @t142 (not @t141))))
% 0.45/0.67  (step @p161 :rule cnf_or_neg :args (@t142 0))
% 0.45/0.67  (step @p162 :rule eq_resolve :premises (@p161 @p160))
% 0.45/0.67  (step @p163 :rule reordering :premises (@p162) :args ((or @t140 @t142)))
% 0.45/0.67  (step @p164 :rule cnf_or_neg :args (@t142 1))
% 0.45/0.67  (step @p165 :rule cnf_equiv_pos2 :args (@t126))
% 0.45/0.67  (step @p166 :rule reordering :premises (@p165) :args ((or @t111 @t124 @t128)))
% 0.45/0.67  (step @p167 :rule instantiate :premises (@p11) :args ((@list @t87 @t84 @t137 @t83 @t138)))
% 0.45/0.67  (step @p168 :rule cnf_equiv_pos1 :args (@t150))
% 0.45/0.67  (step @p169 :rule reordering :premises (@p168) :args ((or @t141 @t149 (not @t150))))
% 0.45/0.67  (step @p170 :rule instantiate :premises (@p2) :args ((@list @t138 @t137)))
% 0.45/0.67  (step @p171 :rule cnf_or_pos :args (@t152))
% 0.45/0.67  (step @p172 :rule reordering :premises (@p171) :args ((or @t139 @t151 (not @t152))))
% 0.45/0.67  (assume-push @p297 @t111)
% 0.45/0.67  (step @p174 :rule instantiate :premises (@p297) :args (@t153))
% 0.45/0.67  (step-pop @p298 :rule scope :premises (@p174))
% 0.45/0.67  (step @p175 :rule process_scope :premises (@p298) :args (@t155))
% 0.45/0.67  (step @p177 :rule implies_elim :premises (@p175))
% 0.45/0.67  (step @p178 :rule bool-double-not-elim :args (@t139))
% 0.45/0.67  (step @p179 :rule refl :args (@t156))
% 0.45/0.67  (step @p180 :rule refl :args (@t158))
% 0.45/0.67  (step @p181 :rule nary_cong :premises (@p180 @p179 @p178) :args ((or @t158 @t156 (not @t157))))
% 0.45/0.67  (step @p182 :rule cnf_and_neg :args (@t158))
% 0.45/0.67  (step @p183 :rule eq_resolve :premises (@p182 @p181))
% 0.45/0.67  (step @p184 :rule reordering :premises (@p183) :args ((or @t139 @t156 @t158)))
% 0.45/0.67  (step @p185 :rule cnf_or_pos :args (@t155))
% 0.45/0.67  (step @p186 :rule reordering :premises (@p185) :args ((or @t139 @t154 (not @t155))))
% 0.45/0.67  (step @p187 :rule instantiate :premises (@p4) :args (@t153))
% 0.45/0.67  (step @p188 :rule cnf_equiv_pos2 :args (@t160))
% 0.45/0.67  (step @p189 :rule reordering :premises (@p188) :args ((or @t159 (not @t158) (not @t160))))
% 0.45/0.67  (step @p190 :rule cnf_or_pos :args (@t149))
% 0.45/0.67  (step @p191 :rule reordering :premises (@p190) :args ((or @t148 @t147 (not @t149))))
% 0.45/0.67  (step @p192 :rule cnf_and_pos :args (@t147 0))
% 0.45/0.67  (step @p193 :rule reordering :premises (@p192) :args ((or @t146 @t161)))
% 0.45/0.67  (step @p194 :rule cnf_and_pos :args (@t147 1))
% 0.45/0.67  (step @p195 :rule reordering :premises (@p194) :args ((or @t145 @t161)))
% 0.45/0.67  (step @p196 :rule refl :args (@t162))
% 0.45/0.67  (step @p197 :rule refl :args (@t163))
% 0.45/0.67  (step @p198 :rule refl :args (@t164))
% 0.45/0.67  (step @p199 :rule bool-double-not-elim :args (@t100))
% 0.45/0.67  (step @p200 :rule nary_cong :premises (@p199 @p198 @p197 @p196) :args ((or (not @t103) @t164 @t163 @t162)))
% 0.45/0.67  (assume-push @p299 @t103)
% 0.45/0.67  (assume-push @p300 @t146)
% 0.45/0.67  (assume-push @p301 @t145)
% 0.45/0.67  (assume-push @p302 @t159)
% 0.45/0.67  (step @p205 :rule evaluate :args ((= true false)))
% 0.45/0.67  (step @p206 :rule false_intro :premises (@p299))
% 0.45/0.67  (step @p207 :rule symm :premises (@p301))
% 0.45/0.67  (step @p208 :rule symm :premises (@p300))
% 0.45/0.67  (step @p209 :rule cong :premises (@p208 @p207) :args (@t159))
% 0.45/0.67  (step @p210 :rule true_intro :premises (@p302))
% 0.45/0.67  (step @p211 :rule symm :premises (@p210))
% 0.45/0.67  (step @p212 :rule trans :premises (@p211 @p209 @p206))
% 0.45/0.67  (step @p213 false :rule eq_resolve :premises (@p212 @p205))
% 0.45/0.67  (step-pop @p303 :rule scope :premises (@p213))
% 0.45/0.67  (step-pop @p304 :rule scope :premises (@p303))
% 0.45/0.67  (step-pop @p305 :rule scope :premises (@p304))
% 0.45/0.67  (step-pop @p306 :rule scope :premises (@p305))
% 0.45/0.67  (step @p214 :rule process_scope :premises (@p306) :args (false))
% 0.45/0.67  (assume-push @p307 @t103)
% 0.45/0.67  (assume-push @p308 @t159)
% 0.45/0.67  (assume-push @p309 @t146)
% 0.45/0.67  (assume-push @p310 @t145)
% 0.45/0.67  (step @p223 :rule and_intro :premises (@p307 @p309 @p310 @p308))
% 0.45/0.67  (step-pop @p311 :rule scope :premises (@p223))
% 0.45/0.67  (step-pop @p312 :rule scope :premises (@p311))
% 0.45/0.67  (step-pop @p313 :rule scope :premises (@p312))
% 0.45/0.67  (step-pop @p314 :rule scope :premises (@p313))
% 0.45/0.67  (step @p224 :rule process_scope :premises (@p314) :args (@t165))
% 0.45/0.67  (step @p229 :rule implies_elim :premises (@p224))
% 0.45/0.67  (step @p230 :rule resolution :premises (@p229 @p214) :args (true @t165))
% 0.45/0.67  (step @p231 :rule not_and :premises (@p230))
% 0.45/0.67  (step @p232 :rule eq_resolve :premises (@p231 @p200))
% 0.45/0.67  (step @p233 :rule chain_m_resolution :premises (@p232 @p195 @p193 @p191 @p189 @p187 @p186 @p184 @p177 @p172 @p170 @p169 @p167 @p166 @p118 @p164 @p163 @p157 @p155 @p146 @p93 @p144 @p63 @p52 @p61 @p59 @p57) :args (@t95 (@list false false false false false true false false false false false false false false true false false true false true true true false true false false) (@list @t145 @t146 @t147 @t159 @t160 @t148 @t158 @t155 @t151 @t152 @t149 @t150 @t111 @t126 @t139 @t140 @t90 @t142 @t92 @t110 @t109 @t100 @t101 @t98 @t93 @t96)))
% 0.45/0.67  (step @p234 :rule cnf_or_pos :args (@t166))
% 0.45/0.67  (step @p235 :rule reordering :premises (@p234) :args ((or @t94 @t97 (not @t166))))
% 0.45/0.67  (step @p236 :rule chain_m_resolution :premises (@p235 @p233 @p53) :args (@t97 @t167 (@list @t94 @t166)))
% 0.45/0.67  (step @p237 :rule bool-double-not-elim :args (@t94))
% 0.45/0.67  (step @p238 :rule refl :args (@t168))
% 0.45/0.67  (step @p239 :rule refl :args (@t98))
% 0.45/0.67  (step @p240 :rule nary_cong :premises (@p239 @p238 @p237) :args ((or @t98 @t168 (not @t95))))
% 0.45/0.67  (step @p241 :rule cnf_and_neg :args (@t98))
% 0.45/0.67  (step @p242 :rule eq_resolve :premises (@p241 @p240))
% 0.45/0.67  (step @p243 :rule reordering :premises (@p242) :args ((or @t94 @t168 @t98)))
% 0.45/0.67  (step @p244 :rule chain_m_resolution :premises (@p243 @p233 @p236) :args (@t98 @t167 (@list @t94 @t97)))
% 0.45/0.67  (step @p245 :rule cnf_equiv_pos2 :args (@t101))
% 0.45/0.67  (step @p246 :rule reordering :premises (@p245) :args ((or @t100 @t99 @t102)))
% 0.45/0.67  (step @p247 :rule chain_m_resolution :premises (@p246 @p244 @p52) :args (@t100 @t169 (@list @t98 @t101)))
% 0.45/0.67  (step @p248 :rule bool-eq-true :args (@t170))
% 0.45/0.67  (step @p249 :rule absorb :args ((= (or @t171 true) true)))
% 0.45/0.67  (step @p250 :rule evaluate :args ((and true true)))
% 0.45/0.67  (step @p251 :rule eq-refl :args (@t83))
% 0.45/0.67  (step @p252 :rule eq-refl :args (@t84))
% 0.45/0.67  (step @p253 :rule nary_cong :premises (@p252 @p251) :args (@t172))
% 0.45/0.67  (step @p254 :rule trans :premises (@p253 @p250))
% 0.45/0.67  (step @p255 :rule refl :args (@t171))
% 0.45/0.67  (step @p256 :rule nary_cong :premises (@p255 @p254) :args (@t173))
% 0.45/0.67  (step @p257 :rule trans :premises (@p256 @p249))
% 0.45/0.67  (step @p258 :rule refl :args (@t170))
% 0.45/0.67  (step @p259 :rule cong :premises (@p258 @p257) :args (@t174))
% 0.45/0.67  (step @p260 :rule trans :premises (@p259 @p248))
% 0.45/0.67  (step @p261 :rule refl :args (@t19))
% 0.45/0.67  (step @p262 :rule cong :premises (@p261 @p260) :args ((=> @t19 @t174)))
% 0.45/0.67  (assume-push @p315 @t19)
% 0.45/0.67  (step @p264 :rule instantiate :premises (@p11) :args ((@list @t87 @t84 @t84 @t83 @t83)))
% 0.45/0.67  (step-pop @p316 :rule scope :premises (@p264))
% 0.45/0.67  (step @p265 :rule process_scope :premises (@p316) :args (@t174))
% 0.45/0.67  (step @p267 :rule eq_resolve :premises (@p265 @p262))
% 0.45/0.67  (step @p268 :rule implies_elim :premises (@p267))
% 0.45/0.67  (step @p269 :rule chain_m_resolution :premises (@p268 @p11) :args (@t170 @t127 (@list @t19)))
% 0.45/0.67  (step @p270 :rule cnf_or_pos :args (@t176))
% 0.45/0.67  (step @p271 :rule reordering :premises (@p270) :args ((or @t94 @t175 @t177)))
% 0.45/0.67  (step @p272 :rule chain_m_resolution :premises (@p271 @p233 @p269) :args (@t177 @t167 (@list @t94 @t170)))
% 0.45/0.67  (assume-push @p317 @t109)
% 0.45/0.67  (step @p274 :rule instantiate :premises (@p317) :args (@t85))
% 0.45/0.67  (step-pop @p318 :rule scope :premises (@p274))
% 0.45/0.67  (step @p275 :rule process_scope :premises (@p318) :args (@t176))
% 0.45/0.67  (step @p277 :rule implies_elim :premises (@p275))
% 0.45/0.67  (step @p278 :rule chain_m_resolution :premises (@p277 @p272) :args (@t136 @t115 (@list @t176)))
% 0.45/0.67  (step @p279 :rule chain_m_resolution :premises (@p146 @p278 @p93) :args (@t92 (@list true true) (@list @t109 @t110)))
% 0.45/0.67  (step @p280 :rule cnf_or_pos :args (@t178))
% 0.45/0.67  (step @p281 :rule reordering :premises (@p280) :args ((or @t144 @t103 @t179)))
% 0.45/0.67  (step @p282 :rule chain_m_resolution :premises (@p281 @p279 @p247) :args (@t179 @t169 (@list @t92 @t100)))
% 0.45/0.67  (assume-push @p319 @t180)
% 0.45/0.67  (step @p284 :rule instantiate :premises (@p51) :args (@t89))
% 0.45/0.67  (step-pop @p320 :rule scope :premises (@p284))
% 0.45/0.67  (step @p285 :rule process_scope :premises (@p320) :args (@t178))
% 0.45/0.67  (step @p287 :rule implies_elim :premises (@p285))
% 0.45/0.67  (step @p288 false :rule chain_m_resolution :premises (@p287 @p282 @p51) :args (false @t167 (@list @t178 @t180)))
% 0.45/0.67  )
% 0.45/0.67  % SZS output end Proof
% 0.45/0.67  % cvc5 exiting
%------------------------------------------------------------------------------