↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 01:36:17 PM UTC 2026

% Result   : Theorem 0.50s 0.85s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   26 (  22 unt;   0 typ;   0 def)
%            Number of atoms       :   53 (  18 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   94 (   9   ~;   6   |;   5   &;  67   @)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   45 (  45   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   64 (  42   ^;  22   !;   0   ?;  64   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk__12_type,type,
    sk__12: $i ).

thf(mor_type,type,
    mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

thf(sk__9_type,type,
    sk__9: $i > $o ).

thf(mand_type,type,
    mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

thf(mimpl_type,type,
    mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

thf(sk__8_type,type,
    sk__8: $i > $i > $o ).

thf(mbox_type,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

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

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

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

thf(mbox,axiom,
    ( mbox
    = ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
        ! [Y: $i] :
          ( ( R @ X @ Y )
         => ( P @ Y ) ) ) ) ).

thf('2',plain,
    ( mbox
    = ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
        ! [Y: $i] :
          ( ( R @ X @ Y )
         => ( P @ Y ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mbox]) ).

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

thf(mimpl,axiom,
    ( mimpl
    = ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ) ).

thf('4',plain,
    ( mor
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mor]) ).

thf('5',plain,
    ( mor
    = ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
          ( ( V_1 @ V_3 )
          | ( V_2 @ V_3 ) ) ) ),
    define([status(thm)]) ).

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

thf('6',plain,
    ( mnot
    = ( ^ [X: $i > $o,U: $i] :
          ~ ( X @ U ) ) ),
    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,
    ( mimpl
    = ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mimpl,'5','7']) ).

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

thf(mand,axiom,
    ( mand
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          & ( Y @ U ) ) ) ) ).

thf('10',plain,
    ( mand
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          & ( Y @ U ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mand]) ).

thf('11',plain,
    ( mand
    = ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
          ( ( V_1 @ V_3 )
          & ( V_2 @ V_3 ) ) ) ),
    define([status(thm)]) ).

thf(thm,conjecture,
    ! [R: $i > $i > $o,X: $i > $o,Y: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ R @ ( mand @ X @ Y ) ) @ ( mbox @ R @ X ) ) ) ).

thf(zf_stmt_0,conjecture,
    ! [X4: $i > $i > $o,X6: $i > $o,X8: $i > $o,X10: $i] :
      ( ~ ! [X12: $i] :
            ( ( X4 @ X10 @ X12 )
           => ( ( X6 @ X12 )
              & ( X8 @ X12 ) ) )
      | ! [X14: $i] :
          ( ( X4 @ X10 @ X14 )
         => ( X6 @ X14 ) ) ) ).

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

thf(zip_derived_cl2,plain,
    ! [X0: $i] :
      ( ( sk__9 @ X0 )
      | ~ ( sk__8 @ sk__11 @ X0 ) ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl0,plain,
    ~ ( sk__9 @ sk__12 ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl4,plain,
    ~ ( sk__8 @ sk__11 @ sk__12 ),
    inference('sup-',[status(thm)],[zip_derived_cl2,zip_derived_cl0]) ).

thf(zip_derived_cl1,plain,
    sk__8 @ sk__11 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl6,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl4,zip_derived_cl1]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL613^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.ScyDYdQdIa true
% 0.11/0.38  % Computer : n013.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sat Sep  5 06:36:05 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  % Running portfolio for 300 s
% 0.11/0.39  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.39  % Number of cores: 8
% 0.11/0.39  % Python version: Python 3.12.3
% 0.11/0.39  % Running in HO mode
% 0.46/0.68  % Total configuration time : 828
% 0.46/0.68  % Estimated wc time : 1656
% 0.46/0.68  % Estimated cpu time (8 cpus) : 207.0
% 0.50/0.80  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.50/0.81  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.50/0.82  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.50/0.83  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.50/0.85  % Solved by lams/40_c.s.sh.
% 0.50/0.85  % done 2 iterations in 0.023s
% 0.50/0.85  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.50/0.85  % SZS output start Refutation
% See solution above
% 0.50/0.85  
% 0.50/0.85  
% 0.50/0.85  % Terminating...
% 0.50/0.89  % Runner terminated.
% 1.90/0.91  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------