TSTP Solution File: SEU115+1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SEU115+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.ixZkd17eEQ true

% Computer : n009.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 19:10:30 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(empty_set_type,type,
    empty_set: $i ).

thf(powerset_type,type,
    powerset: $i > $i ).

thf(empty_type,type,
    empty: $i > $o ).

thf(singleton_type,type,
    singleton: $i > $i ).

thf(finite_type,type,
    finite: $i > $o ).

thf(finite_subsets_type,type,
    finite_subsets: $i > $i ).

thf(cc1_finset_1,axiom,
    ! [A: $i] :
      ( ( empty @ A )
     => ( finite @ A ) ) ).

thf(zip_derived_cl10,plain,
    ! [X0: $i] :
      ( ( finite @ X0 )
      | ~ ( empty @ X0 ) ),
    inference(cnf,[status(esa)],[cc1_finset_1]) ).

thf(t27_finsub_1,axiom,
    ! [A: $i] :
      ( ( finite @ A )
     => ( ( finite_subsets @ A )
        = ( powerset @ A ) ) ) ).

thf(zip_derived_cl62,plain,
    ! [X0: $i] :
      ( ( ( finite_subsets @ X0 )
        = ( powerset @ X0 ) )
      | ~ ( finite @ X0 ) ),
    inference(cnf,[status(esa)],[t27_finsub_1]) ).

thf(t28_finsub_1,conjecture,
    ( ( finite_subsets @ empty_set )
    = ( singleton @ empty_set ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ( ( finite_subsets @ empty_set )
   != ( singleton @ empty_set ) ),
    inference('cnf.neg',[status(esa)],[t28_finsub_1]) ).

thf(zip_derived_cl61,plain,
    ( ( finite_subsets @ empty_set )
   != ( singleton @ empty_set ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(t1_zfmisc_1,axiom,
    ( ( powerset @ empty_set )
    = ( singleton @ empty_set ) ) ).

thf(zip_derived_cl63,plain,
    ( ( powerset @ empty_set )
    = ( singleton @ empty_set ) ),
    inference(cnf,[status(esa)],[t1_zfmisc_1]) ).

thf(zip_derived_cl277,plain,
    ( ( finite_subsets @ empty_set )
   != ( powerset @ empty_set ) ),
    inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl63]) ).

thf(zip_derived_cl293,plain,
    ( ~ ( finite @ empty_set )
    | ( ( powerset @ empty_set )
     != ( powerset @ empty_set ) ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl277]) ).

thf(zip_derived_cl295,plain,
    ~ ( finite @ empty_set ),
    inference(simplify,[status(thm)],[zip_derived_cl293]) ).

thf(zip_derived_cl296,plain,
    ~ ( empty @ empty_set ),
    inference('s_sup-',[status(thm)],[zip_derived_cl10,zip_derived_cl295]) ).

thf(fc1_xboole_0,axiom,
    empty @ empty_set ).

thf(zip_derived_cl57,plain,
    empty @ empty_set,
    inference(cnf,[status(esa)],[fc1_xboole_0]) ).

thf(zip_derived_cl297,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl296,zip_derived_cl57]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU115+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.ixZkd17eEQ true
% 0.13/0.34  % Computer : n009.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 Aug 23 15:33:51 EDT 2023
% 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.20/0.35  % Python version: Python 3.6.8
% 0.20/0.35  % Running in FO mode
% 0.20/0.66  % Total configuration time : 435
% 0.20/0.66  % Estimated wc time : 1092
% 0.20/0.66  % Estimated cpu time (7 cpus) : 156.0
% 0.20/0.70  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.20/0.73  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.20/0.74  % Solved by fo/fo6_bce.sh.
% 0.20/0.74  % BCE start: 64
% 0.20/0.74  % BCE eliminated: 8
% 0.20/0.74  % PE start: 56
% 0.20/0.74  logic: eq
% 0.20/0.74  % PE eliminated: 15
% 0.20/0.74  % done 34 iterations in 0.015s
% 0.20/0.74  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.20/0.74  % SZS output start Refutation
% See solution above
% 0.20/0.74  
% 0.20/0.74  
% 0.20/0.74  % Terminating...
% 0.58/0.85  % Runner terminated.
% 0.58/0.87  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------