%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU328+1 : TPTP v9.2.1. Released v3.3.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:51:24 AM UTC 2026 % Result : Theorem 0.48s 0.64s % Output : Proof 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU328+1 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n015.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 16:57:34 EDT 2026 % 0.17/0.35 % CPUTime : % 0.28/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.48/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.48/0.64 % SZS status Theorem % 0.48/0.64 % SZS output start Proof % 0.48/0.64 ( % 0.48/0.64 (declare-sort $$unsorted 0) % 0.48/0.64 (declare-const tptp.union (-> $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.empty_set $$unsorted) % 0.48/0.64 (declare-const tptp.complements_of_subsets (-> $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.subset_difference (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.union_of_subsets (-> $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.cast_to_subset (-> $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.set_meet (-> $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.v3_membered (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.natural (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.v1_membered (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.subset_complement (-> $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.v1_xreal_0 (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.v5_membered (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.v2_membered (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.v1_rat_1 (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.meet_of_subsets (-> $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.v1_xcmplx_0 (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.v1_int_1 (-> $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.v4_membered (-> $$unsorted Bool)) % 0.48/0.64 (define @t1 () (@var "A" $$unsorted)) % 0.48/0.64 (define @t2 () (@var "B" $$unsorted)) % 0.48/0.64 (define @t3 () (tptp.in @t1 @t2)) % 0.48/0.64 (define @t4 () (@list @t1 @t2)) % 0.48/0.64 (define @t5 () (tptp.v1_xcmplx_0 @t2)) % 0.48/0.64 (define @t6 () (tptp.element @t2 @t1)) % 0.48/0.64 (define @t7 () (@list @t2)) % 0.48/0.64 (define @t8 () (tptp.v1_membered @t1)) % 0.48/0.64 (define @t9 () (@list @t1)) % 0.48/0.64 (define @t10 () (tptp.v1_xreal_0 @t2)) % 0.48/0.64 (define @t11 () (tptp.v2_membered @t1)) % 0.48/0.64 (define @t12 () (tptp.v1_rat_1 @t2)) % 0.48/0.64 (define @t13 () (tptp.v3_membered @t1)) % 0.48/0.64 (define @t14 () (tptp.v1_int_1 @t2)) % 0.48/0.64 (define @t15 () (tptp.v4_membered @t1)) % 0.48/0.64 (define @t16 () (tptp.v5_membered @t1)) % 0.48/0.64 (define @t17 () (tptp.empty @t1)) % 0.48/0.64 (define @t18 () (tptp.v1_membered @t2)) % 0.48/0.64 (define @t19 () (tptp.powerset @t1)) % 0.48/0.64 (define @t20 () (tptp.element @t2 @t19)) % 0.48/0.64 (define @t21 () (tptp.v2_membered @t2)) % 0.48/0.64 (define @t22 () (tptp.v3_membered @t2)) % 0.48/0.64 (define @t23 () (tptp.v4_membered @t2)) % 0.48/0.64 (define @t24 () (tptp.cast_to_subset @t1)) % 0.48/0.64 (define @t25 () (forall @t9 (= @t24 @t1))) % 0.48/0.64 (define @t26 () (tptp.set_difference @t1 @t2)) % 0.48/0.64 (define @t27 () (tptp.subset_complement @t1 @t2)) % 0.48/0.64 (define @t28 () (= @t27 @t26)) % 0.48/0.64 (define @t29 () (forall @t4 (=> @t20 @t28))) % 0.48/0.64 (define @t30 () (tptp.union_of_subsets @t1 @t2)) % 0.48/0.64 (define @t31 () (tptp.powerset @t19)) % 0.48/0.64 (define @t32 () (tptp.element @t2 @t31)) % 0.48/0.64 (define @t33 () (tptp.meet_of_subsets @t1 @t2)) % 0.48/0.64 (define @t34 () (tptp.element @t33 @t19)) % 0.48/0.64 (define @t35 () (forall @t4 (=> @t32 @t34))) % 0.48/0.64 (define @t36 () (@var "C" $$unsorted)) % 0.48/0.64 (define @t37 () (tptp.subset_difference @t1 @t2 @t36)) % 0.48/0.64 (define @t38 () (tptp.element @t36 @t19)) % 0.48/0.64 (define @t39 () (and @t20 @t38)) % 0.48/0.64 (define @t40 () (@list @t1 @t2 @t36)) % 0.48/0.64 (define @t41 () (tptp.complements_of_subsets @t1 @t2)) % 0.48/0.64 (define @t42 () (tptp.v1_membered @t26)) % 0.48/0.64 (define @t43 () (tptp.v2_membered @t26)) % 0.48/0.64 (define @t44 () (tptp.v3_membered @t26)) % 0.48/0.64 (define @t45 () (tptp.v4_membered @t26)) % 0.48/0.64 (define @t46 () (not @t17)) % 0.48/0.64 (define @t47 () (tptp.empty @t2)) % 0.48/0.64 (define @t48 () (= @t37 (tptp.set_difference @t2 @t36))) % 0.48/0.64 (define @t49 () (forall @t40 (=> @t39 @t48))) % 0.48/0.64 (define @t50 () (tptp.union_of_subsets @t1 @t41)) % 0.48/0.64 (define @t51 () (= @t50 (tptp.subset_complement @t1 @t33))) % 0.48/0.64 (define @t52 () (= @t2 tptp.empty_set)) % 0.48/0.64 (define @t53 () (not @t52)) % 0.48/0.64 (define @t54 () (=> @t53 @t51)) % 0.48/0.64 (define @t55 () (forall @t4 (=> @t32 @t54))) % 0.48/0.64 (define @t56 () (not @t55)) % 0.48/0.64 (define @t57 () (tptp.element @t1 @t2)) % 0.48/0.64 (define @t58 () (= @t50 (tptp.subset_difference @t1 @t24 @t33))) % 0.48/0.64 (define @t59 () (=> @t53 @t58)) % 0.48/0.64 (define @t60 () (forall @t4 (=> @t32 @t59))) % 0.48/0.64 (define @t61 () (tptp.element @t2 (tptp.powerset @t36))) % 0.48/0.64 (define @t62 () (not @t32)) % 0.48/0.64 (define @t63 () (or @t62 @t52 @t51)) % 0.48/0.64 (define @t64 () (not @t53)) % 0.48/0.64 (define @t65 () (forall @t4 @t63)) % 0.48/0.64 (define @t66 () (@quantifiers_skolemize @t65 1)) % 0.48/0.64 (define @t67 () (@quantifiers_skolemize @t65 0)) % 0.48/0.64 (define @t68 () (tptp.meet_of_subsets @t67 @t66)) % 0.48/0.64 (define @t69 () (tptp.subset_complement @t67 @t68)) % 0.48/0.64 (define @t70 () (tptp.union_of_subsets @t67 (tptp.complements_of_subsets @t67 @t66))) % 0.48/0.64 (define @t71 () (= @t70 @t69)) % 0.48/0.64 (define @t72 () (= tptp.empty_set @t66)) % 0.48/0.64 (define @t73 () (tptp.powerset @t67)) % 0.48/0.64 (define @t74 () (tptp.element @t66 (tptp.powerset @t73))) % 0.48/0.64 (define @t75 () (not @t74)) % 0.48/0.64 (define @t76 () (or @t75 @t72 @t71)) % 0.48/0.64 (define @t77 () (not @t76)) % 0.48/0.64 (define @t78 () (not @t65)) % 0.48/0.64 (define @t79 () (= @t66 tptp.empty_set)) % 0.48/0.64 (define @t80 () (or @t75 @t79 @t71)) % 0.48/0.64 (define @t81 () (not @t80)) % 0.48/0.64 (define @t82 () (@list true)) % 0.48/0.64 (define @t83 () (not @t71)) % 0.48/0.64 (define @t84 () (@list @t76)) % 0.48/0.64 (define @t85 () (or @t62 @t52 @t58)) % 0.48/0.64 (define @t86 () (tptp.cast_to_subset @t67)) % 0.48/0.64 (define @t87 () (tptp.subset_difference @t67 @t86 @t68)) % 0.48/0.64 (define @t88 () (= @t70 @t87)) % 0.48/0.64 (define @t89 () (or @t75 @t79 @t88)) % 0.48/0.64 (define @t90 () (forall @t4 @t85)) % 0.48/0.64 (define @t91 () (@list @t67 @t66)) % 0.48/0.64 (define @t92 () (or @t75 @t72 @t88)) % 0.48/0.64 (define @t93 () (tptp.element @t68 @t73)) % 0.48/0.64 (define @t94 () (or @t75 @t93)) % 0.48/0.64 (define @t95 () (@list false false)) % 0.48/0.64 (define @t96 () (= @t69 (tptp.set_difference @t67 @t68))) % 0.48/0.64 (define @t97 () (not @t93)) % 0.48/0.64 (define @t98 () (or @t97 @t96)) % 0.48/0.64 (define @t99 () (@list @t67)) % 0.48/0.64 (define @t100 () (not @t38)) % 0.48/0.64 (define @t101 () (not @t20)) % 0.48/0.64 (define @t102 () (tptp.set_difference @t86 @t68)) % 0.48/0.64 (define @t103 () (= @t87 @t102)) % 0.48/0.64 (define @t104 () (tptp.element @t86 @t73)) % 0.48/0.64 (define @t105 () (not @t104)) % 0.48/0.64 (define @t106 () (or @t105 @t97 @t103)) % 0.48/0.64 (define @t107 () (not @t103)) % 0.48/0.64 (define @t108 () (= @t67 @t86)) % 0.48/0.64 (define @t109 () (not @t108)) % 0.48/0.64 (define @t110 () (not @t88)) % 0.48/0.64 (define @t111 () (not @t96)) % 0.48/0.64 (define @t112 () (and @t83 @t96 @t88 @t108)) % 0.48/0.64 (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1))))) % 0.48/0.64 (assume @p2 (forall @t9 (=> @t8 (forall @t7 (=> @t6 @t5))))) % 0.48/0.64 (assume @p3 (forall @t9 (=> @t11 (forall @t7 (=> @t6 (and @t5 @t10)))))) % 0.48/0.64 (assume @p4 (forall @t9 (=> @t13 (forall @t7 (=> @t6 (and @t5 @t10 @t12)))))) % 0.48/0.64 (assume @p5 (forall @t9 (=> @t15 (forall @t7 (=> @t6 (and @t5 @t10 @t14 @t12)))))) % 0.48/0.64 (assume @p6 (forall @t9 (=> @t16 (forall @t7 (=> @t6 (and @t5 (tptp.natural @t2) @t10 @t14 @t12)))))) % 0.48/0.64 (assume @p7 (forall @t9 (=> @t17 (and @t8 @t11 @t13 @t15 @t16)))) % 0.48/0.64 (assume @p8 (forall @t9 (=> @t8 (forall @t7 (=> @t20 @t18))))) % 0.48/0.64 (assume @p9 (forall @t9 (=> @t11 (forall @t7 (=> @t20 (and @t18 @t21)))))) % 0.48/0.64 (assume @p10 (forall @t9 (=> @t13 (forall @t7 (=> @t20 (and @t18 @t21 @t22)))))) % 0.48/0.64 (assume @p11 (forall @t9 (=> @t15 (forall @t7 (=> @t20 (and @t18 @t21 @t22 @t23)))))) % 0.48/0.64 (assume @p12 (forall @t9 (=> @t16 @t15))) % 0.48/0.64 (assume @p13 (forall @t9 (=> @t16 (forall @t7 (=> @t20 (and @t18 @t21 @t22 @t23 (tptp.v5_membered @t2))))))) % 0.48/0.64 (assume @p14 (forall @t9 (=> @t15 @t13))) % 0.48/0.64 (assume @p15 (forall @t9 (=> @t13 @t11))) % 0.48/0.64 (assume @p16 (forall @t9 (=> @t11 @t8))) % 0.48/0.64 (assume @p17 @t25) % 0.48/0.64 (assume @p18 @t29) % 0.48/0.64 (assume @p19 true) % 0.48/0.64 (assume @p20 (forall @t9 (tptp.element @t24 @t19))) % 0.48/0.64 (assume @p21 (forall @t4 (=> @t20 (tptp.element @t27 @t19)))) % 0.48/0.64 (assume @p22 (forall @t4 (=> @t32 (tptp.element @t30 @t19)))) % 0.48/0.64 (assume @p23 @t35) % 0.48/0.64 (assume @p24 (forall @t40 (=> @t39 (tptp.element @t37 @t19)))) % 0.48/0.64 (assume @p25 (forall @t4 (=> @t32 (tptp.element @t41 @t31)))) % 0.48/0.64 (assume @p26 (forall @t9 (exists @t7 @t6))) % 0.48/0.64 (assume @p27 (forall @t9 (not (tptp.empty @t19)))) % 0.48/0.64 (assume @p28 (forall @t4 (=> @t8 @t42))) % 0.48/0.64 (assume @p29 (forall @t4 (=> @t11 (and @t42 @t43)))) % 0.48/0.64 (assume @p30 (forall @t4 (=> @t13 (and @t42 @t43 @t44)))) % 0.48/0.64 (assume @p31 (forall @t4 (=> @t15 (and @t42 @t43 @t44 @t45)))) % 0.48/0.64 (assume @p32 (forall @t4 (=> @t16 (and @t42 @t43 @t44 @t45 (tptp.v5_membered @t26))))) % 0.48/0.64 (assume @p33 (and (tptp.empty tptp.empty_set) (tptp.v1_membered tptp.empty_set) (tptp.v2_membered tptp.empty_set) (tptp.v3_membered tptp.empty_set) (tptp.v4_membered tptp.empty_set) (tptp.v5_membered tptp.empty_set))) % 0.48/0.64 (assume @p34 (forall @t4 (=> @t20 (= (tptp.subset_complement @t1 @t27) @t2)))) % 0.48/0.64 (assume @p35 (forall @t4 (=> @t32 (= (tptp.complements_of_subsets @t1 @t41) @t2)))) % 0.48/0.64 (assume @p36 (exists @t9 (and @t46 @t8 @t11 @t13 @t15 @t16))) % 0.48/0.64 (assume @p37 (forall @t9 (=> @t46 (exists @t7 (and @t20 (not @t47)))))) % 0.48/0.64 (assume @p38 (forall @t9 (exists @t7 (and @t20 @t47)))) % 0.48/0.64 (assume @p39 (forall @t4 (=> @t32 (= @t30 (tptp.union @t2))))) % 0.48/0.64 (assume @p40 (forall @t4 (=> @t32 (= @t33 (tptp.set_meet @t2))))) % 0.48/0.64 (assume @p41 @t49) % 0.48/0.64 (assume @p42 (forall @t4 (tptp.subset @t1 @t1))) % 0.48/0.64 (assume @p43 @t56) % 0.48/0.64 (assume @p44 (forall @t4 (=> @t3 @t57))) % 0.48/0.64 (assume @p45 (forall @t4 (=> @t57 (or @t47 @t3)))) % 0.48/0.64 (assume @p46 (forall @t9 (= (tptp.set_difference @t1 tptp.empty_set) @t1))) % 0.48/0.64 (assume @p47 (forall @t4 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.48/0.64 (assume @p48 @t60) % 0.48/0.64 (assume @p49 (forall @t9 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set))) % 0.48/0.64 (assume @p50 (forall @t40 (=> (and @t3 @t61) (tptp.element @t1 @t36)))) % 0.48/0.64 (assume @p51 (forall @t40 (not (and @t3 @t61 (tptp.empty @t36))))) % 0.48/0.64 (assume @p52 (forall @t9 (=> @t17 (= @t1 tptp.empty_set)))) % 0.48/0.64 (assume @p53 (forall @t4 (not (and @t3 @t47)))) % 0.48/0.64 (assume @p54 (forall @t4 (not (and @t17 (not (= @t1 @t2)) @t47)))) % 0.48/0.64 (step @p55 :rule aci_norm :args ((= (or @t62 (or @t52 @t51)) @t63))) % 0.48/0.64 (step @p56 :rule refl :args (@t51)) % 0.48/0.64 (step @p57 :rule bool-double-not-elim :args (@t52)) % 0.48/0.64 (step @p58 :rule nary_cong :premises (@p57 @p56) :args ((or @t64 @t51))) % 0.48/0.64 (step @p59 :rule bool-impl-elim :args (@t53 @t51)) % 0.48/0.64 (step @p60 :rule trans :premises (@p59 @p58)) % 0.48/0.64 (step @p61 :rule refl :args (@t62)) % 0.48/0.64 (step @p62 :rule nary_cong :premises (@p61 @p60) :args ((or @t62 @t54))) % 0.48/0.64 (step @p63 :rule trans :premises (@p62 @p55)) % 0.48/0.64 (step @p64 :rule bool-impl-elim :args (@t32 @t54)) % 0.48/0.64 (step @p65 :rule trans :premises (@p64 @p63)) % 0.48/0.64 (step @p66 :rule cong :premises (@p65) :args (@t55)) % 0.48/0.64 (step @p67 :rule cong :premises (@p66) :args (@t56)) % 0.48/0.64 (step @p68 :rule eq_resolve :premises (@p43 @p67)) % 0.48/0.64 (step @p69 :rule refl :args (@t77)) % 0.48/0.64 (step @p70 :rule bool-double-not-elim :args (@t65)) % 0.48/0.64 (step @p71 :rule nary_cong :premises (@p70 @p69) :args ((or (not @t78) @t77))) % 0.48/0.64 (step @p72 :rule refl :args (@t71)) % 0.48/0.64 (step @p73 :rule eq-symm :args (@t66 tptp.empty_set)) % 0.48/0.64 (step @p74 :rule refl :args (@t75)) % 0.48/0.64 (step @p75 :rule nary_cong :premises (@p74 @p73 @p72) :args (@t80)) % 0.48/0.64 (step @p76 :rule cong :premises (@p75) :args (@t81)) % 0.48/0.64 (step @p77 :rule refl :args (@t78)) % 0.48/0.64 (step @p78 :rule cong :premises (@p77 @p76) :args ((=> @t78 @t81))) % 0.48/0.64 (assume-push @p185 @t78) % 0.48/0.64 (step @p80 :rule skolemize :premises (@p68)) % 0.48/0.64 (step-pop @p186 :rule scope :premises (@p80)) % 0.48/0.64 (step @p81 :rule process_scope :premises (@p186) :args (@t81)) % 0.48/0.64 (step @p83 :rule eq_resolve :premises (@p81 @p78)) % 0.48/0.64 (step @p84 :rule implies_elim :premises (@p83)) % 0.48/0.64 (step @p85 :rule eq_resolve :premises (@p84 @p71)) % 0.48/0.64 (step @p86 :rule chain_m_resolution :premises (@p85 @p68) :args (@t77 @t82 (@list @t65))) % 0.48/0.64 (step @p87 :rule cnf_or_neg :args (@t76 2)) % 0.48/0.64 (step @p88 :rule chain_m_resolution :premises (@p87 @p86) :args (@t83 @t82 @t84)) % 0.48/0.64 (step @p89 :rule aci_norm :args ((= (or @t62 (or @t52 @t58)) @t85))) % 0.48/0.64 (step @p90 :rule refl :args (@t58)) % 0.48/0.64 (step @p91 :rule nary_cong :premises (@p57 @p90) :args ((or @t64 @t58))) % 0.48/0.64 (step @p92 :rule bool-impl-elim :args (@t53 @t58)) % 0.48/0.64 (step @p93 :rule trans :premises (@p92 @p91)) % 0.48/0.64 (step @p94 :rule nary_cong :premises (@p61 @p93) :args ((or @t62 @t59))) % 0.48/0.64 (step @p95 :rule trans :premises (@p94 @p89)) % 0.48/0.64 (step @p96 :rule bool-impl-elim :args (@t32 @t59)) % 0.48/0.64 (step @p97 :rule trans :premises (@p96 @p95)) % 0.48/0.64 (step @p98 :rule cong :premises (@p97) :args (@t60)) % 0.48/0.64 (step @p99 :rule eq_resolve :premises (@p48 @p98)) % 0.48/0.64 (step @p100 :rule refl :args (@t88)) % 0.48/0.64 (step @p101 :rule nary_cong :premises (@p74 @p73 @p100) :args (@t89)) % 0.48/0.64 (step @p102 :rule refl :args (@t90)) % 0.48/0.64 (step @p103 :rule cong :premises (@p102 @p101) :args ((=> @t90 @t89))) % 0.48/0.64 (assume-push @p187 @t90) % 0.48/0.64 (step @p105 :rule instantiate :premises (@p99) :args (@t91)) % 0.48/0.64 (step-pop @p188 :rule scope :premises (@p105)) % 0.48/0.64 (step @p106 :rule process_scope :premises (@p188) :args (@t89)) % 0.48/0.64 (step @p108 :rule eq_resolve :premises (@p106 @p103)) % 0.48/0.64 (step @p109 :rule implies_elim :premises (@p108)) % 0.48/0.64 (step @p110 :rule chain_m_resolution :premises (@p109 @p99) :args (@t92 (@list false) (@list @t90))) % 0.48/0.64 (step @p111 :rule cnf_or_neg :args (@t76 1)) % 0.48/0.64 (step @p112 :rule chain_m_resolution :premises (@p111 @p86) :args ((not @t72) @t82 @t84)) % 0.48/0.64 (step @p113 :rule bool-double-not-elim :args (@t74)) % 0.48/0.64 (step @p114 :rule refl :args (@t76)) % 0.48/0.64 (step @p115 :rule nary_cong :premises (@p114 @p113) :args ((or @t76 (not @t75)))) % 0.48/0.64 (step @p116 :rule cnf_or_neg :args (@t76 0)) % 0.48/0.64 (step @p117 :rule eq_resolve :premises (@p116 @p115)) % 0.48/0.64 (step @p118 :rule reordering :premises (@p117) :args ((or @t74 @t76))) % 0.48/0.64 (step @p119 :rule chain_m_resolution :premises (@p118 @p86) :args (@t74 @t82 @t84)) % 0.48/0.64 (step @p120 :rule cnf_or_pos :args (@t92)) % 0.48/0.64 (step @p121 :rule reordering :premises (@p120) :args ((or @t75 @t72 @t88 (not @t92)))) % 0.48/0.64 (step @p122 :rule chain_m_resolution :premises (@p121 @p119 @p112 @p110) :args (@t88 (@list false true false) (@list @t74 @t72 @t92))) % 0.48/0.64 (step @p123 :rule bool-impl-elim :args (@t20 @t28)) % 0.48/0.64 (step @p124 :rule cong :premises (@p123) :args (@t29)) % 0.48/0.64 (step @p125 :rule eq_resolve :premises (@p18 @p124)) % 0.48/0.64 (step @p126 :rule instantiate :premises (@p125) :args ((@list @t67 @t68))) % 0.48/0.64 (step @p127 :rule bool-impl-elim :args (@t32 @t34)) % 0.48/0.64 (step @p128 :rule cong :premises (@p127) :args (@t35)) % 0.48/0.64 (step @p129 :rule eq_resolve :premises (@p23 @p128)) % 0.48/0.64 (step @p130 :rule instantiate :premises (@p129) :args (@t91)) % 0.48/0.64 (step @p131 :rule cnf_or_pos :args (@t94)) % 0.48/0.64 (step @p132 :rule reordering :premises (@p131) :args ((or @t75 @t93 (not @t94)))) % 0.48/0.64 (step @p133 :rule chain_m_resolution :premises (@p132 @p119 @p130) :args (@t93 @t95 (@list @t74 @t94))) % 0.48/0.64 (step @p134 :rule cnf_or_pos :args (@t98)) % 0.48/0.64 (step @p135 :rule reordering :premises (@p134) :args ((or @t97 @t96 (not @t98)))) % 0.48/0.64 (step @p136 :rule chain_m_resolution :premises (@p135 @p133 @p126) :args (@t96 @t95 (@list @t93 @t98))) % 0.48/0.64 (step @p137 :rule eq-symm :args (@t24 @t1)) % 0.48/0.64 (step @p138 :rule cong :premises (@p137) :args (@t25)) % 0.48/0.64 (step @p139 :rule eq_resolve :premises (@p17 @p138)) % 0.48/0.64 (step @p140 :rule instantiate :premises (@p139) :args (@t99)) % 0.48/0.64 (step @p141 :rule aci_norm :args ((= (or (or @t101 @t100) @t48) (or @t101 @t100 @t48)))) % 0.48/0.64 (step @p142 :rule refl :args (@t48)) % 0.48/0.64 (step @p143 :rule bool-and-de-morgan :args (@t20 @t38 true)) % 0.48/0.64 (step @p144 :rule nary_cong :premises (@p143 @p142) :args ((or (not @t39) @t48))) % 0.48/0.64 (step @p145 :rule trans :premises (@p144 @p141)) % 0.48/0.64 (step @p146 :rule bool-impl-elim :args (@t39 @t48)) % 0.48/0.64 (step @p147 :rule trans :premises (@p146 @p145)) % 0.48/0.64 (step @p148 :rule cong :premises (@p147) :args (@t49)) % 0.48/0.64 (step @p149 :rule eq_resolve :premises (@p41 @p148)) % 0.48/0.64 (step @p150 :rule instantiate :premises (@p149) :args ((@list @t67 @t86 @t68))) % 0.48/0.64 (step @p151 :rule instantiate :premises (@p20) :args (@t99)) % 0.48/0.64 (step @p152 :rule cnf_or_pos :args (@t106)) % 0.48/0.64 (step @p153 :rule reordering :premises (@p152) :args ((or @t97 @t105 @t103 (not @t106)))) % 0.48/0.64 (step @p154 :rule chain_m_resolution :premises (@p153 @p133 @p151 @p150) :args (@t103 (@list false false false) (@list @t93 @t104 @t106))) % 0.48/0.64 (step @p155 :rule refl :args (@t107)) % 0.48/0.64 (step @p156 :rule refl :args (@t109)) % 0.48/0.64 (step @p157 :rule refl :args (@t110)) % 0.48/0.64 (step @p158 :rule refl :args (@t111)) % 0.48/0.64 (step @p159 :rule bool-double-not-elim :args (@t71)) % 0.48/0.64 (step @p160 :rule nary_cong :premises (@p159 @p158 @p157 @p156 @p155) :args ((or (not @t83) @t111 @t110 @t109 @t107))) % 0.48/0.64 (assume-push @p189 @t83) % 0.48/0.64 (assume-push @p190 @t96) % 0.48/0.64 (assume-push @p191 @t88) % 0.48/0.64 (assume-push @p192 @t108) % 0.48/0.64 (step @p165 :rule false_intro :premises (@p88)) % 0.48/0.64 (step @p166 :rule symm :premises (@p136)) % 0.48/0.64 (step @p167 :rule refl :args (@t68)) % 0.48/0.64 (step @p168 :rule symm :premises (@p140)) % 0.48/0.64 (step @p169 :rule cong :premises (@p168 @p167) :args (@t102)) % 0.48/0.64 (step @p170 :rule trans :premises (@p169 @p166)) % 0.48/0.64 (step @p171 :rule symm :premises (@p122)) % 0.48/0.64 (step @p172 :rule cong :premises (@p171 @p170) :args (@t103)) % 0.48/0.64 (step @p173 :rule trans :premises (@p172 @p165)) % 0.48/0.64 (step @p174 :rule false_elim :premises (@p173)) % 0.48/0.64 (step-pop @p193 :rule scope :premises (@p174)) % 0.48/0.64 (step-pop @p194 :rule scope :premises (@p193)) % 0.48/0.64 (step-pop @p195 :rule scope :premises (@p194)) % 0.48/0.64 (step-pop @p196 :rule scope :premises (@p195)) % 0.48/0.64 (step @p175 :rule process_scope :premises (@p196) :args (@t107)) % 0.48/0.64 (step @p180 :rule implies_elim :premises (@p175)) % 0.48/0.64 (step @p181 :rule cnf_and_neg :args (@t112)) % 0.48/0.64 (step @p182 :rule resolution :premises (@p181 @p180) :args (true @t112)) % 0.48/0.64 (step @p183 :rule eq_resolve :premises (@p182 @p160)) % 0.48/0.64 (step @p184 false :rule chain_m_resolution :premises (@p183 @p154 @p140 @p136 @p122 @p88) :args (false (@list false false false false true) (@list @t103 @t108 @t96 @t88 @t71))) % 0.48/0.64 ) % 0.48/0.64 % SZS output end Proof % 0.48/0.64 % cvc5 exiting %------------------------------------------------------------------------------