TSTP Solution File: NUM642^4 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM642^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.KcK0VtRnLE true
% Computer : n021.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:00 EDT 2023
% Result : Theorem 1.46s 1.40s
% Output : Refutation 1.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM642^4 : TPTP v8.1.2. Released v7.1.0.
% 0.00/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.KcK0VtRnLE true
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 25 08:42:25 EDT 2023
% 0.21/0.36 % CPUTime :
% 0.21/0.36 % Running portfolio for 300 s
% 0.21/0.36 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.36 % Number of cores: 8
% 0.21/0.36 % Python version: Python 3.6.8
% 0.21/0.36 % Running in HO mode
% 0.22/0.64 % Total configuration time : 828
% 0.22/0.64 % Estimated wc time : 1656
% 0.22/0.64 % Estimated cpu time (8 cpus) : 207.0
% 0.22/0.71 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.22/0.76 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.22/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.97/0.78 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.97/0.79 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.97/0.79 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.97/0.79 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.97/0.79 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 1.46/1.40 % /export/starexec/sandbox/solver/bin/lams/30_b.l.sh running for 90s
% 1.46/1.40 % Solved by lams/40_b.comb.sh.
% 1.46/1.40 % done 79 iterations in 0.552s
% 1.46/1.40 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.46/1.40 % SZS output start Refutation
% 1.46/1.40 thf('#sk3_type', type, '#sk3': $i).
% 1.46/1.40 thf(nat_type, type, nat: $i).
% 1.46/1.40 thf(is_of_type, type, is_of: $i > ($i > $o) > $o).
% 1.46/1.40 thf(in_type, type, in: $i > $i > $o).
% 1.46/1.40 thf('#sk2_type', type, '#sk2': $i).
% 1.46/1.40 thf(d_Sep_type, type, d_Sep: $i > ($i > $o) > $i).
% 1.46/1.40 thf(ap_type, type, ap: $i > $i > $i).
% 1.46/1.40 thf(emptyset_type, type, emptyset: $i).
% 1.46/1.40 thf(d_Sing_type, type, d_Sing: $i > $i).
% 1.46/1.40 thf(n_is_type, type, n_is: $i > $i > $o).
% 1.46/1.40 thf(omega_type, type, omega: $i).
% 1.46/1.40 thf(all_of_type, type, all_of: ($i > $o) > ($i > $o) > $o).
% 1.46/1.40 thf(binunion_type, type, binunion: $i > $i > $i).
% 1.46/1.40 thf(ordsucc_type, type, ordsucc: $i > $i).
% 1.46/1.40 thf(plus_type, type, plus: $i > $i).
% 1.46/1.40 thf(e_is_type, type, e_is: $i > $i > $i > $o).
% 1.46/1.40 thf(n_pl_type, type, n_pl: $i > $i > $i).
% 1.46/1.40 thf(s_comb_type, type, '#S': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > (A > B) > A > C)).
% 1.46/1.40 thf(c_comb_type, type, '#C': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > B > A > C)).
% 1.46/1.40 thf(b_comb_type, type, '#B': !>[A:$tType, B:$tType, C:$tType]: ((A > B) > (C > A) > C > B)).
% 1.46/1.40 thf(k_comb_type, type, '#K': !>[A:$tType, B:$tType]: (B > A > B)).
% 1.46/1.40 thf(i_comb_type, type, '#I': !>[A:$tType]: (A > A)).
% 1.46/1.40 thf(satz4d, axiom,
% 1.46/1.40 (all_of @
% 1.46/1.40 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 1.46/1.40 ( ^[X0:$i]:
% 1.46/1.40 ( all_of @
% 1.46/1.40 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 1.46/1.40 ( ^[X1:$i]:
% 1.46/1.40 ( n_is @
% 1.46/1.40 ( n_pl @ ( ordsucc @ X0 ) @ X1 ) @
% 1.46/1.40 ( ordsucc @ ( n_pl @ X0 @ X1 ) ) ) ) ) ))).
% 1.46/1.40 thf(zip_derived_cl81, plain,
% 1.46/1.40 ( (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @
% 1.46/1.40 (^[Y0 : $i]:
% 1.46/1.40 (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @
% 1.46/1.40 (^[Y1 : $i]:
% 1.46/1.40 (n_is @ (n_pl @ (ordsucc @ Y0) @ Y1) @
% 1.46/1.40 (ordsucc @ (n_pl @ Y0 @ Y1)))))))),
% 1.46/1.40 inference('cnf', [status(esa)], [satz4d])).
% 1.46/1.40 thf(zip_derived_cl82, plain,
% 1.46/1.40 ( (all_of @ ((('#C') @ in @ nat)) @
% 1.46/1.40 ((('#B') @ (all_of @ ((('#C') @ in @ nat))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))))) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))))))),
% 1.46/1.40 inference('lams2combs', [status(thm)], [zip_derived_cl81])).
% 1.46/1.40 thf(def_nat, axiom,(( nat ) =
% 1.46/1.40 ((d_Sep @ omega @ (^[Y0 : $i]: (((Y0) != (emptyset)))))))).
% 1.46/1.40 thf('0', plain,
% 1.46/1.40 (( nat ) = ( d_Sep @ omega @ ( ^[V_1:$i]: ( ( V_1 ) != ( emptyset ) ) ) )),
% 1.46/1.40 define([status(thm)])).
% 1.46/1.40 thf(zip_derived_cl174, plain,
% 1.46/1.40 ( (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#B') @ (all_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))))) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))))))),
% 1.46/1.40 inference('rw', [status(thm)], [zip_derived_cl82, '0'])).
% 1.46/1.40 thf(def_all_of, axiom, (all_of @ X0 @ X1) =>
% 1.46/1.40 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) = ($true))).
% 1.46/1.40 thf('1', plain,
% 1.46/1.40 (![X0:( $i > $o ),X1:( $i > $o )]:
% 1.46/1.40 ( ( all_of @ X0 @ X1 ) <=>
% 1.46/1.40 ( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) )),
% 1.46/1.40 inference('rw.lit', [status(esa)], [def_all_of])).
% 1.46/1.40 thf(zip_derived_cl175, plain,
% 1.46/1.40 ( (((!!) @ (^[Y0 : $i]:
% 1.46/1.40 (((is_of @ Y0 @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 ((('#B') @ (all_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @
% 1.46/1.40 ((('#C') @ (!=) @ emptyset)))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))))) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))) @
% 1.46/1.40 Y0)))))))),
% 1.46/1.40 inference('rw_clause', [status(thm)], [zip_derived_cl174, '1'])).
% 1.46/1.40 thf(zip_derived_cl176, plain,
% 1.46/1.40 ( (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.46/1.40 ((('#C') @ is_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))))))) @
% 1.46/1.40 ((('#B') @ (all_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))))) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl))))))))))),
% 1.46/1.40 inference('comb-normalize', [status(thm)], [zip_derived_cl175])).
% 1.46/1.40 thf(zip_derived_cl177, plain,
% 1.46/1.40 (![X2 : $i]:
% 1.46/1.40 (((is_of @ X2 @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @ (n_pl @ (ordsucc @ X2)))) @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ X2))))))))),
% 1.46/1.40 inference('lazy_cnf_forall', [status(thm)], [zip_derived_cl176])).
% 1.46/1.40 thf(def_is_of, axiom,(( is_of @ (X1)@ (X0)) = ((X0 @ X1)))).
% 1.46/1.40 thf('2', plain,
% 1.46/1.40 (![X0:( $i > $o ),X1:$i]: ( ( is_of @ X1 @ X0 ) = ( X0 @ X1 ) )),
% 1.46/1.40 define([status(thm)])).
% 1.46/1.40 thf(def_ordsucc, axiom,(( ordsucc @ (X0)) =
% 1.46/1.40 ((binunion @ X0 @ (d_Sing @ X0))))).
% 1.46/1.40 thf('3', plain,
% 1.46/1.40 (![X0:$i]: ( ( ordsucc @ X0 ) = ( binunion @ X0 @ ( d_Sing @ X0 ) ) )),
% 1.46/1.40 define([status(thm)])).
% 1.46/1.40 thf(zip_derived_cl178, plain,
% 1.46/1.40 (![X2 : $i]:
% 1.46/1.40 (((in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 1.46/1.40 (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @
% 1.46/1.40 (n_pl @ (binunion @ X2 @ (d_Sing @ X2))))) @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ X2))))))))),
% 1.46/1.40 inference('rw', [status(thm)], [zip_derived_cl177, '2', '3'])).
% 1.46/1.40 thf(zip_derived_cl179, plain,
% 1.46/1.40 (![X2 : $i]:
% 1.46/1.40 (~ (in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 1.46/1.40 | (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @
% 1.46/1.40 (n_pl @ (binunion @ X2 @ (d_Sing @ X2))))) @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ X2)))))))),
% 1.46/1.40 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl178])).
% 1.46/1.40 thf(zip_derived_cl180, plain,
% 1.46/1.40 (![X0 : $i]:
% 1.46/1.40 ( (((!!) @ (^[Y0 : $i]:
% 1.46/1.40 (((is_of @ Y0 @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @
% 1.46/1.40 (n_pl @ (binunion @ X0 @ (d_Sing @ X0))))) @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ X0))) @ Y0)))))))
% 1.46/1.40 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('rw_clause', [status(thm)], [zip_derived_cl179, '1'])).
% 1.46/1.40 thf(zip_derived_cl181, plain,
% 1.46/1.40 (![X0 : $i]:
% 1.46/1.40 ( (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.46/1.40 ((('#C') @ is_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @
% 1.46/1.40 ((('#C') @ (!=) @ emptyset))))))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @
% 1.46/1.40 (n_pl @ (binunion @ X0 @ (d_Sing @ X0))))) @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ X0)))))))))
% 1.46/1.40 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('comb-normalize', [status(thm)], [zip_derived_cl180])).
% 1.46/1.40 thf(zip_derived_cl182, plain,
% 1.46/1.40 (![X0 : $i, X2 : $i]:
% 1.46/1.40 ( (((is_of @ X2 @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 (n_is @ (n_pl @ (binunion @ X0 @ (d_Sing @ X0)) @ X2) @
% 1.46/1.40 (ordsucc @ (n_pl @ X0 @ X2)))))
% 1.46/1.40 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('lazy_cnf_forall', [status(thm)], [zip_derived_cl181])).
% 1.46/1.40 thf(def_e_is, axiom,(( e_is @ (X2)@ (X0)@ (X1)) = ((((X0) = (X1)))))).
% 1.46/1.40 thf('4', plain,
% 1.46/1.40 (![X2:$i,X1:$i,X0:$i]: ( ( e_is @ X2 @ X0 @ X1 ) = ( ( X0 ) = ( X1 ) ) )),
% 1.46/1.40 define([status(thm)])).
% 1.46/1.40 thf(def_n_is, axiom,(( n_is @ (X0)@ (X1)) = ((e_is @ nat @ X0 @ X1)))).
% 1.46/1.40 thf('5', plain,
% 1.46/1.40 (![X1:$i,X0:$i]: ( ( n_is @ X0 @ X1 ) = ( e_is @ nat @ X0 @ X1 ) )),
% 1.46/1.40 define([status(thm)])).
% 1.46/1.40 thf(def_n_pl, axiom,(( n_pl @ (X0)@ (X1)) = ((ap @ (plus @ X0) @ X1)))).
% 1.46/1.40 thf('6', plain,
% 1.46/1.40 (![X1:$i,X0:$i]: ( ( n_pl @ X0 @ X1 ) = ( ap @ ( plus @ X0 ) @ X1 ) )),
% 1.46/1.40 define([status(thm)])).
% 1.46/1.40 thf(zip_derived_cl183, plain,
% 1.46/1.40 (![X0 : $i, X2 : $i]:
% 1.46/1.40 ( (((in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 1.46/1.40 (((ap @ (plus @ (binunion @ X0 @ (d_Sing @ X0))) @ X2) =
% 1.46/1.40 (binunion @ (ap @ (plus @ X0) @ X2) @
% 1.46/1.40 (d_Sing @ (ap @ (plus @ X0) @ X2)))))))
% 1.46/1.40 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('rw', [status(thm)],
% 1.46/1.40 [zip_derived_cl182, '2', '3', '4', '0', '5', '6', '6'])).
% 1.46/1.40 thf(zip_derived_cl184, plain,
% 1.46/1.40 (![X0 : $i, X2 : $i]:
% 1.46/1.40 (~ (in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 1.46/1.40 | (((ap @ (plus @ (binunion @ X0 @ (d_Sing @ X0))) @ X2) =
% 1.46/1.40 (binunion @ (ap @ (plus @ X0) @ X2) @
% 1.46/1.40 (d_Sing @ (ap @ (plus @ X0) @ X2)))))
% 1.46/1.40 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl183])).
% 1.46/1.40 thf(zip_derived_cl185, plain,
% 1.46/1.40 (![X0 : $i, X2 : $i]:
% 1.46/1.40 (~ (in @ X2 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 1.46/1.40 | ((ap @ (plus @ (binunion @ X0 @ (d_Sing @ X0))) @ X2)
% 1.46/1.40 = (binunion @ (ap @ (plus @ X0) @ X2) @
% 1.46/1.40 (d_Sing @ (ap @ (plus @ X0) @ X2))))
% 1.46/1.40 | ~ (in @ X0 @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('simplify nested equalities', [status(thm)],
% 1.46/1.40 [zip_derived_cl184])).
% 1.46/1.40 thf(satz4h, conjecture,
% 1.46/1.40 (all_of @
% 1.46/1.40 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 1.46/1.40 ( ^[X0:$i]:
% 1.46/1.40 ( all_of @
% 1.46/1.40 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 1.46/1.40 ( ^[X1:$i]:
% 1.46/1.40 ( n_is @
% 1.46/1.40 ( ordsucc @ ( n_pl @ X0 @ X1 ) ) @
% 1.46/1.40 ( n_pl @ ( ordsucc @ X0 ) @ X1 ) ) ) ) ))).
% 1.46/1.40 thf(zf_stmt_0, negated_conjecture,
% 1.46/1.40 (~( all_of @
% 1.46/1.40 ( ^[X0:$i]: ( in @ X0 @ nat ) ) @
% 1.46/1.40 ( ^[X0:$i]:
% 1.46/1.40 ( all_of @
% 1.46/1.40 ( ^[X1:$i]: ( in @ X1 @ nat ) ) @
% 1.46/1.40 ( ^[X1:$i]:
% 1.46/1.40 ( n_is @
% 1.46/1.40 ( ordsucc @ ( n_pl @ X0 @ X1 ) ) @
% 1.46/1.40 ( n_pl @ ( ordsucc @ X0 ) @ X1 ) ) ) ) ) )),
% 1.46/1.40 inference('cnf.neg', [status(esa)], [satz4h])).
% 1.46/1.40 thf(zip_derived_cl89, plain,
% 1.46/1.40 (~ (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @
% 1.46/1.40 (^[Y0 : $i]:
% 1.46/1.40 (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @
% 1.46/1.40 (^[Y1 : $i]:
% 1.46/1.40 (n_is @ (ordsucc @ (n_pl @ Y0 @ Y1)) @
% 1.46/1.40 (n_pl @ (ordsucc @ Y0) @ Y1))))))),
% 1.46/1.40 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.46/1.40 thf(zip_derived_cl90, plain,
% 1.46/1.40 (~ (all_of @ ((('#C') @ in @ nat)) @
% 1.46/1.40 ((('#B') @ (all_of @ ((('#C') @ in @ nat))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))))) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))))))),
% 1.46/1.40 inference('lams2combs', [status(thm)], [zip_derived_cl89])).
% 1.46/1.40 thf(zip_derived_cl160, plain,
% 1.46/1.40 (~ (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#B') @ (all_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))))) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))))))),
% 1.46/1.40 inference('rw', [status(thm)], [zip_derived_cl90, '0'])).
% 1.46/1.40 thf(def_all_of, axiom, ~ (all_of @ X0 @ X1) =>
% 1.46/1.40 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) != ($true))).
% 1.46/1.40 thf('7', plain,
% 1.46/1.40 (![X0:( $i > $o ),X1:( $i > $o )]:
% 1.46/1.40 ( ( ~( all_of @ X0 @ X1 ) ) <=>
% 1.46/1.40 ( ~( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) ) )),
% 1.46/1.40 inference('rw.lit', [status(esa)], [def_all_of])).
% 1.46/1.40 thf(zip_derived_cl161, plain,
% 1.46/1.40 (~ (((!!) @ (^[Y0 : $i]:
% 1.46/1.40 (((is_of @ Y0 @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 ((('#B') @ (all_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @
% 1.46/1.40 ((('#C') @ (!=) @ emptyset)))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))))) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc)))) @
% 1.46/1.40 Y0)))))))),
% 1.46/1.40 inference('rw_clause', [status(thm)], [zip_derived_cl160, '7'])).
% 1.46/1.40 thf(zip_derived_cl162, plain,
% 1.46/1.40 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.46/1.40 ((('#C') @ is_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @
% 1.46/1.40 ((('#C') @ (!=) @ emptyset))))))))) @
% 1.46/1.40 ((('#B') @ (all_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ ('#S') @
% 1.46/1.40 ((('#B') @ ((('#B') @ n_is)) @
% 1.46/1.40 ((('#B') @ ((('#B') @ ordsucc)) @ n_pl)))))) @
% 1.46/1.40 ((('#B') @ n_pl @ ordsucc))))))))))),
% 1.46/1.40 inference('comb-normalize', [status(thm)], [zip_derived_cl161])).
% 1.46/1.40 thf(zip_derived_cl163, plain,
% 1.46/1.40 (~ (((is_of @ '#sk2' @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @ ((('#B') @ ordsucc @ (n_pl @ '#sk2'))))) @
% 1.46/1.40 (n_pl @ (ordsucc @ '#sk2')))))))),
% 1.46/1.40 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl162])).
% 1.46/1.40 thf(zip_derived_cl164, plain,
% 1.46/1.40 (~ (((in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 1.46/1.40 (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @ ((('#B') @ ordsucc @ (n_pl @ '#sk2'))))) @
% 1.46/1.40 (n_pl @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))))))))),
% 1.46/1.40 inference('rw', [status(thm)], [zip_derived_cl163, '2', '3'])).
% 1.46/1.40 thf(zip_derived_cl166, plain,
% 1.46/1.40 (~ (all_of @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @ ((('#B') @ ordsucc @ (n_pl @ '#sk2'))))) @
% 1.46/1.40 (n_pl @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))))))),
% 1.46/1.40 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl164])).
% 1.46/1.40 thf(zip_derived_cl167, plain,
% 1.46/1.40 (~ (((!!) @ (^[Y0 : $i]:
% 1.46/1.40 (((is_of @ Y0 @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ '#sk2'))))) @
% 1.46/1.40 (n_pl @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ Y0)))))))),
% 1.46/1.40 inference('rw_clause', [status(thm)], [zip_derived_cl166, '7'])).
% 1.46/1.40 thf(zip_derived_cl168, plain,
% 1.46/1.40 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.46/1.40 ((('#C') @ is_of @
% 1.46/1.40 ((('#C') @ in @
% 1.46/1.40 (d_Sep @ omega @
% 1.46/1.40 ((('#C') @ (!=) @ emptyset))))))))) @
% 1.46/1.40 ((('#S') @ ((('#B') @ n_is @
% 1.46/1.40 ((('#B') @ ordsucc @ (n_pl @ '#sk2'))))) @
% 1.46/1.40 (n_pl @ (binunion @ '#sk2' @ (d_Sing @ '#sk2')))))))))),
% 1.46/1.40 inference('comb-normalize', [status(thm)], [zip_derived_cl167])).
% 1.46/1.40 thf(zip_derived_cl169, plain,
% 1.46/1.40 (~ (((is_of @ '#sk3' @
% 1.46/1.40 ((('#C') @ in @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))) =>
% 1.46/1.40 (n_is @ (ordsucc @ (n_pl @ '#sk2' @ '#sk3')) @
% 1.46/1.40 (n_pl @ (binunion @ '#sk2' @ (d_Sing @ '#sk2')) @ '#sk3'))))),
% 1.46/1.40 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl168])).
% 1.46/1.40 thf(zip_derived_cl170, plain,
% 1.46/1.40 (~ (((in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))) =>
% 1.46/1.40 (((binunion @ (ap @ (plus @ '#sk2') @ '#sk3') @
% 1.46/1.40 (d_Sing @ (ap @ (plus @ '#sk2') @ '#sk3'))) = (ap @
% 1.46/1.40 (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3')))))),
% 1.46/1.40 inference('rw', [status(thm)],
% 1.46/1.40 [zip_derived_cl169, '2', '3', '4', '0', '5', '6', '6'])).
% 1.46/1.40 thf(zip_derived_cl172, plain,
% 1.46/1.40 (~ (((binunion @ (ap @ (plus @ '#sk2') @ '#sk3') @
% 1.46/1.40 (d_Sing @ (ap @ (plus @ '#sk2') @ '#sk3'))) = (ap @
% 1.46/1.40 (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3')))),
% 1.46/1.40 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl170])).
% 1.46/1.40 thf(zip_derived_cl173, plain,
% 1.46/1.40 (((binunion @ (ap @ (plus @ '#sk2') @ '#sk3') @
% 1.46/1.40 (d_Sing @ (ap @ (plus @ '#sk2') @ '#sk3')))
% 1.46/1.40 != (ap @ (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3'))),
% 1.46/1.40 inference('simplify nested equalities', [status(thm)],
% 1.46/1.40 [zip_derived_cl172])).
% 1.46/1.40 thf(zip_derived_cl840, plain,
% 1.46/1.40 ((((ap @ (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3')
% 1.46/1.40 != (ap @ (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3'))
% 1.46/1.40 | ~ (in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))
% 1.46/1.40 | ~ (in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset)))))),
% 1.46/1.40 inference('sup-', [status(thm)], [zip_derived_cl185, zip_derived_cl173])).
% 1.46/1.40 thf(zip_derived_cl165, plain,
% 1.46/1.40 ( (in @ '#sk2' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))),
% 1.46/1.40 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl164])).
% 1.46/1.40 thf(zip_derived_cl171, plain,
% 1.46/1.40 ( (in @ '#sk3' @ (d_Sep @ omega @ ((('#C') @ (!=) @ emptyset))))),
% 1.46/1.40 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl170])).
% 1.46/1.40 thf(zip_derived_cl885, plain,
% 1.46/1.40 (((ap @ (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3')
% 1.46/1.40 != (ap @ (plus @ (binunion @ '#sk2' @ (d_Sing @ '#sk2'))) @ '#sk3'))),
% 1.46/1.40 inference('demod', [status(thm)],
% 1.46/1.40 [zip_derived_cl840, zip_derived_cl165, zip_derived_cl171])).
% 1.46/1.40 thf(zip_derived_cl886, plain, ($false),
% 1.46/1.40 inference('simplify', [status(thm)], [zip_derived_cl885])).
% 1.46/1.40
% 1.46/1.40 % SZS output end Refutation
% 1.46/1.40
% 1.46/1.40
% 1.46/1.40 % Terminating...
% 5.48/1.50 % Runner terminated.
% 5.48/1.51 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------