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