↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n003.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:47 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(g_type,type,
    g: ( $o > $o > $o ) > $o ).

thf(a_type,type,
    a: $o ).

thf(h_type,type,
    h: $o > $o > $o ).

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

thf(i_type,type,
    i: $o > $o > $o ).

thf(b_type,type,
    b: $o ).

thf(claim,conjecture,
    ( ( ( h @ a @ b )
      & ( ( f @ g )
        = ( i @ a @ b ) )
      & ( ( i @ a @ b )
      <=> ( b
          | a ) )
      & ( ( h @ a @ b )
      <=> ( b
          & a ) ) )
   => ( f @ g ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( ( ( h @ a @ b )
        & ( ( f @ g )
          = ( i @ a @ b ) )
        & ( ( i @ a @ b )
        <=> ( b
            | a ) )
        & ( ( h @ a @ b )
        <=> ( b
            & a ) ) )
     => ( f @ g ) ),
    inference('cnf.neg',[status(esa)],[claim]) ).

thf(zip_derived_cl0,plain,
    ~ ( ( ( h @ a @ b )
        & ( ( f @ g )
          = ( i @ a @ b ) )
        & ( ( i @ a @ b )
        <=> ( b
            | a ) )
        & ( ( h @ a @ b )
        <=> ( b
            & a ) ) )
     => ( f @ g ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl1,plain,
    ( ( h @ a @ b )
    & ( ( f @ g )
      = ( i @ a @ b ) )
    & ( ( i @ a @ b )
    <=> ( b
        | a ) )
    & ( ( h @ a @ b )
    <=> ( b
        & a ) ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl0]) ).

thf(zip_derived_cl6,plain,
    ( ( h @ a @ b )
  <=> ( b
      & a ) ),
    inference(lazy_cnf_and,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl9,plain,
    ( ( h @ a @ b )
    = ( b
      & a ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl6]) ).

thf(zip_derived_cl5,plain,
    ( ( i @ a @ b )
  <=> ( b
      | a ) ),
    inference(lazy_cnf_and,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl8,plain,
    ( ( i @ a @ b )
    = ( b
      | a ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl5]) ).

thf(zip_derived_cl4,plain,
    ( ( f @ g )
    = ( i @ a @ b ) ),
    inference(lazy_cnf_and,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl7,plain,
    ( ( f @ g )
    = ( i @ a @ b ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl4]) ).

thf(zip_derived_cl2,plain,
    ~ ( f @ g ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl0]) ).

thf(zip_derived_cl12,plain,
    ~ ( i @ a @ b ),
    inference(demod,[status(thm)],[zip_derived_cl7,zip_derived_cl2]) ).

thf(zip_derived_cl14,plain,
    ~ ( b
      | a ),
    inference(demod,[status(thm)],[zip_derived_cl8,zip_derived_cl12]) ).

thf(zip_derived_cl16,plain,
    ~ a,
    inference(lazy_cnf_or,[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl15,plain,
    ~ b,
    inference(lazy_cnf_or,[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl3,plain,
    h @ a @ b,
    inference(lazy_cnf_and,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl15_001,plain,
    ~ b,
    inference(lazy_cnf_or,[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl17,plain,
    h @ a @ $false,
    inference(demod,[status(thm)],[zip_derived_cl3,zip_derived_cl15]) ).

thf(zip_derived_cl16_002,plain,
    ~ a,
    inference(lazy_cnf_or,[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl20,plain,
    h @ $false @ $false,
    inference(demod,[status(thm)],[zip_derived_cl17,zip_derived_cl16]) ).

thf(zip_derived_cl15_003,plain,
    ~ b,
    inference(lazy_cnf_or,[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl16_004,plain,
    ~ a,
    inference(lazy_cnf_or,[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl22,plain,
    ( $false
    & $false ),
    inference(demod,[status(thm)],[zip_derived_cl9,zip_derived_cl16,zip_derived_cl15,zip_derived_cl20,zip_derived_cl15,zip_derived_cl16]) ).

thf(zip_derived_cl23,plain,
    $false,
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl22]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO504^1 : TPTP v9.2.0. Released v4.1.0.
% 0.03/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.wf6A1nNZCr true
% 0.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Oct  1 18:15:23 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % Running portfolio for 300 s
% 0.12/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  % Number of cores: 8
% 0.12/0.35  % Python version: Python 3.6.8
% 0.12/0.35  % Running in HO mode
% 0.55/0.65  % Total configuration time : 828
% 0.55/0.65  % Estimated wc time : 1656
% 0.55/0.65  % Estimated cpu time (8 cpus) : 207.0
% 0.56/0.74  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.56/0.74  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.56/0.75  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.56/0.76  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.56/0.76  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.56/0.77  % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.56/0.77  % Solved by lams/35_full_unif4.sh.
% 0.56/0.77  % done 8 iterations in 0.010s
% 0.56/0.77  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.56/0.77  % SZS output start Refutation
% See solution above
% 0.56/0.77  
% 0.56/0.77  
% 0.56/0.77  % Terminating...
% 0.66/0.85  % Runner terminated.
% 0.66/0.86  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------