↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : LCL722^1 : TPTP v9.3.1. Bugfixed v5.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.A41thtKq7s true

% Computer : n005.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:37:07 PM UTC 2026

% Result   : Theorem 0.52s 0.80s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   28 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :   65 (  18 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   82 (  13   ~;  11   |;   0   &;  58   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   27 (  27   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :   49 (  33   ^;  16   !;   0   ?;  49   :)

% Comments : 
%------------------------------------------------------------------------------
thf(rel_m_type,type,
    rel_m: $i > $i > $o ).

thf(mreflexive_type,type,
    mreflexive: ( $i > $i > $o ) > $o ).

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

thf(mimplies_type,type,
    mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(phi_type,type,
    phi: $i > $o ).

thf(sk__3_type,type,
    sk__3: $i ).

thf(mbox_m_type,type,
    mbox_m: ( $i > $o ) > $i > $o ).

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

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

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

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

thf('1',plain,
    ( mbox_m
    = ( ^ [V_1: $i > $o,V_2: $i] :
        ! [X4: $i] :
          ( ( V_1 @ X4 )
          | ~ ( rel_m @ 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(mimplies,axiom,
    ( mimplies
    = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).

thf(mor,axiom,
    ( mor
    = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
          ( ( Phi @ W )
          | ( Psi @ W ) ) ) ) ).

thf('4',plain,
    ( mor
    = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
          ( ( Phi @ W )
          | ( Psi @ W ) ) ) ),
    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
    = ( ^ [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,
    ( mimplies
    = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mimplies,'5','7']) ).

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

thf(conj,conjecture,
    mvalid @ ( mimplies @ ( mbox_m @ phi ) @ phi ) ).

thf(zf_stmt_0,conjecture,
    ! [X4: $i] :
      ( ~ ! [X6: $i] :
            ( ( phi @ X6 )
            | ~ ( rel_m @ X4 @ X6 ) )
      | ( phi @ X4 ) ) ).

thf(zf_stmt_1,negated_conjecture,
    ~ ! [X4: $i] :
        ( ~ ! [X6: $i] :
              ( ( phi @ X6 )
              | ~ ( rel_m @ X4 @ X6 ) )
        | ( phi @ X4 ) ),
    inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl1,plain,
    ~ ( phi @ sk__3 ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl2,plain,
    ! [X0: $i] :
      ( ( phi @ X0 )
      | ~ ( rel_m @ sk__3 @ X0 ) ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(mreflexive,axiom,
    ( mreflexive
    = ( ^ [R: $i > $i > $o] :
        ! [S: $i] : ( R @ S @ S ) ) ) ).

thf('10',plain,
    ( mreflexive
    = ( ^ [R: $i > $i > $o] :
        ! [S: $i] : ( R @ S @ S ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mreflexive]) ).

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

thf(a1,axiom,
    mreflexive @ rel_m ).

thf(zf_stmt_2,axiom,
    ! [X4: $i] : ( rel_m @ X4 @ X4 ) ).

thf(zip_derived_cl0,plain,
    ! [X0: $i] : ( rel_m @ X0 @ X0 ),
    inference(cnf,[status(esa)],[zf_stmt_2]) ).

thf(zip_derived_cl3,plain,
    phi @ sk__3,
    inference('sup+',[status(thm)],[zip_derived_cl2,zip_derived_cl0]) ).

thf(zip_derived_cl7,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl1,zip_derived_cl3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL722^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.04  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.A41thtKq7s true
% 0.09/0.35  % Computer : n005.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep  5 10:26:05 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Running portfolio for 300 s
% 0.09/0.36  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36  % Number of cores: 8
% 0.14/0.36  % Python version: Python 3.12.3
% 0.14/0.36  % Running in HO mode
% 0.46/0.66  % Total configuration time : 828
% 0.46/0.66  % Estimated wc time : 1656
% 0.46/0.66  % Estimated cpu time (8 cpus) : 207.0
% 0.49/0.74  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.49/0.79  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.49/0.79  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.49/0.79  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.52/0.80  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.52/0.80  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.52/0.80  % Solved by lams/40_c.s.sh.
% 0.52/0.80  % done 3 iterations in 0.019s
% 0.52/0.80  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.52/0.80  % SZS output start Refutation
% See solution above
% 0.52/0.80  
% 0.52/0.80  
% 0.52/0.80  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.52/0.80  % Terminating...
% 0.52/0.84  % Runner terminated.
% 0.52/0.85  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------