%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU104+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n015.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:50:34 AM UTC 2026 % Result : Theorem 0.44s 0.66s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU104+1 : TPTP v9.2.1. Released v3.2.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 : n015.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 16:29:19 EDT 2026 % 0.16/0.34 % CPUTime : % 0.29/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.44/0.66 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.44/0.66 % SZS status Theorem % 0.44/0.66 % SZS output start Proof % 0.44/0.66 ( % 0.44/0.66 (declare-sort $$unsorted 0) % 0.44/0.66 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.relation (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.function (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.one_to_one (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.epsilon_transitive (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.natural (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.cup_closed (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.66 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.cap_closed (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.diff_closed (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.epsilon_connected (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.symmetric_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.66 (declare-const tptp.ordinal (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.preboolean (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.44/0.66 (declare-const tptp.finite (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.empty_set $$unsorted) % 0.44/0.66 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.66 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.44/0.66 (define @t1 () (@var "A" $$unsorted)) % 0.44/0.66 (define @t2 () (@var "B" $$unsorted)) % 0.44/0.66 (define @t3 () (tptp.in @t2 @t1)) % 0.44/0.66 (define @t4 () (not @t3)) % 0.44/0.66 (define @t5 () (tptp.in @t1 @t2)) % 0.44/0.66 (define @t6 () (@list @t1 @t2)) % 0.44/0.66 (define @t7 () (tptp.finite @t1)) % 0.44/0.66 (define @t8 () (tptp.empty @t1)) % 0.44/0.66 (define @t9 () (@list @t1)) % 0.44/0.66 (define @t10 () (tptp.diff_closed @t1)) % 0.44/0.66 (define @t11 () (tptp.cup_closed @t1)) % 0.44/0.66 (define @t12 () (and @t11 @t10)) % 0.44/0.66 (define @t13 () (tptp.preboolean @t1)) % 0.44/0.66 (define @t14 () (tptp.finite @t2)) % 0.44/0.66 (define @t15 () (tptp.powerset @t1)) % 0.44/0.66 (define @t16 () (tptp.element @t2 @t15)) % 0.44/0.66 (define @t17 () (@list @t2)) % 0.44/0.66 (define @t18 () (tptp.set_union2 @t2 @t1)) % 0.44/0.66 (define @t19 () (tptp.set_union2 @t1 @t2)) % 0.44/0.66 (define @t20 () (tptp.symmetric_difference @t1 @t2)) % 0.44/0.66 (define @t21 () (tptp.set_difference @t2 @t1)) % 0.44/0.66 (define @t22 () (tptp.set_difference @t1 @t2)) % 0.44/0.66 (define @t23 () (tptp.element @t2 @t1)) % 0.44/0.66 (define @t24 () (and @t7 @t14)) % 0.44/0.66 (define @t25 () (not @t8)) % 0.44/0.66 (define @t26 () (tptp.empty @t2)) % 0.44/0.66 (define @t27 () (not @t26)) % 0.44/0.66 (define @t28 () (@var "C" $$unsorted)) % 0.44/0.66 (define @t29 () (tptp.set_difference @t2 @t28)) % 0.44/0.66 (define @t30 () (tptp.in @t29 @t1)) % 0.44/0.66 (define @t31 () (tptp.set_union2 @t2 @t28)) % 0.44/0.66 (define @t32 () (and (tptp.in @t31 @t1) @t30)) % 0.44/0.66 (define @t33 () (tptp.in @t28 @t1)) % 0.44/0.66 (define @t34 () (and @t3 @t33)) % 0.44/0.66 (define @t35 () (@list @t2 @t28)) % 0.44/0.66 (define @t36 () (forall @t35 (=> @t34 @t32))) % 0.44/0.66 (define @t37 () (= @t13 @t36)) % 0.44/0.66 (define @t38 () (forall @t9 @t37)) % 0.44/0.66 (define @t39 () (and (tptp.in (tptp.symmetric_difference @t2 @t28) @t1) @t30)) % 0.44/0.66 (define @t40 () (tptp.element @t28 @t1)) % 0.44/0.66 (define @t41 () (@list @t28)) % 0.44/0.66 (define @t42 () (forall @t41 (=> @t40 @t39))) % 0.44/0.66 (define @t43 () (=> @t23 @t42)) % 0.44/0.66 (define @t44 () (forall @t17 @t43)) % 0.44/0.66 (define @t45 () (=> @t44 @t13)) % 0.44/0.66 (define @t46 () (=> @t25 @t45)) % 0.44/0.66 (define @t47 () (forall @t9 @t46)) % 0.44/0.66 (define @t48 () (not @t47)) % 0.44/0.66 (define @t49 () (tptp.element @t1 @t2)) % 0.44/0.66 (define @t50 () (forall @t6 (=> @t5 @t49))) % 0.44/0.66 (define @t51 () (tptp.element @t2 (tptp.powerset @t28))) % 0.44/0.66 (define @t52 () (@list @t1 @t2 @t28)) % 0.44/0.66 (define @t53 () (@var "BOUND_VARIABLE_7760" $$unsorted)) % 0.44/0.66 (define @t54 () (tptp.set_difference @t2 @t53)) % 0.44/0.66 (define @t55 () (tptp.symmetric_difference @t2 @t53)) % 0.44/0.66 (define @t56 () (and (tptp.in @t55 @t1) (tptp.in @t54 @t1))) % 0.44/0.66 (define @t57 () (not (tptp.element @t53 @t1))) % 0.44/0.66 (define @t58 () (not @t23)) % 0.44/0.66 (define @t59 () (or @t58 @t57 @t56)) % 0.44/0.66 (define @t60 () (@list @t2 @t53)) % 0.44/0.66 (define @t61 () (forall @t60 @t59)) % 0.44/0.66 (define @t62 () (not @t61)) % 0.44/0.66 (define @t63 () (or @t8 @t62 @t13)) % 0.44/0.66 (define @t64 () (=> @t61 @t13)) % 0.44/0.66 (define @t65 () (or @t57 @t56)) % 0.44/0.66 (define @t66 () (or @t58 @t65)) % 0.44/0.66 (define @t67 () (forall @t60 @t66)) % 0.44/0.66 (define @t68 () (@list @t53)) % 0.44/0.66 (define @t69 () (forall @t68 @t66)) % 0.44/0.66 (define @t70 () (forall @t68 @t65)) % 0.44/0.66 (define @t71 () (or @t58 @t70)) % 0.44/0.66 (define @t72 () (forall @t41 (or (not @t40) @t39))) % 0.44/0.66 (define @t73 () (@quantifiers_skolemize (forall @t9 @t63) 0)) % 0.44/0.66 (define @t74 () (forall @t60 (or (not (tptp.element @t2 @t73)) (not (tptp.element @t53 @t73)) (and (tptp.in @t55 @t73) (tptp.in @t54 @t73))))) % 0.44/0.66 (define @t75 () (tptp.preboolean @t73)) % 0.44/0.66 (define @t76 () (not @t74)) % 0.44/0.66 (define @t77 () (or (tptp.empty @t73) @t76 @t75)) % 0.44/0.66 (define @t78 () (@list true)) % 0.44/0.66 (define @t79 () (@list @t77)) % 0.44/0.66 (define @t80 () (forall @t35 (or (not (tptp.in @t2 @t73)) (not (tptp.in @t28 @t73)) (and (tptp.in @t31 @t73) (tptp.in @t29 @t73))))) % 0.44/0.66 (define @t81 () (@quantifiers_skolemize @t80 0)) % 0.44/0.66 (define @t82 () (@quantifiers_skolemize @t80 1)) % 0.44/0.66 (define @t83 () (not @t33)) % 0.44/0.66 (define @t84 () (= @t75 @t80)) % 0.44/0.66 (define @t85 () (not @t80)) % 0.44/0.66 (define @t86 () (@list true false)) % 0.44/0.66 (define @t87 () (tptp.in @t82 @t73)) % 0.44/0.66 (define @t88 () (tptp.in (tptp.set_difference @t81 @t82) @t73)) % 0.44/0.66 (define @t89 () (tptp.in (tptp.set_union2 @t81 @t82) @t73)) % 0.44/0.66 (define @t90 () (and @t89 @t88)) % 0.44/0.66 (define @t91 () (not @t87)) % 0.44/0.66 (define @t92 () (tptp.in @t81 @t73)) % 0.44/0.66 (define @t93 () (not @t92)) % 0.44/0.66 (define @t94 () (or @t93 @t91 @t90)) % 0.44/0.66 (define @t95 () (@list @t94)) % 0.44/0.66 (define @t96 () (tptp.element @t82 @t73)) % 0.44/0.66 (define @t97 () (or @t91 @t96)) % 0.44/0.66 (define @t98 () (@list false false)) % 0.44/0.66 (define @t99 () (tptp.element @t81 @t73)) % 0.44/0.66 (define @t100 () (or @t93 @t99)) % 0.44/0.66 (define @t101 () (tptp.set_difference @t82 @t81)) % 0.44/0.66 (define @t102 () (tptp.in @t101 @t73)) % 0.44/0.66 (define @t103 () (and (tptp.in (tptp.symmetric_difference @t82 @t81) @t73) @t102)) % 0.44/0.66 (define @t104 () (not @t99)) % 0.44/0.66 (define @t105 () (not @t96)) % 0.44/0.66 (define @t106 () (or @t105 @t104 @t103)) % 0.44/0.66 (define @t107 () (@list false false false)) % 0.44/0.66 (define @t108 () (@list false)) % 0.44/0.66 (define @t109 () (@list @t81 @t82)) % 0.44/0.66 (define @t110 () (and (tptp.in (tptp.symmetric_difference @t81 @t82) @t73) @t88)) % 0.44/0.66 (define @t111 () (or @t104 @t105 @t110)) % 0.44/0.66 (define @t112 () (tptp.in (tptp.symmetric_difference @t81 @t101) @t73)) % 0.44/0.66 (define @t113 () (and @t112 (tptp.in (tptp.set_difference @t81 @t101) @t73))) % 0.44/0.66 (define @t114 () (not @t113)) % 0.44/0.66 (define @t115 () (tptp.element @t101 @t73)) % 0.44/0.66 (define @t116 () (not @t115)) % 0.44/0.66 (define @t117 () (or @t104 @t116 @t113)) % 0.44/0.66 (define @t118 () (not @t102)) % 0.44/0.66 (define @t119 () (or @t118 @t115)) % 0.44/0.66 (define @t120 () (not @t119)) % 0.44/0.66 (define @t121 () (forall @t6 (or (not @t5) @t49))) % 0.44/0.66 (assume @p1 (forall @t6 (=> @t5 @t4))) % 0.44/0.66 (assume @p2 (forall @t9 (=> @t8 @t7))) % 0.44/0.66 (assume @p3 (forall @t9 (=> @t13 @t12))) % 0.44/0.66 (assume @p4 (forall @t9 (=> @t7 (forall @t17 (=> @t16 @t14))))) % 0.44/0.66 (assume @p5 (forall @t9 (=> @t12 @t13))) % 0.44/0.66 (assume @p6 (forall @t6 (= @t19 @t18))) % 0.44/0.66 (assume @p7 (forall @t6 (= @t20 (tptp.symmetric_difference @t2 @t1)))) % 0.44/0.66 (assume @p8 (forall @t6 (= @t20 (tptp.set_union2 @t22 @t21)))) % 0.44/0.66 (assume @p9 (forall @t9 (exists @t17 @t23))) % 0.44/0.66 (assume @p10 (forall @t6 (=> @t7 (tptp.finite @t22)))) % 0.44/0.66 (assume @p11 (forall @t6 (=> @t24 (tptp.finite @t20)))) % 0.44/0.66 (assume @p12 (forall @t9 (not (tptp.empty @t15)))) % 0.44/0.66 (assume @p13 (tptp.empty tptp.empty_set)) % 0.44/0.66 (assume @p14 (forall @t6 (=> @t25 (not (tptp.empty @t19))))) % 0.44/0.66 (assume @p15 (forall @t6 (=> @t25 (not (tptp.empty @t18))))) % 0.44/0.66 (assume @p16 (forall @t6 (=> @t24 (tptp.finite @t19)))) % 0.44/0.66 (assume @p17 (forall @t6 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.44/0.66 (assume @p18 (exists @t9 (and @t25 @t7))) % 0.44/0.66 (assume @p19 (exists @t9 (and @t25 @t11 (tptp.cap_closed @t1) @t10 @t13))) % 0.44/0.66 (assume @p20 (forall @t9 (=> @t25 (exists @t17 (and @t16 @t27))))) % 0.44/0.66 (assume @p21 (exists @t9 @t8)) % 0.44/0.66 (assume @p22 (forall @t9 (exists @t17 (and @t16 @t26 (tptp.relation @t2) (tptp.function @t2) (tptp.one_to_one @t2) (tptp.epsilon_transitive @t2) (tptp.epsilon_connected @t2) (tptp.ordinal @t2) (tptp.natural @t2) @t14)))) % 0.44/0.66 (assume @p23 (forall @t9 (exists @t17 (and @t16 @t26)))) % 0.44/0.66 (assume @p24 (exists @t9 @t25)) % 0.44/0.66 (assume @p25 (forall @t9 (=> @t25 (exists @t17 (and @t16 @t27 @t14))))) % 0.44/0.66 (assume @p26 (forall @t6 (tptp.subset @t1 @t1))) % 0.44/0.66 (assume @p27 @t38) % 0.44/0.66 (assume @p28 @t48) % 0.44/0.66 (assume @p29 (forall @t9 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.44/0.66 (assume @p30 @t50) % 0.44/0.66 (assume @p31 (forall @t6 (=> @t49 (or @t26 @t5)))) % 0.44/0.66 (assume @p32 (forall @t9 (= (tptp.set_difference @t1 tptp.empty_set) @t1))) % 0.44/0.66 (assume @p33 (forall @t6 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.44/0.66 (assume @p34 (forall @t9 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set))) % 0.44/0.66 (assume @p35 (forall @t52 (=> (and @t5 @t51) (tptp.element @t1 @t28)))) % 0.44/0.66 (assume @p36 (forall @t9 (= (tptp.symmetric_difference @t1 tptp.empty_set) @t1))) % 0.44/0.66 (assume @p37 (forall @t52 (not (and @t5 @t51 (tptp.empty @t28))))) % 0.44/0.66 (assume @p38 (forall @t9 (=> @t8 (= @t1 tptp.empty_set)))) % 0.44/0.66 (assume @p39 (forall @t6 (not (and @t5 @t26)))) % 0.44/0.66 (assume @p40 (forall @t6 (not (and @t8 (not (= @t1 @t2)) @t26)))) % 0.44/0.66 (assume @p41 (forall @t6 (= @t19 (tptp.symmetric_difference @t1 @t21)))) % 0.44/0.66 (assume @p42 true) % 0.44/0.66 (step @p43 :rule bool-impl-elim :args (@t5 @t49)) % 0.44/0.66 (step @p44 :rule cong :premises (@p43) :args (@t50)) % 0.44/0.66 (step @p45 :rule eq_resolve :premises (@p30 @p44)) % 0.44/0.66 (step @p46 :rule aci_norm :args ((= (or @t8 (or @t62 @t13)) @t63))) % 0.44/0.66 (step @p47 :rule bool-impl-elim :args (@t61 @t13)) % 0.44/0.66 (step @p48 :rule refl :args (@t8)) % 0.44/0.66 (step @p49 :rule nary_cong :premises (@p48 @p47) :args ((or @t8 @t64))) % 0.44/0.66 (step @p50 :rule trans :premises (@p49 @p46)) % 0.44/0.66 (step @p51 :rule refl :args (@t64)) % 0.44/0.66 (step @p52 :rule bool-double-not-elim :args (@t8)) % 0.44/0.66 (step @p53 :rule nary_cong :premises (@p52 @p51) :args ((or (not @t25) @t64))) % 0.44/0.66 (step @p54 :rule bool-impl-elim :args (@t25 @t64)) % 0.44/0.66 (step @p55 :rule trans :premises (@p54 @p53)) % 0.44/0.66 (step @p56 :rule trans :premises (@p55 @p50)) % 0.44/0.66 (step @p57 :rule cong :premises (@p56) :args ((forall @t9 (=> @t25 @t64)))) % 0.44/0.66 (step @p58 :rule refl :args (@t13)) % 0.44/0.66 (step @p59 :rule aci_norm :args ((= @t66 @t59))) % 0.44/0.66 (step @p60 :rule cong :premises (@p59) :args (@t67)) % 0.44/0.66 (step @p61 :rule quant-merge-prenex :args ((= (forall @t17 @t69) @t67))) % 0.44/0.66 (step @p62 :rule alpha_equiv :args (@t70 (@list @t53) (@list @t28))) % 0.44/0.66 (step @p63 :rule refl :args (@t58)) % 0.44/0.66 (step @p64 :rule nary_cong :premises (@p63 @p62) :args (@t71)) % 0.44/0.66 (step @p65 :rule quant-miniscope-or :args ((= @t69 @t71))) % 0.44/0.66 (step @p66 :rule trans :premises (@p65 @p64)) % 0.44/0.66 (step @p67 :rule symm :premises (@p66)) % 0.44/0.66 (step @p68 :rule cong :premises (@p67) :args ((forall @t17 (or @t58 @t72)))) % 0.44/0.66 (step @p69 :rule trans :premises (@p68 @p61)) % 0.44/0.66 (step @p70 :rule trans :premises (@p69 @p60)) % 0.44/0.66 (step @p71 :rule bool-impl-elim :args (@t23 @t72)) % 0.44/0.66 (step @p72 :rule cong :premises (@p71) :args ((forall @t17 (=> @t23 @t72)))) % 0.44/0.66 (step @p73 :rule trans :premises (@p72 @p70)) % 0.44/0.66 (step @p74 :rule bool-impl-elim :args (@t40 @t39)) % 0.44/0.66 (step @p75 :rule cong :premises (@p74) :args (@t42)) % 0.44/0.66 (step @p76 :rule refl :args (@t23)) % 0.44/0.66 (step @p77 :rule cong :premises (@p76 @p75) :args (@t43)) % 0.44/0.66 (step @p78 :rule cong :premises (@p77) :args (@t44)) % 0.44/0.66 (step @p79 :rule trans :premises (@p78 @p73)) % 0.44/0.66 (step @p80 :rule cong :premises (@p79 @p58) :args (@t45)) % 0.44/0.66 (step @p81 :rule refl :args (@t25)) % 0.44/0.66 (step @p82 :rule cong :premises (@p81 @p80) :args (@t46)) % 0.44/0.66 (step @p83 :rule cong :premises (@p82) :args (@t47)) % 0.44/0.66 (step @p84 :rule trans :premises (@p83 @p57)) % 0.44/0.66 (step @p85 :rule cong :premises (@p84) :args (@t48)) % 0.44/0.66 (step @p86 :rule eq_resolve :premises (@p28 @p85)) % 0.44/0.66 (step @p87 :rule skolemize :premises (@p86)) % 0.44/0.66 (step @p88 :rule bool-double-not-elim :args (@t74)) % 0.44/0.66 (step @p89 :rule refl :args (@t77)) % 0.44/0.67 (step @p90 :rule nary_cong :premises (@p89 @p88) :args ((or @t77 (not @t76)))) % 0.44/0.67 (step @p91 :rule cnf_or_neg :args (@t77 1)) % 0.44/0.67 (step @p92 :rule eq_resolve :premises (@p91 @p90)) % 0.44/0.67 (step @p93 :rule reordering :premises (@p92) :args ((or @t74 @t77))) % 0.44/0.67 (step @p94 :rule chain_m_resolution :premises (@p93 @p87) :args (@t74 @t78 @t79)) % 0.44/0.67 (step @p95 :rule instantiate :premises (@p94) :args ((@list @t82 @t81))) % 0.44/0.67 (step @p96 :rule instantiate :premises (@p45) :args ((@list @t82 @t73))) % 0.44/0.67 (step @p97 :rule aci_norm :args ((= (or (or @t4 @t83) @t32) (or @t4 @t83 @t32)))) % 0.44/0.67 (step @p98 :rule refl :args (@t32)) % 0.44/0.67 (step @p99 :rule bool-and-de-morgan :args (@t3 @t33 true)) % 0.44/0.67 (step @p100 :rule nary_cong :premises (@p99 @p98) :args ((or (not @t34) @t32))) % 0.44/0.67 (step @p101 :rule trans :premises (@p100 @p97)) % 0.44/0.67 (step @p102 :rule bool-impl-elim :args (@t34 @t32)) % 0.44/0.67 (step @p103 :rule trans :premises (@p102 @p101)) % 0.44/0.67 (step @p104 :rule cong :premises (@p103) :args (@t36)) % 0.44/0.67 (step @p105 :rule cong :premises (@p58 @p104) :args (@t37)) % 0.44/0.67 (step @p106 :rule cong :premises (@p105) :args (@t38)) % 0.44/0.67 (step @p107 :rule eq_resolve :premises (@p27 @p106)) % 0.44/0.67 (step @p108 :rule instantiate :premises (@p107) :args ((@list @t73))) % 0.44/0.67 (step @p109 :rule cnf_or_neg :args (@t77 2)) % 0.44/0.67 (step @p110 :rule chain_m_resolution :premises (@p109 @p87) :args ((not @t75) @t78 @t79)) % 0.44/0.67 (step @p111 :rule cnf_equiv_pos2 :args (@t84)) % 0.44/0.67 (step @p112 :rule reordering :premises (@p111) :args ((or @t75 @t85 (not @t84)))) % 0.44/0.67 (step @p113 :rule chain_m_resolution :premises (@p112 @p110 @p108) :args (@t85 @t86 (@list @t75 @t84))) % 0.44/0.67 (step @p114 :rule skolemize :premises (@p113)) % 0.44/0.67 (step @p115 :rule bool-double-not-elim :args (@t87)) % 0.44/0.67 (step @p116 :rule refl :args (@t94)) % 0.44/0.67 (step @p117 :rule nary_cong :premises (@p116 @p115) :args ((or @t94 (not @t91)))) % 0.44/0.67 (step @p118 :rule cnf_or_neg :args (@t94 1)) % 0.44/0.67 (step @p119 :rule eq_resolve :premises (@p118 @p117)) % 0.44/0.67 (step @p120 :rule reordering :premises (@p119) :args ((or @t87 @t94))) % 0.44/0.67 (step @p121 :rule chain_m_resolution :premises (@p120 @p114) :args (@t87 @t78 @t95)) % 0.44/0.67 (step @p122 :rule cnf_or_pos :args (@t97)) % 0.44/0.67 (step @p123 :rule reordering :premises (@p122) :args ((or @t91 @t96 (not @t97)))) % 0.44/0.67 (step @p124 :rule chain_m_resolution :premises (@p123 @p121 @p96) :args (@t96 @t98 (@list @t87 @t97))) % 0.44/0.67 (step @p125 :rule instantiate :premises (@p45) :args ((@list @t81 @t73))) % 0.44/0.67 (step @p126 :rule bool-double-not-elim :args (@t92)) % 0.44/0.67 (step @p127 :rule nary_cong :premises (@p116 @p126) :args ((or @t94 (not @t93)))) % 0.44/0.67 (step @p128 :rule cnf_or_neg :args (@t94 0)) % 0.44/0.67 (step @p129 :rule eq_resolve :premises (@p128 @p127)) % 0.44/0.67 (step @p130 :rule reordering :premises (@p129) :args ((or @t92 @t94))) % 0.44/0.67 (step @p131 :rule chain_m_resolution :premises (@p130 @p114) :args (@t92 @t78 @t95)) % 0.44/0.67 (step @p132 :rule cnf_or_pos :args (@t100)) % 0.44/0.67 (step @p133 :rule reordering :premises (@p132) :args ((or @t93 @t99 (not @t100)))) % 0.44/0.67 (step @p134 :rule chain_m_resolution :premises (@p133 @p131 @p125) :args (@t99 @t98 (@list @t92 @t100))) % 0.44/0.67 (step @p135 :rule cnf_or_pos :args (@t106)) % 0.44/0.67 (step @p136 :rule reordering :premises (@p135) :args ((or @t104 @t105 @t103 (not @t106)))) % 0.44/0.67 (step @p137 :rule chain_m_resolution :premises (@p136 @p134 @p124 @p95) :args (@t103 @t107 (@list @t99 @t96 @t106))) % 0.44/0.67 (step @p138 :rule cnf_and_pos :args (@t103 1)) % 0.44/0.67 (step @p139 :rule reordering :premises (@p138) :args ((or @t102 (not @t103)))) % 0.44/0.67 (step @p140 :rule chain_m_resolution :premises (@p139 @p137) :args (@t102 @t108 (@list @t103))) % 0.44/0.67 (step @p141 :rule instantiate :premises (@p94) :args ((@list @t81 @t101))) % 0.44/0.67 (step @p142 :rule instantiate :premises (@p94) :args (@t109)) % 0.44/0.67 (step @p143 :rule cnf_or_pos :args (@t111)) % 0.44/0.67 (step @p144 :rule reordering :premises (@p143) :args ((or @t104 @t105 @t110 (not @t111)))) % 0.44/0.67 (step @p145 :rule chain_m_resolution :premises (@p144 @p134 @p124 @p142) :args (@t110 @t107 (@list @t99 @t96 @t111))) % 0.44/0.67 (step @p146 :rule cnf_and_pos :args (@t110 1)) % 0.44/0.67 (step @p147 :rule reordering :premises (@p146) :args ((or @t88 (not @t110)))) % 0.44/0.67 (step @p148 :rule chain_m_resolution :premises (@p147 @p145) :args (@t88 @t108 (@list @t110))) % 0.44/0.67 (step @p149 :rule cnf_or_neg :args (@t94 2)) % 0.44/0.67 (step @p150 :rule chain_m_resolution :premises (@p149 @p114) :args ((not @t90) @t78 @t95)) % 0.44/0.67 (step @p151 :rule cnf_and_neg :args (@t90)) % 0.44/0.67 (step @p152 :rule chain_m_resolution :premises (@p151 @p150 @p148) :args ((not @t89) @t86 (@list @t90 @t88))) % 0.44/0.67 (step @p153 :rule false_intro :premises (@p152)) % 0.44/0.67 (step @p154 :rule refl :args (@t73)) % 0.44/0.67 (step @p155 :rule instantiate :premises (@p41) :args (@t109)) % 0.44/0.67 (step @p156 :rule symm :premises (@p155)) % 0.44/0.67 (step @p157 :rule cong :premises (@p156 @p154) :args (@t112)) % 0.44/0.67 (step @p158 :rule trans :premises (@p157 @p153)) % 0.44/0.67 (step @p159 :rule false_elim :premises (@p158)) % 0.44/0.67 (step @p160 :rule cnf_and_pos :args (@t113 0)) % 0.44/0.67 (step @p161 :rule reordering :premises (@p160) :args ((or @t112 @t114))) % 0.44/0.67 (step @p162 :rule chain_m_resolution :premises (@p161 @p159) :args (@t114 @t78 (@list @t112))) % 0.44/0.67 (step @p163 :rule cnf_or_pos :args (@t117)) % 0.44/0.67 (step @p164 :rule reordering :premises (@p163) :args ((or @t104 @t116 @t113 (not @t117)))) % 0.44/0.67 (step @p165 :rule chain_m_resolution :premises (@p164 @p134 @p162 @p141) :args (@t116 (@list false true false) (@list @t99 @t113 @t117))) % 0.44/0.67 (step @p166 :rule cnf_or_pos :args (@t119)) % 0.44/0.67 (step @p167 :rule reordering :premises (@p166) :args ((or @t115 @t118 @t120))) % 0.44/0.67 (step @p168 :rule chain_m_resolution :premises (@p167 @p165 @p140) :args (@t120 @t86 (@list @t115 @t102))) % 0.44/0.67 (assume-push @p175 @t121) % 0.44/0.67 (step @p170 :rule instantiate :premises (@p45) :args ((@list @t101 @t73))) % 0.44/0.67 (step-pop @p176 :rule scope :premises (@p170)) % 0.44/0.67 (step @p171 :rule process_scope :premises (@p176) :args (@t119)) % 0.44/0.67 (step @p173 :rule implies_elim :premises (@p171)) % 0.44/0.67 (step @p174 false :rule chain_m_resolution :premises (@p173 @p168 @p45) :args (false @t86 (@list @t119 @t121))) % 0.44/0.67 ) % 0.44/0.67 % SZS output end Proof % 0.44/0.67 % cvc5 exiting %------------------------------------------------------------------------------