↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n013.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:52:18 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(sk__3_type,type,
    sk__3: $i ).

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

thf(sk__4_type,type,
    sk__4: $i ).

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

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

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

thf(intersection_is_subset,axiom,
    ! [B: $i,C: $i] : ( subset @ ( intersection @ B @ C ) @ B ) ).

thf(zip_derived_cl2,plain,
    ! [X0: $i,X1: $i] : ( subset @ ( intersection @ X0 @ X1 ) @ X0 ),
    inference(cnf,[status(esa)],[intersection_is_subset]) ).

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

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

thf(zip_derived_cl98,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ( subset @ X0 @ X2 )
      | ( subset @ ( intersection @ X0 @ X1 ) @ X2 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl2,zip_derived_cl0]) ).

thf(prove_intersection_subset_of_union,conjecture,
    ! [B: $i,C: $i,D: $i] : ( subset @ ( intersection @ B @ C ) @ ( union @ B @ D ) ) ).

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

thf(zip_derived_cl19,plain,
    ~ ( subset @ ( intersection @ sk__2 @ sk__3 ) @ ( union @ sk__2 @ sk__4 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl148,plain,
    ~ ( subset @ sk__2 @ ( union @ sk__2 @ sk__4 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl98,zip_derived_cl19]) ).

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

thf(zip_derived_cl1,plain,
    ! [X0: $i,X1: $i] : ( subset @ X0 @ ( union @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[subset_of_union]) ).

thf(zip_derived_cl151,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl148,zip_derived_cl1]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET585+3 : TPTP v9.2.0. Released v2.2.0.
% 0.12/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.CkY4ZqVIdD true
% 0.14/0.34  % Computer : n013.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Oct  1 13:06:38 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 0.14/0.34  % Running portfolio for 300 s
% 0.14/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.34  % Number of cores: 8
% 0.14/0.34  % Python version: Python 3.6.8
% 0.14/0.34  % Running in FO mode
% 0.56/0.64  % Total configuration time : 435
% 0.56/0.64  % Estimated wc time : 1092
% 0.56/0.64  % Estimated cpu time (7 cpus) : 156.0
% 0.56/0.69  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.56/0.71  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.56/0.74  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.56/0.74  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.56/0.74  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.56/0.75  % Solved by fo/fo6_bce.sh.
% 0.56/0.75  % BCE start: 20
% 0.56/0.75  % BCE eliminated: 0
% 0.56/0.75  % PE start: 20
% 0.56/0.75  logic: eq
% 0.56/0.75  % PE eliminated: 0
% 0.56/0.75  % done 29 iterations in 0.033s
% 0.56/0.75  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.56/0.75  % SZS output start Refutation
% See solution above
% 0.56/0.75  
% 0.56/0.75  
% 0.56/0.75  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.56/0.75  % Terminating...
% 0.61/0.83  % Runner terminated.
% 0.61/0.85  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------