TSTP Solution File: SYO457^6 by Leo-III---1.7.12

View Problem - Process Solution

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

% Computer : n009.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:55 EDT 2024

% Result   : Theorem 3.45s 2.15s
% Output   : Refutation 3.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   28 (   9 unt;  11 typ;   7 def)
%            Number of atoms       :   58 (   7 equ;   0 cnn)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   83 (  10   ~;   6   |;   2   &;  61   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   35 (  35   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   4 con; 0-3 aty)
%            Number of variables   :   24 (   7   ^  17   !;   0   ?;  24   :)

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

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

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

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

thf(mreflexive_def,definition,
    ( mreflexive
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i] : ( A @ B @ B ) ) ) ).

thf(msymmetric_type,type,
    msymmetric: ( $i > $i > $o ) > $o ).

thf(msymmetric_def,definition,
    ( msymmetric
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i,C: $i] :
          ( ( A @ B @ C )
         => ( A @ C @ B ) ) ) ) ).

thf(mtransitive_type,type,
    mtransitive: ( $i > $i > $o ) > $o ).

thf(mtransitive_def,definition,
    ( mtransitive
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i,C: $i,D: $i] :
          ( ( ( A @ B @ C )
            & ( A @ C @ D ) )
         => ( A @ B @ D ) ) ) ) ).

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

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

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

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

thf(mbox_s5_def,definition,
    ( mbox_s5
    = ( ^ [A: $i > $o,B: $i] :
        ! [C: $i] :
          ( ~ ( rel_s5 @ B @ C )
          | ( A @ C ) ) ) ) ).

thf(mdia_s5_type,type,
    mdia_s5: ( $i > $o ) > $i > $o ).

thf(mdia_s5_def,definition,
    ( mdia_s5
    = ( ^ [A: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ A ) ) ) ) ) ).

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

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

thf(1,conjecture,
    mvalid @ ( mimplies @ ( mdia_s5 @ ( mbox_s5 @ p ) ) @ ( mdia_s5 @ ( mimplies @ q @ p ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).

thf(2,negated_conjecture,
    ~ ( mvalid @ ( mimplies @ ( mdia_s5 @ ( mbox_s5 @ p ) ) @ ( mdia_s5 @ ( mimplies @ q @ p ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(3,axiom,
    mreflexive @ rel_s5,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).

thf(13,plain,
    ! [A: $i] : ( rel_s5 @ A @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    mtransitive @ rel_s5,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).

thf(15,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( rel_s5 @ A @ B )
        & ( rel_s5 @ B @ C ) )
     => ( rel_s5 @ A @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(5,axiom,
    msymmetric @ rel_s5,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).

thf(17,plain,
    ! [A: $i,B: $i] :
      ( ( rel_s5 @ A @ B )
     => ( rel_s5 @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(19,plain,
    $false,
    inference(e,[status(thm)],[6,13,15,17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SYO457^6 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11  % Command  : run_Leo-III %s %d
% 0.11/0.30  % Computer : n009.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Mon May 20 09:21:09 EDT 2024
% 0.11/0.30  % CPUTime  : 
% 0.91/0.90  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.28/1.13  % [INFO] 	 Parsing done (231ms). 
% 1.28/1.14  % [INFO] 	 Running in sequential loop mode. 
% 1.93/1.48  % [INFO] 	 eprover registered as external prover. 
% 1.93/1.48  % [INFO] 	 cvc4 registered as external prover. 
% 1.93/1.49  % [INFO] 	 Scanning for conjecture ... 
% 2.29/1.65  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.44/1.68  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.44/1.68  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.44/1.69  % [INFO] 	 Type checking passed. 
% 2.44/1.69  % [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 ... 
% 3.45/2.15  % External prover 'e' found a proof!
% 3.45/2.15  % [INFO] 	 Killing All external provers ... 
% 3.45/2.15  % Time passed: 1701ms (effective reasoning time: 999ms)
% 3.45/2.15  % 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)>
% 3.45/2.15  % Axioms used in derivation (3): a1, a2, a3
% 3.45/2.15  % No. of inferences in proof: 10
% 3.45/2.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1701 ms resp. 999 ms w/o parsing
% 3.45/2.19  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.45/2.19  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------