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

View Problem - Process Solution

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

% Computer : n007.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:05:41 EDT 2024

% Result   : Theorem 2.82s 1.94s
% Output   : Refutation 3.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (   7 unt;   6 typ;   0 def)
%            Number of atoms       :   25 (   2 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   86 (  14   ~;  13   |;   3   &;  44   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^  26   !;   0   ?;  26   :)

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

thf(sk1_type,type,
    sk1: a > $o ).

thf(sk2_type,type,
    sk2: a > $o ).

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

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

thf(sk5_type,type,
    sk5: a ).

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

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

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

thf(7,plain,
    ! [A: a] :
      ( ~ ( sk3 @ A )
      | ( sk4 @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(9,plain,
    ! [A: a] :
      ( ~ ( sk3 @ A )
      | ( sk4 @ A ) ),
    inference(simp,[status(thm)],[7]) ).

thf(8,plain,
    ~ ( sk4 @ sk5 ),
    inference(cnf,[status(esa)],[3]) ).

thf(14,plain,
    ! [A: a] :
      ( ~ ( sk3 @ A )
      | ( ( sk4 @ A )
       != ( sk4 @ sk5 ) ) ),
    inference(paramod_ordered,[status(thm)],[9,8]) ).

thf(15,plain,
    ~ ( sk3 @ sk5 ),
    inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( sk5 ))]]) ).

thf(4,plain,
    ( ( sk1 @ sk5 )
    | ( sk3 @ sk5 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: a] :
      ( ~ ( sk1 @ A )
      | ( sk2 @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(6,plain,
    ~ ( sk2 @ sk5 ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ! [A: a] :
      ( ~ ( sk1 @ A )
      | ( ( sk2 @ A )
       != ( sk2 @ sk5 ) ) ),
    inference(paramod_ordered,[status(thm)],[5,6]) ).

thf(11,plain,
    ~ ( sk1 @ sk5 ),
    inference(pattern_uni,[status(thm)],[10:[bind(A,$thf( sk5 ))]]) ).

thf(12,plain,
    ( $false
    | ( sk3 @ sk5 ) ),
    inference(rewrite,[status(thm)],[4,11]) ).

thf(13,plain,
    sk3 @ sk5,
    inference(simp,[status(thm)],[12]) ).

thf(18,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[15,13]) ).

thf(19,plain,
    $false,
    inference(simp,[status(thm)],[18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SET200^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n007.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Mon May 20 12:14:39 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 1.01/0.95  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.21/1.07  % [INFO] 	 Parsing done (118ms). 
% 1.21/1.08  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.37  % [INFO] 	 nitpick registered as external prover. 
% 1.79/1.38  % [INFO] 	 Scanning for conjecture ... 
% 1.97/1.46  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.00/1.50  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.00/1.50  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.00/1.51  % [INFO] 	 Type checking passed. 
% 2.00/1.51  % [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 ... 
% 2.66/1.90  % [INFO] 	 Killing All external provers ... 
% 2.82/1.90  % Time passed: 1365ms (effective reasoning time: 815ms)
% 2.82/1.90  % 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)>
% 2.82/1.90  % Axioms used in derivation (0): 
% 2.82/1.90  % No. of inferences in proof: 17
% 2.82/1.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1365 ms resp. 815 ms w/o parsing
% 3.02/1.99  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.02/1.99  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------