↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : GEO147+1 : TPTP v9.2.1. Released v2.4.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:16:28 AM UTC 2026

% Result   : Theorem 0.41s 0.59s
% Output   : Proof 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO147+1 : TPTP v9.2.1. Released v2.4.0.
% 0.13/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.34  % Computer : n010.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Mon Jun  1 23:33:10 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.32/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.41/0.59  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.41/0.59  % SZS status Theorem
% 0.41/0.59  % SZS output start Proof
% 0.41/0.59  (
% 0.41/0.59  (declare-sort $$unsorted 0)
% 0.41/0.59  (declare-const tptp.trajectory_of (-> $$unsorted $$unsorted))
% 0.41/0.59  (declare-const tptp.connect (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.once (-> $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.at (-> $$unsorted $$unsorted $$unsorted))
% 0.41/0.59  (declare-const tptp.finish_point (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.inner_point (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.part_of (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.sum (-> $$unsorted $$unsorted $$unsorted))
% 0.41/0.59  (declare-const tptp.at_the_same_time (-> $$unsorted $$unsorted $$unsorted))
% 0.41/0.59  (declare-const tptp.end_point (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.meet (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.open (-> $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.ordered_by (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.start_point (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.incident_c (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.closed (-> $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.between_o (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.underlying_curve (-> $$unsorted $$unsorted))
% 0.41/0.59  (declare-const tptp.between_c (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.41/0.59  (declare-const tptp.incident_o (-> $$unsorted $$unsorted Bool))
% 0.41/0.59  (define @t1 () (@var "C" $$unsorted))
% 0.41/0.59  (define @t2 () (@var "P" $$unsorted))
% 0.41/0.59  (define @t3 () (tptp.incident_c @t2 @t1))
% 0.41/0.59  (define @t4 () (@var "C1" $$unsorted))
% 0.41/0.59  (define @t5 () (tptp.incident_c @t2 @t4))
% 0.41/0.59  (define @t6 () (@list @t2))
% 0.41/0.59  (define @t7 () (tptp.part_of @t4 @t1))
% 0.41/0.59  (define @t8 () (@list @t1 @t4))
% 0.41/0.59  (define @t9 () (@var "C2" $$unsorted))
% 0.41/0.59  (define @t10 () (@var "Q" $$unsorted))
% 0.41/0.59  (define @t11 () (tptp.incident_c @t10 @t4))
% 0.41/0.59  (define @t12 () (tptp.incident_c @t10 @t1))
% 0.41/0.59  (define @t13 () (@list @t10))
% 0.41/0.59  (define @t14 () (= @t1 (tptp.sum @t4 @t9)))
% 0.41/0.59  (define @t15 () (tptp.part_of @t9 @t4))
% 0.41/0.59  (define @t16 () (tptp.part_of @t4 @t9))
% 0.41/0.59  (define @t17 () (tptp.part_of @t9 @t1))
% 0.41/0.59  (define @t18 () (@list @t4 @t9))
% 0.41/0.59  (define @t19 () (tptp.end_point @t2 @t1))
% 0.41/0.59  (define @t20 () (@list @t2 @t1))
% 0.41/0.59  (define @t21 () (tptp.inner_point @t2 @t1))
% 0.41/0.59  (define @t22 () (tptp.end_point @t10 @t4))
% 0.41/0.59  (define @t23 () (tptp.end_point @t10 @t1))
% 0.41/0.59  (define @t24 () (exists @t6 @t19))
% 0.41/0.59  (define @t25 () (tptp.closed @t1))
% 0.41/0.59  (define @t26 () (@list @t1))
% 0.41/0.59  (define @t27 () (tptp.open @t1))
% 0.41/0.59  (define @t28 () (@var "C3" $$unsorted))
% 0.41/0.59  (define @t29 () (tptp.meet @t2 @t4 @t9))
% 0.41/0.59  (define @t30 () (@list @t1 @t2))
% 0.41/0.59  (define @t31 () (@var "R" $$unsorted))
% 0.41/0.59  (define @t32 () (= @t2 @t31))
% 0.41/0.59  (define @t33 () (= @t2 @t10))
% 0.41/0.59  (define @t34 () (@list @t1 @t2 @t10 @t31))
% 0.41/0.59  (define @t35 () (not @t33))
% 0.41/0.59  (define @t36 () (@var "Cpp" $$unsorted))
% 0.41/0.59  (define @t37 () (tptp.between_c @t1 @t2 @t10 @t31))
% 0.41/0.59  (define @t38 () (@var "O" $$unsorted))
% 0.41/0.59  (define @t39 () (tptp.ordered_by @t38 @t10 @t2))
% 0.41/0.59  (define @t40 () (tptp.ordered_by @t38 @t2 @t10))
% 0.41/0.59  (define @t41 () (tptp.between_o @t38 @t2 @t10 @t31))
% 0.41/0.59  (define @t42 () (tptp.incident_o @t10 @t38))
% 0.41/0.59  (define @t43 () (and @t35 @t42))
% 0.41/0.59  (define @t44 () (tptp.incident_o @t2 @t38))
% 0.41/0.59  (define @t45 () (tptp.start_point @t2 @t38))
% 0.41/0.59  (define @t46 () (@list @t2 @t38))
% 0.41/0.59  (define @t47 () (forall @t6 (= @t44 @t3)))
% 0.41/0.59  (define @t48 () (@list @t38))
% 0.41/0.59  (define @t49 () (@var "O2" $$unsorted))
% 0.41/0.59  (define @t50 () (@var "O1" $$unsorted))
% 0.41/0.59  (define @t51 () (@var "Y" $$unsorted))
% 0.41/0.59  (define @t52 () (@var "X" $$unsorted))
% 0.41/0.59  (define @t53 () (tptp.at @t52 @t2))
% 0.41/0.59  (define @t54 () (tptp.connect @t52 @t51 @t2))
% 0.41/0.59  (define @t55 () (@var "A" $$unsorted))
% 0.41/0.59  (define @t56 () (@var "B" $$unsorted))
% 0.41/0.59  (define @t57 () (tptp.at_the_same_time @t55 @t56))
% 0.41/0.59  (define @t58 () (tptp.once @t57))
% 0.41/0.59  (define @t59 () (@list @t55 @t56))
% 0.41/0.59  (define @t60 () (tptp.once @t55))
% 0.41/0.59  (define @t61 () (@list @t55))
% 0.41/0.59  (define @t62 () (and @t60 (tptp.once @t56)))
% 0.41/0.59  (define @t63 () (forall @t59 (=> @t58 @t62)))
% 0.41/0.59  (define @t64 () (tptp.trajectory_of @t52))
% 0.41/0.59  (define @t65 () (tptp.incident_o @t2 @t64))
% 0.41/0.59  (define @t66 () (forall (@list @t52 @t2) (= (tptp.once @t53) @t65)))
% 0.41/0.59  (define @t67 () (@list @t52))
% 0.41/0.59  (define @t68 () (@var "P2" $$unsorted))
% 0.41/0.59  (define @t69 () (@var "Q2" $$unsorted))
% 0.41/0.59  (define @t70 () (tptp.trajectory_of @t51))
% 0.41/0.59  (define @t71 () (@var "Q1" $$unsorted))
% 0.41/0.59  (define @t72 () (@var "P1" $$unsorted))
% 0.41/0.59  (define @t73 () (and @t65 (tptp.incident_o @t2 @t70)))
% 0.41/0.59  (define @t74 () (@list @t2 @t52 @t51))
% 0.41/0.59  (define @t75 () (forall @t74 (=> @t54 @t73)))
% 0.41/0.59  (define @t76 () (not @t75))
% 0.41/0.59  (define @t77 () (forall @t74 (or (not @t54) @t73)))
% 0.41/0.59  (define @t78 () (@quantifiers_skolemize @t77 2))
% 0.41/0.59  (define @t79 () (@quantifiers_skolemize @t77 0))
% 0.41/0.59  (define @t80 () (tptp.incident_o @t79 (tptp.trajectory_of @t78)))
% 0.41/0.59  (define @t81 () (@quantifiers_skolemize @t77 1))
% 0.41/0.59  (define @t82 () (tptp.incident_o @t79 (tptp.trajectory_of @t81)))
% 0.41/0.59  (define @t83 () (and @t82 @t80))
% 0.41/0.59  (define @t84 () (tptp.connect @t81 @t78 @t79))
% 0.41/0.59  (define @t85 () (not @t84))
% 0.41/0.59  (define @t86 () (or @t85 @t83))
% 0.41/0.59  (define @t87 () (@list true))
% 0.41/0.59  (define @t88 () (@list @t86))
% 0.41/0.59  (define @t89 () (tptp.at @t81 @t79))
% 0.41/0.59  (define @t90 () (tptp.once @t89))
% 0.41/0.59  (define @t91 () (= @t90 @t82))
% 0.41/0.59  (define @t92 () (= @t82 @t90))
% 0.41/0.59  (define @t93 () (@list false))
% 0.41/0.59  (define @t94 () (@list @t66))
% 0.41/0.59  (define @t95 () (tptp.at @t78 @t79))
% 0.41/0.59  (define @t96 () (tptp.once (tptp.at_the_same_time @t89 @t95)))
% 0.41/0.59  (define @t97 () (= @t84 @t96))
% 0.41/0.59  (define @t98 () (@list false false))
% 0.41/0.59  (define @t99 () (tptp.once @t95))
% 0.41/0.59  (define @t100 () (and @t90 @t99))
% 0.41/0.59  (define @t101 () (not @t96))
% 0.41/0.59  (define @t102 () (or @t101 @t100))
% 0.41/0.59  (define @t103 () (not @t100))
% 0.41/0.59  (define @t104 () (@list @t100))
% 0.41/0.59  (define @t105 () (= @t99 @t80))
% 0.41/0.59  (define @t106 () (= @t80 @t99))
% 0.41/0.59  (assume @p1 (forall @t8 (= @t7 (forall @t6 (=> @t5 @t3)))))
% 0.41/0.59  (assume @p2 (forall (@list @t1 @t4 @t9) (= @t14 (forall @t13 (= @t12 (or @t11 (tptp.incident_c @t10 @t9)))))))
% 0.41/0.59  (assume @p3 (forall @t20 (= @t19 (and @t3 (forall @t18 (=> (and @t7 @t17 @t5 (tptp.incident_c @t2 @t9)) (or @t16 @t15)))))))
% 0.41/0.59  (assume @p4 (forall @t20 (= @t21 (and @t3 (not @t19)))))
% 0.41/0.59  (assume @p5 (forall (@list @t2 @t1 @t4) (= (tptp.meet @t2 @t1 @t4) (and @t3 @t5 (forall @t13 (=> (and @t12 @t11) (and @t23 @t22)))))))
% 0.41/0.59  (assume @p6 (forall @t26 (= @t25 (not @t24))))
% 0.41/0.59  (assume @p7 (forall @t26 (= @t27 @t24)))
% 0.41/0.59  (assume @p8 (forall @t8 (=> (and @t7 (not (= @t4 @t1))) (tptp.open @t4))))
% 0.41/0.59  (assume @p9 (forall (@list @t1 @t4 @t9 @t28) (=> (and @t7 @t17 (tptp.part_of @t28 @t1) (exists @t6 (and (tptp.end_point @t2 @t4) (tptp.end_point @t2 @t9) (tptp.end_point @t2 @t28)))) (or (tptp.part_of @t9 @t28) (tptp.part_of @t28 @t9) @t16 @t15 (tptp.part_of @t4 @t28) (tptp.part_of @t28 @t4)))))
% 0.41/0.59  (assume @p10 (forall @t26 (exists @t6 @t21)))
% 0.41/0.59  (assume @p11 (forall @t30 (=> @t21 (exists @t18 (and @t29 @t14)))))
% 0.41/0.59  (assume @p12 (forall @t34 (=> (and @t19 @t23 (tptp.end_point @t31 @t1)) (or @t33 @t32 (= @t10 @t31)))))
% 0.41/0.59  (assume @p13 (forall @t30 (=> @t19 (exists @t13 (and @t23 @t35)))))
% 0.41/0.59  (assume @p14 (forall (@list @t1 @t4 @t9 @t2) (=> (and @t25 @t29 @t14) (forall @t13 (=> @t22 (tptp.meet @t10 @t4 @t9))))))
% 0.41/0.59  (assume @p15 (forall @t18 (=> (exists @t6 @t29) (exists @t26 @t14))))
% 0.41/0.59  (assume @p16 (forall @t8 (=> (forall @t6 (= @t3 @t5)) (= @t1 @t4))))
% 0.41/0.59  (assume @p17 (forall @t34 (= @t37 (and (not @t32) (exists (@list @t36) (and (tptp.part_of @t36 @t1) (tptp.end_point @t2 @t36) (tptp.end_point @t31 @t36) (tptp.inner_point @t10 @t36)))))))
% 0.41/0.59  (assume @p18 (forall (@list @t38 @t2 @t10 @t31) (= @t41 (or (and @t40 (tptp.ordered_by @t38 @t10 @t31)) (and (tptp.ordered_by @t38 @t31 @t10) @t39)))))
% 0.41/0.59  (assume @p19 (forall @t46 (= @t45 (and @t44 (forall @t13 (=> @t43 @t40))))))
% 0.41/0.59  (assume @p20 (forall @t46 (= (tptp.finish_point @t2 @t38) (and @t44 (forall @t13 (=> @t43 @t39))))))
% 0.41/0.59  (assume @p21 (forall (@list @t38 @t2 @t10) (=> @t40 (and @t44 @t42))))
% 0.41/0.59  (assume @p22 (forall @t48 (exists @t26 (and @t27 @t47))))
% 0.41/0.59  (assume @p23 (forall (@list @t2 @t10 @t31 @t38) (= @t41 (exists @t26 (and @t47 @t37)))))
% 0.41/0.59  (assume @p24 (forall @t48 (exists @t6 @t45)))
% 0.41/0.59  (assume @p25 (forall (@list @t2 @t10 @t1) (=> (and @t27 @t35 @t3 @t12) (exists @t48 (and (forall (@list @t31) (= (tptp.incident_o @t31 @t38) (tptp.incident_c @t31 @t1))) @t40)))))
% 0.41/0.59  (assume @p26 (forall (@list @t50 @t49) (=> (forall (@list @t2 @t10) (= (tptp.ordered_by @t50 @t2 @t10) (tptp.ordered_by @t49 @t2 @t10))) (= @t50 @t49))))
% 0.41/0.59  (assume @p27 (forall (@list @t1 @t38) (= (= @t1 (tptp.underlying_curve @t38)) @t47)))
% 0.41/0.59  (assume @p28 (forall (@list @t52 @t51 @t2) (= @t54 (tptp.once (tptp.at_the_same_time @t53 (tptp.at @t51 @t2))))))
% 0.41/0.59  (assume @p29 (forall @t59 (= @t58 (tptp.once (tptp.at_the_same_time @t56 @t55)))))
% 0.41/0.59  (assume @p30 (forall (@list @t55 @t56 @t1) (= (tptp.once (tptp.at_the_same_time @t57 @t1)) (tptp.once (tptp.at_the_same_time @t55 (tptp.at_the_same_time @t56 @t1))))))
% 0.41/0.59  (assume @p31 (forall @t61 (=> @t60 (tptp.once (tptp.at_the_same_time @t55 @t55)))))
% 0.41/0.59  (assume @p32 @t63)
% 0.41/0.59  (assume @p33 @t66)
% 0.41/0.59  (assume @p34 (forall @t67 (exists @t48 (= @t64 @t38))))
% 0.41/0.59  (assume @p35 (forall (@list @t72 @t68 @t71 @t69 @t52 @t51) (=> (and (tptp.once (tptp.at_the_same_time (tptp.at @t52 @t72) (tptp.at @t51 @t68))) (tptp.once (tptp.at_the_same_time (tptp.at @t52 @t71) (tptp.at @t51 @t69)))) (not (and (tptp.ordered_by @t64 @t72 @t71) (tptp.ordered_by @t70 @t69 @t68))))))
% 0.41/0.59  (assume @p36 (forall @t61 (=> @t60 (forall @t67 (exists @t6 (tptp.once (tptp.at_the_same_time @t55 @t53)))))))
% 0.41/0.59  (assume @p37 @t76)
% 0.41/0.59  (assume @p38 true)
% 0.41/0.59  (step @p39 :rule bool-impl-elim :args (@t54 @t73))
% 0.41/0.59  (step @p40 :rule cong :premises (@p39) :args (@t75))
% 0.41/0.59  (step @p41 :rule cong :premises (@p40) :args (@t76))
% 0.41/0.59  (step @p42 :rule eq_resolve :premises (@p37 @p41))
% 0.41/0.59  (step @p43 :rule skolemize :premises (@p42))
% 0.41/0.59  (step @p44 :rule cnf_or_neg :args (@t86 1))
% 0.41/0.59  (step @p45 :rule chain_m_resolution :premises (@p44 @p43) :args ((not @t83) @t87 @t88))
% 0.41/0.59  (step @p46 :rule eq-symm :args (@t90 @t82))
% 0.41/0.59  (step @p47 :rule refl :args (@t66))
% 0.41/0.59  (step @p48 :rule cong :premises (@p47 @p46) :args ((=> @t66 @t91)))
% 0.41/0.59  (assume-push @p97 @t66)
% 0.41/0.59  (step @p50 :rule instantiate :premises (@p33) :args ((@list @t81 @t79)))
% 0.41/0.59  (step-pop @p98 :rule scope :premises (@p50))
% 0.41/0.59  (step @p51 :rule process_scope :premises (@p98) :args (@t91))
% 0.41/0.59  (step @p53 :rule eq_resolve :premises (@p51 @p48))
% 0.41/0.59  (step @p54 :rule implies_elim :premises (@p53))
% 0.41/0.59  (step @p55 :rule chain_m_resolution :premises (@p54 @p33) :args (@t92 @t93 @t94))
% 0.41/0.59  (step @p56 :rule bool-impl-elim :args (@t58 @t62))
% 0.41/0.59  (step @p57 :rule cong :premises (@p56) :args (@t63))
% 0.41/0.59  (step @p58 :rule eq_resolve :premises (@p32 @p57))
% 0.41/0.59  (step @p59 :rule instantiate :premises (@p58) :args ((@list @t89 @t95)))
% 0.41/0.59  (step @p60 :rule instantiate :premises (@p28) :args ((@list @t81 @t78 @t79)))
% 0.41/0.59  (step @p61 :rule bool-double-not-elim :args (@t84))
% 0.41/0.59  (step @p62 :rule refl :args (@t86))
% 0.41/0.59  (step @p63 :rule nary_cong :premises (@p62 @p61) :args ((or @t86 (not @t85))))
% 0.41/0.59  (step @p64 :rule cnf_or_neg :args (@t86 0))
% 0.41/0.59  (step @p65 :rule eq_resolve :premises (@p64 @p63))
% 0.41/0.59  (step @p66 :rule reordering :premises (@p65) :args ((or @t84 @t86)))
% 0.41/0.59  (step @p67 :rule chain_m_resolution :premises (@p66 @p43) :args (@t84 @t87 @t88))
% 0.41/0.59  (step @p68 :rule cnf_equiv_pos1 :args (@t97))
% 0.41/0.59  (step @p69 :rule reordering :premises (@p68) :args ((or @t85 @t96 (not @t97))))
% 0.41/0.59  (step @p70 :rule chain_m_resolution :premises (@p69 @p67 @p60) :args (@t96 @t98 (@list @t84 @t97)))
% 0.41/0.59  (step @p71 :rule cnf_or_pos :args (@t102))
% 0.41/0.59  (step @p72 :rule reordering :premises (@p71) :args ((or @t101 @t100 (not @t102))))
% 0.41/0.59  (step @p73 :rule chain_m_resolution :premises (@p72 @p70 @p59) :args (@t100 @t98 (@list @t96 @t102)))
% 0.41/0.59  (step @p74 :rule cnf_and_pos :args (@t100 0))
% 0.41/0.59  (step @p75 :rule reordering :premises (@p74) :args ((or @t90 @t103)))
% 0.41/0.59  (step @p76 :rule chain_m_resolution :premises (@p75 @p73) :args (@t90 @t93 @t104))
% 0.41/0.59  (step @p77 :rule cnf_equiv_pos2 :args (@t92))
% 0.41/0.59  (step @p78 :rule reordering :premises (@p77) :args ((or @t82 (not @t90) (not @t92))))
% 0.41/0.59  (step @p79 :rule chain_m_resolution :premises (@p78 @p76 @p55) :args (@t82 @t98 (@list @t90 @t92)))
% 0.41/0.59  (step @p80 :rule eq-symm :args (@t99 @t80))
% 0.41/0.59  (step @p81 :rule cong :premises (@p47 @p80) :args ((=> @t66 @t105)))
% 0.41/0.59  (assume-push @p99 @t66)
% 0.41/0.59  (step @p83 :rule instantiate :premises (@p33) :args ((@list @t78 @t79)))
% 0.41/0.59  (step-pop @p100 :rule scope :premises (@p83))
% 0.41/0.59  (step @p84 :rule process_scope :premises (@p100) :args (@t105))
% 0.41/0.59  (step @p86 :rule eq_resolve :premises (@p84 @p81))
% 0.41/0.59  (step @p87 :rule implies_elim :premises (@p86))
% 0.41/0.59  (step @p88 :rule chain_m_resolution :premises (@p87 @p33) :args (@t106 @t93 @t94))
% 0.41/0.59  (step @p89 :rule cnf_and_pos :args (@t100 1))
% 0.41/0.59  (step @p90 :rule reordering :premises (@p89) :args ((or @t99 @t103)))
% 0.41/0.59  (step @p91 :rule chain_m_resolution :premises (@p90 @p73) :args (@t99 @t93 @t104))
% 0.41/0.59  (step @p92 :rule cnf_equiv_pos2 :args (@t106))
% 0.41/0.59  (step @p93 :rule reordering :premises (@p92) :args ((or @t80 (not @t99) (not @t106))))
% 0.41/0.59  (step @p94 :rule chain_m_resolution :premises (@p93 @p91 @p88) :args (@t80 @t98 (@list @t99 @t106)))
% 0.41/0.59  (step @p95 :rule cnf_and_neg :args (@t83))
% 0.41/0.59  (step @p96 false :rule chain_m_resolution :premises (@p95 @p94 @p79 @p45) :args (false (@list false false true) (@list @t80 @t82 @t83)))
% 0.41/0.59  )
% 0.41/0.59  % SZS output end Proof
% 0.41/0.59  % cvc5 exiting
%------------------------------------------------------------------------------