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