↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n009.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:14:24 AM UTC 2026

% Result   : Theorem 0.87s 1.06s
% Output   : Proof 0.87s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : DAT044_1 : TPTP v9.2.1. Released v5.0.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.34  % Computer : n009.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Mon Jun  1 22:26:59 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.32/0.50  %----Proving TF0_ARI
% 0.87/1.06  --- Run --finite-model-find --decision=internal at 45...
% 0.87/1.06  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 60...
% 0.87/1.06  % SZS status Theorem
% 0.87/1.06  % SZS output start Proof
% 0.87/1.06  (
% 0.87/1.06  (declare-sort tptp.collection 0)
% 0.87/1.06  (declare-const tptp.count (-> tptp.collection Int))
% 0.87/1.06  (declare-const tptp.remove (-> Int tptp.collection tptp.collection))
% 0.87/1.06  (declare-const tptp.add (-> Int tptp.collection tptp.collection))
% 0.87/1.06  (declare-const tptp.in (-> Int tptp.collection Bool))
% 0.87/1.06  (declare-const tptp.empty tptp.collection)
% 0.87/1.06  (define @t1 () (@var "U" Int))
% 0.87/1.06  (define @t2 () (@var "W" tptp.collection))
% 0.87/1.06  (define @t3 () (@var "V" Int))
% 0.87/1.06  (define @t4 () (@var "Y" tptp.collection))
% 0.87/1.06  (define @t5 () (@var "X" Int))
% 0.87/1.06  (define @t6 () (@var "X1" tptp.collection))
% 0.87/1.06  (define @t7 () (@var "X2" Int))
% 0.87/1.06  (define @t8 () (@var "Z" Int))
% 0.87/1.06  (define @t9 () (@var "X4" tptp.collection))
% 0.87/1.06  (define @t10 () (@var "X5" Int))
% 0.87/1.06  (define @t11 () (@var "X3" Int))
% 0.87/1.06  (define @t12 () (@var "X6" tptp.collection))
% 0.87/1.06  (define @t13 () (@var "X7" tptp.collection))
% 0.87/1.06  (define @t14 () (@var "X9" tptp.collection))
% 0.87/1.06  (define @t15 () (tptp.count @t14))
% 0.87/1.06  (define @t16 () (+ @t15 1))
% 0.87/1.06  (define @t17 () (@var "X8" Int))
% 0.87/1.06  (define @t18 () (tptp.count (tptp.add @t17 @t14)))
% 0.87/1.06  (define @t19 () (= @t18 @t16))
% 0.87/1.06  (define @t20 () (not (tptp.in @t17 @t14)))
% 0.87/1.06  (define @t21 () (= @t20 @t19))
% 0.87/1.06  (define @t22 () (forall (@list @t17 @t14) @t21))
% 0.87/1.06  (define @t23 () (@var "X11" tptp.collection))
% 0.87/1.06  (define @t24 () (@var "X10" Int))
% 0.87/1.06  (define @t25 () (@var "X13" tptp.collection))
% 0.87/1.06  (define @t26 () (@var "X12" Int))
% 0.87/1.06  (define @t27 () (@var "X15" tptp.collection))
% 0.87/1.06  (define @t28 () (@var "X14" Int))
% 0.87/1.06  (define @t29 () (@var "X17" tptp.collection))
% 0.87/1.06  (define @t30 () (@var "X16" Int))
% 0.87/1.06  (define @t31 () (@var "U" tptp.collection))
% 0.87/1.06  (define @t32 () (tptp.count @t31))
% 0.87/1.06  (define @t33 () (tptp.count (tptp.add @t3 @t31)))
% 0.87/1.06  (define @t34 () (@var "W" Int))
% 0.87/1.06  (define @t35 () (tptp.in @t34 @t31))
% 0.87/1.06  (define @t36 () (=> @t35 (> @t3 @t34)))
% 0.87/1.06  (define @t37 () (@list @t34))
% 0.87/1.06  (define @t38 () (forall @t37 @t36))
% 0.87/1.06  (define @t39 () (=> @t38 (> @t33 @t32)))
% 0.87/1.06  (define @t40 () (@list @t31 @t3))
% 0.87/1.06  (define @t41 () (forall @t40 @t39))
% 0.87/1.06  (define @t42 () (not @t41))
% 0.87/1.06  (define @t43 () (* -1 @t34))
% 0.87/1.06  (define @t44 () (+ @t3 @t43))
% 0.87/1.06  (define @t45 () (>= @t44 1))
% 0.87/1.06  (define @t46 () (forall @t37 (or (not @t35) @t45)))
% 0.87/1.06  (define @t47 () (+ @t33 (* -1 @t32)))
% 0.87/1.06  (define @t48 () (>= @t47 1))
% 0.87/1.06  (define @t49 () (+ @t32 1))
% 0.87/1.06  (define @t50 () (>= @t33 @t49))
% 0.87/1.06  (define @t51 () (+ @t34 1))
% 0.87/1.06  (define @t52 () (>= @t3 @t51))
% 0.87/1.06  (define @t53 () (forall @t40 (or (not @t46) @t48)))
% 0.87/1.06  (define @t54 () (@quantifiers_skolemize @t53 0))
% 0.87/1.06  (define @t55 () (tptp.count @t54))
% 0.87/1.06  (define @t56 () (@quantifiers_skolemize @t53 1))
% 0.87/1.06  (define @t57 () (tptp.count (tptp.add @t56 @t54)))
% 0.87/1.06  (define @t58 () (+ @t57 (* -1 @t55)))
% 0.87/1.06  (define @t59 () (>= @t58 1))
% 0.87/1.06  (define @t60 () (* -1 @t56))
% 0.87/1.06  (define @t61 () (+ @t34 @t60))
% 0.87/1.06  (define @t62 () (not (tptp.in @t34 @t54)))
% 0.87/1.06  (define @t63 () (forall @t37 (or @t62 (not (>= @t61 0)))))
% 0.87/1.06  (define @t64 () (not @t63))
% 0.87/1.06  (define @t65 () (or @t64 @t59))
% 0.87/1.06  (define @t66 () (not @t65))
% 0.87/1.06  (define @t67 () (not @t53))
% 0.87/1.06  (define @t68 () (+ @t43 @t56))
% 0.87/1.06  (define @t69 () (+ @t61 1))
% 0.87/1.06  (define @t70 () (+ @t56 @t43))
% 0.87/1.06  (define @t71 () (>= @t70 1))
% 0.87/1.06  (define @t72 () (or @t62 @t71))
% 0.87/1.06  (define @t73 () (forall @t37 @t72))
% 0.87/1.06  (define @t74 () (not @t73))
% 0.87/1.06  (define @t75 () (or @t74 @t59))
% 0.87/1.06  (define @t76 () (not @t75))
% 0.87/1.06  (define @t77 () (@list true))
% 0.87/1.06  (define @t78 () (@list @t65))
% 0.87/1.06  (define @t79 () (not @t59))
% 0.87/1.06  (define @t80 () (+ 1 @t55))
% 0.87/1.06  (define @t81 () (= @t57 @t80))
% 0.87/1.06  (define @t82 () (not @t81))
% 0.87/1.06  (define @t83 () (= @t58 1))
% 0.87/1.06  (define @t84 () (* -1 1))
% 0.87/1.06  (define @t85 () (+ @t84 0))
% 0.87/1.06  (define @t86 () (* 0 @t57))
% 0.87/1.06  (define @t87 () (* 0 @t55))
% 0.87/1.06  (define @t88 () (+ @t87 @t86))
% 0.87/1.06  (define @t89 () (+ (* -1 @t58) @t58))
% 0.87/1.06  (define @t90 () (and @t81 @t79))
% 0.87/1.06  (define @t91 () (tptp.in @t56 @t54))
% 0.87/1.06  (define @t92 () (not @t91))
% 0.87/1.06  (define @t93 () (= @t92 @t81))
% 0.87/1.06  (define @t94 () (not @t93))
% 0.87/1.06  (define @t95 () (+ @t56 @t60))
% 0.87/1.06  (define @t96 () (>= @t95 0))
% 0.87/1.06  (define @t97 () (not @t96))
% 0.87/1.06  (define @t98 () (or @t92 @t97))
% 0.87/1.06  (assume @p1 (forall (@list @t1) (not (tptp.in @t1 tptp.empty))))
% 0.87/1.06  (assume @p2 (forall (@list @t3 @t2) (tptp.in @t3 (tptp.add @t3 @t2))))
% 0.87/1.06  (assume @p3 (forall (@list @t5 @t4) (not (tptp.in @t5 (tptp.remove @t5 @t4)))))
% 0.87/1.06  (assume @p4 (forall (@list @t8 @t6 @t7) (= (or (tptp.in @t8 @t6) (= @t8 @t7)) (tptp.in @t8 (tptp.add @t7 @t6)))))
% 0.87/1.06  (assume @p5 (forall (@list @t11 @t9 @t10) (= (and (tptp.in @t11 @t9) (not (= @t11 @t10))) (tptp.in @t11 (tptp.remove @t10 @t9)))))
% 0.87/1.06  (assume @p6 (forall (@list @t12) (>= (tptp.count @t12) 0)))
% 0.87/1.06  (assume @p7 (forall (@list @t13) (= (= @t13 tptp.empty) (= (tptp.count @t13) 0))))
% 0.87/1.06  (assume @p8 @t22)
% 0.87/1.06  (assume @p9 (forall (@list @t24 @t23) (= (tptp.in @t24 @t23) (= (tptp.count (tptp.add @t24 @t23)) (tptp.count @t23)))))
% 0.87/1.06  (assume @p10 (forall (@list @t26 @t25) (= (tptp.in @t26 @t25) (= (tptp.count (tptp.remove @t26 @t25)) (- (tptp.count @t25) 1)))))
% 0.87/1.06  (assume @p11 (forall (@list @t28 @t27) (= (not (tptp.in @t28 @t27)) (= (tptp.count (tptp.remove @t28 @t27)) (tptp.count @t27)))))
% 0.87/1.06  (assume @p12 (forall (@list @t30 @t29) (=> (tptp.in @t30 @t29) (= @t29 (tptp.add @t30 (tptp.remove @t30 @t29))))))
% 0.87/1.06  (assume @p13 @t42)
% 0.87/1.06  (assume @p14 true)
% 0.87/1.06  (step @p15 :rule bool-impl-elim :args (@t46 @t48))
% 0.87/1.06  (step @p16 :rule cong :premises (@p15) :args ((forall @t40 (=> @t46 @t48))))
% 0.87/1.06  (step @p17 :rule bool-double-not-elim :args (@t48))
% 0.87/1.06  (step @p18 :rule arith_poly_norm :args ((= (* -1 (- @t33 @t49)) (* -1 (- @t47 1)))))
% 0.87/1.06  (step @p19 :rule arith_poly_norm_rel :premises (@p18) :args ((= @t50 @t48)))
% 0.87/1.06  (step @p20 :rule cong :premises (@p19) :args ((not @t50)))
% 0.87/1.06  (step @p21 :rule arith-leq-norm :args (@t33 @t32))
% 0.87/1.06  (step @p22 :rule trans :premises (@p21 @p20))
% 0.87/1.06  (step @p23 :rule cong :premises (@p22) :args ((not (<= @t33 @t32))))
% 0.87/1.06  (step @p24 :rule trans :premises (@p23 @p17))
% 0.87/1.06  (step @p25 :rule arith-elim-leq :args (@t33 @t32))
% 0.87/1.06  (step @p26 :rule symm :premises (@p25))
% 0.87/1.06  (step @p27 :rule cong :premises (@p26) :args ((not (>= @t32 @t33))))
% 0.87/1.06  (step @p28 :rule arith-elim-gt :args (@t33 @t32))
% 0.87/1.06  (step @p29 :rule trans :premises (@p28 @p27))
% 0.87/1.06  (step @p30 :rule trans :premises (@p29 @p24))
% 0.87/1.06  (step @p31 :rule bool-impl-elim :args (@t35 @t45))
% 0.87/1.06  (step @p32 :rule cong :premises (@p31) :args ((forall @t37 (=> @t35 @t45))))
% 0.87/1.06  (step @p33 :rule bool-double-not-elim :args (@t45))
% 0.87/1.06  (step @p34 :rule arith_poly_norm :args ((= (* -1 (- @t3 @t51)) (* -1 (- @t44 1)))))
% 0.87/1.06  (step @p35 :rule arith_poly_norm_rel :premises (@p34) :args ((= @t52 @t45)))
% 0.87/1.06  (step @p36 :rule cong :premises (@p35) :args ((not @t52)))
% 0.87/1.06  (step @p37 :rule arith-leq-norm :args (@t3 @t34))
% 0.87/1.06  (step @p38 :rule trans :premises (@p37 @p36))
% 0.87/1.06  (step @p39 :rule cong :premises (@p38) :args ((not (<= @t3 @t34))))
% 0.87/1.06  (step @p40 :rule trans :premises (@p39 @p33))
% 0.87/1.06  (step @p41 :rule arith-elim-leq :args (@t3 @t34))
% 0.87/1.06  (step @p42 :rule symm :premises (@p41))
% 0.87/1.06  (step @p43 :rule cong :premises (@p42) :args ((not (>= @t34 @t3))))
% 0.87/1.06  (step @p44 :rule arith-elim-gt :args (@t3 @t34))
% 0.87/1.06  (step @p45 :rule trans :premises (@p44 @p43))
% 0.87/1.06  (step @p46 :rule trans :premises (@p45 @p40))
% 0.87/1.06  (step @p47 :rule refl :args (@t35))
% 0.87/1.06  (step @p48 :rule cong :premises (@p47 @p46) :args (@t36))
% 0.87/1.06  (step @p49 :rule cong :premises (@p48) :args (@t38))
% 0.87/1.06  (step @p50 :rule trans :premises (@p49 @p32))
% 0.87/1.06  (step @p51 :rule cong :premises (@p50 @p30) :args (@t39))
% 0.87/1.06  (step @p52 :rule cong :premises (@p51) :args (@t41))
% 0.87/1.06  (step @p53 :rule trans :premises (@p52 @p16))
% 0.87/1.06  (step @p54 :rule cong :premises (@p53) :args (@t42))
% 0.87/1.06  (step @p55 :rule eq_resolve :premises (@p13 @p54))
% 0.87/1.06  (step @p56 :rule refl :args (@t66))
% 0.87/1.06  (step @p57 :rule bool-double-not-elim :args (@t53))
% 0.87/1.06  (step @p58 :rule nary_cong :premises (@p57 @p56) :args ((or (not @t67) @t66)))
% 0.87/1.06  (step @p59 :rule refl :args (@t59))
% 0.87/1.06  (step @p60 :rule arith_poly_norm :args ((= (* -1 (- 0 @t69)) (* -1 (- @t68 1)))))
% 0.87/1.06  (step @p61 :rule arith_poly_norm_rel :premises (@p60) :args ((= (>= 0 @t69) (>= @t68 1))))
% 0.87/1.06  (step @p62 :rule arith-geq-tighten :args (@t61 0))
% 0.87/1.06  (step @p63 :rule trans :premises (@p62 @p61))
% 0.87/1.06  (step @p64 :rule symm :premises (@p63))
% 0.87/1.06  (step @p65 :rule refl :args (1))
% 0.87/1.06  (step @p66 :rule arith_poly_norm :args ((= @t70 @t68)))
% 0.87/1.06  (step @p67 :rule cong :premises (@p66 @p65) :args (@t71))
% 0.87/1.06  (step @p68 :rule trans :premises (@p67 @p64))
% 0.87/1.06  (step @p69 :rule refl :args (@t62))
% 0.87/1.06  (step @p70 :rule nary_cong :premises (@p69 @p68) :args (@t72))
% 0.87/1.06  (step @p71 :rule cong :premises (@p70) :args (@t73))
% 0.87/1.06  (step @p72 :rule cong :premises (@p71) :args (@t74))
% 0.87/1.06  (step @p73 :rule nary_cong :premises (@p72 @p59) :args (@t75))
% 0.87/1.06  (step @p74 :rule cong :premises (@p73) :args (@t76))
% 0.87/1.06  (step @p75 :rule refl :args (@t67))
% 0.87/1.06  (step @p76 :rule cong :premises (@p75 @p74) :args ((=> @t67 @t76)))
% 0.87/1.06  (assume-push @p183 @t67)
% 0.87/1.06  (step @p78 :rule skolemize :premises (@p55))
% 0.87/1.06  (step-pop @p184 :rule scope :premises (@p78))
% 0.87/1.06  (step @p79 :rule process_scope :premises (@p184) :args (@t76))
% 0.87/1.06  (step @p81 :rule eq_resolve :premises (@p79 @p76))
% 0.87/1.06  (step @p82 :rule implies_elim :premises (@p81))
% 0.87/1.06  (step @p83 :rule eq_resolve :premises (@p82 @p58))
% 0.87/1.06  (step @p84 :rule chain_m_resolution :premises (@p83 @p55) :args (@t66 @t77 (@list @t53)))
% 0.87/1.06  (step @p85 :rule bool-double-not-elim :args (@t63))
% 0.87/1.06  (step @p86 :rule refl :args (@t65))
% 0.87/1.06  (step @p87 :rule nary_cong :premises (@p86 @p85) :args ((or @t65 (not @t64))))
% 0.87/1.06  (step @p88 :rule cnf_or_neg :args (@t65 0))
% 0.87/1.06  (step @p89 :rule eq_resolve :premises (@p88 @p87))
% 0.87/1.06  (step @p90 :rule reordering :premises (@p89) :args ((or @t63 @t65)))
% 0.87/1.06  (step @p91 :rule chain_m_resolution :premises (@p90 @p84) :args (@t63 @t77 @t78))
% 0.87/1.06  (step @p92 :rule arith_poly_norm :args ((= @t16 (+ 1 @t15))))
% 0.87/1.06  (step @p93 :rule refl :args (@t18))
% 0.87/1.06  (step @p94 :rule cong :premises (@p93 @p92) :args (@t19))
% 0.87/1.06  (step @p95 :rule refl :args (@t20))
% 0.87/1.06  (step @p96 :rule cong :premises (@p95 @p94) :args (@t21))
% 0.87/1.06  (step @p97 :rule cong :premises (@p96) :args (@t22))
% 0.87/1.06  (step @p98 :rule eq_resolve :premises (@p8 @p97))
% 0.87/1.06  (step @p99 :rule instantiate :premises (@p98) :args ((@list @t56 @t54)))
% 0.87/1.06  (step @p100 :rule cnf_or_neg :args (@t65 1))
% 0.87/1.06  (step @p101 :rule chain_m_resolution :premises (@p100 @p84) :args (@t79 @t77 @t78))
% 0.87/1.06  (step @p102 :rule refl :args (@t82))
% 0.87/1.06  (step @p103 :rule bool-double-not-elim :args (@t59))
% 0.87/1.06  (step @p104 :rule nary_cong :premises (@p103 @p102) :args ((or (not @t79) @t82)))
% 0.87/1.06  (assume-push @p185 @t81)
% 0.87/1.06  (assume-push @p186 @t79)
% 0.87/1.06  (assume-push @p187 @t83)
% 0.87/1.06  (step @p108 :rule evaluate :args ((<= 0 -1)))
% 0.87/1.06  (step @p109 :rule evaluate :args ((+ -1 0)))
% 0.87/1.06  (step @p110 :rule refl :args (0))
% 0.87/1.06  (step @p111 :rule evaluate :args (@t84))
% 0.87/1.06  (step @p112 :rule nary_cong :premises (@p111 @p110) :args (@t85))
% 0.87/1.06  (step @p113 :rule trans :premises (@p112 @p109))
% 0.87/1.06  (step @p114 :rule evaluate :args ((+ 0 0)))
% 0.87/1.06  (step @p115 :rule arith_poly_norm :args ((= @t86 0)))
% 0.87/1.06  (step @p116 :rule arith_poly_norm :args ((= @t87 0)))
% 0.87/1.06  (step @p117 :rule nary_cong :premises (@p116 @p115) :args (@t88))
% 0.87/1.06  (step @p118 :rule trans :premises (@p117 @p114))
% 0.87/1.06  (step @p119 :rule arith_poly_norm :args ((= @t89 @t88)))
% 0.87/1.06  (step @p120 :rule trans :premises (@p119 @p118))
% 0.87/1.06  (step @p121 :rule cong :premises (@p120 @p113) :args ((<= @t89 @t85)))
% 0.87/1.06  (step @p122 :rule trans :premises (@p121 @p108))
% 0.87/1.06  (step @p123 :rule arith-elim-lt :args (@t58 1))
% 0.87/1.06  (step @p124 :rule symm :premises (@p123))
% 0.87/1.06  (step @p125 :rule eq_resolve :premises (@p101 @p124))
% 0.87/1.06  (step @p126 :rule int_tight_ub :premises (@p125))
% 0.87/1.06  (step @p127 :rule arith_mult_neg :args (-1 @t83))
% 0.87/1.06  (step @p128 :rule evaluate :args ((< -1 0)))
% 0.87/1.06  (step @p129 :rule true_elim :premises (@p128))
% 0.87/1.06  (step @p130 :rule and_intro :premises (@p129 @p187))
% 0.87/1.06  (step @p131 :rule modus_ponens :premises (@p130 @p127))
% 0.87/1.06  (step @p132 :rule arith_sum_ub :premises (@p131 @p126))
% 0.87/1.06  (step @p133 false :rule eq_resolve :premises (@p132 @p122))
% 0.87/1.06  (step-pop @p188 :rule scope :premises (@p133))
% 0.87/1.06  (step @p134 :rule process_scope :premises (@p188) :args (false))
% 0.87/1.06  (step @p136 :rule arith_poly_norm :args ((= (* -1 (- @t58 1)) (* -1 (- @t57 @t80)))))
% 0.87/1.06  (step @p137 :rule arith_poly_norm_rel :premises (@p136) :args ((= @t83 @t81)))
% 0.87/1.06  (step @p138 :rule symm :premises (@p137))
% 0.87/1.06  (step @p139 :rule eq_resolve :premises (@p185 @p138))
% 0.87/1.06  (step @p140 false :rule contra :premises (@p139 @p134))
% 0.87/1.06  (step-pop @p189 :rule scope :premises (@p140))
% 0.87/1.06  (step-pop @p190 :rule scope :premises (@p189))
% 0.87/1.06  (step @p141 :rule process_scope :premises (@p190) :args (false))
% 0.87/1.06  (assume-push @p191 @t79)
% 0.87/1.06  (assume-push @p192 @t81)
% 0.87/1.06  (step @p146 :rule and_intro :premises (@p192 @p101))
% 0.87/1.06  (step-pop @p193 :rule scope :premises (@p146))
% 0.87/1.06  (step-pop @p194 :rule scope :premises (@p193))
% 0.87/1.06  (step @p147 :rule process_scope :premises (@p194) :args (@t90))
% 0.87/1.06  (step @p150 :rule implies_elim :premises (@p147))
% 0.87/1.06  (step @p151 :rule resolution :premises (@p150 @p141) :args (true @t90))
% 0.87/1.06  (step @p152 :rule not_and :premises (@p151))
% 0.87/1.06  (step @p153 :rule eq_resolve :premises (@p152 @p104))
% 0.87/1.06  (step @p154 :rule chain_m_resolution :premises (@p153 @p101) :args (@t82 @t77 (@list @t59)))
% 0.87/1.06  (step @p155 :rule refl :args (@t81))
% 0.87/1.06  (step @p156 :rule bool-double-not-elim :args (@t91))
% 0.87/1.06  (step @p157 :rule refl :args (@t94))
% 0.87/1.06  (step @p158 :rule nary_cong :premises (@p157 @p156 @p155) :args ((or @t94 (not @t92) @t81)))
% 0.87/1.06  (step @p159 :rule cnf_equiv_pos1 :args (@t93))
% 0.87/1.06  (step @p160 :rule eq_resolve :premises (@p159 @p158))
% 0.87/1.06  (step @p161 :rule reordering :premises (@p160) :args ((or @t91 @t81 @t94)))
% 0.87/1.06  (step @p162 :rule chain_m_resolution :premises (@p161 @p154 @p99) :args (@t91 (@list true false) (@list @t81 @t93)))
% 0.87/1.06  (step @p163 :rule aci_norm :args ((= (or @t92 false) @t92)))
% 0.87/1.06  (step @p164 :rule evaluate :args ((not true)))
% 0.87/1.06  (step @p165 :rule evaluate :args ((>= 0 0)))
% 0.87/1.06  (step @p110 :rule refl :args (0))
% 0.87/1.06  (step @p166 :rule arith_poly_norm :args ((= @t95 0)))
% 0.87/1.06  (step @p167 :rule cong :premises (@p166 @p110) :args (@t96))
% 0.87/1.06  (step @p168 :rule trans :premises (@p167 @p165))
% 0.87/1.06  (step @p169 :rule cong :premises (@p168) :args (@t97))
% 0.87/1.06  (step @p170 :rule trans :premises (@p169 @p164))
% 0.87/1.06  (step @p171 :rule refl :args (@t92))
% 0.87/1.06  (step @p172 :rule nary_cong :premises (@p171 @p170) :args (@t98))
% 0.87/1.06  (step @p173 :rule trans :premises (@p172 @p163))
% 0.87/1.06  (step @p174 :rule refl :args (@t63))
% 0.87/1.06  (step @p175 :rule cong :premises (@p174 @p173) :args ((=> @t63 @t98)))
% 0.87/1.06  (assume-push @p195 @t63)
% 0.87/1.06  (step @p177 :rule instantiate :premises (@p91) :args ((@list @t56)))
% 0.87/1.06  (step-pop @p196 :rule scope :premises (@p177))
% 0.87/1.06  (step @p178 :rule process_scope :premises (@p196) :args (@t98))
% 0.87/1.06  (step @p180 :rule eq_resolve :premises (@p178 @p175))
% 0.87/1.06  (step @p181 :rule implies_elim :premises (@p180))
% 0.87/1.06  (step @p182 false :rule chain_m_resolution :premises (@p181 @p162 @p91) :args (false (@list false false) (@list @t91 @t63)))
% 0.87/1.06  )
% 0.87/1.06  % SZS output end Proof
% 0.87/1.06  % cvc5 exiting
%------------------------------------------------------------------------------