↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Result   : Theorem 0.52s 0.70s
% Output   : Proof 0.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU268+1 : TPTP v9.2.1. Released v3.3.0.
% 0.12/0.14  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.35  % Computer : n020.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Tue Jun  2 16:49:25 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.32/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.52/0.70  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.52/0.70  % SZS status Theorem
% 0.52/0.70  % SZS output start Proof
% 0.52/0.70  (
% 0.52/0.70  (declare-sort $$unsorted 0)
% 0.52/0.70  (declare-const tptp.relation_empty_yielding (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.empty_set $$unsorted)
% 0.52/0.70  (declare-const tptp.element (-> $$unsorted $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.relation_dom (-> $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.inclusion_relation (-> $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.relation_rng (-> $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.relation_field (-> $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.epsilon_transitive (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.is_reflexive_in (-> $$unsorted $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.epsilon_connected (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.reflexive (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.ordinal (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.one_to_one (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.function (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.powerset (-> $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.relation (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.52/0.70  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.52/0.70  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.52/0.70  (define @t1 () (@var "A" $$unsorted))
% 0.52/0.70  (define @t2 () (@var "B" $$unsorted))
% 0.52/0.70  (define @t3 () (tptp.in @t1 @t2))
% 0.52/0.70  (define @t4 () (@list @t1 @t2))
% 0.52/0.70  (define @t5 () (tptp.function @t1))
% 0.52/0.70  (define @t6 () (tptp.empty @t1))
% 0.52/0.70  (define @t7 () (@list @t1))
% 0.52/0.70  (define @t8 () (tptp.epsilon_connected @t1))
% 0.52/0.70  (define @t9 () (tptp.epsilon_transitive @t1))
% 0.52/0.70  (define @t10 () (and @t9 @t8))
% 0.52/0.70  (define @t11 () (tptp.ordinal @t1))
% 0.52/0.70  (define @t12 () (tptp.one_to_one @t1))
% 0.52/0.70  (define @t13 () (tptp.relation @t1))
% 0.52/0.70  (define @t14 () (and @t13 @t5 @t12))
% 0.52/0.70  (define @t15 () (and @t13 @t6 @t5))
% 0.52/0.70  (define @t16 () (and @t9 @t8 @t11))
% 0.52/0.70  (define @t17 () (tptp.unordered_pair @t1 @t2))
% 0.52/0.70  (define @t18 () (tptp.set_union2 @t2 @t1))
% 0.52/0.70  (define @t19 () (tptp.set_union2 @t1 @t2))
% 0.52/0.70  (define @t20 () (@var "C" $$unsorted))
% 0.52/0.70  (define @t21 () (tptp.ordered_pair @t20 @t20))
% 0.52/0.70  (define @t22 () (tptp.in @t21 @t1))
% 0.52/0.70  (define @t23 () (tptp.in @t20 @t2))
% 0.52/0.70  (define @t24 () (@list @t20))
% 0.52/0.70  (define @t25 () (forall @t24 (=> @t23 @t22)))
% 0.52/0.70  (define @t26 () (tptp.is_reflexive_in @t1 @t2))
% 0.52/0.70  (define @t27 () (= @t26 @t25))
% 0.52/0.70  (define @t28 () (@list @t2))
% 0.52/0.70  (define @t29 () (forall @t28 @t27))
% 0.52/0.70  (define @t30 () (=> @t13 @t29))
% 0.52/0.70  (define @t31 () (forall @t7 @t30))
% 0.52/0.70  (define @t32 () (@var "D" $$unsorted))
% 0.52/0.70  (define @t33 () (tptp.subset @t20 @t32))
% 0.52/0.70  (define @t34 () (tptp.ordered_pair @t20 @t32))
% 0.52/0.70  (define @t35 () (= (tptp.in @t34 @t2) @t33))
% 0.52/0.70  (define @t36 () (tptp.in @t32 @t1))
% 0.52/0.70  (define @t37 () (tptp.in @t20 @t1))
% 0.52/0.70  (define @t38 () (and @t37 @t36))
% 0.52/0.70  (define @t39 () (@list @t20 @t32))
% 0.52/0.70  (define @t40 () (forall @t39 (=> @t38 @t35)))
% 0.52/0.70  (define @t41 () (tptp.relation_field @t2))
% 0.52/0.70  (define @t42 () (and (= @t41 @t1) @t40))
% 0.52/0.70  (define @t43 () (tptp.inclusion_relation @t1))
% 0.52/0.70  (define @t44 () (= @t2 @t43))
% 0.52/0.70  (define @t45 () (= @t44 @t42))
% 0.52/0.70  (define @t46 () (tptp.relation @t2))
% 0.52/0.70  (define @t47 () (=> @t46 @t45))
% 0.52/0.70  (define @t48 () (forall @t4 @t47))
% 0.52/0.70  (define @t49 () (tptp.ordered_pair @t1 @t2))
% 0.52/0.70  (define @t50 () (tptp.relation_field @t1))
% 0.52/0.70  (define @t51 () (= (tptp.reflexive @t1) (tptp.is_reflexive_in @t1 @t50)))
% 0.52/0.70  (define @t52 () (forall @t7 (=> @t13 @t51)))
% 0.52/0.70  (define @t53 () (tptp.empty tptp.empty_set))
% 0.52/0.70  (define @t54 () (not @t6))
% 0.52/0.70  (define @t55 () (tptp.subset @t1 @t1))
% 0.52/0.70  (define @t56 () (forall @t4 @t55))
% 0.52/0.70  (define @t57 () (tptp.element @t1 @t2))
% 0.52/0.70  (define @t58 () (tptp.empty @t2))
% 0.52/0.70  (define @t59 () (forall @t7 (tptp.reflexive @t43)))
% 0.52/0.70  (define @t60 () (tptp.element @t2 (tptp.powerset @t20)))
% 0.52/0.70  (define @t61 () (@list @t1 @t2 @t20))
% 0.52/0.70  (define @t62 () (@var "BOUND_VARIABLE_7648" $$unsorted))
% 0.52/0.70  (define @t63 () (= (tptp.is_reflexive_in @t1 @t62) (forall @t24 (or (not (tptp.in @t20 @t62)) @t22))))
% 0.52/0.70  (define @t64 () (not @t13))
% 0.52/0.70  (define @t65 () (or @t64 @t63))
% 0.52/0.70  (define @t66 () (@list @t62))
% 0.52/0.70  (define @t67 () (forall @t66 @t65))
% 0.52/0.70  (define @t68 () (forall @t66 @t63))
% 0.52/0.70  (define @t69 () (or @t64 @t68))
% 0.52/0.70  (define @t70 () (forall @t28 (= @t26 (forall @t24 (or (not @t23) @t22)))))
% 0.52/0.70  (define @t71 () (@quantifiers_skolemize @t59 0))
% 0.52/0.70  (define @t72 () (tptp.inclusion_relation @t71))
% 0.52/0.70  (define @t73 () (tptp.relation_field @t72))
% 0.52/0.70  (define @t74 () (forall @t24 (or (not (tptp.in @t20 @t73)) (tptp.in @t21 @t72))))
% 0.52/0.70  (define @t75 () (tptp.is_reflexive_in @t72 @t73))
% 0.52/0.70  (define @t76 () (= @t75 @t74))
% 0.52/0.70  (define @t77 () (tptp.relation @t72))
% 0.52/0.70  (define @t78 () (not @t77))
% 0.52/0.70  (define @t79 () (or @t78 @t76))
% 0.52/0.70  (define @t80 () (@list false false))
% 0.52/0.70  (define @t81 () (tptp.reflexive @t72))
% 0.52/0.70  (define @t82 () (= @t81 @t75))
% 0.52/0.70  (define @t83 () (or @t78 @t82))
% 0.52/0.70  (define @t84 () (not @t75))
% 0.52/0.70  (define @t85 () (@list true false))
% 0.52/0.70  (define @t86 () (not @t74))
% 0.52/0.70  (define @t87 () (@quantifiers_skolemize @t74 0))
% 0.52/0.70  (define @t88 () (tptp.in @t87 @t73))
% 0.52/0.70  (define @t89 () (tptp.in (tptp.ordered_pair @t87 @t87) @t72))
% 0.52/0.70  (define @t90 () (not @t88))
% 0.52/0.70  (define @t91 () (or @t90 @t89))
% 0.52/0.70  (define @t92 () (@list true))
% 0.52/0.70  (define @t93 () (@list @t91))
% 0.52/0.70  (define @t94 () (not @t36))
% 0.52/0.70  (define @t95 () (not @t37))
% 0.52/0.70  (define @t96 () (or @t95 @t94 @t35))
% 0.52/0.70  (define @t97 () (= @t44 (and (= @t1 @t41) (forall @t39 @t96))))
% 0.52/0.70  (define @t98 () (tptp.in @t34 @t72))
% 0.52/0.70  (define @t99 () (not (tptp.in @t32 @t71)))
% 0.52/0.70  (define @t100 () (not (tptp.in @t20 @t71)))
% 0.52/0.70  (define @t101 () (forall @t39 (or @t100 @t99 (= @t33 @t98))))
% 0.52/0.70  (define @t102 () (= @t71 @t73))
% 0.52/0.70  (define @t103 () (and @t102 @t101))
% 0.52/0.70  (define @t104 () (or @t100 @t99 (= @t98 @t33)))
% 0.52/0.70  (define @t105 () (forall @t39 @t104))
% 0.52/0.70  (define @t106 () (and @t102 @t105))
% 0.52/0.70  (define @t107 () (= (= @t72 @t72) @t106))
% 0.52/0.70  (define @t108 () (or @t78 @t107))
% 0.52/0.70  (define @t109 () (forall @t4 (or (not @t46) @t97)))
% 0.52/0.70  (define @t110 () (or @t78 @t103))
% 0.52/0.70  (define @t111 () (@list false))
% 0.52/0.70  (define @t112 () (not @t103))
% 0.52/0.70  (define @t113 () (@list @t103))
% 0.52/0.70  (define @t114 () (tptp.in @t87 @t71))
% 0.52/0.70  (define @t115 () (tptp.subset @t87 @t87))
% 0.52/0.70  (define @t116 () (= @t89 @t115))
% 0.52/0.70  (define @t117 () (not @t116))
% 0.52/0.70  (define @t118 () (not @t114))
% 0.52/0.70  (define @t119 () (or @t118 @t118 (= @t115 @t89)))
% 0.52/0.70  (define @t120 () (or @t118 @t118 @t116))
% 0.52/0.70  (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1)))))
% 0.52/0.70  (assume @p2 (forall @t7 (=> @t6 @t5)))
% 0.52/0.70  (assume @p3 (forall @t7 (=> @t11 @t10)))
% 0.52/0.70  (assume @p4 (forall @t7 (=> @t15 @t14)))
% 0.52/0.70  (assume @p5 (forall @t7 (=> @t10 @t11)))
% 0.52/0.70  (assume @p6 (forall @t7 (=> @t6 @t16)))
% 0.52/0.70  (assume @p7 (forall @t4 (= @t17 (tptp.unordered_pair @t2 @t1))))
% 0.52/0.70  (assume @p8 (forall @t4 (= @t19 @t18)))
% 0.52/0.70  (assume @p9 @t31)
% 0.52/0.70  (assume @p10 @t48)
% 0.52/0.70  (assume @p11 (forall @t4 (= @t49 (tptp.unordered_pair @t17 (tptp.singleton @t1)))))
% 0.52/0.70  (assume @p12 (forall @t7 (=> @t13 (= @t50 (tptp.set_union2 (tptp.relation_dom @t1) (tptp.relation_rng @t1))))))
% 0.52/0.70  (assume @p13 @t52)
% 0.52/0.70  (assume @p14 true)
% 0.52/0.70  (assume @p15 (forall @t7 (tptp.relation @t43)))
% 0.52/0.70  (assume @p16 (forall @t7 (exists @t28 (tptp.element @t2 @t1))))
% 0.52/0.70  (assume @p17 @t53)
% 0.52/0.70  (assume @p18 (forall @t4 (not (tptp.empty @t49))))
% 0.52/0.70  (assume @p19 (and (tptp.relation tptp.empty_set) (tptp.relation_empty_yielding tptp.empty_set) (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) @t53 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set)))
% 0.52/0.70  (assume @p20 (forall @t4 (=> @t54 (not (tptp.empty @t19)))))
% 0.52/0.70  (assume @p21 (forall @t4 (=> @t54 (not (tptp.empty @t18)))))
% 0.52/0.70  (assume @p22 (forall @t4 (= (tptp.set_union2 @t1 @t1) @t1)))
% 0.52/0.70  (assume @p23 (exists @t7 (and @t13 @t5)))
% 0.52/0.70  (assume @p24 (exists @t7 @t16))
% 0.52/0.70  (assume @p25 (exists @t7 @t6))
% 0.52/0.70  (assume @p26 (exists @t7 @t15))
% 0.52/0.70  (assume @p27 (exists @t7 (and @t13 @t5 @t12 @t6 @t9 @t8 @t11)))
% 0.52/0.70  (assume @p28 (exists @t7 @t54))
% 0.52/0.70  (assume @p29 (exists @t7 @t14))
% 0.52/0.70  (assume @p30 (exists @t7 (and @t54 @t9 @t8 @t11)))
% 0.52/0.70  (assume @p31 (exists @t7 (and @t13 (tptp.relation_empty_yielding @t1) @t5)))
% 0.52/0.70  (assume @p32 @t56)
% 0.52/0.70  (assume @p33 (forall @t7 (= (tptp.set_union2 @t1 tptp.empty_set) @t1)))
% 0.52/0.70  (assume @p34 (forall @t4 (=> @t3 @t57)))
% 0.52/0.70  (assume @p35 (forall @t4 (=> @t57 (or @t58 @t3))))
% 0.52/0.70  (assume @p36 (not @t59))
% 0.52/0.70  (assume @p37 (forall @t4 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2))))
% 0.52/0.70  (assume @p38 (forall @t61 (=> (and @t3 @t60) (tptp.element @t1 @t20))))
% 0.52/0.70  (assume @p39 (forall @t61 (not (and @t3 @t60 (tptp.empty @t20)))))
% 0.52/0.70  (assume @p40 (forall @t7 (=> @t6 (= @t1 tptp.empty_set))))
% 0.52/0.70  (assume @p41 (forall @t4 (not (and @t3 @t58))))
% 0.52/0.70  (assume @p42 (forall @t4 (not (and @t6 (not (= @t1 @t2)) @t58))))
% 0.52/0.70  (step @p43 :rule quant-merge-prenex :args ((= (forall @t7 @t67) (forall (@list @t1 @t62) @t65))))
% 0.52/0.70  (step @p44 :rule alpha_equiv :args (@t68 (@list @t62) (@list @t2)))
% 0.52/0.70  (step @p45 :rule refl :args (@t64))
% 0.52/0.70  (step @p46 :rule nary_cong :premises (@p45 @p44) :args (@t69))
% 0.52/0.70  (step @p47 :rule quant-miniscope-or :args ((= @t67 @t69)))
% 0.52/0.70  (step @p48 :rule trans :premises (@p47 @p46))
% 0.52/0.70  (step @p49 :rule symm :premises (@p48))
% 0.52/0.70  (step @p50 :rule cong :premises (@p49) :args ((forall @t7 (or @t64 @t70))))
% 0.52/0.70  (step @p51 :rule trans :premises (@p50 @p43))
% 0.52/0.70  (step @p52 :rule bool-impl-elim :args (@t13 @t70))
% 0.52/0.70  (step @p53 :rule cong :premises (@p52) :args ((forall @t7 (=> @t13 @t70))))
% 0.52/0.70  (step @p54 :rule trans :premises (@p53 @p51))
% 0.52/0.70  (step @p55 :rule bool-impl-elim :args (@t23 @t22))
% 0.52/0.70  (step @p56 :rule cong :premises (@p55) :args (@t25))
% 0.52/0.70  (step @p57 :rule refl :args (@t26))
% 0.52/0.70  (step @p58 :rule cong :premises (@p57 @p56) :args (@t27))
% 0.52/0.70  (step @p59 :rule cong :premises (@p58) :args (@t29))
% 0.52/0.70  (step @p60 :rule refl :args (@t13))
% 0.52/0.70  (step @p61 :rule cong :premises (@p60 @p59) :args (@t30))
% 0.52/0.70  (step @p62 :rule cong :premises (@p61) :args (@t31))
% 0.52/0.70  (step @p63 :rule trans :premises (@p62 @p54))
% 0.52/0.70  (step @p64 :rule eq_resolve :premises (@p9 @p63))
% 0.52/0.70  (step @p65 :rule instantiate :premises (@p64) :args ((@list @t72 @t73)))
% 0.52/0.70  (step @p66 :rule instantiate :premises (@p15) :args ((@list @t71)))
% 0.52/0.70  (step @p67 :rule cnf_or_pos :args (@t79))
% 0.52/0.70  (step @p68 :rule reordering :premises (@p67) :args ((or @t78 @t76 (not @t79))))
% 0.52/0.70  (step @p69 :rule chain_m_resolution :premises (@p68 @p66 @p65) :args (@t76 @t80 (@list @t77 @t79)))
% 0.52/0.70  (step @p70 :rule bool-impl-elim :args (@t13 @t51))
% 0.52/0.70  (step @p71 :rule cong :premises (@p70) :args (@t52))
% 0.52/0.70  (step @p72 :rule eq_resolve :premises (@p13 @p71))
% 0.52/0.70  (step @p73 :rule instantiate :premises (@p72) :args ((@list @t72)))
% 0.52/0.70  (step @p74 :rule cnf_or_pos :args (@t83))
% 0.52/0.70  (step @p75 :rule reordering :premises (@p74) :args ((or @t78 @t82 (not @t83))))
% 0.52/0.70  (step @p76 :rule chain_m_resolution :premises (@p75 @p66 @p73) :args (@t82 @t80 (@list @t77 @t83)))
% 0.52/0.70  (step @p77 :rule skolemize :premises (@p36))
% 0.52/0.70  (step @p78 :rule cnf_equiv_pos2 :args (@t82))
% 0.52/0.70  (step @p79 :rule reordering :premises (@p78) :args ((or @t81 @t84 (not @t82))))
% 0.52/0.70  (step @p80 :rule chain_m_resolution :premises (@p79 @p77 @p76) :args (@t84 @t85 (@list @t81 @t82)))
% 0.52/0.70  (step @p81 :rule cnf_equiv_pos2 :args (@t76))
% 0.52/0.70  (step @p82 :rule reordering :premises (@p81) :args ((or @t75 @t86 (not @t76))))
% 0.52/0.70  (step @p83 :rule chain_m_resolution :premises (@p82 @p80 @p69) :args (@t86 @t85 (@list @t75 @t76)))
% 0.52/0.70  (step @p84 :rule skolemize :premises (@p83))
% 0.52/0.70  (step @p85 :rule bool-double-not-elim :args (@t88))
% 0.52/0.70  (step @p86 :rule refl :args (@t91))
% 0.52/0.70  (step @p87 :rule nary_cong :premises (@p86 @p85) :args ((or @t91 (not @t90))))
% 0.52/0.70  (step @p88 :rule cnf_or_neg :args (@t91 0))
% 0.52/0.70  (step @p89 :rule eq_resolve :premises (@p88 @p87))
% 0.52/0.70  (step @p90 :rule reordering :premises (@p89) :args ((or @t88 @t91)))
% 0.52/0.70  (step @p91 :rule chain_m_resolution :premises (@p90 @p84) :args (@t88 @t92 @t93))
% 0.52/0.70  (step @p92 :rule true_intro :premises (@p91))
% 0.52/0.70  (step @p93 :rule bool-impl-elim :args (@t46 @t97))
% 0.52/0.70  (step @p94 :rule cong :premises (@p93) :args ((forall @t4 (=> @t46 @t97))))
% 0.52/0.70  (step @p95 :rule aci_norm :args ((= (or (or @t95 @t94) @t35) @t96)))
% 0.52/0.70  (step @p96 :rule refl :args (@t35))
% 0.52/0.70  (step @p97 :rule bool-and-de-morgan :args (@t37 @t36 true))
% 0.52/0.70  (step @p98 :rule nary_cong :premises (@p97 @p96) :args ((or (not @t38) @t35)))
% 0.52/0.70  (step @p99 :rule trans :premises (@p98 @p95))
% 0.52/0.70  (step @p100 :rule bool-impl-elim :args (@t38 @t35))
% 0.52/0.70  (step @p101 :rule trans :premises (@p100 @p99))
% 0.52/0.70  (step @p102 :rule cong :premises (@p101) :args (@t40))
% 0.52/0.70  (step @p103 :rule eq-symm :args (@t41 @t1))
% 0.52/0.70  (step @p104 :rule nary_cong :premises (@p103 @p102) :args (@t42))
% 0.52/0.70  (step @p105 :rule refl :args (@t44))
% 0.52/0.70  (step @p106 :rule cong :premises (@p105 @p104) :args (@t45))
% 0.52/0.70  (step @p107 :rule refl :args (@t46))
% 0.52/0.70  (step @p108 :rule cong :premises (@p107 @p106) :args (@t47))
% 0.52/0.70  (step @p109 :rule cong :premises (@p108) :args (@t48))
% 0.52/0.70  (step @p110 :rule trans :premises (@p109 @p94))
% 0.52/0.70  (step @p111 :rule eq_resolve :premises (@p10 @p110))
% 0.52/0.70  (step @p112 :rule bool-eq-true :args (@t103))
% 0.52/0.70  (step @p113 :rule eq-symm :args (true @t103))
% 0.52/0.70  (step @p114 :rule trans :premises (@p113 @p112))
% 0.52/0.70  (step @p115 :rule eq-symm :args (@t98 @t33))
% 0.52/0.70  (step @p116 :rule refl :args (@t99))
% 0.52/0.70  (step @p117 :rule refl :args (@t100))
% 0.52/0.70  (step @p118 :rule nary_cong :premises (@p117 @p116 @p115) :args (@t104))
% 0.52/0.70  (step @p119 :rule cong :premises (@p118) :args (@t105))
% 0.52/0.70  (step @p120 :rule refl :args (@t102))
% 0.52/0.70  (step @p121 :rule nary_cong :premises (@p120 @p119) :args (@t106))
% 0.52/0.70  (step @p122 :rule eq-refl :args (@t72))
% 0.52/0.70  (step @p123 :rule cong :premises (@p122 @p121) :args (@t107))
% 0.52/0.70  (step @p124 :rule trans :premises (@p123 @p114))
% 0.52/0.70  (step @p125 :rule refl :args (@t78))
% 0.52/0.70  (step @p126 :rule nary_cong :premises (@p125 @p124) :args (@t108))
% 0.52/0.70  (step @p127 :rule refl :args (@t109))
% 0.52/0.70  (step @p128 :rule cong :premises (@p127 @p126) :args ((=> @t109 @t108)))
% 0.52/0.70  (assume-push @p173 @t109)
% 0.52/0.70  (step @p130 :rule instantiate :premises (@p111) :args ((@list @t71 @t72)))
% 0.52/0.70  (step-pop @p174 :rule scope :premises (@p130))
% 0.52/0.70  (step @p131 :rule process_scope :premises (@p174) :args (@t108))
% 0.52/0.70  (step @p133 :rule eq_resolve :premises (@p131 @p128))
% 0.52/0.70  (step @p134 :rule implies_elim :premises (@p133))
% 0.52/0.70  (step @p135 :rule chain_m_resolution :premises (@p134 @p111) :args (@t110 @t111 (@list @t109)))
% 0.52/0.70  (step @p136 :rule cnf_or_pos :args (@t110))
% 0.52/0.70  (step @p137 :rule reordering :premises (@p136) :args ((or @t78 @t103 (not @t110))))
% 0.52/0.70  (step @p138 :rule chain_m_resolution :premises (@p137 @p66 @p135) :args (@t103 @t80 (@list @t77 @t110)))
% 0.52/0.70  (step @p139 :rule cnf_and_pos :args (@t103 0))
% 0.52/0.70  (step @p140 :rule reordering :premises (@p139) :args ((or @t102 @t112)))
% 0.52/0.70  (step @p141 :rule chain_m_resolution :premises (@p140 @p138) :args (@t102 @t111 @t113))
% 0.52/0.70  (step @p142 :rule refl :args (@t87))
% 0.52/0.70  (step @p143 :rule cong :premises (@p142 @p141) :args (@t114))
% 0.52/0.70  (step @p144 :rule trans :premises (@p143 @p92))
% 0.52/0.70  (step @p145 :rule true_elim :premises (@p144))
% 0.52/0.70  (step @p146 :rule quant-unused-vars :args ((= @t56 (forall @t7 @t55))))
% 0.52/0.70  (step @p147 :rule eq_resolve :premises (@p32 @p146))
% 0.52/0.70  (step @p148 :rule instantiate :premises (@p147) :args ((@list @t87)))
% 0.52/0.70  (step @p149 :rule cnf_or_neg :args (@t91 1))
% 0.52/0.70  (step @p150 :rule chain_m_resolution :premises (@p149 @p84) :args ((not @t89) @t92 @t93))
% 0.52/0.70  (step @p151 :rule cnf_equiv_pos2 :args (@t116))
% 0.52/0.70  (step @p152 :rule reordering :premises (@p151) :args ((or @t89 (not @t115) @t117)))
% 0.52/0.70  (step @p153 :rule chain_m_resolution :premises (@p152 @p150 @p148) :args (@t117 @t85 (@list @t89 @t115)))
% 0.52/0.70  (step @p154 :rule cnf_and_pos :args (@t103 1))
% 0.52/0.70  (step @p155 :rule reordering :premises (@p154) :args ((or @t101 @t112)))
% 0.52/0.70  (step @p156 :rule chain_m_resolution :premises (@p155 @p138) :args (@t101 @t111 @t113))
% 0.52/0.70  (step @p157 :rule eq-symm :args (@t115 @t89))
% 0.52/0.70  (step @p158 :rule refl :args (@t118))
% 0.52/0.70  (step @p159 :rule nary_cong :premises (@p158 @p158 @p157) :args (@t119))
% 0.52/0.70  (step @p160 :rule refl :args (@t101))
% 0.52/0.70  (step @p161 :rule cong :premises (@p160 @p159) :args ((=> @t101 @t119)))
% 0.52/0.70  (assume-push @p175 @t101)
% 0.52/0.70  (step @p163 :rule instantiate :premises (@p156) :args ((@list @t87 @t87)))
% 0.52/0.70  (step-pop @p176 :rule scope :premises (@p163))
% 0.52/0.70  (step @p164 :rule process_scope :premises (@p176) :args (@t119))
% 0.52/0.70  (step @p166 :rule eq_resolve :premises (@p164 @p161))
% 0.52/0.70  (step @p167 :rule implies_elim :premises (@p166))
% 0.52/0.70  (step @p168 :rule chain_m_resolution :premises (@p167 @p156) :args (@t120 @t111 (@list @t101)))
% 0.52/0.70  (step @p169 :rule cnf_or_pos :args (@t120))
% 0.52/0.70  (step @p170 :rule factoring :premises (@p169))
% 0.52/0.70  (step @p171 :rule reordering :premises (@p170) :args ((or @t118 @t116 (not @t120))))
% 0.52/0.70  (step @p172 false :rule chain_m_resolution :premises (@p171 @p168 @p153 @p145) :args (false (@list false true false) (@list @t120 @t116 @t114)))
% 0.52/0.70  )
% 0.52/0.70  % SZS output end Proof
% 0.52/0.70  % cvc5 exiting
%------------------------------------------------------------------------------