TSTP Solution File: SEV063^5 by Leo-III---1.7.15

View Problem - Process Solution

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

% Computer : n019.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 : Mon Jun 24 15:58:07 EDT 2024

% Result   : Theorem 3.34s 1.81s
% Output   : Refutation 3.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :    1 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   0 avg)
%            Number of connectives :  161 (   2   ~;   0   |;  21   &; 108   @)
%                                         (   0 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (  14 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    1 (   0 usr;   1 con; 0-0 aty)
%            Number of variables   :   66 (   0   ^  66   !;   0   ?;  66   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(1,conjecture,
    ! [A: a > a > $o,B: a,C: a,D: a] :
      ( ( ! [E: a > a > $o] :
            ( ( ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( E @ F @ G ) )
              & ! [F: a,G: a,H: a] :
                  ( ( ( E @ F @ G )
                    & ( E @ G @ H ) )
                 => ( E @ F @ H ) ) )
           => ( E @ B @ C ) )
        & ! [E: a > a > $o] :
            ( ( ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( E @ F @ G ) )
              & ! [F: a,G: a,H: a] :
                  ( ( ( E @ F @ G )
                    & ( E @ G @ H ) )
                 => ( E @ F @ H ) ) )
           => ( E @ C @ D ) ) )
     => ! [E: a > a > $o] :
          ( ( ! [F: a,G: a] :
                ( ( A @ F @ G )
               => ( E @ F @ G ) )
            & ! [F: a,G: a,H: a] :
                ( ( ( E @ F @ G )
                  & ( E @ G @ H ) )
               => ( E @ F @ H ) ) )
         => ( E @ B @ D ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM136_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > a > $o,B: a,C: a,D: a] :
        ( ( ! [E: a > a > $o] :
              ( ( ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( E @ F @ G ) )
                & ! [F: a,G: a,H: a] :
                    ( ( ( E @ F @ G )
                      & ( E @ G @ H ) )
                   => ( E @ F @ H ) ) )
             => ( E @ B @ C ) )
          & ! [E: a > a > $o] :
              ( ( ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( E @ F @ G ) )
                & ! [F: a,G: a,H: a] :
                    ( ( ( E @ F @ G )
                      & ( E @ G @ H ) )
                   => ( E @ F @ H ) ) )
             => ( E @ C @ D ) ) )
       => ! [E: a > a > $o] :
            ( ( ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( E @ F @ G ) )
              & ! [F: a,G: a,H: a] :
                  ( ( ( E @ F @ G )
                    & ( E @ G @ H ) )
                 => ( E @ F @ H ) ) )
           => ( E @ B @ D ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > a > $o,B: a,C: a,D: a] :
        ( ( ! [E: a > a > $o] :
              ( ( ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( E @ F @ G ) )
                & ! [F: a,G: a,H: a] :
                    ( ( ( E @ F @ G )
                      & ( E @ G @ H ) )
                   => ( E @ F @ H ) ) )
             => ( E @ B @ C ) )
          & ! [E: a > a > $o] :
              ( ( ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( E @ F @ G ) )
                & ! [F: a,G: a,H: a] :
                    ( ( ( E @ F @ G )
                      & ( E @ G @ H ) )
                   => ( E @ F @ H ) ) )
             => ( E @ C @ D ) ) )
       => ! [E: a > a > $o] :
            ( ( ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( E @ F @ G ) )
              & ! [F: a,G: a,H: a] :
                  ( ( ( E @ F @ G )
                    & ( E @ G @ H ) )
                 => ( E @ F @ H ) ) )
           => ( E @ B @ D ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SEV063^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13  % Command  : run_Leo-III %s %d THM
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Fri Jun 21 19:31:10 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.99/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.19/1.01  % [INFO] 	 Parsing done (118ms). 
% 1.19/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.78/1.25  % [INFO] 	 eprover registered as external prover. 
% 1.78/1.25  % [INFO] 	 Scanning for conjecture ... 
% 1.95/1.32  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.95/1.34  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.95/1.34  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.95/1.35  % [INFO] 	 Type checking passed. 
% 1.95/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 ... 
% 3.32/1.81  % External prover 'e' found a proof!
% 3.32/1.81  % [INFO] 	 Killing All external provers ... 
% 3.32/1.81  % Time passed: 1260ms (effective reasoning time: 788ms)
% 3.32/1.81  % 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.34/1.81  % Axioms used in derivation (0): 
% 3.34/1.81  % No. of inferences in proof: 4
% 3.34/1.81  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1260 ms resp. 788 ms w/o parsing
% 3.34/1.85  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.34/1.85  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------