↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n022.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:48:41 AM UTC 2026

% Result   : Theorem 0.39s 0.60s
% Output   : Proof 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET802+4 : TPTP v9.2.1. Released v3.2.0.
% 0.13/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n022.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue Jun  2 16:12:38 EDT 2026
% 0.16/0.35  % CPUTime  : 
% 0.29/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.60  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.39/0.60  % SZS status Theorem
% 0.39/0.60  % SZS output start Proof
% 0.39/0.60  (
% 0.39/0.60  (declare-sort $$unsorted 0)
% 0.39/0.60  (declare-const tptp.min (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.max (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.lower_bound (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.order (-> $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.least (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.sum (-> $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.equal_set (-> $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.power_set (-> $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.greatest (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.upper_bound (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.empty_set $$unsorted)
% 0.39/0.60  (declare-const tptp.product (-> $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.member (-> $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.total_order (-> $$unsorted $$unsorted Bool))
% 0.39/0.60  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.39/0.60  (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.39/0.60  (define @t1 () (@var "B" $$unsorted))
% 0.39/0.60  (define @t2 () (@var "X" $$unsorted))
% 0.39/0.60  (define @t3 () (tptp.member @t2 @t1))
% 0.39/0.60  (define @t4 () (@var "A" $$unsorted))
% 0.39/0.60  (define @t5 () (tptp.member @t2 @t4))
% 0.39/0.60  (define @t6 () (@list @t2))
% 0.39/0.60  (define @t7 () (tptp.subset @t4 @t1))
% 0.39/0.60  (define @t8 () (@list @t4 @t1))
% 0.39/0.60  (define @t9 () (@list @t2 @t4))
% 0.39/0.60  (define @t10 () (@list @t2 @t4 @t1))
% 0.39/0.60  (define @t11 () (@var "E" $$unsorted))
% 0.39/0.60  (define @t12 () (= @t2 @t4))
% 0.39/0.60  (define @t13 () (@var "Y" $$unsorted))
% 0.39/0.60  (define @t14 () (tptp.member @t2 @t13))
% 0.39/0.60  (define @t15 () (tptp.member @t13 @t4))
% 0.39/0.60  (define @t16 () (@list @t13))
% 0.39/0.60  (define @t17 () (@var "Z" $$unsorted))
% 0.39/0.60  (define @t18 () (@var "R" $$unsorted))
% 0.39/0.60  (define @t19 () (tptp.apply @t18 @t2 @t13))
% 0.39/0.60  (define @t20 () (tptp.member @t13 @t11))
% 0.39/0.60  (define @t21 () (tptp.member @t2 @t11))
% 0.39/0.60  (define @t22 () (tptp.apply @t18 @t13 @t2))
% 0.39/0.60  (define @t23 () (and @t21 @t20))
% 0.39/0.60  (define @t24 () (@list @t2 @t13))
% 0.39/0.60  (define @t25 () (tptp.order @t18 @t11))
% 0.39/0.60  (define @t26 () (@list @t18 @t11))
% 0.39/0.60  (define @t27 () (@var "M" $$unsorted))
% 0.39/0.60  (define @t28 () (tptp.apply @t18 @t2 @t27))
% 0.39/0.60  (define @t29 () (forall @t6 (=> @t21 @t28)))
% 0.39/0.60  (define @t30 () (@list @t18 @t11 @t27))
% 0.39/0.60  (define @t31 () (tptp.apply @t18 @t27 @t2))
% 0.39/0.60  (define @t32 () (forall @t6 (=> @t21 @t31)))
% 0.39/0.60  (define @t33 () (tptp.lower_bound @t27 @t18 @t11))
% 0.39/0.60  (define @t34 () (= @t33 @t32))
% 0.39/0.60  (define @t35 () (forall @t30 @t34))
% 0.39/0.60  (define @t36 () (tptp.member @t27 @t11))
% 0.39/0.60  (define @t37 () (and @t36 @t32))
% 0.39/0.60  (define @t38 () (tptp.least @t27 @t18 @t11))
% 0.39/0.60  (define @t39 () (= @t38 @t37))
% 0.39/0.60  (define @t40 () (forall @t30 @t39))
% 0.39/0.60  (define @t41 () (= @t27 @t2))
% 0.39/0.60  (define @t42 () (@list @t27))
% 0.39/0.60  (define @t43 () (tptp.member @t4 @t2))
% 0.39/0.60  (define @t44 () (@list @t4 @t2 @t18 @t11))
% 0.39/0.60  (define @t45 () (tptp.apply @t18 @t27 @t4))
% 0.39/0.60  (define @t46 () (tptp.lower_bound @t27 @t18 @t2))
% 0.39/0.60  (define @t47 () (and @t36 @t46))
% 0.39/0.60  (define @t48 () (forall @t42 (=> @t47 @t45)))
% 0.39/0.60  (define @t49 () (tptp.lower_bound @t4 @t18 @t2))
% 0.39/0.60  (define @t50 () (and @t43 @t49 @t48))
% 0.39/0.60  (define @t51 () (tptp.greatest_lower_bound @t4 @t2 @t18 @t11))
% 0.39/0.60  (define @t52 () (= @t51 @t50))
% 0.39/0.60  (define @t53 () (forall @t44 @t52))
% 0.39/0.60  (define @t54 () (forall @t42 (= (tptp.least @t27 @t18 @t2) (and (tptp.member @t27 @t2) (tptp.greatest_lower_bound @t27 @t2 @t18 @t11)))))
% 0.39/0.60  (define @t55 () (tptp.subset @t2 @t11))
% 0.39/0.60  (define @t56 () (forall @t6 (=> @t55 @t54)))
% 0.39/0.60  (define @t57 () (=> @t25 @t56))
% 0.39/0.60  (define @t58 () (forall @t26 @t57))
% 0.39/0.60  (define @t59 () (not @t58))
% 0.39/0.60  (define @t60 () (@var "BOUND_VARIABLE_7760" $$unsorted))
% 0.39/0.60  (define @t61 () (@var "BOUND_VARIABLE_7762" $$unsorted))
% 0.39/0.60  (define @t62 () (= (tptp.least @t61 @t18 @t60) (and (tptp.member @t61 @t60) (tptp.greatest_lower_bound @t61 @t60 @t18 @t11))))
% 0.39/0.60  (define @t63 () (not (tptp.subset @t60 @t11)))
% 0.39/0.60  (define @t64 () (not @t25))
% 0.39/0.60  (define @t65 () (or @t64 @t63 @t62))
% 0.39/0.60  (define @t66 () (@list @t18 @t11 @t60 @t61))
% 0.39/0.60  (define @t67 () (forall @t66 @t65))
% 0.39/0.60  (define @t68 () (@quantifiers_skolemize @t67 3))
% 0.39/0.60  (define @t69 () (@quantifiers_skolemize @t67 0))
% 0.39/0.60  (define @t70 () (@quantifiers_skolemize @t67 2))
% 0.39/0.60  (define @t71 () (@quantifiers_skolemize @t67 1))
% 0.39/0.60  (define @t72 () (forall @t42 (or (not (tptp.member @t27 @t71)) (not (tptp.lower_bound @t27 @t69 @t70)) (tptp.apply @t69 @t27 @t68))))
% 0.39/0.60  (define @t73 () (@quantifiers_skolemize @t72 0))
% 0.39/0.60  (define @t74 () (tptp.lower_bound @t68 @t69 @t70))
% 0.39/0.60  (define @t75 () (not (tptp.member @t2 @t70)))
% 0.39/0.60  (define @t76 () (forall @t6 (or @t75 (tptp.apply @t69 @t68 @t2))))
% 0.39/0.60  (define @t77 () (forall @t30 (= @t33 (forall @t6 (or (not @t21) @t31)))))
% 0.39/0.60  (define @t78 () (= @t74 @t76))
% 0.39/0.60  (define @t79 () (@list @t69 @t70 @t68))
% 0.39/0.60  (define @t80 () (= @t76 @t74))
% 0.39/0.60  (define @t81 () (@list false))
% 0.39/0.60  (define @t82 () (or @t63 @t62))
% 0.39/0.60  (define @t83 () (or @t64 @t82))
% 0.39/0.60  (define @t84 () (forall @t66 @t83))
% 0.39/0.60  (define @t85 () (@list @t60 @t61))
% 0.39/0.60  (define @t86 () (forall @t85 @t83))
% 0.39/0.60  (define @t87 () (forall @t85 @t82))
% 0.39/0.60  (define @t88 () (@var "BOUND_VARIABLE_7745" $$unsorted))
% 0.39/0.60  (define @t89 () (or @t64 @t87))
% 0.39/0.60  (define @t90 () (= (tptp.least @t88 @t18 @t2) (and (tptp.member @t88 @t2) (tptp.greatest_lower_bound @t88 @t2 @t18 @t11))))
% 0.39/0.60  (define @t91 () (not @t55))
% 0.39/0.60  (define @t92 () (or @t91 @t90))
% 0.39/0.60  (define @t93 () (forall (@list @t2 @t88) @t92))
% 0.39/0.60  (define @t94 () (@list @t88))
% 0.39/0.60  (define @t95 () (forall @t94 @t92))
% 0.39/0.60  (define @t96 () (forall @t94 @t90))
% 0.39/0.60  (define @t97 () (or @t91 @t96))
% 0.39/0.60  (define @t98 () (tptp.greatest_lower_bound @t68 @t70 @t69 @t71))
% 0.39/0.60  (define @t99 () (tptp.member @t68 @t70))
% 0.39/0.60  (define @t100 () (and @t99 @t98))
% 0.39/0.60  (define @t101 () (tptp.least @t68 @t69 @t70))
% 0.39/0.60  (define @t102 () (= @t101 @t100))
% 0.39/0.60  (define @t103 () (or (not (tptp.order @t69 @t71)) (not (tptp.subset @t70 @t71)) @t102))
% 0.39/0.60  (define @t104 () (@list true))
% 0.39/0.60  (define @t105 () (and @t99 @t76))
% 0.39/0.60  (define @t106 () (= @t101 @t105))
% 0.39/0.60  (define @t107 () (not @t106))
% 0.39/0.60  (define @t108 () (not @t105))
% 0.39/0.60  (define @t109 () (not @t100))
% 0.39/0.60  (define @t110 () (not @t76))
% 0.39/0.60  (define @t111 () (not @t99))
% 0.39/0.60  (define @t112 () (not @t46))
% 0.39/0.60  (define @t113 () (not @t36))
% 0.39/0.60  (define @t114 () (and @t99 @t74 @t72))
% 0.39/0.60  (define @t115 () (= @t98 @t114))
% 0.39/0.60  (define @t116 () (not @t115))
% 0.39/0.60  (define @t117 () (not @t98))
% 0.39/0.60  (define @t118 () (not @t80))
% 0.39/0.60  (define @t119 () (not @t74))
% 0.39/0.60  (define @t120 () (not @t114))
% 0.39/0.60  (define @t121 () (@list false false))
% 0.39/0.60  (define @t122 () (@list @t105))
% 0.39/0.60  (define @t123 () (@list true false))
% 0.39/0.60  (define @t124 () (not @t72))
% 0.39/0.60  (define @t125 () (tptp.lower_bound @t73 @t69 @t70))
% 0.39/0.60  (define @t126 () (tptp.apply @t69 @t73 @t68))
% 0.39/0.60  (define @t127 () (not @t125))
% 0.39/0.60  (define @t128 () (or (not (tptp.member @t73 @t71)) @t127 @t126))
% 0.39/0.60  (define @t129 () (@list @t128))
% 0.39/0.60  (define @t130 () (forall @t6 (or @t75 (tptp.apply @t69 @t73 @t2))))
% 0.39/0.60  (define @t131 () (= @t125 @t130))
% 0.39/0.60  (define @t132 () (or @t111 @t126))
% 0.39/0.60  (define @t133 () (not @t132))
% 0.39/0.60  (assume @p1 (forall @t8 (= @t7 (forall @t6 (=> @t5 @t3)))))
% 0.39/0.60  (assume @p2 (forall @t8 (= (tptp.equal_set @t4 @t1) (and @t7 (tptp.subset @t1 @t4)))))
% 0.39/0.60  (assume @p3 (forall @t9 (= (tptp.member @t2 (tptp.power_set @t4)) (tptp.subset @t2 @t4))))
% 0.39/0.60  (assume @p4 (forall @t10 (= (tptp.member @t2 (tptp.intersection @t4 @t1)) (and @t5 @t3))))
% 0.39/0.60  (assume @p5 (forall @t10 (= (tptp.member @t2 (tptp.union @t4 @t1)) (or @t5 @t3))))
% 0.39/0.60  (assume @p6 (forall @t6 (not (tptp.member @t2 tptp.empty_set))))
% 0.39/0.60  (assume @p7 (forall (@list @t1 @t4 @t11) (= (tptp.member @t1 (tptp.difference @t11 @t4)) (and (tptp.member @t1 @t11) (not (tptp.member @t1 @t4))))))
% 0.39/0.60  (assume @p8 (forall @t9 (= (tptp.member @t2 (tptp.singleton @t4)) @t12)))
% 0.39/0.60  (assume @p9 (forall @t10 (= (tptp.member @t2 (tptp.unordered_pair @t4 @t1)) (or @t12 (= @t2 @t1)))))
% 0.39/0.60  (assume @p10 (forall @t9 (= (tptp.member @t2 (tptp.sum @t4)) (exists @t16 (and @t15 @t14)))))
% 0.39/0.60  (assume @p11 (forall @t9 (= (tptp.member @t2 (tptp.product @t4)) (forall @t16 (=> @t15 @t14)))))
% 0.39/0.60  (assume @p12 (forall @t26 (= @t25 (and (forall @t6 (=> @t21 (tptp.apply @t18 @t2 @t2))) (forall @t24 (=> @t23 (=> (and @t19 @t22) (= @t2 @t13)))) (forall (@list @t2 @t13 @t17) (=> (and @t21 @t20 (tptp.member @t17 @t11)) (=> (and @t19 (tptp.apply @t18 @t13 @t17)) (tptp.apply @t18 @t2 @t17))))))))
% 0.39/0.60  (assume @p13 (forall @t26 (= (tptp.total_order @t18 @t11) (and @t25 (forall @t24 (=> @t23 (or @t19 @t22)))))))
% 0.39/0.60  (assume @p14 (forall @t30 (= (tptp.upper_bound @t27 @t18 @t11) @t29)))
% 0.39/0.60  (assume @p15 @t35)
% 0.39/0.60  (assume @p16 (forall @t30 (= (tptp.greatest @t27 @t18 @t11) (and @t36 @t29))))
% 0.39/0.60  (assume @p17 @t40)
% 0.39/0.60  (assume @p18 (forall @t30 (= (tptp.max @t27 @t18 @t11) (and @t36 (forall @t6 (=> (and @t21 @t31) @t41))))))
% 0.39/0.60  (assume @p19 (forall @t30 (= (tptp.min @t27 @t18 @t11) (and @t36 (forall @t6 (=> (and @t21 @t28) @t41))))))
% 0.39/0.60  (assume @p20 (forall @t44 (= (tptp.least_upper_bound @t4 @t2 @t18 @t11) (and @t43 (tptp.upper_bound @t4 @t18 @t2) (forall @t42 (=> (and @t36 (tptp.upper_bound @t27 @t18 @t2)) (tptp.apply @t18 @t4 @t27)))))))
% 0.39/0.60  (assume @p21 @t53)
% 0.39/0.60  (assume @p22 @t59)
% 0.39/0.60  (assume @p23 true)
% 0.39/0.60  (step @p24 :rule bool-impl-elim :args (@t21 @t31))
% 0.39/0.60  (step @p25 :rule cong :premises (@p24) :args (@t32))
% 0.39/0.60  (step @p26 :rule refl :args (@t33))
% 0.39/0.60  (step @p27 :rule cong :premises (@p26 @p25) :args (@t34))
% 0.39/0.60  (step @p28 :rule cong :premises (@p27) :args (@t35))
% 0.39/0.60  (step @p29 :rule eq_resolve :premises (@p15 @p28))
% 0.39/0.60  (step @p30 :rule instantiate :premises (@p29) :args ((@list @t69 @t70 @t73)))
% 0.39/0.60  (step @p31 :rule eq-symm :args (@t74 @t76))
% 0.39/0.60  (step @p32 :rule refl :args (@t77))
% 0.39/0.60  (step @p33 :rule cong :premises (@p32 @p31) :args ((=> @t77 @t78)))
% 0.39/0.60  (assume-push @p161 @t77)
% 0.39/0.60  (step @p35 :rule instantiate :premises (@p29) :args (@t79))
% 0.39/0.60  (step-pop @p162 :rule scope :premises (@p35))
% 0.39/0.60  (step @p36 :rule process_scope :premises (@p162) :args (@t78))
% 0.39/0.60  (step @p38 :rule eq_resolve :premises (@p36 @p33))
% 0.39/0.60  (step @p39 :rule implies_elim :premises (@p38))
% 0.39/0.60  (step @p40 :rule chain_m_resolution :premises (@p39 @p29) :args (@t80 @t81 (@list @t77)))
% 0.39/0.60  (step @p41 :rule refl :args (@t36))
% 0.39/0.60  (step @p42 :rule nary_cong :premises (@p41 @p25) :args (@t37))
% 0.39/0.60  (step @p43 :rule refl :args (@t38))
% 0.39/0.60  (step @p44 :rule cong :premises (@p43 @p42) :args (@t39))
% 0.39/0.60  (step @p45 :rule cong :premises (@p44) :args (@t40))
% 0.39/0.60  (step @p46 :rule eq_resolve :premises (@p17 @p45))
% 0.39/0.60  (step @p47 :rule instantiate :premises (@p46) :args (@t79))
% 0.39/0.60  (step @p48 :rule aci_norm :args ((= @t83 @t65)))
% 0.39/0.60  (step @p49 :rule cong :premises (@p48) :args (@t84))
% 0.39/0.60  (step @p50 :rule quant-merge-prenex :args ((= (forall @t26 @t86) @t84)))
% 0.39/0.60  (step @p51 :rule alpha_equiv :args (@t87 (@list @t60 @t61) (@list @t2 @t88)))
% 0.39/0.60  (step @p52 :rule refl :args (@t64))
% 0.39/0.60  (step @p53 :rule nary_cong :premises (@p52 @p51) :args (@t89))
% 0.39/0.60  (step @p54 :rule quant-miniscope-or :args ((= @t86 @t89)))
% 0.39/0.60  (step @p55 :rule trans :premises (@p54 @p53))
% 0.39/0.60  (step @p56 :rule symm :premises (@p55))
% 0.39/0.60  (step @p57 :rule cong :premises (@p56) :args ((forall @t26 (or @t64 @t93))))
% 0.39/0.60  (step @p58 :rule trans :premises (@p57 @p50))
% 0.39/0.60  (step @p59 :rule trans :premises (@p58 @p49))
% 0.39/0.60  (step @p60 :rule bool-impl-elim :args (@t25 @t93))
% 0.39/0.60  (step @p61 :rule cong :premises (@p60) :args ((forall @t26 (=> @t25 @t93))))
% 0.39/0.60  (step @p62 :rule trans :premises (@p61 @p59))
% 0.39/0.60  (step @p63 :rule quant-merge-prenex :args ((= (forall @t6 @t95) @t93)))
% 0.39/0.60  (step @p64 :rule alpha_equiv :args (@t96 (@list @t88) (@list @t27)))
% 0.39/0.60  (step @p65 :rule refl :args (@t91))
% 0.39/0.60  (step @p66 :rule nary_cong :premises (@p65 @p64) :args (@t97))
% 0.39/0.60  (step @p67 :rule quant-miniscope-or :args ((= @t95 @t97)))
% 0.39/0.60  (step @p68 :rule trans :premises (@p67 @p66))
% 0.39/0.60  (step @p69 :rule symm :premises (@p68))
% 0.39/0.60  (step @p70 :rule cong :premises (@p69) :args ((forall @t6 (or @t91 @t54))))
% 0.39/0.60  (step @p71 :rule trans :premises (@p70 @p63))
% 0.39/0.60  (step @p72 :rule bool-impl-elim :args (@t55 @t54))
% 0.39/0.60  (step @p73 :rule cong :premises (@p72) :args (@t56))
% 0.39/0.60  (step @p74 :rule trans :premises (@p73 @p71))
% 0.39/0.60  (step @p75 :rule refl :args (@t25))
% 0.39/0.60  (step @p76 :rule cong :premises (@p75 @p74) :args (@t57))
% 0.39/0.60  (step @p77 :rule cong :premises (@p76) :args (@t58))
% 0.39/0.61  (step @p78 :rule trans :premises (@p77 @p62))
% 0.39/0.61  (step @p79 :rule cong :premises (@p78) :args (@t59))
% 0.39/0.61  (step @p80 :rule eq_resolve :premises (@p22 @p79))
% 0.39/0.61  (step @p81 :rule skolemize :premises (@p80))
% 0.39/0.61  (step @p82 :rule cnf_or_neg :args (@t103 2))
% 0.39/0.61  (step @p83 :rule chain_m_resolution :premises (@p82 @p81) :args ((not @t102) @t104 (@list @t103)))
% 0.39/0.61  (step @p84 :rule cnf_equiv_neg1 :args (@t102))
% 0.39/0.61  (step @p85 :rule reordering :premises (@p84) :args ((or @t101 @t100 @t102)))
% 0.39/0.61  (step @p86 :rule cnf_equiv_pos2 :args (@t106))
% 0.39/0.61  (step @p87 :rule reordering :premises (@p86) :args ((or @t101 @t108 @t107)))
% 0.39/0.61  (step @p88 :rule cnf_and_pos :args (@t100 0))
% 0.39/0.61  (step @p89 :rule reordering :premises (@p88) :args ((or @t99 @t109)))
% 0.39/0.61  (step @p90 :rule cnf_and_pos :args (@t100 1))
% 0.39/0.61  (step @p91 :rule reordering :premises (@p90) :args ((or @t98 @t109)))
% 0.39/0.61  (step @p92 :rule cnf_and_neg :args (@t105))
% 0.39/0.61  (step @p93 :rule reordering :premises (@p92) :args ((or @t111 @t105 @t110)))
% 0.39/0.61  (step @p94 :rule aci_norm :args ((= (or (or @t113 @t112) @t45) (or @t113 @t112 @t45))))
% 0.39/0.61  (step @p95 :rule refl :args (@t45))
% 0.39/0.61  (step @p96 :rule bool-and-de-morgan :args (@t36 @t46 true))
% 0.39/0.61  (step @p97 :rule nary_cong :premises (@p96 @p95) :args ((or (not @t47) @t45)))
% 0.39/0.61  (step @p98 :rule trans :premises (@p97 @p94))
% 0.39/0.61  (step @p99 :rule bool-impl-elim :args (@t47 @t45))
% 0.39/0.61  (step @p100 :rule trans :premises (@p99 @p98))
% 0.39/0.61  (step @p101 :rule cong :premises (@p100) :args (@t48))
% 0.39/0.61  (step @p102 :rule refl :args (@t49))
% 0.39/0.61  (step @p103 :rule refl :args (@t43))
% 0.39/0.61  (step @p104 :rule nary_cong :premises (@p103 @p102 @p101) :args (@t50))
% 0.39/0.61  (step @p105 :rule refl :args (@t51))
% 0.39/0.61  (step @p106 :rule cong :premises (@p105 @p104) :args (@t52))
% 0.39/0.61  (step @p107 :rule cong :premises (@p106) :args (@t53))
% 0.39/0.61  (step @p108 :rule eq_resolve :premises (@p21 @p107))
% 0.39/0.61  (step @p109 :rule instantiate :premises (@p108) :args ((@list @t68 @t70 @t69 @t71)))
% 0.39/0.61  (step @p110 :rule cnf_equiv_pos1 :args (@t115))
% 0.39/0.61  (step @p111 :rule reordering :premises (@p110) :args ((or @t117 @t114 @t116)))
% 0.39/0.61  (step @p112 :rule cnf_equiv_pos2 :args (@t80))
% 0.39/0.61  (step @p113 :rule reordering :premises (@p112) :args ((or @t76 @t119 @t118)))
% 0.39/0.61  (step @p114 :rule cnf_and_pos :args (@t114 1))
% 0.39/0.61  (step @p115 :rule reordering :premises (@p114) :args ((or @t74 @t120)))
% 0.39/0.61  (step @p116 :rule chain_m_resolution :premises (@p115 @p113 @p40 @p111 @p109 @p93 @p91 @p89 @p87 @p47 @p85 @p83) :args (@t101 (@list true false false false true false false true false false true) (@list @t74 @t80 @t114 @t115 @t76 @t98 @t99 @t105 @t106 @t100 @t102)))
% 0.39/0.61  (step @p117 :rule cnf_equiv_pos1 :args (@t106))
% 0.39/0.61  (step @p118 :rule reordering :premises (@p117) :args ((or (not @t101) @t105 @t107)))
% 0.39/0.61  (step @p119 :rule chain_m_resolution :premises (@p118 @p116 @p47) :args (@t105 @t121 (@list @t101 @t106)))
% 0.39/0.61  (step @p120 :rule cnf_and_pos :args (@t105 1))
% 0.39/0.61  (step @p121 :rule reordering :premises (@p120) :args ((or @t76 @t108)))
% 0.39/0.61  (step @p122 :rule chain_m_resolution :premises (@p121 @p119) :args (@t76 @t81 @t122))
% 0.39/0.61  (step @p123 :rule cnf_equiv_pos1 :args (@t80))
% 0.39/0.61  (step @p124 :rule reordering :premises (@p123) :args ((or @t74 @t110 @t118)))
% 0.39/0.61  (step @p125 :rule chain_m_resolution :premises (@p124 @p122 @p40) :args (@t74 @t121 (@list @t76 @t80)))
% 0.39/0.61  (step @p126 :rule cnf_and_pos :args (@t105 0))
% 0.39/0.61  (step @p127 :rule reordering :premises (@p126) :args ((or @t99 @t108)))
% 0.39/0.61  (step @p128 :rule chain_m_resolution :premises (@p127 @p119) :args (@t99 @t81 @t122))
% 0.39/0.61  (step @p129 :rule cnf_equiv_neg2 :args (@t102))
% 0.39/0.61  (step @p130 :rule chain_m_resolution :premises (@p129 @p83 @p116) :args (@t109 @t123 (@list @t102 @t101)))
% 0.39/0.61  (step @p131 :rule cnf_and_neg :args (@t100))
% 0.39/0.61  (step @p132 :rule chain_m_resolution :premises (@p131 @p130 @p128) :args (@t117 @t123 (@list @t100 @t99)))
% 0.39/0.61  (step @p133 :rule cnf_equiv_pos2 :args (@t115))
% 0.39/0.61  (step @p134 :rule reordering :premises (@p133) :args ((or @t98 @t120 @t116)))
% 0.39/0.61  (step @p135 :rule chain_m_resolution :premises (@p134 @p132 @p109) :args (@t120 @t123 (@list @t98 @t115)))
% 0.39/0.61  (step @p136 :rule cnf_and_neg :args (@t114))
% 0.39/0.61  (step @p137 :rule reordering :premises (@p136) :args ((or @t111 @t114 @t119 @t124)))
% 0.39/0.61  (step @p138 :rule chain_m_resolution :premises (@p137 @p128 @p135 @p125) :args (@t124 (@list false true false) (@list @t99 @t114 @t74)))
% 0.39/0.61  (step @p139 :rule skolemize :premises (@p138))
% 0.39/0.61  (step @p140 :rule bool-double-not-elim :args (@t125))
% 0.39/0.61  (step @p141 :rule refl :args (@t128))
% 0.39/0.61  (step @p142 :rule nary_cong :premises (@p141 @p140) :args ((or @t128 (not @t127))))
% 0.39/0.61  (step @p143 :rule cnf_or_neg :args (@t128 1))
% 0.39/0.61  (step @p144 :rule eq_resolve :premises (@p143 @p142))
% 0.39/0.61  (step @p145 :rule reordering :premises (@p144) :args ((or @t125 @t128)))
% 0.39/0.61  (step @p146 :rule chain_m_resolution :premises (@p145 @p139) :args (@t125 @t104 @t129))
% 0.39/0.61  (step @p147 :rule cnf_equiv_pos1 :args (@t131))
% 0.39/0.61  (step @p148 :rule reordering :premises (@p147) :args ((or @t127 @t130 (not @t131))))
% 0.39/0.61  (step @p149 :rule chain_m_resolution :premises (@p148 @p146 @p30) :args (@t130 @t121 (@list @t125 @t131)))
% 0.39/0.61  (step @p150 :rule cnf_or_neg :args (@t128 2))
% 0.39/0.61  (step @p151 :rule chain_m_resolution :premises (@p150 @p139) :args ((not @t126) @t104 @t129))
% 0.39/0.61  (step @p152 :rule cnf_or_pos :args (@t132))
% 0.39/0.61  (step @p153 :rule reordering :premises (@p152) :args ((or @t111 @t126 @t133)))
% 0.39/0.61  (step @p154 :rule chain_m_resolution :premises (@p153 @p128 @p151) :args (@t133 (@list false true) (@list @t99 @t126)))
% 0.39/0.61  (assume-push @p163 @t130)
% 0.39/0.61  (step @p156 :rule instantiate :premises (@p149) :args ((@list @t68)))
% 0.39/0.61  (step-pop @p164 :rule scope :premises (@p156))
% 0.39/0.61  (step @p157 :rule process_scope :premises (@p164) :args (@t132))
% 0.39/0.61  (step @p159 :rule implies_elim :premises (@p157))
% 0.39/0.61  (step @p160 false :rule chain_m_resolution :premises (@p159 @p154 @p149) :args (false @t123 (@list @t132 @t130)))
% 0.39/0.61  )
% 0.39/0.61  % SZS output end Proof
% 0.39/0.61  % cvc5 exiting
%------------------------------------------------------------------------------