↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SET063+3 : TPTP v9.2.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.I0l6V3yuEt true

% Computer : n017.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 Oct  2 04:51:23 PM UTC 2025

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

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

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

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

thf(prove_subset_of_empty_set_is_empty_set,conjecture,
    ! [B: $i] :
      ( ( subset @ B @ empty_set )
     => ( B = empty_set ) ) ).

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

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

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

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

thf(zip_derived_cl22,plain,
    ( ( empty_set = sk__2 )
    | ~ ( subset @ empty_set @ sk__2 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl11,zip_derived_cl7]) ).

thf(empty_set_subset,axiom,
    ! [B: $i] : ( subset @ empty_set @ B ) ).

thf(zip_derived_cl0,plain,
    ! [X0: $i] : ( subset @ empty_set @ X0 ),
    inference(cnf,[status(esa)],[empty_set_subset]) ).

thf(zip_derived_cl24,plain,
    empty_set = sk__2,
    inference(demod,[status(thm)],[zip_derived_cl22,zip_derived_cl0]) ).

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

thf(zip_derived_cl25,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl24,zip_derived_cl12]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10  % Problem  : SET063+3 : TPTP v9.2.0. Released v2.2.0.
% 0.04/0.11  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.I0l6V3yuEt true
% 0.11/0.31  % Computer : n017.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Wed Oct  1 13:18:53 EDT 2025
% 0.11/0.31  % CPUTime  : 
% 0.11/0.31  % Running portfolio for 300 s
% 0.11/0.31  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.31  % Number of cores: 8
% 0.11/0.31  % Python version: Python 3.6.8
% 0.11/0.32  % Running in FO mode
% 0.17/0.53  % Total configuration time : 435
% 0.17/0.53  % Estimated wc time : 1092
% 0.17/0.53  % Estimated cpu time (7 cpus) : 156.0
% 0.72/0.59  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.72/0.59  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.72/0.59  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.72/0.60  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.72/0.62  % Solved by fo/fo1_av.sh.
% 0.72/0.62  % done 11 iterations in 0.009s
% 0.72/0.62  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.72/0.62  % SZS output start Refutation
% See solution above
% 0.72/0.62  
% 0.72/0.62  
% 0.72/0.62  % Terminating...
% 1.09/0.65  % Runner terminated.
% 1.28/0.67  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------