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

View Problem - Process Solution

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

% Computer : n025.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:16:49 EDT 2023

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

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

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

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

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

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

thf(set_difference_type,type,
    set_difference: $i > $i > $i ).

thf(t66_zfmisc_1,conjecture,
    ! [A: $i,B: $i] :
      ~ ( ( ( set_difference @ A @ ( singleton @ B ) )
          = empty_set )
        & ( A != empty_set )
        & ( A
         != ( singleton @ B ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [A: $i,B: $i] :
        ~ ( ( ( set_difference @ A @ ( singleton @ B ) )
            = empty_set )
          & ( A != empty_set )
          & ( A
           != ( singleton @ B ) ) ),
    inference('cnf.neg',[status(esa)],[t66_zfmisc_1]) ).

thf(zip_derived_cl9,plain,
    ( ( set_difference @ sk__2 @ ( singleton @ sk__3 ) )
    = empty_set ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(t37_xboole_1,axiom,
    ! [A: $i,B: $i] :
      ( ( ( set_difference @ A @ B )
        = empty_set )
    <=> ( subset @ A @ B ) ) ).

thf(zip_derived_cl7,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ X0 @ X1 )
      | ( ( set_difference @ X0 @ X1 )
       != empty_set ) ),
    inference(cnf,[status(esa)],[t37_xboole_1]) ).

thf(zip_derived_cl66,plain,
    ( ( subset @ sk__2 @ ( singleton @ sk__3 ) )
    | ( empty_set != empty_set ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl9,zip_derived_cl7]) ).

thf(zip_derived_cl68,plain,
    subset @ sk__2 @ ( singleton @ sk__3 ),
    inference(simplify,[status(thm)],[zip_derived_cl66]) ).

thf(l4_zfmisc_1,axiom,
    ! [A: $i,B: $i] :
      ( ( subset @ A @ ( singleton @ B ) )
    <=> ( ( A = empty_set )
        | ( A
          = ( singleton @ B ) ) ) ) ).

thf(zip_derived_cl1,plain,
    ! [X0: $i,X1: $i] :
      ( ( X1
        = ( singleton @ X0 ) )
      | ( X1 = empty_set )
      | ~ ( subset @ X1 @ ( singleton @ X0 ) ) ),
    inference(cnf,[status(esa)],[l4_zfmisc_1]) ).

thf(zip_derived_cl70,plain,
    ( ( sk__2
      = ( singleton @ sk__3 ) )
    | ( sk__2 = empty_set ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl68,zip_derived_cl1]) ).

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

thf(zip_derived_cl10,plain,
    ( sk__2
   != ( singleton @ sk__3 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl71,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl70,zip_derived_cl11,zip_derived_cl10]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET923+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.SklMgbQZeH true
% 0.13/0.34  % Computer : n025.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 16:33:08 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.19/0.64  % Total configuration time : 435
% 0.19/0.64  % Estimated wc time : 1092
% 0.19/0.64  % Estimated cpu time (7 cpus) : 156.0
% 0.19/0.69  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.19/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.19/0.73  % Solved by fo/fo6_bce.sh.
% 0.19/0.73  % BCE start: 12
% 0.19/0.73  % BCE eliminated: 0
% 0.19/0.73  % PE start: 12
% 0.19/0.73  logic: eq
% 0.19/0.73  % PE eliminated: 1
% 0.19/0.73  % done 11 iterations in 0.006s
% 0.19/0.73  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.19/0.73  % SZS output start Refutation
% See solution above
% 0.19/0.73  
% 0.19/0.73  
% 0.19/0.73  % Terminating...
% 0.19/0.76  % Runner terminated.
% 0.19/0.77  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------