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

View Problem - Process Solution

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

% Computer : n002.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:14:46 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(difference_type,type,
    difference: $i > $i > $i ).

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

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

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

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

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

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

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

thf(prove_th49,conjecture,
    ! [B: $i,C: $i] : ( subset @ ( difference @ B @ C ) @ B ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [B: $i,C: $i] : ( subset @ ( difference @ B @ C ) @ B ),
    inference('cnf.neg',[status(esa)],[prove_th49]) ).

thf(zip_derived_cl7,plain,
    ~ ( subset @ ( difference @ sk__1 @ sk__2 ) @ sk__1 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl9,plain,
    ~ ( member @ ( sk_ @ sk__1 @ ( difference @ sk__1 @ sk__2 ) ) @ sk__1 ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl4,zip_derived_cl7]) ).

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

thf(zip_derived_cl7_001,plain,
    ~ ( subset @ ( difference @ sk__1 @ sk__2 ) @ sk__1 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl11,plain,
    member @ ( sk_ @ sk__1 @ ( difference @ sk__1 @ sk__2 ) ) @ ( difference @ sk__1 @ sk__2 ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl5,zip_derived_cl7]) ).

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

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

thf(zip_derived_cl13,plain,
    member @ ( sk_ @ sk__1 @ ( difference @ sk__1 @ sk__2 ) ) @ sk__1,
    inference('s_sup-',[status(thm)],[zip_derived_cl11,zip_derived_cl0]) ).

thf(zip_derived_cl17,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl9,zip_derived_cl13]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET590+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.HB3gIZO2JI true
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 09:53:18 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Running portfolio for 300 s
% 0.13/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36  % Number of cores: 8
% 0.13/0.36  % Python version: Python 3.6.8
% 0.13/0.36  % Running in FO mode
% 0.21/0.67  % Total configuration time : 435
% 0.21/0.67  % Estimated wc time : 1092
% 0.21/0.67  % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.72  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 1.02/0.74  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 1.26/0.75  % Solved by fo/fo6_bce.sh.
% 1.26/0.75  % BCE start: 8
% 1.26/0.75  % BCE eliminated: 0
% 1.26/0.75  % PE start: 8
% 1.26/0.75  logic: neq
% 1.26/0.75  % PE eliminated: 1
% 1.26/0.75  % done 6 iterations in 0.006s
% 1.26/0.75  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.26/0.75  % SZS output start Refutation
% See solution above
% 1.26/0.75  
% 1.26/0.75  
% 1.26/0.75  % Terminating...
% 1.26/0.78  % Runner terminated.
% 1.26/0.79  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------