TSTP Solution File: NUM653^4 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM653^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.xXDsSbKYoM true
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 12:43:07 EDT 2023
% Result : Theorem 10.49s 1.99s
% Output : Refutation 10.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM653^4 : TPTP v8.1.2. Released v7.1.0.
% 0.16/0.15 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.xXDsSbKYoM true
% 0.16/0.37 % Computer : n010.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri Aug 25 17:39:35 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.16/0.37 % Running portfolio for 300 s
% 0.16/0.37 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.37 % Number of cores: 8
% 0.16/0.38 % Python version: Python 3.6.8
% 0.16/0.38 % Running in HO mode
% 0.24/0.70 % Total configuration time : 828
% 0.24/0.70 % Estimated wc time : 1656
% 0.24/0.70 % Estimated cpu time (8 cpus) : 207.0
% 0.24/0.74 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.24/0.77 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.24/0.77 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.24/0.77 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.24/0.82 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.24/0.83 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.24/0.83 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 1.64/0.87 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 3.07/1.19 % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 10.49/1.99 % Solved by lams/40_b.comb.sh.
% 10.49/1.99 % done 143 iterations in 1.101s
% 10.49/1.99 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 10.49/1.99 % SZS output start Refutation
% 10.49/1.99 thf(d_29_ii_type, type, d_29_ii: $i > $i > $o).
% 10.49/1.99 thf(nat_type, type, nat: $i).
% 10.49/1.99 thf(moreis_type, type, moreis: $i > $i > $o).
% 10.49/1.99 thf(lessis_type, type, lessis: $i > $i > $o).
% 10.49/1.99 thf(is_of_type, type, is_of: $i > ($i > $o) > $o).
% 10.49/1.99 thf(in_type, type, in: $i > $i > $o).
% 10.49/1.99 thf(l_some_type, type, l_some: $i > ($i > $o) > $o).
% 10.49/1.99 thf(d_Sep_type, type, d_Sep: $i > ($i > $o) > $i).
% 10.49/1.99 thf('#sk2_type', type, '#sk2': $i).
% 10.49/1.99 thf(emptyset_type, type, emptyset: $i).
% 10.49/1.99 thf(n_is_type, type, n_is: $i > $i > $o).
% 10.49/1.99 thf(imp_type, type, imp: $o > $o > $o).
% 10.49/1.99 thf(omega_type, type, omega: $i).
% 10.49/1.99 thf(all_of_type, type, all_of: ($i > $o) > ($i > $o) > $o).
% 10.49/1.99 thf(diffprop_type, type, diffprop: $i > $i > $i > $o).
% 10.49/1.99 thf(n_some_type, type, n_some: ($i > $o) > $o).
% 10.49/1.99 thf(l_or_type, type, l_or: $o > $o > $o).
% 10.49/1.99 thf(d_not_type, type, d_not: $o > $o).
% 10.49/1.99 thf('#sk3_type', type, '#sk3': $i).
% 10.49/1.99 thf(iii_type, type, iii: $i > $i > $o).
% 10.49/1.99 thf(e_is_type, type, e_is: $i > $i > $i > $o).
% 10.49/1.99 thf(s_comb_type, type, '#S': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > (A > B) > A > C)).
% 10.49/1.99 thf(c_comb_type, type, '#C': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > B > A > C)).
% 10.49/1.99 thf(b_comb_type, type, '#B': !>[A:$tType, B:$tType, C:$tType]: ((A > B) > (C > A) > C > B)).
% 10.49/1.99 thf(k_comb_type, type, '#K': !>[A:$tType, B:$tType]: (B > A > B)).
% 10.49/1.99 thf(i_comb_type, type, '#I': !>[A:$tType]: (A > A)).
% 10.49/1.99 thf(satz10d, conjecture,
% 10.49/1.99 (all_of @
% 10.49/1.99 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 10.49/1.99 ( ^[X0:$i]:
% 10.49/1.99 ( all_of @
% 10.49/1.99 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 10.49/1.99 ( ^[X1:$i]:
% 10.49/1.99 ( ( lessis @ X0 @ X1 ) => ( d_not @ ( d_29_ii @ X0 @ X1 ) ) ) ) ) ))).
% 10.49/1.99 thf(zf_stmt_0, negated_conjecture,
% 10.49/1.99 (~( all_of @
% 10.49/1.99 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 10.49/1.99 ( ^[X0:$i]:
% 10.49/1.99 ( all_of @
% 10.49/1.99 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 10.49/1.99 ( ^[X1:$i]:
% 10.49/1.99 ( ( lessis @ X0 @ X1 ) => ( d_not @ ( d_29_ii @ X0 @ X1 ) ) ) ) ) ) )),
% 10.49/1.99 inference('cnf.neg', [status(esa)], [satz10d])).
% 10.49/1.99 thf(zip_derived_cl95, plain,
% 10.49/1.99 (~ (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @
% 10.49/1.99 (^[Y0 : $i]:
% 10.49/1.99 (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @
% 10.49/1.99 (^[Y1 : $i]:
% 10.49/1.99 (((lessis @ Y0 @ Y1) => (d_not @ (d_29_ii @ Y0 @ Y1))))))))),
% 10.49/1.99 inference('cnf', [status(esa)], [zf_stmt_0])).
% 10.49/1.99 thf(zip_derived_cl96, plain,
% 10.49/1.99 (~ (all_of @ ((('#C') @ in @ nat)) @
% 10.49/1.99 ((('#B') @ (all_of @ ((('#C') @ in @ nat))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ lessis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ d_29_ii)))))))),
% 10.49/1.99 inference('lams2combs', [status(thm)], [zip_derived_cl95])).
% 10.49/1.99 thf(def_nat, axiom,(( nat ) =
% 10.49/1.99 ((d_Sep @ omega @ (^[Y0 : $i]: (((Y0) != (emptyset)))))))).
% 10.49/1.99 thf('0', plain,
% 10.49/1.99 (( nat ) = ( d_Sep @ omega @ ( ^[V_1:$i]: ( ( V_1 ) != ( emptyset ) ) ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(zip_derived_cl163, plain,
% 10.49/1.99 (~ (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#B') @ (all_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ lessis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ d_29_ii)))))))),
% 10.49/1.99 inference('rw', [status(thm)], [zip_derived_cl96, '0'])).
% 10.49/1.99 thf(def_all_of, axiom, ~ (all_of @ X0 @ X1) =>
% 10.49/1.99 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) != ($true))).
% 10.49/1.99 thf('1', plain,
% 10.49/1.99 (![X0:( $i > $o ),X1:( $i > $o )]:
% 10.49/1.99 ( ( ~( all_of @ X0 @ X1 ) ) <=>
% 10.49/1.99 ( ~( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) ) )),
% 10.49/1.99 inference('rw.lit', [status(esa)], [def_all_of])).
% 10.49/1.99 thf(zip_derived_cl164, plain,
% 10.49/1.99 (~ (((!!) @ (^[Y0 : $i]:
% 10.49/1.99 (((is_of @ Y0 @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 ((('#B') @ (all_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @
% 10.49/1.99 ((('#C') @ (!=) @ emptyset)))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ lessis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ d_29_ii)))) @
% 10.49/1.99 Y0)))))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl163, '1'])).
% 10.49/1.99 thf(zip_derived_cl165, plain,
% 10.49/1.99 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 10.49/1.99 ((('#C') @ is_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @
% 10.49/1.99 ((('#C') @ (!=) @ emptyset))))))))) @
% 10.49/1.99 ((('#B') @ (all_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ lessis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ d_29_ii))))))))))),
% 10.49/1.99 inference('comb-normalize', [status(thm)], [zip_derived_cl164])).
% 10.49/1.99 thf(zip_derived_cl166, plain,
% 10.49/1.99 (~ (((is_of @ '#sk2' @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (lessis @ '#sk2'))) @
% 10.49/1.99 ((('#B') @ d_not @ (d_29_ii @ '#sk2'))))))))),
% 10.49/1.99 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl165])).
% 10.49/1.99 thf(def_is_of, axiom,(( is_of @ (X1)@ (X0)) = ((X0 @ X1)))).
% 10.49/1.99 thf('2', plain,
% 10.49/1.99 (![X0:( $i > $o ),X1:$i]: ( ( is_of @ X1 @ X0 ) = ( X0 @ X1 ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(zip_derived_cl167, plain,
% 10.49/1.99 (~ (((in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 10.49/1.99 (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (lessis @ '#sk2'))) @
% 10.49/1.99 ((('#B') @ d_not @ (d_29_ii @ '#sk2'))))))))),
% 10.49/1.99 inference('rw', [status(thm)], [zip_derived_cl166, '2'])).
% 10.49/1.99 thf(zip_derived_cl169, plain,
% 10.49/1.99 (~ (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (lessis @ '#sk2'))) @
% 10.49/1.99 ((('#B') @ d_not @ (d_29_ii @ '#sk2'))))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl167])).
% 10.49/1.99 thf(zip_derived_cl170, plain,
% 10.49/1.99 (~ (((!!) @ (^[Y0 : $i]:
% 10.49/1.99 (((is_of @ Y0 @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (lessis @ '#sk2'))) @
% 10.49/1.99 ((('#B') @ d_not @ (d_29_ii @ '#sk2'))) @ Y0)))))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl169, '1'])).
% 10.49/1.99 thf(zip_derived_cl171, plain,
% 10.49/1.99 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 10.49/1.99 ((('#C') @ is_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @
% 10.49/1.99 ((('#C') @ (!=) @ emptyset))))))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (lessis @ '#sk2'))) @
% 10.49/1.99 ((('#B') @ d_not @ (d_29_ii @ '#sk2')))))))))),
% 10.49/1.99 inference('comb-normalize', [status(thm)], [zip_derived_cl170])).
% 10.49/1.99 thf(zip_derived_cl172, plain,
% 10.49/1.99 (~ (((is_of @ '#sk3' @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 (((lessis @ '#sk2' @ '#sk3') => (d_not @
% 10.49/1.99 (d_29_ii @ '#sk2' @ '#sk3'))))))),
% 10.49/1.99 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl171])).
% 10.49/1.99 thf(def_d_not, axiom,(( d_not @ (X0)) = ((imp @ X0 @ ($false))))).
% 10.49/1.99 thf('3', plain, (![X0:$o]: ( ( d_not @ X0 ) = ( imp @ X0 @ $false ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_l_or, axiom,(( l_or @ (X0)@ (X1)) = ((imp @ (d_not @ X0) @ X1)))).
% 10.49/1.99 thf('4', plain,
% 10.49/1.99 (![X1:$o,X0:$o]: ( ( l_or @ X0 @ X1 ) = ( imp @ ( d_not @ X0 ) @ X1 ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_e_is, axiom,(( e_is @ (X2)@ (X0)@ (X1)) = ((((X0) = (X1)))))).
% 10.49/1.99 thf('5', plain,
% 10.49/1.99 (![X2:$i,X1:$i,X0:$i]: ( ( e_is @ X2 @ X0 @ X1 ) = ( ( X0 ) = ( X1 ) ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_n_is, axiom,(( n_is @ (X0)@ (X1)) = ((e_is @ nat @ X0 @ X1)))).
% 10.49/1.99 thf('6', plain,
% 10.49/1.99 (![X1:$i,X0:$i]: ( ( n_is @ X0 @ X1 ) = ( e_is @ nat @ X0 @ X1 ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_n_some, axiom,(( n_some @ (X0)) = ((l_some @ nat @ X0)))).
% 10.49/1.99 thf('7', plain,
% 10.49/1.99 (![X0:( $i > $o )]: ( ( n_some @ X0 ) = ( l_some @ nat @ X0 ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_d_29_ii, axiom,(( d_29_ii @ (X0)@ (X1)) =
% 10.49/1.99 ((n_some @ (diffprop @ X0 @ X1))))).
% 10.49/1.99 thf('8', plain,
% 10.49/1.99 (![X1:$i,X0:$i]:
% 10.49/1.99 ( ( d_29_ii @ X0 @ X1 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_iii, axiom,(( iii @ (X1)@ (X0)) = ((n_some @ (diffprop @ X0 @ X1))))).
% 10.49/1.99 thf('9', plain,
% 10.49/1.99 (![X1:$i,X0:$i]:
% 10.49/1.99 ( ( iii @ X1 @ X0 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(def_lessis, axiom,(( lessis @ (X0)@ (X1)) =
% 10.49/1.99 ((l_or @ (iii @ X0 @ X1) @ (n_is @ X0 @ X1))))).
% 10.49/1.99 thf('10', plain,
% 10.49/1.99 (![X1:$i,X0:$i]:
% 10.49/1.99 ( ( lessis @ X0 @ X1 ) =
% 10.49/1.99 ( l_or @ ( iii @ X0 @ X1 ) @ ( n_is @ X0 @ X1 ) ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(zip_derived_cl173, plain,
% 10.49/1.99 (~ (((in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 10.49/1.99 (((imp @
% 10.49/1.99 (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) @
% 10.49/1.99 ($false)) @
% 10.49/1.99 ((('#sk2') = ('#sk3')))) => (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3')) @
% 10.49/1.99 ($false))))))),
% 10.49/1.99 inference('rw', [status(thm)],
% 10.49/1.99 [zip_derived_cl172, '2', '3', '3', '4', '5', '0', '6', '7',
% 10.49/1.99 '7', '8', '9', '10'])).
% 10.49/1.99 thf(zip_derived_cl175, plain,
% 10.49/1.99 (~ (((imp @
% 10.49/1.99 (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) @
% 10.49/1.99 ($false)) @
% 10.49/1.99 ((('#sk2') = ('#sk3')))) => (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3')) @
% 10.49/1.99 ($false))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl173])).
% 10.49/1.99 thf(zip_derived_cl176, plain,
% 10.49/1.99 ( (imp @
% 10.49/1.99 (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) @
% 10.49/1.99 ($false)) @
% 10.49/1.99 ((('#sk2') = ('#sk3'))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl175])).
% 10.49/1.99 thf(def_imp, axiom, (imp @ X0 @ X1) => ((((X0) => (X1))) = ($true))).
% 10.49/1.99 thf('11', plain,
% 10.49/1.99 (![X0:$o,X1:$o]: ( ( imp @ X0 @ X1 ) <=> ( ( X0 ) => ( X1 ) ) )),
% 10.49/1.99 inference('rw.lit', [status(esa)], [def_imp])).
% 10.49/1.99 thf(zip_derived_cl178, plain,
% 10.49/1.99 ( (((imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) @
% 10.49/1.99 ($false)) => ((('#sk2') = ('#sk3')))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl176, '11'])).
% 10.49/1.99 thf(zip_derived_cl180, plain,
% 10.49/1.99 ((~ (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) @
% 10.49/1.99 ($false))
% 10.49/1.99 | ((('#sk2') = ('#sk3'))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl178])).
% 10.49/1.99 thf(zip_derived_cl183, plain,
% 10.49/1.99 ((~ (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) @
% 10.49/1.99 ($false))
% 10.49/1.99 | (('#sk2') = ('#sk3')))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl180])).
% 10.49/1.99 thf(def_imp, axiom, ~ (imp @ X0 @ X1) => ((((X0) => (X1))) != ($true))).
% 10.49/1.99 thf('12', plain,
% 10.49/1.99 (![X0:$o,X1:$o]: ( ( ~( imp @ X0 @ X1 ) ) <=> ( ~( ( X0 ) => ( X1 ) ) ) )),
% 10.49/1.99 inference('rw.lit', [status(esa)], [def_imp])).
% 10.49/1.99 thf(zip_derived_cl184, plain,
% 10.49/1.99 ((~ (((l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2')) => ($false)))
% 10.49/1.99 | (('#sk2') = ('#sk3')))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl183, '12'])).
% 10.49/1.99 thf(zip_derived_cl185, plain,
% 10.49/1.99 ((~ (((~) @ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2'))))
% 10.49/1.99 | (('#sk2') = ('#sk3')))),
% 10.49/1.99 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl184])).
% 10.49/1.99 thf(zip_derived_cl186, plain,
% 10.49/1.99 (( (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk3' @ '#sk2'))
% 10.49/1.99 | (('#sk2') = ('#sk3')))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl185])).
% 10.49/1.99 thf(satz10c, axiom,
% 10.49/1.99 (all_of @
% 10.49/1.99 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 10.49/1.99 ( ^[X0:$i]:
% 10.49/1.99 ( all_of @
% 10.49/1.99 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 10.49/1.99 ( ^[X1:$i]: ( ( moreis @ X0 @ X1 ) => ( d_not @ ( iii @ X0 @ X1 ) ) ) ) ) ))).
% 10.49/1.99 thf(zip_derived_cl93, plain,
% 10.49/1.99 ( (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @
% 10.49/1.99 (^[Y0 : $i]:
% 10.49/1.99 (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @
% 10.49/1.99 (^[Y1 : $i]: (((moreis @ Y0 @ Y1) => (d_not @ (iii @ Y0 @ Y1))))))))),
% 10.49/1.99 inference('cnf', [status(esa)], [satz10c])).
% 10.49/1.99 thf(zip_derived_cl94, plain,
% 10.49/1.99 ( (all_of @ ((('#C') @ in @ nat)) @
% 10.49/1.99 ((('#B') @ (all_of @ ((('#C') @ in @ nat))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ iii)))))))),
% 10.49/1.99 inference('lams2combs', [status(thm)], [zip_derived_cl93])).
% 10.49/1.99 thf(zip_derived_cl315, plain,
% 10.49/1.99 ( (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#B') @ (all_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ iii)))))))),
% 10.49/1.99 inference('rw', [status(thm)], [zip_derived_cl94, '0'])).
% 10.49/1.99 thf(def_all_of, axiom, (all_of @ X0 @ X1) =>
% 10.49/1.99 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) = ($true))).
% 10.49/1.99 thf('13', plain,
% 10.49/1.99 (![X0:( $i > $o ),X1:( $i > $o )]:
% 10.49/1.99 ( ( all_of @ X0 @ X1 ) <=>
% 10.49/1.99 ( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) )),
% 10.49/1.99 inference('rw.lit', [status(esa)], [def_all_of])).
% 10.49/1.99 thf(zip_derived_cl316, plain,
% 10.49/1.99 ( (((!!) @ (^[Y0 : $i]:
% 10.49/1.99 (((is_of @ Y0 @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 ((('#B') @ (all_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @
% 10.49/1.99 ((('#C') @ (!=) @ emptyset)))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ iii)))) @
% 10.49/1.99 Y0)))))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl315, '13'])).
% 10.49/1.99 thf(zip_derived_cl317, plain,
% 10.49/1.99 ( (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 10.49/1.99 ((('#C') @ is_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))))))) @
% 10.49/1.99 ((('#B') @ (all_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ ('#S') @
% 10.49/1.99 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 10.49/1.99 ((('#B') @ ((('#B') @ d_not)) @ iii))))))))))),
% 10.49/1.99 inference('comb-normalize', [status(thm)], [zip_derived_cl316])).
% 10.49/1.99 thf(zip_derived_cl318, plain,
% 10.49/1.99 (![X2 : $i]:
% 10.49/1.99 (((is_of @ X2 @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (moreis @ X2))) @
% 10.49/1.99 ((('#B') @ d_not @ (iii @ X2))))))))),
% 10.49/1.99 inference('lazy_cnf_forall', [status(thm)], [zip_derived_cl317])).
% 10.49/1.99 thf(zip_derived_cl319, plain,
% 10.49/1.99 (![X2 : $i]:
% 10.49/1.99 (((in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 10.49/1.99 (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (moreis @ X2))) @
% 10.49/1.99 ((('#B') @ d_not @ (iii @ X2))))))))),
% 10.49/1.99 inference('rw', [status(thm)], [zip_derived_cl318, '2'])).
% 10.49/1.99 thf(zip_derived_cl320, plain,
% 10.49/1.99 (![X2 : $i]:
% 10.49/1.99 (~ (in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | (all_of @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (moreis @ X2))) @
% 10.49/1.99 ((('#B') @ d_not @ (iii @ X2)))))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl319])).
% 10.49/1.99 thf(zip_derived_cl321, plain,
% 10.49/1.99 (![X0 : $i]:
% 10.49/1.99 ( (((!!) @ (^[Y0 : $i]:
% 10.49/1.99 (((is_of @ Y0 @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (moreis @ X0))) @
% 10.49/1.99 ((('#B') @ d_not @ (iii @ X0))) @ Y0)))))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl320, '13'])).
% 10.49/1.99 thf(zip_derived_cl322, plain,
% 10.49/1.99 (![X0 : $i]:
% 10.49/1.99 ( (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 10.49/1.99 ((('#C') @ is_of @
% 10.49/1.99 ((('#C') @ in @
% 10.49/1.99 (d_Sep @ omega @
% 10.49/1.99 ((('#C') @ (!=) @ emptyset))))))))) @
% 10.49/1.99 ((('#S') @ ((('#B') @ (=>) @ (moreis @ X0))) @
% 10.49/1.99 ((('#B') @ d_not @ (iii @ X0)))))))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('comb-normalize', [status(thm)], [zip_derived_cl321])).
% 10.49/1.99 thf(zip_derived_cl323, plain,
% 10.49/1.99 (![X0 : $i, X2 : $i]:
% 10.49/1.99 ( (((is_of @ X2 @
% 10.49/1.99 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 10.49/1.99 (((moreis @ X0 @ X2) => (d_not @ (iii @ X0 @ X2))))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('lazy_cnf_forall', [status(thm)], [zip_derived_cl322])).
% 10.49/1.99 thf(def_moreis, axiom,(( moreis @ (X0)@ (X1)) =
% 10.49/1.99 ((l_or @ (d_29_ii @ X0 @ X1) @ (n_is @ X0 @ X1))))).
% 10.49/1.99 thf('14', plain,
% 10.49/1.99 (![X1:$i,X0:$i]:
% 10.49/1.99 ( ( moreis @ X0 @ X1 ) =
% 10.49/1.99 ( l_or @ ( d_29_ii @ X0 @ X1 ) @ ( n_is @ X0 @ X1 ) ) )),
% 10.49/1.99 define([status(thm)])).
% 10.49/1.99 thf(zip_derived_cl324, plain,
% 10.49/1.99 (![X0 : $i, X2 : $i]:
% 10.49/1.99 ( (((in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 10.49/1.99 (((imp @
% 10.49/1.99 (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X2)) @
% 10.49/1.99 ($false)) @
% 10.49/1.99 (((X0) = (X2)))) => (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X2 @ X0)) @
% 10.49/1.99 ($false))))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('rw', [status(thm)],
% 10.49/1.99 [zip_derived_cl323, '2', '3', '3', '4', '5', '0', '6', '7',
% 10.49/1.99 '7', '8', '9', '14'])).
% 10.49/1.99 thf(zip_derived_cl325, plain,
% 10.49/1.99 (![X0 : $i, X2 : $i]:
% 10.49/1.99 (~ (in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | (((imp @
% 10.49/1.99 (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X2)) @
% 10.49/1.99 ($false)) @
% 10.49/1.99 (((X0) = (X2)))) => (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X2 @ X0)) @
% 10.49/1.99 ($false))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl324])).
% 10.49/1.99 thf(zip_derived_cl326, plain,
% 10.49/1.99 (![X0 : $i, X2 : $i]:
% 10.49/1.99 (~ (imp @
% 10.49/1.99 (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X2)) @
% 10.49/1.99 ($false)) @
% 10.49/1.99 (((X0) = (X2))))
% 10.49/1.99 | (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X2 @ X0)) @
% 10.49/1.99 ($false))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl325])).
% 10.49/1.99 thf(zip_derived_cl327, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 (~ (((imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0)) @
% 10.49/1.99 ($false)) => (((X1) = (X0)))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1)) @
% 10.49/1.99 ($false)))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl326, '12'])).
% 10.49/1.99 thf(zip_derived_cl328, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 ( (((l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0)) => ($false)))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (((imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1)) @
% 10.49/1.99 ($false)) => (((X0) = (X1))))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl327, '11'])).
% 10.49/1.99 thf(zip_derived_cl329, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 ( (((~) @ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (((imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1)) @
% 10.49/1.99 ($false)) => (((X0) = (X1))))))),
% 10.49/1.99 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl328])).
% 10.49/1.99 thf(zip_derived_cl330, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 (~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (((imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1)) @
% 10.49/1.99 ($false)) => (((X0) = (X1))))))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl329])).
% 10.49/1.99 thf(zip_derived_cl331, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 ( (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1)) @
% 10.49/1.99 ($false))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0)))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl330])).
% 10.49/1.99 thf(zip_derived_cl333, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 ( (((l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1)) => ($false)))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl331, '11'])).
% 10.49/1.99 thf(zip_derived_cl335, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 ( (((~) @ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1))))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl333])).
% 10.49/1.99 thf(zip_derived_cl336, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 (~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X0 @ X1))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl335])).
% 10.49/1.99 thf(zip_derived_cl1703, plain,
% 10.49/1.99 (((('#sk2') = ('#sk3'))
% 10.49/1.99 | ~ (in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3')))),
% 10.49/1.99 inference('sup-', [status(thm)], [zip_derived_cl186, zip_derived_cl336])).
% 10.49/1.99 thf(zip_derived_cl168, plain,
% 10.49/1.99 ( (in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl167])).
% 10.49/1.99 thf(zip_derived_cl174, plain,
% 10.49/1.99 ( (in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl173])).
% 10.49/1.99 thf(zip_derived_cl177, plain,
% 10.49/1.99 (~ (imp @
% 10.49/1.99 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3')) @
% 10.49/1.99 ($false))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl175])).
% 10.49/1.99 thf(zip_derived_cl179, plain,
% 10.49/1.99 (~ (((l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3')) => ($false)))),
% 10.49/1.99 inference('rw_clause', [status(thm)], [zip_derived_cl177, '12'])).
% 10.49/1.99 thf(zip_derived_cl181, plain,
% 10.49/1.99 (~ (((~) @ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3'))))),
% 10.49/1.99 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl179])).
% 10.49/1.99 thf(zip_derived_cl182, plain,
% 10.49/1.99 ( (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3'))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl181])).
% 10.49/1.99 thf(zip_derived_cl1716, plain, ((('#sk2') = ('#sk3'))),
% 10.49/1.99 inference('demod', [status(thm)],
% 10.49/1.99 [zip_derived_cl1703, zip_derived_cl168, zip_derived_cl174,
% 10.49/1.99 zip_derived_cl182])).
% 10.49/1.99 thf(zip_derived_cl182, plain,
% 10.49/1.99 ( (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ '#sk2' @ '#sk3'))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl181])).
% 10.49/1.99 thf(zip_derived_cl332, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 (~ (((X0) = (X1)))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0)))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl330])).
% 10.49/1.99 thf(zip_derived_cl334, plain,
% 10.49/1.99 (![X0 : $i, X1 : $i]:
% 10.49/1.99 (((X0) != (X1))
% 10.49/1.99 | ~ (in @ X1 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 10.49/1.99 (diffprop @ X1 @ X0)))),
% 10.49/1.99 inference('simplify nested equalities', [status(thm)],
% 10.49/1.99 [zip_derived_cl332])).
% 10.49/1.99 thf(zip_derived_cl1687, plain,
% 10.49/1.99 ((~ (in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | ~ (in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 10.49/1.99 | (('#sk3') != ('#sk2')))),
% 10.49/1.99 inference('sup-', [status(thm)], [zip_derived_cl182, zip_derived_cl334])).
% 10.49/1.99 thf(zip_derived_cl174, plain,
% 10.49/1.99 ( (in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl173])).
% 10.49/1.99 thf(zip_derived_cl168, plain,
% 10.49/1.99 ( (in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))),
% 10.49/1.99 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl167])).
% 10.49/1.99 thf(zip_derived_cl1691, plain, ((('#sk3') != ('#sk2'))),
% 10.49/1.99 inference('demod', [status(thm)],
% 10.49/1.99 [zip_derived_cl1687, zip_derived_cl174, zip_derived_cl168])).
% 10.49/1.99 thf(zip_derived_cl1717, plain, ($false),
% 10.49/1.99 inference('simplify_reflect-', [status(thm)],
% 10.49/1.99 [zip_derived_cl1716, zip_derived_cl1691])).
% 10.49/1.99
% 10.49/1.99 % SZS output end Refutation
% 10.49/1.99
% 10.49/1.99
% 10.49/1.99 % Terminating...
% 10.79/2.10 % Runner terminated.
% 10.79/2.12 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------