↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n027.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:11:12 AM UTC 2026

% Result   : Theorem 0.47s 0.64s
% Output   : Proof 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR019+1 : TPTP v9.2.1. Bugfixed v3.1.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.35  % Computer : n027.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 : Mon Jun  1 20:37:21 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.31/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.47/0.64  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.47/0.64  % SZS status Theorem
% 0.47/0.64  % SZS output start Proof
% 0.47/0.64  (
% 0.47/0.64  (declare-sort $$unsorted 0)
% 0.47/0.64  (declare-const tptp.n3 $$unsorted)
% 0.47/0.64  (declare-const tptp.n7 $$unsorted)
% 0.47/0.64  (declare-const tptp.forwards $$unsorted)
% 0.47/0.64  (declare-const tptp.n2 $$unsorted)
% 0.47/0.64  (declare-const tptp.backwards $$unsorted)
% 0.47/0.64  (declare-const tptp.pull $$unsorted)
% 0.47/0.64  (declare-const tptp.spinning $$unsorted)
% 0.47/0.64  (declare-const tptp.push $$unsorted)
% 0.47/0.64  (declare-const tptp.terminates (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.initiates (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.less_or_equal (-> $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.antitrajectory (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.n6 $$unsorted)
% 0.47/0.64  (declare-const tptp.less (-> $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.startedIn (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.happens (-> $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.n9 $$unsorted)
% 0.47/0.64  (declare-const tptp.n5 $$unsorted)
% 0.47/0.64  (declare-const tptp.releases (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.holdsAt (-> $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.stoppedIn (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.trajectory (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.47/0.64  (declare-const tptp.n8 $$unsorted)
% 0.47/0.64  (declare-const tptp.n4 $$unsorted)
% 0.47/0.64  (declare-const tptp.n0 $$unsorted)
% 0.47/0.64  (declare-const tptp.n1 $$unsorted)
% 0.47/0.64  (declare-const tptp.plus (-> $$unsorted $$unsorted $$unsorted))
% 0.47/0.64  (declare-const tptp.releasedAt (-> $$unsorted $$unsorted Bool))
% 0.47/0.64  (define @t1 () (@var "Time" $$unsorted))
% 0.47/0.64  (define @t2 () (@var "Fluent" $$unsorted))
% 0.47/0.64  (define @t3 () (@var "Event" $$unsorted))
% 0.47/0.64  (define @t4 () (tptp.terminates @t3 @t2 @t1))
% 0.47/0.64  (define @t5 () (@var "Time2" $$unsorted))
% 0.47/0.64  (define @t6 () (tptp.less @t1 @t5))
% 0.47/0.64  (define @t7 () (@var "Time1" $$unsorted))
% 0.47/0.64  (define @t8 () (tptp.less @t7 @t1))
% 0.47/0.64  (define @t9 () (tptp.happens @t3 @t1))
% 0.47/0.64  (define @t10 () (@list @t3 @t1))
% 0.47/0.64  (define @t11 () (tptp.initiates @t3 @t2 @t1))
% 0.47/0.64  (define @t12 () (@var "Offset" $$unsorted))
% 0.47/0.64  (define @t13 () (tptp.plus @t1 @t12))
% 0.47/0.64  (define @t14 () (@var "Fluent2" $$unsorted))
% 0.47/0.64  (define @t15 () (tptp.plus @t7 @t5))
% 0.47/0.64  (define @t16 () (@var "Fluent1" $$unsorted))
% 0.47/0.64  (define @t17 () (tptp.plus @t1 tptp.n1))
% 0.47/0.64  (define @t18 () (tptp.holdsAt @t2 @t17))
% 0.47/0.64  (define @t19 () (and @t9 @t4))
% 0.47/0.64  (define @t20 () (@list @t3))
% 0.47/0.64  (define @t21 () (tptp.releasedAt @t2 @t17))
% 0.47/0.64  (define @t22 () (not @t21))
% 0.47/0.64  (define @t23 () (tptp.holdsAt @t2 @t1))
% 0.47/0.64  (define @t24 () (@list @t2 @t1))
% 0.47/0.64  (define @t25 () (not @t18))
% 0.47/0.64  (define @t26 () (and @t9 @t11))
% 0.47/0.64  (define @t27 () (and @t9 (or @t11 @t4)))
% 0.47/0.64  (define @t28 () (tptp.releasedAt @t2 @t1))
% 0.47/0.64  (define @t29 () (tptp.releases @t3 @t2 @t1))
% 0.47/0.64  (define @t30 () (and @t9 @t29))
% 0.47/0.64  (define @t31 () (not @t28))
% 0.47/0.64  (define @t32 () (@list @t3 @t1 @t2))
% 0.47/0.64  (define @t33 () (forall @t32 (=> @t19 @t25)))
% 0.47/0.64  (define @t34 () (tptp.happens tptp.push @t1))
% 0.47/0.64  (define @t35 () (= @t2 tptp.spinning))
% 0.47/0.64  (define @t36 () (= @t3 tptp.pull))
% 0.47/0.64  (define @t37 () (not @t34))
% 0.47/0.64  (define @t38 () (= @t2 tptp.backwards))
% 0.47/0.64  (define @t39 () (not (tptp.happens tptp.pull @t1)))
% 0.47/0.64  (define @t40 () (= @t2 tptp.forwards))
% 0.47/0.64  (define @t41 () (= @t3 tptp.push))
% 0.47/0.64  (define @t42 () (@list @t3 @t2 @t1))
% 0.47/0.64  (define @t43 () (forall @t42 (= @t4 (or (and @t41 @t38 @t39) (and @t36 @t40 @t37) (and @t36 @t40 @t34) (and @t36 @t38 @t34) (and @t41 @t35 @t39) (and @t36 @t35 @t37)))))
% 0.47/0.64  (define @t44 () (= @t1 tptp.n2))
% 0.47/0.64  (define @t45 () (forall @t10 (= @t9 (or (and @t41 (= @t1 tptp.n0)) (and @t36 (= @t1 tptp.n1)) (and @t36 @t44) (and @t41 @t44)))))
% 0.47/0.64  (define @t46 () (= tptp.push tptp.pull))
% 0.47/0.64  (define @t47 () (= tptp.forwards tptp.backwards))
% 0.47/0.64  (define @t48 () (= tptp.forwards tptp.spinning))
% 0.47/0.64  (define @t49 () (tptp.plus tptp.n1 tptp.n1))
% 0.47/0.64  (define @t50 () (@var "X" $$unsorted))
% 0.47/0.64  (define @t51 () (@var "Y" $$unsorted))
% 0.47/0.64  (define @t52 () (@list @t50 @t51))
% 0.47/0.64  (define @t53 () (tptp.less @t50 @t51))
% 0.47/0.64  (define @t54 () (@list @t50))
% 0.47/0.64  (define @t55 () (tptp.holdsAt tptp.forwards tptp.n2))
% 0.47/0.64  (define @t56 () (tptp.happens tptp.push tptp.n1))
% 0.47/0.64  (define @t57 () (not @t56))
% 0.47/0.64  (define @t58 () (and @t48 @t57))
% 0.47/0.64  (define @t59 () (= tptp.pull tptp.pull))
% 0.47/0.64  (define @t60 () (and @t59 @t48 @t57))
% 0.47/0.64  (define @t61 () (tptp.happens tptp.pull tptp.n1))
% 0.47/0.64  (define @t62 () (not @t61))
% 0.47/0.64  (define @t63 () (= tptp.pull tptp.push))
% 0.47/0.64  (define @t64 () (and @t63 @t48 @t62))
% 0.47/0.64  (define @t65 () (and @t47 @t56))
% 0.47/0.64  (define @t66 () (and @t59 @t47 @t56))
% 0.47/0.64  (define @t67 () (= tptp.forwards tptp.forwards))
% 0.47/0.64  (define @t68 () (and @t59 @t67 @t56))
% 0.47/0.64  (define @t69 () (and @t59 @t67 @t57))
% 0.47/0.64  (define @t70 () (and @t63 @t47 @t62))
% 0.47/0.64  (define @t71 () (or @t70 @t69 @t68 @t66 @t64 @t60))
% 0.47/0.64  (define @t72 () (tptp.terminates tptp.pull tptp.forwards tptp.n1))
% 0.47/0.64  (define @t73 () (= @t72 @t71))
% 0.47/0.64  (define @t74 () (or (and @t46 @t47 @t62) @t57 @t56 @t65 (and @t46 @t48 @t62) @t58))
% 0.47/0.64  (define @t75 () (= @t72 @t74))
% 0.47/0.64  (define @t76 () (@list false))
% 0.47/0.64  (define @t77 () (not @t4))
% 0.47/0.64  (define @t78 () (not @t9))
% 0.47/0.64  (define @t79 () (= tptp.n1 tptp.n2))
% 0.47/0.64  (define @t80 () (and @t63 @t79))
% 0.47/0.64  (define @t81 () (and @t59 @t79))
% 0.47/0.64  (define @t82 () (and @t59 (= tptp.n1 tptp.n1)))
% 0.47/0.64  (define @t83 () (and @t63 (= tptp.n1 tptp.n0)))
% 0.47/0.64  (define @t84 () (or @t83 @t82 @t81 @t80))
% 0.47/0.64  (define @t85 () (= @t61 @t84))
% 0.47/0.64  (define @t86 () (tptp.holdsAt tptp.forwards @t49))
% 0.47/0.64  (define @t87 () (not @t86))
% 0.47/0.64  (define @t88 () (not @t72))
% 0.47/0.64  (define @t89 () (or @t62 @t88 @t87))
% 0.47/0.64  (define @t90 () (not @t74))
% 0.47/0.64  (assume @p1 (forall (@list @t7 @t2 @t5) (= (tptp.stoppedIn @t7 @t2 @t5) (exists @t10 (and @t9 @t8 @t6 @t4)))))
% 0.47/0.64  (assume @p2 (forall (@list @t7 @t5 @t2) (= (tptp.startedIn @t7 @t2 @t5) (exists @t10 (and @t9 @t8 @t6 @t11)))))
% 0.47/0.64  (assume @p3 (forall (@list @t3 @t1 @t2 @t14 @t12) (=> (and @t9 @t11 (tptp.less tptp.n0 @t12) (tptp.trajectory @t2 @t1 @t14 @t12) (not (tptp.stoppedIn @t1 @t2 @t13))) (tptp.holdsAt @t14 @t13))))
% 0.47/0.64  (assume @p4 (forall (@list @t3 @t7 @t16 @t5 @t14) (=> (and (tptp.happens @t3 @t7) (tptp.terminates @t3 @t16 @t7) (tptp.less tptp.n0 @t5) (tptp.antitrajectory @t16 @t7 @t14 @t5) (not (tptp.startedIn @t7 @t16 @t15))) (tptp.holdsAt @t14 @t15))))
% 0.47/0.64  (assume @p5 (forall @t24 (=> (and @t23 @t22 (not (exists @t20 @t19))) @t18)))
% 0.47/0.64  (assume @p6 (forall @t24 (=> (and (not @t23) @t22 (not (exists @t20 @t26))) @t25)))
% 0.47/0.64  (assume @p7 (forall @t24 (=> (and @t28 (not (exists @t20 @t27))) @t21)))
% 0.47/0.64  (assume @p8 (forall @t24 (=> (and @t31 (not (exists @t20 @t30))) @t22)))
% 0.47/0.64  (assume @p9 (forall @t32 (=> @t26 @t18)))
% 0.47/0.64  (assume @p10 @t33)
% 0.47/0.64  (assume @p11 (forall @t32 (=> @t30 @t21)))
% 0.47/0.64  (assume @p12 (forall @t32 (=> @t27 @t22)))
% 0.47/0.64  (assume @p13 (forall @t42 (= @t11 (or (and @t41 @t40 @t39) (and @t36 @t38 @t37) (and @t36 @t35 @t34)))))
% 0.47/0.64  (assume @p14 @t43)
% 0.47/0.64  (assume @p15 (forall @t42 (not @t29)))
% 0.47/0.64  (assume @p16 @t45)
% 0.47/0.64  (assume @p17 (not @t46))
% 0.47/0.64  (assume @p18 (not @t47))
% 0.47/0.64  (assume @p19 (not @t48))
% 0.47/0.64  (assume @p20 (not (= tptp.spinning tptp.backwards)))
% 0.47/0.64  (assume @p21 (= (tptp.plus tptp.n0 tptp.n0) tptp.n0))
% 0.47/0.64  (assume @p22 (= (tptp.plus tptp.n0 tptp.n1) tptp.n1))
% 0.47/0.64  (assume @p23 (= (tptp.plus tptp.n0 tptp.n2) tptp.n2))
% 0.47/0.64  (assume @p24 (= (tptp.plus tptp.n0 tptp.n3) tptp.n3))
% 0.47/0.64  (assume @p25 (= @t49 tptp.n2))
% 0.47/0.64  (assume @p26 (= (tptp.plus tptp.n1 tptp.n2) tptp.n3))
% 0.47/0.64  (assume @p27 (= (tptp.plus tptp.n1 tptp.n3) tptp.n4))
% 0.47/0.64  (assume @p28 (= (tptp.plus tptp.n2 tptp.n2) tptp.n4))
% 0.47/0.64  (assume @p29 (= (tptp.plus tptp.n2 tptp.n3) tptp.n5))
% 0.47/0.64  (assume @p30 (= (tptp.plus tptp.n3 tptp.n3) tptp.n6))
% 0.47/0.64  (assume @p31 (forall @t52 (= (tptp.plus @t50 @t51) (tptp.plus @t51 @t50))))
% 0.47/0.64  (assume @p32 (forall @t52 (= (tptp.less_or_equal @t50 @t51) (or @t53 (= @t50 @t51)))))
% 0.47/0.64  (assume @p33 (not (exists @t54 (tptp.less @t50 tptp.n0))))
% 0.47/0.64  (assume @p34 (forall @t54 (= (tptp.less @t50 tptp.n1) (tptp.less_or_equal @t50 tptp.n0))))
% 0.47/0.64  (assume @p35 (forall @t54 (= (tptp.less @t50 tptp.n2) (tptp.less_or_equal @t50 tptp.n1))))
% 0.47/0.64  (assume @p36 (forall @t54 (= (tptp.less @t50 tptp.n3) (tptp.less_or_equal @t50 tptp.n2))))
% 0.47/0.64  (assume @p37 (forall @t54 (= (tptp.less @t50 tptp.n4) (tptp.less_or_equal @t50 tptp.n3))))
% 0.47/0.64  (assume @p38 (forall @t54 (= (tptp.less @t50 tptp.n5) (tptp.less_or_equal @t50 tptp.n4))))
% 0.47/0.64  (assume @p39 (forall @t54 (= (tptp.less @t50 tptp.n6) (tptp.less_or_equal @t50 tptp.n5))))
% 0.47/0.64  (assume @p40 (forall @t54 (= (tptp.less @t50 tptp.n7) (tptp.less_or_equal @t50 tptp.n6))))
% 0.47/0.64  (assume @p41 (forall @t54 (= (tptp.less @t50 tptp.n8) (tptp.less_or_equal @t50 tptp.n7))))
% 0.47/0.64  (assume @p42 (forall @t54 (= (tptp.less @t50 tptp.n9) (tptp.less_or_equal @t50 tptp.n8))))
% 0.47/0.64  (assume @p43 (forall @t52 (= @t53 (and (not (tptp.less @t51 @t50)) (not (= @t51 @t50))))))
% 0.47/0.64  (assume @p44 (not (tptp.holdsAt tptp.forwards tptp.n0)))
% 0.47/0.64  (assume @p45 (not (tptp.holdsAt tptp.backwards tptp.n0)))
% 0.47/0.64  (assume @p46 (not (tptp.holdsAt tptp.spinning tptp.n0)))
% 0.47/0.64  (assume @p47 (forall @t24 @t31))
% 0.47/0.64  (assume @p48 (not (not @t55)))
% 0.47/0.64  (assume @p49 true)
% 0.47/0.64  (step @p50 :rule aci_norm :args ((= (and true @t48 @t57) @t58)))
% 0.47/0.64  (step @p51 :rule refl :args (@t57))
% 0.47/0.64  (step @p52 :rule refl :args (@t48))
% 0.47/0.64  (step @p53 :rule eq-refl :args (tptp.pull))
% 0.47/0.64  (step @p54 :rule nary_cong :premises (@p53 @p52 @p51) :args (@t60))
% 0.47/0.64  (step @p55 :rule trans :premises (@p54 @p50))
% 0.47/0.64  (step @p56 :rule refl :args (@t62))
% 0.47/0.64  (step @p57 :rule eq-symm :args (tptp.pull tptp.push))
% 0.47/0.64  (step @p58 :rule nary_cong :premises (@p57 @p52 @p56) :args (@t64))
% 0.47/0.64  (step @p59 :rule aci_norm :args ((= (and true @t47 @t56) @t65)))
% 0.47/0.64  (step @p60 :rule refl :args (@t56))
% 0.47/0.64  (step @p61 :rule refl :args (@t47))
% 0.47/0.64  (step @p62 :rule nary_cong :premises (@p53 @p61 @p60) :args (@t66))
% 0.47/0.64  (step @p63 :rule trans :premises (@p62 @p59))
% 0.47/0.64  (step @p64 :rule aci_norm :args ((= (and true true @t56) @t56)))
% 0.47/0.64  (step @p65 :rule eq-refl :args (tptp.forwards))
% 0.47/0.64  (step @p66 :rule nary_cong :premises (@p53 @p65 @p60) :args (@t68))
% 0.47/0.64  (step @p67 :rule trans :premises (@p66 @p64))
% 0.47/0.64  (step @p68 :rule aci_norm :args ((= (and true true @t57) @t57)))
% 0.47/0.64  (step @p69 :rule nary_cong :premises (@p53 @p65 @p51) :args (@t69))
% 0.47/0.64  (step @p70 :rule trans :premises (@p69 @p68))
% 0.47/0.64  (step @p71 :rule nary_cong :premises (@p57 @p61 @p56) :args (@t70))
% 0.47/0.64  (step @p72 :rule nary_cong :premises (@p71 @p70 @p67 @p63 @p58 @p55) :args (@t71))
% 0.47/0.64  (step @p73 :rule refl :args (@t72))
% 0.47/0.64  (step @p74 :rule cong :premises (@p73 @p72) :args (@t73))
% 0.47/0.64  (step @p75 :rule refl :args (@t43))
% 0.47/0.64  (step @p76 :rule cong :premises (@p75 @p74) :args ((=> @t43 @t73)))
% 0.47/0.64  (assume-push @p144 @t43)
% 0.47/0.64  (step @p78 :rule instantiate :premises (@p14) :args ((@list tptp.pull tptp.forwards tptp.n1)))
% 0.47/0.64  (step-pop @p145 :rule scope :premises (@p78))
% 0.47/0.64  (step @p79 :rule process_scope :premises (@p145) :args (@t73))
% 0.47/0.64  (step @p81 :rule eq_resolve :premises (@p79 @p76))
% 0.47/0.64  (step @p82 :rule implies_elim :premises (@p81))
% 0.47/0.64  (step @p83 :rule chain_m_resolution :premises (@p82 @p14) :args (@t75 @t76 (@list @t43)))
% 0.47/0.64  (step @p84 :rule aci_norm :args ((= (or (or @t78 @t77) @t25) (or @t78 @t77 @t25))))
% 0.47/0.64  (step @p85 :rule refl :args (@t25))
% 0.47/0.64  (step @p86 :rule bool-and-de-morgan :args (@t9 @t4 true))
% 0.47/0.64  (step @p87 :rule nary_cong :premises (@p86 @p85) :args ((or (not @t19) @t25)))
% 0.47/0.64  (step @p88 :rule trans :premises (@p87 @p84))
% 0.47/0.64  (step @p89 :rule bool-impl-elim :args (@t19 @t25))
% 0.47/0.64  (step @p90 :rule trans :premises (@p89 @p88))
% 0.47/0.64  (step @p91 :rule cong :premises (@p90) :args (@t33))
% 0.47/0.64  (step @p92 :rule eq_resolve :premises (@p10 @p91))
% 0.47/0.64  (step @p93 :rule instantiate :premises (@p92) :args ((@list tptp.pull tptp.n1 tptp.forwards)))
% 0.47/0.64  (step @p94 :rule bool-eq-true :args (@t61))
% 0.47/0.64  (step @p95 :rule absorb :args ((= (or (and @t46 (= tptp.n0 tptp.n1)) true @t79 (and @t46 @t79)) true)))
% 0.47/0.64  (step @p96 :rule refl :args (@t79))
% 0.47/0.64  (step @p97 :rule nary_cong :premises (@p57 @p96) :args (@t80))
% 0.47/0.64  (step @p98 :rule aci_norm :args ((= (and true @t79) @t79)))
% 0.47/0.64  (step @p99 :rule nary_cong :premises (@p53 @p96) :args (@t81))
% 0.47/0.64  (step @p100 :rule trans :premises (@p99 @p98))
% 0.47/0.64  (step @p101 :rule evaluate :args ((and true true)))
% 0.47/0.64  (step @p102 :rule eq-refl :args (tptp.n1))
% 0.47/0.64  (step @p103 :rule nary_cong :premises (@p53 @p102) :args (@t82))
% 0.47/0.64  (step @p104 :rule trans :premises (@p103 @p101))
% 0.47/0.64  (step @p105 :rule eq-symm :args (tptp.n1 tptp.n0))
% 0.47/0.64  (step @p106 :rule nary_cong :premises (@p57 @p105) :args (@t83))
% 0.47/0.64  (step @p107 :rule nary_cong :premises (@p106 @p104 @p100 @p97) :args (@t84))
% 0.47/0.64  (step @p108 :rule trans :premises (@p107 @p95))
% 0.47/0.64  (step @p109 :rule refl :args (@t61))
% 0.47/0.64  (step @p110 :rule cong :premises (@p109 @p108) :args (@t85))
% 0.47/0.64  (step @p111 :rule trans :premises (@p110 @p94))
% 0.47/0.64  (step @p112 :rule refl :args (@t45))
% 0.47/0.64  (step @p113 :rule cong :premises (@p112 @p111) :args ((=> @t45 @t85)))
% 0.47/0.65  (assume-push @p146 @t45)
% 0.47/0.65  (step @p115 :rule instantiate :premises (@p16) :args ((@list tptp.pull tptp.n1)))
% 0.47/0.65  (step-pop @p147 :rule scope :premises (@p115))
% 0.47/0.65  (step @p116 :rule process_scope :premises (@p147) :args (@t85))
% 0.47/0.65  (step @p118 :rule eq_resolve :premises (@p116 @p113))
% 0.47/0.65  (step @p119 :rule implies_elim :premises (@p118))
% 0.47/0.65  (step @p120 :rule chain_m_resolution :premises (@p119 @p16) :args (@t61 @t76 (@list @t45)))
% 0.47/0.65  (step @p121 :rule bool-double-not-elim :args (@t55))
% 0.47/0.65  (step @p122 :rule eq_resolve :premises (@p48 @p121))
% 0.47/0.65  (step @p123 :rule true_intro :premises (@p122))
% 0.47/0.65  (step @p124 :rule refl :args (tptp.forwards))
% 0.47/0.65  (step @p125 :rule cong :premises (@p124 @p25) :args (@t86))
% 0.47/0.65  (step @p126 :rule trans :premises (@p125 @p123))
% 0.47/0.65  (step @p127 :rule true_elim :premises (@p126))
% 0.47/0.65  (step @p128 :rule cnf_or_pos :args (@t89))
% 0.47/0.65  (step @p129 :rule reordering :premises (@p128) :args ((or @t87 @t62 @t88 (not @t89))))
% 0.47/0.65  (step @p130 :rule chain_m_resolution :premises (@p129 @p127 @p120 @p93) :args (@t88 (@list false false false) (@list @t86 @t61 @t89)))
% 0.47/0.65  (step @p131 :rule cnf_equiv_pos2 :args (@t75))
% 0.47/0.65  (step @p132 :rule reordering :premises (@p131) :args ((or @t72 @t90 (not @t75))))
% 0.47/0.65  (step @p133 :rule chain_m_resolution :premises (@p132 @p130 @p83) :args (@t90 (@list true false) (@list @t72 @t75)))
% 0.47/0.65  (step @p134 :rule bool-double-not-elim :args (@t56))
% 0.47/0.65  (step @p135 :rule refl :args (@t74))
% 0.47/0.65  (step @p136 :rule nary_cong :premises (@p135 @p134) :args ((or @t74 (not @t57))))
% 0.47/0.65  (step @p137 :rule cnf_or_neg :args (@t74 1))
% 0.47/0.65  (step @p138 :rule eq_resolve :premises (@p137 @p136))
% 0.47/0.65  (step @p139 :rule reordering :premises (@p138) :args ((or @t56 @t74)))
% 0.47/0.65  (step @p140 :rule chain_m_resolution :premises (@p139 @p133) :args (@t56 (@list true) (@list @t74)))
% 0.47/0.65  (step @p141 :rule cnf_or_neg :args (@t74 2))
% 0.47/0.65  (step @p142 :rule reordering :premises (@p141) :args ((or @t57 @t74)))
% 0.47/0.65  (step @p143 false :rule chain_m_resolution :premises (@p142 @p140 @p133) :args (false (@list false true) (@list @t56 @t74)))
% 0.47/0.65  )
% 0.47/0.65  % SZS output end Proof
% 0.47/0.65  % cvc5 exiting
%------------------------------------------------------------------------------