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

View Problem - Process Solution

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

% Computer : n003.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 04:10:00 EDT 2024

% Result   : Theorem 3.46s 2.18s
% Output   : Refutation 3.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   1 unt;   1 typ;   0 def)
%            Number of atoms       :    1 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   0 avg)
%            Number of connectives :  131 (   2   ~;   6   |;  12   &;  84   @)
%                                         (   0 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (  17 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   45 (  45   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    1 (   0 usr;   1 con; 0-0 aty)
%            Number of variables   :   51 (   0   ^  51   !;   0   ?;  51   :)

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem  : SEV126^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.11  % Command  : run_Leo-III %s %d
% 0.11/0.31  % Computer : n003.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Sun May 19 18:31:54 EDT 2024
% 0.16/0.31  % CPUTime  : 
% 0.90/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.30/1.09  % [INFO] 	 Parsing done (163ms). 
% 1.30/1.10  % [INFO] 	 Running in sequential loop mode. 
% 1.83/1.44  % [INFO] 	 eprover registered as external prover. 
% 1.83/1.45  % [INFO] 	 cvc4 registered as external prover. 
% 1.83/1.45  % [INFO] 	 Scanning for conjecture ... 
% 2.08/1.55  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.08/1.59  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.08/1.60  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.08/1.60  % [INFO] 	 Type checking passed. 
% 2.08/1.60  % [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.46/2.18  % External prover 'e' found a proof!
% 3.46/2.18  % [INFO] 	 Killing All external provers ... 
% 3.46/2.18  % Time passed: 1723ms (effective reasoning time: 1076ms)
% 3.46/2.18  % 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.46/2.18  % Axioms used in derivation (0): 
% 3.46/2.18  % No. of inferences in proof: 4
% 3.46/2.18  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1723 ms resp. 1076 ms w/o parsing
% 3.46/2.22  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.46/2.22  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------