%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM740^4 : TPTP v9.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.3tQwD2O3l9 true
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Oct 2 04:48:10 PM UTC 2025
% Result : Theorem 40.11s 6.26s
% Output : Refutation 40.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM740^4 : TPTP v9.2.0. Released v7.1.0.
% 0.03/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.3tQwD2O3l9 true
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Oct 1 16:37:53 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in HO mode
% 0.53/0.66 % Total configuration time : 828
% 0.53/0.66 % Estimated wc time : 1656
% 0.53/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.54/0.74 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.54/0.74 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.54/0.74 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.54/0.75 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.54/0.75 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.54/0.75 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.56/0.77 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.56/0.77 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 12.46/2.35 % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 40.11/6.26 % Solved by lams/40_b.comb.sh.
% 40.11/6.26 % done 76 iterations in 5.489s
% 40.11/6.26 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 40.11/6.26 % SZS output start Refutation
% 40.11/6.26 thf(d_29_ii_type, type, d_29_ii: $i > $i > $o).
% 40.11/6.26 thf(moreq_type, type, moreq: $i > $i > $o).
% 40.11/6.26 thf(lessf_type, type, lessf: $i > $i > $o).
% 40.11/6.26 thf(nat_type, type, nat: $i).
% 40.11/6.26 thf(is_of_type, type, is_of: $i > ($i > $o) > $o).
% 40.11/6.26 thf(in_type, type, in: $i > $i > $o).
% 40.11/6.26 thf(l_some_type, type, l_some: $i > ($i > $o) > $o).
% 40.11/6.26 thf(lesseq_type, type, lesseq: $i > $i > $o).
% 40.11/6.26 thf(ap_type, type, ap: $i > $i > $i).
% 40.11/6.26 thf(n_is_type, type, n_is: $i > $i > $o).
% 40.11/6.26 thf(n_1t_type, type, n_1t: $i).
% 40.11/6.26 thf(imp_type, type, imp: $o > $o > $o).
% 40.11/6.26 thf(frac_type, type, frac: $i).
% 40.11/6.26 thf(n_2t_type, type, n_2t: $i).
% 40.11/6.26 thf(n_ts_type, type, n_ts: $i > $i > $i).
% 40.11/6.26 thf(n_eq_type, type, n_eq: $i > $i > $o).
% 40.11/6.26 thf('#sk2_type', type, '#sk2': $i).
% 40.11/6.26 thf(pair1type_type, type, pair1type: $i > $i).
% 40.11/6.26 thf(all_of_type, type, all_of: ($i > $o) > ($i > $o) > $o).
% 40.11/6.26 thf(diffprop_type, type, diffprop: $i > $i > $i > $o).
% 40.11/6.26 thf(num_type, type, num: $i > $i).
% 40.11/6.26 thf(n_some_type, type, n_some: ($i > $o) > $o).
% 40.11/6.26 thf(l_or_type, type, l_or: $o > $o > $o).
% 40.11/6.26 thf(moref_type, type, moref: $i > $i > $o).
% 40.11/6.26 thf(d_not_type, type, d_not: $o > $o).
% 40.11/6.26 thf(first1_type, type, first1: $i > $i > $i).
% 40.11/6.26 thf('#sk3_type', type, '#sk3': $i).
% 40.11/6.26 thf(den_type, type, den: $i > $i).
% 40.11/6.26 thf(iii_type, type, iii: $i > $i > $o).
% 40.11/6.26 thf(second1_type, type, second1: $i > $i > $i).
% 40.11/6.26 thf(s_comb_type, type, '#S': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > (A > B) > A > C)).
% 40.11/6.26 thf(c_comb_type, type, '#C': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > B > A > C)).
% 40.11/6.26 thf(b_comb_type, type, '#B': !>[A:$tType, B:$tType, C:$tType]: ((A > B) > (C > A) > C > B)).
% 40.11/6.26 thf(k_comb_type, type, '#K': !>[A:$tType, B:$tType]: (B > A > B)).
% 40.11/6.26 thf(i_comb_type, type, '#I': !>[A:$tType]: (A > A)).
% 40.11/6.26 thf(satz48, conjecture,
% 40.11/6.26 (all_of @
% 40.11/6.26 ( ^[X0:$i]: ( in @ X0 @ frac ) ) @
% 40.11/6.26 ( ^[X0:$i]:
% 40.11/6.26 ( all_of @
% 40.11/6.26 ( ^[X1:$i]: ( in @ X1 @ frac ) ) @
% 40.11/6.26 ( ^[X1:$i]: ( ( moreq @ X0 @ X1 ) => ( lesseq @ X1 @ X0 ) ) ) ) ))).
% 40.11/6.26 thf(zf_stmt_0, negated_conjecture,
% 40.11/6.26 (~( all_of @
% 40.11/6.26 ( ^[X0:$i]: ( in @ X0 @ frac ) ) @
% 40.11/6.26 ( ^[X0:$i]:
% 40.11/6.26 ( all_of @
% 40.11/6.26 ( ^[X1:$i]: ( in @ X1 @ frac ) ) @
% 40.11/6.26 ( ^[X1:$i]: ( ( moreq @ X0 @ X1 ) => ( lesseq @ X1 @ X0 ) ) ) ) ) )),
% 40.11/6.26 inference('cnf.neg', [status(esa)], [satz48])).
% 40.11/6.26 thf(zip_derived_cl286, plain,
% 40.11/6.26 (~ (all_of @ (^[Y0 : $i]: (in @ Y0 @ frac)) @
% 40.11/6.26 (^[Y0 : $i]:
% 40.11/6.26 (all_of @ (^[Y1 : $i]: (in @ Y1 @ frac)) @
% 40.11/6.26 (^[Y1 : $i]: (((moreq @ Y0 @ Y1) => (lesseq @ Y1 @ Y0)))))))),
% 40.11/6.26 inference('cnf', [status(esa)], [zf_stmt_0])).
% 40.11/6.26 thf(zip_derived_cl287, plain,
% 40.11/6.26 (~ (all_of @ ((('#C') @ in @ frac)) @
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ frac))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @
% 40.11/6.26 ((('#B') @ ((('#B') @ (=>))) @ moreq)))) @
% 40.11/6.26 ((('#C') @ lesseq)))))))),
% 40.11/6.26 inference('lams2combs', [status(thm)], [zip_derived_cl286])).
% 40.11/6.26 thf(def_frac, axiom,(( frac ) = ((pair1type @ nat)))).
% 40.11/6.26 thf('0', plain, (( frac ) = ( pair1type @ nat )), define([status(thm)])).
% 40.11/6.26 thf(zip_derived_cl368, plain,
% 40.11/6.26 (~ (all_of @ ((('#C') @ in @ (pair1type @ nat))) @
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @
% 40.11/6.26 ((('#B') @ ((('#B') @ (=>))) @ moreq)))) @
% 40.11/6.26 ((('#C') @ lesseq)))))))),
% 40.11/6.26 inference('rw', [status(thm)], [zip_derived_cl287, '0'])).
% 40.11/6.26 thf(def_all_of, axiom, ~ (all_of @ X0 @ X1) =>
% 40.11/6.26 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) != ($true))).
% 40.11/6.26 thf('1', plain,
% 40.11/6.26 (![X0:( $i > $o ),X1:( $i > $o )]:
% 40.11/6.26 ( ( ~( all_of @ X0 @ X1 ) ) <=>
% 40.11/6.26 ( ~( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) ) )),
% 40.11/6.26 inference('rw.lit', [status(esa)], [def_all_of])).
% 40.11/6.26 thf(zip_derived_cl369, plain,
% 40.11/6.26 (~ (((!!) @ (^[Y0 : $i]:
% 40.11/6.26 (((is_of @ Y0 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @
% 40.11/6.26 ((('#B') @ ((('#B') @ (=>))) @ moreq)))) @
% 40.11/6.26 ((('#C') @ lesseq)))) @
% 40.11/6.26 Y0)))))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl368, '1'])).
% 40.11/6.26 thf(zip_derived_cl370, plain,
% 40.11/6.26 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 40.11/6.26 ((('#C') @ is_of @
% 40.11/6.26 ((('#C') @ in @ (pair1type @ nat))))))) @
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @
% 40.11/6.26 ((('#B') @ ((('#B') @ (=>))) @ moreq)))) @
% 40.11/6.26 ((('#C') @ lesseq))))))))))),
% 40.11/6.26 inference('comb-normalize', [status(thm)], [zip_derived_cl369])).
% 40.11/6.26 thf(zip_derived_cl371, plain,
% 40.11/6.26 (~ (((is_of @ '#sk2' @ ((('#C') @ in @ (pair1type @ nat)))) => (all_of @
% 40.11/6.26 ((('#C') @ in @ (pair1type @ nat))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (moreq @ '#sk2'))) @
% 40.11/6.26 ((('#C') @ lesseq @ '#sk2')))))))),
% 40.11/6.26 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl370])).
% 40.11/6.26 thf(zip_derived_cl373, plain,
% 40.11/6.26 (~ (all_of @ ((('#C') @ in @ (pair1type @ nat))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (moreq @ '#sk2'))) @
% 40.11/6.26 ((('#C') @ lesseq @ '#sk2')))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl371])).
% 40.11/6.26 thf(zip_derived_cl374, plain,
% 40.11/6.26 (~ (((!!) @ (^[Y0 : $i]:
% 40.11/6.26 (((is_of @ Y0 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (moreq @ '#sk2'))) @
% 40.11/6.26 ((('#C') @ lesseq @ '#sk2')) @ Y0)))))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl373, '1'])).
% 40.11/6.26 thf(zip_derived_cl375, plain,
% 40.11/6.26 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 40.11/6.26 ((('#C') @ is_of @
% 40.11/6.26 ((('#C') @ in @ (pair1type @ nat))))))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (moreq @ '#sk2'))) @
% 40.11/6.26 ((('#C') @ lesseq @ '#sk2'))))))))),
% 40.11/6.26 inference('comb-normalize', [status(thm)], [zip_derived_cl374])).
% 40.11/6.26 thf(zip_derived_cl376, plain,
% 40.11/6.26 (~ (((is_of @ '#sk3' @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 (((moreq @ '#sk2' @ '#sk3') => (lesseq @ '#sk3' @ '#sk2')))))),
% 40.11/6.26 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl375])).
% 40.11/6.26 thf(def_d_not, axiom,(( d_not @ (X0)) = ((imp @ X0 @ ($false))))).
% 40.11/6.26 thf('2', plain, (![X0:$o]: ( ( d_not @ X0 ) = ( imp @ X0 @ $false ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_l_or, axiom,(( l_or @ (X0)@ (X1)) = ((imp @ (d_not @ X0) @ X1)))).
% 40.11/6.26 thf('3', plain,
% 40.11/6.26 (![X1:$o,X0:$o]: ( ( l_or @ X0 @ X1 ) = ( imp @ ( d_not @ X0 ) @ X1 ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_n_some, axiom,(( n_some @ (X0)) = ((l_some @ nat @ X0)))).
% 40.11/6.26 thf('4', plain,
% 40.11/6.26 (![X0:( $i > $o )]: ( ( n_some @ X0 ) = ( l_some @ nat @ X0 ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_d_29_ii, axiom,(( d_29_ii @ (X0)@ (X1)) =
% 40.11/6.26 ((n_some @ (diffprop @ X0 @ X1))))).
% 40.11/6.26 thf('5', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( d_29_ii @ X0 @ X1 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_iii, axiom,(( iii @ (X1)@ (X0)) = ((n_some @ (diffprop @ X0 @ X1))))).
% 40.11/6.26 thf('6', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( iii @ X1 @ X0 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_first1, axiom,(( first1 @ (X1)@ (X0)) = ((ap @ X0 @ n_1t)))).
% 40.11/6.26 thf('7', plain,
% 40.11/6.26 (![X1:$i,X0:$i]: ( ( first1 @ X1 @ X0 ) = ( ap @ X0 @ n_1t ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_second1, axiom,(( second1 @ (X1)@ (X0)) = ((ap @ X0 @ n_2t)))).
% 40.11/6.26 thf('8', plain,
% 40.11/6.26 (![X1:$i,X0:$i]: ( ( second1 @ X1 @ X0 ) = ( ap @ X0 @ n_2t ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_num, axiom,(( num @ (X0)) = ((first1 @ nat @ X0)))).
% 40.11/6.26 thf('9', plain, (![X0:$i]: ( ( num @ X0 ) = ( first1 @ nat @ X0 ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_den, axiom,(( den @ (X0)) = ((second1 @ nat @ X0)))).
% 40.11/6.26 thf('10', plain, (![X0:$i]: ( ( den @ X0 ) = ( second1 @ nat @ X0 ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_n_eq, axiom,(( n_eq @ (X0)@ (X1)) =
% 40.11/6.26 ((n_is @ (n_ts @ (num @ X0) @ (den @ X1)) @
% 40.11/6.26 (n_ts @ (num @ X1) @ (den @ X0)))))).
% 40.11/6.26 thf('11', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( n_eq @ X0 @ X1 ) =
% 40.11/6.26 ( n_is @
% 40.11/6.26 ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @
% 40.11/6.26 ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_moref, axiom,(( moref @ (X0)@ (X1)) =
% 40.11/6.26 ((d_29_ii @ (n_ts @ (num @ X0) @ (den @ X1)) @
% 40.11/6.26 (n_ts @ (num @ X1) @ (den @ X0)))))).
% 40.11/6.26 thf('12', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( moref @ X0 @ X1 ) =
% 40.11/6.26 ( d_29_ii @
% 40.11/6.26 ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @
% 40.11/6.26 ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_lessf, axiom,(( lessf @ (X0)@ (X1)) =
% 40.11/6.26 ((iii @ (n_ts @ (num @ X0) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X0)))))).
% 40.11/6.26 thf('13', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( lessf @ X0 @ X1 ) =
% 40.11/6.26 ( iii @
% 40.11/6.26 ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @
% 40.11/6.26 ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_moreq, axiom,(( moreq @ (X0)@ (X1)) =
% 40.11/6.26 ((l_or @ (moref @ X0 @ X1) @ (n_eq @ X0 @ X1))))).
% 40.11/6.26 thf('14', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( moreq @ X0 @ X1 ) =
% 40.11/6.26 ( l_or @ ( moref @ X0 @ X1 ) @ ( n_eq @ X0 @ X1 ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(def_lesseq, axiom,(( lesseq @ (X0)@ (X1)) =
% 40.11/6.26 ((l_or @ (lessf @ X0 @ X1) @ (n_eq @ X0 @ X1))))).
% 40.11/6.26 thf('15', plain,
% 40.11/6.26 (![X1:$i,X0:$i]:
% 40.11/6.26 ( ( lesseq @ X0 @ X1 ) =
% 40.11/6.26 ( l_or @ ( lessf @ X0 @ X1 ) @ ( n_eq @ X0 @ X1 ) ) )),
% 40.11/6.26 define([status(thm)])).
% 40.11/6.26 thf(zip_derived_cl377, plain,
% 40.11/6.26 (~ (((is_of @ '#sk3' @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 (((imp @
% 40.11/6.26 (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) @
% 40.11/6.26 (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) =>
% 40.11/6.26 (imp @
% 40.11/6.26 (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) @
% 40.11/6.26 (n_is @ (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t))))))))),
% 40.11/6.26 inference('rw', [status(thm)],
% 40.11/6.26 [zip_derived_cl376, '2', '3', '3', '4', '5', '6', '7', '7',
% 40.11/6.26 '8', '8', '9', '9', '10', '10', '11', '11', '12', '13', '14',
% 40.11/6.26 '15'])).
% 40.11/6.26 thf(zip_derived_cl379, plain,
% 40.11/6.26 (~ (((imp @
% 40.11/6.26 (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) @
% 40.11/6.26 (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) =>
% 40.11/6.26 (imp @
% 40.11/6.26 (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) @
% 40.11/6.26 (n_is @ (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t))))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl377])).
% 40.11/6.26 thf(zip_derived_cl381, plain,
% 40.11/6.26 (~ (imp @
% 40.11/6.26 (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) @
% 40.11/6.26 (n_is @ (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl379])).
% 40.11/6.26 thf(def_imp, axiom, ~ (imp @ X0 @ X1) => ((((X0) => (X1))) != ($true))).
% 40.11/6.26 thf('16', plain,
% 40.11/6.26 (![X0:$o,X1:$o]: ( ( ~( imp @ X0 @ X1 ) ) <=> ( ~( ( X0 ) => ( X1 ) ) ) )),
% 40.11/6.26 inference('rw.lit', [status(esa)], [def_imp])).
% 40.11/6.26 thf(zip_derived_cl383, plain,
% 40.11/6.26 (~ (((imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) => (n_is @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl381, '16'])).
% 40.11/6.26 thf(zip_derived_cl386, plain,
% 40.11/6.26 (~ (n_is @ (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl383])).
% 40.11/6.26 thf(satz38, axiom,
% 40.11/6.26 (all_of @
% 40.11/6.26 ( ^[X0:$i]: ( in @ X0 @ frac ) ) @
% 40.11/6.26 ( ^[X0:$i]:
% 40.11/6.26 ( all_of @
% 40.11/6.26 ( ^[X1:$i]: ( in @ X1 @ frac ) ) @
% 40.11/6.26 ( ^[X1:$i]: ( ( n_eq @ X0 @ X1 ) => ( n_eq @ X1 @ X0 ) ) ) ) ))).
% 40.11/6.26 thf(zip_derived_cl240, plain,
% 40.11/6.26 ( (all_of @ (^[Y0 : $i]: (in @ Y0 @ frac)) @
% 40.11/6.26 (^[Y0 : $i]:
% 40.11/6.26 (all_of @ (^[Y1 : $i]: (in @ Y1 @ frac)) @
% 40.11/6.26 (^[Y1 : $i]: (((n_eq @ Y0 @ Y1) => (n_eq @ Y1 @ Y0)))))))),
% 40.11/6.26 inference('cnf', [status(esa)], [satz38])).
% 40.11/6.26 thf(zip_derived_cl241, plain,
% 40.11/6.26 ( (all_of @ ((('#C') @ in @ frac)) @
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ frac))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @ ((('#B') @ ((('#B') @ (=>))) @ n_eq)))) @
% 40.11/6.26 ((('#C') @ n_eq)))))))),
% 40.11/6.26 inference('lams2combs', [status(thm)], [zip_derived_cl240])).
% 40.11/6.26 thf(zip_derived_cl469, plain,
% 40.11/6.26 ( (all_of @ ((('#C') @ in @ (pair1type @ nat))) @
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @ ((('#B') @ ((('#B') @ (=>))) @ n_eq)))) @
% 40.11/6.26 ((('#C') @ n_eq)))))))),
% 40.11/6.26 inference('rw', [status(thm)], [zip_derived_cl241, '0'])).
% 40.11/6.26 thf(def_all_of, axiom, (all_of @ X0 @ X1) =>
% 40.11/6.26 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) = ($true))).
% 40.11/6.26 thf('17', plain,
% 40.11/6.26 (![X0:( $i > $o ),X1:( $i > $o )]:
% 40.11/6.26 ( ( all_of @ X0 @ X1 ) <=>
% 40.11/6.26 ( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) )),
% 40.11/6.26 inference('rw.lit', [status(esa)], [def_all_of])).
% 40.11/6.26 thf(zip_derived_cl470, plain,
% 40.11/6.26 ( (((!!) @ (^[Y0 : $i]:
% 40.11/6.26 (((is_of @ Y0 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @
% 40.11/6.26 ((('#B') @ ((('#B') @ (=>))) @ n_eq)))) @
% 40.11/6.26 ((('#C') @ n_eq)))) @
% 40.11/6.26 Y0)))))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl469, '17'])).
% 40.11/6.26 thf(zip_derived_cl471, plain,
% 40.11/6.26 ( (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 40.11/6.26 ((('#C') @ is_of @
% 40.11/6.26 ((('#C') @ in @ (pair1type @ nat))))))) @
% 40.11/6.26 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ ('#S') @
% 40.11/6.26 ((('#B') @ ((('#B') @ (=>))) @ n_eq)))) @
% 40.11/6.26 ((('#C') @ n_eq))))))))))),
% 40.11/6.26 inference('comb-normalize', [status(thm)], [zip_derived_cl470])).
% 40.11/6.26 thf(zip_derived_cl472, plain,
% 40.11/6.26 (![X2 : $i]:
% 40.11/6.26 (((is_of @ X2 @ ((('#C') @ in @ (pair1type @ nat)))) => (all_of @
% 40.11/6.26 ((('#C') @ in @ (pair1type @ nat))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (n_eq @ X2))) @ ((('#C') @ n_eq @ X2)))))))),
% 40.11/6.26 inference('lazy_cnf_forall', [status(thm)], [zip_derived_cl471])).
% 40.11/6.26 thf(zip_derived_cl473, plain,
% 40.11/6.26 (![X2 : $i]:
% 40.11/6.26 (~ (is_of @ X2 @ ((('#C') @ in @ (pair1type @ nat))))
% 40.11/6.26 | (all_of @ ((('#C') @ in @ (pair1type @ nat))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (n_eq @ X2))) @
% 40.11/6.26 ((('#C') @ n_eq @ X2))))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl472])).
% 40.11/6.26 thf(zip_derived_cl474, plain,
% 40.11/6.26 (![X0 : $i]:
% 40.11/6.26 ( (((!!) @ (^[Y0 : $i]:
% 40.11/6.26 (((is_of @ Y0 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (n_eq @ X0))) @
% 40.11/6.26 ((('#C') @ n_eq @ X0)) @ Y0)))))))
% 40.11/6.26 | ~ (is_of @ X0 @ ((('#C') @ in @ (pair1type @ nat)))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl473, '17'])).
% 40.11/6.26 thf(zip_derived_cl475, plain,
% 40.11/6.26 (![X0 : $i]:
% 40.11/6.26 ( (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 40.11/6.26 ((('#C') @ is_of @
% 40.11/6.26 ((('#C') @ in @ (pair1type @ nat))))))) @
% 40.11/6.26 ((('#S') @ ((('#B') @ (=>) @ (n_eq @ X0))) @
% 40.11/6.26 ((('#C') @ n_eq @ X0))))))))
% 40.11/6.26 | ~ (is_of @ X0 @ ((('#C') @ in @ (pair1type @ nat)))))),
% 40.11/6.26 inference('comb-normalize', [status(thm)], [zip_derived_cl474])).
% 40.11/6.26 thf(zip_derived_cl476, plain,
% 40.11/6.26 (![X0 : $i, X2 : $i]:
% 40.11/6.26 ( (((is_of @ X2 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 (((n_eq @ X0 @ X2) => (n_eq @ X2 @ X0)))))
% 40.11/6.26 | ~ (is_of @ X0 @ ((('#C') @ in @ (pair1type @ nat)))))),
% 40.11/6.26 inference('lazy_cnf_forall', [status(thm)], [zip_derived_cl475])).
% 40.11/6.26 thf(zip_derived_cl477, plain,
% 40.11/6.26 (![X0 : $i, X2 : $i]:
% 40.11/6.26 ( (((is_of @ X2 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 40.11/6.26 (((n_is @ (n_ts @ (ap @ X0 @ n_1t) @ (ap @ X2 @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ X2 @ n_1t) @ (ap @ X0 @ n_2t))) => (n_is @
% 40.11/6.26 (n_ts @ (ap @ X2 @ n_1t) @ (ap @ X0 @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ X0 @ n_1t) @ (ap @ X2 @ n_2t)))))))
% 40.11/6.26 | ~ (is_of @ X0 @ ((('#C') @ in @ (pair1type @ nat)))))),
% 40.11/6.26 inference('rw', [status(thm)],
% 40.11/6.26 [zip_derived_cl476, '7', '7', '8', '8', '9', '9', '10', '10',
% 40.11/6.26 '11', '11'])).
% 40.11/6.26 thf(zip_derived_cl478, plain,
% 40.11/6.26 (![X0 : $i, X2 : $i]:
% 40.11/6.26 (~ (is_of @ X2 @ ((('#C') @ in @ (pair1type @ nat))))
% 40.11/6.26 | (((n_is @ (n_ts @ (ap @ X0 @ n_1t) @ (ap @ X2 @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ X2 @ n_1t) @ (ap @ X0 @ n_2t))) => (n_is @
% 40.11/6.26 (n_ts @ (ap @ X2 @ n_1t) @ (ap @ X0 @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ X0 @ n_1t) @ (ap @ X2 @ n_2t)))))
% 40.11/6.26 | ~ (is_of @ X0 @ ((('#C') @ in @ (pair1type @ nat)))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl477])).
% 40.11/6.26 thf(zip_derived_cl479, plain,
% 40.11/6.26 (![X0 : $i, X2 : $i]:
% 40.11/6.26 (~ (n_is @ (n_ts @ (ap @ X0 @ n_1t) @ (ap @ X2 @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ X2 @ n_1t) @ (ap @ X0 @ n_2t)))
% 40.11/6.26 | (n_is @ (n_ts @ (ap @ X2 @ n_1t) @ (ap @ X0 @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ X0 @ n_1t) @ (ap @ X2 @ n_2t)))
% 40.11/6.26 | ~ (is_of @ X0 @ ((('#C') @ in @ (pair1type @ nat))))
% 40.11/6.26 | ~ (is_of @ X2 @ ((('#C') @ in @ (pair1type @ nat)))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl478])).
% 40.11/6.26 thf(zip_derived_cl3438, plain,
% 40.11/6.26 ((~ (is_of @ '#sk3' @ ((('#C') @ in @ (pair1type @ nat))))
% 40.11/6.26 | ~ (is_of @ '#sk2' @ ((('#C') @ in @ (pair1type @ nat))))
% 40.11/6.26 | ~ (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('sup+', [status(thm)], [zip_derived_cl386, zip_derived_cl479])).
% 40.11/6.26 thf(zip_derived_cl378, plain,
% 40.11/6.26 ( (is_of @ '#sk3' @ ((('#C') @ in @ (pair1type @ nat))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl377])).
% 40.11/6.26 thf(zip_derived_cl372, plain,
% 40.11/6.26 ( (is_of @ '#sk2' @ ((('#C') @ in @ (pair1type @ nat))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl371])).
% 40.11/6.26 thf(zip_derived_cl380, plain,
% 40.11/6.26 ( (imp @
% 40.11/6.26 (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) @
% 40.11/6.26 (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl379])).
% 40.11/6.26 thf(def_imp, axiom, (imp @ X0 @ X1) => ((((X0) => (X1))) = ($true))).
% 40.11/6.26 thf('18', plain,
% 40.11/6.26 (![X0:$o,X1:$o]: ( ( imp @ X0 @ X1 ) <=> ( ( X0 ) => ( X1 ) ) )),
% 40.11/6.26 inference('rw.lit', [status(esa)], [def_imp])).
% 40.11/6.26 thf(zip_derived_cl382, plain,
% 40.11/6.26 ( (((imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false)) => (n_is @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl380, '18'])).
% 40.11/6.26 thf(zip_derived_cl384, plain,
% 40.11/6.26 ((~ (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false))
% 40.11/6.26 | (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl382])).
% 40.11/6.26 thf(zip_derived_cl387, plain,
% 40.11/6.26 ((~ (((l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) =>
% 40.11/6.26 ($false)))
% 40.11/6.26 | (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl384, '16'])).
% 40.11/6.26 thf(zip_derived_cl389, plain,
% 40.11/6.26 ((~ (((~) @ (l_some @ nat @
% 40.11/6.26 (diffprop @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))))
% 40.11/6.26 | (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl387])).
% 40.11/6.26 thf(zip_derived_cl390, plain,
% 40.11/6.26 (( (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))
% 40.11/6.26 | (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('simplify nested equalities', [status(thm)],
% 40.11/6.26 [zip_derived_cl389])).
% 40.11/6.26 thf(zip_derived_cl385, plain,
% 40.11/6.26 ( (imp @
% 40.11/6.26 (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) @
% 40.11/6.26 ($false))),
% 40.11/6.26 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl383])).
% 40.11/6.26 thf(zip_derived_cl388, plain,
% 40.11/6.26 ( (((l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))) =>
% 40.11/6.26 ($false)))),
% 40.11/6.26 inference('rw_clause', [status(thm)], [zip_derived_cl385, '18'])).
% 40.11/6.26 thf(zip_derived_cl391, plain,
% 40.11/6.26 ( (((~) @ (l_some @ nat @
% 40.11/6.26 (diffprop @
% 40.11/6.26 (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))))),
% 40.11/6.26 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl388])).
% 40.11/6.26 thf(zip_derived_cl392, plain,
% 40.11/6.26 (~ (l_some @ nat @
% 40.11/6.26 (diffprop @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t))))),
% 40.11/6.26 inference('simplify nested equalities', [status(thm)],
% 40.11/6.26 [zip_derived_cl391])).
% 40.11/6.26 thf(zip_derived_cl468, plain,
% 40.11/6.26 ( (n_is @ (n_ts @ (ap @ '#sk2' @ n_1t) @ (ap @ '#sk3' @ n_2t)) @
% 40.11/6.26 (n_ts @ (ap @ '#sk3' @ n_1t) @ (ap @ '#sk2' @ n_2t)))),
% 40.11/6.26 inference('clc', [status(thm)], [zip_derived_cl390, zip_derived_cl392])).
% 40.11/6.26 thf(zip_derived_cl3457, plain, ($false),
% 40.11/6.26 inference('demod', [status(thm)],
% 40.11/6.26 [zip_derived_cl3438, zip_derived_cl378, zip_derived_cl372,
% 40.11/6.26 zip_derived_cl468])).
% 40.11/6.26
% 40.11/6.26 % SZS output end Refutation
% 40.11/6.26
% 40.11/6.26
% 40.11/6.26 % Terminating...
% 40.78/6.50 % Runner terminated.
% 40.78/6.51 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------