%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU101+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 : n020.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.45s 0.67s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU101+1 : TPTP v9.2.1. Released v3.2.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n020.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Tue Jun 2 16:29:40 EDT 2026 % 0.18/0.35 % CPUTime : % 0.27/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.45/0.67 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.45/0.67 % SZS status Theorem % 0.45/0.67 % SZS output start Proof % 0.45/0.67 ( % 0.45/0.67 (declare-sort $$unsorted 0) % 0.45/0.67 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.one_to_one (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.epsilon_transitive (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.epsilon_connected (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.ordinal (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.relation (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.cup_closed (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.function (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.diff_closed (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.preboolean (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.45/0.67 (declare-const tptp.finite (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.67 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.67 (declare-const tptp.cap_closed (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.empty_set $$unsorted) % 0.45/0.67 (declare-const tptp.natural (-> $$unsorted Bool)) % 0.45/0.67 (define @t1 () (@var "A" $$unsorted)) % 0.45/0.67 (define @t2 () (@var "B" $$unsorted)) % 0.45/0.67 (define @t3 () (tptp.in @t2 @t1)) % 0.45/0.67 (define @t4 () (not @t3)) % 0.45/0.67 (define @t5 () (tptp.in @t1 @t2)) % 0.45/0.67 (define @t6 () (@list @t1 @t2)) % 0.45/0.67 (define @t7 () (tptp.finite @t1)) % 0.45/0.67 (define @t8 () (tptp.empty @t1)) % 0.45/0.67 (define @t9 () (@list @t1)) % 0.45/0.67 (define @t10 () (tptp.diff_closed @t1)) % 0.45/0.67 (define @t11 () (tptp.cup_closed @t1)) % 0.45/0.67 (define @t12 () (and @t11 @t10)) % 0.45/0.67 (define @t13 () (tptp.preboolean @t1)) % 0.45/0.67 (define @t14 () (tptp.finite @t2)) % 0.45/0.67 (define @t15 () (tptp.powerset @t1)) % 0.45/0.67 (define @t16 () (tptp.element @t2 @t15)) % 0.45/0.67 (define @t17 () (@list @t2)) % 0.45/0.67 (define @t18 () (forall @t9 (=> @t12 @t13))) % 0.45/0.67 (define @t19 () (tptp.set_union2 @t2 @t1)) % 0.45/0.67 (define @t20 () (tptp.set_union2 @t1 @t2)) % 0.45/0.67 (define @t21 () (@var "C" $$unsorted)) % 0.45/0.67 (define @t22 () (tptp.set_union2 @t2 @t21)) % 0.45/0.67 (define @t23 () (tptp.in @t22 @t1)) % 0.45/0.67 (define @t24 () (tptp.in @t21 @t1)) % 0.45/0.67 (define @t25 () (and @t3 @t24)) % 0.45/0.67 (define @t26 () (@list @t2 @t21)) % 0.45/0.67 (define @t27 () (forall @t26 (=> @t25 @t23))) % 0.45/0.67 (define @t28 () (= @t11 @t27)) % 0.45/0.67 (define @t29 () (forall @t9 @t28)) % 0.45/0.67 (define @t30 () (tptp.set_difference @t2 @t21)) % 0.45/0.67 (define @t31 () (tptp.in @t30 @t1)) % 0.45/0.67 (define @t32 () (forall @t26 (=> @t25 @t31))) % 0.45/0.67 (define @t33 () (= @t10 @t32)) % 0.45/0.67 (define @t34 () (forall @t9 @t33)) % 0.45/0.67 (define @t35 () (not @t8)) % 0.45/0.67 (define @t36 () (tptp.empty @t2)) % 0.45/0.67 (define @t37 () (not @t36)) % 0.45/0.67 (define @t38 () (and @t23 @t31)) % 0.45/0.67 (define @t39 () (forall @t26 (=> @t25 @t38))) % 0.45/0.67 (define @t40 () (= @t13 @t39)) % 0.45/0.67 (define @t41 () (forall @t9 @t40)) % 0.45/0.67 (define @t42 () (not @t41)) % 0.45/0.67 (define @t43 () (tptp.element @t1 @t2)) % 0.45/0.67 (define @t44 () (tptp.element @t2 (tptp.powerset @t21))) % 0.45/0.67 (define @t45 () (@list @t1 @t2 @t21)) % 0.45/0.67 (define @t46 () (not @t24)) % 0.45/0.67 (define @t47 () (or @t4 @t46 @t38)) % 0.45/0.67 (define @t48 () (or @t4 @t46)) % 0.45/0.67 (define @t49 () (not @t25)) % 0.45/0.67 (define @t50 () (@quantifiers_skolemize (forall @t9 (= @t13 (forall @t26 @t47))) 0)) % 0.45/0.67 (define @t51 () (tptp.in @t30 @t50)) % 0.45/0.67 (define @t52 () (tptp.in @t22 @t50)) % 0.45/0.67 (define @t53 () (not (tptp.in @t21 @t50))) % 0.45/0.67 (define @t54 () (not (tptp.in @t2 @t50))) % 0.45/0.67 (define @t55 () (forall @t26 (or @t54 @t53 (and @t52 @t51)))) % 0.45/0.67 (define @t56 () (tptp.preboolean @t50)) % 0.45/0.67 (define @t57 () (= @t56 @t55)) % 0.45/0.67 (define @t58 () (forall @t26 (or @t54 @t53 @t52))) % 0.45/0.67 (define @t59 () (@quantifiers_skolemize @t58 1)) % 0.45/0.67 (define @t60 () (@quantifiers_skolemize @t58 0)) % 0.45/0.67 (define @t61 () (tptp.in (tptp.set_union2 @t60 @t59) @t50)) % 0.45/0.67 (define @t62 () (and @t61 (tptp.in (tptp.set_difference @t60 @t59) @t50))) % 0.45/0.67 (define @t63 () (tptp.in @t59 @t50)) % 0.45/0.67 (define @t64 () (not @t63)) % 0.45/0.67 (define @t65 () (tptp.in @t60 @t50)) % 0.45/0.67 (define @t66 () (not @t65)) % 0.45/0.67 (define @t67 () (or @t66 @t64 @t62)) % 0.45/0.67 (define @t68 () (forall @t26 (or @t54 @t53 @t51))) % 0.45/0.67 (define @t69 () (@quantifiers_skolemize @t68 1)) % 0.45/0.67 (define @t70 () (@quantifiers_skolemize @t68 0)) % 0.45/0.67 (define @t71 () (tptp.in (tptp.set_difference @t70 @t69) @t50)) % 0.45/0.67 (define @t72 () (and (tptp.in (tptp.set_union2 @t70 @t69) @t50) @t71)) % 0.45/0.67 (define @t73 () (tptp.in @t69 @t50)) % 0.45/0.67 (define @t74 () (not @t73)) % 0.45/0.67 (define @t75 () (tptp.in @t70 @t50)) % 0.45/0.67 (define @t76 () (not @t75)) % 0.45/0.67 (define @t77 () (or @t76 @t74 @t72)) % 0.45/0.67 (define @t78 () (or @t66 @t64 @t61)) % 0.45/0.67 (define @t79 () (not @t67)) % 0.45/0.67 (define @t80 () (not @t78)) % 0.45/0.67 (define @t81 () (not @t58)) % 0.45/0.67 (define @t82 () (@list @t50)) % 0.45/0.67 (define @t83 () (tptp.cup_closed @t50)) % 0.45/0.67 (define @t84 () (= @t83 @t58)) % 0.45/0.67 (define @t85 () (not @t84)) % 0.45/0.67 (define @t86 () (not @t10)) % 0.45/0.67 (define @t87 () (not @t11)) % 0.45/0.67 (define @t88 () (tptp.diff_closed @t50)) % 0.45/0.67 (define @t89 () (not @t88)) % 0.45/0.67 (define @t90 () (not @t83)) % 0.45/0.67 (define @t91 () (or @t90 @t89 @t56)) % 0.45/0.67 (define @t92 () (= @t88 @t68)) % 0.45/0.67 (define @t93 () (not @t92)) % 0.45/0.67 (define @t94 () (not @t68)) % 0.45/0.67 (define @t95 () (or @t76 @t74 @t71)) % 0.45/0.67 (define @t96 () (not @t95)) % 0.45/0.67 (define @t97 () (not @t77)) % 0.45/0.67 (define @t98 () (@list false false)) % 0.45/0.67 (define @t99 () (not @t55)) % 0.45/0.67 (define @t100 () (@quantifiers_skolemize @t55 1)) % 0.45/0.67 (define @t101 () (@quantifiers_skolemize @t55 0)) % 0.45/0.67 (define @t102 () (tptp.in (tptp.set_difference @t101 @t100) @t50)) % 0.45/0.67 (define @t103 () (tptp.in (tptp.set_union2 @t101 @t100) @t50)) % 0.45/0.67 (define @t104 () (and @t103 @t102)) % 0.45/0.67 (define @t105 () (tptp.in @t100 @t50)) % 0.45/0.67 (define @t106 () (not @t105)) % 0.45/0.67 (define @t107 () (tptp.in @t101 @t50)) % 0.45/0.67 (define @t108 () (not @t107)) % 0.45/0.67 (define @t109 () (or @t108 @t106 @t104)) % 0.45/0.67 (define @t110 () (not @t109)) % 0.45/0.67 (define @t111 () (@list true)) % 0.45/0.67 (define @t112 () (@list @t109)) % 0.45/0.67 (define @t113 () (and @t83 @t88)) % 0.45/0.67 (define @t114 () (= @t56 @t113)) % 0.45/0.67 (define @t115 () (not @t113)) % 0.45/0.67 (define @t116 () (@list false)) % 0.45/0.67 (define @t117 () (@list @t113)) % 0.45/0.67 (define @t118 () (@list @t101 @t100)) % 0.45/0.67 (define @t119 () (or @t108 @t106 @t103)) % 0.45/0.67 (define @t120 () (@list false false false)) % 0.45/0.67 (define @t121 () (or @t108 @t106 @t102)) % 0.45/0.67 (assume @p1 (forall @t6 (=> @t5 @t4))) % 0.45/0.67 (assume @p2 (forall @t9 (=> @t8 @t7))) % 0.45/0.67 (assume @p3 (forall @t9 (=> @t13 @t12))) % 0.45/0.67 (assume @p4 (forall @t9 (=> @t7 (forall @t17 (=> @t16 @t14))))) % 0.45/0.67 (assume @p5 @t18) % 0.45/0.67 (assume @p6 (forall @t6 (= @t20 @t19))) % 0.45/0.67 (assume @p7 @t29) % 0.45/0.67 (assume @p8 @t34) % 0.45/0.67 (assume @p9 (forall @t9 (= @t13 @t12))) % 0.45/0.67 (assume @p10 (forall @t9 (exists @t17 (tptp.element @t2 @t1)))) % 0.45/0.67 (assume @p11 (forall @t6 (=> @t7 (tptp.finite (tptp.set_difference @t1 @t2))))) % 0.45/0.67 (assume @p12 (forall @t9 (not (tptp.empty @t15)))) % 0.45/0.67 (assume @p13 (tptp.empty tptp.empty_set)) % 0.45/0.67 (assume @p14 (forall @t6 (=> @t35 (not (tptp.empty @t20))))) % 0.45/0.67 (assume @p15 (forall @t6 (=> @t35 (not (tptp.empty @t19))))) % 0.45/0.67 (assume @p16 (forall @t6 (=> (and @t7 @t14) (tptp.finite @t20)))) % 0.45/0.67 (assume @p17 (forall @t6 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.45/0.67 (assume @p18 (exists @t9 (and @t35 @t7))) % 0.45/0.67 (assume @p19 (exists @t9 (and @t35 @t11 (tptp.cap_closed @t1) @t10 @t13))) % 0.45/0.67 (assume @p20 (forall @t9 (=> @t35 (exists @t17 (and @t16 @t37))))) % 0.45/0.67 (assume @p21 (exists @t9 @t8)) % 0.45/0.67 (assume @p22 (forall @t9 (exists @t17 (and @t16 @t36 (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.45/0.67 (assume @p23 (forall @t9 (exists @t17 (and @t16 @t36)))) % 0.45/0.67 (assume @p24 (exists @t9 @t35)) % 0.45/0.67 (assume @p25 (forall @t9 (=> @t35 (exists @t17 (and @t16 @t37 @t14))))) % 0.45/0.67 (assume @p26 (forall @t6 (tptp.subset @t1 @t1))) % 0.45/0.67 (assume @p27 @t42) % 0.45/0.67 (assume @p28 (forall @t9 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.45/0.67 (assume @p29 (forall @t6 (=> @t5 @t43))) % 0.45/0.67 (assume @p30 (forall @t6 (=> @t43 (or @t36 @t5)))) % 0.45/0.67 (assume @p31 (forall @t9 (= (tptp.set_difference @t1 tptp.empty_set) @t1))) % 0.45/0.67 (assume @p32 (forall @t6 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.45/0.67 (assume @p33 (forall @t9 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set))) % 0.45/0.67 (assume @p34 (forall @t45 (=> (and @t5 @t44) (tptp.element @t1 @t21)))) % 0.45/0.67 (assume @p35 (forall @t45 (not (and @t5 @t44 (tptp.empty @t21))))) % 0.45/0.67 (assume @p36 (forall @t9 (=> @t8 (= @t1 tptp.empty_set)))) % 0.45/0.67 (assume @p37 (forall @t6 (not (and @t5 @t36)))) % 0.45/0.67 (assume @p38 (forall @t6 (not (and @t8 (not (= @t1 @t2)) @t36)))) % 0.45/0.67 (assume @p39 true) % 0.45/0.67 (step @p40 :rule aci_norm :args ((= (or @t48 @t38) @t47))) % 0.45/0.67 (step @p41 :rule refl :args (@t38)) % 0.45/0.67 (step @p42 :rule bool-and-de-morgan :args (@t3 @t24 true)) % 0.45/0.67 (step @p43 :rule nary_cong :premises (@p42 @p41) :args ((or @t49 @t38))) % 0.45/0.67 (step @p44 :rule trans :premises (@p43 @p40)) % 0.45/0.67 (step @p45 :rule bool-impl-elim :args (@t25 @t38)) % 0.45/0.67 (step @p46 :rule trans :premises (@p45 @p44)) % 0.45/0.67 (step @p47 :rule cong :premises (@p46) :args (@t39)) % 0.45/0.67 (step @p48 :rule refl :args (@t13)) % 0.45/0.67 (step @p49 :rule cong :premises (@p48 @p47) :args (@t40)) % 0.45/0.67 (step @p50 :rule cong :premises (@p49) :args (@t41)) % 0.45/0.67 (step @p51 :rule cong :premises (@p50) :args (@t42)) % 0.45/0.67 (step @p52 :rule eq_resolve :premises (@p27 @p51)) % 0.45/0.67 (step @p53 :rule skolemize :premises (@p52)) % 0.45/0.67 (step @p54 :rule cnf_equiv_neg1 :args (@t57)) % 0.45/0.67 (step @p55 :rule reordering :premises (@p54) :args ((or @t56 @t55 @t57))) % 0.45/0.67 (assume-push @p222 @t55) % 0.45/0.67 (step @p57 :rule instantiate :premises (@p222) :args ((@list @t60 @t59))) % 0.45/0.67 (step-pop @p223 :rule scope :premises (@p57)) % 0.45/0.67 (step @p58 :rule process_scope :premises (@p223) :args (@t67)) % 0.45/0.67 (step @p60 :rule implies_elim :premises (@p58)) % 0.45/0.67 (assume-push @p224 @t55) % 0.45/0.67 (step @p62 :rule instantiate :premises (@p224) :args ((@list @t70 @t69))) % 0.45/0.67 (step-pop @p225 :rule scope :premises (@p62)) % 0.45/0.67 (step @p63 :rule process_scope :premises (@p225) :args (@t77)) % 0.45/0.67 (step @p65 :rule implies_elim :premises (@p63)) % 0.45/0.67 (step @p66 :rule bool-double-not-elim :args (@t65)) % 0.45/0.67 (step @p67 :rule refl :args (@t78)) % 0.45/0.67 (step @p68 :rule nary_cong :premises (@p67 @p66) :args ((or @t78 (not @t66)))) % 0.45/0.67 (step @p69 :rule cnf_or_neg :args (@t78 0)) % 0.45/0.67 (step @p70 :rule eq_resolve :premises (@p69 @p68)) % 0.45/0.67 (step @p71 :rule reordering :premises (@p70) :args ((or @t65 @t78))) % 0.45/0.67 (step @p72 :rule bool-double-not-elim :args (@t63)) % 0.45/0.67 (step @p73 :rule nary_cong :premises (@p67 @p72) :args ((or @t78 (not @t64)))) % 0.45/0.67 (step @p74 :rule cnf_or_neg :args (@t78 1)) % 0.45/0.67 (step @p75 :rule eq_resolve :premises (@p74 @p73)) % 0.45/0.67 (step @p76 :rule reordering :premises (@p75) :args ((or @t63 @t78))) % 0.45/0.67 (step @p77 :rule cnf_or_neg :args (@t78 2)) % 0.45/0.67 (step @p78 :rule cnf_or_pos :args (@t67)) % 0.45/0.67 (step @p79 :rule reordering :premises (@p78) :args ((or @t66 @t64 @t62 @t79))) % 0.45/0.67 (step @p80 :rule cnf_and_pos :args (@t62 0)) % 0.45/0.67 (step @p81 :rule reordering :premises (@p80) :args ((or @t61 (not @t62)))) % 0.45/0.67 (step @p82 :rule chain_m_resolution :premises (@p81 @p79 @p77 @p76 @p71) :args ((or @t78 @t79) (@list false true false false) (@list @t62 @t61 @t63 @t65))) % 0.45/0.67 (step @p83 :rule refl :args (@t80)) % 0.45/0.67 (step @p84 :rule bool-double-not-elim :args (@t58)) % 0.45/0.67 (step @p85 :rule nary_cong :premises (@p84 @p83) :args ((or (not @t81) @t80))) % 0.45/0.67 (assume-push @p226 @t81) % 0.45/0.67 (step @p87 :rule skolemize :premises (@p226)) % 0.45/0.67 (step-pop @p227 :rule scope :premises (@p87)) % 0.45/0.67 (step @p88 :rule process_scope :premises (@p227) :args (@t80)) % 0.45/0.67 (step @p90 :rule implies_elim :premises (@p88)) % 0.45/0.67 (step @p91 :rule eq_resolve :premises (@p90 @p85)) % 0.45/0.67 (step @p92 :rule aci_norm :args ((= (or @t48 @t23) (or @t4 @t46 @t23)))) % 0.45/0.67 (step @p93 :rule refl :args (@t23)) % 0.45/0.67 (step @p94 :rule nary_cong :premises (@p42 @p93) :args ((or @t49 @t23))) % 0.45/0.67 (step @p95 :rule trans :premises (@p94 @p92)) % 0.45/0.67 (step @p96 :rule bool-impl-elim :args (@t25 @t23)) % 0.45/0.67 (step @p97 :rule trans :premises (@p96 @p95)) % 0.45/0.67 (step @p98 :rule cong :premises (@p97) :args (@t27)) % 0.45/0.67 (step @p99 :rule refl :args (@t11)) % 0.45/0.67 (step @p100 :rule cong :premises (@p99 @p98) :args (@t28)) % 0.45/0.67 (step @p101 :rule cong :premises (@p100) :args (@t29)) % 0.45/0.67 (step @p102 :rule eq_resolve :premises (@p7 @p101)) % 0.45/0.67 (step @p103 :rule instantiate :premises (@p102) :args (@t82)) % 0.45/0.67 (step @p104 :rule cnf_equiv_pos2 :args (@t84)) % 0.45/0.67 (step @p105 :rule reordering :premises (@p104) :args ((or @t83 @t81 @t85))) % 0.45/0.67 (step @p106 :rule aci_norm :args ((= (or (or @t87 @t86) @t13) (or @t87 @t86 @t13)))) % 0.45/0.67 (step @p107 :rule refl :args (@t13)) % 0.45/0.67 (step @p108 :rule bool-and-de-morgan :args (@t11 @t10 true)) % 0.45/0.67 (step @p109 :rule nary_cong :premises (@p108 @p107) :args ((or (not @t12) @t13))) % 0.45/0.67 (step @p110 :rule trans :premises (@p109 @p106)) % 0.45/0.67 (step @p111 :rule bool-impl-elim :args (@t12 @t13)) % 0.45/0.67 (step @p112 :rule trans :premises (@p111 @p110)) % 0.45/0.67 (step @p113 :rule cong :premises (@p112) :args (@t18)) % 0.45/0.67 (step @p114 :rule eq_resolve :premises (@p5 @p113)) % 0.45/0.67 (step @p115 :rule instantiate :premises (@p114) :args (@t82)) % 0.45/0.67 (step @p116 :rule cnf_or_pos :args (@t91)) % 0.45/0.67 (step @p117 :rule reordering :premises (@p116) :args ((or @t56 @t90 @t89 (not @t91)))) % 0.45/0.67 (step @p118 :rule aci_norm :args ((= (or @t48 @t31) (or @t4 @t46 @t31)))) % 0.45/0.67 (step @p119 :rule refl :args (@t31)) % 0.45/0.67 (step @p120 :rule nary_cong :premises (@p42 @p119) :args ((or @t49 @t31))) % 0.45/0.67 (step @p121 :rule trans :premises (@p120 @p118)) % 0.45/0.67 (step @p122 :rule bool-impl-elim :args (@t25 @t31)) % 0.45/0.67 (step @p123 :rule trans :premises (@p122 @p121)) % 0.45/0.67 (step @p124 :rule cong :premises (@p123) :args (@t32)) % 0.45/0.67 (step @p125 :rule refl :args (@t10)) % 0.45/0.67 (step @p126 :rule cong :premises (@p125 @p124) :args (@t33)) % 0.45/0.67 (step @p127 :rule cong :premises (@p126) :args (@t34)) % 0.45/0.67 (step @p128 :rule eq_resolve :premises (@p8 @p127)) % 0.45/0.67 (step @p129 :rule instantiate :premises (@p128) :args (@t82)) % 0.45/0.67 (step @p130 :rule cnf_equiv_pos2 :args (@t92)) % 0.45/0.67 (step @p131 :rule reordering :premises (@p130) :args ((or @t88 @t94 @t93))) % 0.45/0.67 (step @p132 :rule refl :args (@t96)) % 0.45/0.67 (step @p133 :rule bool-double-not-elim :args (@t68)) % 0.45/0.67 (step @p134 :rule nary_cong :premises (@p133 @p132) :args ((or (not @t94) @t96))) % 0.45/0.67 (assume-push @p228 @t94) % 0.45/0.67 (step @p136 :rule skolemize :premises (@p228)) % 0.45/0.67 (step-pop @p229 :rule scope :premises (@p136)) % 0.45/0.67 (step @p137 :rule process_scope :premises (@p229) :args (@t96)) % 0.45/0.67 (step @p139 :rule implies_elim :premises (@p137)) % 0.45/0.67 (step @p140 :rule eq_resolve :premises (@p139 @p134)) % 0.45/0.67 (step @p141 :rule cnf_or_neg :args (@t95 2)) % 0.45/0.67 (step @p142 :rule bool-double-not-elim :args (@t75)) % 0.45/0.67 (step @p143 :rule refl :args (@t95)) % 0.45/0.67 (step @p144 :rule nary_cong :premises (@p143 @p142) :args ((or @t95 (not @t76)))) % 0.45/0.67 (step @p145 :rule cnf_or_neg :args (@t95 0)) % 0.45/0.67 (step @p146 :rule eq_resolve :premises (@p145 @p144)) % 0.45/0.67 (step @p147 :rule reordering :premises (@p146) :args ((or @t75 @t95))) % 0.45/0.67 (step @p148 :rule bool-double-not-elim :args (@t73)) % 0.45/0.67 (step @p149 :rule nary_cong :premises (@p143 @p148) :args ((or @t95 (not @t74)))) % 0.45/0.67 (step @p150 :rule cnf_or_neg :args (@t95 1)) % 0.45/0.67 (step @p151 :rule eq_resolve :premises (@p150 @p149)) % 0.45/0.67 (step @p152 :rule reordering :premises (@p151) :args ((or @t73 @t95))) % 0.45/0.67 (step @p153 :rule cnf_or_pos :args (@t77)) % 0.45/0.67 (step @p154 :rule reordering :premises (@p153) :args ((or @t76 @t74 @t72 @t97))) % 0.45/0.67 (step @p155 :rule chain_m_resolution :premises (@p154 @p152 @p147) :args ((or @t95 @t72 @t97) @t98 (@list @t73 @t75))) % 0.45/0.67 (step @p156 :rule cnf_and_pos :args (@t72 1)) % 0.45/0.67 (step @p157 :rule reordering :premises (@p156) :args ((or @t71 (not @t72)))) % 0.45/0.67 (step @p158 :rule chain_m_resolution :premises (@p157 @p155 @p141 @p140 @p131 @p129 @p117 @p115 @p105 @p103 @p91 @p82 @p65 @p60 @p55 @p53) :args (@t56 (@list false true true true false true false false false false false false false false true) (@list @t72 @t71 @t95 @t68 @t92 @t88 @t91 @t83 @t84 @t58 @t78 @t77 @t67 @t55 @t57))) % 0.45/0.67 (step @p159 :rule cnf_equiv_neg2 :args (@t57)) % 0.45/0.67 (step @p160 :rule chain_m_resolution :premises (@p159 @p53 @p158) :args (@t99 (@list true false) (@list @t57 @t56))) % 0.45/0.67 (step @p161 :rule refl :args (@t110)) % 0.45/0.67 (step @p162 :rule bool-double-not-elim :args (@t55)) % 0.45/0.67 (step @p163 :rule nary_cong :premises (@p162 @p161) :args ((or (not @t99) @t110))) % 0.45/0.67 (assume-push @p230 @t99) % 0.45/0.67 (step @p165 :rule skolemize :premises (@p230)) % 0.45/0.67 (step-pop @p231 :rule scope :premises (@p165)) % 0.45/0.67 (step @p166 :rule process_scope :premises (@p231) :args (@t110)) % 0.45/0.67 (step @p168 :rule implies_elim :premises (@p166)) % 0.45/0.67 (step @p169 :rule eq_resolve :premises (@p168 @p163)) % 0.45/0.67 (step @p170 :rule chain_m_resolution :premises (@p169 @p160) :args (@t110 @t111 (@list @t55))) % 0.45/0.67 (step @p171 :rule cnf_or_neg :args (@t109 2)) % 0.45/0.67 (step @p172 :rule chain_m_resolution :premises (@p171 @p170) :args ((not @t104) @t111 @t112)) % 0.45/0.67 (step @p173 :rule instantiate :premises (@p9) :args (@t82)) % 0.45/0.67 (step @p174 :rule cnf_equiv_pos1 :args (@t114)) % 0.45/0.67 (step @p175 :rule reordering :premises (@p174) :args ((or (not @t56) @t113 (not @t114)))) % 0.45/0.67 (step @p176 :rule chain_m_resolution :premises (@p175 @p158 @p173) :args (@t113 @t98 (@list @t56 @t114))) % 0.45/0.67 (step @p177 :rule cnf_and_pos :args (@t113 0)) % 0.45/0.67 (step @p178 :rule reordering :premises (@p177) :args ((or @t83 @t115))) % 0.45/0.67 (step @p179 :rule chain_m_resolution :premises (@p178 @p176) :args (@t83 @t116 @t117)) % 0.45/0.67 (step @p180 :rule cnf_equiv_pos1 :args (@t84)) % 0.45/0.67 (step @p181 :rule reordering :premises (@p180) :args ((or @t90 @t58 @t85))) % 0.45/0.67 (step @p182 :rule chain_m_resolution :premises (@p181 @p179 @p103) :args (@t58 @t98 (@list @t83 @t84))) % 0.45/0.67 (assume-push @p232 @t58) % 0.45/0.67 (step @p184 :rule instantiate :premises (@p232) :args (@t118)) % 0.45/0.67 (step-pop @p233 :rule scope :premises (@p184)) % 0.45/0.67 (step @p185 :rule process_scope :premises (@p233) :args (@t119)) % 0.45/0.67 (step @p187 :rule implies_elim :premises (@p185)) % 0.45/0.67 (step @p188 :rule chain_m_resolution :premises (@p187 @p182) :args (@t119 @t116 (@list @t58))) % 0.45/0.67 (step @p189 :rule bool-double-not-elim :args (@t105)) % 0.45/0.67 (step @p190 :rule refl :args (@t109)) % 0.45/0.67 (step @p191 :rule nary_cong :premises (@p190 @p189) :args ((or @t109 (not @t106)))) % 0.45/0.67 (step @p192 :rule cnf_or_neg :args (@t109 1)) % 0.45/0.67 (step @p193 :rule eq_resolve :premises (@p192 @p191)) % 0.45/0.67 (step @p194 :rule reordering :premises (@p193) :args ((or @t105 @t109))) % 0.45/0.67 (step @p195 :rule chain_m_resolution :premises (@p194 @p170) :args (@t105 @t111 @t112)) % 0.45/0.67 (step @p196 :rule bool-double-not-elim :args (@t107)) % 0.45/0.67 (step @p197 :rule nary_cong :premises (@p190 @p196) :args ((or @t109 (not @t108)))) % 0.45/0.67 (step @p198 :rule cnf_or_neg :args (@t109 0)) % 0.45/0.67 (step @p199 :rule eq_resolve :premises (@p198 @p197)) % 0.45/0.67 (step @p200 :rule reordering :premises (@p199) :args ((or @t107 @t109))) % 0.45/0.67 (step @p201 :rule chain_m_resolution :premises (@p200 @p170) :args (@t107 @t111 @t112)) % 0.45/0.67 (step @p202 :rule cnf_or_pos :args (@t119)) % 0.45/0.67 (step @p203 :rule reordering :premises (@p202) :args ((or @t108 @t106 @t103 (not @t119)))) % 0.45/0.67 (step @p204 :rule chain_m_resolution :premises (@p203 @p201 @p195 @p188) :args (@t103 @t120 (@list @t107 @t105 @t119))) % 0.45/0.67 (step @p205 :rule cnf_and_pos :args (@t113 1)) % 0.45/0.67 (step @p206 :rule reordering :premises (@p205) :args ((or @t88 @t115))) % 0.45/0.67 (step @p207 :rule chain_m_resolution :premises (@p206 @p176) :args (@t88 @t116 @t117)) % 0.45/0.67 (step @p208 :rule cnf_equiv_pos1 :args (@t92)) % 0.45/0.67 (step @p209 :rule reordering :premises (@p208) :args ((or @t89 @t68 @t93))) % 0.45/0.67 (step @p210 :rule chain_m_resolution :premises (@p209 @p207 @p129) :args (@t68 @t98 (@list @t88 @t92))) % 0.45/0.67 (assume-push @p234 @t68) % 0.45/0.67 (step @p212 :rule instantiate :premises (@p234) :args (@t118)) % 0.45/0.67 (step-pop @p235 :rule scope :premises (@p212)) % 0.45/0.67 (step @p213 :rule process_scope :premises (@p235) :args (@t121)) % 0.45/0.67 (step @p215 :rule implies_elim :premises (@p213)) % 0.45/0.67 (step @p216 :rule chain_m_resolution :premises (@p215 @p210) :args (@t121 @t116 (@list @t68))) % 0.45/0.67 (step @p217 :rule cnf_or_pos :args (@t121)) % 0.45/0.67 (step @p218 :rule reordering :premises (@p217) :args ((or @t108 @t106 @t102 (not @t121)))) % 0.45/0.67 (step @p219 :rule chain_m_resolution :premises (@p218 @p201 @p195 @p216) :args (@t102 @t120 (@list @t107 @t105 @t121))) % 0.45/0.67 (step @p220 :rule cnf_and_neg :args (@t104)) % 0.45/0.67 (step @p221 false :rule chain_m_resolution :premises (@p220 @p219 @p204 @p172) :args (false (@list false false true) (@list @t102 @t103 @t104))) % 0.45/0.67 ) % 0.45/0.67 % SZS output end Proof % 0.45/0.67 % cvc5 exiting %------------------------------------------------------------------------------