↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SYO373^5 : TPTP v9.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.f32Y36glj6 true

% Computer : n016.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 05:07:20 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(b_type,type,
    b: $tType ).

thf(f_type,type,
    f: b > $o ).

thf('#sk1_type',type,
    '#sk1': ( b > $o ) > $o ).

thf(g_type,type,
    g: b > $o ).

thf(cEXT_SET,conjecture,
    ( ! [Xx: b] :
        ( ( f @ Xx )
      <=> ( g @ Xx ) )
   => ! [Xq: ( b > $o ) > $o] :
        ( ( Xq @ f )
       => ( Xq @ g ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( ! [Xx: b] :
          ( ( f @ Xx )
        <=> ( g @ Xx ) )
     => ! [Xq: ( b > $o ) > $o] :
          ( ( Xq @ f )
         => ( Xq @ g ) ) ),
    inference('cnf.neg',[status(esa)],[cEXT_SET]) ).

thf(zip_derived_cl0,plain,
    ~ ( ( !!
        @ ^ [Y0: b] :
            ( ( f @ Y0 )
          <=> ( g @ Y0 ) ) )
     => ( !!
        @ ^ [Y0: ( b > $o ) > $o] :
            ( ( Y0 @ f )
           => ( Y0 @ g ) ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl4,plain,
    ~ ( !!
      @ ^ [Y0: ( b > $o ) > $o] :
          ( ( Y0 @ f )
         => ( Y0 @ g ) ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl0]) ).

thf(zip_derived_cl6,plain,
    ~ ( ( '#sk1' @ f )
     => ( '#sk1' @ g ) ),
    inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl4]) ).

thf(zip_derived_cl8,plain,
    '#sk1' @ f,
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl6]) ).

thf(zip_derived_cl3,plain,
    ( !!
    @ ^ [Y0: b] :
        ( ( f @ Y0 )
      <=> ( g @ Y0 ) ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl0]) ).

thf(zip_derived_cl5,plain,
    ! [X2: b] :
      ( ( f @ X2 )
    <=> ( g @ X2 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl3]) ).

thf(zip_derived_cl7,plain,
    ! [X2: b] :
      ( ( f @ X2 )
      = ( g @ X2 ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl5]) ).

thf(zip_derived_cl12,plain,
    f = g,
    inference(ho_ext_pos_general,[status(thm)],[zip_derived_cl7]) ).

thf(zip_derived_cl9,plain,
    ~ ( '#sk1' @ g ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl6]) ).

thf(zip_derived_cl14,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl8,zip_derived_cl12,zip_derived_cl9]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYO373^5 : TPTP v9.2.0. Released v4.0.0.
% 0.07/0.14  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.f32Y36glj6 true
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Oct  1 17:55:38 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % Running portfolio for 300 s
% 0.14/0.35  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.35  % Number of cores: 8
% 0.14/0.35  % Python version: Python 3.6.8
% 0.14/0.35  % Running in HO mode
% 0.59/0.69  % Total configuration time : 828
% 0.59/0.69  % Estimated wc time : 1656
% 0.59/0.69  % Estimated cpu time (8 cpus) : 207.0
% 0.60/0.78  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.60/0.79  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.60/0.79  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.60/0.79  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.60/0.79  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.61/0.81  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.61/0.81  % Solved by lams/15_e_short1.sh.
% 0.61/0.81  % done 3 iterations in 0.007s
% 0.61/0.81  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.61/0.81  % SZS output start Refutation
% See solution above
% 0.61/0.81  
% 0.61/0.81  
% 0.61/0.81  % Terminating...
% 0.68/0.89  % Runner terminated.
% 0.68/0.90  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------