TSTP Solution File: SEU711^2 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SEU711^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% 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 : Tue May 21 03:43:27 EDT 2024

% Result   : Theorem 165.87s 30.52s
% Output   : Refutation 165.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   66 (  15 unt;  10 typ;   3 def)
%            Number of atoms       :  186 (  16 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  769 (  45   ~;  81   |;   0   &; 596   @)
%                                         (   0 <=>;  47  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   9 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :  147 (   0   ^ 147   !;   0   ?; 147   :)

% Comments : 
%------------------------------------------------------------------------------
thf(in_type,type,
    in: $i > $i > $o ).

thf(powerset_type,type,
    powerset: $i > $i ).

thf(powersetI_type,type,
    powersetI: $o ).

thf(powersetI_def,definition,
    ( powersetI
    = ( ! [A: $i,B: $i] :
          ( ! [C: $i] :
              ( ( in @ C @ B )
             => ( in @ C @ A ) )
         => ( in @ B @ ( powerset @ A ) ) ) ) ) ).

thf(powersetE_type,type,
    powersetE: $o ).

thf(powersetE_def,definition,
    ( powersetE
    = ( ! [A: $i,B: $i,C: $i] :
          ( ( in @ B @ ( powerset @ A ) )
         => ( ( in @ C @ B )
           => ( in @ C @ A ) ) ) ) ) ).

thf(binunion_type,type,
    binunion: $i > $i > $i ).

thf(binunionEcases_type,type,
    binunionEcases: $o ).

thf(binunionEcases_def,definition,
    ( binunionEcases
    = ( ! [A: $i,B: $i,C: $i,D: $o] :
          ( ( in @ C @ ( binunion @ A @ B ) )
         => ( ( ( in @ C @ A )
             => D )
           => ( ( ( in @ C @ B )
               => D )
             => D ) ) ) ) ) ).

thf(sk1_type,type,
    sk1: $i > $i > $i ).

thf(sk2_type,type,
    sk2: $i ).

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

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

thf(1,conjecture,
    ( powersetI
   => ( powersetE
     => ( binunionEcases
       => ! [A: $i,B: $i] :
            ( ( in @ B @ ( powerset @ A ) )
           => ! [C: $i] :
                ( ( in @ C @ ( powerset @ A ) )
               => ( in @ ( binunion @ B @ C ) @ ( powerset @ A ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionT_lem) ).

thf(2,negated_conjecture,
    ~ ( powersetI
     => ( powersetE
       => ( binunionEcases
         => ! [A: $i,B: $i] :
              ( ( in @ B @ ( powerset @ A ) )
             => ! [C: $i] :
                  ( ( in @ C @ ( powerset @ A ) )
                 => ( in @ ( binunion @ B @ C ) @ ( powerset @ A ) ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: $i,B: $i] :
          ( ! [C: $i] :
              ( ( in @ C @ B )
             => ( in @ C @ A ) )
         => ( in @ B @ ( powerset @ A ) ) )
     => ( ! [A: $i,B: $i,C: $i] :
            ( ( in @ B @ ( powerset @ A ) )
           => ( ( in @ C @ B )
             => ( in @ C @ A ) ) )
       => ( ! [A: $i,B: $i,C: $i,D: $o] :
              ( ( in @ C @ ( binunion @ A @ B ) )
             => ( ( ( in @ C @ A )
                 => D )
               => ( ( ( in @ C @ B )
                   => D )
                 => D ) ) )
         => ! [A: $i,B: $i] :
              ( ( in @ B @ ( powerset @ A ) )
             => ! [C: $i] :
                  ( ( in @ C @ ( powerset @ A ) )
                 => ( in @ ( binunion @ B @ C ) @ ( powerset @ A ) ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ( ! [A: $i,B: $i] :
          ( ! [C: $i] :
              ( ( in @ C @ B )
             => ( in @ C @ A ) )
         => ( in @ B @ ( powerset @ A ) ) )
     => ( ! [A: $i,B: $i] :
            ( ( in @ B @ ( powerset @ A ) )
           => ! [C: $i] :
                ( ( in @ C @ B )
               => ( in @ C @ A ) ) )
       => ( ! [A: $i,B: $i,C: $i] :
              ( ( in @ C @ ( binunion @ A @ B ) )
             => ! [D: $o] :
                  ( ( ( in @ C @ A )
                   => D )
                 => ( ( ( in @ C @ B )
                     => D )
                   => D ) ) )
         => ! [A: $i,B: $i] :
              ( ( in @ B @ ( powerset @ A ) )
             => ! [C: $i] :
                  ( ( in @ C @ ( powerset @ A ) )
                 => ( in @ ( binunion @ B @ C ) @ ( powerset @ A ) ) ) ) ) ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(8,plain,
    ! [B: $i,A: $i] :
      ( ( in @ ( sk1 @ B @ A ) @ B )
      | ( in @ B @ ( powerset @ A ) ) ),
    inference(cnf,[status(esa)],[4]) ).

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

thf(18,plain,
    ! [D: $o,C: $i,B: $i,A: $i] :
      ( ~ ( in @ C @ ( binunion @ A @ B ) )
      | ( in @ C @ A )
      | ( in @ C @ B )
      | D ),
    inference(simp,[status(thm)],[9]) ).

thf(193,plain,
    ! [F: $o,E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( in @ B @ ( powerset @ A ) )
      | ( in @ E @ C )
      | ( in @ E @ D )
      | F
      | ( ( in @ ( sk1 @ B @ A ) @ B )
       != ( in @ E @ ( binunion @ C @ D ) ) ) ),
    inference(paramod_ordered,[status(thm)],[8,18]) ).

thf(194,plain,
    ! [D: $i,C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ D ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ C )
      | ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ D )
      | A ),
    inference(pattern_uni,[status(thm)],[193:[bind(A,$thf( H )),bind(B,$thf( binunion @ I @ J )),bind(C,$thf( I )),bind(D,$thf( J )),bind(E,$thf( sk1 @ ( binunion @ I @ J ) @ H )),bind(F,$thf( F ))]]) ).

thf(226,plain,
    ! [D: $i,C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ D ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ C )
      | ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ D )
      | A ),
    inference(simp,[status(thm)],[194]) ).

thf(14,plain,
    in @ sk3 @ ( powerset @ sk2 ),
    inference(cnf,[status(esa)],[4]) ).

thf(7,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ B @ ( powerset @ A ) )
      | ~ ( in @ C @ B )
      | ( in @ C @ A ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(19,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ B @ ( powerset @ A ) )
      | ~ ( in @ C @ B )
      | ( in @ C @ A ) ),
    inference(simp,[status(thm)],[7]) ).

thf(26,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ C @ B )
      | ( in @ C @ A )
      | ( ( in @ sk3 @ ( powerset @ sk2 ) )
       != ( in @ B @ ( powerset @ A ) ) ) ),
    inference(paramod_ordered,[status(thm)],[14,19]) ).

thf(27,plain,
    ! [A: $i] :
      ( ~ ( in @ A @ sk3 )
      | ( in @ A @ sk2 ) ),
    inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 ))]]) ).

thf(45,plain,
    ! [A: $i] :
      ( ~ ( in @ A @ sk3 )
      | ( in @ A @ sk2 ) ),
    inference(simp,[status(thm)],[27]) ).

thf(450,plain,
    ! [E: $i,D: $i,C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ D ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ D )
      | A
      | ( in @ E @ sk2 )
      | ( ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ C )
       != ( in @ E @ sk3 ) ) ),
    inference(paramod_ordered,[status(thm)],[226,45]) ).

thf(451,plain,
    ! [C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ sk3 @ C ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ sk3 @ C ) @ B ) @ C )
      | A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ C ) @ B ) @ sk2 ) ),
    inference(pattern_uni,[status(thm)],[450:[bind(A,$thf( A )),bind(B,$thf( G )),bind(C,$thf( sk3 )),bind(D,$thf( I )),bind(E,$thf( sk1 @ ( binunion @ sk3 @ I ) @ G ))]]) ).

thf(522,plain,
    ! [C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ sk3 @ C ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ sk3 @ C ) @ B ) @ C )
      | A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ C ) @ B ) @ sk2 ) ),
    inference(simp,[status(thm)],[451]) ).

thf(11,plain,
    in @ sk4 @ ( powerset @ sk2 ),
    inference(cnf,[status(esa)],[4]) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ( ~ ( in @ ( sk1 @ B @ A ) @ A )
      | ( in @ B @ ( powerset @ A ) ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(87,plain,
    ! [E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( in @ B @ ( powerset @ A ) )
      | ~ ( in @ C @ B )
      | ( in @ E @ ( powerset @ D ) )
      | ( ( in @ C @ A )
       != ( in @ ( sk1 @ E @ D ) @ D ) ) ),
    inference(paramod_ordered,[status(thm)],[19,12]) ).

thf(88,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ B @ ( powerset @ A ) )
      | ~ ( in @ ( sk1 @ C @ A ) @ B )
      | ( in @ C @ ( powerset @ A ) ) ),
    inference(pattern_uni,[status(thm)],[87:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( sk1 @ F @ A )),bind(D,$thf( A )),bind(E,$thf( F ))]]) ).

thf(93,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ B @ ( powerset @ A ) )
      | ~ ( in @ ( sk1 @ C @ A ) @ B )
      | ( in @ C @ ( powerset @ A ) ) ),
    inference(simp,[status(thm)],[88]) ).

thf(6013,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ ( sk1 @ C @ A ) @ B )
      | ( in @ C @ ( powerset @ A ) )
      | ( ( in @ sk4 @ ( powerset @ sk2 ) )
       != ( in @ B @ ( powerset @ A ) ) ) ),
    inference(paramod_ordered,[status(thm)],[11,93]) ).

thf(6014,plain,
    ! [A: $i] :
      ( ~ ( in @ ( sk1 @ A @ sk2 ) @ sk4 )
      | ( in @ A @ ( powerset @ sk2 ) ) ),
    inference(pattern_uni,[status(thm)],[6013:[bind(A,$thf( sk2 )),bind(B,$thf( sk4 ))]]) ).

thf(6160,plain,
    ! [A: $i] :
      ( ~ ( in @ ( sk1 @ A @ sk2 ) @ sk4 )
      | ( in @ A @ ( powerset @ sk2 ) ) ),
    inference(simp,[status(thm)],[6014]) ).

thf(97108,plain,
    ! [D: $i,C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ sk3 @ C ) @ ( powerset @ B ) )
      | A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ C ) @ B ) @ sk2 )
      | ( in @ D @ ( powerset @ sk2 ) )
      | ( ( in @ ( sk1 @ ( binunion @ sk3 @ C ) @ B ) @ C )
       != ( in @ ( sk1 @ D @ sk2 ) @ sk4 ) ) ),
    inference(paramod_ordered,[status(thm)],[522,6160]) ).

thf(97109,plain,
    ! [A: $o] :
      ( ( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) )
      | A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2 )
      | ( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) ) ),
    inference(pattern_uni,[status(thm)],[97108:[bind(A,$thf( A )),bind(B,$thf( sk2 )),bind(C,$thf( sk4 )),bind(D,$thf( binunion @ sk3 @ sk4 ))]]) ).

thf(97863,plain,
    ! [A: $o] :
      ( ( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) )
      | A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2 ) ),
    inference(simp,[status(thm)],[97109]) ).

thf(13,plain,
    ~ ( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(99726,plain,
    ! [A: $o] :
      ( $false
      | A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2 ) ),
    inference(rewrite,[status(thm)],[97863,13]) ).

thf(99727,plain,
    ! [A: $o] :
      ( A
      | ( in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2 ) ),
    inference(simp,[status(thm)],[99726]) ).

thf(496,plain,
    ! [D: $i,C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ D ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ C )
      | A
      | ( ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ D )
       != ( in @ ( sk1 @ ( binunion @ C @ D ) @ B ) @ C ) )
      | ~ $true ),
    inference(eqfactor_ordered,[status(thm)],[226]) ).

thf(518,plain,
    ! [C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ C ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ C @ C ) @ B ) @ C )
      | A ),
    inference(pattern_uni,[status(thm)],[496:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( D ))]]) ).

thf(526,plain,
    ! [C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ C ) @ ( powerset @ B ) )
      | ( in @ ( sk1 @ ( binunion @ C @ C ) @ B ) @ C )
      | A ),
    inference(simp,[status(thm)],[518]) ).

thf(878,plain,
    ! [E: $i,D: $i,C: $i,B: $i,A: $o] :
      ( ( in @ ( binunion @ C @ C ) @ ( powerset @ B ) )
      | A
      | ( in @ E @ ( powerset @ D ) )
      | ( ( in @ ( sk1 @ ( binunion @ C @ C ) @ B ) @ C )
       != ( in @ ( sk1 @ E @ D ) @ D ) ) ),
    inference(paramod_ordered,[status(thm)],[526,12]) ).

thf(879,plain,
    ! [B: $i,A: $o] :
      ( ( in @ ( binunion @ B @ B ) @ ( powerset @ B ) )
      | A
      | ( in @ ( binunion @ B @ B ) @ ( powerset @ B ) ) ),
    inference(pattern_uni,[status(thm)],[878:[bind(A,$thf( A )),bind(B,$thf( G )),bind(C,$thf( G )),bind(D,$thf( G )),bind(E,$thf( binunion @ G @ G ))]]) ).

thf(948,plain,
    ! [B: $i,A: $o] :
      ( ( in @ ( binunion @ B @ B ) @ ( powerset @ B ) )
      | A ),
    inference(simp,[status(thm)],[879]) ).

thf(1617,plain,
    ! [B: $i,A: $o] :
      ( ( in @ ( binunion @ B @ B ) @ ( powerset @ B ) )
      | ( A
       != ( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[948,13]) ).

thf(1618,plain,
    ! [A: $i] : ( in @ ( binunion @ A @ A ) @ ( powerset @ A ) ),
    inference(pattern_uni,[status(thm)],[1617:[bind(A,$thf( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) )),bind(B,$thf( B ))]]) ).

thf(1710,plain,
    ! [A: $i] : ( in @ ( binunion @ A @ A ) @ ( powerset @ A ) ),
    inference(simp,[status(thm)],[1618]) ).

thf(30,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( in @ B @ ( powerset @ A ) )
      | ~ ( in @ C @ B )
      | ( ( in @ C @ A )
       != ( in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[19,13]) ).

thf(31,plain,
    ! [A: $i] :
      ( ~ ( in @ A @ ( powerset @ ( powerset @ sk2 ) ) )
      | ~ ( in @ ( binunion @ sk3 @ sk4 ) @ A ) ),
    inference(pattern_uni,[status(thm)],[30:[bind(A,$thf( powerset @ sk2 )),bind(B,$thf( B )),bind(C,$thf( binunion @ sk3 @ sk4 ))]]) ).

thf(46,plain,
    ! [A: $i] :
      ( ~ ( in @ A @ ( powerset @ ( powerset @ sk2 ) ) )
      | ~ ( in @ ( binunion @ sk3 @ sk4 ) @ A ) ),
    inference(simp,[status(thm)],[31]) ).

thf(1814,plain,
    ! [B: $i,A: $i] :
      ( ~ ( in @ ( binunion @ sk3 @ sk4 ) @ B )
      | ( ( in @ ( binunion @ A @ A ) @ ( powerset @ A ) )
       != ( in @ B @ ( powerset @ ( powerset @ sk2 ) ) ) ) ),
    inference(paramod_ordered,[status(thm)],[1710,46]) ).

thf(1815,plain,
    ~ ( in @ ( binunion @ sk3 @ sk4 ) @ ( binunion @ ( powerset @ sk2 ) @ ( powerset @ sk2 ) ) ),
    inference(pattern_uni,[status(thm)],[1814:[bind(A,$thf( powerset @ sk2 )),bind(B,$thf( binunion @ ( powerset @ sk2 ) @ ( powerset @ sk2 ) ))]]) ).

thf(99798,plain,
    ! [A: $o] :
      ( ( in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2 )
      | ( A
       != ( in @ ( binunion @ sk3 @ sk4 ) @ ( binunion @ ( powerset @ sk2 ) @ ( powerset @ sk2 ) ) ) ) ),
    inference(paramod_ordered,[status(thm)],[99727,1815]) ).

thf(99799,plain,
    in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2,
    inference(pattern_uni,[status(thm)],[99798:[bind(A,$thf( in @ ( binunion @ sk3 @ sk4 ) @ ( binunion @ ( powerset @ sk2 ) @ ( powerset @ sk2 ) ) ))]]) ).

thf(100407,plain,
    ! [B: $i,A: $i] :
      ( ( in @ B @ ( powerset @ A ) )
      | ( ( in @ ( sk1 @ ( binunion @ sk3 @ sk4 ) @ sk2 ) @ sk2 )
       != ( in @ ( sk1 @ B @ A ) @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[99799,12]) ).

thf(100408,plain,
    in @ ( binunion @ sk3 @ sk4 ) @ ( powerset @ sk2 ),
    inference(pattern_uni,[status(thm)],[100407:[bind(A,$thf( sk2 )),bind(B,$thf( binunion @ sk3 @ sk4 ))]]) ).

thf(100654,plain,
    $false,
    inference(rewrite,[status(thm)],[100408,13]) ).

thf(100655,plain,
    $false,
    inference(simp,[status(thm)],[100654]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU711^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n024.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.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Sun May 19 15:25:23 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 0.96/0.91  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.12/1.03  % [INFO] 	 Parsing done (120ms). 
% 1.33/1.04  % [INFO] 	 Running in sequential loop mode. 
% 1.68/1.29  % [INFO] 	 nitpick registered as external prover. 
% 1.68/1.29  % [INFO] 	 Scanning for conjecture ... 
% 1.86/1.36  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.00/1.38  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.00/1.39  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.00/1.39  % [INFO] 	 Type checking passed. 
% 2.00/1.39  % [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 ... 
% 165.87/30.52  % [INFO] 	 Killing All external provers ... 
% 165.87/30.52  % Time passed: 29980ms (effective reasoning time: 29475ms)
% 165.87/30.52  % 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)>
% 165.87/30.52  % Axioms used in derivation (0): 
% 165.87/30.52  % No. of inferences in proof: 53
% 165.87/30.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 29980 ms resp. 29475 ms w/o parsing
% 165.87/30.60  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 165.87/30.60  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------