TSTP Solution File: NUM660^4 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM660^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.HnCVWHpTlN true
% Computer : n009.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:12 EDT 2023
% Result : Theorem 1.16s 0.91s
% Output : Refutation 1.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM660^4 : TPTP v8.1.2. Released v7.1.0.
% 0.14/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.HnCVWHpTlN true
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 10:16:50 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running portfolio for 300 s
% 0.14/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35 % Number of cores: 8
% 0.14/0.35 % Python version: Python 3.6.8
% 0.14/0.35 % Running in HO mode
% 0.62/0.66 % Total configuration time : 828
% 0.62/0.66 % Estimated wc time : 1656
% 0.62/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.62/0.74 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.62/0.75 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.62/0.75 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 1.02/0.76 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 1.02/0.76 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 1.02/0.76 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 1.02/0.76 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 1.02/0.76 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 1.03/0.79 % /export/starexec/sandbox/solver/bin/lams/30_b.l.sh running for 90s
% 1.16/0.91 % Solved by lams/40_b.comb.sh.
% 1.16/0.91 % done 0 iterations in 0.118s
% 1.16/0.91 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.16/0.91 % SZS output start Refutation
% 1.16/0.91 thf(d_29_ii_type, type, d_29_ii: $i > $i > $o).
% 1.16/0.91 thf('#sk2_type', type, '#sk2': $i).
% 1.16/0.91 thf('#sk3_type', type, '#sk3': $i).
% 1.16/0.91 thf(nat_type, type, nat: $i).
% 1.16/0.91 thf(moreis_type, type, moreis: $i > $i > $o).
% 1.16/0.91 thf(lessis_type, type, lessis: $i > $i > $o).
% 1.16/0.91 thf(is_of_type, type, is_of: $i > ($i > $o) > $o).
% 1.16/0.91 thf(in_type, type, in: $i > $i > $o).
% 1.16/0.91 thf(l_some_type, type, l_some: $i > ($i > $o) > $o).
% 1.16/0.91 thf(d_Sep_type, type, d_Sep: $i > ($i > $o) > $i).
% 1.16/0.91 thf(emptyset_type, type, emptyset: $i).
% 1.16/0.91 thf(n_is_type, type, n_is: $i > $i > $o).
% 1.16/0.91 thf(imp_type, type, imp: $o > $o > $o).
% 1.16/0.91 thf(omega_type, type, omega: $i).
% 1.16/0.91 thf(all_of_type, type, all_of: ($i > $o) > ($i > $o) > $o).
% 1.16/0.91 thf(diffprop_type, type, diffprop: $i > $i > $i > $o).
% 1.16/0.91 thf(n_some_type, type, n_some: ($i > $o) > $o).
% 1.16/0.91 thf(l_or_type, type, l_or: $o > $o > $o).
% 1.16/0.91 thf(d_not_type, type, d_not: $o > $o).
% 1.16/0.91 thf(iii_type, type, iii: $i > $i > $o).
% 1.16/0.91 thf(e_is_type, type, e_is: $i > $i > $i > $o).
% 1.16/0.91 thf(s_comb_type, type, '#S': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > (A > B) > A > C)).
% 1.16/0.91 thf(c_comb_type, type, '#C': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > B > A > C)).
% 1.16/0.91 thf(b_comb_type, type, '#B': !>[A:$tType, B:$tType, C:$tType]: ((A > B) > (C > A) > C > B)).
% 1.16/0.91 thf(k_comb_type, type, '#K': !>[A:$tType, B:$tType]: (B > A > B)).
% 1.16/0.91 thf(i_comb_type, type, '#I': !>[A:$tType]: (A > A)).
% 1.16/0.91 thf(satz13, conjecture,
% 1.16/0.91 (all_of @
% 1.16/0.91 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 1.16/0.91 ( ^[X0:$i]:
% 1.16/0.91 ( all_of @
% 1.16/0.91 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 1.16/0.91 ( ^[X1:$i]: ( ( moreis @ X0 @ X1 ) => ( lessis @ X1 @ X0 ) ) ) ) ))).
% 1.16/0.91 thf(zf_stmt_0, negated_conjecture,
% 1.16/0.91 (~( all_of @
% 1.16/0.91 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 1.16/0.91 ( ^[X0:$i]:
% 1.16/0.91 ( all_of @
% 1.16/0.91 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 1.16/0.91 ( ^[X1:$i]: ( ( moreis @ X0 @ X1 ) => ( lessis @ X1 @ X0 ) ) ) ) ) )),
% 1.16/0.91 inference('cnf.neg', [status(esa)], [satz13])).
% 1.16/0.91 thf(zip_derived_cl89, plain,
% 1.16/0.91 (~ (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @
% 1.16/0.91 (^[Y0 : $i]:
% 1.16/0.91 (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @
% 1.16/0.91 (^[Y1 : $i]: (((moreis @ Y0 @ Y1) => (lessis @ Y1 @ Y0)))))))),
% 1.16/0.91 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.16/0.91 thf(zip_derived_cl90, plain,
% 1.16/0.91 (~ (all_of @ ((('#C') @ in @ nat)) @
% 1.16/0.91 ((('#B') @ (all_of @ ((('#C') @ in @ nat))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ ('#S') @
% 1.16/0.91 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 1.16/0.91 ((('#C') @ lessis)))))))),
% 1.16/0.91 inference('lams2combs', [status(thm)], [zip_derived_cl89])).
% 1.16/0.91 thf(def_nat, axiom,(( nat ) =
% 1.16/0.91 ((d_Sep @ omega @ (^[Y0 : $i]: (((Y0) != (emptyset)))))))).
% 1.16/0.91 thf('0', plain,
% 1.16/0.91 (( nat ) = ( d_Sep @ omega @ ( ^[V_1:$i]: ( ( V_1 ) != ( emptyset ) ) ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(zip_derived_cl157, plain,
% 1.16/0.91 (~ (all_of @
% 1.16/0.91 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.16/0.91 ((('#B') @ (all_of @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ ('#S') @
% 1.16/0.91 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 1.16/0.91 ((('#C') @ lessis)))))))),
% 1.16/0.91 inference('rw', [status(thm)], [zip_derived_cl90, '0'])).
% 1.16/0.91 thf(def_all_of, axiom, ~ (all_of @ X0 @ X1) =>
% 1.16/0.91 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) != ($true))).
% 1.16/0.91 thf('1', plain,
% 1.16/0.91 (![X0:( $i > $o ),X1:( $i > $o )]:
% 1.16/0.91 ( ( ~( all_of @ X0 @ X1 ) ) <=>
% 1.16/0.91 ( ~( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) ) )),
% 1.16/0.91 inference('rw.lit', [status(esa)], [def_all_of])).
% 1.16/0.91 thf(zip_derived_cl158, plain,
% 1.16/0.91 (~ (((!!) @ (^[Y0 : $i]:
% 1.16/0.91 (((is_of @ Y0 @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.16/0.91 ((('#B') @ (all_of @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @
% 1.16/0.91 ((('#C') @ (!=) @ emptyset)))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ ('#S') @
% 1.16/0.91 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 1.16/0.91 ((('#C') @ lessis)))) @
% 1.16/0.91 Y0)))))))),
% 1.16/0.91 inference('rw_clause', [status(thm)], [zip_derived_cl157, '1'])).
% 1.16/0.91 thf(zip_derived_cl159, plain,
% 1.16/0.91 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.16/0.91 ((('#C') @ is_of @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @
% 1.16/0.91 ((('#C') @ (!=) @ emptyset))))))))) @
% 1.16/0.91 ((('#B') @ (all_of @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ ('#S') @
% 1.16/0.91 ((('#B') @ ((('#B') @ (=>))) @ moreis)))) @
% 1.16/0.91 ((('#C') @ lessis))))))))))),
% 1.16/0.91 inference('comb-normalize', [status(thm)], [zip_derived_cl158])).
% 1.16/0.91 thf(zip_derived_cl160, plain,
% 1.16/0.91 (~ (((is_of @ '#sk2' @
% 1.16/0.91 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.16/0.91 (all_of @
% 1.16/0.91 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ (=>) @ (moreis @ '#sk2'))) @
% 1.16/0.91 ((('#C') @ lessis @ '#sk2')))))))),
% 1.16/0.91 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl159])).
% 1.16/0.91 thf(def_is_of, axiom,(( is_of @ (X1)@ (X0)) = ((X0 @ X1)))).
% 1.16/0.91 thf('2', plain,
% 1.16/0.91 (![X0:( $i > $o ),X1:$i]: ( ( is_of @ X1 @ X0 ) = ( X0 @ X1 ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(zip_derived_cl161, plain,
% 1.16/0.91 (~ (((in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 1.16/0.91 (all_of @
% 1.16/0.91 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ (=>) @ (moreis @ '#sk2'))) @
% 1.16/0.91 ((('#C') @ lessis @ '#sk2')))))))),
% 1.16/0.91 inference('rw', [status(thm)], [zip_derived_cl160, '2'])).
% 1.16/0.91 thf(zip_derived_cl163, plain,
% 1.16/0.91 (~ (all_of @
% 1.16/0.91 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ (=>) @ (moreis @ '#sk2'))) @
% 1.16/0.91 ((('#C') @ lessis @ '#sk2')))))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl161])).
% 1.16/0.91 thf(zip_derived_cl164, plain,
% 1.16/0.91 (~ (((!!) @ (^[Y0 : $i]:
% 1.16/0.91 (((is_of @ Y0 @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.16/0.91 ((('#S') @ ((('#B') @ (=>) @ (moreis @ '#sk2'))) @
% 1.16/0.91 ((('#C') @ lessis @ '#sk2')) @ Y0)))))))),
% 1.16/0.91 inference('rw_clause', [status(thm)], [zip_derived_cl163, '1'])).
% 1.16/0.91 thf(zip_derived_cl165, plain,
% 1.16/0.91 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.16/0.91 ((('#C') @ is_of @
% 1.16/0.91 ((('#C') @ in @
% 1.16/0.91 (d_Sep @ omega @
% 1.16/0.91 ((('#C') @ (!=) @ emptyset))))))))) @
% 1.16/0.91 ((('#S') @ ((('#B') @ (=>) @ (moreis @ '#sk2'))) @
% 1.16/0.91 ((('#C') @ lessis @ '#sk2'))))))))),
% 1.16/0.91 inference('comb-normalize', [status(thm)], [zip_derived_cl164])).
% 1.16/0.91 thf(zip_derived_cl166, plain,
% 1.16/0.91 (~ (((is_of @ '#sk3' @
% 1.16/0.91 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.16/0.91 (((moreis @ '#sk2' @ '#sk3') => (lessis @ '#sk3' @ '#sk2')))))),
% 1.16/0.91 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl165])).
% 1.16/0.91 thf(def_d_not, axiom,(( d_not @ (X0)) = ((imp @ X0 @ ($false))))).
% 1.16/0.91 thf('3', plain, (![X0:$o]: ( ( d_not @ X0 ) = ( imp @ X0 @ $false ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_l_or, axiom,(( l_or @ (X0)@ (X1)) = ((imp @ (d_not @ X0) @ X1)))).
% 1.16/0.91 thf('4', plain,
% 1.16/0.91 (![X1:$o,X0:$o]: ( ( l_or @ X0 @ X1 ) = ( imp @ ( d_not @ X0 ) @ X1 ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_e_is, axiom,(( e_is @ (X2)@ (X0)@ (X1)) = ((((X0) = (X1)))))).
% 1.16/0.91 thf('5', plain,
% 1.16/0.91 (![X2:$i,X1:$i,X0:$i]: ( ( e_is @ X2 @ X0 @ X1 ) = ( ( X0 ) = ( X1 ) ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_n_is, axiom,(( n_is @ (X0)@ (X1)) = ((e_is @ nat @ X0 @ X1)))).
% 1.16/0.91 thf('6', plain,
% 1.16/0.91 (![X1:$i,X0:$i]: ( ( n_is @ X0 @ X1 ) = ( e_is @ nat @ X0 @ X1 ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_n_some, axiom,(( n_some @ (X0)) = ((l_some @ nat @ X0)))).
% 1.16/0.91 thf('7', plain,
% 1.16/0.91 (![X0:( $i > $o )]: ( ( n_some @ X0 ) = ( l_some @ nat @ X0 ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_d_29_ii, axiom,(( d_29_ii @ (X0)@ (X1)) =
% 1.16/0.91 ((n_some @ (diffprop @ X0 @ X1))))).
% 1.16/0.91 thf('8', plain,
% 1.16/0.91 (![X1:$i,X0:$i]:
% 1.16/0.91 ( ( d_29_ii @ X0 @ X1 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_iii, axiom,(( iii @ (X1)@ (X0)) = ((n_some @ (diffprop @ X0 @ X1))))).
% 1.16/0.91 thf('9', plain,
% 1.16/0.91 (![X1:$i,X0:$i]:
% 1.16/0.91 ( ( iii @ X1 @ X0 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_moreis, axiom,(( moreis @ (X0)@ (X1)) =
% 1.16/0.91 ((l_or @ (d_29_ii @ X0 @ X1) @ (n_is @ X0 @ X1))))).
% 1.16/0.91 thf('10', plain,
% 1.16/0.91 (![X1:$i,X0:$i]:
% 1.16/0.91 ( ( moreis @ X0 @ X1 ) =
% 1.16/0.91 ( l_or @ ( d_29_ii @ X0 @ X1 ) @ ( n_is @ X0 @ X1 ) ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(def_lessis, axiom,(( lessis @ (X0)@ (X1)) =
% 1.16/0.91 ((l_or @ (iii @ X0 @ X1) @ (n_is @ X0 @ X1))))).
% 1.16/0.91 thf('11', plain,
% 1.16/0.91 (![X1:$i,X0:$i]:
% 1.16/0.91 ( ( lessis @ X0 @ X1 ) =
% 1.16/0.91 ( l_or @ ( iii @ X0 @ X1 ) @ ( n_is @ X0 @ X1 ) ) )),
% 1.16/0.91 define([status(thm)])).
% 1.16/0.91 thf(zip_derived_cl167, plain,
% 1.16/0.91 (~ (((in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 1.16/0.91 (((imp @
% 1.16/0.91 (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) @
% 1.16/0.91 ((('#sk2') = ('#sk3')))) => (imp @
% 1.16/0.91 (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) @
% 1.16/0.91 ((('#sk3') = ('#sk2'))))))))),
% 1.16/0.91 inference('rw', [status(thm)],
% 1.16/0.91 [zip_derived_cl166, '2', '3', '4', '4', '5', '5', '0', '6',
% 1.16/0.91 '6', '7', '8', '9', '10', '11'])).
% 1.16/0.91 thf(zip_derived_cl169, plain,
% 1.16/0.91 (~ (((imp @
% 1.16/0.91 (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) @
% 1.16/0.91 ((('#sk2') = ('#sk3')))) => (imp @
% 1.16/0.91 (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) @
% 1.16/0.91 ((('#sk3') = ('#sk2'))))))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl167])).
% 1.16/0.91 thf(zip_derived_cl171, plain,
% 1.16/0.91 (~ (imp @
% 1.16/0.91 (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) @
% 1.16/0.91 ((('#sk3') = ('#sk2'))))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl169])).
% 1.16/0.91 thf(def_imp, axiom, ~ (imp @ X0 @ X1) => ((((X0) => (X1))) != ($true))).
% 1.16/0.91 thf('12', plain,
% 1.16/0.91 (![X0:$o,X1:$o]: ( ( ~( imp @ X0 @ X1 ) ) <=> ( ~( ( X0 ) => ( X1 ) ) ) )),
% 1.16/0.91 inference('rw.lit', [status(esa)], [def_imp])).
% 1.16/0.91 thf(zip_derived_cl173, plain,
% 1.16/0.91 (~ (((imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) => ((('#sk3') = ('#sk2')))))),
% 1.16/0.91 inference('rw_clause', [status(thm)], [zip_derived_cl171, '12'])).
% 1.16/0.91 thf(zip_derived_cl175, plain,
% 1.16/0.91 ( (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl173])).
% 1.16/0.91 thf(def_imp, axiom, (imp @ X0 @ X1) => ((((X0) => (X1))) = ($true))).
% 1.16/0.91 thf('13', plain,
% 1.16/0.91 (![X0:$o,X1:$o]: ( ( imp @ X0 @ X1 ) <=> ( ( X0 ) => ( X1 ) ) )),
% 1.16/0.91 inference('rw.lit', [status(esa)], [def_imp])).
% 1.16/0.91 thf(zip_derived_cl179, plain,
% 1.16/0.91 ( (((l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) => ($false)))),
% 1.16/0.91 inference('rw_clause', [status(thm)], [zip_derived_cl175, '13'])).
% 1.16/0.91 thf(zip_derived_cl183, plain,
% 1.16/0.91 ( (((~) @ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3'))))),
% 1.16/0.91 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl179])).
% 1.16/0.91 thf(zip_derived_cl184, plain,
% 1.16/0.91 (~ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3'))),
% 1.16/0.91 inference('simplify nested equalities', [status(thm)],
% 1.16/0.91 [zip_derived_cl183])).
% 1.16/0.91 thf(zip_derived_cl170, plain,
% 1.16/0.91 ( (imp @
% 1.16/0.91 (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) @
% 1.16/0.91 ((('#sk2') = ('#sk3'))))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl169])).
% 1.16/0.91 thf(zip_derived_cl172, plain,
% 1.16/0.91 ( (((imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false)) => ((('#sk2') = ('#sk3')))))),
% 1.16/0.91 inference('rw_clause', [status(thm)], [zip_derived_cl170, '13'])).
% 1.16/0.91 thf(zip_derived_cl174, plain,
% 1.16/0.91 ((~ (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false))
% 1.16/0.91 | ((('#sk2') = ('#sk3'))))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl172])).
% 1.16/0.91 thf(zip_derived_cl177, plain,
% 1.16/0.91 ((~ (imp @
% 1.16/0.91 (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) @
% 1.16/0.91 ($false))
% 1.16/0.91 | (('#sk2') = ('#sk3')))),
% 1.16/0.91 inference('simplify nested equalities', [status(thm)],
% 1.16/0.91 [zip_derived_cl174])).
% 1.16/0.91 thf(zip_derived_cl178, plain,
% 1.16/0.91 ((~ (((l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3')) => ($false)))
% 1.16/0.91 | (('#sk2') = ('#sk3')))),
% 1.16/0.91 inference('rw_clause', [status(thm)], [zip_derived_cl177, '12'])).
% 1.16/0.91 thf(zip_derived_cl181, plain,
% 1.16/0.91 ((~ (((~) @ (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3'))))
% 1.16/0.91 | (('#sk2') = ('#sk3')))),
% 1.16/0.91 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl178])).
% 1.16/0.91 thf(zip_derived_cl182, plain,
% 1.16/0.91 (( (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3'))
% 1.16/0.91 | (('#sk2') = ('#sk3')))),
% 1.16/0.91 inference('simplify nested equalities', [status(thm)],
% 1.16/0.91 [zip_derived_cl181])).
% 1.16/0.91 thf(zip_derived_cl176, plain, (~ ((('#sk3') = ('#sk2')))),
% 1.16/0.91 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl173])).
% 1.16/0.91 thf(zip_derived_cl180, plain, ((('#sk3') != ('#sk2'))),
% 1.16/0.91 inference('simplify nested equalities', [status(thm)],
% 1.16/0.91 [zip_derived_cl176])).
% 1.16/0.91 thf(zip_derived_cl185, plain,
% 1.16/0.91 ( (l_some @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))) @
% 1.16/0.91 (diffprop @ '#sk2' @ '#sk3'))),
% 1.16/0.91 inference('simplify_reflect-', [status(thm)],
% 1.16/0.91 [zip_derived_cl182, zip_derived_cl180])).
% 1.16/0.91 thf(zip_derived_cl186, plain, ($false),
% 1.16/0.91 inference('demod', [status(thm)], [zip_derived_cl184, zip_derived_cl185])).
% 1.16/0.91
% 1.16/0.91 % SZS output end Refutation
% 1.16/0.91
% 1.16/0.91
% 1.16/0.91 % Terminating...
% 1.73/0.98 % Runner terminated.
% 1.73/0.98 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------