↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SYO482^6 : 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.qQ6FLiQ9A2 true

% Computer : n018.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:43 PM UTC 2025

% Result   : Theorem 0.47s 0.71s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   23 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   62 (  24 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   62 (  14   ~;   5   |;   0   &;  43   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   56 (  38   ^;  18   !;   0   ?;  56   :)

% Comments : 
%------------------------------------------------------------------------------
thf(mu_type,type,
    mu: $tType ).

thf(rel_s5_type,type,
    rel_s5: $i > $i > $o ).

thf(sk__10_type,type,
    sk__10: mu ).

thf(mnot_type,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(mbox_s5_type,type,
    mbox_s5: ( $i > $o ) > $i > $o ).

thf(meq_ind_type,type,
    meq_ind: mu > mu > $i > $o ).

thf(mexists_ind_type,type,
    mexists_ind: ( mu > $i > $o ) > $i > $o ).

thf(mforall_ind_type,type,
    mforall_ind: ( mu > $i > $o ) > $i > $o ).

thf(mvalid_type,type,
    mvalid: ( $i > $o ) > $o ).

thf(mbox_s5,axiom,
    ( mbox_s5
    = ( ^ [Phi: $i > $o,W: $i] :
        ! [V: $i] :
          ( ( Phi @ V )
          | ~ ( rel_s5 @ W @ V ) ) ) ) ).

thf('0',plain,
    ( mbox_s5
    = ( ^ [Phi: $i > $o,W: $i] :
        ! [V: $i] :
          ( ( Phi @ V )
          | ~ ( rel_s5 @ W @ V ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mbox_s5]) ).

thf('1',plain,
    ( mbox_s5
    = ( ^ [V_1: $i > $o,V_2: $i] :
        ! [X4: $i] :
          ( ( V_1 @ X4 )
          | ~ ( rel_s5 @ V_2 @ X4 ) ) ) ),
    define([status(thm)]) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [Phi: $i > $o] :
        ! [W: $i] : ( Phi @ W ) ) ) ).

thf('2',plain,
    ( mvalid
    = ( ^ [Phi: $i > $o] :
        ! [W: $i] : ( Phi @ W ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mvalid]) ).

thf('3',plain,
    ( mvalid
    = ( ^ [V_1: $i > $o] :
        ! [X4: $i] : ( V_1 @ X4 ) ) ),
    define([status(thm)]) ).

thf(mexists_ind,axiom,
    ( mexists_ind
    = ( ^ [Phi: mu > $i > $o] :
          ( mnot
          @ ( mforall_ind
            @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).

thf(mforall_ind,axiom,
    ( mforall_ind
    = ( ^ [Phi: mu > $i > $o,W: $i] :
        ! [X: mu] : ( Phi @ X @ W ) ) ) ).

thf('4',plain,
    ( mforall_ind
    = ( ^ [Phi: mu > $i > $o,W: $i] :
        ! [X: mu] : ( Phi @ X @ W ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mforall_ind]) ).

thf('5',plain,
    ( mforall_ind
    = ( ^ [V_1: mu > $i > $o,V_2: $i] :
        ! [X4: mu] : ( V_1 @ X4 @ V_2 ) ) ),
    define([status(thm)]) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [Phi: $i > $o,W: $i] :
          ~ ( Phi @ W ) ) ) ).

thf('6',plain,
    ( mnot
    = ( ^ [Phi: $i > $o,W: $i] :
          ~ ( Phi @ W ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mnot]) ).

thf('7',plain,
    ( mnot
    = ( ^ [V_1: $i > $o,V_2: $i] :
          ~ ( V_1 @ V_2 ) ) ),
    define([status(thm)]) ).

thf('8',plain,
    ( mexists_ind
    = ( ^ [Phi: mu > $i > $o] :
          ( mnot
          @ ( mforall_ind
            @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mexists_ind,'5','7']) ).

thf('9',plain,
    ( mexists_ind
    = ( ^ [V_1: mu > $i > $o] :
          ( mnot
          @ ( mforall_ind
            @ ^ [V_2: mu] : ( mnot @ ( V_1 @ V_2 ) ) ) ) ) ),
    define([status(thm)]) ).

thf(meq_ind,axiom,
    ( meq_ind
    = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) ) ).

thf('10',plain,
    ( meq_ind
    = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) ),
    inference(simplify_rw_rule,[status(thm)],[meq_ind]) ).

thf('11',plain,
    ( meq_ind
    = ( ^ [V_1: mu,V_2: mu,V_3: $i] : ( V_1 = V_2 ) ) ),
    define([status(thm)]) ).

thf(prove,conjecture,
    ( mvalid
    @ ( mforall_ind
      @ ^ [X: mu] :
          ( mbox_s5
          @ ( mexists_ind
            @ ^ [Y: mu] : ( meq_ind @ X @ Y ) ) ) ) ) ).

thf(zf_stmt_0,conjecture,
    ! [X4: $i,X6: mu,X8: $i] :
      ( ~ ! [X10: mu] : ( X6 != X10 )
      | ~ ( rel_s5 @ X4 @ X8 ) ) ).

thf(zf_stmt_1,negated_conjecture,
    ~ ! [X4: $i,X6: mu,X8: $i] :
        ( ~ ! [X10: mu] : ( X6 != X10 )
        | ~ ( rel_s5 @ X4 @ X8 ) ),
    inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl4,plain,
    ! [X0: mu] : ( sk__10 != X0 ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl5,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl4]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYO482^6 : TPTP v9.2.0. Released v4.0.0.
% 0.11/0.14  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.qQ6FLiQ9A2 true
% 0.12/0.34  % Computer : n018.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.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Wed Oct  1 17:54:23 EDT 2025
% 0.12/0.35  % CPUTime  : 
% 0.12/0.35  % Running portfolio for 300 s
% 0.12/0.35  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35  % Number of cores: 8
% 0.18/0.35  % Python version: Python 3.6.8
% 0.18/0.35  % Running in HO mode
% 0.46/0.59  % Total configuration time : 828
% 0.46/0.59  % Estimated wc time : 1656
% 0.46/0.59  % Estimated cpu time (8 cpus) : 207.0
% 0.47/0.67  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.47/0.68  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.47/0.69  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.47/0.69  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.47/0.70  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.47/0.71  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.47/0.71  % Solved by lams/40_c.s.sh.
% 0.47/0.71  % done 2 iterations in 0.011s
% 0.47/0.71  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.47/0.71  % SZS output start Refutation
% See solution above
% 0.47/0.71  
% 0.47/0.71  
% 0.47/0.71  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.47/0.71  % Terminating...
% 0.54/0.79  % Runner terminated.
% 0.54/0.81  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------