TSTP Solution File: SYO460^1 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SYO460^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n013.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 : Tue May 21 08:56:57 EDT 2024

% Result   : Theorem 2.65s 1.62s
% Output   : Refutation 2.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   19 (   6 unt;  10 typ;   5 def)
%            Number of atoms       :   55 (   5 equ;   0 cnn)
%            Maximal formula atoms :   13 (   6 avg)
%            Number of connectives :   70 (  14   ~;   8   |;   0   &;  48   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   31 (  31   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :   11 (   7   ^   4   !;   0   ?;  11   :)

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

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

thf(mor_def,definition,
    ( mor
    = ( ^ [A: $i > $o,B: $i > $o,C: $i] :
          ( ( A @ C )
          | ( B @ C ) ) ) ) ).

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

thf(mand_def,definition,
    ( mand
    = ( ^ [A: $i > $o,B: $i > $o] : ( mnot @ ( mor @ ( mnot @ A ) @ ( mnot @ B ) ) ) ) ) ).

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

thf(mimplies_def,definition,
    ( mimplies
    = ( ^ [A: $i > $o] : ( mor @ ( mnot @ A ) ) ) ) ).

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

thf(mvalid_def,definition,
    ( mvalid
    = ( '!' @ $i ) ) ).

thf(rel_k_type,type,
    rel_k: $i > $i > $o ).

thf(mdia_k_type,type,
    mdia_k: ( $i > $o ) > $i > $o ).

thf(mdia_k_def,definition,
    ( mdia_k
    = ( ^ [A: $i > $o] : ( mnot @ ( mbox_k @ ( mnot @ A ) ) ) ) ) ).

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

thf(q_type,type,
    q: $i > $o ).

thf(r_type,type,
    r: $i > $o ).

thf(1,conjecture,
    mvalid @ ( mimplies @ ( mor @ ( mdia_k @ ( mand @ p @ q ) ) @ ( mdia_k @ ( mand @ p @ r ) ) ) @ ( mdia_k @ p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).

thf(2,negated_conjecture,
    ~ ( mvalid @ ( mimplies @ ( mor @ ( mdia_k @ ( mand @ p @ q ) ) @ ( mdia_k @ ( mand @ p @ r ) ) ) @ ( mdia_k @ p ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: $i] :
        ( ~ ( ~ ! [B: $i] :
                  ( ~ ( rel_k @ A @ B )
                  | ~ ( p @ B )
                  | ~ ( q @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( rel_k @ A @ B )
                  | ~ ( p @ B )
                  | ~ ( r @ B ) ) )
        | ~ ! [B: $i] :
              ( ~ ( rel_k @ A @ B )
              | ~ ( p @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(11,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYO460^1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n013.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Mon May 20 09:41:09 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.78/0.81  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/0.97  % [INFO] 	 Parsing done (151ms). 
% 1.14/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.66/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.66/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.66/1.21  % [INFO] 	 Scanning for conjecture ... 
% 1.94/1.32  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.14/1.34  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.14/1.34  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.14/1.34  % [INFO] 	 Type checking passed. 
% 2.14/1.35  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.65/1.61  % External prover 'e' found a proof!
% 2.65/1.61  % [INFO] 	 Killing All external provers ... 
% 2.65/1.62  % Time passed: 1133ms (effective reasoning time: 637ms)
% 2.65/1.62  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.65/1.62  % Axioms used in derivation (0): 
% 2.65/1.62  % No. of inferences in proof: 4
% 2.65/1.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1133 ms resp. 637 ms w/o parsing
% 2.97/1.68  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.97/1.68  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------