%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYO101^5 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n010.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 09:12:02 AM UTC 2026 % Result : Theorem 0.44s 0.69s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYO101^5 : TPTP v9.2.1. Released v4.0.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n010.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 : Tue Jun 2 23:58:55 EDT 2026 % 0.16/0.35 % CPUTime : % 0.27/0.49 %----Proving TH0 % 0.44/0.69 --- 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.44/0.69 % SZS status Theorem % 0.44/0.69 % SZS output start Proof % 0.44/0.69 ( % 0.44/0.69 (declare-sort $$unsorted 0) % 0.44/0.69 (declare-const tptp.cP (-> $$unsorted Bool)) % 0.44/0.69 (declare-const tptp.cR (-> $$unsorted $$unsorted Bool)) % 0.44/0.69 (declare-const tptp.cW $$unsorted) % 0.44/0.69 (define @t1 () (@var "U" $$unsorted)) % 0.44/0.69 (define @t2 () (_ tptp.cR tptp.cW)) % 0.44/0.69 (define @t3 () (_ @t2 @t1)) % 0.44/0.69 (define @t4 () (@var "V" $$unsorted)) % 0.44/0.69 (define @t5 () (_ tptp.cP @t4)) % 0.44/0.69 (define @t6 () (@list @t4)) % 0.44/0.69 (define @t7 () (forall @t6 (=> @t5 @t3))) % 0.44/0.69 (define @t8 () (@list @t1)) % 0.44/0.69 (define @t9 () (exists @t8 @t7)) % 0.44/0.69 (define @t10 () (@var "Z" $$unsorted)) % 0.44/0.69 (define @t11 () (_ tptp.cP @t10)) % 0.44/0.69 (define @t12 () (@var "Y" $$unsorted)) % 0.44/0.69 (define @t13 () (@var "X" $$unsorted)) % 0.44/0.69 (define @t14 () (_ tptp.cR @t13)) % 0.44/0.69 (define @t15 () (_ @t14 @t12)) % 0.44/0.69 (define @t16 () (@list @t10)) % 0.44/0.69 (define @t17 () (forall @t16 (and @t15 @t11))) % 0.44/0.69 (define @t18 () (_ tptp.cP @t13)) % 0.44/0.69 (define @t19 () (=> @t18 @t17)) % 0.44/0.69 (define @t20 () (@list @t12)) % 0.44/0.69 (define @t21 () (exists @t20 @t19)) % 0.44/0.69 (define @t22 () (@list @t13)) % 0.44/0.69 (define @t23 () (forall @t22 @t21)) % 0.44/0.69 (define @t24 () (=> @t23 @t9)) % 0.44/0.69 (define @t25 () (not @t24)) % 0.44/0.69 (define @t26 () (tptp.cP @t4)) % 0.44/0.69 (define @t27 () (forall @t6 (not @t26))) % 0.44/0.69 (define @t28 () (not @t27)) % 0.44/0.69 (define @t29 () (@var "BOUND_VARIABLE_7509" $$unsorted)) % 0.44/0.69 (define @t30 () (tptp.cR tptp.cW @t29)) % 0.44/0.69 (define @t31 () (_ @t2 @t29)) % 0.44/0.69 (define @t32 () (not @t31)) % 0.44/0.69 (define @t33 () (@list @t29)) % 0.44/0.69 (define @t34 () (forall @t33 @t32)) % 0.44/0.69 (define @t35 () (forall @t8 @t28)) % 0.44/0.69 (define @t36 () (not @t3)) % 0.44/0.69 (define @t37 () (forall @t8 @t36)) % 0.44/0.69 (define @t38 () (@list @t29)) % 0.44/0.69 (define @t39 () (and @t37 @t35)) % 0.44/0.69 (define @t40 () (or @t3 @t27)) % 0.44/0.69 (define @t41 () (forall @t8 (not @t40))) % 0.44/0.69 (define @t42 () (not @t41)) % 0.44/0.69 (define @t43 () (not @t5)) % 0.44/0.69 (define @t44 () (forall @t6 @t43)) % 0.44/0.69 (define @t45 () (or @t3 @t44)) % 0.44/0.69 (define @t46 () (or @t3 @t43)) % 0.44/0.69 (define @t47 () (or @t43 @t3)) % 0.44/0.69 (define @t48 () (@var "BOUND_VARIABLE_7458" $$unsorted)) % 0.44/0.69 (define @t49 () (tptp.cR @t13 @t48)) % 0.44/0.69 (define @t50 () (@list @t48)) % 0.44/0.69 (define @t51 () (forall @t50 (not @t49))) % 0.44/0.69 (define @t52 () (not @t51)) % 0.44/0.69 (define @t53 () (@var "BOUND_VARIABLE_7485" $$unsorted)) % 0.44/0.69 (define @t54 () (tptp.cP @t53)) % 0.44/0.69 (define @t55 () (and @t54 @t52)) % 0.44/0.69 (define @t56 () (tptp.cP @t13)) % 0.44/0.69 (define @t57 () (not @t56)) % 0.44/0.69 (define @t58 () (or @t57 @t55)) % 0.44/0.69 (define @t59 () (@list @t53)) % 0.44/0.69 (define @t60 () (forall @t59 @t58)) % 0.44/0.69 (define @t61 () (forall @t59 @t52)) % 0.44/0.69 (define @t62 () (forall @t59 @t54)) % 0.44/0.69 (define @t63 () (@var "BOUND_VARIABLE_7438" $$unsorted)) % 0.44/0.69 (define @t64 () (@list @t63)) % 0.44/0.69 (define @t65 () (and @t62 @t61)) % 0.44/0.69 (define @t66 () (forall @t59 @t55)) % 0.44/0.69 (define @t67 () (or @t57 @t66)) % 0.44/0.69 (define @t68 () (tptp.cP @t63)) % 0.44/0.69 (define @t69 () (@list @t63)) % 0.44/0.69 (define @t70 () (forall @t69 @t68)) % 0.44/0.69 (define @t71 () (and @t70 @t52)) % 0.44/0.69 (define @t72 () (not @t18)) % 0.44/0.69 (define @t73 () (or @t72 @t71)) % 0.44/0.69 (define @t74 () (not @t70)) % 0.44/0.69 (define @t75 () (or @t74 @t51)) % 0.44/0.69 (define @t76 () (_ @t14 @t48)) % 0.44/0.69 (define @t77 () (not @t76)) % 0.44/0.69 (define @t78 () (forall @t50 @t77)) % 0.44/0.69 (define @t79 () (or @t74 @t78)) % 0.44/0.69 (define @t80 () (or @t74 @t77)) % 0.44/0.69 (define @t81 () (or @t77 @t74)) % 0.44/0.69 (define @t82 () (forall @t50 @t81)) % 0.44/0.69 (define @t83 () (or (not @t15) @t74)) % 0.44/0.69 (define @t84 () (forall @t20 @t83)) % 0.44/0.69 (define @t85 () (@list @t48)) % 0.44/0.69 (define @t86 () (forall @t20 @t18)) % 0.44/0.69 (define @t87 () (and @t86 @t84)) % 0.44/0.69 (define @t88 () (and @t15 @t70)) % 0.44/0.69 (define @t89 () (=> @t18 @t88)) % 0.44/0.69 (define @t90 () (forall @t20 (not @t89))) % 0.44/0.69 (define @t91 () (not @t90)) % 0.44/0.69 (define @t92 () (_ tptp.cP @t63)) % 0.44/0.69 (define @t93 () (forall @t69 @t92)) % 0.44/0.69 (define @t94 () (forall @t16 @t11)) % 0.44/0.69 (define @t95 () (forall @t16 @t15)) % 0.44/0.69 (define @t96 () (and @t95 @t94)) % 0.44/0.69 (define @t97 () (@quantifiers_skolemize @t27 0)) % 0.44/0.69 (define @t98 () (forall @t33 (not @t30))) % 0.44/0.69 (define @t99 () (forall @t50 (not (tptp.cR tptp.cW @t48)))) % 0.44/0.69 (define @t100 () (@list false)) % 0.44/0.69 (define @t101 () (not @t99)) % 0.44/0.69 (define @t102 () (tptp.cP @t97)) % 0.44/0.69 (define @t103 () (and @t102 @t101)) % 0.44/0.69 (define @t104 () (not @t103)) % 0.44/0.69 (define @t105 () (not @t102)) % 0.44/0.69 (define @t106 () (not @t105)) % 0.44/0.69 (define @t107 () (tptp.cP tptp.cW)) % 0.44/0.69 (define @t108 () (and @t107 (not (forall @t50 (not (tptp.cR @t97 @t48)))))) % 0.44/0.69 (define @t109 () (or @t105 @t108)) % 0.44/0.69 (define @t110 () (not @t107)) % 0.44/0.69 (define @t111 () (or @t110 @t103)) % 0.44/0.69 (assume @p1 @t25) % 0.44/0.69 (assume @p2 true) % 0.44/0.69 (step @p3 :rule refl :args (@t28)) % 0.44/0.69 (step @p4 :rule refl :args (@t30)) % 0.44/0.69 (step @p5 :rule refl :args (@t31)) % 0.44/0.69 (step @p6 :rule cong :premises (@p5 @p4) :args ((= @t31 @t30))) % 0.44/0.69 (step @p7 :rule symm :premises (@p6)) % 0.44/0.69 (step @p8 :rule eq_resolve :premises (@p5 @p7)) % 0.44/0.69 (step @p9 :rule cong :premises (@p8) :args (@t32)) % 0.44/0.69 (step @p10 :rule cong :premises (@p9) :args (@t34)) % 0.44/0.69 (step @p11 :rule nary_cong :premises (@p10 @p3) :args ((and @t34 @t28))) % 0.44/0.69 (step @p12 :rule quant-unused-vars :args ((= @t35 @t28))) % 0.44/0.69 (step @p13 :rule alpha_equiv :args (@t37 (@list @t1) @t38)) % 0.44/0.69 (step @p14 :rule nary_cong :premises (@p13 @p12) :args (@t39)) % 0.44/0.69 (step @p15 :rule quant-miniscope-and :args ((= (forall @t8 (and @t36 @t28)) @t39))) % 0.44/0.69 (step @p16 :rule trans :premises (@p15 @p14)) % 0.44/0.69 (step @p17 :rule trans :premises (@p16 @p11)) % 0.44/0.69 (step @p18 :rule bool-or-de-morgan :args (@t3 @t27 false)) % 0.44/0.69 (step @p19 :rule cong :premises (@p18) :args (@t41)) % 0.44/0.69 (step @p20 :rule trans :premises (@p19 @p17)) % 0.44/0.69 (step @p21 :rule cong :premises (@p20) :args (@t42)) % 0.44/0.69 (step @p22 :rule exists-elim :args ((= (exists @t8 @t40) @t42))) % 0.44/0.69 (step @p23 :rule trans :premises (@p22 @p21)) % 0.44/0.69 (step @p24 :rule refl :args (@t26)) % 0.44/0.69 (step @p25 :rule refl :args (@t5)) % 0.44/0.69 (step @p26 :rule cong :premises (@p25 @p24) :args ((= @t5 @t26))) % 0.44/0.69 (step @p27 :rule symm :premises (@p26)) % 0.44/0.69 (step @p28 :rule eq_resolve :premises (@p25 @p27)) % 0.44/0.69 (step @p29 :rule cong :premises (@p28) :args (@t43)) % 0.44/0.69 (step @p30 :rule cong :premises (@p29) :args (@t44)) % 0.44/0.69 (step @p31 :rule refl :args (@t3)) % 0.44/0.69 (step @p32 :rule nary_cong :premises (@p31 @p30) :args (@t45)) % 0.44/0.69 (step @p33 :rule quant-miniscope-or :args ((= (forall @t6 @t46) @t45))) % 0.44/0.69 (step @p34 :rule aci_norm :args ((= @t47 @t46))) % 0.44/0.69 (step @p35 :rule cong :premises (@p34) :args ((forall @t6 @t47))) % 0.44/0.69 (step @p36 :rule trans :premises (@p35 @p33)) % 0.44/0.69 (step @p37 :rule trans :premises (@p36 @p32)) % 0.44/0.69 (step @p38 :rule bool-impl-elim :args (@t5 @t3)) % 0.44/0.69 (step @p39 :rule cong :premises (@p38) :args (@t7)) % 0.44/0.69 (step @p40 :rule trans :premises (@p39 @p37)) % 0.44/0.69 (step @p41 :rule cong :premises (@p40) :args (@t9)) % 0.44/0.69 (step @p42 :rule trans :premises (@p41 @p23)) % 0.44/0.69 (step @p43 :rule quant-merge-prenex :args ((= (forall @t22 @t60) (forall (@list @t13 @t53) @t58)))) % 0.44/0.69 (step @p44 :rule quant-unused-vars :args ((= @t61 @t52))) % 0.44/0.69 (step @p45 :rule alpha_equiv :args (@t62 (@list @t53) @t64)) % 0.44/0.69 (step @p46 :rule nary_cong :premises (@p45 @p44) :args (@t65)) % 0.44/0.69 (step @p47 :rule quant-miniscope-and :args ((= @t66 @t65))) % 0.44/0.69 (step @p48 :rule trans :premises (@p47 @p46)) % 0.44/0.69 (step @p49 :rule refl :args (@t57)) % 0.44/0.69 (step @p50 :rule nary_cong :premises (@p49 @p48) :args (@t67)) % 0.44/0.69 (step @p51 :rule quant-miniscope-or :args ((= @t60 @t67))) % 0.44/0.69 (step @p52 :rule trans :premises (@p51 @p50)) % 0.44/0.69 (step @p53 :rule symm :premises (@p52)) % 0.44/0.69 (step @p54 :rule cong :premises (@p53) :args ((forall @t22 (or @t57 @t71)))) % 0.44/0.69 (step @p55 :rule trans :premises (@p54 @p43)) % 0.44/0.69 (step @p56 :rule refl :args (@t71)) % 0.44/0.69 (step @p57 :rule refl :args (@t56)) % 0.44/0.69 (step @p58 :rule refl :args (@t18)) % 0.44/0.69 (step @p59 :rule cong :premises (@p58 @p57) :args ((= @t18 @t56))) % 0.44/0.69 (step @p60 :rule symm :premises (@p59)) % 0.44/0.69 (step @p61 :rule eq_resolve :premises (@p58 @p60)) % 0.44/0.69 (step @p62 :rule cong :premises (@p61) :args (@t72)) % 0.44/0.69 (step @p63 :rule nary_cong :premises (@p62 @p56) :args (@t73)) % 0.44/0.69 (step @p64 :rule cong :premises (@p63) :args ((forall @t22 @t73))) % 0.44/0.69 (step @p65 :rule trans :premises (@p64 @p55)) % 0.44/0.69 (step @p66 :rule refl :args (@t52)) % 0.44/0.69 (step @p67 :rule bool-double-not-elim :args (@t70)) % 0.44/0.69 (step @p68 :rule nary_cong :premises (@p67 @p66) :args ((and (not @t74) @t52))) % 0.44/0.69 (step @p69 :rule bool-or-de-morgan :args (@t74 @t51 false)) % 0.44/0.69 (step @p70 :rule trans :premises (@p69 @p68)) % 0.44/0.69 (step @p71 :rule refl :args (@t72)) % 0.44/0.69 (step @p72 :rule nary_cong :premises (@p71 @p70) :args ((or @t72 (not @t75)))) % 0.44/0.69 (step @p73 :rule bool-and-de-morgan :args (@t18 @t75 true)) % 0.44/0.69 (step @p74 :rule trans :premises (@p73 @p72)) % 0.44/0.69 (step @p75 :rule cong :premises (@p74) :args ((forall @t22 (not (and @t18 @t75))))) % 0.44/0.69 (step @p76 :rule trans :premises (@p75 @p65)) % 0.44/0.69 (step @p77 :rule refl :args (@t49)) % 0.44/0.69 (step @p78 :rule refl :args (@t76)) % 0.44/0.69 (step @p79 :rule cong :premises (@p78 @p77) :args ((= @t76 @t49))) % 0.44/0.69 (step @p80 :rule symm :premises (@p79)) % 0.44/0.69 (step @p81 :rule eq_resolve :premises (@p78 @p80)) % 0.44/0.69 (step @p82 :rule cong :premises (@p81) :args (@t77)) % 0.44/0.69 (step @p83 :rule cong :premises (@p82) :args (@t78)) % 0.44/0.69 (step @p84 :rule refl :args (@t74)) % 0.44/0.69 (step @p85 :rule nary_cong :premises (@p84 @p83) :args (@t79)) % 0.44/0.69 (step @p86 :rule quant-miniscope-or :args ((= (forall @t50 @t80) @t79))) % 0.44/0.69 (step @p87 :rule aci_norm :args ((= @t81 @t80))) % 0.44/0.69 (step @p88 :rule cong :premises (@p87) :args (@t82)) % 0.44/0.69 (step @p89 :rule trans :premises (@p88 @p86)) % 0.44/0.69 (step @p90 :rule trans :premises (@p89 @p85)) % 0.44/0.69 (step @p91 :rule refl :args (@t18)) % 0.44/0.69 (step @p92 :rule nary_cong :premises (@p91 @p90) :args ((and @t18 @t82))) % 0.44/0.69 (step @p93 :rule alpha_equiv :args (@t84 (@list @t12) @t85)) % 0.44/0.69 (step @p94 :rule quant-unused-vars :args ((= @t86 @t18))) % 0.44/0.69 (step @p95 :rule nary_cong :premises (@p94 @p93) :args (@t87)) % 0.44/0.69 (step @p96 :rule quant-miniscope-and :args ((= (forall @t20 (and @t18 @t83)) @t87))) % 0.44/0.69 (step @p97 :rule trans :premises (@p96 @p95)) % 0.44/0.69 (step @p98 :rule trans :premises (@p97 @p92)) % 0.44/0.69 (step @p99 :rule bool-and-de-morgan :args (@t15 @t70 true)) % 0.44/0.69 (step @p100 :rule nary_cong :premises (@p58 @p99) :args ((and @t18 (not @t88)))) % 0.44/0.69 (step @p101 :rule bool-implies-de-morgan :args (@t18 @t88)) % 0.44/0.69 (step @p102 :rule trans :premises (@p101 @p100)) % 0.44/0.69 (step @p103 :rule cong :premises (@p102) :args (@t90)) % 0.44/0.69 (step @p104 :rule trans :premises (@p103 @p98)) % 0.44/0.69 (step @p105 :rule cong :premises (@p104) :args (@t91)) % 0.44/0.69 (step @p106 :rule exists-elim :args ((= (exists @t20 @t89) @t91))) % 0.44/0.69 (step @p107 :rule trans :premises (@p106 @p105)) % 0.44/0.69 (step @p108 :rule refl :args (@t68)) % 0.44/0.69 (step @p109 :rule refl :args (@t92)) % 0.44/0.69 (step @p110 :rule cong :premises (@p109 @p108) :args ((= @t92 @t68))) % 0.44/0.69 (step @p111 :rule symm :premises (@p110)) % 0.44/0.69 (step @p112 :rule eq_resolve :premises (@p109 @p111)) % 0.44/0.69 (step @p113 :rule cong :premises (@p112) :args (@t93)) % 0.44/0.69 (step @p114 :rule refl :args (@t15)) % 0.44/0.69 (step @p115 :rule nary_cong :premises (@p114 @p113) :args ((and @t15 @t93))) % 0.44/0.69 (step @p116 :rule alpha_equiv :args (@t94 (@list @t10) @t64)) % 0.44/0.69 (step @p117 :rule quant-unused-vars :args ((= @t95 @t15))) % 0.44/0.69 (step @p118 :rule nary_cong :premises (@p117 @p116) :args (@t96)) % 0.44/0.69 (step @p119 :rule quant-miniscope-and :args ((= @t17 @t96))) % 0.44/0.69 (step @p120 :rule trans :premises (@p119 @p118)) % 0.44/0.69 (step @p121 :rule trans :premises (@p120 @p115)) % 0.44/0.69 (step @p122 :rule cong :premises (@p91 @p121) :args (@t19)) % 0.44/0.69 (step @p123 :rule cong :premises (@p122) :args (@t21)) % 0.44/0.69 (step @p124 :rule trans :premises (@p123 @p107)) % 0.44/0.69 (step @p125 :rule cong :premises (@p124) :args (@t23)) % 0.44/0.69 (step @p126 :rule trans :premises (@p125 @p76)) % 0.44/0.69 (step @p127 :rule cong :premises (@p126 @p42) :args (@t24)) % 0.44/0.69 (step @p128 :rule cong :premises (@p127) :args (@t25)) % 0.44/0.69 (step @p129 :rule eq_resolve :premises (@p1 @p128)) % 0.44/0.69 (step @p130 :rule not_implies_elim1 :premises (@p129)) % 0.44/0.69 (step @p131 :rule instantiate :premises (@p130) :args ((@list tptp.cW @t97))) % 0.44/0.69 (step @p132 :rule not_implies_elim2 :premises (@p129)) % 0.44/0.69 (step @p133 :rule not_not_elim :premises (@p132)) % 0.44/0.69 (step @p134 :rule and_elim :premises (@p133) :args (0)) % 0.44/0.69 (step @p135 :rule alpha_equiv :args (@t98 @t38 @t85)) % 0.44/0.69 (step @p136 :rule equiv_elim1 :premises (@p135)) % 0.44/0.69 (step @p137 :rule chain_m_resolution :premises (@p136 @p134) :args (@t99 @t100 (@list @t98))) % 0.44/0.69 (step @p138 :rule cnf_and_pos :args (@t103 1)) % 0.44/0.69 (step @p139 :rule reordering :premises (@p138) :args ((or @t101 @t104))) % 0.44/0.69 (step @p140 :rule chain_m_resolution :premises (@p139 @p137) :args (@t104 @t100 (@list @t99))) % 0.44/0.69 (step @p141 :rule instantiate :premises (@p130) :args ((@list @t97 tptp.cW))) % 0.44/0.69 (step @p142 :rule and_elim :premises (@p133) :args (1)) % 0.44/0.69 (step @p143 :rule refl :args (@t102)) % 0.44/0.69 (step @p144 :rule bool-double-not-elim :args (@t27)) % 0.44/0.69 (step @p145 :rule nary_cong :premises (@p144 @p143) :args ((or (not @t28) @t102))) % 0.44/0.69 (step @p146 :rule bool-double-not-elim :args (@t102)) % 0.44/0.69 (step @p147 :rule cong :premises (@p3 @p146) :args ((=> @t28 @t106))) % 0.44/0.69 (assume-push @p165 @t28) % 0.44/0.69 (step @p149 :rule skolemize :premises (@p142)) % 0.44/0.69 (step-pop @p166 :rule scope :premises (@p149)) % 0.44/0.69 (step @p150 :rule process_scope :premises (@p166) :args (@t106)) % 0.44/0.69 (step @p152 :rule eq_resolve :premises (@p150 @p147)) % 0.44/0.69 (step @p153 :rule implies_elim :premises (@p152)) % 0.44/0.69 (step @p154 :rule eq_resolve :premises (@p153 @p145)) % 0.44/0.69 (step @p155 :rule chain_m_resolution :premises (@p154 @p142) :args (@t102 (@list true) (@list @t27))) % 0.44/0.69 (step @p156 :rule cnf_or_pos :args (@t109)) % 0.44/0.69 (step @p157 :rule reordering :premises (@p156) :args ((or @t105 @t108 (not @t109)))) % 0.44/0.69 (step @p158 :rule chain_m_resolution :premises (@p157 @p155 @p141) :args (@t108 (@list false false) (@list @t102 @t109))) % 0.44/0.69 (step @p159 :rule cnf_and_pos :args (@t108 0)) % 0.44/0.69 (step @p160 :rule reordering :premises (@p159) :args ((or @t107 (not @t108)))) % 0.44/0.69 (step @p161 :rule chain_m_resolution :premises (@p160 @p158) :args (@t107 @t100 (@list @t108))) % 0.44/0.69 (step @p162 :rule cnf_or_pos :args (@t111)) % 0.44/0.69 (step @p163 :rule reordering :premises (@p162) :args ((or @t110 @t103 (not @t111)))) % 0.44/0.69 (step @p164 false :rule chain_m_resolution :premises (@p163 @p161 @p140 @p131) :args (false (@list false true false) (@list @t107 @t103 @t111))) % 0.44/0.69 ) % 0.44/0.69 % SZS output end Proof % 0.44/0.69 % cvc5 exiting %------------------------------------------------------------------------------