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