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