↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM699^1 : TPTP v9.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.rgAJIqU0ks true

% Computer : n019.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:03 PM UTC 2025

% Result   : Theorem 1.20s 1.27s
% Output   : Refutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (   2 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   46 (   5   ~;   2   |;   0   &;  38   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    8 (   0   ^;   8   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
thf(nat_type,type,
    nat: $tType ).

thf(lessis_type,type,
    lessis: nat > nat > $o ).

thf(y_type,type,
    y: nat ).

thf(pl_type,type,
    pl: nat > nat > nat ).

thf(n_1_type,type,
    n_1: nat ).

thf(suc_type,type,
    suc: nat > nat ).

thf(less_type,type,
    less: nat > nat > $o ).

thf(x_type,type,
    x: nat ).

thf(satz25b,axiom,
    ! [Xx: nat,Xy: nat] :
      ( ( less @ Xy @ Xx )
     => ( lessis @ ( pl @ Xy @ n_1 ) @ Xx ) ) ).

thf(zip_derived_cl1,plain,
    ! [X0: nat,X1: nat] :
      ( ( lessis @ ( pl @ X0 @ n_1 ) @ X1 )
      | ~ ( less @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[satz25b]) ).

thf(satz4a,axiom,
    ! [Xx: nat] :
      ( ( pl @ Xx @ n_1 )
      = ( suc @ Xx ) ) ).

thf(zip_derived_cl2,plain,
    ! [X0: nat] :
      ( ( pl @ X0 @ n_1 )
      = ( suc @ X0 ) ),
    inference(cnf,[status(esa)],[satz4a]) ).

thf(zip_derived_cl4,plain,
    ! [X0: nat,X1: nat] :
      ( ( lessis @ ( suc @ X0 ) @ X1 )
      | ~ ( less @ X0 @ X1 ) ),
    inference(demod,[status(thm)],[zip_derived_cl1,zip_derived_cl2]) ).

thf(satz25c,conjecture,
    lessis @ ( suc @ y ) @ x ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( lessis @ ( suc @ y ) @ x ),
    inference('cnf.neg',[status(esa)],[satz25c]) ).

thf(zip_derived_cl3,plain,
    ~ ( lessis @ ( suc @ y ) @ x ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl5,plain,
    ~ ( less @ y @ x ),
    inference('sup-',[status(thm)],[zip_derived_cl4,zip_derived_cl3]) ).

thf(l,axiom,
    less @ y @ x ).

thf(zip_derived_cl0,plain,
    less @ y @ x,
    inference(cnf,[status(esa)],[l]) ).

thf(zip_derived_cl7,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl5,zip_derived_cl0]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.56  % Problem  : NUM699^1 : TPTP v9.2.0. Released v3.7.0.
% 0.12/0.57  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.rgAJIqU0ks true
% 0.17/0.84  % Computer : n019.cluster.edu
% 0.17/0.84  % Model    : x86_64 x86_64
% 0.17/0.84  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.84  % Memory   : 8042.1875MB
% 0.17/0.84  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.84  % CPULimit : 300
% 0.17/0.84  % WCLimit  : 300
% 0.17/0.84  % DateTime : Wed Oct  1 16:41:54 EDT 2025
% 0.17/0.84  % CPUTime  : 
% 0.17/0.84  % Running portfolio for 300 s
% 0.17/0.84  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.84  % Number of cores: 8
% 0.17/0.84  % Python version: Python 3.6.8
% 0.17/0.85  % Running in HO mode
% 0.22/1.17  % Total configuration time : 828
% 0.22/1.17  % Estimated wc time : 1656
% 0.22/1.17  % Estimated cpu time (8 cpus) : 207.0
% 1.20/1.24  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 1.20/1.24  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 1.20/1.24  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 1.20/1.27  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 1.20/1.27  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 1.20/1.27  % Solved by lams/40_c.s.sh.
% 1.20/1.27  % done 3 iterations in 0.006s
% 1.20/1.27  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.20/1.27  % SZS output start Refutation
% See solution above
% 1.20/1.27  
% 1.20/1.27  
% 1.20/1.27  % Terminating...
% 1.46/1.36  % Runner terminated.
% 1.46/1.37  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------