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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SEU998^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 03:40:37 EDT 2024

% Result   : Theorem 3.65s 1.84s
% Output   : Refutation 3.65s
% 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       :  118 ( 117 equ;   0 cnn)
%            Maximal formula atoms :   39 (  29 avg)
%            Number of connectives :  407 (  35   ~;   0   |; 108   &; 258   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   40 (  30 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
%            Number of variables   :   78 (   0   ^  63   !;  15   ?;  78   :)

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SEU998^5 : TPTP v8.2.0. Released v4.0.0.
% 0.16/0.16  % Command  : run_Leo-III %s %d
% 0.17/0.37  % Computer : n006.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38  % CPULimit : 300
% 0.17/0.38  % WCLimit  : 300
% 0.17/0.38  % DateTime : Sun May 19 17:10:39 EDT 2024
% 0.17/0.38  % CPUTime  : 
% 0.84/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.24/0.94  % [INFO] 	 Parsing done (113ms). 
% 1.24/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.16  % [INFO] 	 eprover registered as external prover. 
% 1.67/1.17  % [INFO] 	 cvc4 registered as external prover. 
% 1.67/1.17  % [INFO] 	 Scanning for conjecture ... 
% 2.01/1.26  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.01/1.29  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.01/1.29  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.01/1.30  % [INFO] 	 Type checking passed. 
% 2.01/1.30  % [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.65/1.84  % External prover 'e' found a proof!
% 3.65/1.84  % [INFO] 	 Killing All external provers ... 
% 3.65/1.84  % Time passed: 1303ms (effective reasoning time: 884ms)
% 3.65/1.84  % 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.65/1.84  % Axioms used in derivation (0): 
% 3.65/1.84  % No. of inferences in proof: 4
% 3.65/1.84  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1303 ms resp. 884 ms w/o parsing
% 3.65/1.87  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.65/1.87  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------