%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM641^4 : TPTP v9.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.sLoOdyxn6r true
% Computer : n023.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:47:46 PM UTC 2025
% Result : Theorem 4.80s 1.24s
% Output : Refutation 4.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 27 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 94 ( 8 ~; 3 |; 0 &; 77 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 33 ( 25 ^; 8 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(n_1_type,type,
n_1: $i ).
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(emptyset_type,type,
emptyset: $i ).
thf(n_is_type,type,
n_is: $i > $i > $o ).
thf(sk__49_type,type,
sk__49: $i ).
thf(all_of_type,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
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(satz4c,axiom,
( all_of
@ ^ [X0: $i] : ( in @ X0 @ nat )
@ ^ [X0: $i] : ( n_is @ ( n_pl @ n_1 @ X0 ) @ ( ordsucc @ X0 ) ) ) ).
thf(zf_stmt_0,axiom,
! [X4: $i] :
( ( in @ X4 @ nat )
=> ( ( n_pl @ n_1 @ X4 )
= ( ordsucc @ X4 ) ) ) ).
thf(zip_derived_cl200,plain,
! [X0: $i] :
( ( ( n_pl @ n_1 @ X0 )
= ( ordsucc @ X0 ) )
| ~ ( in @ X0 @ nat ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(def_n_1,axiom,
( n_1
= ( ordsucc @ emptyset ) ) ).
thf(zip_derived_cl175,plain,
( n_1
= ( ordsucc @ emptyset ) ),
inference(cnf,[status(esa)],[def_n_1]) ).
thf(zip_derived_cl887,plain,
! [X0: $i] :
( ( ( n_pl @ ( ordsucc @ emptyset ) @ X0 )
= ( ordsucc @ X0 ) )
| ~ ( in @ X0 @ nat ) ),
inference(demod,[status(thm)],[zip_derived_cl200,zip_derived_cl175]) ).
thf(satz4g,conjecture,
( all_of
@ ^ [X0: $i] : ( in @ X0 @ nat )
@ ^ [X0: $i] : ( n_is @ ( ordsucc @ X0 ) @ ( n_pl @ n_1 @ X0 ) ) ) ).
thf(zf_stmt_1,conjecture,
! [X4: $i] :
( ( in @ X4 @ nat )
=> ( ( ordsucc @ X4 )
= ( n_pl @ n_1 @ X4 ) ) ) ).
thf(zf_stmt_2,negated_conjecture,
~ ! [X4: $i] :
( ( in @ X4 @ nat )
=> ( ( ordsucc @ X4 )
= ( n_pl @ n_1 @ X4 ) ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl205,plain,
( ( ordsucc @ sk__49 )
!= ( n_pl @ n_1 @ sk__49 ) ),
inference(cnf,[status(esa)],[zf_stmt_2]) ).
thf(zip_derived_cl175_001,plain,
( n_1
= ( ordsucc @ emptyset ) ),
inference(cnf,[status(esa)],[def_n_1]) ).
thf(zip_derived_cl207,plain,
( ( ordsucc @ sk__49 )
!= ( n_pl @ ( ordsucc @ emptyset ) @ sk__49 ) ),
inference(demod,[status(thm)],[zip_derived_cl205,zip_derived_cl175]) ).
thf(zip_derived_cl888,plain,
( ( ( ordsucc @ sk__49 )
!= ( ordsucc @ sk__49 ) )
| ~ ( in @ sk__49 @ nat ) ),
inference('sup-',[status(thm)],[zip_derived_cl887,zip_derived_cl207]) ).
thf(zip_derived_cl204,plain,
in @ sk__49 @ nat,
inference(cnf,[status(esa)],[zf_stmt_2]) ).
thf(zip_derived_cl894,plain,
( ( ordsucc @ sk__49 )
!= ( ordsucc @ sk__49 ) ),
inference(demod,[status(thm)],[zip_derived_cl888,zip_derived_cl204]) ).
thf(zip_derived_cl895,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl894]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM641^4 : TPTP v9.2.0. Released v7.1.0.
% 0.14/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.sLoOdyxn6r true
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Wed Oct 1 16:32:53 EDT 2025
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % Running portfolio for 300 s
% 0.15/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.36 % Number of cores: 8
% 0.22/0.36 % Python version: Python 3.6.8
% 0.22/0.36 % Running in HO mode
% 0.59/0.67 % Total configuration time : 828
% 0.59/0.67 % Estimated wc time : 1656
% 0.59/0.67 % Estimated cpu time (8 cpus) : 207.0
% 0.59/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.59/0.78 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.59/0.78 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.59/0.78 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.59/0.79 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.59/0.80 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.59/0.83 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.60/0.88 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 4.80/1.24 % Solved by lams/40_noforms.sh.
% 4.80/1.24 % done 88 iterations in 0.397s
% 4.80/1.24 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 4.80/1.24 % SZS output start Refutation
% See solution above
% 4.80/1.24
% 4.80/1.24
% 4.80/1.24 % Terminating...
% 4.86/1.32 % Runner terminated.
% 4.86/1.32 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------