↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Jun  3 08:50:41 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU141+2 : 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 : n010.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:31:40 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.29/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.36/0.60  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.36/0.60  % SZS status Theorem
% 0.36/0.60  % SZS output start Proof
% 0.36/0.60  (
% 0.36/0.60  (declare-sort $$unsorted 0)
% 0.36/0.60  (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool))
% 0.36/0.60  (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.60  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.36/0.60  (declare-const tptp.empty_set $$unsorted)
% 0.36/0.60  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.36/0.60  (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.60  (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.60  (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool))
% 0.36/0.60  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.36/0.60  (define @t1 () (@var "A" $$unsorted))
% 0.36/0.60  (define @t2 () (@var "B" $$unsorted))
% 0.36/0.60  (define @t3 () (not (tptp.in @t2 @t1)))
% 0.36/0.60  (define @t4 () (tptp.in @t1 @t2))
% 0.36/0.60  (define @t5 () (@list @t1 @t2))
% 0.36/0.60  (define @t6 () (tptp.proper_subset @t2 @t1))
% 0.36/0.60  (define @t7 () (tptp.proper_subset @t1 @t2))
% 0.36/0.60  (define @t8 () (tptp.set_union2 @t2 @t1))
% 0.36/0.60  (define @t9 () (tptp.set_union2 @t1 @t2))
% 0.36/0.60  (define @t10 () (tptp.set_intersection2 @t1 @t2))
% 0.36/0.60  (define @t11 () (tptp.subset @t1 @t2))
% 0.36/0.60  (define @t12 () (= @t1 @t2))
% 0.36/0.60  (define @t13 () (= @t1 tptp.empty_set))
% 0.36/0.60  (define @t14 () (@list @t1))
% 0.36/0.60  (define @t15 () (@var "D" $$unsorted))
% 0.36/0.60  (define @t16 () (tptp.in @t15 @t2))
% 0.36/0.60  (define @t17 () (tptp.in @t15 @t1))
% 0.36/0.60  (define @t18 () (@var "C" $$unsorted))
% 0.36/0.60  (define @t19 () (tptp.in @t15 @t18))
% 0.36/0.60  (define @t20 () (@list @t15))
% 0.36/0.60  (define @t21 () (@list @t1 @t2 @t18))
% 0.36/0.60  (define @t22 () (tptp.in @t18 @t2))
% 0.36/0.60  (define @t23 () (tptp.in @t18 @t1))
% 0.36/0.60  (define @t24 () (@list @t18))
% 0.36/0.60  (define @t25 () (tptp.set_difference @t1 @t2))
% 0.36/0.60  (define @t26 () (tptp.disjoint @t1 @t2))
% 0.36/0.60  (define @t27 () (forall @t5 (= @t26 (= @t10 tptp.empty_set))))
% 0.36/0.60  (define @t28 () (not @t12))
% 0.36/0.60  (define @t29 () (tptp.empty @t1))
% 0.36/0.60  (define @t30 () (not @t29))
% 0.36/0.60  (define @t31 () (= @t25 tptp.empty_set))
% 0.36/0.60  (define @t32 () (forall @t5 (= @t31 @t11)))
% 0.36/0.60  (define @t33 () (tptp.set_intersection2 @t2 @t18))
% 0.36/0.60  (define @t34 () (tptp.subset @t1 @t18))
% 0.36/0.60  (define @t35 () (tptp.set_union2 @t1 tptp.empty_set))
% 0.36/0.60  (define @t36 () (forall @t14 (= @t35 @t1)))
% 0.36/0.60  (define @t37 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1)))
% 0.36/0.60  (define @t38 () (and @t23 @t22))
% 0.36/0.60  (define @t39 () (not @t26))
% 0.36/0.60  (define @t40 () (= @t2 @t37))
% 0.36/0.60  (define @t41 () (forall @t5 (=> @t11 @t40)))
% 0.36/0.60  (define @t42 () (tptp.set_difference @t1 @t25))
% 0.36/0.60  (define @t43 () (forall @t5 (= @t42 @t10)))
% 0.36/0.60  (define @t44 () (tptp.in @t18 @t10))
% 0.36/0.60  (define @t45 () (tptp.empty @t2))
% 0.36/0.60  (define @t46 () (= @t26 (= @t25 @t1)))
% 0.36/0.60  (define @t47 () (forall @t5 @t46))
% 0.36/0.60  (define @t48 () (not @t47))
% 0.36/0.60  (define @t49 () (forall @t5 (= @t26 (= @t1 @t25))))
% 0.36/0.60  (define @t50 () (@quantifiers_skolemize @t49 1))
% 0.36/0.60  (define @t51 () (@quantifiers_skolemize @t49 0))
% 0.36/0.60  (define @t52 () (@list @t51 @t50))
% 0.36/0.60  (define @t53 () (tptp.set_difference @t51 @t50))
% 0.36/0.60  (define @t54 () (@list @t53 @t51))
% 0.36/0.60  (define @t55 () (tptp.set_difference @t51 @t53))
% 0.36/0.60  (define @t56 () (= @t51 (tptp.set_union2 @t53 @t55)))
% 0.36/0.60  (define @t57 () (tptp.subset @t53 @t51))
% 0.36/0.60  (define @t58 () (not @t57))
% 0.36/0.60  (define @t59 () (or @t58 @t56))
% 0.36/0.60  (define @t60 () (@list false false))
% 0.36/0.60  (define @t61 () (= @t51 @t53))
% 0.36/0.60  (define @t62 () (tptp.disjoint @t51 @t50))
% 0.36/0.60  (define @t63 () (= @t62 @t61))
% 0.36/0.60  (define @t64 () (tptp.set_intersection2 @t51 @t50))
% 0.36/0.60  (define @t65 () (= @t62 (= @t64 tptp.empty_set)))
% 0.36/0.60  (define @t66 () (= tptp.empty_set @t64))
% 0.36/0.60  (define @t67 () (= @t62 @t66))
% 0.36/0.60  (define @t68 () (not @t67))
% 0.36/0.60  (define @t69 () (not @t66))
% 0.36/0.60  (define @t70 () (tptp.set_difference @t53 @t51))
% 0.36/0.60  (define @t71 () (= tptp.empty_set @t70))
% 0.36/0.60  (define @t72 () (= @t57 @t71))
% 0.36/0.60  (define @t73 () (= @t64 @t55))
% 0.36/0.60  (define @t74 () (and @t61 @t71 @t73))
% 0.36/0.60  (define @t75 () (not @t73))
% 0.36/0.60  (define @t76 () (not @t61))
% 0.36/0.60  (define @t77 () (tptp.set_union2 @t53 tptp.empty_set))
% 0.36/0.60  (define @t78 () (= @t53 @t77))
% 0.36/0.60  (define @t79 () (not @t78))
% 0.36/0.60  (define @t80 () (not @t56))
% 0.36/0.60  (define @t81 () (= @t77 @t53))
% 0.36/0.60  (define @t82 () (and @t79 @t78))
% 0.36/0.60  (assume @p1 (forall @t5 (=> @t4 @t3)))
% 0.36/0.60  (assume @p2 (forall @t5 (=> @t7 (not @t6))))
% 0.36/0.60  (assume @p3 (forall @t5 (= @t9 @t8)))
% 0.36/0.60  (assume @p4 (forall @t5 (= @t10 (tptp.set_intersection2 @t2 @t1))))
% 0.36/0.60  (assume @p5 (forall @t5 (= @t12 (and @t11 (tptp.subset @t2 @t1)))))
% 0.36/0.60  (assume @p6 (forall @t14 (= @t13 (forall (@list @t2) @t3))))
% 0.36/0.60  (assume @p7 (forall @t21 (= (= @t18 @t9) (forall @t20 (= @t19 (or @t17 @t16))))))
% 0.36/0.60  (assume @p8 (forall @t5 (= @t11 (forall @t24 (=> @t23 @t22)))))
% 0.36/0.60  (assume @p9 (forall @t21 (= (= @t18 @t10) (forall @t20 (= @t19 (and @t17 @t16))))))
% 0.36/0.60  (assume @p10 (forall @t21 (= (= @t18 @t25) (forall @t20 (= @t19 (and @t17 (not @t16)))))))
% 0.36/0.60  (assume @p11 @t27)
% 0.36/0.60  (assume @p12 (forall @t5 (= @t7 (and @t11 @t28))))
% 0.36/0.60  (assume @p13 true)
% 0.36/0.60  (assume @p14 (tptp.empty tptp.empty_set))
% 0.36/0.60  (assume @p15 (forall @t5 (=> @t30 (not (tptp.empty @t9)))))
% 0.36/0.60  (assume @p16 (forall @t5 (=> @t30 (not (tptp.empty @t8)))))
% 0.36/0.60  (assume @p17 (forall @t5 (= (tptp.set_union2 @t1 @t1) @t1)))
% 0.36/0.60  (assume @p18 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1)))
% 0.36/0.60  (assume @p19 (forall @t5 (not (tptp.proper_subset @t1 @t1))))
% 0.36/0.60  (assume @p20 @t32)
% 0.36/0.60  (assume @p21 (exists @t14 @t29))
% 0.36/0.60  (assume @p22 (exists @t14 @t30))
% 0.36/0.60  (assume @p23 (forall @t5 (tptp.subset @t1 @t1)))
% 0.36/0.60  (assume @p24 (forall @t5 (=> @t26 (tptp.disjoint @t2 @t1))))
% 0.36/0.60  (assume @p25 (forall @t5 (=> @t11 (= @t9 @t2))))
% 0.36/0.60  (assume @p26 (forall @t5 (tptp.subset @t10 @t1)))
% 0.36/0.60  (assume @p27 (forall @t21 (=> (and @t11 @t34) (tptp.subset @t1 @t33))))
% 0.36/0.60  (assume @p28 @t36)
% 0.36/0.60  (assume @p29 (forall @t21 (=> (and @t11 (tptp.subset @t2 @t18)) @t34)))
% 0.36/0.60  (assume @p30 (forall @t21 (=> @t11 (tptp.subset (tptp.set_intersection2 @t1 @t18) @t33))))
% 0.36/0.60  (assume @p31 (forall @t5 (=> @t11 (= @t10 @t1))))
% 0.36/0.60  (assume @p32 (forall @t14 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set)))
% 0.36/0.60  (assume @p33 (forall @t5 (=> (forall @t24 (= @t23 @t22)) @t12)))
% 0.36/0.60  (assume @p34 (forall @t14 (tptp.subset tptp.empty_set @t1)))
% 0.36/0.60  (assume @p35 (forall @t21 (=> @t11 (tptp.subset (tptp.set_difference @t1 @t18) (tptp.set_difference @t2 @t18)))))
% 0.36/0.60  (assume @p36 (forall @t5 (tptp.subset @t25 @t1)))
% 0.36/0.60  (assume @p37 (forall @t5 (= @t37 @t9)))
% 0.36/0.60  (assume @p38 (forall @t14 (= (tptp.set_difference @t1 tptp.empty_set) @t1)))
% 0.36/0.60  (assume @p39 (forall @t5 (and (not (and @t39 (forall @t24 (not @t38)))) (not (and (exists @t24 @t38) @t26)))))
% 0.36/0.60  (assume @p40 (forall @t14 (=> (tptp.subset @t1 tptp.empty_set) @t13)))
% 0.36/0.60  (assume @p41 (forall @t5 (= (tptp.set_difference @t9 @t2) @t25)))
% 0.36/0.60  (assume @p42 @t41)
% 0.36/0.60  (assume @p43 @t43)
% 0.36/0.60  (assume @p44 (forall @t14 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set)))
% 0.36/0.60  (assume @p45 (forall @t5 (and (not (and @t39 (forall @t24 (not @t44)))) (not (and (exists @t24 @t44) @t26)))))
% 0.36/0.60  (assume @p46 (forall @t5 (not (and @t11 @t6))))
% 0.36/0.60  (assume @p47 (forall @t21 (=> (and @t11 (tptp.disjoint @t2 @t18)) (tptp.disjoint @t1 @t18))))
% 0.36/0.60  (assume @p48 (forall @t14 (=> @t29 @t13)))
% 0.36/0.60  (assume @p49 (forall @t5 (not (and @t4 @t45))))
% 0.36/0.60  (assume @p50 (forall @t5 (tptp.subset @t1 @t9)))
% 0.36/0.60  (assume @p51 @t48)
% 0.36/0.60  (assume @p52 (forall @t5 (not (and @t29 @t28 @t45))))
% 0.36/0.60  (assume @p53 (forall @t21 (=> (and @t11 (tptp.subset @t18 @t2)) (tptp.subset (tptp.set_union2 @t1 @t18) @t2))))
% 0.36/0.60  (step @p54 :rule eq-symm :args (@t42 @t10))
% 0.36/0.60  (step @p55 :rule cong :premises (@p54) :args (@t43))
% 0.36/0.60  (step @p56 :rule eq_resolve :premises (@p43 @p55))
% 0.36/0.60  (step @p57 :rule instantiate :premises (@p56) :args (@t52))
% 0.36/0.60  (step @p58 :rule bool-impl-elim :args (@t11 @t40))
% 0.36/0.60  (step @p59 :rule cong :premises (@p58) :args (@t41))
% 0.36/0.60  (step @p60 :rule eq_resolve :premises (@p42 @p59))
% 0.36/0.60  (step @p61 :rule instantiate :premises (@p60) :args (@t54))
% 0.36/0.60  (step @p62 :rule instantiate :premises (@p36) :args (@t52))
% 0.36/0.60  (step @p63 :rule cnf_or_pos :args (@t59))
% 0.36/0.60  (step @p64 :rule reordering :premises (@p63) :args ((or @t58 @t56 (not @t59))))
% 0.36/0.60  (step @p65 :rule chain_m_resolution :premises (@p64 @p62 @p61) :args (@t56 @t60 (@list @t57 @t59)))
% 0.36/0.60  (step @p66 :rule eq-symm :args (@t25 @t1))
% 0.36/0.60  (step @p67 :rule refl :args (@t26))
% 0.36/0.60  (step @p68 :rule cong :premises (@p67 @p66) :args (@t46))
% 0.36/0.60  (step @p69 :rule cong :premises (@p68) :args (@t47))
% 0.36/0.60  (step @p70 :rule cong :premises (@p69) :args (@t48))
% 0.36/0.60  (step @p71 :rule eq_resolve :premises (@p51 @p70))
% 0.36/0.60  (step @p72 :rule skolemize :premises (@p71))
% 0.36/0.60  (step @p73 :rule cnf_equiv_neg1 :args (@t63))
% 0.36/0.60  (step @p74 :rule reordering :premises (@p73) :args ((or @t62 @t61 @t63)))
% 0.36/0.60  (step @p75 :rule eq-symm :args (@t64 tptp.empty_set))
% 0.36/0.60  (step @p76 :rule refl :args (@t62))
% 0.36/0.60  (step @p77 :rule cong :premises (@p76 @p75) :args (@t65))
% 0.36/0.60  (step @p78 :rule refl :args (@t27))
% 0.36/0.60  (step @p79 :rule cong :premises (@p78 @p77) :args ((=> @t27 @t65)))
% 0.36/0.60  (assume-push @p196 @t27)
% 0.36/0.60  (step @p81 :rule instantiate :premises (@p11) :args (@t52))
% 0.36/0.60  (step-pop @p197 :rule scope :premises (@p81))
% 0.36/0.60  (step @p82 :rule process_scope :premises (@p197) :args (@t65))
% 0.36/0.60  (step @p84 :rule eq_resolve :premises (@p82 @p79))
% 0.36/0.60  (step @p85 :rule implies_elim :premises (@p84))
% 0.36/0.60  (step @p86 :rule chain_m_resolution :premises (@p85 @p11) :args (@t67 (@list false) (@list @t27)))
% 0.36/0.60  (step @p87 :rule cnf_equiv_pos2 :args (@t67))
% 0.36/0.60  (step @p88 :rule reordering :premises (@p87) :args ((or @t62 @t69 @t68)))
% 0.36/0.60  (step @p89 :rule eq-symm :args (@t25 tptp.empty_set))
% 0.36/0.60  (step @p90 :rule refl :args (@t11))
% 0.36/0.60  (step @p91 :rule cong :premises (@p90 @p89) :args ((= @t11 @t31)))
% 0.36/0.60  (step @p92 :rule eq-symm :args (@t31 @t11))
% 0.36/0.60  (step @p93 :rule trans :premises (@p92 @p91))
% 0.36/0.60  (step @p94 :rule cong :premises (@p93) :args (@t32))
% 0.36/0.60  (step @p95 :rule eq_resolve :premises (@p20 @p94))
% 0.36/0.60  (step @p96 :rule instantiate :premises (@p95) :args (@t54))
% 0.36/0.60  (step @p97 :rule cnf_equiv_pos1 :args (@t72))
% 0.36/0.60  (step @p98 :rule reordering :premises (@p97) :args ((or @t58 @t71 (not @t72))))
% 0.36/0.60  (step @p99 :rule chain_m_resolution :premises (@p98 @p62 @p96) :args (@t71 @t60 (@list @t57 @t72)))
% 0.36/0.60  (assume-push @p198 @t61)
% 0.36/0.60  (assume-push @p199 @t71)
% 0.36/0.60  (assume-push @p200 @t73)
% 0.36/0.60  (assume-push @p201 @t73)
% 0.36/0.60  (assume-push @p202 @t61)
% 0.36/0.60  (assume-push @p203 @t71)
% 0.36/0.60  (step @p106 :rule symm :premises (@p57))
% 0.36/0.60  (step @p107 :rule symm :premises (@p198))
% 0.36/0.60  (step @p108 :rule cong :premises (@p107 @p198) :args (@t70))
% 0.36/0.60  (step @p109 :rule trans :premises (@p99 @p108 @p106))
% 0.36/0.60  (step-pop @p204 :rule scope :premises (@p109))
% 0.36/0.60  (step-pop @p205 :rule scope :premises (@p204))
% 0.36/0.60  (step-pop @p206 :rule scope :premises (@p205))
% 0.36/0.60  (step @p110 :rule process_scope :premises (@p206) :args (@t66))
% 0.36/0.60  (step @p114 :rule and_intro :premises (@p57 @p198 @p99))
% 0.36/0.60  (step @p115 :rule modus_ponens :premises (@p114 @p110))
% 0.36/0.60  (step-pop @p207 :rule scope :premises (@p115))
% 0.36/0.60  (step-pop @p208 :rule scope :premises (@p207))
% 0.36/0.60  (step-pop @p209 :rule scope :premises (@p208))
% 0.36/0.60  (step @p116 :rule process_scope :premises (@p209) :args (@t66))
% 0.36/0.60  (step @p120 :rule implies_elim :premises (@p116))
% 0.36/0.60  (step @p121 :rule cnf_and_neg :args (@t74))
% 0.36/0.60  (step @p122 :rule resolution :premises (@p121 @p120) :args (true @t74))
% 0.36/0.60  (step @p123 :rule reordering :premises (@p122) :args ((or @t76 @t66 (not @t71) @t75)))
% 0.36/0.60  (step @p124 :rule chain_m_resolution :premises (@p123 @p99 @p57 @p88 @p86 @p74 @p72) :args (@t62 (@list false false true false false true) (@list @t71 @t73 @t66 @t67 @t61 @t63)))
% 0.36/0.60  (step @p125 :rule cnf_equiv_neg2 :args (@t63))
% 0.36/0.60  (step @p126 :rule chain_m_resolution :premises (@p125 @p72 @p124) :args (@t76 (@list true false) (@list @t63 @t62)))
% 0.36/0.60  (step @p127 :rule cnf_equiv_pos1 :args (@t67))
% 0.36/0.60  (step @p128 :rule reordering :premises (@p127) :args ((or (not @t62) @t66 @t68)))
% 0.36/0.60  (step @p129 :rule chain_m_resolution :premises (@p128 @p124 @p86) :args (@t66 @t60 (@list @t62 @t67)))
% 0.36/0.60  (step @p130 :rule eq-symm :args (@t35 @t1))
% 0.36/0.60  (step @p131 :rule cong :premises (@p130) :args (@t36))
% 0.36/0.60  (step @p132 :rule eq_resolve :premises (@p28 @p131))
% 0.36/0.60  (step @p133 :rule instantiate :premises (@p132) :args ((@list @t53)))
% 0.36/0.60  (step @p134 :rule refl :args (@t79))
% 0.36/0.60  (step @p135 :rule refl :args (@t75))
% 0.36/0.60  (step @p136 :rule refl :args (@t80))
% 0.36/0.60  (step @p137 :rule refl :args (@t69))
% 0.36/0.60  (step @p138 :rule bool-double-not-elim :args (@t61))
% 0.36/0.60  (step @p139 :rule nary_cong :premises (@p138 @p137 @p136 @p135 @p134) :args ((or (not @t76) @t69 @t80 @t75 @t79)))
% 0.36/0.60  (assume-push @p210 @t79)
% 0.36/0.60  (assume-push @p211 @t78)
% 0.36/0.60  (step @p142 :rule evaluate :args ((= false true)))
% 0.36/0.60  (step @p143 :rule true_intro :premises (@p133))
% 0.36/0.60  (step @p144 :rule false_intro :premises (@p210))
% 0.36/0.60  (step @p145 :rule symm :premises (@p144))
% 0.36/0.60  (step @p146 :rule trans :premises (@p145 @p143))
% 0.36/0.60  (step @p147 false :rule eq_resolve :premises (@p146 @p142))
% 0.36/0.60  (step-pop @p212 :rule scope :premises (@p147))
% 0.36/0.60  (step-pop @p213 :rule scope :premises (@p212))
% 0.36/0.60  (step @p148 :rule process_scope :premises (@p213) :args (false))
% 0.36/0.60  (assume-push @p214 @t76)
% 0.36/0.60  (assume-push @p215 @t66)
% 0.36/0.60  (assume-push @p216 @t56)
% 0.36/0.60  (assume-push @p217 @t73)
% 0.36/0.60  (assume-push @p218 @t78)
% 0.36/0.60  (assume-push @p219 @t56)
% 0.36/0.60  (assume-push @p220 @t73)
% 0.36/0.60  (assume-push @p221 @t66)
% 0.36/0.60  (assume-push @p222 @t76)
% 0.36/0.60  (step @p160 :rule bool-eq-false :args (@t78))
% 0.36/0.60  (step @p161 :rule symm :premises (@p160))
% 0.36/0.60  (step @p162 :rule eq-symm :args (@t77 @t53))
% 0.36/0.60  (step @p163 :rule cong :premises (@p162) :args ((not @t81)))
% 0.36/0.60  (step @p164 :rule bool-eq-false :args (@t81))
% 0.36/0.60  (step @p165 :rule trans :premises (@p164 @p163))
% 0.36/0.60  (step @p166 :rule trans :premises (@p165 @p161))
% 0.36/0.60  (step @p167 :rule false_intro :premises (@p214))
% 0.36/0.60  (step @p168 :rule refl :args (@t53))
% 0.36/0.60  (step @p169 :rule symm :premises (@p65))
% 0.36/0.60  (step @p170 :rule trans :premises (@p215 @p57))
% 0.36/0.60  (step @p171 :rule cong :premises (@p168 @p170) :args (@t77))
% 0.36/0.60  (step @p172 :rule trans :premises (@p171 @p169))
% 0.36/0.60  (step @p173 :rule cong :premises (@p172 @p168) :args (@t81))
% 0.36/0.60  (step @p174 :rule trans :premises (@p173 @p167))
% 0.36/0.60  (step @p175 :rule eq_resolve :premises (@p174 @p166))
% 0.36/0.60  (step @p176 :rule false_elim :premises (@p175))
% 0.36/0.60  (step-pop @p223 :rule scope :premises (@p176))
% 0.36/0.60  (step-pop @p224 :rule scope :premises (@p223))
% 0.36/0.60  (step-pop @p225 :rule scope :premises (@p224))
% 0.36/0.60  (step-pop @p226 :rule scope :premises (@p225))
% 0.36/0.60  (step @p177 :rule process_scope :premises (@p226) :args (@t79))
% 0.36/0.60  (step @p182 :rule and_intro :premises (@p65 @p57 @p215 @p214))
% 0.36/0.60  (step @p183 :rule modus_ponens :premises (@p182 @p177))
% 0.36/0.60  (step @p184 :rule and_intro :premises (@p183 @p133))
% 0.36/0.60  (step-pop @p227 :rule scope :premises (@p184))
% 0.36/0.60  (step-pop @p228 :rule scope :premises (@p227))
% 0.36/0.60  (step-pop @p229 :rule scope :premises (@p228))
% 0.36/0.60  (step-pop @p230 :rule scope :premises (@p229))
% 0.36/0.60  (step-pop @p231 :rule scope :premises (@p230))
% 0.36/0.60  (step @p185 :rule process_scope :premises (@p231) :args (@t82))
% 0.36/0.60  (step @p191 :rule implies_elim :premises (@p185))
% 0.36/0.60  (step @p192 :rule resolution :premises (@p191 @p148) :args (true @t82))
% 0.36/0.60  (step @p193 :rule not_and :premises (@p192))
% 0.36/0.60  (step @p194 :rule eq_resolve :premises (@p193 @p139))
% 0.36/0.60  (step @p195 false :rule chain_m_resolution :premises (@p194 @p133 @p129 @p126 @p65 @p57) :args (false (@list false false true false false) (@list @t78 @t66 @t61 @t56 @t73)))
% 0.36/0.60  )
% 0.36/0.60  % SZS output end Proof
% 0.36/0.60  % cvc5 exiting
%------------------------------------------------------------------------------