%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL608^1 : TPTP v9.3.1. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n009.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:09 AM UTC 2026 % Result : Theorem 0.20s 0.51s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL608^1 : TPTP v9.3.1. Released v3.6.0. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.04/0.36 % Computer : n009.cluster.edu % 0.04/0.36 % Model : x86_64 x86_64 % 0.04/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.04/0.36 % Memory : 8046.5625MB % 0.04/0.36 % OS : Linux 6.8.0-71-generic % 0.04/0.36 % CPULimit : 300 % 0.04/0.36 % WCLimit : 300 % 0.04/0.36 % DateTime : Fri Sep 4 15:31:36 UTC 2026 % 0.04/0.36 % CPUTime : % 0.04/0.43 %----Proving TH0 % 0.20/0.51 --- 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.20/0.51 % SZS status Theorem % 0.20/0.51 % SZS output start Proof % 0.20/0.51 ( % 0.20/0.51 (declare-sort $$unsorted 0) % 0.20/0.51 (declare-sort tptp.individuals 0) % 0.20/0.51 (define tptp.mfalse () (lambda (@list (@var "X" $$unsorted)) false)) % 0.20/0.51 (define tptp.mtrue () (lambda (@list (@var "X" $$unsorted)) true)) % 0.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (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.20/0.51 (define @t1 () (@var "B" (-> $$unsorted Bool))) % 0.20/0.51 (define @t2 () (@var "A" (-> $$unsorted Bool))) % 0.20/0.51 (define @t3 () (and (_ tptp.mvalid @t2) (_ tptp.mvalid (_ (_ tptp.mimpl @t2) @t1)))) % 0.20/0.51 (define @t4 () (=> @t3 (_ tptp.mvalid @t1))) % 0.20/0.51 (define @t5 () (@list @t2 @t1)) % 0.20/0.51 (define @t6 () (forall @t5 @t4)) % 0.20/0.51 (define @t7 () (not @t6)) % 0.20/0.51 (define @t8 () (@var "X" $$unsorted)) % 0.20/0.51 (define @t9 () (@list @t8)) % 0.20/0.51 (define @t10 () (lambda @t9 false)) % 0.20/0.51 (define @t11 () (lambda @t9 true)) % 0.20/0.51 (define @t12 () (@var "U" $$unsorted)) % 0.20/0.51 (define @t13 () (@var "X" (-> $$unsorted Bool))) % 0.20/0.51 (define @t14 () (_ @t13 @t12)) % 0.20/0.51 (define @t15 () (lambda (@list @t13 @t12) (not @t14))) % 0.20/0.51 (define @t16 () (@var "Y" (-> $$unsorted Bool))) % 0.20/0.51 (define @t17 () (_ @t16 @t12)) % 0.20/0.51 (define @t18 () (@list @t13 @t16 @t12)) % 0.20/0.51 (define @t19 () (lambda @t18 (or @t14 @t17))) % 0.20/0.51 (define @t20 () (lambda @t18 (and @t14 @t17))) % 0.20/0.51 (define @t21 () (@var "__flatten_var_0" $$unsorted)) % 0.20/0.51 (define @t22 () (@var "V" (-> $$unsorted Bool))) % 0.20/0.51 (define @t23 () (@var "U" (-> $$unsorted Bool))) % 0.20/0.51 (define @t24 () (@list @t23 @t22 @t21)) % 0.20/0.51 (define @t25 () (lambda @t24 (_ (_ (_ tptp.mor (_ tptp.mnot @t23)) @t22) @t21))) % 0.20/0.51 (define @t26 () (lambda @t24 (_ (_ (_ tptp.mand (_ (_ tptp.mimpl @t23) @t22)) (_ (_ tptp.mimpl @t22) @t23)) @t21))) % 0.20/0.51 (define @t27 () (@var "Y" $$unsorted)) % 0.20/0.51 (define @t28 () (@var "P" (-> $$unsorted Bool))) % 0.20/0.51 (define @t29 () (_ @t28 @t27)) % 0.20/0.51 (define @t30 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.20/0.51 (define @t31 () (_ (_ @t30 @t8) @t27)) % 0.20/0.51 (define @t32 () (@list @t27)) % 0.20/0.51 (define @t33 () (@list @t30 @t28 @t8)) % 0.20/0.51 (define @t34 () (lambda @t33 (forall @t32 (=> @t31 @t29)))) % 0.20/0.51 (define @t35 () (lambda @t33 (exists @t32 (and @t31 @t29)))) % 0.20/0.51 (define @t36 () (@var "W" $$unsorted)) % 0.20/0.51 (define @t37 () (@var "X" tptp.individuals)) % 0.20/0.51 (define @t38 () (@var "P" (-> tptp.individuals $$unsorted Bool))) % 0.20/0.51 (define @t39 () (_ (_ @t38 @t37) @t36)) % 0.20/0.51 (define @t40 () (@list @t37)) % 0.20/0.51 (define @t41 () (@list @t38 @t36)) % 0.20/0.51 (define @t42 () (lambda @t41 (forall @t40 @t39))) % 0.20/0.51 (define @t43 () (lambda @t41 (exists @t40 @t39))) % 0.20/0.51 (define @t44 () (_ @t28 @t36)) % 0.20/0.51 (define @t45 () (@list @t36)) % 0.20/0.51 (define @t46 () (forall @t45 @t44)) % 0.20/0.51 (define @t47 () (@list @t28)) % 0.20/0.51 (define @t48 () (lambda @t47 @t46)) % 0.20/0.51 (define @t49 () (lambda @t47 (exists @t45 @t44))) % 0.20/0.51 (define @t50 () (not @t44)) % 0.20/0.51 (define @t51 () (lambda @t47 (exists @t45 @t50))) % 0.20/0.51 (define @t52 () (lambda @t47 (forall @t45 @t50))) % 0.20/0.51 (define @t53 () (@var "BOUND_VARIABLE_7806" $$unsorted)) % 0.20/0.51 (define @t54 () (_ @t1 @t53)) % 0.20/0.51 (define @t55 () (_ @t1 @t36)) % 0.20/0.51 (define @t56 () (_ @t2 @t36)) % 0.20/0.51 (define @t57 () (forall @t45 (or (not @t56) @t55))) % 0.20/0.51 (define @t58 () (not @t57)) % 0.20/0.51 (define @t59 () (forall @t45 @t56)) % 0.20/0.51 (define @t60 () (not @t59)) % 0.20/0.51 (define @t61 () (or @t60 @t58 @t54)) % 0.20/0.51 (define @t62 () (forall (@list @t2 @t1 @t53) @t61)) % 0.20/0.51 (define @t63 () (@list @t53)) % 0.20/0.51 (define @t64 () (forall @t63 @t61)) % 0.20/0.51 (define @t65 () (forall @t63 @t54)) % 0.20/0.51 (define @t66 () (or @t60 @t58 @t65)) % 0.20/0.51 (define @t67 () (forall @t45 @t55)) % 0.20/0.51 (define @t68 () (or @t60 @t58 @t67)) % 0.20/0.51 (define @t69 () (and @t59 @t57)) % 0.20/0.51 (define @t70 () (_ @t28 @t36)) % 0.20/0.51 (define @t71 () (lambda @t47 (forall @t45 @t70))) % 0.20/0.51 (define @t72 () (_ @t71 @t1)) % 0.20/0.51 (define @t73 () (_ @t1 @t36)) % 0.20/0.51 (define @t74 () (_ @t2 @t36)) % 0.20/0.51 (define @t75 () (not @t74)) % 0.20/0.51 (define @t76 () (or @t75 @t73)) % 0.20/0.51 (define @t77 () (not (_ @t2 @t21))) % 0.20/0.51 (define @t78 () (lambda (@list @t21) (or @t77 (_ @t1 @t21)))) % 0.20/0.51 (define @t79 () (_ @t78 @t36)) % 0.20/0.51 (define @t80 () (forall @t45 @t79)) % 0.20/0.51 (define @t81 () (_ @t22 @t21)) % 0.20/0.51 (define @t82 () (lambda (@list @t22 @t21) (or @t77 @t81))) % 0.20/0.51 (define @t83 () (or (not (_ @t23 @t21)) @t81)) % 0.20/0.51 (define @t84 () (_ (lambda @t24 @t83) @t2)) % 0.20/0.51 (define @t85 () (_ @t71 @t2)) % 0.20/0.51 (define @t86 () (and @t85 (_ @t71 (_ @t84 @t1)))) % 0.20/0.51 (define @t87 () (=> @t86 @t72)) % 0.20/0.51 (define @t88 () (forall @t5 @t87)) % 0.20/0.51 (define @t89 () (not (_ @t23 @t12))) % 0.20/0.51 (define @t90 () (@list @t12)) % 0.20/0.51 (define @t91 () (lambda @t90 (or @t89 (_ @t22 @t12)))) % 0.20/0.51 (define @t92 () (@list @t16 @t12)) % 0.20/0.51 (define @t93 () (lambda @t90 @t89)) % 0.20/0.51 (define @t94 () (_ @t93 @t12)) % 0.20/0.51 (define @t95 () (or @t94 @t17)) % 0.20/0.51 (define @t96 () (lambda @t92 @t95)) % 0.20/0.51 (define @t97 () (@quantifiers_skolemize @t62 0)) % 0.20/0.51 (define @t98 () (_ @t97 @t36)) % 0.20/0.51 (define @t99 () (forall @t45 @t98)) % 0.20/0.51 (define @t100 () (@quantifiers_skolemize @t62 2)) % 0.20/0.51 (define @t101 () (@quantifiers_skolemize @t62 1)) % 0.20/0.51 (define @t102 () (_ @t101 @t100)) % 0.20/0.51 (define @t103 () (forall @t45 (or (not @t98) (_ @t101 @t36)))) % 0.20/0.51 (define @t104 () (not @t103)) % 0.20/0.51 (define @t105 () (not @t99)) % 0.20/0.51 (define @t106 () (or @t105 @t104 @t102)) % 0.20/0.51 (define @t107 () (@list true)) % 0.20/0.51 (define @t108 () (@list @t106)) % 0.20/0.51 (define @t109 () (@list @t100)) % 0.20/0.51 (define @t110 () (_ @t97 @t100)) % 0.20/0.51 (define @t111 () (not @t110)) % 0.20/0.51 (define @t112 () (or @t111 @t102)) % 0.20/0.51 (define @t113 () (@list true false)) % 0.20/0.51 (assume @p1 @t7) % 0.20/0.51 (assume @p2 true) % 0.20/0.51 (step @p3 (= tptp.mfalse @t10) :rule refl :args (@t10)) % 0.20/0.51 (step @p4 (= tptp.mtrue @t11) :rule refl :args (@t11)) % 0.20/0.51 (step @p5 (= tptp.mnot @t15) :rule refl :args (@t15)) % 0.20/0.51 (step @p6 (= tptp.mor @t19) :rule refl :args (@t19)) % 0.20/0.51 (step @p7 (= tptp.mand @t20) :rule refl :args (@t20)) % 0.20/0.51 (step @p8 (= tptp.mimpl @t25) :rule refl :args (@t25)) % 0.20/0.51 (step @p9 (= tptp.miff @t26) :rule refl :args (@t26)) % 0.20/0.51 (step @p10 (= tptp.mbox @t34) :rule refl :args (@t34)) % 0.20/0.51 (step @p11 (= tptp.mdia @t35) :rule refl :args (@t35)) % 0.20/0.51 (step @p12 (= tptp.mall @t42) :rule refl :args (@t42)) % 0.20/0.51 (step @p13 (= tptp.mexists @t43) :rule refl :args (@t43)) % 0.20/0.51 (step @p14 (= tptp.mvalid @t48) :rule refl :args (@t48)) % 0.20/0.51 (step @p15 (= tptp.msatisfiable @t49) :rule refl :args (@t49)) % 0.20/0.51 (step @p16 (= tptp.mcountersatisfiable @t51) :rule refl :args (@t51)) % 0.20/0.51 (step @p17 (= tptp.minvalid @t52) :rule refl :args (@t52)) % 0.20/0.51 (step @p18 :rule quant-merge-prenex :args ((= (forall @t5 @t64) @t62))) % 0.20/0.51 (step @p19 :rule alpha_equiv :args (@t65 (@list @t53) (@list @t36))) % 0.20/0.51 (step @p20 :rule refl :args (@t58)) % 0.20/0.51 (step @p21 :rule refl :args (@t60)) % 0.20/0.51 (step @p22 :rule nary_cong :premises (@p21 @p20 @p19) :args (@t66)) % 0.20/0.51 (step @p23 :rule quant-miniscope-or :args ((= @t64 @t66))) % 0.20/0.51 (step @p24 :rule trans :premises (@p23 @p22)) % 0.20/0.51 (step @p25 :rule symm :premises (@p24)) % 0.20/0.51 (step @p26 :rule cong :premises (@p25) :args ((forall @t5 @t68))) % 0.20/0.51 (step @p27 :rule trans :premises (@p26 @p18)) % 0.20/0.51 (step @p28 :rule aci_norm :args ((= (or (or @t60 @t58) @t67) @t68))) % 0.20/0.51 (step @p29 :rule refl :args (@t67)) % 0.20/0.51 (step @p30 :rule bool-and-de-morgan :args (@t59 @t57 true)) % 0.20/0.51 (step @p31 :rule nary_cong :premises (@p30 @p29) :args ((or (not @t69) @t67))) % 0.20/0.51 (step @p32 :rule trans :premises (@p31 @p28)) % 0.20/0.51 (step @p33 :rule bool-impl-elim :args (@t69 @t67)) % 0.20/0.51 (step @p34 :rule trans :premises (@p33 @p32)) % 0.20/0.51 (step @p35 :rule cong :premises (@p34) :args ((forall @t5 (=> @t69 @t67)))) % 0.20/0.51 (step @p36 :rule trans :premises (@p35 @p27)) % 0.20/0.51 (step @p37 :rule beta-reduce :args ((= @t72 @t67))) % 0.20/0.51 (step @p38 :rule refl :args (@t55)) % 0.20/0.51 (step @p39 :rule refl :args (@t73)) % 0.20/0.51 (step @p40 :rule cong :premises (@p39 @p38) :args ((= @t73 @t55))) % 0.20/0.51 (step @p41 :rule symm :premises (@p40)) % 0.20/0.51 (step @p42 :rule eq_resolve :premises (@p39 @p41)) % 0.20/0.51 (step @p43 :rule refl :args (@t56)) % 0.20/0.51 (step @p44 :rule refl :args (@t74)) % 0.20/0.51 (step @p45 :rule cong :premises (@p44 @p43) :args ((= @t74 @t56))) % 0.20/0.51 (step @p46 :rule symm :premises (@p45)) % 0.20/0.51 (step @p47 :rule eq_resolve :premises (@p44 @p46)) % 0.20/0.51 (step @p48 :rule cong :premises (@p47) :args (@t75)) % 0.20/0.51 (step @p49 :rule nary_cong :premises (@p48 @p42) :args (@t76)) % 0.20/0.51 (step @p50 :rule cong :premises (@p49) :args ((forall @t45 @t76))) % 0.20/0.51 (step @p51 :rule beta-reduce :args ((= @t79 @t76))) % 0.20/0.51 (step @p52 :rule cong :premises (@p51) :args (@t80)) % 0.20/0.51 (step @p53 :rule trans :premises (@p52 @p50)) % 0.20/0.51 (step @p54 :rule beta-reduce :args ((= (_ @t71 @t78) @t80))) % 0.20/0.51 (step @p55 :rule trans :premises (@p54 @p53)) % 0.20/0.51 (step @p56 :rule beta-reduce :args ((= (_ @t82 @t1) @t78))) % 0.20/0.51 (step @p57 :rule refl :args (@t1)) % 0.20/0.51 (step @p58 :rule beta-reduce :args ((= @t84 @t82))) % 0.20/0.51 (step @p59 :rule ho_cong :premises (@p58 @p57)) % 0.20/0.51 (step @p60 :rule trans :premises (@p59 @p56)) % 0.20/0.51 (step @p61 :rule refl :args (@t71)) % 0.20/0.51 (step @p62 :rule ho_cong :premises (@p61 @p60)) % 0.20/0.51 (step @p63 :rule trans :premises (@p62 @p55)) % 0.20/0.51 (step @p64 :rule beta-reduce :args ((= @t85 @t59))) % 0.20/0.51 (step @p65 :rule nary_cong :premises (@p64 @p63) :args (@t86)) % 0.20/0.51 (step @p66 :rule cong :premises (@p65 @p37) :args (@t87)) % 0.20/0.51 (step @p67 :rule cong :premises (@p66) :args (@t88)) % 0.20/0.51 (step @p68 :rule trans :premises (@p67 @p36)) % 0.20/0.51 (step @p69 :rule cong :premises (@p68) :args ((not @t88))) % 0.20/0.51 (step @p70 :rule refl :args (@t70)) % 0.20/0.51 (step @p71 :rule refl :args (@t44)) % 0.20/0.51 (step @p72 :rule cong :premises (@p71 @p70) :args ((= @t44 @t70))) % 0.20/0.51 (step @p73 :rule symm :premises (@p72)) % 0.20/0.51 (step @p74 :rule eq_resolve :premises (@p71 @p73)) % 0.20/0.51 (step @p75 :rule cong :premises (@p74) :args (@t46)) % 0.20/0.51 (step @p76 :rule cong :premises (@p75) :args (@t48)) % 0.20/0.51 (step @p77 :rule trans :premises (@p14 @p76)) % 0.20/0.51 (step @p78 :rule ho_cong :premises (@p77 @p57)) % 0.20/0.51 (step @p79 :rule refl :args (@t2)) % 0.20/0.51 (step @p80 :rule beta-reduce :args ((= (_ @t91 @t21) @t83))) % 0.20/0.51 (step @p81 :rule refl :args (@t21)) % 0.20/0.51 (step @p82 :rule beta-reduce :args ((= (_ (lambda @t92 (or @t89 @t17)) @t22) @t91))) % 0.20/0.51 (step @p83 :rule refl :args (@t22)) % 0.20/0.51 (step @p84 :rule refl :args (@t17)) % 0.20/0.51 (step @p85 :rule beta-reduce :args ((= @t94 @t89))) % 0.20/0.51 (step @p86 :rule nary_cong :premises (@p85 @p84) :args (@t95)) % 0.20/0.51 (step @p87 :rule cong :premises (@p86) :args (@t96)) % 0.20/0.51 (step @p88 :rule beta-reduce :args ((= (_ @t19 @t93) @t96))) % 0.20/0.51 (step @p89 :rule trans :premises (@p88 @p87)) % 0.20/0.51 (step @p90 :rule beta-reduce :args ((= (_ @t15 @t23) @t93))) % 0.20/0.51 (step @p91 :rule refl :args (@t19)) % 0.20/0.51 (step @p92 :rule ho_cong :premises (@p91 @p90)) % 0.20/0.51 (step @p93 :rule trans :premises (@p92 @p89)) % 0.20/0.51 (step @p94 :rule ho_cong :premises (@p93 @p83)) % 0.20/0.51 (step @p95 :rule trans :premises (@p94 @p82)) % 0.20/0.51 (step @p96 :rule ho_cong :premises (@p95 @p81)) % 0.20/0.51 (step @p97 :rule trans :premises (@p96 @p80)) % 0.20/0.51 (step @p98 :rule refl :args (@t23)) % 0.20/0.51 (step @p99 :rule ho_cong :premises (@p5 @p98)) % 0.20/0.51 (step @p100 :rule ho_cong :premises (@p6 @p99)) % 0.20/0.51 (step @p101 :rule ho_cong :premises (@p100 @p83)) % 0.20/0.51 (step @p102 :rule ho_cong :premises (@p101 @p81)) % 0.20/0.51 (step @p103 :rule trans :premises (@p102 @p97)) % 0.20/0.51 (step @p104 :rule cong :premises (@p103) :args (@t25)) % 0.20/0.51 (step @p105 :rule trans :premises (@p8 @p104)) % 0.20/0.51 (step @p106 :rule ho_cong :premises (@p105 @p79)) % 0.20/0.51 (step @p107 :rule ho_cong :premises (@p106 @p57)) % 0.20/0.51 (step @p108 :rule ho_cong :premises (@p77 @p107)) % 0.20/0.51 (step @p109 :rule ho_cong :premises (@p77 @p79)) % 0.20/0.51 (step @p110 :rule nary_cong :premises (@p109 @p108) :args (@t3)) % 0.20/0.51 (step @p111 :rule cong :premises (@p110 @p78) :args (@t4)) % 0.20/0.51 (step @p112 :rule cong :premises (@p111) :args (@t6)) % 0.20/0.51 (step @p113 :rule cong :premises (@p112) :args (@t7)) % 0.20/0.51 (step @p114 :rule trans :premises (@p113 @p69)) % 0.20/0.51 (step @p115 :rule eq_resolve :premises (@p1 @p114)) % 0.20/0.51 (step @p116 :rule skolemize :premises (@p115)) % 0.20/0.51 (step @p117 :rule bool-double-not-elim :args (@t99)) % 0.20/0.51 (step @p118 :rule refl :args (@t106)) % 0.20/0.51 (step @p119 :rule nary_cong :premises (@p118 @p117) :args ((or @t106 (not @t105)))) % 0.20/0.51 (step @p120 :rule cnf_or_neg :args (@t106 0)) % 0.20/0.51 (step @p121 :rule eq_resolve :premises (@p120 @p119)) % 0.20/0.51 (step @p122 :rule reordering :premises (@p121) :args ((or @t99 @t106))) % 0.20/0.51 (step @p123 :rule chain_m_resolution :premises (@p122 @p116) :args (@t99 @t107 @t108)) % 0.20/0.51 (step @p124 :rule bool-double-not-elim :args (@t103)) % 0.20/0.51 (step @p125 :rule nary_cong :premises (@p118 @p124) :args ((or @t106 (not @t104)))) % 0.20/0.51 (step @p126 :rule cnf_or_neg :args (@t106 1)) % 0.20/0.51 (step @p127 :rule eq_resolve :premises (@p126 @p125)) % 0.20/0.51 (step @p128 :rule reordering :premises (@p127) :args ((or @t103 @t106))) % 0.20/0.51 (step @p129 :rule chain_m_resolution :premises (@p128 @p116) :args (@t103 @t107 @t108)) % 0.20/0.51 (step @p130 :rule instantiate :premises (@p129) :args (@t109)) % 0.20/0.51 (step @p131 :rule cnf_or_neg :args (@t106 2)) % 0.20/0.51 (step @p132 :rule chain_m_resolution :premises (@p131 @p116) :args ((not @t102) @t107 @t108)) % 0.20/0.51 (step @p133 :rule cnf_or_pos :args (@t112)) % 0.20/0.51 (step @p134 :rule reordering :premises (@p133) :args ((or @t102 @t111 (not @t112)))) % 0.20/0.51 (step @p135 :rule chain_m_resolution :premises (@p134 @p132 @p130) :args (@t111 @t113 (@list @t102 @t112))) % 0.20/0.51 (assume-push @p142 @t99) % 0.20/0.51 (step @p137 :rule instantiate :premises (@p123) :args (@t109)) % 0.20/0.51 (step-pop @p143 :rule scope :premises (@p137)) % 0.20/0.51 (step @p138 :rule process_scope :premises (@p143) :args (@t110)) % 0.20/0.51 (step @p140 :rule implies_elim :premises (@p138)) % 0.20/0.51 (step @p141 false :rule chain_m_resolution :premises (@p140 @p135 @p123) :args (false @t113 (@list @t110 @t99))) % 0.20/0.51 ) % 0.20/0.51 % SZS output end Proof % 0.20/0.51 % cvc5 exiting %------------------------------------------------------------------------------