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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SET162+3 : TPTP v8.1.2. Released v2.2.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.Yips3rD3ih true

% Computer : n015.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:07 EDT 2023

% Result   : Theorem 1.52s 0.90s
% Output   : Refutation 1.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   37 (  15 unt;   6 typ;   0 def)
%            Number of atoms       :   53 (  12 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  192 (  14   ~;  17   |;   1   &; 156   @)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   53 (   0   ^;  53   !;   0   ?;  53   :)

% Comments : 
%------------------------------------------------------------------------------
thf(union_type,type,
    union: $i > $i > $i ).

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

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

thf(sk__type,type,
    sk_: $i > $i > $i ).

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

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

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

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

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

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

thf(zip_derived_cl7,plain,
    ! [X0: $i,X1: $i] :
      ( ( union @ X1 @ X0 )
      = ( union @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[commutativity_of_union]) ).

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

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

thf(zip_derived_cl9,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ X0 @ X1 )
      | ~ ( member @ ( sk_ @ X1 @ X0 ) @ X1 ) ),
    inference(cnf,[status(esa)],[subset_defn]) ).

thf(zip_derived_cl10,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ X0 @ X1 )
      | ( member @ ( sk_ @ X1 @ X0 ) @ X0 ) ),
    inference(cnf,[status(esa)],[subset_defn]) ).

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

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

thf(zip_derived_cl126,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( subset @ ( union @ X1 @ X0 ) @ X2 )
      | ( member @ ( sk_ @ X2 @ ( union @ X1 @ X0 ) ) @ X1 )
      | ( member @ ( sk_ @ X2 @ ( union @ X1 @ X0 ) ) @ X0 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl10,zip_derived_cl0]) ).

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_cl350,plain,
    ! [X0: $i,X1: $i] :
      ( ( member @ ( sk_ @ X1 @ ( union @ empty_set @ X0 ) ) @ X0 )
      | ( subset @ ( union @ empty_set @ X0 ) @ X1 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl126,zip_derived_cl3]) ).

thf(zip_derived_cl426,plain,
    ! [X0: $i] :
      ( ( subset @ ( union @ empty_set @ X0 ) @ X0 )
      | ( subset @ ( union @ empty_set @ X0 ) @ X0 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl9,zip_derived_cl350]) ).

thf(zip_derived_cl433,plain,
    ! [X0: $i] : ( subset @ ( union @ empty_set @ X0 ) @ X0 ),
    inference(simplify,[status(thm)],[zip_derived_cl426]) ).

thf(zip_derived_cl7_001,plain,
    ! [X0: $i,X1: $i] :
      ( ( union @ X1 @ X0 )
      = ( union @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[commutativity_of_union]) ).

thf(zip_derived_cl10_002,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ X0 @ X1 )
      | ( member @ ( sk_ @ X1 @ X0 ) @ X0 ) ),
    inference(cnf,[status(esa)],[subset_defn]) ).

thf(zip_derived_cl1,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( member @ X0 @ ( union @ X1 @ X2 ) )
      | ~ ( member @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[union_defn]) ).

thf(zip_derived_cl9_003,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ X0 @ X1 )
      | ~ ( member @ ( sk_ @ X1 @ X0 ) @ X1 ) ),
    inference(cnf,[status(esa)],[subset_defn]) ).

thf(zip_derived_cl108,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ( member @ ( sk_ @ ( union @ X1 @ X0 ) @ X2 ) @ X1 )
      | ( subset @ X2 @ ( union @ X1 @ X0 ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl1,zip_derived_cl9]) ).

thf(zip_derived_cl222,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ X0 @ ( union @ X0 @ X1 ) )
      | ( subset @ X0 @ ( union @ X0 @ X1 ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl10,zip_derived_cl108]) ).

thf(zip_derived_cl225,plain,
    ! [X0: $i,X1: $i] : ( subset @ X0 @ ( union @ X0 @ X1 ) ),
    inference(simplify,[status(thm)],[zip_derived_cl222]) ).

thf(zip_derived_cl231,plain,
    ! [X0: $i,X1: $i] : ( subset @ X0 @ ( union @ X1 @ X0 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl7,zip_derived_cl225]) ).

thf(equal_defn,axiom,
    ! [B: $i,C: $i] :
      ( ( B = C )
    <=> ( ( subset @ B @ C )
        & ( subset @ C @ B ) ) ) ).

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

thf(zip_derived_cl241,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( subset @ ( union @ X1 @ X0 ) @ X0 )
      | ( ( union @ X1 @ X0 )
        = X0 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl231,zip_derived_cl6]) ).

thf(zip_derived_cl551,plain,
    ! [X0: $i] :
      ( ( union @ empty_set @ X0 )
      = X0 ),
    inference('sup-',[status(thm)],[zip_derived_cl433,zip_derived_cl241]) ).

thf(zip_derived_cl722,plain,
    sk__3 != sk__3,
    inference(demod,[status(thm)],[zip_derived_cl98,zip_derived_cl551]) ).

thf(zip_derived_cl723,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl722]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET162+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Yips3rD3ih true
% 0.15/0.35  % Computer : n015.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Sat Aug 26 15:19:08 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.15/0.35  % Running portfolio for 300 s
% 0.15/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.35  % Number of cores: 8
% 0.15/0.36  % Python version: Python 3.6.8
% 0.15/0.36  % Running in FO mode
% 0.21/0.63  % Total configuration time : 435
% 0.21/0.63  % Estimated wc time : 1092
% 0.21/0.63  % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.70  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.74  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.75  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.75  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.75  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.75  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.79  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.52/0.90  % Solved by fo/fo3_bce.sh.
% 1.52/0.90  % BCE start: 19
% 1.52/0.90  % BCE eliminated: 0
% 1.52/0.90  % PE start: 19
% 1.52/0.90  logic: eq
% 1.52/0.90  % PE eliminated: 1
% 1.52/0.90  % done 149 iterations in 0.123s
% 1.52/0.90  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.52/0.90  % SZS output start Refutation
% See solution above
% 1.52/0.90  
% 1.52/0.90  
% 1.52/0.90  % Terminating...
% 2.25/0.96  % Runner terminated.
% 2.25/0.97  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------