TSTP Solution File: NUM635^1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM635^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.x4Xoc4q9gm true

% Computer : n026.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:42:55 EDT 2023

% Result   : Theorem 1.05s 0.77s
% Output   : Refutation 1.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   18 (   7 unt;   4 typ;   0 def)
%            Number of atoms       :   24 (  20 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   39 (   6   ~;   3   |;   0   &;  23   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-2 aty)
%                                         (   3  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   13 (   3   ^;  10   !;   0   ?;  13   :)

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

thf(y_type,type,
    y: nat ).

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

thf(x_type,type,
    x: nat ).

thf(satz1,conjecture,
    ( ( suc @ x )
   != ( suc @ y ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ( ( suc @ x )
    = ( suc @ y ) ),
    inference('cnf.neg',[status(esa)],[satz1]) ).

thf(zip_derived_cl2,plain,
    ( ( suc @ x )
    = ( suc @ y ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(ax4,axiom,
    ! [Xx: nat,Xy: nat] :
      ( ( ( suc @ Xx )
        = ( suc @ Xy ) )
     => ( Xx = Xy ) ) ).

thf(zip_derived_cl1,plain,
    ( !!
    @ ^ [Y0: nat] :
        ( !!
        @ ^ [Y1: nat] :
            ( ( ( suc @ Y0 )
              = ( suc @ Y1 ) )
           => ( Y0 = Y1 ) ) ) ),
    inference(cnf,[status(esa)],[ax4]) ).

thf(zip_derived_cl3,plain,
    ! [X2: nat] :
      ( !!
      @ ^ [Y0: nat] :
          ( ( ( suc @ X2 )
            = ( suc @ Y0 ) )
         => ( X2 = Y0 ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl4,plain,
    ! [X2: nat,X4: nat] :
      ( ( ( suc @ X2 )
        = ( suc @ X4 ) )
     => ( X2 = X4 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl3]) ).

thf(zip_derived_cl5,plain,
    ! [X2: nat,X4: nat] :
      ( ( ( suc @ X2 )
       != ( suc @ X4 ) )
      | ( X2 = X4 ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl4]) ).

thf(zip_derived_cl6,plain,
    ! [X2: nat,X4: nat] :
      ( ( ( suc @ X2 )
       != ( suc @ X4 ) )
      | ( X2 = X4 ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl5]) ).

thf(zip_derived_cl7,plain,
    ! [X0: nat] :
      ( ( ( suc @ X0 )
       != ( suc @ x ) )
      | ( X0 = y ) ),
    inference('sup-',[status(thm)],[zip_derived_cl2,zip_derived_cl6]) ).

thf(zip_derived_cl14,plain,
    x = y,
    inference(eq_res,[status(thm)],[zip_derived_cl7]) ).

thf(n,axiom,
    x != y ).

thf(zip_derived_cl0,plain,
    x != y,
    inference(cnf,[status(esa)],[n]) ).

thf(zip_derived_cl17,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl14,zip_derived_cl0]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUM635^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.x4Xoc4q9gm true
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri Aug 25 15:03:17 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % Running portfolio for 300 s
% 0.14/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.35  % Number of cores: 8
% 0.22/0.36  % Python version: Python 3.6.8
% 0.22/0.36  % Running in HO mode
% 0.22/0.68  % Total configuration time : 828
% 0.22/0.68  % Estimated wc time : 1656
% 0.22/0.68  % Estimated cpu time (8 cpus) : 207.0
% 0.22/0.74  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.22/0.74  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.22/0.74  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.22/0.75  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.22/0.75  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.22/0.76  % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.22/0.76  % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.22/0.77  % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 1.05/0.77  % Solved by lams/35_full_unif4.sh.
% 1.05/0.77  % done 3 iterations in 0.006s
% 1.05/0.77  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.05/0.77  % SZS output start Refutation
% See solution above
% 1.05/0.77  
% 1.05/0.77  
% 1.05/0.77  % Terminating...
% 1.56/0.87  % Runner terminated.
% 1.56/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------