TSTP Solution File: NUM709^4 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM709^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.by437OJoMt true
% Computer : n004.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:40 EDT 2023
% Result : Theorem 38.31s 5.58s
% Output : Refutation 38.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 45 ( 18 unt; 11 typ; 0 def)
% Number of atoms : 97 ( 32 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 288 ( 17 ~; 8 |; 0 &; 234 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 5 con; 0-3 aty)
% ( 8 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 54 ( 37 ^; 17 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $i ).
thf(is_of_type,type,
is_of: $i > ( $i > $o ) > $o ).
thf(in_type,type,
in: $i > $i > $o ).
thf('#sk963_type',type,
'#sk963': $i ).
thf(n_is_type,type,
n_is: $i > $i > $o ).
thf(n_ts_type,type,
n_ts: $i > $i > $i ).
thf(all_of_type,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf('#sk964_type',type,
'#sk964': $i ).
thf(ordsucc_type,type,
ordsucc: $i > $i ).
thf(e_is_type,type,
e_is: $i > $i > $i > $o ).
thf(n_pl_type,type,
n_pl: $i > $i > $i ).
thf(def_n_is,axiom,
( n_is
= ( e_is @ nat ) ) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X0: $i,X: $i,Y: $i] : ( X = Y ) ) ) ).
thf('0',plain,
( e_is
= ( ^ [X0: $i,X: $i,Y: $i] : ( X = Y ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_e_is]) ).
thf('1',plain,
( e_is
= ( ^ [V_1: $i,V_2: $i,V_3: $i] : ( V_2 = V_3 ) ) ),
define([status(thm)]) ).
thf('2',plain,
( n_is
= ( e_is @ nat ) ),
inference(simplify_rw_rule,[status(thm)],[def_n_is,'1']) ).
thf('3',plain,
( n_is
= ( e_is @ nat ) ),
define([status(thm)]) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( is_of @ X2 @ X0 )
=> ( X1 @ X2 ) ) ) ) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X0: $i,X1: $i > $o] : ( X1 @ X0 ) ) ) ).
thf('4',plain,
( is_of
= ( ^ [X0: $i,X1: $i > $o] : ( X1 @ X0 ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_is_of]) ).
thf('5',plain,
( is_of
= ( ^ [V_1: $i,V_2: $i > $o] : ( V_2 @ V_1 ) ) ),
define([status(thm)]) ).
thf('6',plain,
( all_of
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( is_of @ X2 @ X0 )
=> ( X1 @ X2 ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_all_of,'5']) ).
thf('7',plain,
( all_of
= ( ^ [V_1: $i > $o,V_2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ V_1 )
=> ( V_2 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(satz28d,axiom,
( all_of
@ ^ [X0: $i] : ( in @ X0 @ nat )
@ ^ [X0: $i] :
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( n_ts @ ( ordsucc @ X0 ) @ X1 ) @ ( n_pl @ ( n_ts @ X0 @ X1 ) @ X1 ) ) ) ) ).
thf(zf_stmt_0,axiom,
! [X4: $i] :
( ( in @ X4 @ nat )
=> ! [X6: $i] :
( ( in @ X6 @ nat )
=> ( ( n_ts @ ( ordsucc @ X4 ) @ X6 )
= ( n_pl @ ( n_ts @ X4 @ X6 ) @ X6 ) ) ) ) ).
thf(zip_derived_cl215,plain,
( !!
@ ^ [Y0: $i] :
( ( in @ Y0 @ nat )
=> ( !!
@ ^ [Y1: $i] :
( ( in @ Y1 @ nat )
=> ( ( n_ts @ ( ordsucc @ Y0 ) @ Y1 )
= ( n_pl @ ( n_ts @ Y0 @ Y1 ) @ Y1 ) ) ) ) ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl4466,plain,
! [X2: $i] :
( ( in @ X2 @ nat )
=> ( !!
@ ^ [Y0: $i] :
( ( in @ Y0 @ nat )
=> ( ( n_ts @ ( ordsucc @ X2 ) @ Y0 )
= ( n_pl @ ( n_ts @ X2 @ Y0 ) @ Y0 ) ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl215]) ).
thf(zip_derived_cl4467,plain,
! [X2: $i] :
( ~ ( in @ X2 @ nat )
| ( !!
@ ^ [Y0: $i] :
( ( in @ Y0 @ nat )
=> ( ( n_ts @ ( ordsucc @ X2 ) @ Y0 )
= ( n_pl @ ( n_ts @ X2 @ Y0 ) @ Y0 ) ) ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl4466]) ).
thf(zip_derived_cl4468,plain,
! [X2: $i,X4: $i] :
( ( ( in @ X4 @ nat )
=> ( ( n_ts @ ( ordsucc @ X2 ) @ X4 )
= ( n_pl @ ( n_ts @ X2 @ X4 ) @ X4 ) ) )
| ~ ( in @ X2 @ nat ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl4467]) ).
thf(zip_derived_cl4469,plain,
! [X2: $i,X4: $i] :
( ~ ( in @ X4 @ nat )
| ( ( n_ts @ ( ordsucc @ X2 ) @ X4 )
= ( n_pl @ ( n_ts @ X2 @ X4 ) @ X4 ) )
| ~ ( in @ X2 @ nat ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl4468]) ).
thf(zip_derived_cl4470,plain,
! [X2: $i,X4: $i] :
( ~ ( in @ X4 @ nat )
| ( ( n_ts @ ( ordsucc @ X2 ) @ X4 )
= ( n_pl @ ( n_ts @ X2 @ X4 ) @ X4 ) )
| ~ ( in @ X2 @ nat ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl4469]) ).
thf(satz28h,conjecture,
( all_of
@ ^ [X0: $i] : ( in @ X0 @ nat )
@ ^ [X0: $i] :
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( n_pl @ ( n_ts @ X0 @ X1 ) @ X1 ) @ ( n_ts @ ( ordsucc @ X0 ) @ X1 ) ) ) ) ).
thf(zf_stmt_1,conjecture,
! [X4: $i] :
( ( in @ X4 @ nat )
=> ! [X6: $i] :
( ( in @ X6 @ nat )
=> ( ( n_pl @ ( n_ts @ X4 @ X6 ) @ X6 )
= ( n_ts @ ( ordsucc @ X4 ) @ X6 ) ) ) ) ).
thf(zf_stmt_2,negated_conjecture,
~ ! [X4: $i] :
( ( in @ X4 @ nat )
=> ! [X6: $i] :
( ( in @ X6 @ nat )
=> ( ( n_pl @ ( n_ts @ X4 @ X6 ) @ X6 )
= ( n_ts @ ( ordsucc @ X4 ) @ X6 ) ) ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl219,plain,
~ ( !!
@ ^ [Y0: $i] :
( ( in @ Y0 @ nat )
=> ( !!
@ ^ [Y1: $i] :
( ( in @ Y1 @ nat )
=> ( ( n_pl @ ( n_ts @ Y0 @ Y1 ) @ Y1 )
= ( n_ts @ ( ordsucc @ Y0 ) @ Y1 ) ) ) ) ) ),
inference(cnf,[status(esa)],[zf_stmt_2]) ).
thf(zip_derived_cl1272,plain,
~ ( ( in @ '#sk963' @ nat )
=> ( !!
@ ^ [Y0: $i] :
( ( in @ Y0 @ nat )
=> ( ( n_pl @ ( n_ts @ '#sk963' @ Y0 ) @ Y0 )
= ( n_ts @ ( ordsucc @ '#sk963' ) @ Y0 ) ) ) ) ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl219]) ).
thf(zip_derived_cl1274,plain,
~ ( !!
@ ^ [Y0: $i] :
( ( in @ Y0 @ nat )
=> ( ( n_pl @ ( n_ts @ '#sk963' @ Y0 ) @ Y0 )
= ( n_ts @ ( ordsucc @ '#sk963' ) @ Y0 ) ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl1272]) ).
thf(zip_derived_cl1275,plain,
~ ( ( in @ '#sk964' @ nat )
=> ( ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' )
= ( n_ts @ ( ordsucc @ '#sk963' ) @ '#sk964' ) ) ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl1274]) ).
thf(zip_derived_cl1277,plain,
( ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' )
!= ( n_ts @ ( ordsucc @ '#sk963' ) @ '#sk964' ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl1275]) ).
thf(zip_derived_cl1278,plain,
( ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' )
!= ( n_ts @ ( ordsucc @ '#sk963' ) @ '#sk964' ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl1277]) ).
thf(zip_derived_cl4471,plain,
( ( ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' )
!= ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' ) )
| ~ ( in @ '#sk963' @ nat )
| ~ ( in @ '#sk964' @ nat ) ),
inference('sup-',[status(thm)],[zip_derived_cl4470,zip_derived_cl1278]) ).
thf(zip_derived_cl1273,plain,
in @ '#sk963' @ nat,
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl1272]) ).
thf(zip_derived_cl1276,plain,
in @ '#sk964' @ nat,
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl1275]) ).
thf(zip_derived_cl4501,plain,
( ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' )
!= ( n_pl @ ( n_ts @ '#sk963' @ '#sk964' ) @ '#sk964' ) ),
inference(demod,[status(thm)],[zip_derived_cl4471,zip_derived_cl1273,zip_derived_cl1276]) ).
thf(zip_derived_cl4502,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl4501]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM709^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.by437OJoMt true
% 0.13/0.34 % Computer : n004.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 14:41:53 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.66 % Total configuration time : 828
% 0.20/0.66 % Estimated wc time : 1656
% 0.20/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.56/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.56/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.56/0.76 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.56/0.76 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.56/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.56/0.76 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 38.31/5.58 % Solved by lams/35_full_unif4.sh.
% 38.31/5.58 % done 450 iterations in 4.800s
% 38.31/5.58 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 38.31/5.58 % SZS output start Refutation
% See solution above
% 38.31/5.58
% 38.31/5.58
% 38.31/5.58 % Terminating...
% 39.74/5.75 % Runner terminated.
% 39.74/5.76 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------