%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL581^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 : n029.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:06 AM UTC 2026 % Result : Theorem 0.19s 0.50s % Output : Proof 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL581^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.08/0.35 % Computer : n029.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Fri Sep 4 16:22:24 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.42 %----Proving TH0 % 0.19/0.50 --- 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.19/0.50 % SZS status Theorem % 0.19/0.50 % SZS output start Proof % 0.19/0.50 ( % 0.19/0.50 (declare-sort $$unsorted 0) % 0.19/0.50 (declare-sort tptp.individuals 0) % 0.19/0.50 (declare-const tptp.r (-> $$unsorted $$unsorted Bool)) % 0.19/0.50 (declare-const tptp.a (-> $$unsorted Bool)) % 0.19/0.50 (define tptp.mfalse () (lambda (@list (@var "X" $$unsorted)) false)) % 0.19/0.50 (define tptp.mtrue () (lambda (@list (@var "X" $$unsorted)) true)) % 0.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (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.19/0.50 (define @t1 () (_ (_ tptp.mbox tptp.r) tptp.a)) % 0.19/0.50 (define @t2 () (not (_ tptp.mvalid (_ (_ tptp.mimpl @t1) @t1)))) % 0.19/0.50 (define @t3 () (@var "X" $$unsorted)) % 0.19/0.50 (define @t4 () (@list @t3)) % 0.19/0.50 (define @t5 () (lambda @t4 false)) % 0.19/0.50 (define @t6 () (lambda @t4 true)) % 0.19/0.50 (define @t7 () (@var "U" $$unsorted)) % 0.19/0.50 (define @t8 () (@var "X" (-> $$unsorted Bool))) % 0.19/0.50 (define @t9 () (_ @t8 @t7)) % 0.19/0.50 (define @t10 () (lambda (@list @t8 @t7) (not @t9))) % 0.19/0.50 (define @t11 () (@var "Y" (-> $$unsorted Bool))) % 0.19/0.50 (define @t12 () (_ @t11 @t7)) % 0.19/0.50 (define @t13 () (@list @t8 @t11 @t7)) % 0.19/0.50 (define @t14 () (lambda @t13 (or @t9 @t12))) % 0.19/0.50 (define @t15 () (lambda @t13 (and @t9 @t12))) % 0.19/0.50 (define @t16 () (@var "__flatten_var_0" $$unsorted)) % 0.19/0.50 (define @t17 () (@var "V" (-> $$unsorted Bool))) % 0.19/0.50 (define @t18 () (@var "U" (-> $$unsorted Bool))) % 0.19/0.50 (define @t19 () (@list @t18 @t17 @t16)) % 0.19/0.50 (define @t20 () (lambda @t19 (_ (_ (_ tptp.mor (_ tptp.mnot @t18)) @t17) @t16))) % 0.19/0.50 (define @t21 () (lambda @t19 (_ (_ (_ tptp.mand (_ (_ tptp.mimpl @t18) @t17)) (_ (_ tptp.mimpl @t17) @t18)) @t16))) % 0.19/0.50 (define @t22 () (@var "Y" $$unsorted)) % 0.19/0.50 (define @t23 () (@var "P" (-> $$unsorted Bool))) % 0.19/0.50 (define @t24 () (_ @t23 @t22)) % 0.19/0.50 (define @t25 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.19/0.50 (define @t26 () (_ (_ @t25 @t3) @t22)) % 0.19/0.50 (define @t27 () (@list @t22)) % 0.19/0.50 (define @t28 () (forall @t27 (=> @t26 @t24))) % 0.19/0.50 (define @t29 () (@list @t25 @t23 @t3)) % 0.19/0.50 (define @t30 () (lambda @t29 @t28)) % 0.19/0.50 (define @t31 () (lambda @t29 (exists @t27 (and @t26 @t24)))) % 0.19/0.50 (define @t32 () (@var "W" $$unsorted)) % 0.19/0.50 (define @t33 () (@var "X" tptp.individuals)) % 0.19/0.50 (define @t34 () (@var "P" (-> tptp.individuals $$unsorted Bool))) % 0.19/0.50 (define @t35 () (_ (_ @t34 @t33) @t32)) % 0.19/0.50 (define @t36 () (@list @t33)) % 0.19/0.50 (define @t37 () (@list @t34 @t32)) % 0.19/0.50 (define @t38 () (lambda @t37 (forall @t36 @t35))) % 0.19/0.50 (define @t39 () (lambda @t37 (exists @t36 @t35))) % 0.19/0.50 (define @t40 () (_ @t23 @t32)) % 0.19/0.50 (define @t41 () (@list @t32)) % 0.19/0.50 (define @t42 () (forall @t41 @t40)) % 0.19/0.50 (define @t43 () (@list @t23)) % 0.19/0.50 (define @t44 () (lambda @t43 @t42)) % 0.19/0.50 (define @t45 () (lambda @t43 (exists @t41 @t40))) % 0.19/0.50 (define @t46 () (not @t40)) % 0.19/0.50 (define @t47 () (lambda @t43 (exists @t41 @t46))) % 0.19/0.50 (define @t48 () (lambda @t43 (forall @t41 @t46))) % 0.19/0.50 (define @t49 () (tptp.a @t22)) % 0.19/0.50 (define @t50 () (forall @t27 (or (not (tptp.r @t32 @t22)) @t49))) % 0.19/0.50 (define @t51 () (or (not @t50) @t50)) % 0.19/0.50 (define @t52 () (forall @t27 (or (not (tptp.r @t16 @t22)) @t49))) % 0.19/0.50 (define @t53 () (not @t52)) % 0.19/0.50 (define @t54 () (@list @t16)) % 0.19/0.50 (define @t55 () (lambda @t54 (or @t53 @t52))) % 0.19/0.50 (define @t56 () (_ @t55 @t32)) % 0.19/0.50 (define @t57 () (forall @t41 @t56)) % 0.19/0.50 (define @t58 () (_ @t23 @t32)) % 0.19/0.50 (define @t59 () (lambda @t43 (forall @t41 @t58))) % 0.19/0.50 (define @t60 () (not (tptp.r @t3 @t22))) % 0.19/0.50 (define @t61 () (lambda @t4 (forall @t27 (or @t60 @t49)))) % 0.19/0.50 (define @t62 () (_ @t61 @t16)) % 0.19/0.50 (define @t63 () (or @t53 @t62)) % 0.19/0.50 (define @t64 () (lambda @t54 @t63)) % 0.19/0.50 (define @t65 () (_ @t17 @t16)) % 0.19/0.50 (define @t66 () (@list @t17 @t16)) % 0.19/0.50 (define @t67 () (_ @t23 @t22)) % 0.19/0.50 (define @t68 () (lambda (@list @t23 @t3) (forall @t27 (or @t60 @t67)))) % 0.19/0.50 (define @t69 () (_ @t25 @t3 @t22)) % 0.19/0.50 (define @t70 () (_ (lambda @t29 (forall @t27 (or (not @t69) @t67))) tptp.r)) % 0.19/0.50 (define @t71 () (not @t62)) % 0.19/0.50 (define @t72 () (or @t71 @t65)) % 0.19/0.50 (define @t73 () (lambda @t66 @t72)) % 0.19/0.50 (define @t74 () (or (not (_ @t18 @t16)) @t65)) % 0.19/0.50 (define @t75 () (lambda @t19 @t74)) % 0.19/0.50 (define @t76 () (_ @t70 tptp.a)) % 0.19/0.50 (define @t77 () (not @t26)) % 0.19/0.50 (define @t78 () (or @t77 @t24)) % 0.19/0.50 (define @t79 () (not (_ @t18 @t7))) % 0.19/0.50 (define @t80 () (@list @t7)) % 0.19/0.50 (define @t81 () (lambda @t80 (or @t79 (_ @t17 @t7)))) % 0.19/0.50 (define @t82 () (@list @t11 @t7)) % 0.19/0.50 (define @t83 () (lambda @t80 @t79)) % 0.19/0.50 (define @t84 () (_ @t83 @t7)) % 0.19/0.50 (define @t85 () (or @t84 @t12)) % 0.19/0.50 (define @t86 () (lambda @t82 @t85)) % 0.19/0.50 (assume @p1 @t2) % 0.19/0.50 (assume @p2 true) % 0.19/0.50 (step @p3 (= tptp.mfalse @t5) :rule refl :args (@t5)) % 0.19/0.50 (step @p4 (= tptp.mtrue @t6) :rule refl :args (@t6)) % 0.19/0.50 (step @p5 (= tptp.mnot @t10) :rule refl :args (@t10)) % 0.19/0.50 (step @p6 (= tptp.mor @t14) :rule refl :args (@t14)) % 0.19/0.50 (step @p7 (= tptp.mand @t15) :rule refl :args (@t15)) % 0.19/0.50 (step @p8 (= tptp.mimpl @t20) :rule refl :args (@t20)) % 0.19/0.50 (step @p9 (= tptp.miff @t21) :rule refl :args (@t21)) % 0.19/0.50 (step @p10 (= tptp.mbox @t30) :rule refl :args (@t30)) % 0.19/0.50 (step @p11 (= tptp.mdia @t31) :rule refl :args (@t31)) % 0.19/0.50 (step @p12 (= tptp.mall @t38) :rule refl :args (@t38)) % 0.19/0.50 (step @p13 (= tptp.mexists @t39) :rule refl :args (@t39)) % 0.19/0.50 (step @p14 (= tptp.mvalid @t44) :rule refl :args (@t44)) % 0.19/0.50 (step @p15 (= tptp.msatisfiable @t45) :rule refl :args (@t45)) % 0.19/0.50 (step @p16 (= tptp.mcountersatisfiable @t47) :rule refl :args (@t47)) % 0.19/0.50 (step @p17 (= tptp.minvalid @t48) :rule refl :args (@t48)) % 0.19/0.50 (step @p18 :rule evaluate :args ((not true))) % 0.19/0.50 (step @p19 :rule quant-unused-vars :args ((= (forall @t41 true) true))) % 0.19/0.50 (step @p20 :rule bool-or-taut2 :args (false @t50 false false)) % 0.19/0.50 (step @p21 :rule cong :premises (@p20) :args ((forall @t41 @t51))) % 0.19/0.50 (step @p22 :rule trans :premises (@p21 @p19)) % 0.19/0.50 (step @p23 :rule beta-reduce :args ((= @t56 @t51))) % 0.19/0.50 (step @p24 :rule cong :premises (@p23) :args (@t57)) % 0.19/0.50 (step @p25 :rule trans :premises (@p24 @p22)) % 0.19/0.50 (step @p26 :rule beta-reduce :args ((= (_ @t59 @t55) @t57))) % 0.19/0.50 (step @p27 :rule trans :premises (@p26 @p25)) % 0.19/0.50 (step @p28 :rule beta-reduce :args ((= @t62 @t52))) % 0.19/0.50 (step @p29 :rule refl :args (@t53)) % 0.19/0.50 (step @p30 :rule nary_cong :premises (@p29 @p28) :args (@t63)) % 0.19/0.50 (step @p31 :rule cong :premises (@p30) :args (@t64)) % 0.19/0.50 (step @p32 :rule beta-reduce :args ((= (_ (lambda @t66 (or @t53 @t65)) @t61) @t64))) % 0.19/0.50 (step @p33 :rule trans :premises (@p32 @p31)) % 0.19/0.50 (step @p34 :rule beta-reduce :args ((= (_ @t68 tptp.a) @t61))) % 0.19/0.50 (step @p35 :rule refl :args (tptp.a)) % 0.19/0.50 (step @p36 :rule beta-reduce :args ((= @t70 @t68))) % 0.19/0.50 (step @p37 :rule ho_cong :premises (@p36 @p35)) % 0.19/0.50 (step @p38 :rule trans :premises (@p37 @p34)) % 0.19/0.50 (step @p39 :rule refl :args (@t65)) % 0.19/0.50 (step @p40 :rule cong :premises (@p28) :args (@t71)) % 0.19/0.50 (step @p41 :rule nary_cong :premises (@p40 @p39) :args (@t72)) % 0.19/0.50 (step @p42 :rule cong :premises (@p41) :args (@t73)) % 0.19/0.50 (step @p43 :rule beta-reduce :args ((= (_ @t75 @t61) @t73))) % 0.19/0.50 (step @p44 :rule trans :premises (@p43 @p42)) % 0.19/0.50 (step @p45 :rule refl :args (@t75)) % 0.19/0.50 (step @p46 :rule ho_cong :premises (@p45 @p38)) % 0.19/0.50 (step @p47 :rule trans :premises (@p46 @p44)) % 0.19/0.50 (step @p48 :rule ho_cong :premises (@p47 @p38)) % 0.19/0.50 (step @p49 :rule trans :premises (@p48 @p33)) % 0.19/0.50 (step @p50 :rule refl :args (@t59)) % 0.19/0.50 (step @p51 :rule ho_cong :premises (@p50 @p49)) % 0.19/0.50 (step @p52 :rule trans :premises (@p51 @p27)) % 0.19/0.50 (step @p53 :rule cong :premises (@p52) :args ((not (_ @t59 (_ (_ @t75 @t76) @t76))))) % 0.19/0.50 (step @p54 :rule trans :premises (@p53 @p18)) % 0.19/0.50 (step @p55 :rule refl :args (tptp.r)) % 0.19/0.50 (step @p56 :rule refl :args (@t67)) % 0.19/0.50 (step @p57 :rule refl :args (@t24)) % 0.19/0.50 (step @p58 :rule cong :premises (@p57 @p56) :args ((= @t24 @t67))) % 0.19/0.50 (step @p59 :rule symm :premises (@p58)) % 0.19/0.50 (step @p60 :rule eq_resolve :premises (@p57 @p59)) % 0.19/0.50 (step @p61 :rule refl :args (@t69)) % 0.19/0.50 (step @p62 :rule refl :args (@t26)) % 0.19/0.50 (step @p63 :rule cong :premises (@p62 @p61) :args ((= @t26 @t69))) % 0.19/0.50 (step @p64 :rule symm :premises (@p63)) % 0.19/0.50 (step @p65 :rule eq_resolve :premises (@p62 @p64)) % 0.19/0.50 (step @p66 :rule cong :premises (@p65) :args (@t77)) % 0.19/0.50 (step @p67 :rule nary_cong :premises (@p66 @p60) :args (@t78)) % 0.19/0.50 (step @p68 :rule cong :premises (@p67) :args ((forall @t27 @t78))) % 0.19/0.50 (step @p69 :rule bool-impl-elim :args (@t26 @t24)) % 0.19/0.50 (step @p70 :rule cong :premises (@p69) :args (@t28)) % 0.19/0.50 (step @p71 :rule trans :premises (@p70 @p68)) % 0.19/0.50 (step @p72 :rule cong :premises (@p71) :args (@t30)) % 0.19/0.50 (step @p73 :rule trans :premises (@p10 @p72)) % 0.19/0.50 (step @p74 :rule ho_cong :premises (@p73 @p55)) % 0.19/0.50 (step @p75 :rule ho_cong :premises (@p74 @p35)) % 0.19/0.50 (step @p76 :rule beta-reduce :args ((= (_ @t81 @t16) @t74))) % 0.19/0.50 (step @p77 :rule refl :args (@t16)) % 0.19/0.50 (step @p78 :rule beta-reduce :args ((= (_ (lambda @t82 (or @t79 @t12)) @t17) @t81))) % 0.19/0.50 (step @p79 :rule refl :args (@t17)) % 0.19/0.50 (step @p80 :rule refl :args (@t12)) % 0.19/0.50 (step @p81 :rule beta-reduce :args ((= @t84 @t79))) % 0.19/0.50 (step @p82 :rule nary_cong :premises (@p81 @p80) :args (@t85)) % 0.19/0.50 (step @p83 :rule cong :premises (@p82) :args (@t86)) % 0.19/0.50 (step @p84 :rule beta-reduce :args ((= (_ @t14 @t83) @t86))) % 0.19/0.50 (step @p85 :rule trans :premises (@p84 @p83)) % 0.19/0.50 (step @p86 :rule beta-reduce :args ((= (_ @t10 @t18) @t83))) % 0.19/0.50 (step @p87 :rule refl :args (@t14)) % 0.19/0.50 (step @p88 :rule ho_cong :premises (@p87 @p86)) % 0.19/0.50 (step @p89 :rule trans :premises (@p88 @p85)) % 0.19/0.50 (step @p90 :rule ho_cong :premises (@p89 @p79)) % 0.19/0.50 (step @p91 :rule trans :premises (@p90 @p78)) % 0.19/0.50 (step @p92 :rule ho_cong :premises (@p91 @p77)) % 0.19/0.50 (step @p93 :rule trans :premises (@p92 @p76)) % 0.19/0.50 (step @p94 :rule refl :args (@t18)) % 0.19/0.50 (step @p95 :rule ho_cong :premises (@p5 @p94)) % 0.19/0.50 (step @p96 :rule ho_cong :premises (@p6 @p95)) % 0.19/0.50 (step @p97 :rule ho_cong :premises (@p96 @p79)) % 0.19/0.50 (step @p98 :rule ho_cong :premises (@p97 @p77)) % 0.19/0.50 (step @p99 :rule trans :premises (@p98 @p93)) % 0.19/0.50 (step @p100 :rule cong :premises (@p99) :args (@t20)) % 0.19/0.50 (step @p101 :rule trans :premises (@p8 @p100)) % 0.19/0.50 (step @p102 :rule ho_cong :premises (@p101 @p75)) % 0.19/0.50 (step @p103 :rule ho_cong :premises (@p102 @p75)) % 0.19/0.50 (step @p104 :rule refl :args (@t58)) % 0.19/0.50 (step @p105 :rule refl :args (@t40)) % 0.19/0.50 (step @p106 :rule cong :premises (@p105 @p104) :args ((= @t40 @t58))) % 0.19/0.50 (step @p107 :rule symm :premises (@p106)) % 0.19/0.50 (step @p108 :rule eq_resolve :premises (@p105 @p107)) % 0.19/0.50 (step @p109 :rule cong :premises (@p108) :args (@t42)) % 0.19/0.50 (step @p110 :rule cong :premises (@p109) :args (@t44)) % 0.19/0.50 (step @p111 :rule trans :premises (@p14 @p110)) % 0.19/0.50 (step @p112 :rule ho_cong :premises (@p111 @p103)) % 0.19/0.50 (step @p113 :rule cong :premises (@p112) :args (@t2)) % 0.19/0.50 (step @p114 :rule trans :premises (@p113 @p54)) % 0.19/0.50 (step @p115 false :rule eq_resolve :premises (@p1 @p114)) % 0.19/0.50 ) % 0.19/0.50 % SZS output end Proof % 0.19/0.50 % cvc5 exiting %------------------------------------------------------------------------------