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

View Problem - Process Solution

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

% Computer : n010.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:53 EDT 2024

% Result   : Theorem 3.19s 1.79s
% Output   : Refutation 3.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   6 unt;   3 typ;   0 def)
%            Number of atoms       :   23 (  18 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  112 (  31   ~;  13   |;  24   &;  40   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   19 (  19   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (   0   ^  13   !;  32   ?;  45   :)

% Comments : 
%------------------------------------------------------------------------------
thf(z_type,type,
    z: $i ).

thf(sk3_type,type,
    sk3: $i > $o ).

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

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

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

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

thf(4,plain,
    ~ ( ? [A: $i > $o] :
          ( ? [B: $i] : ( A @ B )
          & ? [B: $i > $o,C: $i] :
              ( ~ ( A @ C )
              & ( B @ C )
              & ~ ( B @ z ) ) )
     => ? [A: $i > $o,B: $i > $o] :
          ( ~ ( B @ z )
          & ? [C: $i,D: $i] :
              ( ( B @ D )
              & ( A @ C )
              & ~ ( A @ D ) ) ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ! [D: $i,C: $i,B: $i > $o,A: $i > $o] :
      ( ( B @ z )
      | ~ ( B @ D )
      | ~ ( A @ C )
      | ( A @ D ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(10,plain,
    ! [B: $i,A: $i] :
      ( ( B = z )
      | ( B != B )
      | ( A != A )
      | ( A = B ) ),
    inference(replace_leibeq,[status(thm)],[5:[bind(A,$thf( (=) @ $i @ C )),bind(B,$thf( (=) @ $i @ D ))]]) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ( B = z )
      | ( B != B )
      | ( A != A )
      | ( A = B ) ),
    inference(lifteq,[status(thm)],[10]) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ( ( B = z )
      | ( A = B ) ),
    inference(simp,[status(thm)],[11]) ).

thf(9,plain,
    sk3 @ sk4,
    inference(cnf,[status(esa)],[4]) ).

thf(6,plain,
    ~ ( sk3 @ z ),
    inference(cnf,[status(esa)],[4]) ).

thf(15,plain,
    ( ( sk3 @ sk4 )
   != ( sk3 @ z ) ),
    inference(paramod_ordered,[status(thm)],[9,6]) ).

thf(16,plain,
    sk4 != z,
    inference(simp,[status(thm)],[15]) ).

thf(51,plain,
    ! [B: $i,A: $i] :
      ( ( B = z )
      | ( A != z )
      | ( B != sk4 ) ),
    inference(paramod_ordered,[status(thm)],[12,16]) ).

thf(52,plain,
    ! [A: $i] :
      ( ( sk4 = z )
      | ( A != z ) ),
    inference(pattern_uni,[status(thm)],[51:[bind(A,$thf( A )),bind(B,$thf( sk4 ))]]) ).

thf(66,plain,
    sk4 = z,
    inference(simp,[status(thm)],[52]) ).

thf(80,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[66,16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SYO315^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n010.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May 20 09:10:39 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.98/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/1.00  % [INFO] 	 Parsing done (110ms). 
% 1.22/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.71/1.23  % [INFO] 	 nitpick registered as external prover. 
% 1.71/1.24  % [INFO] 	 Scanning for conjecture ... 
% 1.77/1.30  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.94/1.32  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.94/1.32  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.94/1.32  % [INFO] 	 Type checking passed. 
% 1.94/1.32  % [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.19/1.78  % [INFO] 	 Killing All external provers ... 
% 3.19/1.79  % Time passed: 1236ms (effective reasoning time: 769ms)
% 3.19/1.79  % 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.19/1.79  % Axioms used in derivation (0): 
% 3.19/1.79  % No. of inferences in proof: 16
% 3.19/1.79  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1236 ms resp. 769 ms w/o parsing
% 3.22/1.83  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.22/1.83  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------