%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : COM016+1 : 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 : n007.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:10:25 AM UTC 2026 % Result : Theorem 0.44s 0.64s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : COM016+1 : 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.16/0.34 % Computer : n007.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Mon Jun 1 20:27:41 EDT 2026 % 0.16/0.34 % CPUTime : % 0.29/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.44/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.44/0.64 % SZS status Theorem % 0.44/0.64 % SZS output start Proof % 0.44/0.64 ( % 0.44/0.64 (declare-sort $$unsorted 0) % 0.44/0.64 (declare-const tptp.xa $$unsorted) % 0.44/0.64 (declare-const tptp.xb $$unsorted) % 0.44/0.64 (declare-const tptp.aElement0 (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.aRewritingSystem0 (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.sdtmndtplgtdt0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.sdtmndtasgtdt0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.xc $$unsorted) % 0.44/0.64 (declare-const tptp.aReductOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.isLocallyConfluent0 (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.iLess0 (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.isConfluent0 (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.xR $$unsorted) % 0.44/0.64 (declare-const tptp.isTerminating0 (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.aNormalFormOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.44/0.64 (define @t1 () (@var "W0" $$unsorted)) % 0.44/0.64 (define @t2 () (tptp.aElement0 @t1)) % 0.44/0.64 (define @t3 () (@list @t1)) % 0.44/0.64 (define @t4 () (tptp.aRewritingSystem0 @t1)) % 0.44/0.64 (define @t5 () (@var "W2" $$unsorted)) % 0.44/0.64 (define @t6 () (tptp.aElement0 @t5)) % 0.44/0.64 (define @t7 () (@var "W1" $$unsorted)) % 0.44/0.64 (define @t8 () (tptp.aReductOfIn0 @t5 @t1 @t7)) % 0.44/0.64 (define @t9 () (@list @t5)) % 0.44/0.64 (define @t10 () (tptp.aRewritingSystem0 @t7)) % 0.44/0.64 (define @t11 () (and @t2 @t10)) % 0.44/0.64 (define @t12 () (@list @t1 @t7)) % 0.44/0.64 (define @t13 () (tptp.aElement0 @t7)) % 0.44/0.64 (define @t14 () (tptp.sdtmndtplgtdt0 @t1 @t7 @t5)) % 0.44/0.64 (define @t15 () (and @t2 @t10 @t6)) % 0.44/0.64 (define @t16 () (@list @t1 @t7 @t5)) % 0.44/0.64 (define @t17 () (@var "W3" $$unsorted)) % 0.44/0.64 (define @t18 () (tptp.sdtmndtplgtdt0 @t17 @t7 @t5)) % 0.44/0.64 (define @t19 () (tptp.aReductOfIn0 @t17 @t1 @t7)) % 0.44/0.64 (define @t20 () (tptp.aElement0 @t17)) % 0.44/0.64 (define @t21 () (and @t20 @t19 @t18)) % 0.44/0.64 (define @t22 () (@list @t17)) % 0.44/0.64 (define @t23 () (exists @t22 @t21)) % 0.44/0.64 (define @t24 () (or @t8 @t23)) % 0.44/0.64 (define @t25 () (= @t14 @t24)) % 0.44/0.64 (define @t26 () (=> @t15 @t25)) % 0.44/0.64 (define @t27 () (forall @t16 @t26)) % 0.44/0.64 (define @t28 () (and @t2 @t10 @t6 @t20)) % 0.44/0.64 (define @t29 () (@list @t1 @t7 @t5 @t17)) % 0.44/0.64 (define @t30 () (tptp.sdtmndtasgtdt0 @t1 @t7 @t5)) % 0.44/0.64 (define @t31 () (= @t30 (or (= @t1 @t5) @t14))) % 0.44/0.64 (define @t32 () (forall @t16 (=> @t15 @t31))) % 0.44/0.64 (define @t33 () (@var "W4" $$unsorted)) % 0.44/0.64 (define @t34 () (exists (@list @t33) (and (tptp.aElement0 @t33) (tptp.sdtmndtasgtdt0 @t5 @t1 @t33) (tptp.sdtmndtasgtdt0 @t17 @t1 @t33)))) % 0.44/0.64 (define @t35 () (@list @t7 @t5 @t17)) % 0.44/0.64 (define @t36 () (tptp.isTerminating0 @t1)) % 0.44/0.64 (define @t37 () (tptp.aRewritingSystem0 tptp.xR)) % 0.44/0.64 (define @t38 () (tptp.aElement0 tptp.xb)) % 0.44/0.64 (define @t39 () (tptp.aElement0 tptp.xa)) % 0.44/0.64 (define @t40 () (tptp.sdtmndtplgtdt0 tptp.xa tptp.xR tptp.xb)) % 0.44/0.64 (define @t41 () (tptp.sdtmndtasgtdt0 @t1 tptp.xR tptp.xb)) % 0.44/0.64 (define @t42 () (tptp.aReductOfIn0 @t1 tptp.xa tptp.xR)) % 0.44/0.64 (define @t43 () (and @t2 @t42 @t41)) % 0.44/0.64 (define @t44 () (exists @t3 @t43)) % 0.44/0.64 (define @t45 () (not @t44)) % 0.44/0.64 (define @t46 () (not @t6)) % 0.44/0.64 (define @t47 () (not @t10)) % 0.44/0.64 (define @t48 () (not @t2)) % 0.44/0.64 (define @t49 () (or @t48 @t47 @t46 @t31)) % 0.44/0.64 (define @t50 () (or @t48 @t47 @t46)) % 0.44/0.64 (define @t51 () (not @t15)) % 0.44/0.64 (define @t52 () (not @t20)) % 0.44/0.64 (define @t53 () (forall @t22 (or @t52 (not (tptp.aReductOfIn0 @t17 tptp.xa tptp.xR)) (not (tptp.sdtmndtplgtdt0 @t17 tptp.xR tptp.xb))))) % 0.44/0.64 (define @t54 () (@quantifiers_skolemize @t53 0)) % 0.44/0.64 (define @t55 () (tptp.sdtmndtplgtdt0 @t54 tptp.xR tptp.xb)) % 0.44/0.64 (define @t56 () (or (= @t54 tptp.xb) @t55)) % 0.44/0.64 (define @t57 () (tptp.sdtmndtasgtdt0 @t54 tptp.xR tptp.xb)) % 0.44/0.64 (define @t58 () (= @t57 @t56)) % 0.44/0.64 (define @t59 () (not @t38)) % 0.44/0.64 (define @t60 () (not @t37)) % 0.44/0.64 (define @t61 () (tptp.aElement0 @t54)) % 0.44/0.64 (define @t62 () (not @t61)) % 0.44/0.64 (define @t63 () (or @t62 @t60 @t59 @t58)) % 0.44/0.64 (define @t64 () (forall @t16 @t49)) % 0.44/0.64 (define @t65 () (or (= tptp.xb @t54) @t55)) % 0.44/0.64 (define @t66 () (= @t57 @t65)) % 0.44/0.64 (define @t67 () (or @t62 @t60 @t59 @t66)) % 0.44/0.64 (define @t68 () (@list false)) % 0.44/0.64 (define @t69 () (@list @t64)) % 0.44/0.64 (define @t70 () (not @t18)) % 0.44/0.64 (define @t71 () (not @t19)) % 0.44/0.64 (define @t72 () (or @t52 @t71 @t70)) % 0.44/0.64 (define @t73 () (= @t14 (or @t8 (not (forall @t22 @t72))))) % 0.44/0.64 (define @t74 () (forall @t22 (not @t21))) % 0.44/0.64 (define @t75 () (not @t74)) % 0.44/0.64 (define @t76 () (not @t53)) % 0.44/0.64 (define @t77 () (tptp.aReductOfIn0 tptp.xb tptp.xa tptp.xR)) % 0.44/0.64 (define @t78 () (or @t77 @t76)) % 0.44/0.64 (define @t79 () (= @t40 @t78)) % 0.44/0.64 (define @t80 () (not @t39)) % 0.44/0.64 (define @t81 () (or @t80 @t60 @t59 @t79)) % 0.44/0.64 (define @t82 () (@list false false false false)) % 0.44/0.64 (define @t83 () (not @t41)) % 0.44/0.64 (define @t84 () (not @t42)) % 0.44/0.64 (define @t85 () (or @t48 @t84 @t83)) % 0.44/0.64 (define @t86 () (forall @t3 (not @t43))) % 0.44/0.64 (define @t87 () (not @t86)) % 0.44/0.64 (define @t88 () (tptp.sdtmndtasgtdt0 tptp.xb tptp.xR tptp.xb)) % 0.44/0.64 (define @t89 () (tptp.sdtmndtplgtdt0 tptp.xb tptp.xR tptp.xb)) % 0.44/0.64 (define @t90 () (or (= tptp.xb tptp.xb) @t89)) % 0.44/0.64 (define @t91 () (= @t88 @t90)) % 0.44/0.64 (define @t92 () (or @t59 @t60 @t59 @t91)) % 0.44/0.64 (define @t93 () (or @t59 @t60 @t59 @t88)) % 0.44/0.64 (define @t94 () (@list false false false)) % 0.44/0.64 (define @t95 () (not @t88)) % 0.44/0.64 (define @t96 () (not @t77)) % 0.44/0.64 (define @t97 () (or @t59 @t96 @t95)) % 0.44/0.64 (define @t98 () (not @t55)) % 0.44/0.64 (define @t99 () (tptp.aReductOfIn0 @t54 tptp.xa tptp.xR)) % 0.44/0.64 (define @t100 () (not @t99)) % 0.44/0.64 (define @t101 () (or @t62 @t100 @t98)) % 0.44/0.64 (define @t102 () (@list true)) % 0.44/0.64 (define @t103 () (@list @t101)) % 0.44/0.64 (define @t104 () (not @t57)) % 0.44/0.64 (define @t105 () (or @t62 @t100 @t104)) % 0.44/0.64 (assume @p1 (forall @t3 (=> @t2 true))) % 0.44/0.64 (assume @p2 (forall @t3 (=> @t4 true))) % 0.44/0.64 (assume @p3 (forall @t12 (=> @t11 (forall @t9 (=> @t8 @t6))))) % 0.44/0.64 (assume @p4 (forall @t12 (=> (and @t2 @t13) (=> (tptp.iLess0 @t1 @t7) true)))) % 0.44/0.64 (assume @p5 (forall @t16 (=> @t15 (=> @t14 true)))) % 0.44/0.64 (assume @p6 @t27) % 0.44/0.64 (assume @p7 (forall @t29 (=> @t28 (=> (and @t14 (tptp.sdtmndtplgtdt0 @t5 @t7 @t17)) (tptp.sdtmndtplgtdt0 @t1 @t7 @t17))))) % 0.44/0.64 (assume @p8 @t32) % 0.44/0.64 (assume @p9 (forall @t29 (=> @t28 (=> (and @t30 (tptp.sdtmndtasgtdt0 @t5 @t7 @t17)) (tptp.sdtmndtasgtdt0 @t1 @t7 @t17))))) % 0.44/0.64 (assume @p10 (forall @t3 (=> @t4 (= (tptp.isConfluent0 @t1) (forall @t35 (=> (and @t13 @t6 @t20 (tptp.sdtmndtasgtdt0 @t7 @t1 @t5) (tptp.sdtmndtasgtdt0 @t7 @t1 @t17)) @t34)))))) % 0.44/0.64 (assume @p11 (forall @t3 (=> @t4 (= (tptp.isLocallyConfluent0 @t1) (forall @t35 (=> (and @t13 @t6 @t20 (tptp.aReductOfIn0 @t5 @t7 @t1) (tptp.aReductOfIn0 @t17 @t7 @t1)) @t34)))))) % 0.44/0.64 (assume @p12 (forall @t3 (=> @t4 (= @t36 (forall (@list @t7 @t5) (=> (and @t13 @t6) (=> (tptp.sdtmndtplgtdt0 @t7 @t1 @t5) (tptp.iLess0 @t5 @t7)))))))) % 0.44/0.64 (assume @p13 (forall @t12 (=> @t11 (forall @t9 (= (tptp.aNormalFormOfIn0 @t5 @t1 @t7) (and @t6 @t30 (not (exists @t22 (tptp.aReductOfIn0 @t17 @t5 @t7))))))))) % 0.44/0.64 (assume @p14 (forall @t3 (=> (and @t4 @t36) (forall (@list @t7) (=> @t13 (exists @t9 (tptp.aNormalFormOfIn0 @t5 @t7 @t1))))))) % 0.44/0.64 (assume @p15 @t37) % 0.44/0.64 (assume @p16 (and (tptp.isLocallyConfluent0 tptp.xR) (tptp.isTerminating0 tptp.xR))) % 0.44/0.64 (assume @p17 (and @t39 @t38 (tptp.aElement0 tptp.xc))) % 0.44/0.64 (assume @p18 (forall @t16 (=> (and @t2 @t13 @t6 (tptp.sdtmndtasgtdt0 @t1 tptp.xR @t7) (tptp.sdtmndtasgtdt0 @t1 tptp.xR @t5)) (=> (tptp.iLess0 @t1 tptp.xa) (exists @t22 (and @t20 (tptp.sdtmndtasgtdt0 @t7 tptp.xR @t17) (tptp.sdtmndtasgtdt0 @t5 tptp.xR @t17))))))) % 0.44/0.64 (assume @p19 (and @t40 (tptp.sdtmndtplgtdt0 tptp.xa tptp.xR tptp.xc))) % 0.44/0.64 (assume @p20 @t45) % 0.44/0.64 (assume @p21 true) % 0.44/0.64 (step @p22 :rule aci_norm :args ((= (or @t50 @t31) @t49))) % 0.44/0.64 (step @p23 :rule refl :args (@t31)) % 0.44/0.64 (step @p24 :rule aci_norm :args ((= (or @t48 (or @t47 @t46)) @t50))) % 0.44/0.64 (step @p25 :rule bool-and-de-morgan :args (@t10 @t6 true)) % 0.44/0.64 (step @p26 :rule refl :args (@t48)) % 0.44/0.64 (step @p27 :rule nary_cong :premises (@p26 @p25) :args ((or @t48 (not (and @t10 @t6))))) % 0.44/0.64 (step @p28 :rule bool-and-de-morgan :args (@t2 @t10 (and @t6))) % 0.44/0.64 (step @p29 :rule trans :premises (@p28 @p27)) % 0.44/0.64 (step @p30 :rule trans :premises (@p29 @p24)) % 0.44/0.64 (step @p31 :rule nary_cong :premises (@p30 @p23) :args ((or @t51 @t31))) % 0.44/0.64 (step @p32 :rule trans :premises (@p31 @p22)) % 0.44/0.64 (step @p33 :rule bool-impl-elim :args (@t15 @t31)) % 0.44/0.64 (step @p34 :rule trans :premises (@p33 @p32)) % 0.44/0.64 (step @p35 :rule cong :premises (@p34) :args (@t32)) % 0.44/0.64 (step @p36 :rule eq_resolve :premises (@p8 @p35)) % 0.44/0.64 (step @p37 :rule refl :args (@t55)) % 0.44/0.64 (step @p38 :rule eq-symm :args (@t54 tptp.xb)) % 0.44/0.64 (step @p39 :rule nary_cong :premises (@p38 @p37) :args (@t56)) % 0.44/0.64 (step @p40 :rule refl :args (@t57)) % 0.44/0.64 (step @p41 :rule cong :premises (@p40 @p39) :args (@t58)) % 0.44/0.64 (step @p42 :rule refl :args (@t59)) % 0.44/0.64 (step @p43 :rule refl :args (@t60)) % 0.44/0.64 (step @p44 :rule refl :args (@t62)) % 0.44/0.64 (step @p45 :rule nary_cong :premises (@p44 @p43 @p42 @p41) :args (@t63)) % 0.44/0.64 (step @p46 :rule refl :args (@t64)) % 0.44/0.64 (step @p47 :rule cong :premises (@p46 @p45) :args ((=> @t64 @t63))) % 0.44/0.64 (assume-push @p168 @t64) % 0.44/0.64 (step @p49 :rule instantiate :premises (@p36) :args ((@list @t54 tptp.xR tptp.xb))) % 0.44/0.64 (step-pop @p169 :rule scope :premises (@p49)) % 0.44/0.64 (step @p50 :rule process_scope :premises (@p169) :args (@t63)) % 0.44/0.64 (step @p52 :rule eq_resolve :premises (@p50 @p47)) % 0.44/0.64 (step @p53 :rule implies_elim :premises (@p52)) % 0.44/0.64 (step @p54 :rule chain_m_resolution :premises (@p53 @p36) :args (@t67 @t68 @t69)) % 0.44/0.64 (step @p55 :rule aci_norm :args ((= (or @t50 @t73) (or @t48 @t47 @t46 @t73)))) % 0.44/0.64 (step @p56 :rule refl :args (@t73)) % 0.44/0.64 (step @p57 :rule nary_cong :premises (@p30 @p56) :args ((or @t51 @t73))) % 0.44/0.64 (step @p58 :rule trans :premises (@p57 @p55)) % 0.44/0.64 (step @p59 :rule bool-impl-elim :args (@t15 @t73)) % 0.44/0.64 (step @p60 :rule trans :premises (@p59 @p58)) % 0.44/0.64 (step @p61 :rule cong :premises (@p60) :args ((forall @t16 (=> @t15 @t73)))) % 0.44/0.64 (step @p62 :rule aci_norm :args ((= (or @t52 (or @t71 @t70)) @t72))) % 0.44/0.64 (step @p63 :rule bool-and-de-morgan :args (@t19 @t18 true)) % 0.44/0.64 (step @p64 :rule refl :args (@t52)) % 0.44/0.64 (step @p65 :rule nary_cong :premises (@p64 @p63) :args ((or @t52 (not (and @t19 @t18))))) % 0.44/0.64 (step @p66 :rule bool-and-de-morgan :args (@t20 @t19 (and @t18))) % 0.44/0.64 (step @p67 :rule trans :premises (@p66 @p65)) % 0.44/0.64 (step @p68 :rule trans :premises (@p67 @p62)) % 0.44/0.64 (step @p69 :rule cong :premises (@p68) :args (@t74)) % 0.44/0.64 (step @p70 :rule cong :premises (@p69) :args (@t75)) % 0.44/0.64 (step @p71 :rule exists-elim :args ((= @t23 @t75))) % 0.44/0.64 (step @p72 :rule trans :premises (@p71 @p70)) % 0.44/0.64 (step @p73 :rule refl :args (@t8)) % 0.44/0.64 (step @p74 :rule nary_cong :premises (@p73 @p72) :args (@t24)) % 0.44/0.64 (step @p75 :rule refl :args (@t14)) % 0.44/0.64 (step @p76 :rule cong :premises (@p75 @p74) :args (@t25)) % 0.44/0.64 (step @p77 :rule refl :args (@t15)) % 0.44/0.64 (step @p78 :rule cong :premises (@p77 @p76) :args (@t26)) % 0.44/0.64 (step @p79 :rule cong :premises (@p78) :args (@t27)) % 0.44/0.64 (step @p80 :rule trans :premises (@p79 @p61)) % 0.44/0.64 (step @p81 :rule eq_resolve :premises (@p6 @p80)) % 0.44/0.64 (step @p82 :rule instantiate :premises (@p81) :args ((@list tptp.xa tptp.xR tptp.xb))) % 0.44/0.64 (step @p83 :rule and_elim :premises (@p17) :args (1)) % 0.44/0.64 (step @p84 :rule and_elim :premises (@p17) :args (0)) % 0.44/0.64 (step @p85 :rule cnf_or_pos :args (@t81)) % 0.44/0.64 (step @p86 :rule reordering :premises (@p85) :args ((or @t60 @t80 @t59 @t79 (not @t81)))) % 0.44/0.64 (step @p87 :rule chain_m_resolution :premises (@p86 @p15 @p84 @p83 @p82) :args (@t79 @t82 (@list @t37 @t39 @t38 @t81))) % 0.44/0.64 (step @p88 :rule and_elim :premises (@p19) :args (0)) % 0.44/0.64 (step @p89 :rule cnf_equiv_pos1 :args (@t79)) % 0.44/0.64 (step @p90 :rule reordering :premises (@p89) :args ((or (not @t40) @t78 (not @t79)))) % 0.44/0.64 (step @p91 :rule chain_m_resolution :premises (@p90 @p88 @p87) :args (@t78 (@list false false) (@list @t40 @t79))) % 0.44/0.64 (step @p92 :rule bool-double-not-elim :args ((forall @t3 @t85))) % 0.44/0.64 (step @p93 :rule aci_norm :args ((= (or @t48 (or @t84 @t83)) @t85))) % 0.44/0.64 (step @p94 :rule bool-and-de-morgan :args (@t42 @t41 true)) % 0.44/0.64 (step @p95 :rule nary_cong :premises (@p26 @p94) :args ((or @t48 (not (and @t42 @t41))))) % 0.44/0.64 (step @p96 :rule bool-and-de-morgan :args (@t2 @t42 (and @t41))) % 0.44/0.64 (step @p97 :rule trans :premises (@p96 @p95)) % 0.44/0.64 (step @p98 :rule trans :premises (@p97 @p93)) % 0.44/0.64 (step @p99 :rule cong :premises (@p98) :args (@t86)) % 0.44/0.64 (step @p100 :rule cong :premises (@p99) :args (@t87)) % 0.44/0.64 (step @p101 :rule exists-elim :args ((= @t44 @t87))) % 0.44/0.64 (step @p102 :rule trans :premises (@p101 @p100)) % 0.44/0.64 (step @p103 :rule cong :premises (@p102) :args (@t45)) % 0.44/0.64 (step @p104 :rule trans :premises (@p103 @p92)) % 0.44/0.64 (step @p105 :rule eq_resolve :premises (@p20 @p104)) % 0.44/0.64 (step @p106 :rule instantiate :premises (@p105) :args ((@list tptp.xb))) % 0.44/0.64 (step @p107 :rule bool-eq-true :args (@t88)) % 0.44/0.64 (step @p108 :rule absorb :args ((= (or true @t89) true))) % 0.44/0.64 (step @p109 :rule refl :args (@t89)) % 0.44/0.64 (step @p110 :rule eq-refl :args (tptp.xb)) % 0.44/0.64 (step @p111 :rule nary_cong :premises (@p110 @p109) :args (@t90)) % 0.44/0.64 (step @p112 :rule trans :premises (@p111 @p108)) % 0.44/0.64 (step @p113 :rule refl :args (@t88)) % 0.44/0.64 (step @p114 :rule cong :premises (@p113 @p112) :args (@t91)) % 0.44/0.64 (step @p115 :rule trans :premises (@p114 @p107)) % 0.44/0.64 (step @p116 :rule nary_cong :premises (@p42 @p43 @p42 @p115) :args (@t92)) % 0.44/0.64 (step @p117 :rule cong :premises (@p46 @p116) :args ((=> @t64 @t92))) % 0.44/0.64 (assume-push @p170 @t64) % 0.44/0.64 (step @p119 :rule instantiate :premises (@p36) :args ((@list tptp.xb tptp.xR tptp.xb))) % 0.44/0.64 (step-pop @p171 :rule scope :premises (@p119)) % 0.44/0.64 (step @p120 :rule process_scope :premises (@p171) :args (@t92)) % 0.44/0.64 (step @p122 :rule eq_resolve :premises (@p120 @p117)) % 0.44/0.64 (step @p123 :rule implies_elim :premises (@p122)) % 0.44/0.64 (step @p124 :rule chain_m_resolution :premises (@p123 @p36) :args (@t93 @t68 @t69)) % 0.44/0.64 (step @p125 :rule cnf_or_pos :args (@t93)) % 0.44/0.64 (step @p126 :rule factoring :premises (@p125)) % 0.44/0.64 (step @p127 :rule reordering :premises (@p126) :args ((or @t60 @t59 @t88 (not @t93)))) % 0.44/0.64 (step @p128 :rule chain_m_resolution :premises (@p127 @p15 @p83 @p124) :args (@t88 @t94 (@list @t37 @t38 @t93))) % 0.44/0.64 (step @p129 :rule cnf_or_pos :args (@t97)) % 0.44/0.64 (step @p130 :rule reordering :premises (@p129) :args ((or @t59 @t95 @t96 (not @t97)))) % 0.44/0.64 (step @p131 :rule chain_m_resolution :premises (@p130 @p83 @p128 @p106) :args (@t96 @t94 (@list @t38 @t88 @t97))) % 0.44/0.64 (step @p132 :rule cnf_or_pos :args (@t78)) % 0.44/0.64 (step @p133 :rule reordering :premises (@p132) :args ((or @t77 @t76 (not @t78)))) % 0.44/0.64 (step @p134 :rule chain_m_resolution :premises (@p133 @p131 @p91) :args (@t76 (@list true false) (@list @t77 @t78))) % 0.44/0.64 (step @p135 :rule skolemize :premises (@p134)) % 0.44/0.64 (step @p136 :rule bool-double-not-elim :args (@t61)) % 0.44/0.64 (step @p137 :rule refl :args (@t101)) % 0.44/0.64 (step @p138 :rule nary_cong :premises (@p137 @p136) :args ((or @t101 (not @t62)))) % 0.44/0.64 (step @p139 :rule cnf_or_neg :args (@t101 0)) % 0.44/0.64 (step @p140 :rule eq_resolve :premises (@p139 @p138)) % 0.44/0.64 (step @p141 :rule reordering :premises (@p140) :args ((or @t61 @t101))) % 0.44/0.64 (step @p142 :rule chain_m_resolution :premises (@p141 @p135) :args (@t61 @t102 @t103)) % 0.44/0.64 (step @p143 :rule cnf_or_pos :args (@t67)) % 0.44/0.64 (step @p144 :rule reordering :premises (@p143) :args ((or @t60 @t59 @t62 @t66 (not @t67)))) % 0.44/0.64 (step @p145 :rule chain_m_resolution :premises (@p144 @p15 @p83 @p142 @p54) :args (@t66 @t82 (@list @t37 @t38 @t61 @t67))) % 0.44/0.64 (step @p146 :rule instantiate :premises (@p105) :args ((@list @t54))) % 0.44/0.64 (step @p147 :rule bool-double-not-elim :args (@t99)) % 0.44/0.64 (step @p148 :rule nary_cong :premises (@p137 @p147) :args ((or @t101 (not @t100)))) % 0.44/0.64 (step @p149 :rule cnf_or_neg :args (@t101 1)) % 0.44/0.64 (step @p150 :rule eq_resolve :premises (@p149 @p148)) % 0.44/0.64 (step @p151 :rule reordering :premises (@p150) :args ((or @t99 @t101))) % 0.44/0.64 (step @p152 :rule chain_m_resolution :premises (@p151 @p135) :args (@t99 @t102 @t103)) % 0.44/0.64 (step @p153 :rule cnf_or_pos :args (@t105)) % 0.44/0.64 (step @p154 :rule reordering :premises (@p153) :args ((or @t62 @t100 @t104 (not @t105)))) % 0.44/0.64 (step @p155 :rule chain_m_resolution :premises (@p154 @p142 @p152 @p146) :args (@t104 @t94 (@list @t61 @t99 @t105))) % 0.44/0.64 (step @p156 :rule bool-double-not-elim :args (@t55)) % 0.44/0.64 (step @p157 :rule nary_cong :premises (@p137 @p156) :args ((or @t101 (not @t98)))) % 0.44/0.64 (step @p158 :rule cnf_or_neg :args (@t101 2)) % 0.44/0.64 (step @p159 :rule eq_resolve :premises (@p158 @p157)) % 0.44/0.64 (step @p160 :rule reordering :premises (@p159) :args ((or @t55 @t101))) % 0.44/0.64 (step @p161 :rule chain_m_resolution :premises (@p160 @p135) :args (@t55 @t102 @t103)) % 0.44/0.64 (step @p162 :rule cnf_or_neg :args (@t65 1)) % 0.44/0.64 (step @p163 :rule reordering :premises (@p162) :args ((or @t98 @t65))) % 0.44/0.64 (step @p164 :rule chain_m_resolution :premises (@p163 @p161) :args (@t65 @t68 (@list @t55))) % 0.44/0.64 (step @p165 :rule cnf_equiv_pos2 :args (@t66)) % 0.44/0.64 (step @p166 :rule reordering :premises (@p165) :args ((or @t57 (not @t65) (not @t66)))) % 0.44/0.64 (step @p167 false :rule chain_m_resolution :premises (@p166 @p164 @p155 @p145) :args (false (@list false true false) (@list @t65 @t57 @t66))) % 0.44/0.64 ) % 0.44/0.64 % SZS output end Proof % 0.44/0.64 % cvc5 exiting %------------------------------------------------------------------------------