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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SYO331^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 08:56:26 EDT 2024

% Result   : Theorem 3.88s 2.12s
% Output   : Refutation 4.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    6 (   1 unt;   2 typ;   0 def)
%            Number of atoms       :   22 (   0 equ;   0 cnn)
%            Maximal formula atoms :    7 (   5 avg)
%            Number of connectives :  110 (   2   ~;   0   |;  12   &;  69   @)
%                                         (   0 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (  12 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    2 (   1 usr;   1 con; 0-2 aty)
%            Number of variables   :   42 (   6   ^  24   !;  12   ?;  42   :)

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

thf(cK_type,type,
    cK: ( a > $o ) > a > $o ).

thf(1,conjecture,
    ( ! [A: a > $o] :
        ( ! [B: a] :
            ( ( A @ B )
           => ? [C: a > $o] :
                ( ! [D: a] :
                    ( ( C @ D )
                   => ( cK @ C @ D ) )
                & ( C @ B ) ) )
       => ! [B: a] :
            ( ( cK @ A @ B )
           => ( cK
              @ ^ [C: a] :
                ? [D: a > $o] :
                  ( ! [E: a] :
                      ( ( D @ E )
                     => ( cK @ D @ E ) )
                  & ( D @ C ) )
              @ B ) ) )
   => ! [A: a] :
        ( ? [B: a > $o] :
            ( ! [C: a] :
                ( ( B @ C )
               => ( cK @ B @ C ) )
            & ( B @ A ) )
       => ( cK
          @ ^ [B: a] :
            ? [C: a > $o] :
              ( ! [D: a] :
                  ( ( C @ D )
                 => ( cK @ C @ D ) )
              & ( C @ B ) )
          @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM116_2SS_pme) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : SYO331^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.17  % Command  : run_Leo-III %s %d
% 0.16/0.39  % Computer : n003.cluster.edu
% 0.16/0.39  % Model    : x86_64 x86_64
% 0.16/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39  % Memory   : 8042.1875MB
% 0.16/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39  % CPULimit : 300
% 0.16/0.39  % WCLimit  : 300
% 0.16/0.39  % DateTime : Mon May 20 09:52:53 EDT 2024
% 0.16/0.39  % CPUTime  : 
% 0.91/0.94  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.34/1.05  % [INFO] 	 Parsing done (111ms). 
% 1.34/1.06  % [INFO] 	 Running in sequential loop mode. 
% 1.73/1.30  % [INFO] 	 eprover registered as external prover. 
% 1.73/1.30  % [INFO] 	 cvc4 registered as external prover. 
% 1.73/1.30  % [INFO] 	 Scanning for conjecture ... 
% 2.00/1.36  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.00/1.39  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.00/1.40  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.00/1.41  % [INFO] 	 Type checking passed. 
% 2.00/1.41  % [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.88/2.11  % External prover 'e' found a proof!
% 3.88/2.11  % [INFO] 	 Killing All external provers ... 
% 3.88/2.12  % Time passed: 1541ms (effective reasoning time: 1052ms)
% 3.88/2.12  % 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.88/2.12  % Axioms used in derivation (0): 
% 3.88/2.12  % No. of inferences in proof: 4
% 3.88/2.12  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1541 ms resp. 1052 ms w/o parsing
% 4.04/2.15  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.04/2.15  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------