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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SET146+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.XtyPATdJWS true

% Computer : n023.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:13:01 EDT 2023

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

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

thf(sk__1_type,type,
    sk__1: $i > $i ).

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

thf(member_type,type,
    member: $i > $i > $o ).

thf(sk__2_type,type,
    sk__2: $i > $i > $i ).

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

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

thf(prove_th61,conjecture,
    ! [B: $i] :
      ( ( intersection @ B @ empty_set )
      = empty_set ) ).

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

thf(zip_derived_cl18,plain,
    ( ( intersection @ sk__3 @ empty_set )
   != 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_cl7,plain,
    ! [X0: $i,X1: $i] :
      ( ( intersection @ X1 @ X0 )
      = ( intersection @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[commutativity_of_intersection]) ).

thf(zip_derived_cl98,plain,
    ( ( intersection @ empty_set @ sk__3 )
   != empty_set ),
    inference(demod,[status(thm)],[zip_derived_cl18,zip_derived_cl7]) ).

thf(equal_member_defn,axiom,
    ! [B: $i,C: $i] :
      ( ( B = C )
    <=> ! [D: $i] :
          ( ( member @ D @ B )
        <=> ( member @ D @ C ) ) ) ).

thf(zip_derived_cl17,plain,
    ! [X0: $i,X1: $i] :
      ( ( X1 = X0 )
      | ( member @ ( sk__2 @ X0 @ X1 ) @ X0 )
      | ( member @ ( sk__2 @ X0 @ X1 ) @ X1 ) ),
    inference(cnf,[status(esa)],[equal_member_defn]) ).

thf(empty_set_defn,axiom,
    ! [B: $i] :
      ~ ( member @ B @ empty_set ) ).

thf(zip_derived_cl3,plain,
    ! [X0: $i] :
      ~ ( member @ X0 @ empty_set ),
    inference(cnf,[status(esa)],[empty_set_defn]) ).

thf(zip_derived_cl130,plain,
    ! [X0: $i] :
      ( ( member @ ( sk__2 @ empty_set @ X0 ) @ X0 )
      | ( X0 = empty_set ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl17,zip_derived_cl3]) ).

thf(empty_defn,axiom,
    ! [B: $i] :
      ( ( empty @ B )
    <=> ! [C: $i] :
          ~ ( member @ C @ B ) ) ).

thf(zip_derived_cl13,plain,
    ! [X0: $i] :
      ( ( empty @ X0 )
      | ( member @ ( sk__1 @ X0 ) @ X0 ) ),
    inference(cnf,[status(esa)],[empty_defn]) ).

thf(zip_derived_cl12,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( member @ X0 @ X1 )
      | ~ ( empty @ X1 ) ),
    inference(cnf,[status(esa)],[empty_defn]) ).

thf(zip_derived_cl97,plain,
    ! [X0: $i,X1: $i] :
      ( ( member @ ( sk__1 @ X0 ) @ X0 )
      | ~ ( member @ X1 @ X0 ) ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl13,zip_derived_cl12]) ).

thf(zip_derived_cl141,plain,
    ! [X0: $i] :
      ( ( X0 = empty_set )
      | ( member @ ( sk__1 @ X0 ) @ X0 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl130,zip_derived_cl97]) ).

thf(intersection_defn,axiom,
    ! [B: $i,C: $i,D: $i] :
      ( ( member @ D @ ( intersection @ B @ C ) )
    <=> ( ( member @ D @ B )
        & ( member @ D @ C ) ) ) ).

thf(zip_derived_cl0,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( member @ X0 @ X1 )
      | ~ ( member @ X0 @ ( intersection @ X1 @ X2 ) ) ),
    inference(cnf,[status(esa)],[intersection_defn]) ).

thf(zip_derived_cl155,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( intersection @ X1 @ X0 )
        = empty_set )
      | ( member @ ( sk__1 @ ( intersection @ X1 @ X0 ) ) @ X1 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl141,zip_derived_cl0]) ).

thf(zip_derived_cl3_001,plain,
    ! [X0: $i] :
      ~ ( member @ X0 @ empty_set ),
    inference(cnf,[status(esa)],[empty_set_defn]) ).

thf(zip_derived_cl178,plain,
    ! [X0: $i] :
      ( ( intersection @ empty_set @ X0 )
      = empty_set ),
    inference('s_sup-',[status(thm)],[zip_derived_cl155,zip_derived_cl3]) ).

thf(zip_derived_cl181,plain,
    empty_set != empty_set,
    inference(demod,[status(thm)],[zip_derived_cl98,zip_derived_cl178]) ).

thf(zip_derived_cl182,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl181]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET146+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.XtyPATdJWS true
% 0.13/0.34  % Computer : n023.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 : Sat Aug 26 10:14:41 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.13/0.35  % Python version: Python 3.6.8
% 0.13/0.35  % Running in FO mode
% 0.54/0.66  % Total configuration time : 435
% 0.54/0.66  % Estimated wc time : 1092
% 0.54/0.66  % Estimated cpu time (7 cpus) : 156.0
% 0.54/0.72  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.54/0.75  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.56/0.76  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.56/0.76  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.56/0.77  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.56/0.78  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.56/0.79  % Solved by fo/fo6_bce.sh.
% 0.56/0.79  % BCE start: 19
% 0.56/0.79  % BCE eliminated: 0
% 0.56/0.79  % PE start: 19
% 0.56/0.79  logic: eq
% 0.56/0.79  % PE eliminated: 1
% 0.56/0.79  % done 38 iterations in 0.037s
% 0.56/0.79  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.56/0.79  % SZS output start Refutation
% See solution above
% 0.56/0.79  
% 0.56/0.79  
% 0.56/0.79  % Terminating...
% 0.61/0.86  % Runner terminated.
% 0.61/0.87  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------