TSTP Solution File: KRS275^7 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : KRS275^7 : TPTP v8.1.2. Released v5.5.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.R0F4rfjU7l true

% Computer : n010.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 Aug 31 05:57:03 EDT 2023

% Result   : Theorem 0.21s 0.78s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   43
% Syntax   : Number of formulae    :   59 (  31 unt;  20 typ;   0 def)
%            Number of atoms       :  114 (  24 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  186 (  23   ~;  14   |;   0   &; 143   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   76 (  76   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  19 usr;   8 con; 0-3 aty)
%            Number of variables   :   76 (  47   ^;  29   !;   0   ?;  76   :)

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

thf(john_type,type,
    john: mu ).

thf(teach_type,type,
    teach: mu > mu > $i > $o ).

thf(psych_type,type,
    psych: mu ).

thf(rel_s4_type,type,
    rel_s4: $i > $i > $o ).

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

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

thf(mary_type,type,
    mary: mu ).

thf(cs_type,type,
    cs: mu ).

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

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

thf(math_type,type,
    math: mu ).

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

thf(mbox_s4_type,type,
    mbox_s4: ( $i > $o ) > $i > $o ).

thf(exists_in_world_type,type,
    exists_in_world: mu > $i > $o ).

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

thf(sk__10_type,type,
    sk__10: mu > $i ).

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

thf(sue_type,type,
    sue: mu ).

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

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

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

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

thf(a1,axiom,
    mreflexive @ rel_s4 ).

thf(zf_stmt_0,axiom,
    ! [X4: $i] : ( rel_s4 @ X4 @ X4 ) ).

thf(zip_derived_cl1,plain,
    ! [X0: $i] : ( rel_s4 @ X0 @ X0 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

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

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

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

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

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

thf('5',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] :
          ( ( exists_in_world @ X @ W )
         => ( Phi @ X @ W ) ) ) ) ).

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

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

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

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

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

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

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

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

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

thf('12',plain,
    ( mor
    = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
          ( ( Phi @ W )
          | ( Psi @ W ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mor]) ).

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

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

thf(db,axiom,
    ( mvalid
    @ ( mbox_s4
      @ ( mand @ ( teach @ john @ math )
        @ ( mand
          @ ( mexists_ind
            @ ^ [X: mu] : ( teach @ X @ cs ) )
          @ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ) ).

thf(zf_stmt_1,axiom,
    ! [X4: $i,X6: $i] :
      ( ~ ( ~ ( teach @ john @ math @ X6 )
          | ~ ( teach @ mary @ psych @ X6 )
          | ~ ( teach @ sue @ psych @ X6 )
          | ! [X8: mu] :
              ( ( exists_in_world @ X8 @ X6 )
             => ~ ( teach @ X8 @ cs @ X6 ) ) )
      | ~ ( rel_s4 @ X4 @ X6 ) ) ).

thf(zip_derived_cl10,plain,
    ! [X0: $i,X1: $i] :
      ( ( teach @ john @ math @ X0 )
      | ~ ( rel_s4 @ X1 @ X0 ) ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl17,plain,
    ! [X0: $i] : ( teach @ john @ math @ X0 ),
    inference('sup-',[status(thm)],[zip_derived_cl1,zip_derived_cl10]) ).

thf(query,conjecture,
    ( mvalid
    @ ( mexists_ind
      @ ^ [X: mu] : ( mbox_s4 @ ( teach @ john @ X ) ) ) ) ).

thf(zf_stmt_2,conjecture,
    ! [X4: $i] :
      ~ ! [X6: mu] :
          ( ( exists_in_world @ X6 @ X4 )
         => ~ ! [X8: $i] :
                ( ( teach @ john @ X6 @ X8 )
                | ~ ( rel_s4 @ X4 @ X8 ) ) ) ).

thf(zf_stmt_3,negated_conjecture,
    ~ ! [X4: $i] :
        ~ ! [X6: mu] :
            ( ( exists_in_world @ X6 @ X4 )
           => ~ ! [X8: $i] :
                  ( ( teach @ john @ X6 @ X8 )
                  | ~ ( rel_s4 @ X4 @ X8 ) ) ),
    inference('cnf.neg',[status(esa)],[zf_stmt_2]) ).

thf(zip_derived_cl15,plain,
    ! [X0: mu] :
      ( ~ ( teach @ john @ X0 @ ( sk__10 @ X0 ) )
      | ~ ( exists_in_world @ X0 @ sk__9 ) ),
    inference(cnf,[status(esa)],[zf_stmt_3]) ).

thf(zip_derived_cl19,plain,
    ~ ( exists_in_world @ math @ sk__9 ),
    inference('sup-',[status(thm)],[zip_derived_cl17,zip_derived_cl15]) ).

thf(existence_of_math_ax,axiom,
    ! [V: $i] : ( exists_in_world @ math @ V ) ).

thf(zip_derived_cl8,plain,
    ! [X0: $i] : ( exists_in_world @ math @ X0 ),
    inference(cnf,[status(esa)],[existence_of_math_ax]) ).

thf(zip_derived_cl21,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl19,zip_derived_cl8]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS275^7 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.R0F4rfjU7l true
% 0.13/0.34  % Computer : n010.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 : Mon Aug 28 02:02:49 EDT 2023
% 0.19/0.35  % CPUTime  : 
% 0.19/0.35  % Running portfolio for 300 s
% 0.19/0.35  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.35  % Number of cores: 8
% 0.19/0.35  % Python version: Python 3.6.8
% 0.19/0.35  % Running in HO mode
% 0.21/0.64  % Total configuration time : 828
% 0.21/0.64  % Estimated wc time : 1656
% 0.21/0.64  % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.72  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.73  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.21/0.74  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.21/0.75  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.21/0.76  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.21/0.76  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.21/0.78  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.21/0.78  % Solved by lams/40_c.s.sh.
% 0.21/0.78  % done 10 iterations in 0.022s
% 0.21/0.78  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.21/0.78  % SZS output start Refutation
% See solution above
% 0.21/0.78  
% 0.21/0.78  
% 0.21/0.78  % Terminating...
% 1.71/0.84  % Runner terminated.
% 1.71/0.85  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------