%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET755+4 : TPTP v9.2.1. Bugfixed v2.2.1. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n005.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:48:35 AM UTC 2026 % Result : Theorem 0.36s 0.61s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET755+4 : TPTP v9.2.1. Bugfixed v2.2.1. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n005.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:10:48 EDT 2026 % 0.16/0.35 % CPUTime : % 0.27/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.61 % SZS status Theorem % 0.36/0.61 % SZS output start Proof % 0.36/0.61 ( % 0.36/0.61 (declare-sort $$unsorted 0) % 0.36/0.61 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.inverse_function (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.product (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.empty_set $$unsorted) % 0.36/0.61 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.equal_maps (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.power_set (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.one_to_one (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.equal_set (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.sum (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.image2 (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.increasing (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.surjective (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.isomorphism (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.maps (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.compose_predicate (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.identity (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.injective (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.compose_function (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.inverse_predicate (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.image3 (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.inverse_image2 (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.decreasing (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.inverse_image3 (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (define @t1 () (@var "B" $$unsorted)) % 0.36/0.61 (define @t2 () (@var "X" $$unsorted)) % 0.36/0.61 (define @t3 () (tptp.member @t2 @t1)) % 0.36/0.61 (define @t4 () (@var "A" $$unsorted)) % 0.36/0.61 (define @t5 () (tptp.member @t2 @t4)) % 0.36/0.61 (define @t6 () (@list @t2)) % 0.36/0.61 (define @t7 () (forall @t6 (=> @t5 @t3))) % 0.36/0.61 (define @t8 () (tptp.subset @t4 @t1)) % 0.36/0.61 (define @t9 () (= @t8 @t7)) % 0.36/0.61 (define @t10 () (@list @t4 @t1)) % 0.36/0.61 (define @t11 () (forall @t10 @t9)) % 0.36/0.61 (define @t12 () (@list @t2 @t4)) % 0.36/0.61 (define @t13 () (@list @t2 @t4 @t1)) % 0.36/0.61 (define @t14 () (@var "E" $$unsorted)) % 0.36/0.61 (define @t15 () (= @t2 @t4)) % 0.36/0.61 (define @t16 () (@var "Y" $$unsorted)) % 0.36/0.61 (define @t17 () (tptp.member @t2 @t16)) % 0.36/0.61 (define @t18 () (tptp.member @t16 @t4)) % 0.36/0.61 (define @t19 () (@list @t16)) % 0.36/0.61 (define @t20 () (@var "Y2" $$unsorted)) % 0.36/0.61 (define @t21 () (@var "Y1" $$unsorted)) % 0.36/0.61 (define @t22 () (= @t21 @t20)) % 0.36/0.61 (define @t23 () (@var "F" $$unsorted)) % 0.36/0.61 (define @t24 () (tptp.apply @t23 @t2 @t21)) % 0.36/0.61 (define @t25 () (tptp.member @t20 @t1)) % 0.36/0.61 (define @t26 () (tptp.member @t21 @t1)) % 0.36/0.61 (define @t27 () (and @t5 @t26 @t25)) % 0.36/0.61 (define @t28 () (@list @t2 @t21 @t20)) % 0.36/0.61 (define @t29 () (tptp.apply @t23 @t2 @t16)) % 0.36/0.61 (define @t30 () (tptp.member @t16 @t1)) % 0.36/0.61 (define @t31 () (and @t30 @t29)) % 0.36/0.61 (define @t32 () (exists @t19 @t31)) % 0.36/0.61 (define @t33 () (tptp.maps @t23 @t4 @t1)) % 0.36/0.61 (define @t34 () (@list @t23 @t4 @t1)) % 0.36/0.61 (define @t35 () (@var "Z" $$unsorted)) % 0.36/0.61 (define @t36 () (@var "G" $$unsorted)) % 0.36/0.61 (define @t37 () (exists @t19 (and @t30 @t29 (tptp.apply @t36 @t16 @t35)))) % 0.36/0.61 (define @t38 () (@var "H" $$unsorted)) % 0.36/0.61 (define @t39 () (@var "C" $$unsorted)) % 0.36/0.61 (define @t40 () (and @t5 (tptp.member @t35 @t39))) % 0.36/0.61 (define @t41 () (@var "X2" $$unsorted)) % 0.36/0.61 (define @t42 () (@var "X1" $$unsorted)) % 0.36/0.61 (define @t43 () (tptp.member @t41 @t4)) % 0.36/0.61 (define @t44 () (tptp.member @t42 @t4)) % 0.36/0.61 (define @t45 () (tptp.injective @t23 @t4 @t1)) % 0.36/0.61 (define @t46 () (tptp.surjective @t23 @t4 @t1)) % 0.36/0.61 (define @t47 () (tptp.one_to_one @t23 @t4 @t1)) % 0.36/0.61 (define @t48 () (and @t5 @t30)) % 0.36/0.61 (define @t49 () (@list @t23 @t4 @t1 @t2 @t16)) % 0.36/0.61 (define @t50 () (exists @t6 (and @t5 @t29))) % 0.36/0.61 (define @t51 () (tptp.member @t2 (tptp.inverse_image2 @t23 @t1))) % 0.36/0.61 (define @t52 () (forall (@list @t23 @t1 @t2) (= @t51 @t32))) % 0.36/0.61 (define @t53 () (@var "S" $$unsorted)) % 0.36/0.61 (define @t54 () (tptp.apply @t53 @t21 @t20)) % 0.36/0.61 (define @t55 () (tptp.apply @t23 @t41 @t20)) % 0.36/0.61 (define @t56 () (tptp.apply @t23 @t42 @t21)) % 0.36/0.61 (define @t57 () (@var "R" $$unsorted)) % 0.36/0.61 (define @t58 () (tptp.apply @t57 @t42 @t41)) % 0.36/0.61 (define @t59 () (and @t44 @t26 @t43 @t25 @t58 @t56 @t55)) % 0.36/0.61 (define @t60 () (@list @t42 @t21 @t41 @t20)) % 0.36/0.61 (define @t61 () (@list @t23 @t4 @t57 @t1 @t53)) % 0.36/0.61 (define @t62 () (tptp.subset (tptp.inverse_image2 @t23 @t2) (tptp.inverse_image2 @t23 @t16))) % 0.36/0.61 (define @t63 () (tptp.subset @t2 @t16)) % 0.36/0.61 (define @t64 () (tptp.subset @t16 @t1)) % 0.36/0.61 (define @t65 () (tptp.subset @t2 @t1)) % 0.36/0.61 (define @t66 () (and @t33 @t65 @t64 @t63)) % 0.36/0.61 (define @t67 () (forall @t49 (=> @t66 @t62))) % 0.36/0.61 (define @t68 () (not @t67)) % 0.36/0.61 (define @t69 () (forall @t19 (not @t31))) % 0.36/0.61 (define @t70 () (not @t69)) % 0.36/0.61 (define @t71 () (not @t63)) % 0.36/0.61 (define @t72 () (not @t64)) % 0.36/0.61 (define @t73 () (not @t65)) % 0.36/0.61 (define @t74 () (not @t33)) % 0.36/0.61 (define @t75 () (or @t74 @t73 @t72 @t71 @t62)) % 0.36/0.61 (define @t76 () (forall @t49 @t75)) % 0.36/0.61 (define @t77 () (@quantifiers_skolemize @t76 4)) % 0.36/0.61 (define @t78 () (@quantifiers_skolemize @t76 0)) % 0.36/0.61 (define @t79 () (tptp.inverse_image2 @t78 @t77)) % 0.36/0.61 (define @t80 () (@quantifiers_skolemize @t76 3)) % 0.36/0.61 (define @t81 () (tptp.inverse_image2 @t78 @t80)) % 0.36/0.61 (define @t82 () (forall @t6 (or (not (tptp.member @t2 @t81)) (tptp.member @t2 @t79)))) % 0.36/0.61 (define @t83 () (@quantifiers_skolemize @t82 0)) % 0.36/0.61 (define @t84 () (or @t74 @t73 @t72 @t71)) % 0.36/0.61 (define @t85 () (tptp.subset @t81 @t79)) % 0.36/0.61 (define @t86 () (tptp.subset @t80 @t77)) % 0.36/0.61 (define @t87 () (not @t86)) % 0.36/0.61 (define @t88 () (@quantifiers_skolemize @t76 2)) % 0.36/0.61 (define @t89 () (or (not (tptp.maps @t78 (@quantifiers_skolemize @t76 1) @t88)) (not (tptp.subset @t80 @t88)) (not (tptp.subset @t77 @t88)) @t87 @t85)) % 0.36/0.61 (define @t90 () (@list true)) % 0.36/0.61 (define @t91 () (@list @t89)) % 0.36/0.61 (define @t92 () (= @t85 @t82)) % 0.36/0.61 (define @t93 () (not @t82)) % 0.36/0.61 (define @t94 () (@list true false)) % 0.36/0.61 (define @t95 () (tptp.member @t83 @t81)) % 0.36/0.61 (define @t96 () (tptp.member @t83 @t79)) % 0.36/0.61 (define @t97 () (not @t95)) % 0.36/0.61 (define @t98 () (or @t97 @t96)) % 0.36/0.61 (define @t99 () (@list @t98)) % 0.36/0.61 (define @t100 () (not (tptp.apply @t78 @t83 @t16))) % 0.36/0.61 (define @t101 () (forall @t19 (or (not (tptp.member @t16 @t80)) @t100))) % 0.36/0.61 (define @t102 () (not @t101)) % 0.36/0.61 (define @t103 () (= @t95 @t102)) % 0.36/0.61 (define @t104 () (@list false false)) % 0.36/0.61 (define @t105 () (@quantifiers_skolemize @t101 0)) % 0.36/0.61 (define @t106 () (tptp.apply @t78 @t83 @t105)) % 0.36/0.61 (define @t107 () (not @t106)) % 0.36/0.61 (define @t108 () (tptp.member @t105 @t80)) % 0.36/0.61 (define @t109 () (not @t108)) % 0.36/0.61 (define @t110 () (or @t109 @t107)) % 0.36/0.61 (define @t111 () (@list @t110)) % 0.36/0.61 (define @t112 () (forall @t19 (or (not (tptp.member @t16 @t77)) @t100))) % 0.36/0.61 (define @t113 () (not @t112)) % 0.36/0.61 (define @t114 () (= @t96 @t113)) % 0.36/0.61 (define @t115 () (not @t114)) % 0.36/0.61 (define @t116 () (@list @t105)) % 0.36/0.61 (define @t117 () (forall @t6 (or (not (tptp.member @t2 @t80)) (tptp.member @t2 @t77)))) % 0.36/0.61 (define @t118 () (= @t86 @t117)) % 0.36/0.61 (define @t119 () (tptp.member @t105 @t77)) % 0.36/0.61 (define @t120 () (or @t109 @t119)) % 0.36/0.61 (define @t121 () (not @t119)) % 0.36/0.61 (define @t122 () (or @t121 @t107)) % 0.36/0.61 (assume @p1 @t11) % 0.36/0.61 (assume @p2 (forall @t10 (= (tptp.equal_set @t4 @t1) (and @t8 (tptp.subset @t1 @t4))))) % 0.36/0.61 (assume @p3 (forall @t12 (= (tptp.member @t2 (tptp.power_set @t4)) (tptp.subset @t2 @t4)))) % 0.36/0.61 (assume @p4 (forall @t13 (= (tptp.member @t2 (tptp.intersection @t4 @t1)) (and @t5 @t3)))) % 0.36/0.61 (assume @p5 (forall @t13 (= (tptp.member @t2 (tptp.union @t4 @t1)) (or @t5 @t3)))) % 0.36/0.61 (assume @p6 (forall @t6 (not (tptp.member @t2 tptp.empty_set)))) % 0.36/0.61 (assume @p7 (forall (@list @t1 @t4 @t14) (= (tptp.member @t1 (tptp.difference @t14 @t4)) (and (tptp.member @t1 @t14) (not (tptp.member @t1 @t4)))))) % 0.36/0.61 (assume @p8 (forall @t12 (= (tptp.member @t2 (tptp.singleton @t4)) @t15))) % 0.36/0.61 (assume @p9 (forall @t13 (= (tptp.member @t2 (tptp.unordered_pair @t4 @t1)) (or @t15 (= @t2 @t1))))) % 0.36/0.61 (assume @p10 (forall @t12 (= (tptp.member @t2 (tptp.sum @t4)) (exists @t19 (and @t18 @t17))))) % 0.36/0.61 (assume @p11 (forall @t12 (= (tptp.member @t2 (tptp.product @t4)) (forall @t19 (=> @t18 @t17))))) % 0.36/0.61 (assume @p12 (forall @t34 (= @t33 (and (forall @t6 (=> @t5 @t32)) (forall @t28 (=> @t27 (=> (and @t24 (tptp.apply @t23 @t2 @t20)) @t22))))))) % 0.36/0.61 (assume @p13 (forall (@list @t38 @t36 @t23 @t4 @t1 @t39) (= (tptp.compose_predicate @t38 @t36 @t23 @t4 @t1 @t39) (forall (@list @t2 @t35) (=> @t40 (= (tptp.apply @t38 @t2 @t35) @t37)))))) % 0.36/0.61 (assume @p14 (forall (@list @t36 @t23 @t4 @t1 @t39 @t2 @t35) (=> @t40 (= (tptp.apply (tptp.compose_function @t36 @t23 @t4 @t1 @t39) @t2 @t35) @t37)))) % 0.36/0.61 (assume @p15 (forall (@list @t23 @t36 @t4 @t1) (= (tptp.equal_maps @t23 @t36 @t4 @t1) (forall @t28 (=> @t27 (=> (and @t24 (tptp.apply @t36 @t2 @t20)) @t22)))))) % 0.36/0.61 (assume @p16 (forall (@list @t23 @t4) (= (tptp.identity @t23 @t4) (forall @t6 (=> @t5 (tptp.apply @t23 @t2 @t2)))))) % 0.36/0.61 (assume @p17 (forall @t34 (= @t45 (forall (@list @t42 @t41 @t16) (=> (and @t44 @t43 @t30) (=> (and (tptp.apply @t23 @t42 @t16) (tptp.apply @t23 @t41 @t16)) (= @t42 @t41))))))) % 0.36/0.61 (assume @p18 (forall @t34 (= @t46 (forall @t19 (=> @t30 (exists (@list @t14) (and (tptp.member @t14 @t4) (tptp.apply @t23 @t14 @t16)))))))) % 0.36/0.61 (assume @p19 (forall @t34 (= @t47 (and @t45 @t46)))) % 0.36/0.61 (assume @p20 (forall (@list @t36 @t23 @t4 @t1) (= (tptp.inverse_predicate @t36 @t23 @t4 @t1) (forall (@list @t2 @t16) (=> @t48 (= @t29 (tptp.apply @t36 @t16 @t2))))))) % 0.36/0.61 (assume @p21 (forall @t49 (=> @t48 (= @t29 (tptp.apply (tptp.inverse_function @t23 @t4 @t1) @t16 @t2))))) % 0.36/0.61 (assume @p22 (forall (@list @t23 @t4 @t16) (= (tptp.member @t16 (tptp.image2 @t23 @t4)) @t50))) % 0.36/0.61 (assume @p23 (forall (@list @t23 @t4 @t1 @t16) (= (tptp.member @t16 (tptp.image3 @t23 @t4 @t1)) (and @t30 @t50)))) % 0.36/0.61 (assume @p24 @t52) % 0.36/0.61 (assume @p25 (forall (@list @t23 @t1 @t4 @t2) (= (tptp.member @t2 (tptp.inverse_image3 @t23 @t1 @t4)) (and @t5 @t32)))) % 0.36/0.61 (assume @p26 (forall @t61 (= (tptp.increasing @t23 @t4 @t57 @t1 @t53) (forall @t60 (=> @t59 @t54))))) % 0.36/0.61 (assume @p27 (forall @t61 (= (tptp.decreasing @t23 @t4 @t57 @t1 @t53) (forall @t60 (=> @t59 (tptp.apply @t53 @t20 @t21)))))) % 0.36/0.61 (assume @p28 (forall @t61 (= (tptp.isomorphism @t23 @t4 @t57 @t1 @t53) (and @t33 @t47 (forall @t60 (=> (and @t44 @t26 @t43 @t25 @t56 @t55) (= @t58 @t54))))))) % 0.36/0.61 (assume @p29 @t68) % 0.36/0.61 (assume @p30 true) % 0.36/0.61 (step @p31 :rule eq-symm :args ((not (forall @t19 (or (not @t30) (not @t29)))) @t51)) % 0.36/0.61 (step @p32 :rule refl :args (@t51)) % 0.36/0.61 (step @p33 :rule bool-and-de-morgan :args (@t30 @t29 true)) % 0.36/0.61 (step @p34 :rule cong :premises (@p33) :args (@t69)) % 0.36/0.61 (step @p35 :rule cong :premises (@p34) :args (@t70)) % 0.36/0.61 (step @p36 :rule exists-elim :args ((= @t32 @t70))) % 0.36/0.61 (step @p37 :rule trans :premises (@p36 @p35)) % 0.36/0.61 (step @p38 :rule cong :premises (@p37 @p32) :args ((= @t32 @t51))) % 0.36/0.61 (step @p39 :rule trans :premises (@p38 @p31)) % 0.36/0.61 (step @p40 :rule eq-symm :args (@t51 @t32)) % 0.36/0.61 (step @p41 :rule trans :premises (@p40 @p39)) % 0.36/0.61 (step @p42 :rule cong :premises (@p41) :args (@t52)) % 0.36/0.61 (step @p43 :rule eq_resolve :premises (@p24 @p42)) % 0.36/0.61 (step @p44 :rule instantiate :premises (@p43) :args ((@list @t78 @t80 @t83))) % 0.36/0.61 (step @p45 :rule bool-impl-elim :args (@t5 @t3)) % 0.36/0.61 (step @p46 :rule cong :premises (@p45) :args (@t7)) % 0.36/0.61 (step @p47 :rule refl :args (@t8)) % 0.36/0.61 (step @p48 :rule cong :premises (@p47 @p46) :args (@t9)) % 0.36/0.61 (step @p49 :rule cong :premises (@p48) :args (@t11)) % 0.36/0.61 (step @p50 :rule eq_resolve :premises (@p1 @p49)) % 0.36/0.61 (step @p51 :rule instantiate :premises (@p50) :args ((@list @t81 @t79))) % 0.36/0.61 (step @p52 :rule aci_norm :args ((= (or @t84 @t62) @t75))) % 0.36/0.61 (step @p53 :rule refl :args (@t62)) % 0.36/0.61 (step @p54 :rule aci_norm :args ((= (or @t74 (or @t73 (or @t72 @t71))) @t84))) % 0.36/0.61 (step @p55 :rule bool-and-de-morgan :args (@t64 @t63 true)) % 0.36/0.61 (step @p56 :rule refl :args (@t73)) % 0.36/0.61 (step @p57 :rule nary_cong :premises (@p56 @p55) :args ((or @t73 (not (and @t64 @t63))))) % 0.36/0.61 (step @p58 :rule bool-and-de-morgan :args (@t65 @t64 (and @t63))) % 0.36/0.61 (step @p59 :rule trans :premises (@p58 @p57)) % 0.36/0.61 (step @p60 :rule refl :args (@t74)) % 0.36/0.61 (step @p61 :rule nary_cong :premises (@p60 @p59) :args ((or @t74 (not (and @t65 @t64 @t63))))) % 0.36/0.61 (step @p62 :rule bool-and-de-morgan :args (@t33 @t65 (and @t64 @t63))) % 0.36/0.61 (step @p63 :rule trans :premises (@p62 @p61)) % 0.36/0.61 (step @p64 :rule trans :premises (@p63 @p54)) % 0.36/0.61 (step @p65 :rule nary_cong :premises (@p64 @p53) :args ((or (not @t66) @t62))) % 0.36/0.61 (step @p66 :rule trans :premises (@p65 @p52)) % 0.36/0.61 (step @p67 :rule bool-impl-elim :args (@t66 @t62)) % 0.36/0.61 (step @p68 :rule trans :premises (@p67 @p66)) % 0.36/0.61 (step @p69 :rule cong :premises (@p68) :args (@t67)) % 0.36/0.61 (step @p70 :rule cong :premises (@p69) :args (@t68)) % 0.36/0.61 (step @p71 :rule eq_resolve :premises (@p29 @p70)) % 0.36/0.61 (step @p72 :rule skolemize :premises (@p71)) % 0.36/0.61 (step @p73 :rule cnf_or_neg :args (@t89 4)) % 0.36/0.61 (step @p74 :rule chain_m_resolution :premises (@p73 @p72) :args ((not @t85) @t90 @t91)) % 0.36/0.61 (step @p75 :rule cnf_equiv_pos2 :args (@t92)) % 0.36/0.61 (step @p76 :rule reordering :premises (@p75) :args ((or @t85 @t93 (not @t92)))) % 0.36/0.61 (step @p77 :rule chain_m_resolution :premises (@p76 @p74 @p51) :args (@t93 @t94 (@list @t85 @t92))) % 0.36/0.61 (step @p78 :rule skolemize :premises (@p77)) % 0.36/0.61 (step @p79 :rule bool-double-not-elim :args (@t95)) % 0.36/0.61 (step @p80 :rule refl :args (@t98)) % 0.36/0.61 (step @p81 :rule nary_cong :premises (@p80 @p79) :args ((or @t98 (not @t97)))) % 0.36/0.61 (step @p82 :rule cnf_or_neg :args (@t98 0)) % 0.36/0.61 (step @p83 :rule eq_resolve :premises (@p82 @p81)) % 0.36/0.61 (step @p84 :rule reordering :premises (@p83) :args ((or @t95 @t98))) % 0.36/0.61 (step @p85 :rule chain_m_resolution :premises (@p84 @p78) :args (@t95 @t90 @t99)) % 0.36/0.61 (step @p86 :rule cnf_equiv_pos1 :args (@t103)) % 0.36/0.61 (step @p87 :rule reordering :premises (@p86) :args ((or @t97 @t102 (not @t103)))) % 0.36/0.61 (step @p88 :rule chain_m_resolution :premises (@p87 @p85 @p44) :args (@t102 @t104 (@list @t95 @t103))) % 0.36/0.61 (step @p89 :rule skolemize :premises (@p88)) % 0.36/0.61 (step @p90 :rule bool-double-not-elim :args (@t106)) % 0.36/0.61 (step @p91 :rule refl :args (@t110)) % 0.36/0.61 (step @p92 :rule nary_cong :premises (@p91 @p90) :args ((or @t110 (not @t107)))) % 0.36/0.61 (step @p93 :rule cnf_or_neg :args (@t110 1)) % 0.36/0.61 (step @p94 :rule eq_resolve :premises (@p93 @p92)) % 0.36/0.61 (step @p95 :rule reordering :premises (@p94) :args ((or @t106 @t110))) % 0.36/0.61 (step @p96 :rule chain_m_resolution :premises (@p95 @p89) :args (@t106 @t90 @t111)) % 0.36/0.61 (step @p97 :rule instantiate :premises (@p43) :args ((@list @t78 @t77 @t83))) % 0.36/0.61 (step @p98 :rule cnf_or_neg :args (@t98 1)) % 0.36/0.61 (step @p99 :rule chain_m_resolution :premises (@p98 @p78) :args ((not @t96) @t90 @t99)) % 0.36/0.61 (step @p100 :rule bool-double-not-elim :args (@t112)) % 0.36/0.61 (step @p101 :rule refl :args (@t96)) % 0.36/0.61 (step @p102 :rule refl :args (@t115)) % 0.36/0.61 (step @p103 :rule nary_cong :premises (@p102 @p101 @p100) :args ((or @t115 @t96 (not @t113)))) % 0.36/0.61 (step @p104 :rule cnf_equiv_pos2 :args (@t114)) % 0.36/0.61 (step @p105 :rule eq_resolve :premises (@p104 @p103)) % 0.36/0.61 (step @p106 :rule reordering :premises (@p105) :args ((or @t96 @t112 @t115))) % 0.36/0.61 (step @p107 :rule chain_m_resolution :premises (@p106 @p99 @p97) :args (@t112 @t94 (@list @t96 @t114))) % 0.36/0.61 (step @p108 :rule instantiate :premises (@p107) :args (@t116)) % 0.36/0.61 (step @p109 :rule instantiate :premises (@p50) :args ((@list @t80 @t77))) % 0.36/0.61 (step @p110 :rule bool-double-not-elim :args (@t86)) % 0.36/0.61 (step @p111 :rule refl :args (@t89)) % 0.36/0.61 (step @p112 :rule nary_cong :premises (@p111 @p110) :args ((or @t89 (not @t87)))) % 0.36/0.61 (step @p113 :rule cnf_or_neg :args (@t89 3)) % 0.36/0.61 (step @p114 :rule eq_resolve :premises (@p113 @p112)) % 0.36/0.61 (step @p115 :rule reordering :premises (@p114) :args ((or @t86 @t89))) % 0.36/0.61 (step @p116 :rule chain_m_resolution :premises (@p115 @p72) :args (@t86 @t90 @t91)) % 0.36/0.61 (step @p117 :rule cnf_equiv_pos1 :args (@t118)) % 0.36/0.61 (step @p118 :rule reordering :premises (@p117) :args ((or @t87 @t117 (not @t118)))) % 0.36/0.61 (step @p119 :rule chain_m_resolution :premises (@p118 @p116 @p109) :args (@t117 @t104 (@list @t86 @t118))) % 0.36/0.61 (step @p120 :rule instantiate :premises (@p119) :args (@t116)) % 0.36/0.61 (step @p121 :rule bool-double-not-elim :args (@t108)) % 0.36/0.61 (step @p122 :rule nary_cong :premises (@p91 @p121) :args ((or @t110 (not @t109)))) % 0.36/0.61 (step @p123 :rule cnf_or_neg :args (@t110 0)) % 0.36/0.61 (step @p124 :rule eq_resolve :premises (@p123 @p122)) % 0.36/0.61 (step @p125 :rule reordering :premises (@p124) :args ((or @t108 @t110))) % 0.36/0.61 (step @p126 :rule chain_m_resolution :premises (@p125 @p89) :args (@t108 @t90 @t111)) % 0.36/0.61 (step @p127 :rule cnf_or_pos :args (@t120)) % 0.36/0.61 (step @p128 :rule reordering :premises (@p127) :args ((or @t109 @t119 (not @t120)))) % 0.36/0.61 (step @p129 :rule chain_m_resolution :premises (@p128 @p126 @p120) :args (@t119 @t104 (@list @t108 @t120))) % 0.36/0.61 (step @p130 :rule cnf_or_pos :args (@t122)) % 0.36/0.61 (step @p131 :rule reordering :premises (@p130) :args ((or @t107 @t121 (not @t122)))) % 0.36/0.61 (step @p132 false :rule chain_m_resolution :premises (@p131 @p129 @p108 @p96) :args (false (@list false false false) (@list @t119 @t122 @t106))) % 0.36/0.61 ) % 0.36/0.61 % SZS output end Proof % 0.36/0.61 % cvc5 exiting %------------------------------------------------------------------------------