%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET091+1 : TPTP v9.2.1. Bugfixed v7.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n016.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:47:21 AM UTC 2026 % Result : Theorem 0.40s 0.62s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET091+1 : TPTP v9.2.1. Bugfixed v7.3.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n016.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue Jun 2 14:52:24 EDT 2026 % 0.18/0.34 % CPUTime : % 0.33/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.62 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.62 % SZS status Theorem % 0.40/0.62 % SZS output start Proof % 0.40/0.62 ( % 0.40/0.62 (declare-sort $$unsorted 0) % 0.40/0.62 (declare-const tptp.member_of (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.restrict (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.element_relation $$unsorted) % 0.40/0.62 (declare-const tptp.first (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.domain_of (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.second (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.universal_class $$unsorted) % 0.40/0.62 (declare-const tptp.cross_product (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.inductive (-> $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.function (-> $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.subclass (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.sum_class (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.null_class $$unsorted) % 0.40/0.62 (declare-const tptp.rotate (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.flip (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.complement (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.successor (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.successor_relation $$unsorted) % 0.40/0.62 (declare-const tptp.range_of (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.power_class (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.compose (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.image (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.identity_relation $$unsorted) % 0.40/0.62 (define @t1 () (@var "Y" $$unsorted)) % 0.40/0.62 (define @t2 () (@var "U" $$unsorted)) % 0.40/0.62 (define @t3 () (tptp.member @t2 @t1)) % 0.40/0.62 (define @t4 () (@var "X" $$unsorted)) % 0.40/0.62 (define @t5 () (tptp.member @t2 @t4)) % 0.40/0.62 (define @t6 () (@list @t2)) % 0.40/0.62 (define @t7 () (tptp.subclass @t4 @t1)) % 0.40/0.62 (define @t8 () (@list @t4 @t1)) % 0.40/0.62 (define @t9 () (@list @t4)) % 0.40/0.62 (define @t10 () (tptp.member @t2 tptp.universal_class)) % 0.40/0.62 (define @t11 () (tptp.unordered_pair @t4 @t1)) % 0.40/0.62 (define @t12 () (tptp.singleton @t4)) % 0.40/0.62 (define @t13 () (tptp.singleton @t1)) % 0.40/0.62 (define @t14 () (tptp.ordered_pair @t4 @t1)) % 0.40/0.62 (define @t15 () (@var "V" $$unsorted)) % 0.40/0.62 (define @t16 () (tptp.cross_product @t4 @t1)) % 0.40/0.62 (define @t17 () (tptp.ordered_pair @t2 @t15)) % 0.40/0.62 (define @t18 () (tptp.member @t1 tptp.universal_class)) % 0.40/0.62 (define @t19 () (tptp.member @t4 tptp.universal_class)) % 0.40/0.62 (define @t20 () (@var "Z" $$unsorted)) % 0.40/0.62 (define @t21 () (@list @t4 @t1 @t20)) % 0.40/0.62 (define @t22 () (tptp.cross_product tptp.universal_class tptp.universal_class)) % 0.40/0.62 (define @t23 () (tptp.member @t20 @t1)) % 0.40/0.62 (define @t24 () (tptp.member @t20 @t4)) % 0.40/0.62 (define @t25 () (tptp.member @t20 tptp.universal_class)) % 0.40/0.62 (define @t26 () (@list @t4 @t20)) % 0.40/0.62 (define @t27 () (@var "XR" $$unsorted)) % 0.40/0.62 (define @t28 () (@var "W" $$unsorted)) % 0.40/0.62 (define @t29 () (tptp.cross_product @t22 tptp.universal_class)) % 0.40/0.62 (define @t30 () (tptp.ordered_pair @t17 @t28)) % 0.40/0.62 (define @t31 () (tptp.member @t30 @t29)) % 0.40/0.62 (define @t32 () (tptp.rotate @t4)) % 0.40/0.62 (define @t33 () (tptp.flip @t4)) % 0.40/0.62 (define @t34 () (tptp.successor @t4)) % 0.40/0.62 (define @t35 () (@list @t1)) % 0.40/0.62 (define @t36 () (@list @t20)) % 0.40/0.62 (define @t37 () (tptp.inductive @t4)) % 0.40/0.62 (define @t38 () (tptp.sum_class @t4)) % 0.40/0.62 (define @t39 () (@list @t2 @t4)) % 0.40/0.62 (define @t40 () (@var "YR" $$unsorted)) % 0.40/0.62 (define @t41 () (tptp.compose @t40 @t27)) % 0.40/0.62 (define @t42 () (@var "XF" $$unsorted)) % 0.40/0.62 (define @t43 () (tptp.function @t42)) % 0.40/0.62 (define @t44 () (@list @t42)) % 0.40/0.62 (define @t45 () (tptp.apply @t42 @t1)) % 0.40/0.62 (define @t46 () (tptp.member_of @t13)) % 0.40/0.62 (define @t47 () (tptp.member_of @t4)) % 0.40/0.62 (define @t48 () (= @t47 @t4)) % 0.40/0.62 (define @t49 () (tptp.member @t47 tptp.universal_class)) % 0.40/0.62 (define @t50 () (or @t49 @t48)) % 0.40/0.62 (define @t51 () (forall @t9 @t50)) % 0.40/0.62 (define @t52 () (tptp.singleton @t47)) % 0.40/0.62 (define @t53 () (or (= @t52 @t4) @t48)) % 0.40/0.62 (define @t54 () (forall @t9 @t53)) % 0.40/0.62 (define @t55 () (= @t4 @t2)) % 0.40/0.62 (define @t56 () (= @t4 @t13)) % 0.40/0.62 (define @t57 () (and @t18 @t56)) % 0.40/0.62 (define @t58 () (exists @t35 @t57)) % 0.40/0.62 (define @t59 () (not @t58)) % 0.40/0.62 (define @t60 () (and @t59 @t55)) % 0.40/0.62 (define @t61 () (=> @t60 (= @t47 @t2))) % 0.40/0.62 (define @t62 () (@list @t4 @t2)) % 0.40/0.62 (define @t63 () (forall @t62 @t61)) % 0.40/0.62 (define @t64 () (not @t63)) % 0.40/0.62 (define @t65 () (= @t2 (tptp.member_of @t2))) % 0.40/0.62 (define @t66 () (not @t18)) % 0.40/0.62 (define @t67 () (not (forall @t35 (or @t66 (not (= @t2 @t13)))))) % 0.40/0.62 (define @t68 () (or @t67 @t65)) % 0.40/0.62 (define @t69 () (not (= @t2 @t2))) % 0.40/0.62 (define @t70 () (or @t67 @t69 @t65)) % 0.40/0.62 (define @t71 () (= @t2 @t47)) % 0.40/0.62 (define @t72 () (not @t55)) % 0.40/0.62 (define @t73 () (forall @t35 (or @t66 (not @t56)))) % 0.40/0.62 (define @t74 () (not @t73)) % 0.40/0.62 (define @t75 () (or @t72 @t74 @t72 @t71)) % 0.40/0.62 (define @t76 () (or @t74 @t72 @t71)) % 0.40/0.62 (define @t77 () (forall @t9 @t76)) % 0.40/0.62 (define @t78 () (forall @t6 @t77)) % 0.40/0.62 (define @t79 () (forall @t39 @t76)) % 0.40/0.62 (define @t80 () (and @t73 @t55)) % 0.40/0.62 (define @t81 () (forall @t35 (not @t57))) % 0.40/0.62 (define @t82 () (not @t81)) % 0.40/0.62 (define @t83 () (forall @t6 @t68)) % 0.40/0.62 (define @t84 () (@quantifiers_skolemize @t83 0)) % 0.40/0.62 (define @t85 () (tptp.member_of @t84)) % 0.40/0.62 (define @t86 () (= @t84 @t85)) % 0.40/0.62 (define @t87 () (forall @t35 (or @t66 (not (= @t13 @t84))))) % 0.40/0.62 (define @t88 () (not @t87)) % 0.40/0.62 (define @t89 () (or @t88 @t86)) % 0.40/0.62 (define @t90 () (not @t89)) % 0.40/0.62 (define @t91 () (not @t83)) % 0.40/0.62 (define @t92 () (not (= @t84 @t13))) % 0.40/0.62 (define @t93 () (or @t66 @t92)) % 0.40/0.62 (define @t94 () (forall @t35 @t93)) % 0.40/0.62 (define @t95 () (not @t94)) % 0.40/0.62 (define @t96 () (or @t95 @t86)) % 0.40/0.62 (define @t97 () (not @t96)) % 0.40/0.62 (define @t98 () (@list true)) % 0.40/0.62 (define @t99 () (@list @t89)) % 0.40/0.62 (define @t100 () (@list @t84)) % 0.40/0.62 (define @t101 () (tptp.singleton @t85)) % 0.40/0.62 (define @t102 () (= @t84 @t101)) % 0.40/0.62 (define @t103 () (or @t102 @t86)) % 0.40/0.62 (define @t104 () (@list true false)) % 0.40/0.62 (define @t105 () (tptp.member @t85 tptp.universal_class)) % 0.40/0.62 (define @t106 () (or @t105 @t86)) % 0.40/0.62 (define @t107 () (not @t102)) % 0.40/0.62 (define @t108 () (not @t105)) % 0.40/0.62 (define @t109 () (or @t108 @t107)) % 0.40/0.62 (define @t110 () (not @t109)) % 0.40/0.62 (define @t111 () (not (= @t101 @t84))) % 0.40/0.62 (define @t112 () (or @t108 @t111)) % 0.40/0.62 (assume @p1 (forall @t8 (= @t7 (forall @t6 (=> @t5 @t3))))) % 0.40/0.62 (assume @p2 (forall @t9 (tptp.subclass @t4 tptp.universal_class))) % 0.40/0.62 (assume @p3 (forall @t8 (= (= @t4 @t1) (and @t7 (tptp.subclass @t1 @t4))))) % 0.40/0.62 (assume @p4 (forall (@list @t2 @t4 @t1) (= (tptp.member @t2 @t11) (and @t10 (or (= @t2 @t4) (= @t2 @t1)))))) % 0.40/0.62 (assume @p5 (forall @t8 (tptp.member @t11 tptp.universal_class))) % 0.40/0.62 (assume @p6 (forall @t9 (= @t12 (tptp.unordered_pair @t4 @t4)))) % 0.40/0.62 (assume @p7 (forall @t8 (= @t14 (tptp.unordered_pair @t12 (tptp.unordered_pair @t4 @t13))))) % 0.40/0.62 (assume @p8 (forall (@list @t2 @t15 @t4 @t1) (= (tptp.member @t17 @t16) (and @t5 (tptp.member @t15 @t1))))) % 0.40/0.62 (assume @p9 (forall @t8 (=> (and @t19 @t18) (and (= (tptp.first @t14) @t4) (= (tptp.second @t14) @t1))))) % 0.40/0.62 (assume @p10 (forall @t21 (=> (tptp.member @t20 @t16) (= @t20 (tptp.ordered_pair (tptp.first @t20) (tptp.second @t20)))))) % 0.40/0.62 (assume @p11 (forall @t8 (= (tptp.member @t14 tptp.element_relation) (and @t18 (tptp.member @t4 @t1))))) % 0.40/0.62 (assume @p12 (tptp.subclass tptp.element_relation @t22)) % 0.40/0.62 (assume @p13 (forall @t21 (= (tptp.member @t20 (tptp.intersection @t4 @t1)) (and @t24 @t23)))) % 0.40/0.62 (assume @p14 (forall @t26 (= (tptp.member @t20 (tptp.complement @t4)) (and @t25 (not @t24))))) % 0.40/0.62 (assume @p15 (forall (@list @t4 @t27 @t1) (= (tptp.restrict @t27 @t4 @t1) (tptp.intersection @t27 @t16)))) % 0.40/0.62 (assume @p16 (forall @t9 (not (tptp.member @t4 tptp.null_class)))) % 0.40/0.62 (assume @p17 (forall @t26 (= (tptp.member @t20 (tptp.domain_of @t4)) (and @t25 (not (= (tptp.restrict @t4 (tptp.singleton @t20) tptp.universal_class) tptp.null_class)))))) % 0.40/0.62 (assume @p18 (forall (@list @t4 @t2 @t15 @t28) (= (tptp.member @t30 @t32) (and @t31 (tptp.member (tptp.ordered_pair (tptp.ordered_pair @t15 @t28) @t2) @t4))))) % 0.40/0.62 (assume @p19 (forall @t9 (tptp.subclass @t32 @t29))) % 0.40/0.62 (assume @p20 (forall (@list @t2 @t15 @t28 @t4) (= (tptp.member @t30 @t33) (and @t31 (tptp.member (tptp.ordered_pair (tptp.ordered_pair @t15 @t2) @t28) @t4))))) % 0.40/0.62 (assume @p21 (forall @t9 (tptp.subclass @t33 @t29))) % 0.40/0.62 (assume @p22 (forall @t21 (= (tptp.member @t20 (tptp.union @t4 @t1)) (or @t24 @t23)))) % 0.40/0.62 (assume @p23 (forall @t9 (= @t34 (tptp.union @t4 @t12)))) % 0.40/0.62 (assume @p24 (tptp.subclass tptp.successor_relation @t22)) % 0.40/0.62 (assume @p25 (forall @t8 (= (tptp.member @t14 tptp.successor_relation) (and @t19 @t18 (= @t34 @t1))))) % 0.40/0.62 (assume @p26 (forall @t35 (= (tptp.inverse @t1) (tptp.domain_of (tptp.flip (tptp.cross_product @t1 tptp.universal_class)))))) % 0.40/0.62 (assume @p27 (forall @t36 (= (tptp.range_of @t20) (tptp.domain_of (tptp.inverse @t20))))) % 0.40/0.62 (assume @p28 (forall (@list @t4 @t27) (= (tptp.image @t27 @t4) (tptp.range_of (tptp.restrict @t27 @t4 tptp.universal_class))))) % 0.40/0.62 (assume @p29 (forall @t9 (= @t37 (and (tptp.member tptp.null_class @t4) (tptp.subclass (tptp.image tptp.successor_relation @t4) @t4))))) % 0.40/0.62 (assume @p30 (exists @t9 (and @t19 @t37 (forall @t35 (=> (tptp.inductive @t1) @t7))))) % 0.40/0.62 (assume @p31 (forall @t39 (= (tptp.member @t2 @t38) (exists @t35 (and @t3 (tptp.member @t1 @t4)))))) % 0.40/0.62 (assume @p32 (forall @t9 (=> @t19 (tptp.member @t38 tptp.universal_class)))) % 0.40/0.62 (assume @p33 (forall @t39 (= (tptp.member @t2 (tptp.power_class @t4)) (and @t10 (tptp.subclass @t2 @t4))))) % 0.40/0.62 (assume @p34 (forall @t6 (=> @t10 (tptp.member (tptp.power_class @t2) tptp.universal_class)))) % 0.40/0.62 (assume @p35 (forall (@list @t27 @t40) (tptp.subclass @t41 @t22))) % 0.40/0.62 (assume @p36 (forall (@list @t27 @t40 @t2 @t15) (= (tptp.member @t17 @t41) (and @t10 (tptp.member @t15 (tptp.image @t40 (tptp.image @t27 (tptp.singleton @t2)))))))) % 0.40/0.62 (assume @p37 (forall @t36 (= (tptp.member @t20 tptp.identity_relation) (exists @t9 (and @t19 (= @t20 (tptp.ordered_pair @t4 @t4))))))) % 0.40/0.62 (assume @p38 (forall @t44 (= @t43 (and (tptp.subclass @t42 @t22) (tptp.subclass (tptp.compose @t42 (tptp.inverse @t42)) tptp.identity_relation))))) % 0.40/0.62 (assume @p39 (forall (@list @t4 @t42) (=> (and @t19 @t43) (tptp.member (tptp.image @t42 @t4) tptp.universal_class)))) % 0.40/0.62 (assume @p40 (forall @t8 (= (tptp.disjoint @t4 @t1) (forall @t6 (not (and @t5 @t3)))))) % 0.40/0.62 (assume @p41 (forall @t9 (=> (not (= @t4 tptp.null_class)) (exists @t6 (and @t10 @t5 (tptp.disjoint @t2 @t4)))))) % 0.40/0.62 (assume @p42 (forall (@list @t42 @t1) (= @t45 (tptp.sum_class (tptp.image @t42 @t13))))) % 0.40/0.62 (assume @p43 (exists @t44 (and @t43 (forall @t35 (=> @t18 (or (= @t1 tptp.null_class) (tptp.member @t45 @t1))))))) % 0.40/0.62 (assume @p44 (forall @t35 (=> @t18 (tptp.member @t46 tptp.universal_class)))) % 0.40/0.62 (assume @p45 (forall @t35 (=> @t18 (= (tptp.singleton @t46) @t13)))) % 0.40/0.62 (assume @p46 @t51) % 0.40/0.62 (assume @p47 @t54) % 0.40/0.62 (assume @p48 @t64) % 0.40/0.62 (assume @p49 true) % 0.40/0.62 (step @p50 :rule aci_norm :args ((= (or @t67 false @t65) @t68))) % 0.40/0.62 (step @p51 :rule refl :args (@t65)) % 0.40/0.62 (step @p52 :rule evaluate :args ((not true))) % 0.40/0.62 (step @p53 :rule eq-refl :args (@t2)) % 0.40/0.62 (step @p54 :rule cong :premises (@p53) :args (@t69)) % 0.40/0.62 (step @p55 :rule trans :premises (@p54 @p52)) % 0.40/0.62 (step @p56 :rule refl :args (@t67)) % 0.40/0.62 (step @p57 :rule nary_cong :premises (@p56 @p55 @p51) :args (@t70)) % 0.40/0.62 (step @p58 :rule trans :premises (@p57 @p50)) % 0.40/0.62 (step @p59 :rule cong :premises (@p58) :args ((forall @t6 @t70))) % 0.40/0.62 (step @p60 :rule quant-var-elim-eq :args ((= (forall @t9 @t75) @t70))) % 0.40/0.62 (step @p61 :rule aci_norm :args ((= @t76 @t75))) % 0.40/0.62 (step @p62 :rule cong :premises (@p61) :args (@t77)) % 0.40/0.62 (step @p63 :rule trans :premises (@p62 @p60)) % 0.40/0.62 (step @p64 :rule cong :premises (@p63) :args (@t78)) % 0.40/0.62 (step @p65 :rule quant-merge-prenex :args ((= @t78 @t79))) % 0.40/0.62 (step @p66 :rule symm :premises (@p65)) % 0.40/0.62 (step @p67 :rule quant_var_reordering :args ((= (forall @t62 @t76) @t79))) % 0.40/0.62 (step @p68 :rule trans :premises (@p67 @p66 @p64)) % 0.40/0.62 (step @p69 :rule trans :premises (@p68 @p59)) % 0.40/0.62 (step @p70 :rule aci_norm :args ((= (or (or @t74 @t72) @t71) @t76))) % 0.40/0.62 (step @p71 :rule refl :args (@t71)) % 0.40/0.62 (step @p72 :rule bool-and-de-morgan :args (@t73 @t55 true)) % 0.40/0.62 (step @p73 :rule nary_cong :premises (@p72 @p71) :args ((or (not @t80) @t71))) % 0.40/0.62 (step @p74 :rule trans :premises (@p73 @p70)) % 0.40/0.62 (step @p75 :rule bool-impl-elim :args (@t80 @t71)) % 0.40/0.62 (step @p76 :rule trans :premises (@p75 @p74)) % 0.40/0.62 (step @p77 :rule cong :premises (@p76) :args ((forall @t62 (=> @t80 @t71)))) % 0.40/0.62 (step @p78 :rule trans :premises (@p77 @p69)) % 0.40/0.62 (step @p79 :rule eq-symm :args (@t47 @t2)) % 0.40/0.62 (step @p80 :rule refl :args (@t55)) % 0.40/0.62 (step @p81 :rule bool-double-not-elim :args (@t73)) % 0.40/0.62 (step @p82 :rule bool-and-de-morgan :args (@t18 @t56 true)) % 0.40/0.62 (step @p83 :rule cong :premises (@p82) :args (@t81)) % 0.40/0.62 (step @p84 :rule cong :premises (@p83) :args (@t82)) % 0.40/0.62 (step @p85 :rule exists-elim :args ((= @t58 @t82))) % 0.40/0.62 (step @p86 :rule trans :premises (@p85 @p84)) % 0.40/0.62 (step @p87 :rule cong :premises (@p86) :args (@t59)) % 0.40/0.62 (step @p88 :rule trans :premises (@p87 @p81)) % 0.40/0.62 (step @p89 :rule nary_cong :premises (@p88 @p80) :args (@t60)) % 0.40/0.62 (step @p90 :rule cong :premises (@p89 @p79) :args (@t61)) % 0.40/0.62 (step @p91 :rule cong :premises (@p90) :args (@t63)) % 0.40/0.62 (step @p92 :rule trans :premises (@p91 @p78)) % 0.40/0.62 (step @p93 :rule cong :premises (@p92) :args (@t64)) % 0.40/0.62 (step @p94 :rule eq_resolve :premises (@p48 @p93)) % 0.40/0.62 (step @p95 :rule refl :args (@t90)) % 0.40/0.62 (step @p96 :rule bool-double-not-elim :args (@t83)) % 0.40/0.62 (step @p97 :rule nary_cong :premises (@p96 @p95) :args ((or (not @t91) @t90))) % 0.40/0.62 (step @p98 :rule refl :args (@t86)) % 0.40/0.62 (step @p99 :rule eq-symm :args (@t84 @t13)) % 0.40/0.62 (step @p100 :rule cong :premises (@p99) :args (@t92)) % 0.40/0.62 (step @p101 :rule refl :args (@t66)) % 0.40/0.62 (step @p102 :rule nary_cong :premises (@p101 @p100) :args (@t93)) % 0.40/0.62 (step @p103 :rule cong :premises (@p102) :args (@t94)) % 0.40/0.62 (step @p104 :rule cong :premises (@p103) :args (@t95)) % 0.40/0.62 (step @p105 :rule nary_cong :premises (@p104 @p98) :args (@t96)) % 0.40/0.62 (step @p106 :rule cong :premises (@p105) :args (@t97)) % 0.40/0.62 (step @p107 :rule refl :args (@t91)) % 0.40/0.62 (step @p108 :rule cong :premises (@p107 @p106) :args ((=> @t91 @t97))) % 0.40/0.62 (assume-push @p159 @t91) % 0.40/0.62 (step @p110 :rule skolemize :premises (@p94)) % 0.40/0.62 (step-pop @p160 :rule scope :premises (@p110)) % 0.40/0.62 (step @p111 :rule process_scope :premises (@p160) :args (@t97)) % 0.40/0.62 (step @p113 :rule eq_resolve :premises (@p111 @p108)) % 0.40/0.62 (step @p114 :rule implies_elim :premises (@p113)) % 0.40/0.62 (step @p115 :rule eq_resolve :premises (@p114 @p97)) % 0.40/0.62 (step @p116 :rule chain_m_resolution :premises (@p115 @p94) :args (@t90 @t98 (@list @t83))) % 0.40/0.62 (step @p117 :rule bool-double-not-elim :args (@t87)) % 0.40/0.62 (step @p118 :rule refl :args (@t89)) % 0.40/0.62 (step @p119 :rule nary_cong :premises (@p118 @p117) :args ((or @t89 (not @t88)))) % 0.40/0.62 (step @p120 :rule cnf_or_neg :args (@t89 0)) % 0.40/0.62 (step @p121 :rule eq_resolve :premises (@p120 @p119)) % 0.40/0.62 (step @p122 :rule reordering :premises (@p121) :args ((or @t87 @t89))) % 0.40/0.62 (step @p123 :rule chain_m_resolution :premises (@p122 @p116) :args (@t87 @t98 @t99)) % 0.40/0.62 (step @p124 :rule eq-symm :args (@t47 @t4)) % 0.40/0.62 (step @p125 :rule eq-symm :args (@t52 @t4)) % 0.40/0.62 (step @p126 :rule nary_cong :premises (@p125 @p124) :args (@t53)) % 0.40/0.62 (step @p127 :rule cong :premises (@p126) :args (@t54)) % 0.40/0.62 (step @p128 :rule eq_resolve :premises (@p47 @p127)) % 0.40/0.62 (step @p129 :rule instantiate :premises (@p128) :args (@t100)) % 0.40/0.62 (step @p130 :rule cnf_or_neg :args (@t89 1)) % 0.40/0.62 (step @p131 :rule chain_m_resolution :premises (@p130 @p116) :args ((not @t86) @t98 @t99)) % 0.40/0.62 (step @p132 :rule cnf_or_pos :args (@t103)) % 0.40/0.62 (step @p133 :rule reordering :premises (@p132) :args ((or @t86 @t102 (not @t103)))) % 0.40/0.62 (step @p134 :rule chain_m_resolution :premises (@p133 @p131 @p129) :args (@t102 @t104 (@list @t86 @t103))) % 0.40/0.62 (step @p135 :rule refl :args (@t49)) % 0.40/0.62 (step @p136 :rule nary_cong :premises (@p135 @p124) :args (@t50)) % 0.40/0.62 (step @p137 :rule cong :premises (@p136) :args (@t51)) % 0.40/0.62 (step @p138 :rule eq_resolve :premises (@p46 @p137)) % 0.40/0.62 (step @p139 :rule instantiate :premises (@p138) :args (@t100)) % 0.40/0.62 (step @p140 :rule cnf_or_pos :args (@t106)) % 0.40/0.62 (step @p141 :rule reordering :premises (@p140) :args ((or @t86 @t105 (not @t106)))) % 0.40/0.62 (step @p142 :rule chain_m_resolution :premises (@p141 @p131 @p139) :args (@t105 @t104 (@list @t86 @t106))) % 0.40/0.62 (step @p143 :rule cnf_or_pos :args (@t109)) % 0.40/0.62 (step @p144 :rule reordering :premises (@p143) :args ((or @t108 @t107 @t110))) % 0.40/0.62 (step @p145 :rule chain_m_resolution :premises (@p144 @p142 @p134) :args (@t110 (@list false false) (@list @t105 @t102))) % 0.40/0.62 (step @p146 :rule eq-symm :args (@t101 @t84)) % 0.40/0.62 (step @p147 :rule cong :premises (@p146) :args (@t111)) % 0.40/0.62 (step @p148 :rule refl :args (@t108)) % 0.40/0.62 (step @p149 :rule nary_cong :premises (@p148 @p147) :args (@t112)) % 0.40/0.62 (step @p150 :rule refl :args (@t87)) % 0.40/0.62 (step @p151 :rule cong :premises (@p150 @p149) :args ((=> @t87 @t112))) % 0.40/0.62 (assume-push @p161 @t87) % 0.40/0.62 (step @p153 :rule instantiate :premises (@p123) :args ((@list @t85))) % 0.40/0.62 (step-pop @p162 :rule scope :premises (@p153)) % 0.40/0.62 (step @p154 :rule process_scope :premises (@p162) :args (@t112)) % 0.40/0.62 (step @p156 :rule eq_resolve :premises (@p154 @p151)) % 0.40/0.62 (step @p157 :rule implies_elim :premises (@p156)) % 0.40/0.62 (step @p158 false :rule chain_m_resolution :premises (@p157 @p145 @p123) :args (false @t104 (@list @t109 @t87))) % 0.40/0.62 ) % 0.40/0.62 % SZS output end Proof % 0.40/0.62 % cvc5 exiting %------------------------------------------------------------------------------