%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM660^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.8lolLQs4yb true

% Computer : n016.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:11 EDT 2023

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

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

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

thf(y_type,type,
    y: nat ).

thf(more_type,type,
    more: nat > nat > $o ).

thf(x_type,type,
    x: nat ).

thf(satz13,conjecture,
    ( ~ ( less @ y @ x )
   => ( y = x ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( ~ ( less @ y @ x )
     => ( y = x ) ),
    inference('cnf.neg',[status(esa)],[satz13]) ).

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

thf(zip_derived_cl3,plain,
    ~ ( less @ y @ x ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl2]) ).

thf(satz11,axiom,
    ! [Xx: nat,Xy: nat] :
      ( ( more @ Xx @ Xy )
     => ( less @ Xy @ Xx ) ) ).

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

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

thf(zip_derived_cl9,plain,
    ! [X2: nat,X4: nat] :
      ( ( more @ X2 @ X4 )
     => ( less @ X4 @ X2 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl8]) ).

thf(zip_derived_cl10,plain,
    ! [X2: nat,X4: nat] :
      ( ~ ( more @ X2 @ X4 )
      | ( less @ X4 @ X2 ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl9]) ).

thf(zip_derived_cl12,plain,
    ~ ( more @ x @ y ),
    inference('sup+',[status(thm)],[zip_derived_cl3,zip_derived_cl10]) ).

thf(m,axiom,
    ( ~ ( more @ x @ y )
   => ( x = y ) ) ).

thf(zip_derived_cl0,plain,
    ( ( (~) @ ( more @ x @ y ) )
   => ( x = y ) ),
    inference(cnf,[status(esa)],[m]) ).

thf(zip_derived_cl4,plain,
    y != x,
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl2]) ).

thf(zip_derived_cl5,plain,
    y != x,
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl4]) ).

thf(zip_derived_cl6,plain,
    ( ( (~) @ ( more @ x @ y ) )
   => $false ),
    inference(inner_simplify_reflect,[status(thm)],[zip_derived_cl0,zip_derived_cl5]) ).

thf(zip_derived_cl7,plain,
    more @ x @ y,
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl6]) ).

thf(zip_derived_cl15,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl12,zip_derived_cl7]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUM660^1 : TPTP v8.1.2. Released v3.7.0.
% 0.13/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.8lolLQs4yb true
% 0.14/0.35  % Computer : n016.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 14:05:40 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.14/0.35  % Number of cores: 8
% 0.14/0.36  % Python version: Python 3.6.8
% 0.14/0.36  % Running in HO mode
% 0.21/0.65  % Total configuration time : 828
% 0.21/0.65  % Estimated wc time : 1656
% 0.21/0.65  % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.74  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.74  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.21/0.75  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.21/0.75  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.21/0.76  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.21/0.76  % Solved by lams/35_full_unif4.sh.
% 0.21/0.76  % done 3 iterations in 0.006s
% 0.21/0.76  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.21/0.76  % SZS output start Refutation
% See solution above
% 0.21/0.76  
% 0.21/0.76  
% 0.21/0.76  % Terminating...
% 1.12/0.84  % Runner terminated.
% 1.12/0.85  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------