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