TSTP Solution File: NUM736^4 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM736^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.GndKOIe3Ll true
% Computer : n001.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:46 EDT 2023
% Result : Theorem 1.89s 1.19s
% Output : Refutation 1.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM736^4 : TPTP v8.1.2. Released v7.1.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.GndKOIe3Ll true
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 17:02:29 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running portfolio for 300 s
% 0.13/0.34 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.34 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in HO mode
% 0.20/0.63 % Total configuration time : 828
% 0.20/0.63 % Estimated wc time : 1656
% 0.20/0.63 % Estimated cpu time (8 cpus) : 207.0
% 0.20/0.73 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.20/0.73 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.20/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.20/0.76 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.20/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.20/0.78 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.20/0.78 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.20/0.81 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 1.89/1.19 % Solved by lams/40_b.comb.sh.
% 1.89/1.19 % done 0 iterations in 0.376s
% 1.89/1.19 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.89/1.19 % SZS output start Refutation
% 1.89/1.19 thf(d_29_ii_type, type, d_29_ii: $i > $i > $o).
% 1.89/1.19 thf(n_1_type, type, n_1: $i).
% 1.89/1.19 thf(lessf_type, type, lessf: $i > $i > $o).
% 1.89/1.19 thf('#sk2_type', type, '#sk2': $i).
% 1.89/1.19 thf(nat_type, type, nat: $i).
% 1.89/1.19 thf(is_of_type, type, is_of: $i > ($i > $o) > $o).
% 1.89/1.19 thf(in_type, type, in: $i > $i > $o).
% 1.89/1.19 thf(l_some_type, type, l_some: $i > ($i > $o) > $o).
% 1.89/1.19 thf('#sk3_type', type, '#sk3': $i).
% 1.89/1.19 thf(n_2_type, type, n_2: $i).
% 1.89/1.19 thf(ap_type, type, ap: $i > $i > $i).
% 1.89/1.19 thf(emptyset_type, type, emptyset: $i).
% 1.89/1.19 thf(n_1t_type, type, n_1t: $i).
% 1.89/1.19 thf(frac_type, type, frac: $i).
% 1.89/1.19 thf(n_2t_type, type, n_2t: $i).
% 1.89/1.19 thf(n_ts_type, type, n_ts: $i > $i > $i).
% 1.89/1.19 thf(pair1type_type, type, pair1type: $i > $i).
% 1.89/1.19 thf(all_of_type, type, all_of: ($i > $o) > ($i > $o) > $o).
% 1.89/1.19 thf(diffprop_type, type, diffprop: $i > $i > $i > $o).
% 1.89/1.19 thf(num_type, type, num: $i > $i).
% 1.89/1.19 thf(n_some_type, type, n_some: ($i > $o) > $o).
% 1.89/1.19 thf(ordsucc_type, type, ordsucc: $i > $i).
% 1.89/1.19 thf(moref_type, type, moref: $i > $i > $o).
% 1.89/1.19 thf(outn_type, type, outn: $i > $i > $i).
% 1.89/1.19 thf(first1_type, type, first1: $i > $i > $i).
% 1.89/1.19 thf(den_type, type, den: $i > $i).
% 1.89/1.19 thf(iii_type, type, iii: $i > $i > $o).
% 1.89/1.19 thf(second1_type, type, second1: $i > $i > $i).
% 1.89/1.19 thf(n_pl_type, type, n_pl: $i > $i > $i).
% 1.89/1.19 thf(s_comb_type, type, '#S': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > (A > B) > A > C)).
% 1.89/1.19 thf(c_comb_type, type, '#C': !>[A:$tType, B:$tType, C:$tType]: ((A > B > C) > B > A > C)).
% 1.89/1.19 thf(b_comb_type, type, '#B': !>[A:$tType, B:$tType, C:$tType]: ((A > B) > (C > A) > C > B)).
% 1.89/1.19 thf(k_comb_type, type, '#K': !>[A:$tType, B:$tType]: (B > A > B)).
% 1.89/1.19 thf(i_comb_type, type, '#I': !>[A:$tType]: (A > A)).
% 1.89/1.19 thf(satz42, conjecture,
% 1.89/1.19 (all_of @
% 1.89/1.19 ( ^[X0:$i]: ( in @ X0 @ frac ) ) @
% 1.89/1.19 ( ^[X0:$i]:
% 1.89/1.19 ( all_of @
% 1.89/1.19 ( ^[X1:$i]: ( in @ X1 @ frac ) ) @
% 1.89/1.19 ( ^[X1:$i]: ( ( moref @ X0 @ X1 ) => ( lessf @ X1 @ X0 ) ) ) ) ))).
% 1.89/1.19 thf(zf_stmt_0, negated_conjecture,
% 1.89/1.19 (~( all_of @
% 1.89/1.19 ( ^[X0:$i]: ( in @ X0 @ frac ) ) @
% 1.89/1.19 ( ^[X0:$i]:
% 1.89/1.19 ( all_of @
% 1.89/1.19 ( ^[X1:$i]: ( in @ X1 @ frac ) ) @
% 1.89/1.19 ( ^[X1:$i]: ( ( moref @ X0 @ X1 ) => ( lessf @ X1 @ X0 ) ) ) ) ) )),
% 1.89/1.19 inference('cnf.neg', [status(esa)], [satz42])).
% 1.89/1.19 thf(zip_derived_cl287, plain,
% 1.89/1.19 (~ (all_of @ (^[Y0 : $i]: (in @ Y0 @ frac)) @
% 1.89/1.19 (^[Y0 : $i]:
% 1.89/1.19 (all_of @ (^[Y1 : $i]: (in @ Y1 @ frac)) @
% 1.89/1.19 (^[Y1 : $i]: (((moref @ Y0 @ Y1) => (lessf @ Y1 @ Y0)))))))),
% 1.89/1.19 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.89/1.19 thf(zip_derived_cl288, plain,
% 1.89/1.19 (~ (all_of @ ((('#C') @ in @ frac)) @
% 1.89/1.19 ((('#B') @ (all_of @ ((('#C') @ in @ frac))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ ('#S') @
% 1.89/1.19 ((('#B') @ ((('#B') @ (=>))) @ moref)))) @
% 1.89/1.19 ((('#C') @ lessf)))))))),
% 1.89/1.19 inference('lams2combs', [status(thm)], [zip_derived_cl287])).
% 1.89/1.19 thf(def_frac, axiom,(( frac ) = ((pair1type @ nat)))).
% 1.89/1.19 thf('0', plain, (( frac ) = ( pair1type @ nat )), define([status(thm)])).
% 1.89/1.19 thf(zip_derived_cl443, plain,
% 1.89/1.19 (~ (all_of @ ((('#C') @ in @ (pair1type @ nat))) @
% 1.89/1.19 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ ('#S') @
% 1.89/1.19 ((('#B') @ ((('#B') @ (=>))) @ moref)))) @
% 1.89/1.19 ((('#C') @ lessf)))))))),
% 1.89/1.19 inference('rw', [status(thm)], [zip_derived_cl288, '0'])).
% 1.89/1.19 thf(def_all_of, axiom, ~ (all_of @ X0 @ X1) =>
% 1.89/1.19 ((((!!) @ (^[Y0 : $i]: (((is_of @ Y0 @ X0) => (X1 @ Y0)))))) != ($true))).
% 1.89/1.19 thf('1', plain,
% 1.89/1.19 (![X0:( $i > $o ),X1:( $i > $o )]:
% 1.89/1.19 ( ( ~( all_of @ X0 @ X1 ) ) <=>
% 1.89/1.19 ( ~( ![X6:$i]: ( ( is_of @ X6 @ X0 ) => ( X1 @ X6 ) ) ) ) )),
% 1.89/1.19 inference('rw.lit', [status(esa)], [def_all_of])).
% 1.89/1.19 thf(zip_derived_cl444, plain,
% 1.89/1.19 (~ (((!!) @ (^[Y0 : $i]:
% 1.89/1.19 (((is_of @ Y0 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 1.89/1.19 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ ('#S') @
% 1.89/1.19 ((('#B') @ ((('#B') @ (=>))) @ moref)))) @
% 1.89/1.19 ((('#C') @ lessf)))) @
% 1.89/1.19 Y0)))))))),
% 1.89/1.19 inference('rw_clause', [status(thm)], [zip_derived_cl443, '1'])).
% 1.89/1.19 thf(zip_derived_cl445, plain,
% 1.89/1.19 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.89/1.19 ((('#C') @ is_of @
% 1.89/1.19 ((('#C') @ in @ (pair1type @ nat))))))) @
% 1.89/1.19 ((('#B') @ (all_of @ ((('#C') @ in @ (pair1type @ nat)))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ ('#S') @
% 1.89/1.19 ((('#B') @ ((('#B') @ (=>))) @ moref)))) @
% 1.89/1.19 ((('#C') @ lessf))))))))))),
% 1.89/1.19 inference('comb-normalize', [status(thm)], [zip_derived_cl444])).
% 1.89/1.19 thf(zip_derived_cl446, plain,
% 1.89/1.19 (~ (((is_of @ '#sk2' @ ((('#C') @ in @ (pair1type @ nat)))) => (all_of @
% 1.89/1.19 ((('#C') @ in @ (pair1type @ nat))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ (=>) @ (moref @ '#sk2'))) @
% 1.89/1.19 ((('#C') @ lessf @ '#sk2')))))))),
% 1.89/1.19 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl445])).
% 1.89/1.19 thf(zip_derived_cl448, plain,
% 1.89/1.19 (~ (all_of @ ((('#C') @ in @ (pair1type @ nat))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ (=>) @ (moref @ '#sk2'))) @
% 1.89/1.19 ((('#C') @ lessf @ '#sk2')))))),
% 1.89/1.19 inference('lazy_cnf_imply', [status(thm)], [zip_derived_cl446])).
% 1.89/1.19 thf(zip_derived_cl449, plain,
% 1.89/1.19 (~ (((!!) @ (^[Y0 : $i]:
% 1.89/1.19 (((is_of @ Y0 @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 1.89/1.19 ((('#S') @ ((('#B') @ (=>) @ (moref @ '#sk2'))) @
% 1.89/1.19 ((('#C') @ lessf @ '#sk2')) @ Y0)))))))),
% 1.89/1.19 inference('rw_clause', [status(thm)], [zip_derived_cl448, '1'])).
% 1.89/1.19 thf(zip_derived_cl450, plain,
% 1.89/1.19 (~ (((!!) @ ((('#S') @ ((('#B') @ (=>) @
% 1.89/1.19 ((('#C') @ is_of @
% 1.89/1.19 ((('#C') @ in @ (pair1type @ nat))))))) @
% 1.89/1.19 ((('#S') @ ((('#B') @ (=>) @ (moref @ '#sk2'))) @
% 1.89/1.19 ((('#C') @ lessf @ '#sk2'))))))))),
% 1.89/1.19 inference('comb-normalize', [status(thm)], [zip_derived_cl449])).
% 1.89/1.19 thf(zip_derived_cl451, plain,
% 1.89/1.19 (~ (((is_of @ '#sk3' @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 1.89/1.19 (((moref @ '#sk2' @ '#sk3') => (lessf @ '#sk3' @ '#sk2')))))),
% 1.89/1.19 inference('lazy_cnf_exists', [status(thm)], [zip_derived_cl450])).
% 1.89/1.19 thf(def_n_some, axiom,(( n_some @ (X0)) = ((l_some @ nat @ X0)))).
% 1.89/1.19 thf('2', plain,
% 1.89/1.19 (![X0:( $i > $o )]: ( ( n_some @ X0 ) = ( l_some @ nat @ X0 ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_n_1, axiom,(( n_1 ) = ((ordsucc @ emptyset)))).
% 1.89/1.19 thf('3', plain, (( n_1 ) = ( ordsucc @ emptyset )), define([status(thm)])).
% 1.89/1.19 thf(def_d_29_ii, axiom,(( d_29_ii @ (X0)@ (X1)) =
% 1.89/1.19 ((n_some @ (diffprop @ X0 @ X1))))).
% 1.89/1.19 thf('4', plain,
% 1.89/1.19 (![X1:$i,X0:$i]:
% 1.89/1.19 ( ( d_29_ii @ X0 @ X1 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_iii, axiom,(( iii @ (X1)@ (X0)) = ((n_some @ (diffprop @ X0 @ X1))))).
% 1.89/1.19 thf('5', plain,
% 1.89/1.19 (![X1:$i,X0:$i]:
% 1.89/1.19 ( ( iii @ X1 @ X0 ) = ( n_some @ ( diffprop @ X0 @ X1 ) ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_n_2, axiom,(( n_2 ) = ((n_pl @ n_1 @ n_1)))).
% 1.89/1.19 thf('6', plain, (( n_2 ) = ( n_pl @ n_1 @ n_1 )), define([status(thm)])).
% 1.89/1.19 thf(def_n_1t, axiom,(( n_1t ) = ((outn @ n_2 @ n_1)))).
% 1.89/1.19 thf('7', plain, (( n_1t ) = ( outn @ n_2 @ n_1 )), define([status(thm)])).
% 1.89/1.19 thf(def_n_2t, axiom,(( n_2t ) = ((outn @ n_2 @ n_2)))).
% 1.89/1.19 thf('8', plain, (( n_2t ) = ( outn @ n_2 @ n_2 )), define([status(thm)])).
% 1.89/1.19 thf(def_first1, axiom,(( first1 @ (X1)@ (X0)) = ((ap @ X0 @ n_1t)))).
% 1.89/1.19 thf('9', plain,
% 1.89/1.19 (![X1:$i,X0:$i]: ( ( first1 @ X1 @ X0 ) = ( ap @ X0 @ n_1t ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_second1, axiom,(( second1 @ (X1)@ (X0)) = ((ap @ X0 @ n_2t)))).
% 1.89/1.19 thf('10', plain,
% 1.89/1.19 (![X1:$i,X0:$i]: ( ( second1 @ X1 @ X0 ) = ( ap @ X0 @ n_2t ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_num, axiom,(( num @ (X0)) = ((first1 @ nat @ X0)))).
% 1.89/1.19 thf('11', plain, (![X0:$i]: ( ( num @ X0 ) = ( first1 @ nat @ X0 ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_den, axiom,(( den @ (X0)) = ((second1 @ nat @ X0)))).
% 1.89/1.19 thf('12', plain, (![X0:$i]: ( ( den @ X0 ) = ( second1 @ nat @ X0 ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_moref, axiom,(( moref @ (X0)@ (X1)) =
% 1.89/1.19 ((d_29_ii @ (n_ts @ (num @ X0) @ (den @ X1)) @
% 1.89/1.19 (n_ts @ (num @ X1) @ (den @ X0)))))).
% 1.89/1.19 thf('13', plain,
% 1.89/1.19 (![X1:$i,X0:$i]:
% 1.89/1.19 ( ( moref @ X0 @ X1 ) =
% 1.89/1.19 ( d_29_ii @
% 1.89/1.19 ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @
% 1.89/1.19 ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(def_lessf, axiom,(( lessf @ (X0)@ (X1)) =
% 1.89/1.19 ((iii @ (n_ts @ (num @ X0) @ (den @ X1)) @ (n_ts @ (num @ X1) @ (den @ X0)))))).
% 1.89/1.19 thf('14', plain,
% 1.89/1.19 (![X1:$i,X0:$i]:
% 1.89/1.19 ( ( lessf @ X0 @ X1 ) =
% 1.89/1.19 ( iii @
% 1.89/1.19 ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @
% 1.89/1.19 ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) )),
% 1.89/1.19 define([status(thm)])).
% 1.89/1.19 thf(zip_derived_cl452, plain,
% 1.89/1.19 (~ (((is_of @ '#sk3' @ ((('#C') @ in @ (pair1type @ nat)))) =>
% 1.89/1.19 (((l_some @ nat @
% 1.89/1.19 (diffprop @
% 1.89/1.19 (n_ts @
% 1.89/1.19 (ap @ '#sk2' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (ordsucc @ emptyset))) @
% 1.89/1.19 (ap @ '#sk3' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset))))) @
% 1.89/1.19 (n_ts @
% 1.89/1.19 (ap @ '#sk3' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (ordsucc @ emptyset))) @
% 1.89/1.19 (ap @ '#sk2' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset))))))) =>
% 1.89/1.19 (l_some @ nat @
% 1.89/1.19 (diffprop @
% 1.89/1.19 (n_ts @
% 1.89/1.19 (ap @ '#sk2' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (ordsucc @ emptyset))) @
% 1.89/1.19 (ap @ '#sk3' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset))))) @
% 1.89/1.19 (n_ts @
% 1.89/1.19 (ap @ '#sk3' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (ordsucc @ emptyset))) @
% 1.89/1.19 (ap @ '#sk2' @
% 1.89/1.19 (outn @ (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)) @
% 1.89/1.19 (n_pl @ (ordsucc @ emptyset) @ (ordsucc @ emptyset)))))))))))),
% 1.89/1.19 inference('rw', [status(thm)],
% 1.89/1.19 [zip_derived_cl451, '2', '3', '4', '5', '6', '7', '8', '9',
% 1.89/1.19 '9', '10', '10', '11', '11', '12', '12', '13', '14'])).
% 1.89/1.19 thf(zip_derived_cl453, plain, ($false),
% 1.89/1.19 inference('simplify boolean subterms', [status(thm)], [zip_derived_cl452])).
% 1.89/1.19
% 1.89/1.19 % SZS output end Refutation
% 1.89/1.19
% 1.89/1.19
% 1.89/1.19 % Terminating...
% 2.69/1.25 % Runner terminated.
% 2.69/1.26 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------