TSTP Solution File: SEU294+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SEU294+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n002.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 : Wed May 31 12:36:36 EDT 2023

% Result   : Theorem 0.15s 0.54s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   5 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   44 (  17   ~;  12   |;  10   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   27 (;  23   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [A] :
      ( finite(A)
     => ! [B] :
          ( element(B,powerset(A))
         => finite(B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f40,conjecture,
    ! [A,B] :
      ( ( subset(A,B)
        & finite(B) )
     => finite(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f41,negated_conjecture,
    ~ ! [A,B] :
        ( ( subset(A,B)
          & finite(B) )
       => finite(A) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

fof(f44,axiom,
    ! [A,B] :
      ( element(A,powerset(B))
    <=> subset(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f70,plain,
    ! [A] :
      ( ~ finite(A)
      | ! [B] :
          ( ~ element(B,powerset(A))
          | finite(B) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f8]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ~ finite(X0)
      | ~ element(X1,powerset(X0))
      | finite(X1) ),
    inference(cnf_transformation,[status(esa)],[f70]) ).

fof(f178,plain,
    ? [A,B] :
      ( subset(A,B)
      & finite(B)
      & ~ finite(A) ),
    inference(pre_NNF_transformation,[status(esa)],[f41]) ).

fof(f179,plain,
    ? [A] :
      ( ? [B] :
          ( subset(A,B)
          & finite(B) )
      & ~ finite(A) ),
    inference(miniscoping,[status(esa)],[f178]) ).

fof(f180,plain,
    ( subset(sk0_19,sk0_20)
    & finite(sk0_20)
    & ~ finite(sk0_19) ),
    inference(skolemization,[status(esa)],[f179]) ).

fof(f181,plain,
    subset(sk0_19,sk0_20),
    inference(cnf_transformation,[status(esa)],[f180]) ).

fof(f182,plain,
    finite(sk0_20),
    inference(cnf_transformation,[status(esa)],[f180]) ).

fof(f183,plain,
    ~ finite(sk0_19),
    inference(cnf_transformation,[status(esa)],[f180]) ).

fof(f188,plain,
    ! [A,B] :
      ( ( ~ element(A,powerset(B))
        | subset(A,B) )
      & ( element(A,powerset(B))
        | ~ subset(A,B) ) ),
    inference(NNF_transformation,[status(esa)],[f44]) ).

fof(f189,plain,
    ( ! [A,B] :
        ( ~ element(A,powerset(B))
        | subset(A,B) )
    & ! [A,B] :
        ( element(A,powerset(B))
        | ~ subset(A,B) ) ),
    inference(miniscoping,[status(esa)],[f188]) ).

fof(f191,plain,
    ! [X0,X1] :
      ( element(X0,powerset(X1))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f189]) ).

fof(f206,plain,
    ! [X0,X1] :
      ( ~ finite(X0)
      | finite(X1)
      | ~ subset(X1,X0) ),
    inference(resolution,[status(thm)],[f71,f191]) ).

fof(f208,plain,
    ! [X0] :
      ( finite(X0)
      | ~ subset(X0,sk0_20) ),
    inference(resolution,[status(thm)],[f206,f182]) ).

fof(f209,plain,
    finite(sk0_19),
    inference(resolution,[status(thm)],[f208,f181]) ).

fof(f210,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f209,f183]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEU294+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31  % Computer : n002.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit : 300
% 0.09/0.31  % WCLimit  : 300
% 0.09/0.31  % DateTime : Tue May 30 09:31:28 EDT 2023
% 0.09/0.31  % CPUTime  : 
% 0.15/0.32  % Drodi V3.5.1
% 0.15/0.54  % Refutation found
% 0.15/0.54  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.54  % Elapsed time: 0.013891 seconds
% 0.15/0.54  % CPU time: 0.012456 seconds
% 0.15/0.54  % Memory used: 3.042 MB
%------------------------------------------------------------------------------