%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL591^1 : TPTP v9.3.1. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n018.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:23:07 AM UTC 2026 % Result : Theorem 0.21s 0.52s % Output : Proof 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL591^1 : TPTP v9.3.1. Released v3.6.0. % 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.11/0.37 % Computer : n018.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Sun Sep 6 00:07:35 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.44 %----Proving TH0 % 0.21/0.52 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.21/0.52 % SZS status Theorem % 0.21/0.52 % SZS output start Proof % 0.21/0.52 ( % 0.21/0.52 (declare-sort $$unsorted 0) % 0.21/0.52 (declare-sort tptp.individuals 0) % 0.21/0.52 (define tptp.mfalse () (lambda (@list (@var "X" $$unsorted)) false)) % 0.21/0.52 (define tptp.mtrue () (lambda (@list (@var "X" $$unsorted)) true)) % 0.21/0.52 (define tptp.mnot () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (not (_ _let_2 _let_1)))))) % 0.21/0.52 (define tptp.mor () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (or (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.21/0.52 (define tptp.mand () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.21/0.52 (define tptp.mimpl () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "V" (-> $$unsorted Bool)))) (let ((_let_3 (@var "U" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1)))))) % 0.21/0.52 (define tptp.miff () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "U" (-> $$unsorted Bool)))) (let ((_let_3 (@var "V" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.mand (_ (_ tptp.mimpl _let_2) _let_3)) (_ (_ tptp.mimpl _let_3) _let_2)) _let_1)))))) % 0.21/0.52 (define tptp.mbox () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3) (forall (@list _let_1) (=> (_ (_ _let_4 _let_3) _let_1) (_ _let_2 _let_1))))))))) % 0.21/0.52 (define tptp.mdia () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3) (exists (@list _let_1) (and (_ (_ _let_4 _let_3) _let_1) (_ _let_2 _let_1))))))))) % 0.21/0.52 (define tptp.mall () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" tptp.individuals))) (let ((_let_3 (@var "P" (-> tptp.individuals $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.21/0.52 (define tptp.mexists () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" tptp.individuals))) (let ((_let_3 (@var "P" (-> tptp.individuals $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (exists (@list _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.21/0.52 (define tptp.mvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ _let_2 _let_1)))))) % 0.21/0.52 (define tptp.msatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (_ _let_2 _let_1)))))) % 0.21/0.52 (define tptp.mcountersatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.21/0.52 (define tptp.minvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.21/0.52 (define @t1 () (@var "A" (-> $$unsorted Bool))) % 0.21/0.52 (define @t2 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.21/0.52 (define @t3 () (=> (_ tptp.mvalid @t1) (_ tptp.mvalid (_ (_ tptp.mbox @t2) @t1)))) % 0.21/0.52 (define @t4 () (@list @t2 @t1)) % 0.21/0.52 (define @t5 () (forall @t4 @t3)) % 0.21/0.52 (define @t6 () (not @t5)) % 0.21/0.52 (define @t7 () (@var "X" $$unsorted)) % 0.21/0.52 (define @t8 () (@list @t7)) % 0.21/0.52 (define @t9 () (lambda @t8 false)) % 0.21/0.52 (define @t10 () (lambda @t8 true)) % 0.21/0.52 (define @t11 () (@var "U" $$unsorted)) % 0.21/0.52 (define @t12 () (@var "X" (-> $$unsorted Bool))) % 0.21/0.52 (define @t13 () (_ @t12 @t11)) % 0.21/0.52 (define @t14 () (lambda (@list @t12 @t11) (not @t13))) % 0.21/0.52 (define @t15 () (@var "Y" (-> $$unsorted Bool))) % 0.21/0.52 (define @t16 () (_ @t15 @t11)) % 0.21/0.52 (define @t17 () (@list @t12 @t15 @t11)) % 0.21/0.52 (define @t18 () (lambda @t17 (or @t13 @t16))) % 0.21/0.52 (define @t19 () (lambda @t17 (and @t13 @t16))) % 0.21/0.52 (define @t20 () (@var "__flatten_var_0" $$unsorted)) % 0.21/0.52 (define @t21 () (@var "V" (-> $$unsorted Bool))) % 0.21/0.52 (define @t22 () (@var "U" (-> $$unsorted Bool))) % 0.21/0.52 (define @t23 () (@list @t22 @t21 @t20)) % 0.21/0.52 (define @t24 () (lambda @t23 (_ (_ (_ tptp.mor (_ tptp.mnot @t22)) @t21) @t20))) % 0.21/0.52 (define @t25 () (lambda @t23 (_ (_ (_ tptp.mand (_ (_ tptp.mimpl @t22) @t21)) (_ (_ tptp.mimpl @t21) @t22)) @t20))) % 0.21/0.52 (define @t26 () (@var "Y" $$unsorted)) % 0.21/0.52 (define @t27 () (@var "P" (-> $$unsorted Bool))) % 0.21/0.52 (define @t28 () (_ @t27 @t26)) % 0.21/0.52 (define @t29 () (_ (_ @t2 @t7) @t26)) % 0.21/0.52 (define @t30 () (@list @t26)) % 0.21/0.52 (define @t31 () (forall @t30 (=> @t29 @t28))) % 0.21/0.52 (define @t32 () (@list @t2 @t27 @t7)) % 0.21/0.52 (define @t33 () (lambda @t32 @t31)) % 0.21/0.52 (define @t34 () (lambda @t32 (exists @t30 (and @t29 @t28)))) % 0.21/0.52 (define @t35 () (@var "W" $$unsorted)) % 0.21/0.52 (define @t36 () (@var "X" tptp.individuals)) % 0.21/0.52 (define @t37 () (@var "P" (-> tptp.individuals $$unsorted Bool))) % 0.21/0.52 (define @t38 () (_ (_ @t37 @t36) @t35)) % 0.21/0.52 (define @t39 () (@list @t36)) % 0.21/0.52 (define @t40 () (@list @t37 @t35)) % 0.21/0.52 (define @t41 () (lambda @t40 (forall @t39 @t38))) % 0.21/0.52 (define @t42 () (lambda @t40 (exists @t39 @t38))) % 0.21/0.52 (define @t43 () (_ @t27 @t35)) % 0.21/0.52 (define @t44 () (@list @t35)) % 0.21/0.52 (define @t45 () (forall @t44 @t43)) % 0.21/0.52 (define @t46 () (@list @t27)) % 0.21/0.52 (define @t47 () (lambda @t46 @t45)) % 0.21/0.52 (define @t48 () (lambda @t46 (exists @t44 @t43))) % 0.21/0.52 (define @t49 () (not @t43)) % 0.21/0.52 (define @t50 () (lambda @t46 (exists @t44 @t49))) % 0.21/0.52 (define @t51 () (lambda @t46 (forall @t44 @t49))) % 0.21/0.52 (define @t52 () (@var "BOUND_VARIABLE_7792" $$unsorted)) % 0.21/0.52 (define @t53 () (_ @t1 @t52)) % 0.21/0.52 (define @t54 () (@var "BOUND_VARIABLE_7790" $$unsorted)) % 0.21/0.52 (define @t55 () (not (_ @t2 @t54 @t52))) % 0.21/0.52 (define @t56 () (forall @t44 (_ @t1 @t35))) % 0.21/0.52 (define @t57 () (not @t56)) % 0.21/0.52 (define @t58 () (or @t57 @t55 @t53)) % 0.21/0.52 (define @t59 () (or @t55 @t53)) % 0.21/0.52 (define @t60 () (or @t57 @t59)) % 0.21/0.52 (define @t61 () (@list @t2 @t1 @t54 @t52)) % 0.21/0.52 (define @t62 () (forall @t61 @t60)) % 0.21/0.52 (define @t63 () (@list @t54 @t52)) % 0.21/0.52 (define @t64 () (forall @t63 @t60)) % 0.21/0.52 (define @t65 () (forall @t63 @t59)) % 0.21/0.52 (define @t66 () (or @t57 @t65)) % 0.21/0.52 (define @t67 () (_ @t1 @t26)) % 0.21/0.52 (define @t68 () (or (not (_ @t2 @t35 @t26)) @t67)) % 0.21/0.52 (define @t69 () (forall (@list @t35 @t26) @t68)) % 0.21/0.52 (define @t70 () (forall @t30 @t68)) % 0.21/0.52 (define @t71 () (_ @t2 @t7 @t26)) % 0.21/0.52 (define @t72 () (not @t71)) % 0.21/0.52 (define @t73 () (lambda @t8 (forall @t30 (or @t72 @t67)))) % 0.21/0.52 (define @t74 () (_ @t73 @t35)) % 0.21/0.52 (define @t75 () (forall @t44 @t74)) % 0.21/0.52 (define @t76 () (_ @t27 @t35)) % 0.21/0.52 (define @t77 () (lambda @t46 (forall @t44 @t76))) % 0.21/0.52 (define @t78 () (_ @t27 @t26)) % 0.21/0.52 (define @t79 () (forall @t30 (or @t72 @t78))) % 0.21/0.52 (define @t80 () (lambda (@list @t27 @t7) @t79)) % 0.21/0.52 (define @t81 () (_ (lambda @t32 @t79) @t2)) % 0.21/0.52 (define @t82 () (_ @t77 @t1)) % 0.21/0.52 (define @t83 () (=> @t82 (_ @t77 (_ @t81 @t1)))) % 0.21/0.52 (define @t84 () (forall @t4 @t83)) % 0.21/0.52 (define @t85 () (not @t29)) % 0.21/0.52 (define @t86 () (or @t85 @t28)) % 0.21/0.52 (define @t87 () (forall @t61 @t58)) % 0.21/0.52 (define @t88 () (@quantifiers_skolemize @t87 1)) % 0.21/0.52 (define @t89 () (forall @t44 (_ @t88 @t35))) % 0.21/0.52 (define @t90 () (@quantifiers_skolemize @t87 3)) % 0.21/0.52 (define @t91 () (_ @t88 @t90)) % 0.21/0.52 (define @t92 () (not @t89)) % 0.21/0.52 (define @t93 () (or @t92 (not (_ (@quantifiers_skolemize @t87 0) (@quantifiers_skolemize @t87 2) @t90)) @t91)) % 0.21/0.52 (define @t94 () (@list true)) % 0.21/0.52 (define @t95 () (@list @t93)) % 0.21/0.52 (assume @p1 @t6) % 0.21/0.52 (assume @p2 true) % 0.21/0.52 (step @p3 (= tptp.mfalse @t9) :rule refl :args (@t9)) % 0.21/0.52 (step @p4 (= tptp.mtrue @t10) :rule refl :args (@t10)) % 0.21/0.52 (step @p5 (= tptp.mnot @t14) :rule refl :args (@t14)) % 0.21/0.52 (step @p6 (= tptp.mor @t18) :rule refl :args (@t18)) % 0.21/0.52 (step @p7 (= tptp.mand @t19) :rule refl :args (@t19)) % 0.21/0.52 (step @p8 (= tptp.mimpl @t24) :rule refl :args (@t24)) % 0.21/0.52 (step @p9 (= tptp.miff @t25) :rule refl :args (@t25)) % 0.21/0.52 (step @p10 (= tptp.mbox @t33) :rule refl :args (@t33)) % 0.21/0.52 (step @p11 (= tptp.mdia @t34) :rule refl :args (@t34)) % 0.21/0.52 (step @p12 (= tptp.mall @t41) :rule refl :args (@t41)) % 0.21/0.52 (step @p13 (= tptp.mexists @t42) :rule refl :args (@t42)) % 0.21/0.52 (step @p14 (= tptp.mvalid @t47) :rule refl :args (@t47)) % 0.21/0.52 (step @p15 (= tptp.msatisfiable @t48) :rule refl :args (@t48)) % 0.21/0.52 (step @p16 (= tptp.mcountersatisfiable @t50) :rule refl :args (@t50)) % 0.21/0.52 (step @p17 (= tptp.minvalid @t51) :rule refl :args (@t51)) % 0.21/0.52 (step @p18 :rule aci_norm :args ((= @t60 @t58))) % 0.21/0.52 (step @p19 :rule cong :premises (@p18) :args (@t62)) % 0.21/0.52 (step @p20 :rule quant-merge-prenex :args ((= (forall @t4 @t64) @t62))) % 0.21/0.52 (step @p21 :rule alpha_equiv :args (@t65 (@list @t54 @t52) (@list @t35 @t26))) % 0.21/0.52 (step @p22 :rule refl :args (@t57)) % 0.21/0.52 (step @p23 :rule nary_cong :premises (@p22 @p21) :args (@t66)) % 0.21/0.52 (step @p24 :rule quant-miniscope-or :args ((= @t64 @t66))) % 0.21/0.52 (step @p25 :rule trans :premises (@p24 @p23)) % 0.21/0.52 (step @p26 :rule symm :premises (@p25)) % 0.21/0.52 (step @p27 :rule cong :premises (@p26) :args ((forall @t4 (or @t57 @t69)))) % 0.21/0.52 (step @p28 :rule trans :premises (@p27 @p20)) % 0.21/0.52 (step @p29 :rule trans :premises (@p28 @p19)) % 0.21/0.52 (step @p30 :rule bool-impl-elim :args (@t56 @t69)) % 0.21/0.52 (step @p31 :rule cong :premises (@p30) :args ((forall @t4 (=> @t56 @t69)))) % 0.21/0.52 (step @p32 :rule trans :premises (@p31 @p29)) % 0.21/0.52 (step @p33 :rule quant-merge-prenex :args ((= (forall @t44 @t70) @t69))) % 0.21/0.52 (step @p34 :rule beta-reduce :args ((= @t74 @t70))) % 0.21/0.52 (step @p35 :rule cong :premises (@p34) :args (@t75)) % 0.21/0.52 (step @p36 :rule trans :premises (@p35 @p33)) % 0.21/0.52 (step @p37 :rule beta-reduce :args ((= (_ @t77 @t73) @t75))) % 0.21/0.52 (step @p38 :rule trans :premises (@p37 @p36)) % 0.21/0.52 (step @p39 :rule beta-reduce :args ((= (_ @t80 @t1) @t73))) % 0.21/0.52 (step @p40 :rule refl :args (@t1)) % 0.21/0.52 (step @p41 :rule beta-reduce :args ((= @t81 @t80))) % 0.21/0.52 (step @p42 :rule ho_cong :premises (@p41 @p40)) % 0.21/0.52 (step @p43 :rule trans :premises (@p42 @p39)) % 0.21/0.52 (step @p44 :rule refl :args (@t77)) % 0.21/0.52 (step @p45 :rule ho_cong :premises (@p44 @p43)) % 0.21/0.52 (step @p46 :rule trans :premises (@p45 @p38)) % 0.21/0.52 (step @p47 :rule beta-reduce :args ((= @t82 @t56))) % 0.21/0.52 (step @p48 :rule cong :premises (@p47 @p46) :args (@t83)) % 0.21/0.52 (step @p49 :rule cong :premises (@p48) :args (@t84)) % 0.21/0.52 (step @p50 :rule trans :premises (@p49 @p32)) % 0.21/0.52 (step @p51 :rule cong :premises (@p50) :args ((not @t84))) % 0.21/0.52 (step @p52 :rule refl :args (@t2)) % 0.21/0.52 (step @p53 :rule refl :args (@t78)) % 0.21/0.52 (step @p54 :rule refl :args (@t28)) % 0.21/0.52 (step @p55 :rule cong :premises (@p54 @p53) :args ((= @t28 @t78))) % 0.21/0.52 (step @p56 :rule symm :premises (@p55)) % 0.21/0.52 (step @p57 :rule eq_resolve :premises (@p54 @p56)) % 0.21/0.52 (step @p58 :rule refl :args (@t71)) % 0.21/0.52 (step @p59 :rule refl :args (@t29)) % 0.21/0.52 (step @p60 :rule cong :premises (@p59 @p58) :args ((= @t29 @t71))) % 0.21/0.52 (step @p61 :rule symm :premises (@p60)) % 0.21/0.52 (step @p62 :rule eq_resolve :premises (@p59 @p61)) % 0.21/0.52 (step @p63 :rule cong :premises (@p62) :args (@t85)) % 0.21/0.52 (step @p64 :rule nary_cong :premises (@p63 @p57) :args (@t86)) % 0.21/0.52 (step @p65 :rule cong :premises (@p64) :args ((forall @t30 @t86))) % 0.21/0.52 (step @p66 :rule bool-impl-elim :args (@t29 @t28)) % 0.21/0.52 (step @p67 :rule cong :premises (@p66) :args (@t31)) % 0.21/0.52 (step @p68 :rule trans :premises (@p67 @p65)) % 0.21/0.52 (step @p69 :rule cong :premises (@p68) :args (@t33)) % 0.21/0.52 (step @p70 :rule trans :premises (@p10 @p69)) % 0.21/0.52 (step @p71 :rule ho_cong :premises (@p70 @p52)) % 0.21/0.52 (step @p72 :rule ho_cong :premises (@p71 @p40)) % 0.21/0.52 (step @p73 :rule refl :args (@t76)) % 0.21/0.52 (step @p74 :rule refl :args (@t43)) % 0.21/0.52 (step @p75 :rule cong :premises (@p74 @p73) :args ((= @t43 @t76))) % 0.21/0.52 (step @p76 :rule symm :premises (@p75)) % 0.21/0.52 (step @p77 :rule eq_resolve :premises (@p74 @p76)) % 0.21/0.52 (step @p78 :rule cong :premises (@p77) :args (@t45)) % 0.21/0.52 (step @p79 :rule cong :premises (@p78) :args (@t47)) % 0.21/0.52 (step @p80 :rule trans :premises (@p14 @p79)) % 0.21/0.52 (step @p81 :rule ho_cong :premises (@p80 @p72)) % 0.21/0.52 (step @p82 :rule ho_cong :premises (@p80 @p40)) % 0.21/0.52 (step @p83 :rule cong :premises (@p82 @p81) :args (@t3)) % 0.21/0.52 (step @p84 :rule cong :premises (@p83) :args (@t5)) % 0.21/0.52 (step @p85 :rule cong :premises (@p84) :args (@t6)) % 0.21/0.52 (step @p86 :rule trans :premises (@p85 @p51)) % 0.21/0.52 (step @p87 :rule eq_resolve :premises (@p1 @p86)) % 0.21/0.52 (step @p88 :rule skolemize :premises (@p87)) % 0.21/0.52 (step @p89 :rule bool-double-not-elim :args (@t89)) % 0.21/0.52 (step @p90 :rule refl :args (@t93)) % 0.21/0.52 (step @p91 :rule nary_cong :premises (@p90 @p89) :args ((or @t93 (not @t92)))) % 0.21/0.52 (step @p92 :rule cnf_or_neg :args (@t93 0)) % 0.21/0.52 (step @p93 :rule eq_resolve :premises (@p92 @p91)) % 0.21/0.52 (step @p94 :rule reordering :premises (@p93) :args ((or @t89 @t93))) % 0.21/0.52 (step @p95 :rule chain_m_resolution :premises (@p94 @p88) :args (@t89 @t94 @t95)) % 0.21/0.52 (step @p96 :rule cnf_or_neg :args (@t93 2)) % 0.21/0.52 (step @p97 :rule chain_m_resolution :premises (@p96 @p88) :args ((not @t91) @t94 @t95)) % 0.21/0.52 (assume-push @p104 @t89) % 0.21/0.52 (step @p99 :rule instantiate :premises (@p95) :args ((@list @t90))) % 0.21/0.52 (step-pop @p105 :rule scope :premises (@p99)) % 0.21/0.52 (step @p100 :rule process_scope :premises (@p105) :args (@t91)) % 0.21/0.52 (step @p102 :rule implies_elim :premises (@p100)) % 0.21/0.52 (step @p103 false :rule chain_m_resolution :premises (@p102 @p97 @p95) :args (false (@list true false) (@list @t91 @t89))) % 0.21/0.52 ) % 0.21/0.52 % SZS output end Proof % 0.21/0.52 % cvc5 exiting %------------------------------------------------------------------------------