↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n003.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:10:26 AM UTC 2026

% Result   : Theorem 1.96s 2.15s
% Output   : Proof 1.96s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : COM021+1 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.34  % Computer : n003.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 : Mon Jun  1 20:28:29 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 1.96/2.15  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 1.96/2.15  % SZS status Theorem
% 1.96/2.15  % SZS output start Proof
% 1.96/2.15  (
% 1.96/2.15  (declare-sort $$unsorted 0)
% 1.96/2.15  (declare-const tptp.xx $$unsorted)
% 1.96/2.15  (declare-const tptp.xv $$unsorted)
% 1.96/2.15  (declare-const tptp.xu $$unsorted)
% 1.96/2.15  (declare-const tptp.xa $$unsorted)
% 1.96/2.15  (declare-const tptp.xb $$unsorted)
% 1.96/2.15  (declare-const tptp.aElement0 (-> $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.aRewritingSystem0 (-> $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.sdtmndtplgtdt0 (-> $$unsorted $$unsorted $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.sdtmndtasgtdt0 (-> $$unsorted $$unsorted $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.xw $$unsorted)
% 1.96/2.15  (declare-const tptp.xc $$unsorted)
% 1.96/2.15  (declare-const tptp.aReductOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.isLocallyConfluent0 (-> $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.xd $$unsorted)
% 1.96/2.15  (declare-const tptp.iLess0 (-> $$unsorted $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.isConfluent0 (-> $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.xR $$unsorted)
% 1.96/2.15  (declare-const tptp.isTerminating0 (-> $$unsorted Bool))
% 1.96/2.15  (declare-const tptp.aNormalFormOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool))
% 1.96/2.15  (define @t1 () (@var "W0" $$unsorted))
% 1.96/2.15  (define @t2 () (tptp.aElement0 @t1))
% 1.96/2.15  (define @t3 () (@list @t1))
% 1.96/2.15  (define @t4 () (tptp.aRewritingSystem0 @t1))
% 1.96/2.15  (define @t5 () (@var "W2" $$unsorted))
% 1.96/2.15  (define @t6 () (tptp.aElement0 @t5))
% 1.96/2.15  (define @t7 () (@var "W1" $$unsorted))
% 1.96/2.15  (define @t8 () (tptp.aReductOfIn0 @t5 @t1 @t7))
% 1.96/2.15  (define @t9 () (@list @t5))
% 1.96/2.15  (define @t10 () (tptp.aRewritingSystem0 @t7))
% 1.96/2.15  (define @t11 () (and @t2 @t10))
% 1.96/2.15  (define @t12 () (@list @t1 @t7))
% 1.96/2.15  (define @t13 () (tptp.aElement0 @t7))
% 1.96/2.15  (define @t14 () (tptp.sdtmndtplgtdt0 @t1 @t7 @t5))
% 1.96/2.15  (define @t15 () (and @t2 @t10 @t6))
% 1.96/2.15  (define @t16 () (@list @t1 @t7 @t5))
% 1.96/2.15  (define @t17 () (@var "W3" $$unsorted))
% 1.96/2.15  (define @t18 () (tptp.sdtmndtplgtdt0 @t17 @t7 @t5))
% 1.96/2.15  (define @t19 () (tptp.aReductOfIn0 @t17 @t1 @t7))
% 1.96/2.15  (define @t20 () (tptp.aElement0 @t17))
% 1.96/2.15  (define @t21 () (and @t20 @t19 @t18))
% 1.96/2.15  (define @t22 () (@list @t17))
% 1.96/2.15  (define @t23 () (exists @t22 @t21))
% 1.96/2.15  (define @t24 () (or @t8 @t23))
% 1.96/2.15  (define @t25 () (= @t14 @t24))
% 1.96/2.15  (define @t26 () (=> @t15 @t25))
% 1.96/2.15  (define @t27 () (forall @t16 @t26))
% 1.96/2.15  (define @t28 () (and @t2 @t10 @t6 @t20))
% 1.96/2.15  (define @t29 () (@list @t1 @t7 @t5 @t17))
% 1.96/2.15  (define @t30 () (tptp.sdtmndtasgtdt0 @t1 @t7 @t5))
% 1.96/2.15  (define @t31 () (= @t30 (or (= @t1 @t5) @t14)))
% 1.96/2.15  (define @t32 () (forall @t16 (=> @t15 @t31)))
% 1.96/2.15  (define @t33 () (@var "W4" $$unsorted))
% 1.96/2.15  (define @t34 () (exists (@list @t33) (and (tptp.aElement0 @t33) (tptp.sdtmndtasgtdt0 @t5 @t1 @t33) (tptp.sdtmndtasgtdt0 @t17 @t1 @t33))))
% 1.96/2.15  (define @t35 () (@list @t7 @t5 @t17))
% 1.96/2.15  (define @t36 () (tptp.isTerminating0 @t1))
% 1.96/2.15  (define @t37 () (tptp.aReductOfIn0 @t17 @t5 @t7))
% 1.96/2.15  (define @t38 () (exists @t22 @t37))
% 1.96/2.15  (define @t39 () (not @t38))
% 1.96/2.15  (define @t40 () (and @t6 @t30 @t39))
% 1.96/2.15  (define @t41 () (tptp.aNormalFormOfIn0 @t5 @t1 @t7))
% 1.96/2.15  (define @t42 () (= @t41 @t40))
% 1.96/2.15  (define @t43 () (forall @t9 @t42))
% 1.96/2.15  (define @t44 () (=> @t11 @t43))
% 1.96/2.15  (define @t45 () (forall @t12 @t44))
% 1.96/2.15  (define @t46 () (tptp.aRewritingSystem0 tptp.xR))
% 1.96/2.15  (define @t47 () (tptp.aElement0 tptp.xw))
% 1.96/2.15  (define @t48 () (tptp.aNormalFormOfIn0 tptp.xd tptp.xw tptp.xR))
% 1.96/2.15  (define @t49 () (tptp.sdtmndtasgtdt0 tptp.xd tptp.xR tptp.xx))
% 1.96/2.15  (define @t50 () (tptp.sdtmndtasgtdt0 tptp.xb tptp.xR tptp.xx))
% 1.96/2.15  (define @t51 () (tptp.aElement0 tptp.xx))
% 1.96/2.15  (define @t52 () (tptp.sdtmndtasgtdt0 tptp.xb tptp.xR tptp.xd))
% 1.96/2.15  (define @t53 () (not @t52))
% 1.96/2.15  (define @t54 () (@var "BOUND_VARIABLE_7721" $$unsorted))
% 1.96/2.15  (define @t55 () (= (tptp.aNormalFormOfIn0 @t54 @t1 @t7) (and (tptp.aElement0 @t54) (tptp.sdtmndtasgtdt0 @t1 @t7 @t54) (forall @t22 (not (tptp.aReductOfIn0 @t17 @t54 @t7))))))
% 1.96/2.15  (define @t56 () (not @t10))
% 1.96/2.15  (define @t57 () (not @t2))
% 1.96/2.15  (define @t58 () (or @t57 @t56 @t55))
% 1.96/2.15  (define @t59 () (@list @t54))
% 1.96/2.15  (define @t60 () (forall @t59 @t58))
% 1.96/2.15  (define @t61 () (forall @t59 @t55))
% 1.96/2.15  (define @t62 () (or @t57 @t56 @t61))
% 1.96/2.15  (define @t63 () (forall @t22 (not @t37)))
% 1.96/2.15  (define @t64 () (forall @t9 (= @t41 (and @t6 @t30 @t63))))
% 1.96/2.15  (define @t65 () (or @t57 @t56 @t64))
% 1.96/2.15  (define @t66 () (not (tptp.aReductOfIn0 @t17 tptp.xd tptp.xR)))
% 1.96/2.15  (define @t67 () (forall @t22 @t66))
% 1.96/2.15  (define @t68 () (tptp.aElement0 tptp.xd))
% 1.96/2.15  (define @t69 () (and @t68 (tptp.sdtmndtasgtdt0 tptp.xw tptp.xR tptp.xd) @t67))
% 1.96/2.15  (define @t70 () (= @t48 @t69))
% 1.96/2.15  (define @t71 () (not @t46))
% 1.96/2.15  (define @t72 () (not @t47))
% 1.96/2.15  (define @t73 () (or @t72 @t71 @t70))
% 1.96/2.15  (define @t74 () (@list false false))
% 1.96/2.15  (define @t75 () (not @t69))
% 1.96/2.15  (define @t76 () (@list false))
% 1.96/2.15  (define @t77 () (@list @t69))
% 1.96/2.15  (define @t78 () (not @t18))
% 1.96/2.15  (define @t79 () (not @t19))
% 1.96/2.15  (define @t80 () (not @t20))
% 1.96/2.15  (define @t81 () (or @t80 @t79 @t78))
% 1.96/2.15  (define @t82 () (= @t14 (or @t8 (not (forall @t22 @t81)))))
% 1.96/2.15  (define @t83 () (not @t6))
% 1.96/2.15  (define @t84 () (or @t57 @t56 @t83))
% 1.96/2.15  (define @t85 () (not @t15))
% 1.96/2.15  (define @t86 () (forall @t22 (not @t21)))
% 1.96/2.15  (define @t87 () (not @t86))
% 1.96/2.15  (define @t88 () (@list tptp.xd tptp.xR tptp.xx))
% 1.96/2.15  (define @t89 () (forall @t22 (or @t80 @t66 (not (tptp.sdtmndtplgtdt0 @t17 tptp.xR tptp.xx)))))
% 1.96/2.15  (define @t90 () (not @t89))
% 1.96/2.15  (define @t91 () (tptp.aReductOfIn0 tptp.xx tptp.xd tptp.xR))
% 1.96/2.15  (define @t92 () (or @t91 @t90))
% 1.96/2.15  (define @t93 () (tptp.sdtmndtplgtdt0 tptp.xd tptp.xR tptp.xx))
% 1.96/2.15  (define @t94 () (= @t93 @t92))
% 1.96/2.15  (define @t95 () (not @t51))
% 1.96/2.15  (define @t96 () (not @t68))
% 1.96/2.15  (define @t97 () (or @t96 @t71 @t95 @t94))
% 1.96/2.15  (define @t98 () (@list false false false false))
% 1.96/2.15  (define @t99 () (= tptp.xd tptp.xx))
% 1.96/2.15  (define @t100 () (or @t99 @t93))
% 1.96/2.15  (define @t101 () (= @t49 @t100))
% 1.96/2.15  (define @t102 () (or @t96 @t71 @t95 @t101))
% 1.96/2.15  (define @t103 () (not @t99))
% 1.96/2.15  (define @t104 () (not @t50))
% 1.96/2.15  (define @t105 () (and @t53 @t99 @t50))
% 1.96/2.15  (define @t106 () (@list true false))
% 1.96/2.15  (define @t107 () (@quantifiers_skolemize @t89 0))
% 1.96/2.15  (define @t108 () (tptp.aReductOfIn0 @t107 tptp.xd tptp.xR))
% 1.96/2.15  (define @t109 () (not @t108))
% 1.96/2.15  (define @t110 () (or (not (tptp.aElement0 @t107)) @t109 (not (tptp.sdtmndtplgtdt0 @t107 tptp.xR tptp.xx))))
% 1.96/2.15  (define @t111 () (not @t110))
% 1.96/2.15  (assume @p1 (forall @t3 (=> @t2 true)))
% 1.96/2.15  (assume @p2 (forall @t3 (=> @t4 true)))
% 1.96/2.15  (assume @p3 (forall @t12 (=> @t11 (forall @t9 (=> @t8 @t6)))))
% 1.96/2.15  (assume @p4 (forall @t12 (=> (and @t2 @t13) (=> (tptp.iLess0 @t1 @t7) true))))
% 1.96/2.15  (assume @p5 (forall @t16 (=> @t15 (=> @t14 true))))
% 1.96/2.15  (assume @p6 @t27)
% 1.96/2.15  (assume @p7 (forall @t29 (=> @t28 (=> (and @t14 (tptp.sdtmndtplgtdt0 @t5 @t7 @t17)) (tptp.sdtmndtplgtdt0 @t1 @t7 @t17)))))
% 1.96/2.15  (assume @p8 @t32)
% 1.96/2.15  (assume @p9 (forall @t29 (=> @t28 (=> (and @t30 (tptp.sdtmndtasgtdt0 @t5 @t7 @t17)) (tptp.sdtmndtasgtdt0 @t1 @t7 @t17)))))
% 1.96/2.15  (assume @p10 (forall @t3 (=> @t4 (= (tptp.isConfluent0 @t1) (forall @t35 (=> (and @t13 @t6 @t20 (tptp.sdtmndtasgtdt0 @t7 @t1 @t5) (tptp.sdtmndtasgtdt0 @t7 @t1 @t17)) @t34))))))
% 1.96/2.15  (assume @p11 (forall @t3 (=> @t4 (= (tptp.isLocallyConfluent0 @t1) (forall @t35 (=> (and @t13 @t6 @t20 (tptp.aReductOfIn0 @t5 @t7 @t1) (tptp.aReductOfIn0 @t17 @t7 @t1)) @t34))))))
% 1.96/2.15  (assume @p12 (forall @t3 (=> @t4 (= @t36 (forall (@list @t7 @t5) (=> (and @t13 @t6) (=> (tptp.sdtmndtplgtdt0 @t7 @t1 @t5) (tptp.iLess0 @t5 @t7))))))))
% 1.96/2.15  (assume @p13 @t45)
% 1.96/2.15  (assume @p14 (forall @t3 (=> (and @t4 @t36) (forall (@list @t7) (=> @t13 (exists @t9 (tptp.aNormalFormOfIn0 @t5 @t7 @t1)))))))
% 1.96/2.15  (assume @p15 @t46)
% 1.96/2.15  (assume @p16 (and (tptp.isLocallyConfluent0 tptp.xR) (tptp.isTerminating0 tptp.xR)))
% 1.96/2.15  (assume @p17 (and (tptp.aElement0 tptp.xa) (tptp.aElement0 tptp.xb) (tptp.aElement0 tptp.xc)))
% 1.96/2.15  (assume @p18 (forall @t16 (=> (and @t2 @t13 @t6 (tptp.sdtmndtasgtdt0 @t1 tptp.xR @t7) (tptp.sdtmndtasgtdt0 @t1 tptp.xR @t5)) (=> (tptp.iLess0 @t1 tptp.xa) (exists @t22 (and @t20 (tptp.sdtmndtasgtdt0 @t7 tptp.xR @t17) (tptp.sdtmndtasgtdt0 @t5 tptp.xR @t17)))))))
% 1.96/2.15  (assume @p19 (and (tptp.sdtmndtplgtdt0 tptp.xa tptp.xR tptp.xb) (tptp.sdtmndtplgtdt0 tptp.xa tptp.xR tptp.xc)))
% 1.96/2.15  (assume @p20 (and (tptp.aElement0 tptp.xu) (tptp.aReductOfIn0 tptp.xu tptp.xa tptp.xR) (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR tptp.xb)))
% 1.96/2.15  (assume @p21 (and (tptp.aElement0 tptp.xv) (tptp.aReductOfIn0 tptp.xv tptp.xa tptp.xR) (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR tptp.xc)))
% 1.96/2.15  (assume @p22 (and @t47 (tptp.sdtmndtasgtdt0 tptp.xu tptp.xR tptp.xw) (tptp.sdtmndtasgtdt0 tptp.xv tptp.xR tptp.xw)))
% 1.96/2.15  (assume @p23 @t48)
% 1.96/2.15  (assume @p24 (and @t51 @t50 @t49))
% 1.96/2.15  (assume @p25 @t53)
% 1.96/2.15  (assume @p26 true)
% 1.96/2.15  (step @p27 :rule quant-merge-prenex :args ((= (forall @t12 @t60) (forall (@list @t1 @t7 @t54) @t58))))
% 1.96/2.15  (step @p28 :rule alpha_equiv :args (@t61 (@list @t54) (@list @t5)))
% 1.96/2.15  (step @p29 :rule refl :args (@t56))
% 1.96/2.15  (step @p30 :rule refl :args (@t57))
% 1.96/2.15  (step @p31 :rule nary_cong :premises (@p30 @p29 @p28) :args (@t62))
% 1.96/2.15  (step @p32 :rule quant-miniscope-or :args ((= @t60 @t62)))
% 1.96/2.15  (step @p33 :rule trans :premises (@p32 @p31))
% 1.96/2.15  (step @p34 :rule symm :premises (@p33))
% 1.96/2.15  (step @p35 :rule cong :premises (@p34) :args ((forall @t12 @t65)))
% 1.96/2.15  (step @p36 :rule trans :premises (@p35 @p27))
% 1.96/2.15  (step @p37 :rule aci_norm :args ((= (or (or @t57 @t56) @t64) @t65)))
% 1.96/2.15  (step @p38 :rule refl :args (@t64))
% 1.96/2.15  (step @p39 :rule bool-and-de-morgan :args (@t2 @t10 true))
% 1.96/2.15  (step @p40 :rule nary_cong :premises (@p39 @p38) :args ((or (not @t11) @t64)))
% 1.96/2.15  (step @p41 :rule trans :premises (@p40 @p37))
% 1.96/2.15  (step @p42 :rule bool-impl-elim :args (@t11 @t64))
% 1.96/2.15  (step @p43 :rule trans :premises (@p42 @p41))
% 1.96/2.15  (step @p44 :rule cong :premises (@p43) :args ((forall @t12 (=> @t11 @t64))))
% 1.96/2.15  (step @p45 :rule trans :premises (@p44 @p36))
% 1.96/2.15  (step @p46 :rule bool-double-not-elim :args (@t63))
% 1.96/2.15  (step @p47 :rule exists-elim :args ((= @t38 (not @t63))))
% 1.96/2.15  (step @p48 :rule cong :premises (@p47) :args (@t39))
% 1.96/2.15  (step @p49 :rule trans :premises (@p48 @p46))
% 1.96/2.15  (step @p50 :rule refl :args (@t30))
% 1.96/2.15  (step @p51 :rule refl :args (@t6))
% 1.96/2.15  (step @p52 :rule nary_cong :premises (@p51 @p50 @p49) :args (@t40))
% 1.96/2.15  (step @p53 :rule refl :args (@t41))
% 1.96/2.15  (step @p54 :rule cong :premises (@p53 @p52) :args (@t42))
% 1.96/2.15  (step @p55 :rule cong :premises (@p54) :args (@t43))
% 1.96/2.15  (step @p56 :rule refl :args (@t11))
% 1.96/2.15  (step @p57 :rule cong :premises (@p56 @p55) :args (@t44))
% 1.96/2.15  (step @p58 :rule cong :premises (@p57) :args (@t45))
% 1.96/2.15  (step @p59 :rule trans :premises (@p58 @p45))
% 1.96/2.15  (step @p60 :rule eq_resolve :premises (@p13 @p59))
% 1.96/2.15  (step @p61 :rule instantiate :premises (@p60) :args ((@list tptp.xw tptp.xR tptp.xd)))
% 1.96/2.15  (step @p62 :rule and_elim :premises (@p22) :args (0))
% 1.96/2.15  (step @p63 :rule cnf_or_pos :args (@t73))
% 1.96/2.15  (step @p64 :rule reordering :premises (@p63) :args ((or @t71 @t72 @t70 (not @t73))))
% 1.96/2.15  (step @p65 :rule chain_m_resolution :premises (@p64 @p15 @p62 @p61) :args (@t70 (@list false false false) (@list @t46 @t47 @t73)))
% 1.96/2.15  (step @p66 :rule cnf_equiv_pos1 :args (@t70))
% 1.96/2.15  (step @p67 :rule reordering :premises (@p66) :args ((or (not @t48) @t69 (not @t70))))
% 1.96/2.15  (step @p68 :rule chain_m_resolution :premises (@p67 @p23 @p65) :args (@t69 @t74 (@list @t48 @t70)))
% 1.96/2.15  (step @p69 :rule cnf_and_pos :args (@t69 2))
% 1.96/2.15  (step @p70 :rule reordering :premises (@p69) :args ((or @t67 @t75)))
% 1.96/2.15  (step @p71 :rule chain_m_resolution :premises (@p70 @p68) :args (@t67 @t76 @t77))
% 1.96/2.15  (step @p72 :rule aci_norm :args ((= (or @t84 @t82) (or @t57 @t56 @t83 @t82))))
% 1.96/2.15  (step @p73 :rule refl :args (@t82))
% 1.96/2.15  (step @p74 :rule aci_norm :args ((= (or @t57 (or @t56 @t83)) @t84)))
% 1.96/2.15  (step @p75 :rule bool-and-de-morgan :args (@t10 @t6 true))
% 1.96/2.15  (step @p76 :rule nary_cong :premises (@p30 @p75) :args ((or @t57 (not (and @t10 @t6)))))
% 1.96/2.15  (step @p77 :rule bool-and-de-morgan :args (@t2 @t10 (and @t6)))
% 1.96/2.15  (step @p78 :rule trans :premises (@p77 @p76))
% 1.96/2.15  (step @p79 :rule trans :premises (@p78 @p74))
% 1.96/2.15  (step @p80 :rule nary_cong :premises (@p79 @p73) :args ((or @t85 @t82)))
% 1.96/2.15  (step @p81 :rule trans :premises (@p80 @p72))
% 1.96/2.15  (step @p82 :rule bool-impl-elim :args (@t15 @t82))
% 1.96/2.15  (step @p83 :rule trans :premises (@p82 @p81))
% 1.96/2.15  (step @p84 :rule cong :premises (@p83) :args ((forall @t16 (=> @t15 @t82))))
% 1.96/2.15  (step @p85 :rule aci_norm :args ((= (or @t80 (or @t79 @t78)) @t81)))
% 1.96/2.15  (step @p86 :rule bool-and-de-morgan :args (@t19 @t18 true))
% 1.96/2.15  (step @p87 :rule refl :args (@t80))
% 1.96/2.15  (step @p88 :rule nary_cong :premises (@p87 @p86) :args ((or @t80 (not (and @t19 @t18)))))
% 1.96/2.15  (step @p89 :rule bool-and-de-morgan :args (@t20 @t19 (and @t18)))
% 1.96/2.15  (step @p90 :rule trans :premises (@p89 @p88))
% 1.96/2.15  (step @p91 :rule trans :premises (@p90 @p85))
% 1.96/2.15  (step @p92 :rule cong :premises (@p91) :args (@t86))
% 1.96/2.15  (step @p93 :rule cong :premises (@p92) :args (@t87))
% 1.96/2.15  (step @p94 :rule exists-elim :args ((= @t23 @t87)))
% 1.96/2.15  (step @p95 :rule trans :premises (@p94 @p93))
% 1.96/2.15  (step @p96 :rule refl :args (@t8))
% 1.96/2.15  (step @p97 :rule nary_cong :premises (@p96 @p95) :args (@t24))
% 1.96/2.15  (step @p98 :rule refl :args (@t14))
% 1.96/2.15  (step @p99 :rule cong :premises (@p98 @p97) :args (@t25))
% 1.96/2.15  (step @p100 :rule refl :args (@t15))
% 1.96/2.15  (step @p101 :rule cong :premises (@p100 @p99) :args (@t26))
% 1.96/2.15  (step @p102 :rule cong :premises (@p101) :args (@t27))
% 1.96/2.15  (step @p103 :rule trans :premises (@p102 @p84))
% 1.96/2.15  (step @p104 :rule eq_resolve :premises (@p6 @p103))
% 1.96/2.15  (step @p105 :rule instantiate :premises (@p104) :args (@t88))
% 1.96/2.15  (step @p106 :rule cnf_and_pos :args (@t69 0))
% 1.96/2.15  (step @p107 :rule reordering :premises (@p106) :args ((or @t68 @t75)))
% 1.96/2.15  (step @p108 :rule chain_m_resolution :premises (@p107 @p68) :args (@t68 @t76 @t77))
% 1.96/2.15  (step @p109 :rule and_elim :premises (@p24) :args (0))
% 1.96/2.15  (step @p110 :rule cnf_or_pos :args (@t97))
% 1.96/2.15  (step @p111 :rule reordering :premises (@p110) :args ((or @t71 @t95 @t96 @t94 (not @t97))))
% 1.96/2.15  (step @p112 :rule chain_m_resolution :premises (@p111 @p15 @p109 @p108 @p105) :args (@t94 @t98 (@list @t46 @t51 @t68 @t97)))
% 1.96/2.15  (step @p113 :rule aci_norm :args ((= (or @t84 @t31) (or @t57 @t56 @t83 @t31))))
% 1.96/2.15  (step @p114 :rule refl :args (@t31))
% 1.96/2.15  (step @p115 :rule nary_cong :premises (@p79 @p114) :args ((or @t85 @t31)))
% 1.96/2.15  (step @p116 :rule trans :premises (@p115 @p113))
% 1.96/2.15  (step @p117 :rule bool-impl-elim :args (@t15 @t31))
% 1.96/2.15  (step @p118 :rule trans :premises (@p117 @p116))
% 1.96/2.15  (step @p119 :rule cong :premises (@p118) :args (@t32))
% 1.96/2.15  (step @p120 :rule eq_resolve :premises (@p8 @p119))
% 1.96/2.15  (step @p121 :rule instantiate :premises (@p120) :args (@t88))
% 1.96/2.15  (step @p122 :rule cnf_or_pos :args (@t102))
% 1.96/2.15  (step @p123 :rule reordering :premises (@p122) :args ((or @t71 @t95 @t96 @t101 (not @t102))))
% 1.96/2.15  (step @p124 :rule chain_m_resolution :premises (@p123 @p15 @p109 @p108 @p121) :args (@t101 @t98 (@list @t46 @t51 @t68 @t102)))
% 1.96/2.15  (step @p125 :rule and_elim :premises (@p24) :args (2))
% 1.96/2.15  (step @p126 :rule cnf_equiv_pos1 :args (@t101))
% 1.96/2.15  (step @p127 :rule reordering :premises (@p126) :args ((or (not @t49) @t100 (not @t101))))
% 1.96/2.15  (step @p128 :rule chain_m_resolution :premises (@p127 @p125 @p124) :args (@t100 @t74 (@list @t49 @t101)))
% 1.96/2.15  (step @p129 :rule and_elim :premises (@p24) :args (1))
% 1.96/2.15  (step @p130 :rule refl :args (@t103))
% 1.96/2.15  (step @p131 :rule bool-double-not-elim :args (@t52))
% 1.96/2.15  (step @p132 :rule refl :args (@t104))
% 1.96/2.15  (step @p133 :rule nary_cong :premises (@p132 @p131 @p130) :args ((or @t104 (not @t53) @t103)))
% 1.96/2.15  (assume-push @p198 @t53)
% 1.96/2.15  (assume-push @p199 @t99)
% 1.96/2.15  (assume-push @p200 @t50)
% 1.96/2.15  (step @p137 :rule evaluate :args ((= true false)))
% 1.96/2.15  (step @p138 :rule false_intro :premises (@p25))
% 1.96/2.15  (step @p139 :rule symm :premises (@p199))
% 1.96/2.15  (step @p140 :rule refl :args (tptp.xR))
% 1.96/2.15  (step @p141 :rule refl :args (tptp.xb))
% 1.96/2.15  (step @p142 :rule cong :premises (@p141 @p140 @p139) :args (@t50))
% 1.96/2.15  (step @p143 :rule true_intro :premises (@p129))
% 1.96/2.15  (step @p144 :rule symm :premises (@p143))
% 1.96/2.15  (step @p145 :rule trans :premises (@p144 @p142 @p138))
% 1.96/2.15  (step @p146 false :rule eq_resolve :premises (@p145 @p137))
% 1.96/2.15  (step-pop @p201 :rule scope :premises (@p146))
% 1.96/2.15  (step-pop @p202 :rule scope :premises (@p201))
% 1.96/2.15  (step-pop @p203 :rule scope :premises (@p202))
% 1.96/2.15  (step @p147 :rule process_scope :premises (@p203) :args (false))
% 1.96/2.15  (assume-push @p204 @t50)
% 1.96/2.15  (assume-push @p205 @t53)
% 1.96/2.15  (assume-push @p206 @t99)
% 1.96/2.15  (step @p154 :rule and_intro :premises (@p25 @p206 @p129))
% 1.96/2.15  (step-pop @p207 :rule scope :premises (@p154))
% 1.96/2.15  (step-pop @p208 :rule scope :premises (@p207))
% 1.96/2.15  (step-pop @p209 :rule scope :premises (@p208))
% 1.96/2.15  (step @p155 :rule process_scope :premises (@p209) :args (@t105))
% 1.96/2.15  (step @p159 :rule implies_elim :premises (@p155))
% 1.96/2.15  (step @p160 :rule resolution :premises (@p159 @p147) :args (true @t105))
% 1.96/2.15  (step @p161 :rule not_and :premises (@p160))
% 1.96/2.15  (step @p162 :rule eq_resolve :premises (@p161 @p133))
% 1.96/2.15  (step @p163 :rule reordering :premises (@p162) :args ((or @t52 @t104 @t103)))
% 1.96/2.15  (step @p164 :rule chain_m_resolution :premises (@p163 @p25 @p129) :args (@t103 @t106 (@list @t52 @t50)))
% 1.96/2.15  (step @p165 :rule cnf_or_pos :args (@t100))
% 1.96/2.15  (step @p166 :rule reordering :premises (@p165) :args ((or @t99 @t93 (not @t100))))
% 1.96/2.15  (step @p167 :rule chain_m_resolution :premises (@p166 @p164 @p128) :args (@t93 @t106 (@list @t99 @t100)))
% 1.96/2.15  (step @p168 :rule cnf_equiv_pos1 :args (@t94))
% 1.96/2.17  (step @p169 :rule reordering :premises (@p168) :args ((or (not @t93) @t92 (not @t94))))
% 1.96/2.17  (step @p170 :rule chain_m_resolution :premises (@p169 @p167 @p112) :args (@t92 @t74 (@list @t93 @t94)))
% 1.96/2.17  (step @p171 :rule instantiate :premises (@p71) :args ((@list @t107)))
% 1.96/2.17  (step @p172 :rule bool-double-not-elim :args (@t108))
% 1.96/2.17  (step @p173 :rule refl :args (@t110))
% 1.96/2.17  (step @p174 :rule nary_cong :premises (@p173 @p172) :args ((or @t110 (not @t109))))
% 1.96/2.17  (step @p175 :rule cnf_or_neg :args (@t110 1))
% 1.96/2.17  (step @p176 :rule eq_resolve :premises (@p175 @p174))
% 1.96/2.17  (step @p177 :rule reordering :premises (@p176) :args ((or @t108 @t110)))
% 1.96/2.17  (step @p178 :rule chain_m_resolution :premises (@p177 @p171) :args (@t110 (@list true) (@list @t108)))
% 1.96/2.17  (step @p179 :rule refl :args (@t111))
% 1.96/2.17  (step @p180 :rule bool-double-not-elim :args (@t89))
% 1.96/2.17  (step @p181 :rule nary_cong :premises (@p180 @p179) :args ((or (not @t90) @t111)))
% 1.96/2.17  (assume-push @p210 @t90)
% 1.96/2.17  (step @p183 :rule skolemize :premises (@p210))
% 1.96/2.17  (step-pop @p211 :rule scope :premises (@p183))
% 1.96/2.17  (step @p184 :rule process_scope :premises (@p211) :args (@t111))
% 1.96/2.17  (step @p186 :rule implies_elim :premises (@p184))
% 1.96/2.17  (step @p187 :rule eq_resolve :premises (@p186 @p181))
% 1.96/2.17  (step @p188 :rule chain_m_resolution :premises (@p187 @p178) :args (@t89 @t76 (@list @t110)))
% 1.96/2.17  (step @p189 :rule cnf_or_pos :args (@t92))
% 1.96/2.17  (step @p190 :rule reordering :premises (@p189) :args ((or @t91 @t90 (not @t92))))
% 1.96/2.17  (step @p191 :rule chain_m_resolution :premises (@p190 @p188 @p170) :args (@t91 @t74 (@list @t89 @t92)))
% 1.96/2.17  (assume-push @p212 @t67)
% 1.96/2.17  (step @p193 :rule instantiate :premises (@p71) :args ((@list tptp.xx)))
% 1.96/2.17  (step-pop @p213 :rule scope :premises (@p193))
% 1.96/2.17  (step @p194 :rule process_scope :premises (@p213) :args ((not @t91)))
% 1.96/2.17  (step @p196 :rule implies_elim :premises (@p194))
% 1.96/2.17  (step @p197 false :rule chain_m_resolution :premises (@p196 @p191 @p71) :args (false @t74 (@list @t91 @t67)))
% 1.96/2.17  )
% 1.96/2.17  % SZS output end Proof
% 1.96/2.17  % cvc5 exiting
%------------------------------------------------------------------------------