%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LAT382+3 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n021.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:30:35 AM UTC 2026 % Result : Theorem 0.41s 0.60s % Output : Proof 0.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT382+3 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n021.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 07:01:35 EDT 2026 % 0.17/0.34 % CPUTime : % 0.32/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.41/0.60 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.41/0.60 % SZS status Theorem % 0.41/0.60 % SZS output start Proof % 0.41/0.60 ( % 0.41/0.60 (declare-sort $$unsorted 0) % 0.41/0.60 (declare-const tptp.xu $$unsorted) % 0.41/0.60 (declare-const tptp.aSet0 (-> $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aElement0 (-> $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aElementOf0 (-> $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.isEmpty0 (-> $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aSubsetOf0 (-> $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.xT $$unsorted) % 0.41/0.60 (declare-const tptp.sdtlseqdt0 (-> $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aLowerBoundOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aSupremumOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aUpperBoundOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.aInfimumOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.41/0.60 (declare-const tptp.xS $$unsorted) % 0.41/0.60 (declare-const tptp.xv $$unsorted) % 0.41/0.60 (define @t1 () (@var "W0" $$unsorted)) % 0.41/0.60 (define @t2 () (tptp.aSet0 @t1)) % 0.41/0.60 (define @t3 () (@list @t1)) % 0.41/0.60 (define @t4 () (tptp.aElement0 @t1)) % 0.41/0.60 (define @t5 () (@var "W1" $$unsorted)) % 0.41/0.60 (define @t6 () (tptp.aElement0 @t5)) % 0.41/0.60 (define @t7 () (tptp.aElementOf0 @t5 @t1)) % 0.41/0.60 (define @t8 () (@list @t5)) % 0.41/0.60 (define @t9 () (forall @t8 (=> @t7 @t6))) % 0.41/0.60 (define @t10 () (=> @t2 @t9)) % 0.41/0.60 (define @t11 () (forall @t3 @t10)) % 0.41/0.60 (define @t12 () (@var "W2" $$unsorted)) % 0.41/0.60 (define @t13 () (tptp.aElementOf0 @t12 @t1)) % 0.41/0.60 (define @t14 () (@list @t12)) % 0.41/0.60 (define @t15 () (tptp.aSubsetOf0 @t5 @t1)) % 0.41/0.60 (define @t16 () (tptp.sdtlseqdt0 @t1 @t5)) % 0.41/0.60 (define @t17 () (and @t4 @t6)) % 0.41/0.60 (define @t18 () (@list @t1 @t5)) % 0.41/0.60 (define @t19 () (= @t1 @t5)) % 0.41/0.60 (define @t20 () (tptp.sdtlseqdt0 @t5 @t1)) % 0.41/0.60 (define @t21 () (and @t16 @t20)) % 0.41/0.60 (define @t22 () (=> @t21 @t19)) % 0.41/0.60 (define @t23 () (forall @t18 (=> @t17 @t22))) % 0.41/0.60 (define @t24 () (@var "W3" $$unsorted)) % 0.41/0.60 (define @t25 () (tptp.sdtlseqdt0 @t12 @t24)) % 0.41/0.60 (define @t26 () (tptp.aElementOf0 @t24 @t5)) % 0.41/0.60 (define @t27 () (@list @t24)) % 0.41/0.60 (define @t28 () (tptp.aLowerBoundOfIn0 @t12 @t5 @t1)) % 0.41/0.60 (define @t29 () (tptp.sdtlseqdt0 @t24 @t12)) % 0.41/0.60 (define @t30 () (tptp.aUpperBoundOfIn0 @t12 @t5 @t1)) % 0.41/0.60 (define @t31 () (tptp.aSupremumOfIn0 @t12 @t5 @t1)) % 0.41/0.60 (define @t32 () (tptp.aSet0 tptp.xT)) % 0.41/0.60 (define @t33 () (tptp.aElementOf0 @t1 tptp.xT)) % 0.41/0.60 (define @t34 () (tptp.aElementOf0 @t1 tptp.xS)) % 0.41/0.60 (define @t35 () (tptp.sdtlseqdt0 @t1 tptp.xv)) % 0.41/0.60 (define @t36 () (tptp.aLowerBoundOfIn0 @t1 tptp.xS tptp.xT)) % 0.41/0.60 (define @t37 () (tptp.aElementOf0 @t5 tptp.xS)) % 0.41/0.60 (define @t38 () (forall @t8 (=> @t37 @t16))) % 0.41/0.60 (define @t39 () (and @t33 @t38)) % 0.41/0.60 (define @t40 () (or @t39 @t36)) % 0.41/0.60 (define @t41 () (=> @t40 @t35)) % 0.41/0.60 (define @t42 () (forall @t3 @t41)) % 0.41/0.60 (define @t43 () (tptp.aLowerBoundOfIn0 tptp.xv tptp.xS tptp.xT)) % 0.41/0.60 (define @t44 () (tptp.aElementOf0 tptp.xv tptp.xT)) % 0.41/0.60 (define @t45 () (tptp.sdtlseqdt0 @t1 tptp.xu)) % 0.41/0.60 (define @t46 () (=> @t40 @t45)) % 0.41/0.60 (define @t47 () (forall @t3 @t46)) % 0.41/0.60 (define @t48 () (tptp.aLowerBoundOfIn0 tptp.xu tptp.xS tptp.xT)) % 0.41/0.60 (define @t49 () (tptp.aElementOf0 tptp.xu tptp.xT)) % 0.41/0.60 (define @t50 () (= tptp.xu tptp.xv)) % 0.41/0.60 (define @t51 () (not @t20)) % 0.41/0.60 (define @t52 () (not @t16)) % 0.41/0.60 (define @t53 () (not @t6)) % 0.41/0.60 (define @t54 () (not @t4)) % 0.41/0.60 (define @t55 () (or @t54 @t53 @t52 @t51 @t19)) % 0.41/0.60 (define @t56 () (or @t52 @t51 @t19)) % 0.41/0.60 (define @t57 () (not @t36)) % 0.41/0.60 (define @t58 () (not @t37)) % 0.41/0.60 (define @t59 () (forall @t8 (or @t58 @t16))) % 0.41/0.60 (define @t60 () (and @t33 @t59)) % 0.41/0.60 (define @t61 () (or @t60 @t36)) % 0.41/0.60 (define @t62 () (not @t61)) % 0.41/0.60 (define @t63 () (not @t48)) % 0.41/0.60 (define @t64 () (not @t49)) % 0.41/0.60 (define @t65 () (and (or @t64 (not (forall @t8 (or @t58 (tptp.sdtlseqdt0 tptp.xu @t5))))) @t63)) % 0.41/0.60 (define @t66 () (not @t65)) % 0.41/0.60 (define @t67 () (@list false)) % 0.41/0.60 (define @t68 () (tptp.sdtlseqdt0 tptp.xu tptp.xv)) % 0.41/0.60 (define @t69 () (or @t65 @t68)) % 0.41/0.60 (define @t70 () (@list true false)) % 0.41/0.60 (define @t71 () (not @t43)) % 0.41/0.60 (define @t72 () (not @t44)) % 0.41/0.60 (define @t73 () (and (or @t72 (not (forall @t8 (or @t58 (tptp.sdtlseqdt0 tptp.xv @t5))))) @t71)) % 0.41/0.60 (define @t74 () (not @t73)) % 0.41/0.60 (define @t75 () (tptp.sdtlseqdt0 tptp.xv tptp.xu)) % 0.41/0.60 (define @t76 () (or @t73 @t75)) % 0.41/0.60 (define @t77 () (@var "BOUND_VARIABLE_7592" $$unsorted)) % 0.41/0.60 (define @t78 () (tptp.aElement0 @t77)) % 0.41/0.60 (define @t79 () (not (tptp.aElementOf0 @t77 @t1))) % 0.41/0.60 (define @t80 () (not @t2)) % 0.41/0.60 (define @t81 () (or @t79 @t78)) % 0.41/0.60 (define @t82 () (or @t80 @t81)) % 0.41/0.60 (define @t83 () (forall (@list @t1 @t77) @t82)) % 0.41/0.60 (define @t84 () (@list @t77)) % 0.41/0.60 (define @t85 () (forall @t84 @t82)) % 0.41/0.60 (define @t86 () (forall @t84 @t81)) % 0.41/0.60 (define @t87 () (or @t80 @t86)) % 0.41/0.60 (define @t88 () (forall @t8 (or (not @t7) @t6))) % 0.41/0.60 (define @t89 () (tptp.aElement0 tptp.xv)) % 0.41/0.60 (define @t90 () (not @t32)) % 0.41/0.60 (define @t91 () (or @t90 @t72 @t89)) % 0.41/0.60 (define @t92 () (@list false false false)) % 0.41/0.60 (define @t93 () (tptp.aElement0 tptp.xu)) % 0.41/0.60 (define @t94 () (or @t90 @t64 @t93)) % 0.41/0.60 (define @t95 () (not @t75)) % 0.41/0.60 (define @t96 () (not @t68)) % 0.41/0.60 (define @t97 () (not @t89)) % 0.41/0.60 (define @t98 () (not @t93)) % 0.41/0.60 (define @t99 () (or @t98 @t97 @t96 @t95 @t50)) % 0.41/0.60 (define @t100 () (not @t99)) % 0.41/0.60 (define @t101 () (forall @t18 @t55)) % 0.41/0.60 (assume @p1 (forall @t3 (=> @t2 true))) % 0.41/0.60 (assume @p2 (forall @t3 (=> @t4 true))) % 0.41/0.60 (assume @p3 @t11) % 0.41/0.60 (assume @p4 (forall @t3 (=> @t2 (= (tptp.isEmpty0 @t1) (not (exists @t8 @t7)))))) % 0.41/0.60 (assume @p5 (forall @t3 (=> @t2 (forall @t8 (= @t15 (and (tptp.aSet0 @t5) (forall @t14 (=> (tptp.aElementOf0 @t12 @t5) @t13)))))))) % 0.41/0.60 (assume @p6 (forall @t18 (=> @t17 (=> @t16 true)))) % 0.41/0.60 (assume @p7 (forall @t3 (=> @t4 (tptp.sdtlseqdt0 @t1 @t1)))) % 0.41/0.60 (assume @p8 @t23) % 0.41/0.60 (assume @p9 (forall (@list @t1 @t5 @t12) (=> (and @t4 @t6 (tptp.aElement0 @t12)) (=> (and @t16 (tptp.sdtlseqdt0 @t5 @t12)) (tptp.sdtlseqdt0 @t1 @t12))))) % 0.41/0.60 (assume @p10 (forall @t3 (=> @t2 (forall @t8 (=> @t15 (forall @t14 (= @t28 (and @t13 (forall @t27 (=> @t26 @t25)))))))))) % 0.41/0.60 (assume @p11 (forall @t3 (=> @t2 (forall @t8 (=> @t15 (forall @t14 (= @t30 (and @t13 (forall @t27 (=> @t26 @t29)))))))))) % 0.41/0.60 (assume @p12 (forall @t3 (=> @t2 (forall @t8 (=> @t15 (forall @t14 (= (tptp.aInfimumOfIn0 @t12 @t5 @t1) (and @t13 @t28 (forall @t27 (=> (tptp.aLowerBoundOfIn0 @t24 @t5 @t1) @t29)))))))))) % 0.41/0.60 (assume @p13 (forall @t3 (=> @t2 (forall @t8 (=> @t15 (forall @t14 (= @t31 (and @t13 @t30 (forall @t27 (=> (tptp.aUpperBoundOfIn0 @t24 @t5 @t1) @t25)))))))))) % 0.41/0.60 (assume @p14 (forall @t3 (=> @t2 (forall @t8 (=> @t15 (forall (@list @t12 @t24) (=> (and @t31 (tptp.aSupremumOfIn0 @t24 @t5 @t1)) (= @t12 @t24)))))))) % 0.41/0.60 (assume @p15 @t32) % 0.41/0.60 (assume @p16 (and (tptp.aSet0 tptp.xS) (forall @t3 (=> @t34 @t33)) (tptp.aSubsetOf0 tptp.xS tptp.xT))) % 0.41/0.60 (assume @p17 (and @t49 @t49 (forall @t3 (=> @t34 (tptp.sdtlseqdt0 tptp.xu @t1))) @t48 @t47 (tptp.aInfimumOfIn0 tptp.xu tptp.xS tptp.xT) @t44 @t44 (forall @t3 (=> @t34 (tptp.sdtlseqdt0 tptp.xv @t1))) @t43 @t42 (tptp.aInfimumOfIn0 tptp.xv tptp.xS tptp.xT))) % 0.41/0.60 (assume @p18 (not @t50)) % 0.41/0.60 (assume @p19 true) % 0.41/0.60 (step @p20 :rule aci_norm :args ((= (or (or @t54 @t53) @t56) @t55))) % 0.41/0.60 (step @p21 :rule aci_norm :args ((= (or (or @t52 @t51) @t19) @t56))) % 0.41/0.60 (step @p22 :rule refl :args (@t19)) % 0.41/0.60 (step @p23 :rule bool-and-de-morgan :args (@t16 @t20 true)) % 0.41/0.60 (step @p24 :rule nary_cong :premises (@p23 @p22) :args ((or (not @t21) @t19))) % 0.41/0.60 (step @p25 :rule trans :premises (@p24 @p21)) % 0.41/0.60 (step @p26 :rule bool-impl-elim :args (@t21 @t19)) % 0.41/0.60 (step @p27 :rule trans :premises (@p26 @p25)) % 0.41/0.60 (step @p28 :rule bool-and-de-morgan :args (@t4 @t6 true)) % 0.41/0.60 (step @p29 :rule nary_cong :premises (@p28 @p27) :args ((or (not @t17) @t22))) % 0.41/0.60 (step @p30 :rule trans :premises (@p29 @p20)) % 0.41/0.60 (step @p31 :rule bool-impl-elim :args (@t17 @t22)) % 0.41/0.60 (step @p32 :rule trans :premises (@p31 @p30)) % 0.41/0.60 (step @p33 :rule cong :premises (@p32) :args (@t23)) % 0.41/0.60 (step @p34 :rule eq_resolve :premises (@p8 @p33)) % 0.41/0.60 (step @p35 :rule refl :args (@t35)) % 0.41/0.60 (step @p36 :rule refl :args (@t57)) % 0.41/0.60 (step @p37 :rule bool-and-de-morgan :args (@t33 @t59 true)) % 0.41/0.60 (step @p38 :rule nary_cong :premises (@p37 @p36) :args ((and (not @t60) @t57))) % 0.41/0.60 (step @p39 :rule bool-or-de-morgan :args (@t60 @t36 false)) % 0.41/0.60 (step @p40 :rule trans :premises (@p39 @p38)) % 0.41/0.60 (step @p41 :rule nary_cong :premises (@p40 @p35) :args ((or @t62 @t35))) % 0.41/0.60 (step @p42 :rule bool-impl-elim :args (@t61 @t35)) % 0.41/0.60 (step @p43 :rule trans :premises (@p42 @p41)) % 0.41/0.60 (step @p44 :rule cong :premises (@p43) :args ((forall @t3 (=> @t61 @t35)))) % 0.41/0.60 (step @p45 :rule refl :args (@t35)) % 0.41/0.60 (step @p46 :rule refl :args (@t36)) % 0.41/0.60 (step @p47 :rule bool-impl-elim :args (@t37 @t16)) % 0.41/0.60 (step @p48 :rule cong :premises (@p47) :args (@t38)) % 0.41/0.60 (step @p49 :rule refl :args (@t33)) % 0.41/0.60 (step @p50 :rule nary_cong :premises (@p49 @p48) :args (@t39)) % 0.41/0.60 (step @p51 :rule nary_cong :premises (@p50 @p46) :args (@t40)) % 0.41/0.60 (step @p52 :rule cong :premises (@p51 @p45) :args (@t41)) % 0.41/0.60 (step @p53 :rule cong :premises (@p52) :args (@t42)) % 0.41/0.60 (step @p54 :rule trans :premises (@p53 @p44)) % 0.41/0.60 (step @p55 :rule and_elim :premises (@p17) :args (10)) % 0.41/0.60 (step @p56 :rule eq_resolve :premises (@p55 @p54)) % 0.41/0.60 (step @p57 :rule instantiate :premises (@p56) :args ((@list tptp.xu))) % 0.41/0.60 (step @p58 :rule and_elim :premises (@p17) :args (3)) % 0.41/0.60 (step @p59 :rule cnf_and_pos :args (@t65 1)) % 0.41/0.60 (step @p60 :rule reordering :premises (@p59) :args ((or @t63 @t66))) % 0.41/0.60 (step @p61 :rule chain_m_resolution :premises (@p60 @p58) :args (@t66 @t67 (@list @t48))) % 0.41/0.60 (step @p62 :rule cnf_or_pos :args (@t69)) % 0.41/0.60 (step @p63 :rule reordering :premises (@p62) :args ((or @t65 @t68 (not @t69)))) % 0.41/0.60 (step @p64 :rule chain_m_resolution :premises (@p63 @p61 @p57) :args (@t68 @t70 (@list @t65 @t69))) % 0.41/0.60 (step @p65 :rule refl :args (@t45)) % 0.41/0.60 (step @p66 :rule nary_cong :premises (@p40 @p65) :args ((or @t62 @t45))) % 0.41/0.60 (step @p67 :rule bool-impl-elim :args (@t61 @t45)) % 0.41/0.60 (step @p68 :rule trans :premises (@p67 @p66)) % 0.41/0.60 (step @p69 :rule cong :premises (@p68) :args ((forall @t3 (=> @t61 @t45)))) % 0.41/0.60 (step @p70 :rule refl :args (@t45)) % 0.41/0.60 (step @p71 :rule cong :premises (@p51 @p70) :args (@t46)) % 0.41/0.60 (step @p72 :rule cong :premises (@p71) :args (@t47)) % 0.41/0.60 (step @p73 :rule trans :premises (@p72 @p69)) % 0.41/0.60 (step @p74 :rule and_elim :premises (@p17) :args (4)) % 0.41/0.60 (step @p75 :rule eq_resolve :premises (@p74 @p73)) % 0.41/0.60 (step @p76 :rule instantiate :premises (@p75) :args ((@list tptp.xv))) % 0.41/0.60 (step @p77 :rule and_elim :premises (@p17) :args (9)) % 0.41/0.60 (step @p78 :rule cnf_and_pos :args (@t73 1)) % 0.41/0.60 (step @p79 :rule reordering :premises (@p78) :args ((or @t71 @t74))) % 0.41/0.60 (step @p80 :rule chain_m_resolution :premises (@p79 @p77) :args (@t74 @t67 (@list @t43))) % 0.41/0.60 (step @p81 :rule cnf_or_pos :args (@t76)) % 0.41/0.60 (step @p82 :rule reordering :premises (@p81) :args ((or @t73 @t75 (not @t76)))) % 0.41/0.60 (step @p83 :rule chain_m_resolution :premises (@p82 @p80 @p76) :args (@t75 @t70 (@list @t73 @t76))) % 0.41/0.60 (step @p84 :rule aci_norm :args ((= @t82 (or @t80 @t79 @t78)))) % 0.41/0.60 (step @p85 :rule cong :premises (@p84) :args (@t83)) % 0.41/0.60 (step @p86 :rule quant-merge-prenex :args ((= (forall @t3 @t85) @t83))) % 0.41/0.60 (step @p87 :rule alpha_equiv :args (@t86 (@list @t77) (@list @t5))) % 0.41/0.60 (step @p88 :rule refl :args (@t80)) % 0.41/0.60 (step @p89 :rule nary_cong :premises (@p88 @p87) :args (@t87)) % 0.41/0.60 (step @p90 :rule quant-miniscope-or :args ((= @t85 @t87))) % 0.41/0.60 (step @p91 :rule trans :premises (@p90 @p89)) % 0.41/0.60 (step @p92 :rule symm :premises (@p91)) % 0.41/0.60 (step @p93 :rule cong :premises (@p92) :args ((forall @t3 (or @t80 @t88)))) % 0.41/0.60 (step @p94 :rule trans :premises (@p93 @p86)) % 0.41/0.60 (step @p95 :rule trans :premises (@p94 @p85)) % 0.41/0.60 (step @p96 :rule bool-impl-elim :args (@t2 @t88)) % 0.41/0.60 (step @p97 :rule cong :premises (@p96) :args ((forall @t3 (=> @t2 @t88)))) % 0.41/0.60 (step @p98 :rule trans :premises (@p97 @p95)) % 0.41/0.60 (step @p99 :rule bool-impl-elim :args (@t7 @t6)) % 0.41/0.60 (step @p100 :rule cong :premises (@p99) :args (@t9)) % 0.41/0.60 (step @p101 :rule refl :args (@t2)) % 0.41/0.60 (step @p102 :rule cong :premises (@p101 @p100) :args (@t10)) % 0.41/0.60 (step @p103 :rule cong :premises (@p102) :args (@t11)) % 0.41/0.60 (step @p104 :rule trans :premises (@p103 @p98)) % 0.41/0.60 (step @p105 :rule eq_resolve :premises (@p3 @p104)) % 0.41/0.60 (step @p106 :rule instantiate :premises (@p105) :args ((@list tptp.xT tptp.xv))) % 0.41/0.60 (step @p107 :rule and_elim :premises (@p17) :args (7)) % 0.41/0.60 (step @p108 :rule cnf_or_pos :args (@t91)) % 0.41/0.60 (step @p109 :rule reordering :premises (@p108) :args ((or @t90 @t72 @t89 (not @t91)))) % 0.41/0.60 (step @p110 :rule chain_m_resolution :premises (@p109 @p15 @p107 @p106) :args (@t89 @t92 (@list @t32 @t44 @t91))) % 0.41/0.60 (step @p111 :rule instantiate :premises (@p105) :args ((@list tptp.xT tptp.xu))) % 0.41/0.60 (step @p112 :rule and_elim :premises (@p17) :args (1)) % 0.41/0.60 (step @p113 :rule cnf_or_pos :args (@t94)) % 0.41/0.60 (step @p114 :rule reordering :premises (@p113) :args ((or @t90 @t64 @t93 (not @t94)))) % 0.41/0.60 (step @p115 :rule chain_m_resolution :premises (@p114 @p15 @p112 @p111) :args (@t93 @t92 (@list @t32 @t49 @t94))) % 0.41/0.60 (step @p116 :rule cnf_or_pos :args (@t99)) % 0.41/0.60 (step @p117 :rule reordering :premises (@p116) :args ((or @t50 @t98 @t97 @t95 @t96 @t100))) % 0.41/0.60 (step @p118 :rule chain_m_resolution :premises (@p117 @p18 @p115 @p110 @p83 @p64) :args (@t100 (@list true false false false false) (@list @t50 @t93 @t89 @t75 @t68))) % 0.41/0.60 (assume-push @p125 @t101) % 0.41/0.60 (step @p120 :rule instantiate :premises (@p34) :args ((@list tptp.xu tptp.xv))) % 0.41/0.60 (step-pop @p126 :rule scope :premises (@p120)) % 0.41/0.60 (step @p121 :rule process_scope :premises (@p126) :args (@t99)) % 0.41/0.60 (step @p123 :rule implies_elim :premises (@p121)) % 0.41/0.60 (step @p124 false :rule chain_m_resolution :premises (@p123 @p118 @p34) :args (false @t70 (@list @t99 @t101))) % 0.41/0.60 ) % 0.41/0.60 % SZS output end Proof % 0.41/0.60 % cvc5 exiting %------------------------------------------------------------------------------