↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SET887+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:55 AM UTC 2026

% Result   : Theorem 0.40s 0.63s
% Output   : Proof 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET887+1 : TPTP v9.2.1. Released v3.2.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.34  % Computer : n022.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Tue Jun  2 16:17:08 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.31/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.63  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.40/0.63  % SZS status Theorem
% 0.40/0.63  % SZS output start Proof
% 0.40/0.63  (
% 0.40/0.63  (declare-sort $$unsorted 0)
% 0.40/0.63  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.40/0.63  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 0.40/0.63  (declare-const tptp.empty_set $$unsorted)
% 0.40/0.63  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.40/0.63  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.40/0.63  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.40/0.63  (define @t1 () (@var "A" $$unsorted))
% 0.40/0.63  (define @t2 () (@var "B" $$unsorted))
% 0.40/0.63  (define @t3 () (not (tptp.in @t2 @t1)))
% 0.40/0.63  (define @t4 () (@list @t1 @t2))
% 0.40/0.63  (define @t5 () (tptp.unordered_pair @t1 @t2))
% 0.40/0.63  (define @t6 () (@list @t2))
% 0.40/0.63  (define @t7 () (= @t1 tptp.empty_set))
% 0.40/0.63  (define @t8 () (@list @t1))
% 0.40/0.63  (define @t9 () (forall @t8 (= @t7 (forall @t6 @t3))))
% 0.40/0.63  (define @t10 () (@var "D" $$unsorted))
% 0.40/0.63  (define @t11 () (or (= @t10 @t1) (= @t10 @t2)))
% 0.40/0.63  (define @t12 () (@var "C" $$unsorted))
% 0.40/0.63  (define @t13 () (tptp.in @t10 @t12))
% 0.40/0.63  (define @t14 () (= @t13 @t11))
% 0.40/0.63  (define @t15 () (@list @t10))
% 0.40/0.63  (define @t16 () (forall @t15 @t14))
% 0.40/0.63  (define @t17 () (= (= @t12 @t5) @t16))
% 0.40/0.63  (define @t18 () (@list @t1 @t2 @t12))
% 0.40/0.63  (define @t19 () (forall @t18 @t17))
% 0.40/0.63  (define @t20 () (tptp.unordered_pair @t2 @t12))
% 0.40/0.63  (define @t21 () (= @t1 @t20))
% 0.40/0.63  (define @t22 () (not @t21))
% 0.40/0.63  (define @t23 () (= @t1 (tptp.singleton @t12)))
% 0.40/0.63  (define @t24 () (not @t23))
% 0.40/0.63  (define @t25 () (= @t1 (tptp.singleton @t2)))
% 0.40/0.63  (define @t26 () (not @t25))
% 0.40/0.63  (define @t27 () (not @t7))
% 0.40/0.63  (define @t28 () (tptp.subset @t1 @t20))
% 0.40/0.63  (define @t29 () (= @t28 (not (and @t27 @t26 @t24 @t22))))
% 0.40/0.63  (define @t30 () (forall @t18 @t29))
% 0.40/0.63  (define @t31 () (tptp.empty @t1))
% 0.40/0.63  (define @t32 () (= @t1 @t10))
% 0.40/0.63  (define @t33 () (not @t32))
% 0.40/0.63  (define @t34 () (= @t1 @t12))
% 0.40/0.63  (define @t35 () (not @t34))
% 0.40/0.63  (define @t36 () (tptp.unordered_pair @t12 @t10))
% 0.40/0.63  (define @t37 () (= @t5 @t36))
% 0.40/0.63  (define @t38 () (@list @t1 @t2 @t12 @t10))
% 0.40/0.63  (define @t39 () (forall @t38 (not (and @t37 @t35 @t33))))
% 0.40/0.63  (define @t40 () (tptp.subset @t5 @t36))
% 0.40/0.63  (define @t41 () (forall @t38 (not (and @t40 @t35 @t33))))
% 0.40/0.63  (define @t42 () (not @t41))
% 0.40/0.63  (define @t43 () (= @t1 @t2))
% 0.40/0.63  (define @t44 () (tptp.singleton @t1))
% 0.40/0.63  (define @t45 () (=> (= @t44 @t20) @t43))
% 0.40/0.63  (define @t46 () (forall @t18 @t45))
% 0.40/0.63  (define @t47 () (= @t20 @t44))
% 0.40/0.63  (define @t48 () (not @t22))
% 0.40/0.63  (define @t49 () (not @t24))
% 0.40/0.63  (define @t50 () (not @t26))
% 0.40/0.63  (define @t51 () (not @t27))
% 0.40/0.63  (define @t52 () (or @t51 @t50 @t49 @t48))
% 0.40/0.63  (define @t53 () (not @t40))
% 0.40/0.63  (define @t54 () (forall @t38 (or @t53 @t34 @t32)))
% 0.40/0.63  (define @t55 () (@quantifiers_skolemize @t54 3))
% 0.40/0.63  (define @t56 () (@quantifiers_skolemize @t54 2))
% 0.40/0.63  (define @t57 () (tptp.unordered_pair @t56 @t55))
% 0.40/0.63  (define @t58 () (@quantifiers_skolemize @t54 1))
% 0.40/0.63  (define @t59 () (@quantifiers_skolemize @t54 0))
% 0.40/0.63  (define @t60 () (tptp.unordered_pair @t59 @t58))
% 0.40/0.63  (define @t61 () (= @t60 @t57))
% 0.40/0.63  (define @t62 () (= @t60 (tptp.singleton @t55)))
% 0.40/0.63  (define @t63 () (= @t60 (tptp.singleton @t56)))
% 0.40/0.63  (define @t64 () (= @t60 tptp.empty_set))
% 0.40/0.63  (define @t65 () (or @t64 @t63 @t62 @t61))
% 0.40/0.63  (define @t66 () (tptp.subset @t60 @t57))
% 0.40/0.63  (define @t67 () (= @t66 @t65))
% 0.40/0.63  (define @t68 () (forall @t18 (= @t28 (or @t7 @t25 @t23 @t21))))
% 0.40/0.63  (define @t69 () (= tptp.empty_set @t60))
% 0.40/0.63  (define @t70 () (or @t69 @t63 @t62 @t61))
% 0.40/0.63  (define @t71 () (= @t66 @t70))
% 0.40/0.63  (define @t72 () (@list false))
% 0.40/0.63  (define @t73 () (not @t33))
% 0.40/0.63  (define @t74 () (not @t35))
% 0.40/0.63  (define @t75 () (or @t53 @t74 @t73))
% 0.40/0.63  (define @t76 () (or @t74 @t73))
% 0.40/0.63  (define @t77 () (not (and @t35 @t33)))
% 0.40/0.63  (define @t78 () (= @t59 @t55))
% 0.40/0.63  (define @t79 () (= @t59 @t56))
% 0.40/0.63  (define @t80 () (not @t66))
% 0.40/0.63  (define @t81 () (or @t80 @t79 @t78))
% 0.40/0.63  (define @t82 () (@list true))
% 0.40/0.63  (define @t83 () (@list @t81))
% 0.40/0.63  (define @t84 () (or (= @t59 @t10) (= @t58 @t10)))
% 0.40/0.63  (define @t85 () (tptp.in @t10 tptp.empty_set))
% 0.40/0.63  (define @t86 () (= @t85 @t84))
% 0.40/0.63  (define @t87 () (forall @t15 @t86))
% 0.40/0.63  (define @t88 () (= @t64 @t87))
% 0.40/0.63  (define @t89 () (forall @t18 (= (= @t5 @t12) (forall @t15 (= @t13 (or @t32 (= @t2 @t10)))))))
% 0.40/0.63  (define @t90 () (forall @t15 (= @t85 (or (= @t10 @t59) (= @t10 @t58)))))
% 0.40/0.63  (define @t91 () (= @t69 @t90))
% 0.40/0.63  (define @t92 () (forall @t6 (not (tptp.in @t2 tptp.empty_set))))
% 0.40/0.63  (define @t93 () (= (= tptp.empty_set tptp.empty_set) @t92))
% 0.40/0.63  (define @t94 () (@list @t58))
% 0.40/0.63  (define @t95 () (tptp.in @t58 tptp.empty_set))
% 0.40/0.63  (define @t96 () (or (= @t58 @t59) (= @t58 @t58)))
% 0.40/0.63  (define @t97 () (= @t95 @t96))
% 0.40/0.63  (define @t98 () (not @t69))
% 0.40/0.63  (define @t99 () (@list true false))
% 0.40/0.63  (define @t100 () (not @t37))
% 0.40/0.63  (define @t101 () (or @t100 @t74 @t73))
% 0.40/0.63  (define @t102 () (not @t61))
% 0.40/0.63  (define @t103 () (or @t102 @t79 @t78))
% 0.40/0.63  (define @t104 () (not @t63))
% 0.40/0.63  (define @t105 () (or @t104 (= @t56 @t59)))
% 0.40/0.63  (define @t106 () (forall @t18 (or (not @t47) @t43)))
% 0.40/0.63  (define @t107 () (or @t104 @t79))
% 0.40/0.63  (define @t108 () (not @t62))
% 0.40/0.63  (define @t109 () (or @t108 @t78))
% 0.40/0.63  (define @t110 () (not @t109))
% 0.40/0.63  (define @t111 () (or @t108 (= @t55 @t59)))
% 0.40/0.63  (assume @p1 (forall @t4 (=> (tptp.in @t1 @t2) @t3)))
% 0.40/0.63  (assume @p2 (forall @t4 (= @t5 (tptp.unordered_pair @t2 @t1))))
% 0.40/0.63  (assume @p3 @t9)
% 0.40/0.63  (assume @p4 @t19)
% 0.40/0.63  (assume @p5 (tptp.empty tptp.empty_set))
% 0.40/0.63  (assume @p6 @t30)
% 0.40/0.63  (assume @p7 (exists @t8 @t31))
% 0.40/0.63  (assume @p8 (exists @t8 (not @t31)))
% 0.40/0.63  (assume @p9 (forall @t4 (tptp.subset @t1 @t1)))
% 0.40/0.63  (assume @p10 @t39)
% 0.40/0.63  (assume @p11 @t42)
% 0.40/0.63  (assume @p12 @t46)
% 0.40/0.63  (assume @p13 true)
% 0.40/0.63  (step @p14 :rule bool-impl-elim :args (@t47 @t43))
% 0.40/0.63  (step @p15 :rule cong :premises (@p14) :args ((forall @t18 (=> @t47 @t43))))
% 0.40/0.63  (step @p16 :rule refl :args (@t43))
% 0.40/0.63  (step @p17 :rule eq-symm :args (@t44 @t20))
% 0.40/0.63  (step @p18 :rule cong :premises (@p17 @p16) :args (@t45))
% 0.40/0.63  (step @p19 :rule cong :premises (@p18) :args (@t46))
% 0.40/0.63  (step @p20 :rule trans :premises (@p19 @p15))
% 0.40/0.63  (step @p21 :rule eq_resolve :premises (@p12 @p20))
% 0.40/0.63  (step @p22 :rule bool-double-not-elim :args (@t21))
% 0.40/0.63  (step @p23 :rule bool-double-not-elim :args (@t23))
% 0.40/0.63  (step @p24 :rule bool-double-not-elim :args (@t25))
% 0.40/0.63  (step @p25 :rule bool-double-not-elim :args (@t7))
% 0.40/0.63  (step @p26 :rule nary_cong :premises (@p25 @p24 @p23 @p22) :args (@t52))
% 0.40/0.63  (step @p27 :rule aci_norm :args ((= (or @t51 (or @t50 (or @t49 @t48))) @t52)))
% 0.40/0.63  (step @p28 :rule trans :premises (@p27 @p26))
% 0.40/0.63  (step @p29 :rule bool-and-de-morgan :args (@t24 @t22 true))
% 0.40/0.63  (step @p30 :rule refl :args (@t50))
% 0.40/0.64  (step @p31 :rule nary_cong :premises (@p30 @p29) :args ((or @t50 (not (and @t24 @t22)))))
% 0.40/0.64  (step @p32 :rule bool-and-de-morgan :args (@t26 @t24 (and @t22)))
% 0.40/0.64  (step @p33 :rule trans :premises (@p32 @p31))
% 0.40/0.64  (step @p34 :rule refl :args (@t51))
% 0.40/0.64  (step @p35 :rule nary_cong :premises (@p34 @p33) :args ((or @t51 (not (and @t26 @t24 @t22)))))
% 0.40/0.64  (step @p36 :rule bool-and-de-morgan :args (@t27 @t26 (and @t24 @t22)))
% 0.40/0.64  (step @p37 :rule trans :premises (@p36 @p35))
% 0.40/0.64  (step @p38 :rule trans :premises (@p37 @p28))
% 0.40/0.64  (step @p39 :rule refl :args (@t28))
% 0.40/0.64  (step @p40 :rule cong :premises (@p39 @p38) :args (@t29))
% 0.40/0.64  (step @p41 :rule cong :premises (@p40) :args (@t30))
% 0.40/0.64  (step @p42 :rule eq_resolve :premises (@p6 @p41))
% 0.40/0.64  (step @p43 :rule refl :args (@t61))
% 0.40/0.64  (step @p44 :rule refl :args (@t62))
% 0.40/0.64  (step @p45 :rule refl :args (@t63))
% 0.40/0.64  (step @p46 :rule eq-symm :args (@t60 tptp.empty_set))
% 0.40/0.64  (step @p47 :rule nary_cong :premises (@p46 @p45 @p44 @p43) :args (@t65))
% 0.40/0.64  (step @p48 :rule refl :args (@t66))
% 0.40/0.64  (step @p49 :rule cong :premises (@p48 @p47) :args (@t67))
% 0.40/0.64  (step @p50 :rule refl :args (@t68))
% 0.40/0.64  (step @p51 :rule cong :premises (@p50 @p49) :args ((=> @t68 @t67)))
% 0.40/0.64  (assume-push @p198 @t68)
% 0.40/0.64  (step @p53 :rule instantiate :premises (@p42) :args ((@list @t60 @t56 @t55)))
% 0.40/0.64  (step-pop @p199 :rule scope :premises (@p53))
% 0.40/0.64  (step @p54 :rule process_scope :premises (@p199) :args (@t67))
% 0.40/0.64  (step @p56 :rule eq_resolve :premises (@p54 @p51))
% 0.40/0.64  (step @p57 :rule implies_elim :premises (@p56))
% 0.40/0.64  (step @p58 :rule chain_m_resolution :premises (@p57 @p42) :args (@t71 @t72 (@list @t68)))
% 0.40/0.64  (step @p59 :rule bool-double-not-elim :args (@t32))
% 0.40/0.64  (step @p60 :rule bool-double-not-elim :args (@t34))
% 0.40/0.64  (step @p61 :rule refl :args (@t53))
% 0.40/0.64  (step @p62 :rule nary_cong :premises (@p61 @p60 @p59) :args (@t75))
% 0.40/0.64  (step @p63 :rule aci_norm :args ((= (or @t53 @t76) @t75)))
% 0.40/0.64  (step @p64 :rule trans :premises (@p63 @p62))
% 0.40/0.64  (step @p65 :rule bool-and-de-morgan :args (@t35 @t33 true))
% 0.40/0.64  (step @p66 :rule nary_cong :premises (@p61 @p65) :args ((or @t53 @t77)))
% 0.40/0.64  (step @p67 :rule bool-and-de-morgan :args (@t40 @t35 (and @t33)))
% 0.40/0.64  (step @p68 :rule trans :premises (@p67 @p66))
% 0.40/0.64  (step @p69 :rule trans :premises (@p68 @p64))
% 0.40/0.64  (step @p70 :rule cong :premises (@p69) :args (@t41))
% 0.40/0.64  (step @p71 :rule cong :premises (@p70) :args (@t42))
% 0.40/0.64  (step @p72 :rule eq_resolve :premises (@p11 @p71))
% 0.40/0.64  (step @p73 :rule skolemize :premises (@p72))
% 0.40/0.64  (step @p74 :rule bool-double-not-elim :args (@t66))
% 0.40/0.64  (step @p75 :rule refl :args (@t81))
% 0.40/0.64  (step @p76 :rule nary_cong :premises (@p75 @p74) :args ((or @t81 (not @t80))))
% 0.40/0.64  (step @p77 :rule cnf_or_neg :args (@t81 0))
% 0.40/0.64  (step @p78 :rule eq_resolve :premises (@p77 @p76))
% 0.40/0.64  (step @p79 :rule reordering :premises (@p78) :args ((or @t66 @t81)))
% 0.40/0.64  (step @p80 :rule chain_m_resolution :premises (@p79 @p73) :args (@t66 @t82 @t83))
% 0.40/0.64  (step @p81 :rule cnf_equiv_pos1 :args (@t71))
% 0.40/0.64  (step @p82 :rule reordering :premises (@p81) :args ((or @t80 @t70 (not @t71))))
% 0.40/0.64  (step @p83 :rule chain_m_resolution :premises (@p82 @p80 @p58) :args (@t70 (@list false false) (@list @t66 @t71)))
% 0.40/0.64  (step @p84 :rule eq-symm :args (@t10 @t2))
% 0.40/0.64  (step @p85 :rule eq-symm :args (@t10 @t1))
% 0.40/0.64  (step @p86 :rule nary_cong :premises (@p85 @p84) :args (@t11))
% 0.40/0.64  (step @p87 :rule refl :args (@t13))
% 0.40/0.64  (step @p88 :rule cong :premises (@p87 @p86) :args (@t14))
% 0.40/0.64  (step @p89 :rule cong :premises (@p88) :args (@t16))
% 0.40/0.64  (step @p90 :rule eq-symm :args (@t12 @t5))
% 0.40/0.64  (step @p91 :rule cong :premises (@p90 @p89) :args (@t17))
% 0.40/0.64  (step @p92 :rule cong :premises (@p91) :args (@t19))
% 0.40/0.64  (step @p93 :rule eq_resolve :premises (@p4 @p92))
% 0.40/0.64  (step @p94 :rule eq-symm :args (@t58 @t10))
% 0.40/0.64  (step @p95 :rule eq-symm :args (@t59 @t10))
% 0.40/0.64  (step @p96 :rule nary_cong :premises (@p95 @p94) :args (@t84))
% 0.40/0.64  (step @p97 :rule refl :args (@t85))
% 0.40/0.64  (step @p98 :rule cong :premises (@p97 @p96) :args (@t86))
% 0.40/0.64  (step @p99 :rule cong :premises (@p98) :args (@t87))
% 0.40/0.64  (step @p100 :rule cong :premises (@p46 @p99) :args (@t88))
% 0.40/0.64  (step @p101 :rule refl :args (@t89))
% 0.40/0.64  (step @p102 :rule cong :premises (@p101 @p100) :args ((=> @t89 @t88)))
% 0.40/0.64  (assume-push @p200 @t89)
% 0.40/0.64  (step @p104 :rule instantiate :premises (@p93) :args ((@list @t59 @t58 tptp.empty_set)))
% 0.40/0.64  (step-pop @p201 :rule scope :premises (@p104))
% 0.40/0.64  (step @p105 :rule process_scope :premises (@p201) :args (@t88))
% 0.40/0.64  (step @p107 :rule eq_resolve :premises (@p105 @p102))
% 0.40/0.64  (step @p108 :rule implies_elim :premises (@p107))
% 0.40/0.64  (step @p109 :rule chain_m_resolution :premises (@p108 @p93) :args (@t91 @t72 (@list @t89)))
% 0.40/0.64  (step @p110 :rule bool-eq-true :args (@t92))
% 0.40/0.64  (step @p111 :rule eq-symm :args (true @t92))
% 0.40/0.64  (step @p112 :rule trans :premises (@p111 @p110))
% 0.40/0.64  (step @p113 :rule refl :args (@t92))
% 0.40/0.64  (step @p114 :rule eq-refl :args (tptp.empty_set))
% 0.40/0.64  (step @p115 :rule cong :premises (@p114 @p113) :args (@t93))
% 0.40/0.64  (step @p116 :rule trans :premises (@p115 @p112))
% 0.40/0.64  (step @p117 :rule refl :args (@t9))
% 0.40/0.64  (step @p118 :rule cong :premises (@p117 @p116) :args ((=> @t9 @t93)))
% 0.40/0.64  (assume-push @p202 @t9)
% 0.40/0.64  (step @p120 :rule instantiate :premises (@p3) :args ((@list tptp.empty_set)))
% 0.40/0.64  (step-pop @p203 :rule scope :premises (@p120))
% 0.40/0.64  (step @p121 :rule process_scope :premises (@p203) :args (@t93))
% 0.40/0.64  (step @p123 :rule eq_resolve :premises (@p121 @p118))
% 0.40/0.64  (step @p124 :rule implies_elim :premises (@p123))
% 0.40/0.64  (step @p125 :rule chain_m_resolution :premises (@p124 @p3) :args (@t92 @t72 (@list @t9)))
% 0.40/0.64  (step @p126 :rule instantiate :premises (@p125) :args (@t94))
% 0.40/0.64  (step @p127 :rule bool-eq-true :args (@t95))
% 0.40/0.64  (step @p128 :rule absorb :args ((= (or (= @t59 @t58) true) true)))
% 0.40/0.64  (step @p129 :rule eq-refl :args (@t58))
% 0.40/0.64  (step @p130 :rule eq-symm :args (@t58 @t59))
% 0.40/0.64  (step @p131 :rule nary_cong :premises (@p130 @p129) :args (@t96))
% 0.40/0.64  (step @p132 :rule trans :premises (@p131 @p128))
% 0.40/0.64  (step @p133 :rule refl :args (@t95))
% 0.40/0.64  (step @p134 :rule cong :premises (@p133 @p132) :args (@t97))
% 0.40/0.64  (step @p135 :rule trans :premises (@p134 @p127))
% 0.40/0.64  (step @p136 :rule refl :args (@t90))
% 0.40/0.64  (step @p137 :rule cong :premises (@p136 @p135) :args ((=> @t90 @t97)))
% 0.40/0.64  (assume-push @p204 @t90)
% 0.40/0.64  (step @p139 :rule instantiate :premises (@p204) :args (@t94))
% 0.40/0.64  (step-pop @p205 :rule scope :premises (@p139))
% 0.40/0.64  (step @p140 :rule process_scope :premises (@p205) :args (@t97))
% 0.40/0.64  (step @p142 :rule eq_resolve :premises (@p140 @p137))
% 0.40/0.64  (step @p143 :rule implies_elim :premises (@p142))
% 0.40/0.64  (step @p144 :rule chain_m_resolution :premises (@p143 @p126) :args ((not @t90) @t82 (@list @t95)))
% 0.40/0.64  (step @p145 :rule cnf_equiv_pos1 :args (@t91))
% 0.40/0.64  (step @p146 :rule reordering :premises (@p145) :args ((or @t98 @t90 (not @t91))))
% 0.40/0.64  (step @p147 :rule chain_m_resolution :premises (@p146 @p144 @p109) :args (@t98 @t99 (@list @t90 @t91)))
% 0.40/0.64  (step @p148 :rule refl :args (@t100))
% 0.40/0.64  (step @p149 :rule nary_cong :premises (@p148 @p60 @p59) :args (@t101))
% 0.40/0.64  (step @p150 :rule aci_norm :args ((= (or @t100 @t76) @t101)))
% 0.40/0.64  (step @p151 :rule trans :premises (@p150 @p149))
% 0.40/0.64  (step @p152 :rule nary_cong :premises (@p148 @p65) :args ((or @t100 @t77)))
% 0.40/0.64  (step @p153 :rule bool-and-de-morgan :args (@t37 @t35 (and @t33)))
% 0.40/0.64  (step @p154 :rule trans :premises (@p153 @p152))
% 0.40/0.64  (step @p155 :rule trans :premises (@p154 @p151))
% 0.40/0.64  (step @p156 :rule cong :premises (@p155) :args (@t39))
% 0.40/0.64  (step @p157 :rule eq_resolve :premises (@p10 @p156))
% 0.40/0.64  (step @p158 :rule instantiate :premises (@p157) :args ((@list @t59 @t58 @t56 @t55)))
% 0.40/0.64  (step @p159 :rule cnf_or_neg :args (@t81 2))
% 0.40/0.64  (step @p160 :rule chain_m_resolution :premises (@p159 @p73) :args ((not @t78) @t82 @t83))
% 0.40/0.64  (step @p161 :rule cnf_or_neg :args (@t81 1))
% 0.40/0.64  (step @p162 :rule chain_m_resolution :premises (@p161 @p73) :args ((not @t79) @t82 @t83))
% 0.40/0.64  (step @p163 :rule cnf_or_pos :args (@t103))
% 0.40/0.64  (step @p164 :rule reordering :premises (@p163) :args ((or @t79 @t78 @t102 (not @t103))))
% 0.40/0.64  (step @p165 :rule chain_m_resolution :premises (@p164 @p162 @p160 @p158) :args (@t102 (@list true true false) (@list @t79 @t78 @t103)))
% 0.40/0.64  (step @p166 :rule eq-symm :args (@t56 @t59))
% 0.40/0.64  (step @p167 :rule refl :args (@t104))
% 0.40/0.64  (step @p168 :rule nary_cong :premises (@p167 @p166) :args (@t105))
% 0.40/0.64  (step @p169 :rule refl :args (@t106))
% 0.40/0.64  (step @p170 :rule cong :premises (@p169 @p168) :args ((=> @t106 @t105)))
% 0.40/0.64  (assume-push @p206 @t106)
% 0.40/0.64  (step @p172 :rule instantiate :premises (@p21) :args ((@list @t56 @t59 @t58)))
% 0.40/0.64  (step-pop @p207 :rule scope :premises (@p172))
% 0.40/0.64  (step @p173 :rule process_scope :premises (@p207) :args (@t105))
% 0.40/0.64  (step @p175 :rule eq_resolve :premises (@p173 @p170))
% 0.40/0.64  (step @p176 :rule implies_elim :premises (@p175))
% 0.40/0.64  (step @p177 :rule chain_m_resolution :premises (@p176 @p21) :args (@t107 @t72 (@list @t106)))
% 0.40/0.64  (step @p178 :rule cnf_or_pos :args (@t107))
% 0.40/0.64  (step @p179 :rule reordering :premises (@p178) :args ((or @t79 @t104 (not @t107))))
% 0.40/0.64  (step @p180 :rule chain_m_resolution :premises (@p179 @p162 @p177) :args (@t104 @t99 (@list @t79 @t107)))
% 0.40/0.64  (step @p181 :rule cnf_or_pos :args (@t70))
% 0.40/0.64  (step @p182 :rule reordering :premises (@p181) :args ((or @t63 @t62 @t61 @t69 (not @t70))))
% 0.40/0.64  (step @p183 :rule chain_m_resolution :premises (@p182 @p180 @p165 @p147 @p83) :args (@t62 (@list true true true false) (@list @t63 @t61 @t69 @t70)))
% 0.40/0.64  (step @p184 :rule cnf_or_pos :args (@t109))
% 0.40/0.64  (step @p185 :rule reordering :premises (@p184) :args ((or @t78 @t108 @t110)))
% 0.40/0.64  (step @p186 :rule chain_m_resolution :premises (@p185 @p160 @p183) :args (@t110 @t99 (@list @t78 @t62)))
% 0.40/0.64  (step @p187 :rule eq-symm :args (@t55 @t59))
% 0.40/0.64  (step @p188 :rule refl :args (@t108))
% 0.40/0.64  (step @p189 :rule nary_cong :premises (@p188 @p187) :args (@t111))
% 0.40/0.64  (step @p190 :rule cong :premises (@p169 @p189) :args ((=> @t106 @t111)))
% 0.40/0.64  (assume-push @p208 @t106)
% 0.40/0.64  (step @p192 :rule instantiate :premises (@p21) :args ((@list @t55 @t59 @t58)))
% 0.40/0.64  (step-pop @p209 :rule scope :premises (@p192))
% 0.40/0.64  (step @p193 :rule process_scope :premises (@p209) :args (@t111))
% 0.40/0.64  (step @p195 :rule eq_resolve :premises (@p193 @p190))
% 0.40/0.64  (step @p196 :rule implies_elim :premises (@p195))
% 0.40/0.64  (step @p197 false :rule chain_m_resolution :premises (@p196 @p186 @p21) :args (false @t99 (@list @t109 @t106)))
% 0.40/0.64  )
% 0.40/0.64  % SZS output end Proof
% 0.40/0.64  % cvc5 exiting
%------------------------------------------------------------------------------