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

View Problem - Process Solution

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

% Computer : n024.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 20:50:48 EDT 2024

% Result   : Theorem 5.70s 2.78s
% Output   : Refutation 5.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   3 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  119 (  32   ~;  19   |;   9   &;  59   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   26 (  26   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   45 (   7   ^  32   !;   6   ?;  45   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk1_type,type,
    sk1: $i ).

thf(sk4_type,type,
    sk4: $i > $o ).

thf(sk5_type,type,
    sk5: ( $i > $o ) > ( $i > $o ) > $o ).

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

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

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

thf(5,plain,
    ! [B: $i > $o,A: $i > $o] :
      ( ~ ( B @ sk1 )
      | ~ ( sk5 @ B @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    ! [B: $i > $o,A: $i > $o] :
      ( ~ ( A @ sk1 )
      | ~ ( sk5 @ B @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(34,plain,
    ! [A: $i > $o] :
      ( ~ $true
      | ~ ( sk5 @ A
          @ ^ [B: $i] : $true ) ),
    inference(prim_subst,[status(thm)],[7:[bind(A,$thf( ^ [C: $i] : $true ))]]) ).

thf(42,plain,
    ! [A: $i > $o] :
      ~ ( sk5 @ A
        @ ^ [B: $i] : $true ),
    inference(simp,[status(thm)],[34]) ).

thf(37,plain,
    ! [A: $i > $o] :
      ( ~ ( sk4 @ sk1 )
      | ~ ( sk5 @ A @ sk4 ) ),
    inference(prim_subst,[status(thm)],[7:[bind(A,$thf( sk4 ))]]) ).

thf(49,plain,
    ! [A: $i > $o] :
      ( ~ ( sk4 @ sk1 )
      | ~ ( sk5 @ A @ sk4 ) ),
    inference(simp,[status(thm)],[37]) ).

thf(15,plain,
    ! [B: $i > $o,A: $i > $o] :
      ( ~ ~ ( B @ sk1 )
      | ~ ( sk5
          @ ^ [C: $i] :
              ~ ( B @ C )
          @ A ) ),
    inference(prim_subst,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ~ ( C @ D ) ))]]) ).

thf(30,plain,
    ! [B: $i > $o,A: $i > $o] :
      ( ~ ( sk5
          @ ^ [C: $i] :
              ~ ( B @ C )
          @ A )
      | ( B @ sk1 ) ),
    inference(cnf,[status(esa)],[15]) ).

thf(31,plain,
    ! [B: $i > $o,A: $i > $o] :
      ( ~ ( sk5
          @ ^ [C: $i] :
              ~ ( B @ C )
          @ A )
      | ( B @ sk1 ) ),
    inference(simp,[status(thm)],[30]) ).

thf(18,plain,
    ! [A: $i > $o] :
      ( ~ $true
      | ~ ( sk5
          @ ^ [B: $i] : $true
          @ A ) ),
    inference(prim_subst,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( ^ [C: $i] : $true ))]]) ).

thf(28,plain,
    ! [A: $i > $o] :
      ~ ( sk5
        @ ^ [B: $i] : $true
        @ A ),
    inference(simp,[status(thm)],[18]) ).

thf(21,plain,
    ! [A: $i > $o] :
      ( ~ ( sk4 @ sk1 )
      | ~ ( sk5 @ sk4 @ A ) ),
    inference(prim_subst,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( sk4 ))]]) ).

thf(250,plain,
    $false,
    inference(e,[status(thm)],[5,42,49,7,3,31,28,21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SYO264^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.11  % Command  : run_Leo-III %s %d THM
% 0.10/0.31  % Computer : n024.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Sun Jun 23 08:40:10 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.96/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.21/1.06  % [INFO] 	 Parsing done (136ms). 
% 1.21/1.07  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.33  % [INFO] 	 eprover registered as external prover. 
% 1.67/1.33  % [INFO] 	 Scanning for conjecture ... 
% 1.83/1.40  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.83/1.44  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.83/1.44  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.83/1.44  % [INFO] 	 Type checking passed. 
% 1.83/1.45  % [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 ... 
% 5.70/2.78  % External prover 'e' found a proof!
% 5.70/2.78  % [INFO] 	 Killing All external provers ... 
% 5.70/2.78  % Time passed: 2302ms (effective reasoning time: 1703ms)
% 5.70/2.78  % 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)>
% 5.70/2.78  % Axioms used in derivation (0): 
% 5.70/2.78  % No. of inferences in proof: 16
% 5.70/2.78  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2302 ms resp. 1703 ms w/o parsing
% 5.70/2.80  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.70/2.80  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------