%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : HWV014-1 : TPTP v8.1.2. Released v2.5.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:12:56 EDT 2023

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  17 unt;   0 def)
%            Number of atoms       :   76 (  13 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   69 (  30   ~;  35   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :    7 (;   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,axiom,
    ! [X_t_32] : level(X_t_32) = int_level(X_t_32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f71,axiom,
    ! [X_t_42] :
      ( p_Reset(X_t_42)
      | p_Wr(X_t_42)
      | ~ p_Rd(X_t_42)
      | ~ gt(int_level(X_t_42),n0)
      | int_level(plus(X_t_42,n1)) = minus(int_level(X_t_42),n1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f91,negated_conjecture,
    gt(level(x_139),n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f92,negated_conjecture,
    p_Rd(x_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f93,negated_conjecture,
    ~ p_Wr(x_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f94,negated_conjecture,
    ~ p_Reset(x_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f95,negated_conjecture,
    level(plus(x_139,n1)) != minus(level(x_139),n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f119,plain,
    ! [X0] : level(X0) = int_level(X0),
    inference(cnf_transformation,[status(esa)],[f21]) ).

fof(f171,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0)
      | int_level(plus(X0,n1)) = minus(int_level(X0),n1) ),
    inference(cnf_transformation,[status(esa)],[f71]) ).

fof(f191,plain,
    gt(level(x_139),n0),
    inference(cnf_transformation,[status(esa)],[f91]) ).

fof(f192,plain,
    p_Rd(x_139),
    inference(cnf_transformation,[status(esa)],[f92]) ).

fof(f193,plain,
    ~ p_Wr(x_139),
    inference(cnf_transformation,[status(esa)],[f93]) ).

fof(f194,plain,
    ~ p_Reset(x_139),
    inference(cnf_transformation,[status(esa)],[f94]) ).

fof(f195,plain,
    level(plus(x_139,n1)) != minus(level(x_139),n1),
    inference(cnf_transformation,[status(esa)],[f95]) ).

fof(f255,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(level(X0),n0)
      | int_level(plus(X0,n1)) = minus(int_level(X0),n1) ),
    inference(forward_demodulation,[status(thm)],[f119,f171]) ).

fof(f256,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(level(X0),n0)
      | level(plus(X0,n1)) = minus(int_level(X0),n1) ),
    inference(forward_demodulation,[status(thm)],[f119,f255]) ).

fof(f257,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(level(X0),n0)
      | level(plus(X0,n1)) = minus(level(X0),n1) ),
    inference(forward_demodulation,[status(thm)],[f119,f256]) ).

fof(f324,plain,
    ( spl0_0
  <=> p_Reset(x_139) ),
    introduced(split_symbol_definition) ).

fof(f325,plain,
    ( p_Reset(x_139)
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f324]) ).

fof(f339,plain,
    ( spl0_3
  <=> p_Rd(x_139) ),
    introduced(split_symbol_definition) ).

fof(f341,plain,
    ( ~ p_Rd(x_139)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f339]) ).

fof(f356,plain,
    ( $false
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f325,f194]) ).

fof(f357,plain,
    ~ spl0_0,
    inference(contradiction_clause,[status(thm)],[f356]) ).

fof(f468,plain,
    ( spl0_10
  <=> p_Wr(x_139) ),
    introduced(split_symbol_definition) ).

fof(f469,plain,
    ( p_Wr(x_139)
    | ~ spl0_10 ),
    inference(component_clause,[status(thm)],[f468]) ).

fof(f598,plain,
    ( spl0_30
  <=> level(plus(x_139,n1)) = minus(level(x_139),n1) ),
    introduced(split_symbol_definition) ).

fof(f599,plain,
    ( level(plus(x_139,n1)) = minus(level(x_139),n1)
    | ~ spl0_30 ),
    inference(component_clause,[status(thm)],[f598]) ).

fof(f601,plain,
    ( p_Reset(x_139)
    | p_Wr(x_139)
    | ~ p_Rd(x_139)
    | level(plus(x_139,n1)) = minus(level(x_139),n1) ),
    inference(resolution,[status(thm)],[f257,f191]) ).

fof(f602,plain,
    ( spl0_0
    | spl0_10
    | ~ spl0_3
    | spl0_30 ),
    inference(split_clause,[status(thm)],[f601,f324,f468,f339,f598]) ).

fof(f626,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f341,f192]) ).

fof(f627,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f626]) ).

fof(f634,plain,
    ( minus(level(x_139),n1) != minus(level(x_139),n1)
    | ~ spl0_30 ),
    inference(forward_demodulation,[status(thm)],[f599,f195]) ).

fof(f635,plain,
    ( $false
    | ~ spl0_30 ),
    inference(trivial_equality_resolution,[status(esa)],[f634]) ).

fof(f636,plain,
    ~ spl0_30,
    inference(contradiction_clause,[status(thm)],[f635]) ).

fof(f637,plain,
    ( $false
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f469,f193]) ).

fof(f638,plain,
    ~ spl0_10,
    inference(contradiction_clause,[status(thm)],[f637]) ).

fof(f639,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f357,f602,f627,f636,f638]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : HWV014-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34  % Computer : n002.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue May 30 12:06:30 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.5.1
% 0.19/0.49  % Refutation found
% 0.19/0.49  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.49  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.50  % Elapsed time: 0.159359 seconds
% 0.19/0.50  % CPU time: 1.125597 seconds
% 0.19/0.50  % Memory used: 66.989 MB
%------------------------------------------------------------------------------