TSTP Solution File: SET639+3 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SET639+3 : TPTP v8.1.2. Released v2.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.ZabPDPixZZ 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 Aug 31 16:15:15 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(sk__4_type,type,
    sk__4: $i ).

thf(intersection_type,type,
    intersection: $i > $i > $i ).

thf(empty_set_type,type,
    empty_set: $i ).

thf(subset_type,type,
    subset: $i > $i > $o ).

thf(sk__3_type,type,
    sk__3: $i ).

thf(prove_th121,conjecture,
    ! [B: $i,C: $i] :
      ( ( ( subset @ B @ C )
        & ( ( intersection @ C @ B )
          = empty_set ) )
     => ( B = empty_set ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [B: $i,C: $i] :
        ( ( ( subset @ B @ C )
          & ( ( intersection @ C @ B )
            = empty_set ) )
       => ( B = empty_set ) ),
    inference('cnf.neg',[status(esa)],[prove_th121]) ).

thf(zip_derived_cl19,plain,
    ( ( intersection @ sk__4 @ sk__3 )
    = empty_set ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(commutativity_of_intersection,axiom,
    ! [B: $i,C: $i] :
      ( ( intersection @ B @ C )
      = ( intersection @ C @ B ) ) ).

thf(zip_derived_cl11,plain,
    ! [X0: $i,X1: $i] :
      ( ( intersection @ X1 @ X0 )
      = ( intersection @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[commutativity_of_intersection]) ).

thf(zip_derived_cl106,plain,
    ( empty_set
    = ( intersection @ sk__3 @ sk__4 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl19,zip_derived_cl11]) ).

thf(subset_intersection,axiom,
    ! [B: $i,C: $i] :
      ( ( subset @ B @ C )
     => ( ( intersection @ B @ C )
        = B ) ) ).

thf(zip_derived_cl0,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( intersection @ X0 @ X1 )
        = X0 )
      | ~ ( subset @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[subset_intersection]) ).

thf(zip_derived_cl108,plain,
    ( ( empty_set = sk__3 )
    | ~ ( subset @ sk__3 @ sk__4 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl106,zip_derived_cl0]) ).

thf(zip_derived_cl20,plain,
    subset @ sk__3 @ sk__4,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl111,plain,
    empty_set = sk__3,
    inference(demod,[status(thm)],[zip_derived_cl108,zip_derived_cl20]) ).

thf(zip_derived_cl21,plain,
    sk__3 != empty_set,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl112,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl111,zip_derived_cl21]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.ZabPDPixZZ true
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Sat Aug 26 09:15:13 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % Running portfolio for 300 s
% 0.14/0.35  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.35  % Number of cores: 8
% 0.14/0.35  % Python version: Python 3.6.8
% 0.14/0.35  % Running in FO mode
% 0.21/0.68  % Total configuration time : 435
% 0.21/0.68  % Estimated wc time : 1092
% 0.21/0.68  % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.70  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.73  % Solved by fo/fo6_bce.sh.
% 0.21/0.73  % BCE start: 22
% 0.21/0.73  % BCE eliminated: 0
% 0.21/0.73  % PE start: 22
% 0.21/0.73  logic: eq
% 0.21/0.73  % PE eliminated: 1
% 0.21/0.73  % done 14 iterations in 0.011s
% 0.21/0.73  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.21/0.73  % SZS output start Refutation
% See solution above
% 0.21/0.73  
% 0.21/0.73  
% 0.21/0.73  % Terminating...
% 0.21/0.77  % Runner terminated.
% 0.21/0.78  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------