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

View Problem - Process Solution

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

% Computer : n014.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:42:26 EDT 2024

% Result   : Theorem 3.21s 1.79s
% Output   : Refutation 3.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (   9 unt;   6 typ;   1 def)
%            Number of atoms       :   50 (   7 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  115 (  10   ~;   4   |;   0   &;  86   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^  28   !;   0   ?;  28   :)

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

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

thf(powersetAx_type,type,
    powersetAx: $o ).

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

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

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

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

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

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

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

thf(6,plain,
    ! [B: $i,A: $i] :
      ( ( in @ B @ ( powerset @ A ) )
      = ( ! [C: $i] :
            ( ( in @ C @ B )
           => ( in @ C @ A ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(8,plain,
    ! [B: $i,A: $i] :
      ( ( in @ B @ ( powerset @ A ) )
      = ( ! [C: $i] :
            ( ( in @ C @ B )
           => ( in @ C @ A ) ) ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(4,plain,
    ~ ( in @ sk2 @ ( powerset @ sk1 ) ),
    inference(cnf,[status(esa)],[3]) ).

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

thf(12,plain,
    ~ ! [A: $i] :
        ( ( in @ A @ sk2 )
       => ( in @ A @ sk1 ) ),
    inference(pattern_uni,[status(thm)],[11:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).

thf(17,plain,
    in @ sk4 @ sk2,
    inference(cnf,[status(esa)],[12]) ).

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

thf(7,plain,
    ! [A: $i] :
      ( ~ ( in @ A @ sk2 )
      | ( in @ A @ sk1 ) ),
    inference(simp,[status(thm)],[5]) ).

thf(58,plain,
    ! [A: $i] :
      ( ( in @ A @ sk1 )
      | ( ( in @ sk4 @ sk2 )
       != ( in @ A @ sk2 ) ) ),
    inference(paramod_ordered,[status(thm)],[17,7]) ).

thf(59,plain,
    in @ sk4 @ sk1,
    inference(pattern_uni,[status(thm)],[58:[bind(A,$thf( sk4 ))]]) ).

thf(16,plain,
    ~ ( in @ sk4 @ sk1 ),
    inference(cnf,[status(esa)],[12]) ).

thf(66,plain,
    $false,
    inference(rewrite,[status(thm)],[59,16]) ).

thf(67,plain,
    $false,
    inference(simp,[status(thm)],[66]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU518^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.14  % Command  : run_Leo-III %s %d
% 0.14/0.34  % Computer : n014.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Sun May 19 17:29:24 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.94/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.94  % [INFO] 	 Parsing done (94ms). 
% 1.16/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.60/1.20  % [INFO] 	 nitpick registered as external prover. 
% 1.60/1.21  % [INFO] 	 Scanning for conjecture ... 
% 1.77/1.28  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.77/1.30  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.77/1.30  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.77/1.30  % [INFO] 	 Type checking passed. 
% 1.77/1.30  % [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.21/1.78  % [INFO] 	 Killing All external provers ... 
% 3.21/1.79  % Time passed: 1280ms (effective reasoning time: 830ms)
% 3.21/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.21/1.79  % Axioms used in derivation (0): 
% 3.21/1.79  % No. of inferences in proof: 16
% 3.21/1.79  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1280 ms resp. 830 ms w/o parsing
% 3.23/1.81  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.23/1.82  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------