%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU624^1 : TPTP v9.2.1. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n014.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:52:28 AM UTC 2026 % Result : Theorem 0.40s 0.66s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU624^1 : TPTP v9.2.1. Released v3.7.0. % 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 : n014.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 17:43:43 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.54 %----Proving TH0 % 0.40/0.66 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.40/0.66 % SZS status Theorem % 0.40/0.66 % SZS output start Proof % 0.40/0.66 ( % 0.40/0.66 (declare-sort $$unsorted 0) % 0.40/0.66 (declare-const tptp.emptyset $$unsorted) % 0.40/0.66 (declare-const tptp.setadjoin (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.66 (declare-const tptp.setunion (-> $$unsorted $$unsorted)) % 0.40/0.66 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.40/0.66 (declare-const tptp.binunion (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.66 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.40/0.66 (declare-const tptp.dsetconstr (-> $$unsorted (-> $$unsorted Bool) $$unsorted)) % 0.40/0.66 (declare-const tptp.singletoninpowunion Bool) % 0.40/0.66 (declare-const tptp.singletoninpowerset Bool) % 0.40/0.66 (declare-const tptp.singletonsubset Bool) % 0.40/0.66 (declare-const tptp.kpairp Bool) % 0.40/0.66 (declare-const tptp.secondinupair Bool) % 0.40/0.66 (declare-const tptp.symdiffIneg2 Bool) % 0.40/0.66 (declare-const tptp.symdiffI2 Bool) % 0.40/0.66 (declare-const tptp.symdiffI1 Bool) % 0.40/0.66 (declare-const tptp.setminusIRneg Bool) % 0.40/0.66 (declare-const tptp.setminusILneg Bool) % 0.40/0.66 (declare-const tptp.setminusERneg Bool) % 0.40/0.66 (declare-const tptp.quantDeMorgan1 Bool) % 0.40/0.66 (declare-const tptp.sepSubset Bool) % 0.40/0.66 (declare-const tptp.emptyE1 Bool) % 0.40/0.66 (declare-const tptp.inPowerset Bool) % 0.40/0.66 (declare-const tptp.upairsetIR Bool) % 0.40/0.66 (declare-const tptp.setunion__Cong Bool) % 0.40/0.66 (declare-const tptp.powersetE1 Bool) % 0.40/0.66 (declare-const tptp.singletonsswitch Bool) % 0.40/0.66 (declare-const tptp.subset2powerset Bool) % 0.40/0.66 (declare-const tptp.notinsingleton Bool) % 0.40/0.66 (declare-const tptp.subPowSU Bool) % 0.40/0.66 (declare-const tptp.binintersectSubset5 Bool) % 0.40/0.66 (declare-const tptp.exuE1 Bool) % 0.40/0.66 (declare-const tptp.binintersect (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.66 (declare-const tptp.setunionI Bool) % 0.40/0.66 (declare-const tptp.notdexE Bool) % 0.40/0.66 (declare-const tptp.powersetE Bool) % 0.40/0.66 (declare-const tptp.omegaSAx Bool) % 0.40/0.66 (declare-const tptp.setadjoinE Bool) % 0.40/0.66 (declare-const tptp.emptyinunitempty Bool) % 0.40/0.66 (declare-const tptp.setminusEL Bool) % 0.40/0.66 (declare-const tptp.descr__Cong Bool) % 0.40/0.66 (declare-const tptp.nonemptyI1 Bool) % 0.40/0.66 (declare-const tptp.emptysetAx Bool) % 0.40/0.66 (declare-const tptp.nonemptyI Bool) % 0.40/0.66 (declare-const tptp.upairsetIL Bool) % 0.40/0.66 (declare-const tptp.powersetI1 Bool) % 0.40/0.66 (declare-const tptp.eqinunit Bool) % 0.40/0.66 (declare-const tptp.upairsetE Bool) % 0.40/0.66 (declare-const tptp.replAx Bool) % 0.40/0.66 (declare-const tptp.powersetI Bool) % 0.40/0.66 (declare-const tptp.setukpairIR Bool) % 0.40/0.66 (declare-const tptp.quantDeMorgan4 Bool) % 0.40/0.66 (declare-const tptp.setunionE Bool) % 0.40/0.66 (declare-const tptp.omegaIndAx Bool) % 0.40/0.66 (declare-const tptp.setunionAx Bool) % 0.40/0.66 (declare-const tptp.setoftrueEq Bool) % 0.40/0.66 (declare-const tptp.foundationAx Bool) % 0.40/0.66 (declare-const tptp.emptysetimpfalse Bool) % 0.40/0.66 (declare-const tptp.setminusELneg Bool) % 0.40/0.66 (declare-const tptp.powersetAx Bool) % 0.40/0.66 (declare-const tptp.subsetemptysetimpeq Bool) % 0.40/0.66 (declare-const tptp.setminusER Bool) % 0.40/0.66 (declare-const tptp.setadjoinAx Bool) % 0.40/0.66 (declare-const tptp.symdiff (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.66 (declare-const tptp.omega $$unsorted) % 0.40/0.66 (declare-const tptp.emptyInPowerset Bool) % 0.40/0.66 (declare-const tptp.eqimpsubset1 Bool) % 0.40/0.66 (declare-const tptp.binunionE Bool) % 0.40/0.66 (declare-const tptp.dsetconstrER Bool) % 0.40/0.66 (declare-const tptp.notdallE Bool) % 0.40/0.66 (declare-const tptp.binunionRsub Bool) % 0.40/0.66 (declare-const tptp.exuE2 Bool) % 0.40/0.66 (declare-const tptp.setminusSubset2 Bool) % 0.40/0.66 (declare-const tptp.dsetconstr__Cong Bool) % 0.40/0.66 (declare-const tptp.setadjoinIR Bool) % 0.40/0.66 (declare-const tptp.notinemptyset Bool) % 0.40/0.66 (declare-const tptp.subsetRefl Bool) % 0.40/0.66 (declare-const tptp.uniqinunit Bool) % 0.40/0.66 (declare-const tptp.exuE3u Bool) % 0.40/0.66 (declare-const tptp.subsetTrans Bool) % 0.40/0.66 (declare-const tptp.wellorderingAx Bool) % 0.40/0.66 (declare-const tptp.setukpairIL Bool) % 0.40/0.66 (declare-const tptp.descr (-> (-> $$unsorted Bool) $$unsorted)) % 0.40/0.66 (declare-const tptp.vacuousDall Bool) % 0.40/0.66 (declare-const tptp.sepInPowerset Bool) % 0.40/0.66 (declare-const tptp.nonemptyImpWitness Bool) % 0.40/0.66 (declare-const tptp.binintersectLsub Bool) % 0.40/0.66 (declare-const tptp.setadjoinOr Bool) % 0.40/0.66 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.66 (declare-const tptp.upairset2IR Bool) % 0.40/0.66 (declare-const tptp.dsetconstrI Bool) % 0.40/0.66 (declare-const tptp.setminusSubset1 Bool) % 0.40/0.66 (declare-const tptp.emptyinPowerset Bool) % 0.40/0.66 (declare-const tptp.kpairiskpair Bool) % 0.40/0.66 (declare-const tptp.prop2setI Bool) % 0.40/0.66 (declare-const tptp.dsetconstrEL Bool) % 0.40/0.66 (declare-const tptp.prop2set2propI Bool) % 0.40/0.66 (declare-const tptp.binunionLsub Bool) % 0.40/0.66 (declare-const tptp.prop2set (-> Bool $$unsorted)) % 0.40/0.66 (declare-const tptp.exuI2 Bool) % 0.40/0.66 (declare-const tptp.prop2setE Bool) % 0.40/0.66 (declare-const tptp.exuEu Bool) % 0.40/0.66 (declare-const tptp.setadjoinIL Bool) % 0.40/0.66 (declare-const tptp.omega__Cong Bool) % 0.40/0.66 (declare-const tptp.setminusI Bool) % 0.40/0.66 (declare-const tptp.emptysetE Bool) % 0.40/0.66 (declare-const tptp.symdiffIneg1 Bool) % 0.40/0.66 (declare-const tptp.notequalI1 Bool) % 0.40/0.66 (declare-const tptp.emptyI Bool) % 0.40/0.66 (declare-const tptp.quantDeMorgan2 Bool) % 0.40/0.66 (declare-const tptp.noeltsimpempty Bool) % 0.40/0.66 (declare-const tptp.subsetI1 Bool) % 0.40/0.66 (declare-const tptp.set2prop (-> $$unsorted Bool)) % 0.40/0.66 (declare-const tptp.subsetE Bool) % 0.40/0.66 (declare-const tptp.exuI3 Bool) % 0.40/0.66 (declare-const tptp.subsetE2 Bool) % 0.40/0.66 (declare-const tptp.inCongP Bool) % 0.40/0.66 (declare-const tptp.in__Cong Bool) % 0.40/0.66 (declare-const tptp.exu__Cong Bool) % 0.40/0.66 (declare-const tptp.exuE3e Bool) % 0.40/0.66 (declare-const tptp.binintersectSubset3 Bool) % 0.40/0.66 (declare-const tptp.setadjoin__Cong Bool) % 0.40/0.66 (declare-const tptp.emptyset__Cong Bool) % 0.40/0.66 (declare-const tptp.binintersectRsub Bool) % 0.40/0.66 (declare-const tptp.nonemptyE1 Bool) % 0.40/0.66 (declare-const tptp.setextAx Bool) % 0.40/0.66 (declare-const tptp.powerset__Cong Bool) % 0.40/0.66 (declare-const tptp.bs114d Bool) % 0.40/0.66 (declare-const tptp.setminusLsub Bool) % 0.40/0.66 (declare-const tptp.eqimpsubset2 Bool) % 0.40/0.66 (declare-const tptp.symdiffE Bool) % 0.40/0.66 (declare-const tptp.omega0Ax Bool) % 0.40/0.66 (declare-const tptp.subsetI2 Bool) % 0.40/0.66 (declare-const tptp.emptysetsubset Bool) % 0.40/0.66 (declare-const tptp.notsubsetI Bool) % 0.40/0.66 (declare-const tptp.notequalI2 Bool) % 0.40/0.66 (declare-const tptp.setadjoinSub Bool) % 0.40/0.66 (declare-const tptp.setadjoinSub2 Bool) % 0.40/0.66 (declare-const tptp.disjointsetsI1 Bool) % 0.40/0.66 (declare-const tptp.setextsub Bool) % 0.40/0.66 (declare-const tptp.setbeta Bool) % 0.40/0.66 (declare-const tptp.binintersectSubset4 Bool) % 0.40/0.66 (declare-const tptp.powersetsubset Bool) % 0.40/0.66 (declare-const tptp.binunionIL Bool) % 0.40/0.66 (declare-const tptp.binunionIR Bool) % 0.40/0.66 (declare-const tptp.descrp Bool) % 0.40/0.66 (declare-const tptp.quantDeMorgan3 Bool) % 0.40/0.66 (declare-const tptp.binunionEcases Bool) % 0.40/0.66 (declare-const tptp.exuI1 Bool) % 0.40/0.66 (declare-const tptp.binintersectI Bool) % 0.40/0.66 (declare-const tptp.binintersectEL Bool) % 0.40/0.66 (declare-const tptp.binintersectSubset2 Bool) % 0.40/0.66 (declare-const tptp.setext Bool) % 0.40/0.66 (declare-const tptp.binintersectER Bool) % 0.40/0.66 (declare-const tptp.binintersectSubset1 Bool) % 0.40/0.66 (declare-const tptp.setminus (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.66 (define tptp.exu () (let ((_let_1 (@var "Xy" $$unsorted))) (let ((_let_2 (@var "Xx" $$unsorted))) (let ((_let_3 (@var "Xphi" (-> $$unsorted Bool)))) (lambda (@list _let_3) (exists (@list _let_2) (and (_ _let_3 _let_2) (forall (@list _let_1) (=> (_ _let_3 _let_1) (= _let_2 _let_1)))))))))) % 0.40/0.66 (define tptp.nonempty () (let ((_let_1 (@var "Xx" $$unsorted))) (lambda (@list _let_1) (not (= _let_1 tptp.emptyset))))) % 0.40/0.66 (define tptp.iskpair () (let ((_let_1 (@var "Xy" $$unsorted))) (let ((_let_2 (@var "Xx" $$unsorted))) (let ((_let_3 (_ tptp.setadjoin _let_2))) (let ((_let_4 (@var "A" $$unsorted))) (let ((_let_5 (_ tptp.setunion _let_4))) (lambda (@list _let_4) (exists (@list _let_2) (and (_ (_ tptp.in _let_2) _let_5) (exists (@list _let_1) (and (_ (_ tptp.in _let_1) _let_5) (= _let_4 (_ (_ tptp.setadjoin (_ _let_3 tptp.emptyset)) (_ (_ tptp.setadjoin (_ _let_3 (_ (_ tptp.setadjoin _let_1) tptp.emptyset))) tptp.emptyset)))))))))))))) % 0.40/0.66 (define tptp.kpair () (let ((_let_1 (@var "Xy" $$unsorted))) (let ((_let_2 (@var "Xx" $$unsorted))) (let ((_let_3 (_ tptp.setadjoin _let_2))) (lambda (@list _let_2 _let_1) (_ (_ tptp.setadjoin (_ _let_3 tptp.emptyset)) (_ (_ tptp.setadjoin (_ _let_3 (_ (_ tptp.setadjoin _let_1) tptp.emptyset))) tptp.emptyset))))))) % 0.40/0.66 (define tptp.cartprod () (let ((_let_1 (@var "Xz" $$unsorted))) (let ((_let_2 (@var "Xy" $$unsorted))) (let ((_let_3 (@var "Xx" $$unsorted))) (let ((_let_4 (@var "B" $$unsorted))) (let ((_let_5 (@var "A" $$unsorted))) (lambda (@list _let_5 _let_4) (_ (_ tptp.dsetconstr (_ tptp.powerset (_ tptp.powerset (_ (_ tptp.binunion _let_5) _let_4)))) (lambda (@list _let_3) (exists (@list _let_2) (and (_ (_ tptp.in _let_2) _let_5) (exists (@list _let_1) (and (_ (_ tptp.in _let_1) _let_4) (= _let_3 (_ (_ tptp.kpair _let_2) _let_1))))))))))))))) % 0.40/0.66 (define @t1 () (@var "B" $$unsorted)) % 0.40/0.66 (define @t2 () (@var "A" $$unsorted)) % 0.40/0.66 (define @t3 () (= @t2 @t1)) % 0.40/0.66 (define @t4 () (@var "Xx" $$unsorted)) % 0.40/0.66 (define @t5 () (_ tptp.in @t4)) % 0.40/0.66 (define @t6 () (_ @t5 @t1)) % 0.40/0.66 (define @t7 () (_ @t5 @t2)) % 0.40/0.66 (define @t8 () (@list @t4)) % 0.40/0.66 (define @t9 () (@list @t2 @t1)) % 0.40/0.66 (define @t10 () (_ @t5 tptp.emptyset)) % 0.40/0.66 (define @t11 () (forall @t8 (not @t10))) % 0.40/0.66 (define @t12 () (@var "Xy" $$unsorted)) % 0.40/0.66 (define @t13 () (_ tptp.in @t12)) % 0.40/0.66 (define @t14 () (_ @t13 @t2)) % 0.40/0.66 (define @t15 () (= @t12 @t4)) % 0.40/0.66 (define @t16 () (or @t15 @t14)) % 0.40/0.66 (define @t17 () (_ tptp.setadjoin @t4)) % 0.40/0.66 (define @t18 () (_ @t17 @t2)) % 0.40/0.66 (define @t19 () (_ @t13 @t18)) % 0.40/0.66 (define @t20 () (@list @t4 @t2 @t12)) % 0.40/0.66 (define @t21 () (=> @t6 @t7)) % 0.40/0.66 (define @t22 () (forall @t8 @t21)) % 0.40/0.66 (define @t23 () (_ tptp.powerset @t2)) % 0.40/0.66 (define @t24 () (_ tptp.in @t1)) % 0.40/0.66 (define @t25 () (_ @t24 @t23)) % 0.40/0.66 (define @t26 () (_ @t24 @t2)) % 0.40/0.66 (define @t27 () (@list @t1)) % 0.40/0.66 (define @t28 () (_ tptp.setunion @t2)) % 0.40/0.66 (define @t29 () (_ @t5 @t28)) % 0.40/0.66 (define @t30 () (@list @t2 @t4)) % 0.40/0.66 (define @t31 () (_ tptp.in tptp.emptyset)) % 0.40/0.66 (define @t32 () (_ tptp.in (_ @t17 @t4))) % 0.40/0.66 (define @t33 () (_ @t5 tptp.omega)) % 0.40/0.66 (define @t34 () (@list @t2)) % 0.40/0.66 (define @t35 () (@var "Xphi" (-> $$unsorted $$unsorted Bool))) % 0.40/0.66 (define @t36 () (@list @t12)) % 0.40/0.66 (define @t37 () (exists @t8 @t7)) % 0.40/0.66 (define @t38 () (@var "E" $$unsorted)) % 0.40/0.66 (define @t39 () (@var "D" $$unsorted)) % 0.40/0.66 (define @t40 () (_ @t13 @t39)) % 0.40/0.66 (define @t41 () (@var "C" $$unsorted)) % 0.40/0.66 (define @t42 () (_ @t13 @t41)) % 0.40/0.66 (define @t43 () (_ @t5 @t41)) % 0.40/0.66 (define @t44 () (_ (_ tptp.in @t39) @t1)) % 0.40/0.66 (define @t45 () (forall @t8 (=> @t43 @t7))) % 0.40/0.66 (define @t46 () (@list @t41)) % 0.40/0.66 (define @t47 () (_ @t5 @t39)) % 0.40/0.66 (define @t48 () (_ (_ tptp.in @t41) @t1)) % 0.40/0.66 (define @t49 () (= @t4 @t12)) % 0.40/0.66 (define @t50 () (@list @t4 @t12)) % 0.40/0.66 (define @t51 () (@var "Xphi" (-> $$unsorted Bool))) % 0.40/0.66 (define @t52 () (_ @t51 @t4)) % 0.40/0.66 (define @t53 () (lambda @t8 @t52)) % 0.40/0.66 (define @t54 () (_ tptp.descr @t53)) % 0.40/0.66 (define @t55 () (_ tptp.exu @t53)) % 0.40/0.66 (define @t56 () (@list @t51)) % 0.40/0.66 (define @t57 () (_ @t51 @t12)) % 0.40/0.66 (define @t58 () (_ tptp.dsetconstr @t2)) % 0.40/0.66 (define @t59 () (_ @t58 (lambda @t36 @t57))) % 0.40/0.66 (define @t60 () (_ @t5 @t59)) % 0.40/0.66 (define @t61 () (@list @t2 @t51 @t4)) % 0.40/0.66 (define @t62 () (=> @t57 @t49)) % 0.40/0.66 (define @t63 () (exists @t8 (and @t52 (forall @t36 @t62)))) % 0.40/0.66 (define @t64 () (@var "Xphi" Bool)) % 0.40/0.66 (define @t65 () (_ tptp.prop2set @t64)) % 0.40/0.66 (define @t66 () (@list @t64)) % 0.40/0.66 (define @t67 () (exists @t8 @t52)) % 0.40/0.66 (define @t68 () (=> @t7 @t6)) % 0.40/0.66 (define @t69 () (forall @t8 @t68)) % 0.40/0.66 (define @t70 () (= @t2 tptp.emptyset)) % 0.40/0.66 (define @t71 () (not @t7)) % 0.40/0.66 (define @t72 () (forall @t34 (=> (forall @t8 @t71) @t70))) % 0.40/0.66 (define @t73 () (_ tptp.nonempty @t2)) % 0.40/0.66 (define @t74 () (forall @t34 (_ @t31 @t23))) % 0.40/0.66 (define @t75 () (@list @t2 @t1 @t4)) % 0.40/0.66 (define @t76 () (@list @t2 @t4 @t1)) % 0.40/0.66 (define @t77 () (exists @t8 (forall @t36 (= @t57 @t15)))) % 0.40/0.66 (define @t78 () (_ tptp.setadjoin @t12)) % 0.40/0.66 (define @t79 () (_ @t78 tptp.emptyset)) % 0.40/0.66 (define @t80 () (_ @t5 @t79)) % 0.40/0.66 (define @t81 () (_ @t17 tptp.emptyset)) % 0.40/0.66 (define @t82 () (_ @t13 @t81)) % 0.40/0.66 (define @t83 () (@var "Xz" $$unsorted)) % 0.40/0.66 (define @t84 () (or (= @t83 @t4) (= @t83 @t12))) % 0.40/0.66 (define @t85 () (_ @t17 @t79)) % 0.40/0.66 (define @t86 () (_ tptp.in @t83)) % 0.40/0.66 (define @t87 () (_ @t86 @t85)) % 0.40/0.66 (define @t88 () (=> @t87 @t84)) % 0.40/0.66 (define @t89 () (@list @t4 @t12 @t83)) % 0.40/0.66 (define @t90 () (forall @t89 @t88)) % 0.40/0.66 (define @t91 () (= tptp.upairsetE @t90)) % 0.40/0.66 (define @t92 () (forall @t50 (_ @t13 @t85))) % 0.40/0.66 (define @t93 () (_ @t58 @t53)) % 0.40/0.66 (define @t94 () (exists @t8 (and @t7 @t52))) % 0.40/0.66 (define @t95 () (@list @t2 @t51)) % 0.40/0.66 (define @t96 () (not @t52)) % 0.40/0.66 (define @t97 () (exists @t8 (and @t7 @t96))) % 0.40/0.66 (define @t98 () (not (forall @t8 (=> @t7 @t52)))) % 0.40/0.66 (define @t99 () (forall @t95 (=> @t98 @t97))) % 0.40/0.66 (define @t100 () (not @t94)) % 0.40/0.66 (define @t101 () (forall @t8 (=> @t7 @t96))) % 0.40/0.66 (define @t102 () (forall @t95 (=> @t100 @t101))) % 0.40/0.66 (define @t103 () (forall @t50 (=> @t52 @t62))) % 0.40/0.66 (define @t104 () (_ @t13 @t1)) % 0.40/0.66 (define @t105 () (forall @t56 (=> @t55 @t103))) % 0.40/0.66 (define @t106 () (@var "Xpsi" (-> $$unsorted Bool))) % 0.40/0.66 (define @t107 () (lambda @t8 (_ @t106 @t4))) % 0.40/0.66 (define @t108 () (_ tptp.exu @t107)) % 0.40/0.66 (define @t109 () (=> @t49 (= @t52 (_ @t106 @t12)))) % 0.40/0.66 (define @t110 () (forall @t50 @t109)) % 0.40/0.66 (define @t111 () (@list @t51 @t106)) % 0.40/0.66 (define @t112 () (@var "Xu" $$unsorted)) % 0.40/0.66 (define @t113 () (_ tptp.powerset @t1)) % 0.40/0.66 (define @t114 () (_ tptp.subset @t2)) % 0.40/0.66 (define @t115 () (_ @t114 @t1)) % 0.40/0.66 (define @t116 () (forall @t9 (=> @t69 @t115))) % 0.40/0.66 (define @t117 () (_ tptp.subset @t1)) % 0.40/0.66 (define @t118 () (_ @t117 @t2)) % 0.40/0.66 (define @t119 () (not @t6)) % 0.40/0.66 (define @t120 () (=> @t119 @t71)) % 0.40/0.66 (define @t121 () (not @t115)) % 0.40/0.66 (define @t122 () (not @t3)) % 0.40/0.66 (define @t123 () (@list @t2 @t1 @t41)) % 0.40/0.66 (define @t124 () (_ tptp.in @t2)) % 0.40/0.66 (define @t125 () (_ (_ tptp.binunion @t2) @t1)) % 0.40/0.66 (define @t126 () (_ @t5 @t125)) % 0.40/0.66 (define @t127 () (=> @t6 @t64)) % 0.40/0.66 (define @t128 () (_ tptp.binintersect @t2)) % 0.40/0.66 (define @t129 () (_ @t128 @t1)) % 0.40/0.66 (define @t130 () (_ @t5 @t129)) % 0.40/0.66 (define @t131 () (_ tptp.subset @t41)) % 0.40/0.66 (define @t132 () (_ tptp.subset @t129)) % 0.40/0.66 (define @t133 () (= @t129 @t2)) % 0.40/0.66 (define @t134 () (= @t129 @t1)) % 0.40/0.66 (define @t135 () (_ (_ tptp.setminus @t2) @t1)) % 0.40/0.66 (define @t136 () (_ @t5 @t135)) % 0.40/0.66 (define @t137 () (= @t135 tptp.emptyset)) % 0.40/0.66 (define @t138 () (not @t136)) % 0.40/0.66 (define @t139 () (_ @t5 (_ (_ tptp.symdiff @t2) @t1))) % 0.40/0.66 (define @t140 () (not @t139)) % 0.40/0.66 (define @t141 () (_ (_ tptp.setadjoin @t81) (_ (_ tptp.setadjoin @t85) tptp.emptyset))) % 0.40/0.66 (define @t142 () (_ tptp.setunion @t141)) % 0.40/0.66 (define @t143 () (_ tptp.in @t81)) % 0.40/0.66 (define @t144 () (_ tptp.powerset @t125)) % 0.40/0.66 (define @t145 () (=> tptp.singletoninpowunion @t90)) % 0.40/0.66 (define @t146 () (=> tptp.singletoninpowerset @t145)) % 0.40/0.66 (define @t147 () (=> tptp.singletonsubset @t146)) % 0.40/0.66 (define @t148 () (=> tptp.kpairp @t147)) % 0.40/0.66 (define @t149 () (=> tptp.kpairiskpair @t148)) % 0.40/0.66 (define @t150 () (=> tptp.setukpairIR @t149)) % 0.40/0.66 (define @t151 () (=> tptp.setukpairIL @t150)) % 0.40/0.66 (define @t152 () (=> tptp.secondinupair @t151)) % 0.40/0.66 (define @t153 () (=> tptp.symdiffIneg2 @t152)) % 0.40/0.66 (define @t154 () (=> tptp.symdiffIneg1 @t153)) % 0.40/0.66 (define @t155 () (=> tptp.symdiffI2 @t154)) % 0.40/0.66 (define @t156 () (=> tptp.symdiffI1 @t155)) % 0.40/0.66 (define @t157 () (=> tptp.symdiffE @t156)) % 0.40/0.66 (define @t158 () (=> tptp.setminusSubset1 @t157)) % 0.40/0.66 (define @t159 () (=> tptp.setminusLsub @t158)) % 0.40/0.66 (define @t160 () (=> tptp.setminusIRneg @t159)) % 0.40/0.66 (define @t161 () (=> tptp.setminusILneg @t160)) % 0.40/0.66 (define @t162 () (=> tptp.setminusELneg @t161)) % 0.40/0.66 (define @t163 () (=> tptp.setminusERneg @t162)) % 0.40/0.66 (define @t164 () (=> tptp.setminusSubset2 @t163)) % 0.40/0.66 (define @t165 () (=> tptp.setminusER @t164)) % 0.40/0.66 (define @t166 () (=> tptp.setminusEL @t165)) % 0.40/0.66 (define @t167 () (=> tptp.setminusI @t166)) % 0.40/0.66 (define @t168 () (=> tptp.bs114d @t167)) % 0.40/0.66 (define @t169 () (=> tptp.binintersectSubset1 @t168)) % 0.40/0.66 (define @t170 () (=> tptp.binintersectSubset4 @t169)) % 0.40/0.66 (define @t171 () (=> tptp.binintersectRsub @t170)) % 0.40/0.66 (define @t172 () (=> tptp.disjointsetsI1 @t171)) % 0.40/0.66 (define @t173 () (=> tptp.binintersectER @t172)) % 0.40/0.66 (define @t174 () (=> tptp.binintersectSubset3 @t173)) % 0.40/0.66 (define @t175 () (=> tptp.binintersectSubset2 @t174)) % 0.40/0.66 (define @t176 () (=> tptp.binintersectLsub @t175)) % 0.40/0.66 (define @t177 () (=> tptp.binintersectEL @t176)) % 0.40/0.66 (define @t178 () (=> tptp.binintersectSubset5 @t177)) % 0.40/0.66 (define @t179 () (=> tptp.binintersectI @t178)) % 0.40/0.66 (define @t180 () (=> tptp.binunionRsub @t179)) % 0.40/0.66 (define @t181 () (=> tptp.binunionLsub @t180)) % 0.40/0.66 (define @t182 () (=> tptp.binunionE @t181)) % 0.40/0.66 (define @t183 () (=> tptp.binunionEcases @t182)) % 0.40/0.66 (define @t184 () (=> tptp.binunionIR @t183)) % 0.40/0.66 (define @t185 () (=> tptp.upairset2IR @t184)) % 0.40/0.66 (define @t186 () (=> tptp.binunionIL @t185)) % 0.40/0.66 (define @t187 () (=> tptp.sepSubset @t186)) % 0.40/0.66 (define @t188 () (=> tptp.sepInPowerset @t187)) % 0.40/0.66 (define @t189 () (=> tptp.powersetsubset @t188)) % 0.40/0.66 (define @t190 () (=> tptp.inPowerset @t189)) % 0.40/0.66 (define @t191 () (=> tptp.powersetE1 @t190)) % 0.40/0.66 (define @t192 () (=> tptp.powersetI1 @t191)) % 0.40/0.66 (define @t193 () (=> tptp.subsetemptysetimpeq @t192)) % 0.40/0.66 (define @t194 () (=> tptp.setextsub @t193)) % 0.40/0.66 (define @t195 () (=> tptp.subset2powerset @t194)) % 0.40/0.66 (define @t196 () (=> tptp.setadjoinSub2 @t195)) % 0.40/0.66 (define @t197 () (=> tptp.setadjoinSub @t196)) % 0.40/0.66 (define @t198 () (=> tptp.subsetTrans @t197)) % 0.40/0.66 (define @t199 () (=> tptp.subsetRefl @t198)) % 0.40/0.66 (define @t200 () (=> tptp.notequalI2 @t199)) % 0.40/0.66 (define @t201 () (=> tptp.notequalI1 @t200)) % 0.40/0.66 (define @t202 () (=> tptp.notsubsetI @t201)) % 0.40/0.66 (define @t203 () (=> tptp.subsetE2 @t202)) % 0.40/0.66 (define @t204 () (=> tptp.subsetE @t203)) % 0.40/0.66 (define @t205 () (=> tptp.emptysetsubset @t204)) % 0.40/0.66 (define @t206 () (=> tptp.subsetI2 @t205)) % 0.40/0.66 (define @t207 () (=> tptp.eqimpsubset1 @t206)) % 0.40/0.66 (define @t208 () (=> tptp.eqimpsubset2 @t207)) % 0.40/0.66 (define @t209 () (=> tptp.subsetI1 @t208)) % 0.40/0.66 (define @t210 () (=> tptp.dsetconstr__Cong @t209)) % 0.40/0.66 (define @t211 () (=> tptp.descr__Cong @t210)) % 0.40/0.66 (define @t212 () (=> tptp.exuEu @t211)) % 0.40/0.66 (define @t213 () (=> tptp.omega__Cong @t212)) % 0.40/0.66 (define @t214 () (=> tptp.setunion__Cong @t213)) % 0.40/0.66 (define @t215 () (=> tptp.powerset__Cong @t214)) % 0.40/0.66 (define @t216 () (=> tptp.setadjoin__Cong @t215)) % 0.40/0.66 (define @t217 () (=> tptp.emptyset__Cong @t216)) % 0.40/0.66 (define @t218 () (=> tptp.exu__Cong @t217)) % 0.40/0.66 (define @t219 () (=> tptp.exuE3u @t218)) % 0.40/0.66 (define @t220 () (=> tptp.in__Cong @t219)) % 0.40/0.66 (define @t221 () (=> tptp.inCongP @t220)) % 0.40/0.66 (define @t222 () (=> tptp.exuI2 @t221)) % 0.40/0.66 (define @t223 () (=> tptp.exuI3 @t222)) % 0.40/0.66 (define @t224 () (=> tptp.exuI1 @t223)) % 0.40/0.66 (define @t225 () (=> tptp.notdallE @t224)) % 0.40/0.66 (define @t226 () (=> tptp.notdexE @t225)) % 0.40/0.66 (define @t227 () (=> tptp.prop2set2propI @t226)) % 0.40/0.66 (define @t228 () (=> tptp.prop2setI @t227)) % 0.40/0.66 (define @t229 () (=> tptp.quantDeMorgan4 @t228)) % 0.40/0.66 (define @t230 () (=> tptp.quantDeMorgan3 @t229)) % 0.40/0.66 (define @t231 () (=> tptp.quantDeMorgan2 @t230)) % 0.40/0.66 (define @t232 () (=> tptp.quantDeMorgan1 @t231)) % 0.40/0.66 (define @t233 () (=> tptp.vacuousDall @t232)) % 0.40/0.66 (define @t234 () (=> tptp.emptyE1 @t233)) % 0.40/0.66 (define @t235 () (=> tptp.upairsetIR @t234)) % 0.40/0.66 (define @t236 () (=> tptp.upairsetIL @t235)) % 0.40/0.66 (define @t237 () (=> tptp.upairsetE @t236)) % 0.40/0.66 (define @t238 () (=> tptp.singletonsswitch @t237)) % 0.40/0.66 (define @t239 () (=> tptp.eqinunit @t238)) % 0.40/0.66 (define @t240 () (=> tptp.notinsingleton @t239)) % 0.40/0.66 (define @t241 () (=> tptp.uniqinunit @t240)) % 0.40/0.66 (define @t242 () (=> tptp.nonemptyImpWitness @t241)) % 0.40/0.66 (define @t243 () (=> tptp.exuE2 @t242)) % 0.40/0.66 (define @t244 () (=> tptp.subPowSU @t243)) % 0.40/0.66 (define @t245 () (=> tptp.setunionE @t244)) % 0.40/0.66 (define @t246 () (=> tptp.setunionI @t245)) % 0.40/0.66 (define @t247 () (=> tptp.powersetE @t246)) % 0.40/0.66 (define @t248 () (=> tptp.emptyInPowerset @t247)) % 0.40/0.66 (define @t249 () (=> tptp.emptyinPowerset @t248)) % 0.40/0.66 (define @t250 () (=> tptp.powersetI @t249)) % 0.40/0.66 (define @t251 () (=> tptp.setoftrueEq @t250)) % 0.40/0.66 (define @t252 () (=> tptp.setadjoinOr @t251)) % 0.40/0.66 (define @t253 () (=> tptp.setadjoinE @t252)) % 0.40/0.66 (define @t254 () (=> tptp.setadjoinIR @t253)) % 0.40/0.66 (define @t255 () (=> tptp.emptyinunitempty @t254)) % 0.40/0.66 (define @t256 () (=> tptp.setadjoinIL @t255)) % 0.40/0.66 (define @t257 () (=> tptp.nonemptyI1 @t256)) % 0.40/0.66 (define @t258 () (=> tptp.nonemptyI @t257)) % 0.40/0.66 (define @t259 () (=> tptp.nonemptyE1 @t258)) % 0.40/0.66 (define @t260 () (=> tptp.setbeta @t259)) % 0.40/0.66 (define @t261 () (=> tptp.noeltsimpempty @t260)) % 0.40/0.66 (define @t262 () (=> tptp.emptyI @t261)) % 0.40/0.66 (define @t263 () (=> tptp.setext @t262)) % 0.40/0.66 (define @t264 () (=> tptp.exuE3e @t263)) % 0.40/0.66 (define @t265 () (=> tptp.notinemptyset @t264)) % 0.40/0.66 (define @t266 () (=> tptp.emptysetimpfalse @t265)) % 0.40/0.66 (define @t267 () (=> tptp.emptysetE @t266)) % 0.40/0.66 (define @t268 () (=> tptp.prop2setE @t267)) % 0.40/0.66 (define @t269 () (=> tptp.exuE1 @t268)) % 0.40/0.66 (define @t270 () (=> tptp.dsetconstrER @t269)) % 0.40/0.66 (define @t271 () (=> tptp.dsetconstrEL @t270)) % 0.40/0.66 (define @t272 () (=> tptp.dsetconstrI @t271)) % 0.40/0.66 (define @t273 () (=> tptp.descrp @t272)) % 0.40/0.66 (define @t274 () (=> tptp.wellorderingAx @t273)) % 0.40/0.66 (define @t275 () (=> tptp.foundationAx @t274)) % 0.40/0.66 (define @t276 () (=> tptp.replAx @t275)) % 0.40/0.66 (define @t277 () (=> tptp.omegaIndAx @t276)) % 0.40/0.66 (define @t278 () (=> tptp.omegaSAx @t277)) % 0.40/0.66 (define @t279 () (=> tptp.omega0Ax @t278)) % 0.40/0.66 (define @t280 () (=> tptp.setunionAx @t279)) % 0.40/0.66 (define @t281 () (=> tptp.powersetAx @t280)) % 0.40/0.66 (define @t282 () (=> tptp.setadjoinAx @t281)) % 0.40/0.66 (define @t283 () (=> tptp.emptysetAx @t282)) % 0.40/0.66 (define @t284 () (=> tptp.setextAx @t283)) % 0.40/0.66 (define @t285 () (not @t284)) % 0.40/0.66 (define @t286 () (lambda @t56 @t63)) % 0.40/0.66 (define @t287 () (lambda @t8 (not (= @t4 tptp.emptyset)))) % 0.40/0.66 (define @t288 () (lambda @t34 (exists @t8 (and @t29 (exists @t36 (and (_ @t13 @t28) (= @t2 @t141))))))) % 0.40/0.66 (define @t289 () (lambda @t50 @t141)) % 0.40/0.66 (define @t290 () (lambda @t9 (_ (_ tptp.dsetconstr (_ tptp.powerset @t144)) (lambda @t8 (exists @t36 (and @t14 (exists (@list @t83) (and (_ @t86 @t1) (= @t4 (_ (_ tptp.kpair @t12) @t83)))))))))) % 0.40/0.67 (define @t291 () (= @t12 @t83)) % 0.40/0.67 (define @t292 () (= @t4 @t83)) % 0.40/0.67 (define @t293 () (tptp.setadjoin @t12 tptp.emptyset)) % 0.40/0.67 (define @t294 () (tptp.setadjoin @t4 @t293)) % 0.40/0.67 (define @t295 () (tptp.in @t83 @t294)) % 0.40/0.67 (define @t296 () (not @t87)) % 0.40/0.67 (define @t297 () (or @t296 @t292 @t291)) % 0.40/0.67 (define @t298 () (or @t292 @t291)) % 0.40/0.67 (assume @p1 (= tptp.setextAx (forall @t9 (=> (forall @t8 (= @t7 @t6)) @t3)))) % 0.40/0.67 (assume @p2 (= tptp.emptysetAx @t11)) % 0.40/0.67 (assume @p3 (= tptp.setadjoinAx (forall @t20 (= @t19 @t16)))) % 0.40/0.67 (assume @p4 (= tptp.powersetAx (forall @t9 (= @t25 @t22)))) % 0.40/0.67 (assume @p5 (= tptp.setunionAx (forall @t30 (= @t29 (exists @t27 (and @t6 @t26)))))) % 0.40/0.67 (assume @p6 (= tptp.omega0Ax (_ @t31 tptp.omega))) % 0.40/0.67 (assume @p7 (= tptp.omegaSAx (forall @t8 (=> @t33 (_ @t32 tptp.omega))))) % 0.40/0.67 (assume @p8 (= tptp.omegaIndAx (forall @t34 (=> (and (_ @t31 @t2) (forall @t8 (=> (and @t33 @t7) (_ @t32 @t2)))) (forall @t8 (=> @t33 @t7)))))) % 0.40/0.67 (assume @p9 (= tptp.replAx (forall (@list @t35 @t2) (=> (forall @t8 (=> @t7 (_ tptp.exu (lambda @t36 (_ (_ @t35 @t4) @t12))))) (exists @t27 (forall @t8 (= @t6 (exists @t36 (and @t14 (_ (_ @t35 @t12) @t4)))))))))) % 0.40/0.67 (assume @p10 (= tptp.foundationAx (forall @t34 (=> @t37 (exists @t27 (and @t26 (not (exists @t8 (and @t6 @t7))))))))) % 0.40/0.67 (assume @p11 (= tptp.wellorderingAx (forall @t34 (exists @t27 (and (forall @t46 (=> @t48 @t45)) (forall @t50 (=> (and @t7 @t14) (=> (forall @t46 (=> @t48 (= @t43 @t42))) @t49))) (forall (@list @t41 @t39) (=> (and @t48 @t44) (or (forall @t8 (=> @t43 @t47)) (forall @t8 (=> @t47 @t43))))) (forall @t46 (=> (and @t45 (exists @t8 @t43)) (exists (@list @t39 @t4) (and @t44 @t43 (not (exists @t36 (and @t40 @t42))) (forall (@list @t38) (=> (_ (_ tptp.in @t38) @t1) (or (forall @t36 (=> (_ @t13 @t38) @t40)) (_ @t5 @t38))))))))))))) % 0.40/0.67 (assume @p12 (= tptp.descrp (forall @t56 (=> @t55 (_ @t51 @t54))))) % 0.40/0.67 (assume @p13 (= tptp.dsetconstrI (forall @t61 (=> @t7 (=> @t52 @t60))))) % 0.40/0.67 (assume @p14 (= tptp.dsetconstrEL (forall @t61 (=> @t60 @t7)))) % 0.40/0.67 (assume @p15 (= tptp.dsetconstrER (forall @t61 (=> @t60 @t52)))) % 0.40/0.67 (assume @p16 (= tptp.exuE1 (forall @t56 (=> @t55 @t63)))) % 0.40/0.67 (assume @p17 (= tptp.prop2setE (forall (@list @t64 @t4) (=> (_ @t5 @t65) @t64)))) % 0.40/0.67 (assume @p18 (= tptp.emptysetE (forall @t8 (=> @t10 (forall @t66 @t64))))) % 0.40/0.67 (assume @p19 (= tptp.emptysetimpfalse (forall @t8 (=> @t10 false)))) % 0.40/0.67 (assume @p20 (= tptp.notinemptyset @t11)) % 0.40/0.67 (assume @p21 (= tptp.exuE3e (forall @t56 (=> @t55 @t67)))) % 0.40/0.67 (assume @p22 (= tptp.setext (forall @t9 (=> @t69 (=> @t22 @t3))))) % 0.40/0.67 (assume @p23 (= tptp.emptyI @t72)) % 0.40/0.67 (assume @p24 (= tptp.noeltsimpempty @t72)) % 0.40/0.67 (assume @p25 (= tptp.setbeta (forall @t61 (=> @t7 (= @t60 @t52))))) % 0.40/0.67 (assume @p26 (= tptp.nonemptyE1 (forall @t34 (=> @t73 @t37)))) % 0.40/0.67 (assume @p27 (= tptp.nonemptyI (forall @t61 (=> @t7 (=> @t52 (_ tptp.nonempty @t59)))))) % 0.40/0.67 (assume @p28 (= tptp.nonemptyI1 (forall @t34 (=> @t37 @t73)))) % 0.40/0.67 (assume @p29 (= tptp.setadjoinIL (forall @t50 (_ @t5 (_ @t17 @t12))))) % 0.40/0.67 (assume @p30 (= tptp.emptyinunitempty (_ @t31 (_ (_ tptp.setadjoin tptp.emptyset) tptp.emptyset)))) % 0.40/0.67 (assume @p31 (= tptp.setadjoinIR (forall @t20 (=> @t14 @t19)))) % 0.40/0.67 (assume @p32 (= tptp.setadjoinE (forall @t20 (=> @t19 (forall @t66 (=> (=> @t15 @t64) (=> (=> @t14 @t64) @t64))))))) % 0.40/0.67 (assume @p33 (= tptp.setadjoinOr (forall @t20 (=> @t19 @t16)))) % 0.40/0.67 (assume @p34 (= tptp.setoftrueEq (forall @t34 (= (_ @t58 (lambda @t8 true)) @t2)))) % 0.40/0.67 (assume @p35 (= tptp.powersetI (forall @t9 (=> @t22 @t25)))) % 0.40/0.67 (assume @p36 (= tptp.emptyinPowerset @t74)) % 0.40/0.67 (assume @p37 (= tptp.emptyInPowerset @t74)) % 0.40/0.67 (assume @p38 (= tptp.powersetE (forall @t75 (=> @t25 @t21)))) % 0.40/0.67 (assume @p39 (= tptp.setunionI (forall @t76 (=> @t6 (=> @t26 @t29))))) % 0.40/0.67 (assume @p40 (= tptp.setunionE (forall @t30 (=> @t29 (forall @t66 (=> (forall @t27 (=> @t6 (=> @t26 @t64))) @t64)))))) % 0.40/0.67 (assume @p41 (= tptp.subPowSU (forall @t30 (=> @t7 (_ @t5 (_ tptp.powerset @t28)))))) % 0.40/0.67 (assume @p42 (= tptp.exuE2 (forall @t56 (=> @t55 @t77)))) % 0.40/0.67 (assume @p43 (= tptp.nonemptyImpWitness (forall @t34 (=> @t73 (exists @t8 (and @t7 true)))))) % 0.40/0.67 (assume @p44 (= tptp.uniqinunit (forall @t50 (=> @t80 @t49)))) % 0.40/0.67 (assume @p45 (= tptp.notinsingleton (forall @t50 (=> (not @t49) (not @t82))))) % 0.40/0.67 (assume @p46 (= tptp.eqinunit (forall @t50 (=> @t49 @t80)))) % 0.40/0.67 (assume @p47 (= tptp.singletonsswitch (forall @t50 (=> @t80 @t82)))) % 0.40/0.67 (assume @p48 @t91) % 0.40/0.67 (assume @p49 (= tptp.upairsetIL (forall @t50 (_ @t5 @t85)))) % 0.40/0.67 (assume @p50 (= tptp.upairsetIR @t92)) % 0.40/0.67 (assume @p51 (= tptp.emptyE1 (forall @t95 (=> @t94 (=> (= @t93 tptp.emptyset) false))))) % 0.40/0.67 (assume @p52 (= tptp.vacuousDall (forall (@list @t51 @t4) (=> @t10 @t52)))) % 0.40/0.67 (assume @p53 (= tptp.quantDeMorgan1 @t99)) % 0.40/0.67 (assume @p54 (= tptp.quantDeMorgan2 (forall @t95 (=> @t101 @t100)))) % 0.40/0.67 (assume @p55 (= tptp.quantDeMorgan3 @t102)) % 0.40/0.67 (assume @p56 (= tptp.quantDeMorgan4 (forall @t95 (=> @t97 @t98)))) % 0.40/0.67 (assume @p57 (= tptp.prop2setI (forall @t66 (=> @t64 (_ @t31 @t65))))) % 0.40/0.67 (assume @p58 (= tptp.prop2set2propI (forall @t66 (=> @t64 (_ tptp.set2prop @t65))))) % 0.40/0.67 (assume @p59 (= tptp.notdexE @t102)) % 0.40/0.67 (assume @p60 (= tptp.notdallE @t99)) % 0.40/0.67 (assume @p61 (= tptp.exuI1 (forall @t56 (=> @t63 @t55)))) % 0.40/0.67 (assume @p62 (= tptp.exuI3 (forall @t56 (=> @t67 (=> @t103 @t55))))) % 0.40/0.67 (assume @p63 (= tptp.exuI2 (forall @t56 (=> @t77 @t55)))) % 0.40/0.67 (assume @p64 (= tptp.inCongP (forall @t9 (=> @t3 (forall @t50 (=> @t49 (=> @t7 @t104))))))) % 0.40/0.67 (assume @p65 (= tptp.in__Cong (forall @t9 (=> @t3 (forall @t50 (=> @t49 (= @t7 @t104))))))) % 0.40/0.67 (assume @p66 (= tptp.exuE3u @t105)) % 0.40/0.67 (assume @p67 (= tptp.exu__Cong (forall @t111 (=> @t110 (= @t55 @t108))))) % 0.40/0.67 (assume @p68 (= tptp.emptyset__Cong (= tptp.emptyset tptp.emptyset))) % 0.40/0.67 (assume @p69 (= tptp.setadjoin__Cong (forall @t50 (=> @t49 (forall (@list @t83 @t112) (=> (= @t83 @t112) (= (_ @t17 @t83) (_ @t78 @t112)))))))) % 0.40/0.67 (assume @p70 (= tptp.powerset__Cong (forall @t9 (=> @t3 (= @t23 @t113))))) % 0.40/0.67 (assume @p71 (= tptp.setunion__Cong (forall @t9 (=> @t3 (= @t28 (_ tptp.setunion @t1)))))) % 0.40/0.67 (assume @p72 (= tptp.omega__Cong (= tptp.omega tptp.omega))) % 0.40/0.67 (assume @p73 (= tptp.exuEu @t105)) % 0.40/0.67 (assume @p74 (= tptp.descr__Cong (forall @t111 (=> @t110 (=> @t55 (=> @t108 (= @t54 (_ tptp.descr @t107)))))))) % 0.40/0.67 (assume @p75 (= tptp.dsetconstr__Cong (forall @t9 (=> @t3 (forall @t111 (=> (forall @t8 (=> @t7 (forall @t36 (=> @t104 @t109)))) (= @t93 (_ (_ tptp.dsetconstr @t1) @t107)))))))) % 0.40/0.67 (assume @p76 (= tptp.subsetI1 @t116)) % 0.40/0.67 (assume @p77 (= tptp.eqimpsubset2 (forall @t9 (=> @t3 @t118)))) % 0.40/0.67 (assume @p78 (= tptp.eqimpsubset1 (forall @t9 (=> @t3 @t115)))) % 0.40/0.67 (assume @p79 (= tptp.subsetI2 @t116)) % 0.40/0.67 (assume @p80 (= tptp.emptysetsubset (forall @t34 (_ (_ tptp.subset tptp.emptyset) @t2)))) % 0.40/0.67 (assume @p81 (= tptp.subsetE (forall @t75 (=> @t115 @t68)))) % 0.40/0.67 (assume @p82 (= tptp.subsetE2 (forall @t75 (=> @t115 @t120)))) % 0.40/0.67 (assume @p83 (= tptp.notsubsetI (forall @t75 (=> @t7 (=> @t119 @t121))))) % 0.40/0.67 (assume @p84 (= tptp.notequalI1 (forall @t9 (=> @t121 @t122)))) % 0.40/0.67 (assume @p85 (= tptp.notequalI2 (forall @t75 (=> @t7 (=> @t119 @t122))))) % 0.40/0.67 (assume @p86 (= tptp.subsetRefl (forall @t34 (_ @t114 @t2)))) % 0.40/0.67 (assume @p87 (= tptp.subsetTrans (forall @t123 (=> @t115 (=> (_ @t117 @t41) (_ @t114 @t41)))))) % 0.40/0.67 (assume @p88 (= tptp.setadjoinSub (forall (@list @t4 @t2) (_ @t114 @t18)))) % 0.40/0.67 (assume @p89 (= tptp.setadjoinSub2 (forall @t76 (=> @t115 (_ @t114 (_ @t17 @t1)))))) % 0.40/0.67 (assume @p90 (= tptp.subset2powerset (forall @t9 (=> @t115 (_ @t124 @t113))))) % 0.40/0.67 (assume @p91 (= tptp.setextsub (forall @t9 (=> @t115 (=> @t118 @t3))))) % 0.40/0.67 (assume @p92 (= tptp.subsetemptysetimpeq (forall @t34 (=> (_ @t114 tptp.emptyset) @t70)))) % 0.40/0.67 (assume @p93 (= tptp.powersetI1 (forall @t9 (=> @t118 @t25)))) % 0.40/0.67 (assume @p94 (= tptp.powersetE1 (forall @t9 (=> @t25 @t118)))) % 0.40/0.67 (assume @p95 (= tptp.inPowerset (forall @t34 (_ @t124 @t23)))) % 0.40/0.67 (assume @p96 (= tptp.powersetsubset (forall @t9 (=> @t115 (_ (_ tptp.subset @t23) @t113))))) % 0.40/0.67 (assume @p97 (= tptp.sepInPowerset (forall @t95 (_ (_ tptp.in @t93) @t23)))) % 0.40/0.67 (assume @p98 (= tptp.sepSubset (forall @t95 (_ (_ tptp.subset @t93) @t2)))) % 0.40/0.67 (assume @p99 (= tptp.binunionIL (forall @t75 (=> @t7 @t126)))) % 0.40/0.67 (assume @p100 (= tptp.upairset2IR @t92)) % 0.40/0.67 (assume @p101 (= tptp.binunionIR (forall @t75 (=> @t6 @t126)))) % 0.40/0.67 (assume @p102 (= tptp.binunionEcases (forall (@list @t2 @t1 @t4 @t64) (=> @t126 (=> (=> @t7 @t64) (=> @t127 @t64)))))) % 0.40/0.67 (assume @p103 (= tptp.binunionE (forall @t75 (=> @t126 (or @t7 @t6))))) % 0.40/0.67 (assume @p104 (= tptp.binunionLsub (forall @t9 (_ @t114 @t125)))) % 0.40/0.67 (assume @p105 (= tptp.binunionRsub (forall @t9 (_ @t117 @t125)))) % 0.40/0.67 (assume @p106 (= tptp.binintersectI (forall @t75 (=> @t7 (=> @t6 @t130))))) % 0.40/0.67 (assume @p107 (= tptp.binintersectSubset5 (forall @t123 (=> (_ @t131 @t2) (=> (_ @t131 @t1) (_ @t131 @t129)))))) % 0.40/0.67 (assume @p108 (= tptp.binintersectEL (forall @t75 (=> @t130 @t7)))) % 0.40/0.67 (assume @p109 (= tptp.binintersectLsub (forall @t9 (_ @t132 @t2)))) % 0.40/0.67 (assume @p110 (= tptp.binintersectSubset2 (forall @t9 (=> @t115 @t133)))) % 0.40/0.67 (assume @p111 (= tptp.binintersectSubset3 (forall @t9 (=> @t134 @t118)))) % 0.40/0.67 (assume @p112 (= tptp.binintersectER (forall @t75 (=> @t130 @t6)))) % 0.40/0.67 (assume @p113 (= tptp.disjointsetsI1 (forall @t9 (=> (not (exists @t8 (and @t7 @t6))) (= @t129 tptp.emptyset))))) % 0.40/0.67 (assume @p114 (= tptp.binintersectRsub (forall @t9 (_ @t132 @t1)))) % 0.40/0.67 (assume @p115 (= tptp.binintersectSubset4 (forall @t9 (=> @t118 @t134)))) % 0.40/0.67 (assume @p116 (= tptp.binintersectSubset1 (forall @t9 (=> @t133 @t115)))) % 0.40/0.67 (assume @p117 (= tptp.bs114d (forall @t123 (= (_ @t128 (_ (_ tptp.binunion @t1) @t41)) (_ (_ tptp.binunion @t129) (_ @t128 @t41)))))) % 0.40/0.67 (assume @p118 (= tptp.setminusI (forall @t75 (=> @t7 (=> @t119 @t136))))) % 0.40/0.67 (assume @p119 (= tptp.setminusEL (forall @t75 (=> @t136 @t7)))) % 0.40/0.67 (assume @p120 (= tptp.setminusER (forall @t75 (=> @t136 @t119)))) % 0.40/0.67 (assume @p121 (= tptp.setminusSubset2 (forall @t9 (=> @t115 @t137)))) % 0.40/0.67 (assume @p122 (= tptp.setminusERneg (forall @t75 (=> @t138 @t68)))) % 0.40/0.67 (assume @p123 (= tptp.setminusELneg (forall @t75 (=> @t138 @t120)))) % 0.40/0.67 (assume @p124 (= tptp.setminusILneg (forall @t75 (=> @t71 @t138)))) % 0.40/0.67 (assume @p125 (= tptp.setminusIRneg (forall @t75 (=> @t6 @t138)))) % 0.40/0.67 (assume @p126 (= tptp.setminusLsub (forall @t9 (_ (_ tptp.subset @t135) @t2)))) % 0.40/0.67 (assume @p127 (= tptp.setminusSubset1 (forall @t9 (=> @t137 @t115)))) % 0.40/0.67 (assume @p128 (= tptp.symdiffE (forall @t75 (=> @t139 (forall @t66 (=> (=> @t7 (=> @t119 @t64)) (=> (=> @t71 @t127) @t64))))))) % 0.40/0.67 (assume @p129 (= tptp.symdiffI1 (forall @t75 (=> @t7 (=> @t119 @t139))))) % 0.40/0.67 (assume @p130 (= tptp.symdiffI2 (forall @t75 (=> @t71 (=> @t6 @t139))))) % 0.40/0.67 (assume @p131 (= tptp.symdiffIneg1 (forall @t75 (=> @t7 (=> @t6 @t140))))) % 0.40/0.67 (assume @p132 (= tptp.symdiffIneg2 (forall @t75 (=> @t71 (=> @t119 @t140))))) % 0.40/0.67 (assume @p133 (= tptp.secondinupair @t92)) % 0.40/0.67 (assume @p134 (= tptp.setukpairIL (forall @t50 (_ @t5 @t142)))) % 0.40/0.67 (assume @p135 (= tptp.setukpairIR (forall @t50 (_ @t13 @t142)))) % 0.40/0.67 (assume @p136 (= tptp.kpairiskpair (forall @t50 (_ tptp.iskpair @t141)))) % 0.40/0.67 (assume @p137 (= tptp.kpairp (forall @t50 (_ tptp.iskpair (_ (_ tptp.kpair @t4) @t12))))) % 0.40/0.67 (assume @p138 (= tptp.singletonsubset (forall @t30 (=> @t7 (_ (_ tptp.subset @t81) @t2))))) % 0.40/0.67 (assume @p139 (= tptp.singletoninpowerset (forall @t30 (=> @t7 (_ @t143 @t23))))) % 0.40/0.67 (assume @p140 (= tptp.singletoninpowunion (forall @t75 (=> @t7 (_ @t143 @t144))))) % 0.40/0.67 (assume @p141 @t285) % 0.40/0.67 (assume @p142 true) % 0.40/0.67 (step @p143 (= tptp.exu @t286) :rule refl :args (@t286)) % 0.40/0.67 (step @p144 (= tptp.nonempty @t287) :rule refl :args (@t287)) % 0.40/0.67 (step @p145 (= tptp.iskpair @t288) :rule refl :args (@t288)) % 0.40/0.67 (step @p146 (= tptp.kpair @t289) :rule refl :args (@t289)) % 0.40/0.67 (step @p147 (= tptp.cartprod @t290) :rule refl :args (@t290)) % 0.40/0.67 (step @p148 :rule refl :args (@t291)) % 0.40/0.67 (step @p149 :rule refl :args (@t292)) % 0.40/0.67 (step @p150 :rule refl :args ((tptp.in @t83 @t85))) % 0.40/0.67 (step @p151 :rule refl :args ((tptp.setadjoin @t4 @t79))) % 0.40/0.67 (step @p152 :rule refl :args (@t293)) % 0.40/0.67 (step @p153 :rule refl :args (@t4)) % 0.40/0.67 (step @p154 :rule cong :premises (@p153 @p152) :args (@t294)) % 0.40/0.67 (step @p155 :rule trans :premises (@p154 @p151)) % 0.40/0.67 (step @p156 :rule refl :args (@t83)) % 0.40/0.67 (step @p157 :rule cong :premises (@p156 @p155) :args (@t295)) % 0.40/0.67 (step @p158 :rule trans :premises (@p157 @p150)) % 0.40/0.67 (step @p159 :rule refl :args (@t86)) % 0.40/0.67 (step @p160 :rule ho_cong :premises (@p159 @p155)) % 0.40/0.67 (step @p161 :rule cong :premises (@p160 @p158) :args ((= (_ @t86 @t294) @t295))) % 0.40/0.67 (step @p162 :rule symm :premises (@p161)) % 0.40/0.67 (step @p163 :rule refl :args (@t87)) % 0.40/0.67 (step @p164 :rule eq_resolve :premises (@p163 @p162)) % 0.40/0.67 (step @p165 :rule refl :args (@t17)) % 0.40/0.67 (step @p166 :rule ho_cong :premises (@p165 @p152)) % 0.40/0.67 (step @p167 :rule cong :premises (@p166 @p155) :args ((= (_ @t17 @t293) @t294))) % 0.40/0.67 (step @p168 :rule symm :premises (@p167)) % 0.40/0.67 (step @p169 :rule refl :args (@t85)) % 0.40/0.67 (step @p170 :rule eq_resolve :premises (@p169 @p168)) % 0.40/0.67 (step @p171 :rule refl :args (@t79)) % 0.40/0.67 (step @p172 :rule cong :premises (@p171 @p152) :args ((= @t79 @t293))) % 0.40/0.67 (step @p173 :rule symm :premises (@p172)) % 0.40/0.67 (step @p174 :rule eq_resolve :premises (@p171 @p173)) % 0.40/0.67 (step @p175 :rule ho_cong :premises (@p165 @p174)) % 0.40/0.67 (step @p176 :rule trans :premises (@p175 @p170)) % 0.40/0.67 (step @p177 :rule ho_cong :premises (@p159 @p176)) % 0.40/0.67 (step @p178 :rule trans :premises (@p177 @p164)) % 0.40/0.67 (step @p179 :rule cong :premises (@p178) :args (@t296)) % 0.40/0.67 (step @p180 :rule nary_cong :premises (@p179 @p149 @p148) :args (@t297)) % 0.40/0.67 (step @p181 :rule cong :premises (@p180) :args ((forall @t89 @t297))) % 0.40/0.67 (step @p182 :rule aci_norm :args ((= (or @t296 @t298) @t297))) % 0.40/0.67 (step @p183 :rule bool-impl-elim :args (@t87 @t298)) % 0.40/0.67 (step @p184 :rule trans :premises (@p183 @p182)) % 0.40/0.67 (step @p185 :rule cong :premises (@p184) :args ((forall @t89 (=> @t87 @t298)))) % 0.40/0.67 (step @p186 :rule trans :premises (@p185 @p181)) % 0.40/0.67 (step @p187 :rule eq-symm :args (@t83 @t12)) % 0.40/0.67 (step @p188 :rule eq-symm :args (@t83 @t4)) % 0.40/0.67 (step @p189 :rule nary_cong :premises (@p188 @p187) :args (@t84)) % 0.40/0.67 (step @p190 :rule refl :args (@t87)) % 0.40/0.67 (step @p191 :rule cong :premises (@p190 @p189) :args (@t88)) % 0.40/0.67 (step @p192 :rule cong :premises (@p191) :args (@t90)) % 0.40/0.67 (step @p193 :rule trans :premises (@p192 @p186)) % 0.40/0.67 (step @p194 :rule refl :args (tptp.singletoninpowunion)) % 0.40/0.67 (step @p195 :rule cong :premises (@p194 @p193) :args (@t145)) % 0.40/0.67 (step @p196 :rule refl :args (tptp.singletoninpowerset)) % 0.40/0.67 (step @p197 :rule cong :premises (@p196 @p195) :args (@t146)) % 0.40/0.67 (step @p198 :rule refl :args (tptp.singletonsubset)) % 0.40/0.67 (step @p199 :rule cong :premises (@p198 @p197) :args (@t147)) % 0.40/0.67 (step @p200 :rule refl :args (tptp.kpairp)) % 0.40/0.67 (step @p201 :rule cong :premises (@p200 @p199) :args (@t148)) % 0.40/0.67 (step @p202 :rule refl :args (tptp.kpairiskpair)) % 0.40/0.67 (step @p203 :rule cong :premises (@p202 @p201) :args (@t149)) % 0.40/0.67 (step @p204 :rule refl :args (tptp.setukpairIR)) % 0.40/0.67 (step @p205 :rule cong :premises (@p204 @p203) :args (@t150)) % 0.40/0.67 (step @p206 :rule refl :args (tptp.setukpairIL)) % 0.40/0.67 (step @p207 :rule cong :premises (@p206 @p205) :args (@t151)) % 0.40/0.67 (step @p208 :rule refl :args (tptp.secondinupair)) % 0.40/0.67 (step @p209 :rule cong :premises (@p208 @p207) :args (@t152)) % 0.40/0.67 (step @p210 :rule refl :args (tptp.symdiffIneg2)) % 0.40/0.67 (step @p211 :rule cong :premises (@p210 @p209) :args (@t153)) % 0.40/0.67 (step @p212 :rule refl :args (tptp.symdiffIneg1)) % 0.40/0.67 (step @p213 :rule cong :premises (@p212 @p211) :args (@t154)) % 0.40/0.67 (step @p214 :rule refl :args (tptp.symdiffI2)) % 0.40/0.67 (step @p215 :rule cong :premises (@p214 @p213) :args (@t155)) % 0.40/0.67 (step @p216 :rule refl :args (tptp.symdiffI1)) % 0.40/0.67 (step @p217 :rule cong :premises (@p216 @p215) :args (@t156)) % 0.40/0.67 (step @p218 :rule refl :args (tptp.symdiffE)) % 0.40/0.67 (step @p219 :rule cong :premises (@p218 @p217) :args (@t157)) % 0.40/0.67 (step @p220 :rule refl :args (tptp.setminusSubset1)) % 0.40/0.67 (step @p221 :rule cong :premises (@p220 @p219) :args (@t158)) % 0.40/0.67 (step @p222 :rule refl :args (tptp.setminusLsub)) % 0.40/0.67 (step @p223 :rule cong :premises (@p222 @p221) :args (@t159)) % 0.40/0.67 (step @p224 :rule refl :args (tptp.setminusIRneg)) % 0.40/0.67 (step @p225 :rule cong :premises (@p224 @p223) :args (@t160)) % 0.40/0.67 (step @p226 :rule refl :args (tptp.setminusILneg)) % 0.40/0.67 (step @p227 :rule cong :premises (@p226 @p225) :args (@t161)) % 0.40/0.67 (step @p228 :rule refl :args (tptp.setminusELneg)) % 0.40/0.67 (step @p229 :rule cong :premises (@p228 @p227) :args (@t162)) % 0.40/0.67 (step @p230 :rule refl :args (tptp.setminusERneg)) % 0.40/0.67 (step @p231 :rule cong :premises (@p230 @p229) :args (@t163)) % 0.40/0.67 (step @p232 :rule refl :args (tptp.setminusSubset2)) % 0.40/0.67 (step @p233 :rule cong :premises (@p232 @p231) :args (@t164)) % 0.40/0.67 (step @p234 :rule refl :args (tptp.setminusER)) % 0.40/0.67 (step @p235 :rule cong :premises (@p234 @p233) :args (@t165)) % 0.40/0.67 (step @p236 :rule refl :args (tptp.setminusEL)) % 0.40/0.67 (step @p237 :rule cong :premises (@p236 @p235) :args (@t166)) % 0.40/0.67 (step @p238 :rule refl :args (tptp.setminusI)) % 0.40/0.67 (step @p239 :rule cong :premises (@p238 @p237) :args (@t167)) % 0.40/0.67 (step @p240 :rule refl :args (tptp.bs114d)) % 0.40/0.67 (step @p241 :rule cong :premises (@p240 @p239) :args (@t168)) % 0.40/0.67 (step @p242 :rule refl :args (tptp.binintersectSubset1)) % 0.40/0.67 (step @p243 :rule cong :premises (@p242 @p241) :args (@t169)) % 0.40/0.67 (step @p244 :rule refl :args (tptp.binintersectSubset4)) % 0.40/0.67 (step @p245 :rule cong :premises (@p244 @p243) :args (@t170)) % 0.40/0.67 (step @p246 :rule refl :args (tptp.binintersectRsub)) % 0.40/0.67 (step @p247 :rule cong :premises (@p246 @p245) :args (@t171)) % 0.40/0.67 (step @p248 :rule refl :args (tptp.disjointsetsI1)) % 0.40/0.67 (step @p249 :rule cong :premises (@p248 @p247) :args (@t172)) % 0.40/0.67 (step @p250 :rule refl :args (tptp.binintersectER)) % 0.40/0.67 (step @p251 :rule cong :premises (@p250 @p249) :args (@t173)) % 0.40/0.67 (step @p252 :rule refl :args (tptp.binintersectSubset3)) % 0.40/0.67 (step @p253 :rule cong :premises (@p252 @p251) :args (@t174)) % 0.40/0.67 (step @p254 :rule refl :args (tptp.binintersectSubset2)) % 0.40/0.67 (step @p255 :rule cong :premises (@p254 @p253) :args (@t175)) % 0.40/0.67 (step @p256 :rule refl :args (tptp.binintersectLsub)) % 0.40/0.67 (step @p257 :rule cong :premises (@p256 @p255) :args (@t176)) % 0.40/0.67 (step @p258 :rule refl :args (tptp.binintersectEL)) % 0.40/0.67 (step @p259 :rule cong :premises (@p258 @p257) :args (@t177)) % 0.40/0.67 (step @p260 :rule refl :args (tptp.binintersectSubset5)) % 0.40/0.67 (step @p261 :rule cong :premises (@p260 @p259) :args (@t178)) % 0.40/0.67 (step @p262 :rule refl :args (tptp.binintersectI)) % 0.40/0.67 (step @p263 :rule cong :premises (@p262 @p261) :args (@t179)) % 0.40/0.67 (step @p264 :rule refl :args (tptp.binunionRsub)) % 0.40/0.67 (step @p265 :rule cong :premises (@p264 @p263) :args (@t180)) % 0.40/0.67 (step @p266 :rule refl :args (tptp.binunionLsub)) % 0.40/0.67 (step @p267 :rule cong :premises (@p266 @p265) :args (@t181)) % 0.40/0.67 (step @p268 :rule refl :args (tptp.binunionE)) % 0.40/0.67 (step @p269 :rule cong :premises (@p268 @p267) :args (@t182)) % 0.40/0.67 (step @p270 :rule refl :args (tptp.binunionEcases)) % 0.40/0.67 (step @p271 :rule cong :premises (@p270 @p269) :args (@t183)) % 0.40/0.67 (step @p272 :rule refl :args (tptp.binunionIR)) % 0.40/0.67 (step @p273 :rule cong :premises (@p272 @p271) :args (@t184)) % 0.40/0.67 (step @p274 :rule refl :args (tptp.upairset2IR)) % 0.40/0.67 (step @p275 :rule cong :premises (@p274 @p273) :args (@t185)) % 0.40/0.67 (step @p276 :rule refl :args (tptp.binunionIL)) % 0.40/0.67 (step @p277 :rule cong :premises (@p276 @p275) :args (@t186)) % 0.40/0.67 (step @p278 :rule refl :args (tptp.sepSubset)) % 0.40/0.67 (step @p279 :rule cong :premises (@p278 @p277) :args (@t187)) % 0.40/0.67 (step @p280 :rule refl :args (tptp.sepInPowerset)) % 0.40/0.67 (step @p281 :rule cong :premises (@p280 @p279) :args (@t188)) % 0.40/0.67 (step @p282 :rule refl :args (tptp.powersetsubset)) % 0.40/0.67 (step @p283 :rule cong :premises (@p282 @p281) :args (@t189)) % 0.40/0.67 (step @p284 :rule refl :args (tptp.inPowerset)) % 0.40/0.67 (step @p285 :rule cong :premises (@p284 @p283) :args (@t190)) % 0.40/0.67 (step @p286 :rule refl :args (tptp.powersetE1)) % 0.40/0.67 (step @p287 :rule cong :premises (@p286 @p285) :args (@t191)) % 0.40/0.67 (step @p288 :rule refl :args (tptp.powersetI1)) % 0.40/0.67 (step @p289 :rule cong :premises (@p288 @p287) :args (@t192)) % 0.40/0.67 (step @p290 :rule refl :args (tptp.subsetemptysetimpeq)) % 0.40/0.67 (step @p291 :rule cong :premises (@p290 @p289) :args (@t193)) % 0.40/0.67 (step @p292 :rule refl :args (tptp.setextsub)) % 0.40/0.67 (step @p293 :rule cong :premises (@p292 @p291) :args (@t194)) % 0.40/0.67 (step @p294 :rule refl :args (tptp.subset2powerset)) % 0.40/0.67 (step @p295 :rule cong :premises (@p294 @p293) :args (@t195)) % 0.40/0.67 (step @p296 :rule refl :args (tptp.setadjoinSub2)) % 0.40/0.67 (step @p297 :rule cong :premises (@p296 @p295) :args (@t196)) % 0.40/0.67 (step @p298 :rule refl :args (tptp.setadjoinSub)) % 0.40/0.67 (step @p299 :rule cong :premises (@p298 @p297) :args (@t197)) % 0.40/0.67 (step @p300 :rule refl :args (tptp.subsetTrans)) % 0.40/0.67 (step @p301 :rule cong :premises (@p300 @p299) :args (@t198)) % 0.40/0.67 (step @p302 :rule refl :args (tptp.subsetRefl)) % 0.40/0.67 (step @p303 :rule cong :premises (@p302 @p301) :args (@t199)) % 0.40/0.67 (step @p304 :rule refl :args (tptp.notequalI2)) % 0.40/0.67 (step @p305 :rule cong :premises (@p304 @p303) :args (@t200)) % 0.40/0.67 (step @p306 :rule refl :args (tptp.notequalI1)) % 0.40/0.67 (step @p307 :rule cong :premises (@p306 @p305) :args (@t201)) % 0.40/0.67 (step @p308 :rule refl :args (tptp.notsubsetI)) % 0.40/0.67 (step @p309 :rule cong :premises (@p308 @p307) :args (@t202)) % 0.40/0.67 (step @p310 :rule refl :args (tptp.subsetE2)) % 0.40/0.67 (step @p311 :rule cong :premises (@p310 @p309) :args (@t203)) % 0.40/0.67 (step @p312 :rule refl :args (tptp.subsetE)) % 0.40/0.67 (step @p313 :rule cong :premises (@p312 @p311) :args (@t204)) % 0.40/0.67 (step @p314 :rule refl :args (tptp.emptysetsubset)) % 0.40/0.67 (step @p315 :rule cong :premises (@p314 @p313) :args (@t205)) % 0.40/0.67 (step @p316 :rule refl :args (tptp.subsetI2)) % 0.40/0.67 (step @p317 :rule cong :premises (@p316 @p315) :args (@t206)) % 0.40/0.67 (step @p318 :rule refl :args (tptp.eqimpsubset1)) % 0.40/0.67 (step @p319 :rule cong :premises (@p318 @p317) :args (@t207)) % 0.40/0.67 (step @p320 :rule refl :args (tptp.eqimpsubset2)) % 0.40/0.67 (step @p321 :rule cong :premises (@p320 @p319) :args (@t208)) % 0.40/0.67 (step @p322 :rule refl :args (tptp.subsetI1)) % 0.40/0.67 (step @p323 :rule cong :premises (@p322 @p321) :args (@t209)) % 0.40/0.67 (step @p324 :rule refl :args (tptp.dsetconstr__Cong)) % 0.40/0.67 (step @p325 :rule cong :premises (@p324 @p323) :args (@t210)) % 0.40/0.67 (step @p326 :rule refl :args (tptp.descr__Cong)) % 0.40/0.67 (step @p327 :rule cong :premises (@p326 @p325) :args (@t211)) % 0.40/0.67 (step @p328 :rule refl :args (tptp.exuEu)) % 0.40/0.67 (step @p329 :rule cong :premises (@p328 @p327) :args (@t212)) % 0.40/0.67 (step @p330 :rule refl :args (tptp.omega__Cong)) % 0.40/0.67 (step @p331 :rule cong :premises (@p330 @p329) :args (@t213)) % 0.40/0.67 (step @p332 :rule refl :args (tptp.setunion__Cong)) % 0.40/0.67 (step @p333 :rule cong :premises (@p332 @p331) :args (@t214)) % 0.40/0.67 (step @p334 :rule refl :args (tptp.powerset__Cong)) % 0.40/0.67 (step @p335 :rule cong :premises (@p334 @p333) :args (@t215)) % 0.40/0.67 (step @p336 :rule refl :args (tptp.setadjoin__Cong)) % 0.40/0.67 (step @p337 :rule cong :premises (@p336 @p335) :args (@t216)) % 0.40/0.67 (step @p338 :rule refl :args (tptp.emptyset__Cong)) % 0.40/0.67 (step @p339 :rule cong :premises (@p338 @p337) :args (@t217)) % 0.40/0.67 (step @p340 :rule refl :args (tptp.exu__Cong)) % 0.40/0.67 (step @p341 :rule cong :premises (@p340 @p339) :args (@t218)) % 0.40/0.67 (step @p342 :rule refl :args (tptp.exuE3u)) % 0.40/0.67 (step @p343 :rule cong :premises (@p342 @p341) :args (@t219)) % 0.40/0.67 (step @p344 :rule refl :args (tptp.in__Cong)) % 0.40/0.67 (step @p345 :rule cong :premises (@p344 @p343) :args (@t220)) % 0.40/0.67 (step @p346 :rule refl :args (tptp.inCongP)) % 0.40/0.67 (step @p347 :rule cong :premises (@p346 @p345) :args (@t221)) % 0.40/0.67 (step @p348 :rule refl :args (tptp.exuI2)) % 0.40/0.67 (step @p349 :rule cong :premises (@p348 @p347) :args (@t222)) % 0.40/0.67 (step @p350 :rule refl :args (tptp.exuI3)) % 0.40/0.67 (step @p351 :rule cong :premises (@p350 @p349) :args (@t223)) % 0.40/0.67 (step @p352 :rule refl :args (tptp.exuI1)) % 0.40/0.67 (step @p353 :rule cong :premises (@p352 @p351) :args (@t224)) % 0.40/0.67 (step @p354 :rule refl :args (tptp.notdallE)) % 0.40/0.67 (step @p355 :rule cong :premises (@p354 @p353) :args (@t225)) % 0.40/0.67 (step @p356 :rule refl :args (tptp.notdexE)) % 0.40/0.67 (step @p357 :rule cong :premises (@p356 @p355) :args (@t226)) % 0.40/0.67 (step @p358 :rule refl :args (tptp.prop2set2propI)) % 0.40/0.67 (step @p359 :rule cong :premises (@p358 @p357) :args (@t227)) % 0.40/0.67 (step @p360 :rule refl :args (tptp.prop2setI)) % 0.40/0.67 (step @p361 :rule cong :premises (@p360 @p359) :args (@t228)) % 0.40/0.67 (step @p362 :rule refl :args (tptp.quantDeMorgan4)) % 0.40/0.67 (step @p363 :rule cong :premises (@p362 @p361) :args (@t229)) % 0.40/0.67 (step @p364 :rule refl :args (tptp.quantDeMorgan3)) % 0.40/0.67 (step @p365 :rule cong :premises (@p364 @p363) :args (@t230)) % 0.40/0.67 (step @p366 :rule refl :args (tptp.quantDeMorgan2)) % 0.40/0.67 (step @p367 :rule cong :premises (@p366 @p365) :args (@t231)) % 0.40/0.67 (step @p368 :rule refl :args (tptp.quantDeMorgan1)) % 0.40/0.67 (step @p369 :rule cong :premises (@p368 @p367) :args (@t232)) % 0.40/0.67 (step @p370 :rule refl :args (tptp.vacuousDall)) % 0.40/0.67 (step @p371 :rule cong :premises (@p370 @p369) :args (@t233)) % 0.40/0.67 (step @p372 :rule refl :args (tptp.emptyE1)) % 0.40/0.67 (step @p373 :rule cong :premises (@p372 @p371) :args (@t234)) % 0.40/0.67 (step @p374 :rule refl :args (tptp.upairsetIR)) % 0.40/0.67 (step @p375 :rule cong :premises (@p374 @p373) :args (@t235)) % 0.40/0.67 (step @p376 :rule refl :args (tptp.upairsetIL)) % 0.40/0.67 (step @p377 :rule cong :premises (@p376 @p375) :args (@t236)) % 0.40/0.67 (step @p378 :rule refl :args (tptp.upairsetE)) % 0.40/0.67 (step @p379 :rule cong :premises (@p378 @p377) :args (@t237)) % 0.40/0.67 (step @p380 :rule refl :args (tptp.singletonsswitch)) % 0.40/0.67 (step @p381 :rule cong :premises (@p380 @p379) :args (@t238)) % 0.40/0.67 (step @p382 :rule refl :args (tptp.eqinunit)) % 0.40/0.67 (step @p383 :rule cong :premises (@p382 @p381) :args (@t239)) % 0.40/0.67 (step @p384 :rule refl :args (tptp.notinsingleton)) % 0.40/0.67 (step @p385 :rule cong :premises (@p384 @p383) :args (@t240)) % 0.40/0.67 (step @p386 :rule refl :args (tptp.uniqinunit)) % 0.40/0.67 (step @p387 :rule cong :premises (@p386 @p385) :args (@t241)) % 0.40/0.67 (step @p388 :rule refl :args (tptp.nonemptyImpWitness)) % 0.40/0.67 (step @p389 :rule cong :premises (@p388 @p387) :args (@t242)) % 0.40/0.67 (step @p390 :rule refl :args (tptp.exuE2)) % 0.40/0.67 (step @p391 :rule cong :premises (@p390 @p389) :args (@t243)) % 0.40/0.67 (step @p392 :rule refl :args (tptp.subPowSU)) % 0.40/0.67 (step @p393 :rule cong :premises (@p392 @p391) :args (@t244)) % 0.40/0.67 (step @p394 :rule refl :args (tptp.setunionE)) % 0.40/0.67 (step @p395 :rule cong :premises (@p394 @p393) :args (@t245)) % 0.40/0.67 (step @p396 :rule refl :args (tptp.setunionI)) % 0.40/0.67 (step @p397 :rule cong :premises (@p396 @p395) :args (@t246)) % 0.40/0.67 (step @p398 :rule refl :args (tptp.powersetE)) % 0.40/0.67 (step @p399 :rule cong :premises (@p398 @p397) :args (@t247)) % 0.40/0.67 (step @p400 :rule refl :args (tptp.emptyInPowerset)) % 0.40/0.67 (step @p401 :rule cong :premises (@p400 @p399) :args (@t248)) % 0.40/0.67 (step @p402 :rule refl :args (tptp.emptyinPowerset)) % 0.40/0.67 (step @p403 :rule cong :premises (@p402 @p401) :args (@t249)) % 0.40/0.67 (step @p404 :rule refl :args (tptp.powersetI)) % 0.40/0.67 (step @p405 :rule cong :premises (@p404 @p403) :args (@t250)) % 0.40/0.67 (step @p406 :rule refl :args (tptp.setoftrueEq)) % 0.40/0.67 (step @p407 :rule cong :premises (@p406 @p405) :args (@t251)) % 0.40/0.67 (step @p408 :rule refl :args (tptp.setadjoinOr)) % 0.40/0.67 (step @p409 :rule cong :premises (@p408 @p407) :args (@t252)) % 0.40/0.67 (step @p410 :rule refl :args (tptp.setadjoinE)) % 0.40/0.67 (step @p411 :rule cong :premises (@p410 @p409) :args (@t253)) % 0.40/0.67 (step @p412 :rule refl :args (tptp.setadjoinIR)) % 0.40/0.67 (step @p413 :rule cong :premises (@p412 @p411) :args (@t254)) % 0.40/0.67 (step @p414 :rule refl :args (tptp.emptyinunitempty)) % 0.40/0.67 (step @p415 :rule cong :premises (@p414 @p413) :args (@t255)) % 0.40/0.67 (step @p416 :rule refl :args (tptp.setadjoinIL)) % 0.40/0.67 (step @p417 :rule cong :premises (@p416 @p415) :args (@t256)) % 0.40/0.67 (step @p418 :rule refl :args (tptp.nonemptyI1)) % 0.40/0.67 (step @p419 :rule cong :premises (@p418 @p417) :args (@t257)) % 0.40/0.67 (step @p420 :rule refl :args (tptp.nonemptyI)) % 0.40/0.67 (step @p421 :rule cong :premises (@p420 @p419) :args (@t258)) % 0.40/0.67 (step @p422 :rule refl :args (tptp.nonemptyE1)) % 0.40/0.67 (step @p423 :rule cong :premises (@p422 @p421) :args (@t259)) % 0.40/0.67 (step @p424 :rule refl :args (tptp.setbeta)) % 0.40/0.67 (step @p425 :rule cong :premises (@p424 @p423) :args (@t260)) % 0.40/0.67 (step @p426 :rule refl :args (tptp.noeltsimpempty)) % 0.40/0.67 (step @p427 :rule cong :premises (@p426 @p425) :args (@t261)) % 0.40/0.67 (step @p428 :rule refl :args (tptp.emptyI)) % 0.40/0.67 (step @p429 :rule cong :premises (@p428 @p427) :args (@t262)) % 0.40/0.67 (step @p430 :rule refl :args (tptp.setext)) % 0.40/0.67 (step @p431 :rule cong :premises (@p430 @p429) :args (@t263)) % 0.40/0.67 (step @p432 :rule refl :args (tptp.exuE3e)) % 0.40/0.67 (step @p433 :rule cong :premises (@p432 @p431) :args (@t264)) % 0.40/0.67 (step @p434 :rule refl :args (tptp.notinemptyset)) % 0.40/0.67 (step @p435 :rule cong :premises (@p434 @p433) :args (@t265)) % 0.40/0.67 (step @p436 :rule refl :args (tptp.emptysetimpfalse)) % 0.40/0.67 (step @p437 :rule cong :premises (@p436 @p435) :args (@t266)) % 0.40/0.67 (step @p438 :rule refl :args (tptp.emptysetE)) % 0.40/0.67 (step @p439 :rule cong :premises (@p438 @p437) :args (@t267)) % 0.40/0.67 (step @p440 :rule refl :args (tptp.prop2setE)) % 0.40/0.67 (step @p441 :rule cong :premises (@p440 @p439) :args (@t268)) % 0.40/0.67 (step @p442 :rule refl :args (tptp.exuE1)) % 0.40/0.67 (step @p443 :rule cong :premises (@p442 @p441) :args (@t269)) % 0.40/0.67 (step @p444 :rule refl :args (tptp.dsetconstrER)) % 0.40/0.67 (step @p445 :rule cong :premises (@p444 @p443) :args (@t270)) % 0.40/0.67 (step @p446 :rule refl :args (tptp.dsetconstrEL)) % 0.40/0.67 (step @p447 :rule cong :premises (@p446 @p445) :args (@t271)) % 0.40/0.67 (step @p448 :rule refl :args (tptp.dsetconstrI)) % 0.40/0.67 (step @p449 :rule cong :premises (@p448 @p447) :args (@t272)) % 0.40/0.67 (step @p450 :rule refl :args (tptp.descrp)) % 0.40/0.67 (step @p451 :rule cong :premises (@p450 @p449) :args (@t273)) % 0.40/0.67 (step @p452 :rule refl :args (tptp.wellorderingAx)) % 0.40/0.67 (step @p453 :rule cong :premises (@p452 @p451) :args (@t274)) % 0.40/0.67 (step @p454 :rule refl :args (tptp.foundationAx)) % 0.40/0.67 (step @p455 :rule cong :premises (@p454 @p453) :args (@t275)) % 0.40/0.67 (step @p456 :rule refl :args (tptp.replAx)) % 0.40/0.67 (step @p457 :rule cong :premises (@p456 @p455) :args (@t276)) % 0.40/0.67 (step @p458 :rule refl :args (tptp.omegaIndAx)) % 0.40/0.67 (step @p459 :rule cong :premises (@p458 @p457) :args (@t277)) % 0.40/0.67 (step @p460 :rule refl :args (tptp.omegaSAx)) % 0.40/0.67 (step @p461 :rule cong :premises (@p460 @p459) :args (@t278)) % 0.40/0.67 (step @p462 :rule refl :args (tptp.omega0Ax)) % 0.40/0.67 (step @p463 :rule cong :premises (@p462 @p461) :args (@t279)) % 0.40/0.67 (step @p464 :rule refl :args (tptp.setunionAx)) % 0.40/0.67 (step @p465 :rule cong :premises (@p464 @p463) :args (@t280)) % 0.40/0.67 (step @p466 :rule refl :args (tptp.powersetAx)) % 0.40/0.67 (step @p467 :rule cong :premises (@p466 @p465) :args (@t281)) % 0.40/0.67 (step @p468 :rule refl :args (tptp.setadjoinAx)) % 0.40/0.67 (step @p469 :rule cong :premises (@p468 @p467) :args (@t282)) % 0.40/0.67 (step @p470 :rule refl :args (tptp.emptysetAx)) % 0.40/0.67 (step @p471 :rule cong :premises (@p470 @p469) :args (@t283)) % 0.40/0.67 (step @p472 :rule refl :args (tptp.setextAx)) % 0.40/0.67 (step @p473 :rule cong :premises (@p472 @p471) :args (@t284)) % 0.40/0.67 (step @p474 :rule cong :premises (@p473) :args (@t285)) % 0.40/0.67 (step @p475 :rule eq_resolve :premises (@p141 @p474)) % 0.40/0.67 (step @p476 :rule not_implies_elim2 :premises (@p475)) % 0.40/0.67 (step @p477 :rule not_implies_elim2 :premises (@p476)) % 0.40/0.67 (step @p478 :rule not_implies_elim2 :premises (@p477)) % 0.40/0.67 (step @p479 :rule not_implies_elim2 :premises (@p478)) % 0.40/0.67 (step @p480 :rule not_implies_elim2 :premises (@p479)) % 0.40/0.67 (step @p481 :rule not_implies_elim2 :premises (@p480)) % 0.40/0.67 (step @p482 :rule not_implies_elim2 :premises (@p481)) % 0.40/0.67 (step @p483 :rule not_implies_elim2 :premises (@p482)) % 0.40/0.67 (step @p484 :rule not_implies_elim2 :premises (@p483)) % 0.40/0.67 (step @p485 :rule not_implies_elim2 :premises (@p484)) % 0.40/0.67 (step @p486 :rule not_implies_elim2 :premises (@p485)) % 0.40/0.67 (step @p487 :rule not_implies_elim2 :premises (@p486)) % 0.40/0.67 (step @p488 :rule not_implies_elim2 :premises (@p487)) % 0.40/0.67 (step @p489 :rule not_implies_elim2 :premises (@p488)) % 0.40/0.67 (step @p490 :rule not_implies_elim2 :premises (@p489)) % 0.40/0.67 (step @p491 :rule not_implies_elim2 :premises (@p490)) % 0.40/0.67 (step @p492 :rule not_implies_elim2 :premises (@p491)) % 0.40/0.67 (step @p493 :rule not_implies_elim2 :premises (@p492)) % 0.40/0.67 (step @p494 :rule not_implies_elim2 :premises (@p493)) % 0.40/0.67 (step @p495 :rule not_implies_elim2 :premises (@p494)) % 0.40/0.67 (step @p496 :rule not_implies_elim2 :premises (@p495)) % 0.40/0.67 (step @p497 :rule not_implies_elim2 :premises (@p496)) % 0.40/0.67 (step @p498 :rule not_implies_elim2 :premises (@p497)) % 0.40/0.67 (step @p499 :rule not_implies_elim2 :premises (@p498)) % 0.40/0.67 (step @p500 :rule not_implies_elim2 :premises (@p499)) % 0.40/0.67 (step @p501 :rule not_implies_elim2 :premises (@p500)) % 0.40/0.67 (step @p502 :rule not_implies_elim2 :premises (@p501)) % 0.40/0.67 (step @p503 :rule not_implies_elim2 :premises (@p502)) % 0.40/0.67 (step @p504 :rule not_implies_elim2 :premises (@p503)) % 0.40/0.67 (step @p505 :rule not_implies_elim2 :premises (@p504)) % 0.40/0.67 (step @p506 :rule not_implies_elim2 :premises (@p505)) % 0.40/0.67 (step @p507 :rule not_implies_elim2 :premises (@p506)) % 0.40/0.67 (step @p508 :rule not_implies_elim2 :premises (@p507)) % 0.40/0.67 (step @p509 :rule not_implies_elim2 :premises (@p508)) % 0.40/0.67 (step @p510 :rule not_implies_elim2 :premises (@p509)) % 0.40/0.67 (step @p511 :rule not_implies_elim2 :premises (@p510)) % 0.40/0.67 (step @p512 :rule not_implies_elim2 :premises (@p511)) % 0.40/0.67 (step @p513 :rule not_implies_elim2 :premises (@p512)) % 0.40/0.67 (step @p514 :rule not_implies_elim2 :premises (@p513)) % 0.40/0.67 (step @p515 :rule not_implies_elim2 :premises (@p514)) % 0.40/0.67 (step @p516 :rule not_implies_elim2 :premises (@p515)) % 0.40/0.67 (step @p517 :rule not_implies_elim2 :premises (@p516)) % 0.40/0.67 (step @p518 :rule not_implies_elim2 :premises (@p517)) % 0.40/0.67 (step @p519 :rule not_implies_elim2 :premises (@p518)) % 0.40/0.67 (step @p520 :rule not_implies_elim2 :premises (@p519)) % 0.40/0.67 (step @p521 :rule not_implies_elim2 :premises (@p520)) % 0.40/0.67 (step @p522 :rule not_implies_elim2 :premises (@p521)) % 0.40/0.67 (step @p523 :rule not_implies_elim2 :premises (@p522)) % 0.40/0.67 (step @p524 :rule not_implies_elim2 :premises (@p523)) % 0.40/0.67 (step @p525 :rule not_implies_elim2 :premises (@p524)) % 0.40/0.67 (step @p526 :rule not_implies_elim2 :premises (@p525)) % 0.40/0.67 (step @p527 :rule not_implies_elim2 :premises (@p526)) % 0.40/0.67 (step @p528 :rule not_implies_elim2 :premises (@p527)) % 0.40/0.67 (step @p529 :rule not_implies_elim2 :premises (@p528)) % 0.40/0.67 (step @p530 :rule not_implies_elim2 :premises (@p529)) % 0.40/0.67 (step @p531 :rule not_implies_elim2 :premises (@p530)) % 0.40/0.67 (step @p532 :rule not_implies_elim2 :premises (@p531)) % 0.40/0.67 (step @p533 :rule not_implies_elim2 :premises (@p532)) % 0.40/0.67 (step @p534 :rule not_implies_elim2 :premises (@p533)) % 0.40/0.67 (step @p535 :rule not_implies_elim2 :premises (@p534)) % 0.40/0.67 (step @p536 :rule not_implies_elim2 :premises (@p535)) % 0.40/0.67 (step @p537 :rule not_implies_elim2 :premises (@p536)) % 0.40/0.67 (step @p538 :rule not_implies_elim2 :premises (@p537)) % 0.40/0.67 (step @p539 :rule not_implies_elim2 :premises (@p538)) % 0.40/0.67 (step @p540 :rule not_implies_elim2 :premises (@p539)) % 0.40/0.67 (step @p541 :rule not_implies_elim2 :premises (@p540)) % 0.40/0.67 (step @p542 :rule not_implies_elim2 :premises (@p541)) % 0.40/0.67 (step @p543 :rule not_implies_elim2 :premises (@p542)) % 0.40/0.67 (step @p544 :rule not_implies_elim2 :premises (@p543)) % 0.40/0.67 (step @p545 :rule not_implies_elim2 :premises (@p544)) % 0.40/0.67 (step @p546 :rule not_implies_elim2 :premises (@p545)) % 0.40/0.67 (step @p547 :rule not_implies_elim2 :premises (@p546)) % 0.40/0.67 (step @p548 :rule not_implies_elim2 :premises (@p547)) % 0.40/0.67 (step @p549 :rule not_implies_elim2 :premises (@p548)) % 0.40/0.67 (step @p550 :rule not_implies_elim2 :premises (@p549)) % 0.40/0.67 (step @p551 :rule not_implies_elim2 :premises (@p550)) % 0.40/0.67 (step @p552 :rule not_implies_elim2 :premises (@p551)) % 0.40/0.67 (step @p553 :rule not_implies_elim2 :premises (@p552)) % 0.40/0.67 (step @p554 :rule not_implies_elim2 :premises (@p553)) % 0.40/0.67 (step @p555 :rule not_implies_elim2 :premises (@p554)) % 0.40/0.67 (step @p556 :rule not_implies_elim2 :premises (@p555)) % 0.40/0.67 (step @p557 :rule not_implies_elim2 :premises (@p556)) % 0.40/0.67 (step @p558 :rule not_implies_elim2 :premises (@p557)) % 0.40/0.67 (step @p559 :rule not_implies_elim2 :premises (@p558)) % 0.40/0.67 (step @p560 :rule not_implies_elim2 :premises (@p559)) % 0.40/0.67 (step @p561 :rule not_implies_elim2 :premises (@p560)) % 0.40/0.67 (step @p562 :rule not_implies_elim2 :premises (@p561)) % 0.40/0.67 (step @p563 :rule not_implies_elim2 :premises (@p562)) % 0.40/0.67 (step @p564 :rule not_implies_elim2 :premises (@p563)) % 0.40/0.67 (step @p565 :rule not_implies_elim2 :premises (@p564)) % 0.40/0.67 (step @p566 :rule not_implies_elim2 :premises (@p565)) % 0.40/0.67 (step @p567 :rule not_implies_elim2 :premises (@p566)) % 0.40/0.67 (step @p568 :rule not_implies_elim2 :premises (@p567)) % 0.40/0.67 (step @p569 :rule not_implies_elim2 :premises (@p568)) % 0.40/0.67 (step @p570 :rule not_implies_elim2 :premises (@p569)) % 0.40/0.67 (step @p571 :rule not_implies_elim2 :premises (@p570)) % 0.40/0.67 (step @p572 :rule not_implies_elim2 :premises (@p571)) % 0.40/0.67 (step @p573 :rule not_implies_elim2 :premises (@p572)) % 0.40/0.67 (step @p574 :rule not_implies_elim2 :premises (@p573)) % 0.40/0.67 (step @p575 :rule not_implies_elim2 :premises (@p574)) % 0.40/0.67 (step @p576 :rule not_implies_elim2 :premises (@p575)) % 0.40/0.67 (step @p577 :rule not_implies_elim2 :premises (@p576)) % 0.40/0.67 (step @p578 :rule not_implies_elim2 :premises (@p577)) % 0.40/0.67 (step @p579 :rule not_implies_elim2 :premises (@p578)) % 0.40/0.67 (step @p580 :rule not_implies_elim2 :premises (@p579)) % 0.40/0.67 (step @p581 :rule not_implies_elim2 :premises (@p580)) % 0.40/0.67 (step @p582 :rule not_implies_elim2 :premises (@p581)) % 0.40/0.67 (step @p583 :rule not_implies_elim2 :premises (@p582)) % 0.40/0.67 (step @p584 :rule not_implies_elim2 :premises (@p583)) % 0.40/0.67 (step @p585 :rule not_implies_elim2 :premises (@p584)) % 0.40/0.67 (step @p586 :rule not_implies_elim2 :premises (@p585)) % 0.40/0.67 (step @p587 :rule not_implies_elim2 :premises (@p586)) % 0.40/0.67 (step @p588 :rule not_implies_elim2 :premises (@p587)) % 0.40/0.67 (step @p589 :rule not_implies_elim2 :premises (@p588)) % 0.40/0.67 (step @p590 :rule not_implies_elim2 :premises (@p589)) % 0.40/0.67 (step @p591 :rule not_implies_elim2 :premises (@p590)) % 0.40/0.67 (step @p592 :rule not_implies_elim2 :premises (@p591)) % 0.40/0.67 (step @p593 :rule not_implies_elim2 :premises (@p592)) % 0.40/0.67 (step @p594 :rule not_implies_elim2 :premises (@p593)) % 0.40/0.67 (step @p595 :rule not_implies_elim2 :premises (@p594)) % 0.40/0.67 (step @p596 :rule not_implies_elim2 :premises (@p595)) % 0.40/0.67 (step @p597 :rule not_implies_elim2 :premises (@p596)) % 0.40/0.67 (step @p598 :rule not_implies_elim2 :premises (@p597)) % 0.40/0.67 (step @p599 :rule not_implies_elim2 :premises (@p598)) % 0.40/0.67 (step @p600 :rule not_implies_elim2 :premises (@p599)) % 0.40/0.67 (step @p601 :rule not_implies_elim2 :premises (@p600)) % 0.40/0.67 (step @p602 :rule not_implies_elim2 :premises (@p601)) % 0.40/0.67 (step @p603 :rule not_implies_elim2 :premises (@p602)) % 0.40/0.67 (step @p604 :rule not_implies_elim2 :premises (@p603)) % 0.40/0.67 (step @p605 :rule not_implies_elim2 :premises (@p604)) % 0.40/0.67 (step @p606 :rule not_implies_elim2 :premises (@p605)) % 0.40/0.67 (step @p607 :rule not_implies_elim2 :premises (@p606)) % 0.40/0.67 (step @p608 :rule not_implies_elim2 :premises (@p607)) % 0.40/0.67 (step @p609 :rule not_implies_elim2 :premises (@p608)) % 0.40/0.67 (step @p610 :rule not_implies_elim2 :premises (@p609)) % 0.40/0.67 (step @p611 :rule not_implies_elim2 :premises (@p610)) % 0.40/0.67 (step @p612 :rule not_implies_elim2 :premises (@p611)) % 0.40/0.67 (step @p613 :rule not_implies_elim2 :premises (@p612)) % 0.40/0.67 (step @p614 :rule not_implies_elim2 :premises (@p613)) % 0.40/0.67 (step @p615 :rule not_implies_elim2 :premises (@p614)) % 0.40/0.67 (step @p616 :rule cong :premises (@p378 @p193) :args (@t91)) % 0.40/0.67 (step @p617 :rule eq_resolve :premises (@p48 @p616)) % 0.40/0.67 (step @p618 :rule not_implies_elim1 :premises (@p522)) % 0.40/0.67 (step @p619 :rule eq_resolve :premises (@p618 @p617)) % 0.40/0.67 (step @p620 false :rule contra :premises (@p619 @p615)) % 0.40/0.67 ) % 0.40/0.67 % SZS output end Proof % 0.40/0.67 % cvc5 exiting %------------------------------------------------------------------------------