%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : NUM531+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n009.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 Apr 30 20:35:02 EDT 2024

% Result   : Theorem 0.13s 0.35s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  10 unt;   0 def)
%            Number of atoms       :   47 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  16   ~;  10   |;   7   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    6 (   5   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    isFinite0(slcrc0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [W0] :
      ( ( aSet0(W0)
        & isCountable0(W0) )
     => ~ isFinite0(W0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,conjecture,
    ! [W0] :
      ( ( aSet0(W0)
        & isCountable0(W0) )
     => W0 != slcrc0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    ~ ! [W0] :
        ( ( aSet0(W0)
          & isCountable0(W0) )
       => W0 != slcrc0 ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f28,plain,
    isFinite0(slcrc0),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f31,plain,
    ! [W0] :
      ( ~ aSet0(W0)
      | ~ isCountable0(W0)
      | ~ isFinite0(W0) ),
    inference(pre_NNF_transformation,[status(esa)],[f8]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ aSet0(X0)
      | ~ isCountable0(X0)
      | ~ isFinite0(X0) ),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f33,plain,
    ? [W0] :
      ( aSet0(W0)
      & isCountable0(W0)
      & W0 = slcrc0 ),
    inference(pre_NNF_transformation,[status(esa)],[f10]) ).

fof(f34,plain,
    ( aSet0(sk0_1)
    & isCountable0(sk0_1)
    & sk0_1 = slcrc0 ),
    inference(skolemization,[status(esa)],[f33]) ).

fof(f35,plain,
    aSet0(sk0_1),
    inference(cnf_transformation,[status(esa)],[f34]) ).

fof(f36,plain,
    isCountable0(sk0_1),
    inference(cnf_transformation,[status(esa)],[f34]) ).

fof(f37,plain,
    sk0_1 = slcrc0,
    inference(cnf_transformation,[status(esa)],[f34]) ).

fof(f40,plain,
    isCountable0(slcrc0),
    inference(backward_demodulation,[status(thm)],[f37,f36]) ).

fof(f41,plain,
    aSet0(slcrc0),
    inference(backward_demodulation,[status(thm)],[f37,f35]) ).

fof(f42,plain,
    ( spl0_0
  <=> aSet0(slcrc0) ),
    introduced(split_symbol_definition) ).

fof(f44,plain,
    ( ~ aSet0(slcrc0)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f42]) ).

fof(f50,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f44,f41]) ).

fof(f51,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f50]) ).

fof(f52,plain,
    ( spl0_2
  <=> isCountable0(slcrc0) ),
    introduced(split_symbol_definition) ).

fof(f54,plain,
    ( ~ isCountable0(slcrc0)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f52]) ).

fof(f55,plain,
    ( ~ aSet0(slcrc0)
    | ~ isCountable0(slcrc0) ),
    inference(resolution,[status(thm)],[f28,f32]) ).

fof(f56,plain,
    ( ~ spl0_0
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f55,f42,f52]) ).

fof(f57,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f54,f40]) ).

fof(f58,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f57]) ).

fof(f59,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f51,f56,f58]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM531+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr 29 20:48:26 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 0.13/0.35  % Refutation found
% 0.13/0.35  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36  % Elapsed time: 0.017594 seconds
% 0.13/0.36  % CPU time: 0.018970 seconds
% 0.13/0.36  % Total memory used: 7.219 MB
% 0.13/0.36  % Net memory used: 7.126 MB
%------------------------------------------------------------------------------