↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n029.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:06:13 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(f_type,type,
    f: $o > $i > $i ).

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

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

thf(p_type,type,
    p: ( $i > $i ) > $o ).

thf(conj,conjecture,
    ( ( p
      @ ^ [X: $i] :
          ( f
          @ ( b
            & ( a
              @ ^ [X: $i] : ( f @ b @ X ) ) )
          @ X ) )
   => ( p
      @ ( f
        @ ( ( a @ ( f @ b ) )
          & b ) ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( ( p
        @ ^ [X: $i] :
            ( f
            @ ( b
              & ( a
                @ ^ [X: $i] : ( f @ b @ X ) ) )
            @ X ) )
     => ( p
        @ ( f
          @ ( ( a @ ( f @ b ) )
            & b ) ) ) ),
    inference('cnf.neg',[status(esa)],[conj]) ).

thf(zip_derived_cl1,plain,
    ~ ( p
      @ ( f
        @ ( ( a @ ( f @ b ) )
          & b ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl22,plain,
    ( ~ ( a @ ( f @ b ) )
    | ~ ( p
        @ ( f
          @ ( $true
            & b ) ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl23,plain,
    ( ~ ( a @ ( f @ b ) )
    | ~ ( p @ ( f @ b ) ) ),
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl22]) ).

thf(zip_derived_cl25,plain,
    ( ~ b
    | ~ ( a @ ( f @ $true ) )
    | ~ ( p @ ( f @ $true ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl23]) ).

thf(zip_derived_cl0,plain,
    ( p
    @ ^ [Y0: $i] :
        ( f
        @ ( b
          & ( a
            @ ^ [Y1: $i] : ( f @ b @ Y1 ) ) )
        @ Y0 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl2,plain,
    ( p
    @ ( f
      @ ( b
        & ( a @ ( f @ b ) ) ) ) ),
    inference(ho_norm,[status(thm)],[zip_derived_cl0]) ).

thf(zip_derived_cl4,plain,
    ( ~ b
    | ( p
      @ ( f
        @ ( $true
          & ( a @ ( f @ $true ) ) ) ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl2]) ).

thf(zip_derived_cl5,plain,
    ( ~ b
    | ( p @ ( f @ ( a @ ( f @ $true ) ) ) ) ),
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl4]) ).

thf(zip_derived_cl7,plain,
    ( ~ ( a @ ( f @ $true ) )
    | ~ b
    | ( p @ ( f @ $true ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl5]) ).

thf(zip_derived_cl34,plain,
    ( ~ ( a @ ( f @ $true ) )
    | ~ b ),
    inference(clc,[status(thm)],[zip_derived_cl25,zip_derived_cl7]) ).

thf(zip_derived_cl21,plain,
    ( ( a @ ( f @ b ) )
    | ~ ( p
        @ ( f
          @ ( $false
            & b ) ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl26,plain,
    ( ( a @ ( f @ b ) )
    | ~ ( p @ ( f @ $false ) ) ),
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl21]) ).

thf(zip_derived_cl28,plain,
    ( ~ b
    | ( a @ ( f @ $true ) )
    | ~ ( p @ ( f @ $false ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl26]) ).

thf(zip_derived_cl6,plain,
    ( ( a @ ( f @ $true ) )
    | ~ b
    | ( p @ ( f @ $false ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl5]) ).

thf(zip_derived_cl36,plain,
    ( ( a @ ( f @ $true ) )
    | ~ b ),
    inference(clc,[status(thm)],[zip_derived_cl28,zip_derived_cl6]) ).

thf(zip_derived_cl19,plain,
    ( b
    | ~ ( p
        @ ( f
          @ ( ( a @ ( f @ $false ) )
            & $false ) ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl32,plain,
    ( b
    | ~ ( p @ ( f @ $false ) ) ),
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl19]) ).

thf(zip_derived_cl3,plain,
    ( b
    | ( p
      @ ( f
        @ ( $false
          & ( a @ ( f @ $false ) ) ) ) ) ),
    inference(bool_hoist,[status(thm)],[zip_derived_cl2]) ).

thf(zip_derived_cl8,plain,
    ( b
    | ( p @ ( f @ $false ) ) ),
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl3]) ).

thf(zip_derived_cl33,plain,
    b,
    inference(clc,[status(thm)],[zip_derived_cl32,zip_derived_cl8]) ).

thf(zip_derived_cl43,plain,
    a @ ( f @ $true ),
    inference(demod,[status(thm)],[zip_derived_cl36,zip_derived_cl33]) ).

thf(zip_derived_cl33_001,plain,
    b,
    inference(clc,[status(thm)],[zip_derived_cl32,zip_derived_cl8]) ).

thf(zip_derived_cl44,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl34,zip_derived_cl43,zip_derived_cl33]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem  : SYO018^1 : TPTP v9.2.0. Released v3.7.0.
% 0.13/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.YtpmYNGs5c true
% 0.13/0.34  % Computer : n029.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 18:15:23 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox2/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 HO mode
% 0.54/0.65  % Total configuration time : 828
% 0.54/0.65  % Estimated wc time : 1656
% 0.54/0.65  % Estimated cpu time (8 cpus) : 207.0
% 0.54/0.69  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.55/0.72  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.55/0.72  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.55/0.73  % Solved by lams/40_c.s.sh.
% 0.55/0.73  % done 6 iterations in 0.014s
% 0.55/0.73  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.55/0.73  % SZS output start Refutation
% See solution above
% 0.55/0.73  
% 0.55/0.73  
% 0.55/0.73  % Terminating...
% 0.60/0.84  % Runner terminated.
% 0.60/0.86  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------