%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU169+2 : 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 : 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:50 AM UTC 2026 % Result : Theorem 0.47s 0.65s % Output : Proof 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU169+2 : TPTP v9.2.1. Released v3.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 : n010.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 16:33:10 EDT 2026 % 0.18/0.34 % CPUTime : % 0.31/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.47/0.65 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.47/0.65 % SZS status Theorem % 0.47/0.65 % SZS output start Proof % 0.47/0.65 ( % 0.47/0.65 (declare-sort $$unsorted 0) % 0.47/0.65 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.are_equipotent (-> $$unsorted $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.union (-> $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.65 (declare-const tptp.empty_set $$unsorted) % 0.47/0.65 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.47/0.65 (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.65 (define @t1 () (@var "A" $$unsorted)) % 0.47/0.65 (define @t2 () (@var "B" $$unsorted)) % 0.47/0.65 (define @t3 () (tptp.in @t2 @t1)) % 0.47/0.65 (define @t4 () (not @t3)) % 0.47/0.65 (define @t5 () (tptp.in @t1 @t2)) % 0.47/0.65 (define @t6 () (@list @t1 @t2)) % 0.47/0.65 (define @t7 () (tptp.proper_subset @t2 @t1)) % 0.47/0.65 (define @t8 () (tptp.proper_subset @t1 @t2)) % 0.47/0.65 (define @t9 () (tptp.unordered_pair @t1 @t2)) % 0.47/0.65 (define @t10 () (tptp.set_union2 @t2 @t1)) % 0.47/0.65 (define @t11 () (tptp.set_union2 @t1 @t2)) % 0.47/0.65 (define @t12 () (tptp.set_intersection2 @t1 @t2)) % 0.47/0.65 (define @t13 () (tptp.subset @t1 @t2)) % 0.47/0.65 (define @t14 () (= @t1 @t2)) % 0.47/0.65 (define @t15 () (@var "C" $$unsorted)) % 0.47/0.65 (define @t16 () (tptp.in @t15 @t2)) % 0.47/0.65 (define @t17 () (@list @t15)) % 0.47/0.65 (define @t18 () (tptp.singleton @t1)) % 0.47/0.65 (define @t19 () (@list @t2)) % 0.47/0.65 (define @t20 () (= @t1 tptp.empty_set)) % 0.47/0.65 (define @t21 () (@list @t1)) % 0.47/0.65 (define @t22 () (tptp.powerset @t1)) % 0.47/0.65 (define @t23 () (tptp.empty @t2)) % 0.47/0.65 (define @t24 () (tptp.element @t2 @t1)) % 0.47/0.65 (define @t25 () (= @t24 @t23)) % 0.47/0.65 (define @t26 () (tptp.empty @t1)) % 0.47/0.65 (define @t27 () (=> @t26 @t25)) % 0.47/0.65 (define @t28 () (not @t26)) % 0.47/0.65 (define @t29 () (=> @t28 (= @t24 @t3))) % 0.47/0.65 (define @t30 () (and @t29 @t27)) % 0.47/0.65 (define @t31 () (forall @t6 @t30)) % 0.47/0.65 (define @t32 () (@var "D" $$unsorted)) % 0.47/0.65 (define @t33 () (tptp.in @t32 @t15)) % 0.47/0.65 (define @t34 () (@list @t32)) % 0.47/0.65 (define @t35 () (@list @t1 @t2 @t15)) % 0.47/0.65 (define @t36 () (tptp.in @t32 @t2)) % 0.47/0.65 (define @t37 () (tptp.in @t32 @t1)) % 0.47/0.65 (define @t38 () (@var "F" $$unsorted)) % 0.47/0.65 (define @t39 () (@var "E" $$unsorted)) % 0.47/0.65 (define @t40 () (tptp.in @t15 @t1)) % 0.47/0.65 (define @t41 () (tptp.set_difference @t1 @t2)) % 0.47/0.65 (define @t42 () (tptp.ordered_pair @t1 @t2)) % 0.47/0.65 (define @t43 () (tptp.disjoint @t1 @t2)) % 0.47/0.65 (define @t44 () (not @t14)) % 0.47/0.65 (define @t45 () (tptp.disjoint @t18 @t2)) % 0.47/0.65 (define @t46 () (tptp.subset @t18 @t2)) % 0.47/0.65 (define @t47 () (forall @t6 (= @t46 @t5))) % 0.47/0.65 (define @t48 () (forall @t17 (=> @t16 @t40))) % 0.47/0.65 (define @t49 () (tptp.element @t2 @t22)) % 0.47/0.65 (define @t50 () (=> @t49 @t48)) % 0.47/0.65 (define @t51 () (forall @t6 @t50)) % 0.47/0.65 (define @t52 () (not @t51)) % 0.47/0.65 (define @t53 () (tptp.singleton @t2)) % 0.47/0.65 (define @t54 () (tptp.subset @t1 (tptp.union @t2))) % 0.47/0.65 (define @t55 () (forall @t6 (=> @t5 @t54))) % 0.47/0.65 (define @t56 () (tptp.in @t1 @t15)) % 0.47/0.65 (define @t57 () (@list @t1 @t2 @t15 @t32)) % 0.47/0.65 (define @t58 () (= @t1 @t15)) % 0.47/0.65 (define @t59 () (tptp.cartesian_product2 @t1 @t15)) % 0.47/0.65 (define @t60 () (not @t16)) % 0.47/0.65 (define @t61 () (tptp.subset @t15 @t2)) % 0.47/0.65 (define @t62 () (forall @t17 (not (and @t61 (not (tptp.are_equipotent @t15 @t2)) @t60)))) % 0.47/0.65 (define @t63 () (forall (@list @t15 @t32) (=> (and @t16 (tptp.subset @t32 @t15)) @t36))) % 0.47/0.65 (define @t64 () (tptp.set_intersection2 @t2 @t15)) % 0.47/0.65 (define @t65 () (tptp.subset @t1 @t15)) % 0.47/0.65 (define @t66 () (tptp.subset @t2 @t15)) % 0.47/0.65 (define @t67 () (and @t13 @t66)) % 0.47/0.65 (define @t68 () (forall @t35 (=> @t67 @t65))) % 0.47/0.65 (define @t69 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1))) % 0.47/0.65 (define @t70 () (and @t40 @t16)) % 0.47/0.65 (define @t71 () (not @t43)) % 0.47/0.65 (define @t72 () (tptp.in @t15 @t12)) % 0.47/0.65 (define @t73 () (= @t18 (tptp.unordered_pair @t2 @t15))) % 0.47/0.65 (define @t74 () (tptp.union @t22)) % 0.47/0.65 (define @t75 () (forall @t21 (= @t74 @t1))) % 0.47/0.65 (define @t76 () (not @t66)) % 0.47/0.65 (define @t77 () (not @t13)) % 0.47/0.65 (define @t78 () (or @t77 @t76 @t65)) % 0.47/0.65 (define @t79 () (@var "BOUND_VARIABLE_8000" $$unsorted)) % 0.47/0.65 (define @t80 () (tptp.in @t79 @t1)) % 0.47/0.65 (define @t81 () (not (tptp.in @t79 @t2))) % 0.47/0.65 (define @t82 () (not @t49)) % 0.47/0.65 (define @t83 () (or @t82 @t81 @t80)) % 0.47/0.65 (define @t84 () (@list @t1 @t2 @t79)) % 0.47/0.65 (define @t85 () (forall @t84 @t83)) % 0.47/0.65 (define @t86 () (@quantifiers_skolemize @t85 0)) % 0.47/0.65 (define @t87 () (tptp.powerset @t86)) % 0.47/0.65 (define @t88 () (@quantifiers_skolemize @t85 1)) % 0.47/0.65 (define @t89 () (or @t28 @t25)) % 0.47/0.65 (define @t90 () (forall @t6 @t89)) % 0.47/0.65 (define @t91 () (@list @t1 @t2)) % 0.47/0.65 (define @t92 () (= @t3 @t24)) % 0.47/0.65 (define @t93 () (or @t26 @t92)) % 0.47/0.65 (define @t94 () (forall @t6 @t93)) % 0.47/0.65 (define @t95 () (@var "BOUND_VARIABLE_7878" $$unsorted)) % 0.47/0.65 (define @t96 () (@var "BOUND_VARIABLE_7876" $$unsorted)) % 0.47/0.65 (define @t97 () (and @t94 @t90)) % 0.47/0.65 (define @t98 () (and (=> @t28 @t92) @t27)) % 0.47/0.65 (define @t99 () (tptp.in @t88 @t87)) % 0.47/0.65 (define @t100 () (tptp.element @t88 @t87)) % 0.47/0.65 (define @t101 () (tptp.empty @t87)) % 0.47/0.65 (define @t102 () (or @t101 (= @t99 @t100))) % 0.47/0.65 (define @t103 () (forall (@list @t96 @t95) (or (tptp.empty @t96) (= (tptp.in @t95 @t96) (tptp.element @t95 @t96))))) % 0.47/0.65 (define @t104 () (= @t100 @t99)) % 0.47/0.65 (define @t105 () (or @t101 @t104)) % 0.47/0.65 (define @t106 () (@list @t86)) % 0.47/0.65 (define @t107 () (@list true false)) % 0.47/0.65 (define @t108 () (or @t81 @t80)) % 0.47/0.65 (define @t109 () (or @t82 @t108)) % 0.47/0.65 (define @t110 () (forall @t84 @t109)) % 0.47/0.65 (define @t111 () (@list @t79)) % 0.47/0.65 (define @t112 () (forall @t111 @t109)) % 0.47/0.65 (define @t113 () (forall @t111 @t108)) % 0.47/0.65 (define @t114 () (or @t82 @t113)) % 0.47/0.65 (define @t115 () (forall @t17 (or @t60 @t40))) % 0.47/0.65 (define @t116 () (@quantifiers_skolemize @t85 2)) % 0.47/0.65 (define @t117 () (tptp.in @t116 @t86)) % 0.47/0.65 (define @t118 () (tptp.in @t116 @t88)) % 0.47/0.65 (define @t119 () (not @t118)) % 0.47/0.65 (define @t120 () (not @t100)) % 0.47/0.65 (define @t121 () (or @t120 @t119 @t117)) % 0.47/0.65 (define @t122 () (@list true)) % 0.47/0.65 (define @t123 () (@list @t121)) % 0.47/0.65 (define @t124 () (@list false false)) % 0.47/0.65 (define @t125 () (tptp.union @t87)) % 0.47/0.65 (define @t126 () (tptp.subset @t88 @t125)) % 0.47/0.65 (define @t127 () (not @t99)) % 0.47/0.65 (define @t128 () (or @t127 @t126)) % 0.47/0.65 (define @t129 () (tptp.singleton @t116)) % 0.47/0.65 (define @t130 () (tptp.subset @t129 @t86)) % 0.47/0.65 (define @t131 () (= @t117 @t130)) % 0.47/0.65 (define @t132 () (not @t130)) % 0.47/0.65 (define @t133 () (tptp.subset @t129 @t125)) % 0.47/0.65 (define @t134 () (tptp.subset @t129 @t88)) % 0.47/0.65 (define @t135 () (= @t118 @t134)) % 0.47/0.65 (define @t136 () (not @t126)) % 0.47/0.65 (define @t137 () (not @t134)) % 0.47/0.65 (define @t138 () (or @t137 @t136 @t133)) % 0.47/0.65 (define @t139 () (not @t138)) % 0.47/0.65 (define @t140 () (forall @t35 @t78)) % 0.47/0.65 (assume @p1 (forall @t6 (=> @t5 @t4))) % 0.47/0.65 (assume @p2 (forall @t6 (=> @t8 (not @t7)))) % 0.47/0.65 (assume @p3 (forall @t6 (= @t9 (tptp.unordered_pair @t2 @t1)))) % 0.47/0.65 (assume @p4 (forall @t6 (= @t11 @t10))) % 0.47/0.65 (assume @p5 (forall @t6 (= @t12 (tptp.set_intersection2 @t2 @t1)))) % 0.47/0.65 (assume @p6 (forall @t6 (= @t14 (and @t13 (tptp.subset @t2 @t1))))) % 0.47/0.65 (assume @p7 (forall @t6 (= (= @t2 @t18) (forall @t17 (= @t16 (= @t15 @t1)))))) % 0.47/0.65 (assume @p8 (forall @t21 (= @t20 (forall @t19 @t4)))) % 0.47/0.65 (assume @p9 (forall @t6 (= (= @t2 @t22) (forall @t17 (= @t16 (tptp.subset @t15 @t1)))))) % 0.47/0.65 (assume @p10 @t31) % 0.47/0.65 (assume @p11 (forall @t35 (= (= @t15 @t9) (forall @t34 (= @t33 (or (= @t32 @t1) (= @t32 @t2))))))) % 0.47/0.65 (assume @p12 (forall @t35 (= (= @t15 @t11) (forall @t34 (= @t33 (or @t37 @t36)))))) % 0.47/0.65 (assume @p13 (forall @t35 (= (= @t15 (tptp.cartesian_product2 @t1 @t2)) (forall @t34 (= @t33 (exists (@list @t39 @t38) (and (tptp.in @t39 @t1) (tptp.in @t38 @t2) (= @t32 (tptp.ordered_pair @t39 @t38))))))))) % 0.47/0.65 (assume @p14 (forall @t6 (= @t13 (forall @t17 (=> @t40 @t16))))) % 0.47/0.65 (assume @p15 (forall @t35 (= (= @t15 @t12) (forall @t34 (= @t33 (and @t37 @t36)))))) % 0.47/0.65 (assume @p16 (forall @t6 (= (= @t2 (tptp.union @t1)) (forall @t17 (= @t16 (exists @t34 (and (tptp.in @t15 @t32) @t37))))))) % 0.47/0.65 (assume @p17 (forall @t35 (= (= @t15 @t41) (forall @t34 (= @t33 (and @t37 (not @t36))))))) % 0.47/0.65 (assume @p18 (forall @t6 (= @t42 (tptp.unordered_pair @t9 @t18)))) % 0.47/0.65 (assume @p19 (forall @t6 (= @t43 (= @t12 tptp.empty_set)))) % 0.47/0.65 (assume @p20 (forall @t6 (= @t8 (and @t13 @t44)))) % 0.47/0.65 (assume @p21 true) % 0.47/0.65 (assume @p22 (forall @t21 (exists @t19 @t24))) % 0.47/0.65 (assume @p23 (forall @t21 (not (tptp.empty @t22)))) % 0.47/0.65 (assume @p24 (tptp.empty tptp.empty_set)) % 0.47/0.65 (assume @p25 (forall @t6 (not (tptp.empty @t42)))) % 0.47/0.65 (assume @p26 (forall @t6 (=> @t28 (not (tptp.empty @t11))))) % 0.47/0.65 (assume @p27 (forall @t6 (=> @t28 (not (tptp.empty @t10))))) % 0.47/0.65 (assume @p28 (forall @t6 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.47/0.65 (assume @p29 (forall @t6 (= (tptp.set_intersection2 @t1 @t1) @t1))) % 0.47/0.65 (assume @p30 (forall @t6 (not (tptp.proper_subset @t1 @t1)))) % 0.47/0.65 (assume @p31 (forall @t21 (not (= @t18 tptp.empty_set)))) % 0.47/0.65 (assume @p32 (forall @t6 (=> @t5 (= (tptp.set_union2 @t18 @t2) @t2)))) % 0.47/0.65 (assume @p33 (forall @t6 (not (and @t45 @t5)))) % 0.47/0.65 (assume @p34 (forall @t6 (=> (not @t5) @t45))) % 0.47/0.65 (assume @p35 @t47) % 0.47/0.65 (assume @p36 (forall @t6 (= (= @t41 tptp.empty_set) @t13))) % 0.47/0.65 (assume @p37 @t52) % 0.47/0.65 (assume @p38 (forall @t35 (=> @t13 (or @t40 (tptp.subset @t1 (tptp.set_difference @t2 (tptp.singleton @t15))))))) % 0.47/0.65 (assume @p39 (forall @t6 (= (tptp.subset @t1 @t53) (or @t20 (= @t1 @t53))))) % 0.47/0.65 (assume @p40 @t55) % 0.47/0.65 (assume @p41 (forall @t57 (= (tptp.in @t42 (tptp.cartesian_product2 @t15 @t32)) (and @t56 (tptp.in @t2 @t32))))) % 0.47/0.65 (assume @p42 (forall @t21 (=> @t28 (exists @t19 (and @t49 (not @t23)))))) % 0.47/0.65 (assume @p43 (exists @t21 @t26)) % 0.47/0.65 (assume @p44 (exists @t21 @t28)) % 0.47/0.65 (assume @p45 (forall @t6 (tptp.subset @t1 @t1))) % 0.47/0.65 (assume @p46 (forall @t6 (=> @t43 (tptp.disjoint @t2 @t1)))) % 0.47/0.65 (assume @p47 (forall @t57 (not (and (= @t9 (tptp.unordered_pair @t15 @t32)) (not @t58) (not (= @t1 @t32)))))) % 0.47/0.65 (assume @p48 (forall @t35 (=> @t13 (and (tptp.subset @t59 (tptp.cartesian_product2 @t2 @t15)) (tptp.subset (tptp.cartesian_product2 @t15 @t1) (tptp.cartesian_product2 @t15 @t2)))))) % 0.47/0.65 (assume @p49 (forall @t57 (=> (and @t13 (tptp.subset @t15 @t32)) (tptp.subset @t59 (tptp.cartesian_product2 @t2 @t32))))) % 0.47/0.65 (assume @p50 (forall @t6 (=> @t13 (= @t11 @t2)))) % 0.47/0.65 (assume @p51 (forall @t21 (exists @t19 (and @t5 @t63 (forall @t17 (=> @t16 (tptp.in (tptp.powerset @t15) @t2))) @t62)))) % 0.47/0.65 (assume @p52 (forall @t6 (tptp.subset @t12 @t1))) % 0.47/0.65 (assume @p53 (forall @t35 (=> (and @t13 @t65) (tptp.subset @t1 @t64)))) % 0.47/0.65 (assume @p54 (forall @t21 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.47/0.65 (assume @p55 @t68) % 0.47/0.65 (assume @p56 (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set))) % 0.47/0.65 (assume @p57 (forall @t35 (=> @t13 (tptp.subset (tptp.set_intersection2 @t1 @t15) @t64)))) % 0.47/0.65 (assume @p58 (forall @t6 (=> @t13 (= @t12 @t1)))) % 0.47/0.65 (assume @p59 (forall @t21 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set))) % 0.47/0.65 (assume @p60 (forall @t6 (=> (forall @t17 (= @t40 @t16)) @t14))) % 0.47/0.65 (assume @p61 (forall @t21 (tptp.subset tptp.empty_set @t1))) % 0.47/0.65 (assume @p62 (forall @t35 (=> @t13 (tptp.subset (tptp.set_difference @t1 @t15) (tptp.set_difference @t2 @t15))))) % 0.47/0.65 (assume @p63 (forall @t57 (=> (= @t42 (tptp.ordered_pair @t15 @t32)) (and @t58 (= @t2 @t32))))) % 0.47/0.65 (assume @p64 (forall @t6 (tptp.subset @t41 @t1))) % 0.47/0.65 (assume @p65 (forall @t35 (= (tptp.subset @t9 @t15) (and @t56 (tptp.in @t2 @t15))))) % 0.47/0.65 (assume @p66 (forall @t6 (= @t69 @t11))) % 0.47/0.65 (assume @p67 (forall @t21 (= (tptp.set_difference @t1 tptp.empty_set) @t1))) % 0.47/0.65 (assume @p68 (forall @t6 (and (not (and @t71 (forall @t17 (not @t70)))) (not (and (exists @t17 @t70) @t43))))) % 0.47/0.65 (assume @p69 (forall @t21 (=> (tptp.subset @t1 tptp.empty_set) @t20))) % 0.47/0.65 (assume @p70 (forall @t6 (= (tptp.set_difference @t11 @t2) @t41))) % 0.47/0.65 (assume @p71 (forall @t6 (=> @t13 (= @t2 @t69)))) % 0.47/0.65 (assume @p72 (forall @t6 (= (tptp.set_difference @t1 @t41) @t12))) % 0.47/0.65 (assume @p73 (forall @t21 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set))) % 0.47/0.65 (assume @p74 (forall @t6 (and (not (and @t71 (forall @t17 (not @t72)))) (not (and (exists @t17 @t72) @t43))))) % 0.47/0.65 (assume @p75 (forall @t6 (not (and @t13 @t7)))) % 0.47/0.65 (assume @p76 (forall @t35 (=> (and @t13 (tptp.disjoint @t2 @t15)) (tptp.disjoint @t1 @t15)))) % 0.47/0.65 (assume @p77 (forall @t6 (= (= (tptp.set_difference @t1 @t53) @t1) @t4))) % 0.47/0.65 (assume @p78 (forall @t21 (= (tptp.unordered_pair @t1 @t1) @t18))) % 0.47/0.65 (assume @p79 (forall @t21 (=> @t26 @t20))) % 0.47/0.65 (assume @p80 (forall @t6 (=> (tptp.subset @t18 @t53) @t14))) % 0.47/0.65 (assume @p81 (forall @t6 (not (and @t5 @t23)))) % 0.47/0.65 (assume @p82 (forall @t6 (tptp.subset @t1 @t11))) % 0.47/0.65 (assume @p83 (forall @t6 (= @t43 (= @t41 @t1)))) % 0.47/0.65 (assume @p84 (forall @t6 (not (and @t26 @t44 @t23)))) % 0.47/0.65 (assume @p85 (forall @t35 (=> (and @t13 @t61) (tptp.subset (tptp.set_union2 @t1 @t15) @t2)))) % 0.47/0.65 (assume @p86 (forall @t35 (=> @t73 @t14))) % 0.47/0.65 (assume @p87 @t75) % 0.47/0.65 (assume @p88 (forall @t21 (exists @t19 (and @t5 @t63 (forall @t17 (not (and @t16 (forall @t34 (not (and @t36 (forall (@list @t39) (=> (tptp.subset @t39 @t15) (tptp.in @t39 @t32))))))))) @t62)))) % 0.47/0.65 (assume @p89 (forall @t35 (=> @t73 (= @t2 @t15)))) % 0.47/0.65 (step @p90 :rule aci_norm :args ((= (or (or @t77 @t76) @t65) @t78))) % 0.47/0.65 (step @p91 :rule refl :args (@t65)) % 0.47/0.65 (step @p92 :rule bool-and-de-morgan :args (@t13 @t66 true)) % 0.47/0.65 (step @p93 :rule nary_cong :premises (@p92 @p91) :args ((or (not @t67) @t65))) % 0.47/0.65 (step @p94 :rule trans :premises (@p93 @p90)) % 0.47/0.65 (step @p95 :rule bool-impl-elim :args (@t67 @t65)) % 0.47/0.65 (step @p96 :rule trans :premises (@p95 @p94)) % 0.47/0.65 (step @p97 :rule cong :premises (@p96) :args (@t68)) % 0.47/0.65 (step @p98 :rule eq_resolve :premises (@p55 @p97)) % 0.47/0.65 (step @p99 :rule bool-impl-elim :args (@t5 @t54)) % 0.47/0.65 (step @p100 :rule cong :premises (@p99) :args (@t55)) % 0.47/0.65 (step @p101 :rule eq_resolve :premises (@p40 @p100)) % 0.47/0.65 (step @p102 :rule instantiate :premises (@p101) :args ((@list @t88 @t87))) % 0.47/0.65 (step @p103 :rule alpha_equiv :args (@t90 @t91 (@list (@var "BOUND_VARIABLE_7887" $$unsorted) (@var "BOUND_VARIABLE_7889" $$unsorted)))) % 0.47/0.65 (step @p104 :rule alpha_equiv :args (@t94 @t91 (@list @t96 @t95))) % 0.47/0.65 (step @p105 :rule nary_cong :premises (@p104 @p103) :args (@t97)) % 0.47/0.65 (step @p106 :rule quant-miniscope-and :args ((= (forall @t6 (and @t93 @t89)) @t97))) % 0.47/0.65 (step @p107 :rule trans :premises (@p106 @p105)) % 0.47/0.65 (step @p108 :rule bool-impl-elim :args (@t26 @t25)) % 0.47/0.65 (step @p109 :rule refl :args (@t92)) % 0.47/0.65 (step @p110 :rule bool-double-not-elim :args (@t26)) % 0.47/0.65 (step @p111 :rule nary_cong :premises (@p110 @p109) :args ((or (not @t28) @t92))) % 0.47/0.65 (step @p112 :rule bool-impl-elim :args (@t28 @t92)) % 0.47/0.65 (step @p113 :rule trans :premises (@p112 @p111)) % 0.47/0.65 (step @p114 :rule nary_cong :premises (@p113 @p108) :args (@t98)) % 0.47/0.65 (step @p115 :rule cong :premises (@p114) :args ((forall @t6 @t98))) % 0.47/0.65 (step @p116 :rule trans :premises (@p115 @p107)) % 0.47/0.65 (step @p117 :rule refl :args (@t27)) % 0.47/0.65 (step @p118 :rule eq-symm :args (@t24 @t3)) % 0.47/0.65 (step @p119 :rule refl :args (@t28)) % 0.47/0.65 (step @p120 :rule cong :premises (@p119 @p118) :args (@t29)) % 0.47/0.65 (step @p121 :rule nary_cong :premises (@p120 @p117) :args (@t30)) % 0.47/0.65 (step @p122 :rule cong :premises (@p121) :args (@t31)) % 0.47/0.65 (step @p123 :rule trans :premises (@p122 @p116)) % 0.47/0.65 (step @p124 :rule eq_resolve :premises (@p10 @p123)) % 0.47/0.65 (step @p125 :rule and_elim :premises (@p124) :args (0)) % 0.47/0.65 (step @p126 :rule eq-symm :args (@t99 @t100)) % 0.47/0.65 (step @p127 :rule refl :args (@t101)) % 0.47/0.65 (step @p128 :rule nary_cong :premises (@p127 @p126) :args (@t102)) % 0.47/0.65 (step @p129 :rule refl :args (@t103)) % 0.47/0.65 (step @p130 :rule cong :premises (@p129 @p128) :args ((=> @t103 @t102))) % 0.47/0.65 (assume-push @p217 @t103) % 0.47/0.65 (step @p132 :rule instantiate :premises (@p125) :args ((@list @t87 @t88))) % 0.47/0.65 (step-pop @p218 :rule scope :premises (@p132)) % 0.47/0.65 (step @p133 :rule process_scope :premises (@p218) :args (@t102)) % 0.47/0.65 (step @p135 :rule eq_resolve :premises (@p133 @p130)) % 0.47/0.65 (step @p136 :rule implies_elim :premises (@p135)) % 0.47/0.65 (step @p137 :rule chain_m_resolution :premises (@p136 @p125) :args (@t105 (@list false) (@list @t103))) % 0.47/0.65 (step @p138 :rule instantiate :premises (@p23) :args (@t106)) % 0.47/0.65 (step @p139 :rule cnf_or_pos :args (@t105)) % 0.47/0.65 (step @p140 :rule reordering :premises (@p139) :args ((or @t101 @t104 (not @t105)))) % 0.47/0.65 (step @p141 :rule chain_m_resolution :premises (@p140 @p138 @p137) :args (@t104 @t107 (@list @t101 @t105))) % 0.47/0.65 (step @p142 :rule aci_norm :args ((= @t109 @t83))) % 0.47/0.65 (step @p143 :rule cong :premises (@p142) :args (@t110)) % 0.47/0.65 (step @p144 :rule quant-merge-prenex :args ((= (forall @t6 @t112) @t110))) % 0.47/0.65 (step @p145 :rule alpha_equiv :args (@t113 (@list @t79) (@list @t15))) % 0.47/0.65 (step @p146 :rule refl :args (@t82)) % 0.47/0.65 (step @p147 :rule nary_cong :premises (@p146 @p145) :args (@t114)) % 0.47/0.65 (step @p148 :rule quant-miniscope-or :args ((= @t112 @t114))) % 0.47/0.65 (step @p149 :rule trans :premises (@p148 @p147)) % 0.47/0.65 (step @p150 :rule symm :premises (@p149)) % 0.47/0.65 (step @p151 :rule cong :premises (@p150) :args ((forall @t6 (or @t82 @t115)))) % 0.47/0.65 (step @p152 :rule trans :premises (@p151 @p144)) % 0.47/0.65 (step @p153 :rule trans :premises (@p152 @p143)) % 0.47/0.65 (step @p154 :rule bool-impl-elim :args (@t49 @t115)) % 0.47/0.65 (step @p155 :rule cong :premises (@p154) :args ((forall @t6 (=> @t49 @t115)))) % 0.47/0.65 (step @p156 :rule trans :premises (@p155 @p153)) % 0.47/0.65 (step @p157 :rule bool-impl-elim :args (@t16 @t40)) % 0.47/0.65 (step @p158 :rule cong :premises (@p157) :args (@t48)) % 0.47/0.65 (step @p159 :rule refl :args (@t49)) % 0.47/0.65 (step @p160 :rule cong :premises (@p159 @p158) :args (@t50)) % 0.47/0.65 (step @p161 :rule cong :premises (@p160) :args (@t51)) % 0.47/0.65 (step @p162 :rule trans :premises (@p161 @p156)) % 0.47/0.65 (step @p163 :rule cong :premises (@p162) :args (@t52)) % 0.47/0.65 (step @p164 :rule eq_resolve :premises (@p37 @p163)) % 0.47/0.65 (step @p165 :rule skolemize :premises (@p164)) % 0.47/0.65 (step @p166 :rule bool-double-not-elim :args (@t100)) % 0.47/0.65 (step @p167 :rule refl :args (@t121)) % 0.47/0.65 (step @p168 :rule nary_cong :premises (@p167 @p166) :args ((or @t121 (not @t120)))) % 0.47/0.65 (step @p169 :rule cnf_or_neg :args (@t121 0)) % 0.47/0.65 (step @p170 :rule eq_resolve :premises (@p169 @p168)) % 0.47/0.65 (step @p171 :rule reordering :premises (@p170) :args ((or @t100 @t121))) % 0.47/0.65 (step @p172 :rule chain_m_resolution :premises (@p171 @p165) :args (@t100 @t122 @t123)) % 0.47/0.65 (step @p173 :rule cnf_equiv_pos1 :args (@t104)) % 0.47/0.65 (step @p174 :rule reordering :premises (@p173) :args ((or @t120 @t99 (not @t104)))) % 0.47/0.65 (step @p175 :rule chain_m_resolution :premises (@p174 @p172 @p141) :args (@t99 @t124 (@list @t100 @t104))) % 0.47/0.65 (step @p176 :rule cnf_or_pos :args (@t128)) % 0.47/0.65 (step @p177 :rule reordering :premises (@p176) :args ((or @t127 @t126 (not @t128)))) % 0.47/0.65 (step @p178 :rule chain_m_resolution :premises (@p177 @p175 @p102) :args (@t126 @t124 (@list @t99 @t128))) % 0.47/0.65 (step @p179 :rule eq-symm :args (@t46 @t5)) % 0.47/0.65 (step @p180 :rule cong :premises (@p179) :args (@t47)) % 0.47/0.65 (step @p181 :rule eq_resolve :premises (@p35 @p180)) % 0.47/0.65 (step @p182 :rule instantiate :premises (@p181) :args ((@list @t116 @t86))) % 0.47/0.65 (step @p183 :rule cnf_or_neg :args (@t121 2)) % 0.47/0.65 (step @p184 :rule chain_m_resolution :premises (@p183 @p165) :args ((not @t117) @t122 @t123)) % 0.47/0.65 (step @p185 :rule cnf_equiv_pos2 :args (@t131)) % 0.47/0.65 (step @p186 :rule reordering :premises (@p185) :args ((or @t117 @t132 (not @t131)))) % 0.47/0.65 (step @p187 :rule chain_m_resolution :premises (@p186 @p184 @p182) :args (@t132 @t107 (@list @t117 @t131))) % 0.47/0.65 (step @p188 :rule false_intro :premises (@p187)) % 0.47/0.65 (step @p189 :rule eq-symm :args (@t74 @t1)) % 0.47/0.65 (step @p190 :rule cong :premises (@p189) :args (@t75)) % 0.47/0.65 (step @p191 :rule eq_resolve :premises (@p87 @p190)) % 0.47/0.65 (step @p192 :rule instantiate :premises (@p191) :args (@t106)) % 0.47/0.65 (step @p193 :rule symm :premises (@p192)) % 0.47/0.65 (step @p194 :rule refl :args (@t129)) % 0.47/0.65 (step @p195 :rule cong :premises (@p194 @p193) :args (@t133)) % 0.47/0.65 (step @p196 :rule trans :premises (@p195 @p188)) % 0.47/0.65 (step @p197 :rule false_elim :premises (@p196)) % 0.47/0.65 (step @p198 :rule instantiate :premises (@p181) :args ((@list @t116 @t88))) % 0.47/0.65 (step @p199 :rule bool-double-not-elim :args (@t118)) % 0.47/0.65 (step @p200 :rule nary_cong :premises (@p167 @p199) :args ((or @t121 (not @t119)))) % 0.47/0.65 (step @p201 :rule cnf_or_neg :args (@t121 1)) % 0.47/0.65 (step @p202 :rule eq_resolve :premises (@p201 @p200)) % 0.47/0.65 (step @p203 :rule reordering :premises (@p202) :args ((or @t118 @t121))) % 0.47/0.65 (step @p204 :rule chain_m_resolution :premises (@p203 @p165) :args (@t118 @t122 @t123)) % 0.47/0.65 (step @p205 :rule cnf_equiv_pos1 :args (@t135)) % 0.47/0.65 (step @p206 :rule reordering :premises (@p205) :args ((or @t119 @t134 (not @t135)))) % 0.47/0.65 (step @p207 :rule chain_m_resolution :premises (@p206 @p204 @p198) :args (@t134 @t124 (@list @t118 @t135))) % 0.47/0.65 (step @p208 :rule cnf_or_pos :args (@t138)) % 0.47/0.65 (step @p209 :rule reordering :premises (@p208) :args ((or @t137 @t133 @t136 @t139))) % 0.47/0.65 (step @p210 :rule chain_m_resolution :premises (@p209 @p207 @p197 @p178) :args (@t139 (@list false true false) (@list @t134 @t133 @t126))) % 0.47/0.65 (assume-push @p219 @t140) % 0.47/0.65 (step @p212 :rule instantiate :premises (@p98) :args ((@list @t129 @t88 @t125))) % 0.47/0.65 (step-pop @p220 :rule scope :premises (@p212)) % 0.47/0.66 (step @p213 :rule process_scope :premises (@p220) :args (@t138)) % 0.47/0.66 (step @p215 :rule implies_elim :premises (@p213)) % 0.47/0.66 (step @p216 false :rule chain_m_resolution :premises (@p215 @p210 @p98) :args (false @t107 (@list @t138 @t140))) % 0.47/0.66 ) % 0.47/0.66 % SZS output end Proof % 0.47/0.66 % cvc5 exiting %------------------------------------------------------------------------------