↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SEU112+1 : TPTP v9.2.0. Released v3.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.kMcLdQP2Hi true

% Computer : n012.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:53:27 PM UTC 2025

% Result   : Theorem 0.54s 0.78s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   2 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  138 (  12   ~;   6   |;   1   &; 117   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  28   !;   0   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(set_union2_type,type,
    set_union2: $i > $i > $i ).

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

thf(finite_subsets_type,type,
    finite_subsets: $i > $i ).

thf(sk__10_type,type,
    sk__10: $i ).

thf(sk__11_type,type,
    sk__11: $i ).

thf(t23_finsub_1,axiom,
    ! [A: $i,B: $i] :
      ( ( subset @ A @ B )
     => ( subset @ ( finite_subsets @ A ) @ ( finite_subsets @ B ) ) ) ).

thf(zip_derived_cl56,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ ( finite_subsets @ X0 ) @ ( finite_subsets @ X1 ) )
      | ~ ( subset @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[t23_finsub_1]) ).

thf(zip_derived_cl56_001,plain,
    ! [X0: $i,X1: $i] :
      ( ( subset @ ( finite_subsets @ X0 ) @ ( finite_subsets @ X1 ) )
      | ~ ( subset @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[t23_finsub_1]) ).

thf(t8_xboole_1,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( subset @ A @ B )
        & ( subset @ C @ B ) )
     => ( subset @ ( set_union2 @ A @ C ) @ B ) ) ).

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

thf(t25_finsub_1,conjecture,
    ! [A: $i,B: $i] : ( subset @ ( set_union2 @ ( finite_subsets @ A ) @ ( finite_subsets @ B ) ) @ ( finite_subsets @ ( set_union2 @ A @ B ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [A: $i,B: $i] : ( subset @ ( set_union2 @ ( finite_subsets @ A ) @ ( finite_subsets @ B ) ) @ ( finite_subsets @ ( set_union2 @ A @ B ) ) ),
    inference('cnf.neg',[status(esa)],[t25_finsub_1]) ).

thf(zip_derived_cl57,plain,
    ~ ( subset @ ( set_union2 @ ( finite_subsets @ sk__10 ) @ ( finite_subsets @ sk__11 ) ) @ ( finite_subsets @ ( set_union2 @ sk__10 @ sk__11 ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl536,plain,
    ( ~ ( subset @ ( finite_subsets @ sk__11 ) @ ( finite_subsets @ ( set_union2 @ sk__10 @ sk__11 ) ) )
    | ~ ( subset @ ( finite_subsets @ sk__10 ) @ ( finite_subsets @ ( set_union2 @ sk__10 @ sk__11 ) ) ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl67,zip_derived_cl57]) ).

thf(zip_derived_cl560,plain,
    ( ~ ( subset @ sk__11 @ ( set_union2 @ sk__10 @ sk__11 ) )
    | ~ ( subset @ ( finite_subsets @ sk__10 ) @ ( finite_subsets @ ( set_union2 @ sk__10 @ sk__11 ) ) ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl56,zip_derived_cl536]) ).

thf(commutativity_k2_xboole_0,axiom,
    ! [A: $i,B: $i] :
      ( ( set_union2 @ A @ B )
      = ( set_union2 @ B @ A ) ) ).

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

thf(t7_xboole_1,axiom,
    ! [A: $i,B: $i] : ( subset @ A @ ( set_union2 @ A @ B ) ) ).

thf(zip_derived_cl65,plain,
    ! [X0: $i,X1: $i] : ( subset @ X0 @ ( set_union2 @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[t7_xboole_1]) ).

thf(zip_derived_cl338,plain,
    ! [X0: $i,X1: $i] : ( subset @ X0 @ ( set_union2 @ X1 @ X0 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl7,zip_derived_cl65]) ).

thf(zip_derived_cl567,plain,
    ~ ( subset @ ( finite_subsets @ sk__10 ) @ ( finite_subsets @ ( set_union2 @ sk__10 @ sk__11 ) ) ),
    inference(demod,[status(thm)],[zip_derived_cl560,zip_derived_cl338]) ).

thf(zip_derived_cl574,plain,
    ~ ( subset @ sk__10 @ ( set_union2 @ sk__10 @ sk__11 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl56,zip_derived_cl567]) ).

thf(zip_derived_cl65_002,plain,
    ! [X0: $i,X1: $i] : ( subset @ X0 @ ( set_union2 @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[t7_xboole_1]) ).

thf(zip_derived_cl581,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl574,zip_derived_cl65]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU112+1 : TPTP v9.2.0. Released v3.2.0.
% 0.06/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.kMcLdQP2Hi true
% 0.13/0.34  % Computer : n012.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 : Wed Oct  1 16:04:53 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox/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.53/0.63  % Total configuration time : 435
% 0.53/0.63  % Estimated wc time : 1092
% 0.53/0.63  % Estimated cpu time (7 cpus) : 156.0
% 0.53/0.72  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.53/0.72  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.53/0.74  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.53/0.76  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.53/0.76  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.53/0.76  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.53/0.76  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.54/0.78  % Solved by fo/fo6_bce.sh.
% 0.54/0.78  % BCE start: 68
% 0.54/0.78  % BCE eliminated: 8
% 0.54/0.78  % PE start: 60
% 0.54/0.78  logic: eq
% 0.54/0.78  % PE eliminated: 13
% 0.54/0.78  % done 92 iterations in 0.044s
% 0.54/0.78  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.54/0.78  % SZS output start Refutation
% See solution above
% 0.54/0.78  
% 0.54/0.78  
% 0.54/0.78  % Terminating...
% 1.67/0.85  % Runner terminated.
% 1.67/0.86  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------