↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM706^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.BpAVhKHVXD 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 Oct  2 04:48:05 PM UTC 2025

% Result   : Theorem 5.13s 1.27s
% Output   : Refutation 5.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   53 (  22 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   67 (   6   ~;   2   |;   0   &;  53   @)
%                                         (   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     :   11 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   32 (  25   ^;   7   !;   0   ?;  32   :)

% 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(sk__124_type,type,
    sk__124: $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(e_is_type,type,
    e_is: $i > $i > $i > $o ).

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(satz28a,axiom,
    ( all_of
    @ ^ [X0: $i] : ( in @ X0 @ nat )
    @ ^ [X0: $i] : ( n_is @ ( n_ts @ X0 @ n_1 ) @ X0 ) ) ).

thf(zf_stmt_0,axiom,
    ! [X4: $i] :
      ( ( in @ X4 @ nat )
     => ( ( n_ts @ X4 @ n_1 )
        = X4 ) ) ).

thf(zip_derived_cl458,plain,
    ! [X0: $i] :
      ( ( ( n_ts @ X0 @ n_1 )
        = X0 )
      | ~ ( in @ X0 @ nat ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(satz28e,conjecture,
    ( all_of
    @ ^ [X0: $i] : ( in @ X0 @ nat )
    @ ^ [X0: $i] : ( n_is @ X0 @ ( n_ts @ X0 @ n_1 ) ) ) ).

thf(zf_stmt_1,conjecture,
    ! [X4: $i] :
      ( ( in @ X4 @ nat )
     => ( X4
        = ( n_ts @ X4 @ n_1 ) ) ) ).

thf(zf_stmt_2,negated_conjecture,
    ~ ! [X4: $i] :
        ( ( in @ X4 @ nat )
       => ( X4
          = ( n_ts @ X4 @ n_1 ) ) ),
    inference('cnf.neg',[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl463,plain,
    ( sk__124
   != ( n_ts @ sk__124 @ n_1 ) ),
    inference(cnf,[status(esa)],[zf_stmt_2]) ).

thf(zip_derived_cl1110,plain,
    ( ( sk__124 != sk__124 )
    | ~ ( in @ sk__124 @ nat ) ),
    inference('sup-',[status(thm)],[zip_derived_cl458,zip_derived_cl463]) ).

thf(zip_derived_cl462,plain,
    in @ sk__124 @ nat,
    inference(cnf,[status(esa)],[zf_stmt_2]) ).

thf(zip_derived_cl1112,plain,
    sk__124 != sk__124,
    inference(demod,[status(thm)],[zip_derived_cl1110,zip_derived_cl462]) ).

thf(zip_derived_cl1113,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl1112]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM706^4 : TPTP v9.2.0. Released v7.1.0.
% 0.13/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.BpAVhKHVXD 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 : Wed Oct  1 16:36:53 EDT 2025
% 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.56/0.69  % Total configuration time : 828
% 0.56/0.69  % Estimated wc time : 1656
% 0.56/0.69  % Estimated cpu time (8 cpus) : 207.0
% 0.57/0.73  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.57/0.74  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.57/0.74  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.57/0.74  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.57/0.76  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.57/0.76  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.57/0.77  % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 0.57/0.77  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 5.13/1.27  % Solved by lams/40_noforms.sh.
% 5.13/1.27  % done 132 iterations in 0.497s
% 5.13/1.27  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 5.13/1.27  % SZS output start Refutation
% See solution above
% 5.13/1.27  
% 5.13/1.27  
% 5.13/1.27  % Terminating...
% 5.68/1.38  % Runner terminated.
% 5.68/1.39  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------