TSTP Solution File: SYO260^5 by Leo-III-SAT---1.7.12

View Problem - Process Solution

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

% Computer : n015.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:59:44 EDT 2024

% Result   : Theorem 5.29s 2.32s
% Output   : Refutation 5.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   4 unt;   3 typ;   0 def)
%            Number of atoms       :   29 (   2 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   98 (  22   ~;  21   |;   6   &;  49   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   30 (  30   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   38 (   4   ^  28   !;   6   ?;  38   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk3_type,type,
    sk3: $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 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM125A) ).

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 ) ) ),
    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 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

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

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

thf(140,plain,
    ! [C: $i > $o,B: $i > $o,A: $i > $o] :
      ( ~ ( B @ sk2 )
      | ( sk4 @ sk3 )
      | ( ( sk5 @ B @ A )
       != ( sk5
          @ ^ [D: $i] : $true
          @ C ) ) ),
    inference(paramod_ordered,[status(thm)],[8,40]) ).

thf(141,plain,
    ( ~ $true
    | ( sk4 @ sk3 ) ),
    inference(pattern_uni,[status(thm)],[140:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : $true )),bind(C,$thf( A ))]]) ).

thf(156,plain,
    sk4 @ sk3,
    inference(simp,[status(thm)],[141]) ).

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

thf(195,plain,
    ! [C: $i > $o,B: $i > $o,A: $i > $o] :
      ( ~ ( B @ sk2 )
      | ~ ( A @ sk3 )
      | ( ( sk5 @ B @ A )
       != ( sk5
          @ ^ [D: $i] : $true
          @ C ) ) ),
    inference(paramod_ordered,[status(thm)],[7,40]) ).

thf(196,plain,
    ! [A: $i > $o] :
      ( ~ $true
      | ~ ( A @ sk3 ) ),
    inference(pattern_uni,[status(thm)],[195:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : $true )),bind(C,$thf( A ))]]) ).

thf(220,plain,
    ! [A: $i > $o] :
      ~ ( A @ sk3 ),
    inference(simp,[status(thm)],[196]) ).

thf(248,plain,
    $false,
    inference(rewrite,[status(thm)],[156,220]) ).

thf(249,plain,
    $false,
    inference(simp,[status(thm)],[248]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYO260^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.16  % Command  : run_Leo-III %s %d
% 0.14/0.37  % Computer : n015.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 300
% 0.14/0.37  % DateTime : Mon May 20 09:34:09 EDT 2024
% 0.14/0.37  % CPUTime  : 
% 0.91/0.90  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.19/1.02  % [INFO] 	 Parsing done (111ms). 
% 1.19/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.55/1.27  % [INFO] 	 nitpick registered as external prover. 
% 1.55/1.27  % [INFO] 	 Scanning for conjecture ... 
% 1.67/1.33  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.76/1.36  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.76/1.36  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.76/1.36  % [INFO] 	 Type checking passed. 
% 1.76/1.36  % [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.29/2.31  % [INFO] 	 Killing All external provers ... 
% 5.29/2.32  % Time passed: 1757ms (effective reasoning time: 1287ms)
% 5.29/2.32  % 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.29/2.32  % Axioms used in derivation (0): 
% 5.29/2.32  % No. of inferences in proof: 16
% 5.29/2.32  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1757 ms resp. 1287 ms w/o parsing
% 5.29/2.36  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.29/2.36  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------