TSTP Solution File: SYO464^5 by Leo-III---1.7.12

View Problem - Process Solution

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

% Computer : n006.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:57:00 EDT 2024

% Result   : Theorem 2.86s 1.64s
% Output   : Refutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   26 (   9 unt;  11 typ;   7 def)
%            Number of atoms       :   69 (   7 equ;   0 cnn)
%            Maximal formula atoms :   13 (   4 avg)
%            Number of connectives :   98 (  15   ~;   9   |;   2   &;  70   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   37 (  37   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   4 con; 0-3 aty)
%            Number of variables   :   23 (   8   ^  15   !;   0   ?;  23   :)

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

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(mreflexive_type,type,
    mreflexive: ( $i > $i > $o ) > $o ).

thf(mreflexive_def,definition,
    ( mreflexive
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i] : ( A @ B @ 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_s4_type,type,
    rel_s4: $i > $i > $o ).

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

thf(mbox_s4_def,definition,
    ( mbox_s4
    = ( ^ [A: $i > $o,B: $i] :
        ! [C: $i] :
          ( ~ ( rel_s4 @ B @ C )
          | ( A @ C ) ) ) ) ).

thf(mdia_s4_type,type,
    mdia_s4: ( $i > $o ) > $i > $o ).

thf(mdia_s4_def,definition,
    ( mdia_s4
    = ( ^ [A: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ A ) ) ) ) ) ).

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

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

thf(1,conjecture,
    mvalid @ ( mimplies @ ( mbox_s4 @ ( mand @ p @ q ) ) @ ( mbox_s4 @ ( mbox_s4 @ ( mimplies @ ( mdia_s4 @ p ) @ ( mdia_s4 @ q ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).

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

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

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

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

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

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

thf(18,plain,
    $false,
    inference(e,[status(thm)],[5,14,16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYO464^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n006.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May 20 10:01:54 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.94/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.17/0.99  % [INFO] 	 Parsing done (136ms). 
% 1.45/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.76/1.20  % [INFO] 	 eprover registered as external prover. 
% 1.76/1.20  % [INFO] 	 cvc4 registered as external prover. 
% 1.76/1.20  % [INFO] 	 Scanning for conjecture ... 
% 2.13/1.30  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.13/1.32  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.13/1.32  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.13/1.32  % [INFO] 	 Type checking passed. 
% 2.13/1.33  % [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.86/1.64  % External prover 'e' found a proof!
% 2.86/1.64  % [INFO] 	 Killing All external provers ... 
% 2.86/1.64  % Time passed: 1109ms (effective reasoning time: 629ms)
% 2.86/1.64  % 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.86/1.64  % Axioms used in derivation (2): a1, a2
% 2.86/1.64  % No. of inferences in proof: 8
% 2.86/1.64  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1109 ms resp. 629 ms w/o parsing
% 3.27/1.67  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.27/1.67  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------