%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : FLD023-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n003.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:06:54 EDT 2023

% Result   : Unsatisfiable 0.13s 0.41s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  10 unt;   0 def)
%            Number of atoms       :   72 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   71 (  36   ~;  32   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (;  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X] :
      ( equalish(add(X,additive_inverse(X)),additive_identity)
      | ~ defined(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,axiom,
    ! [X] :
      ( defined(additive_inverse(X))
      | ~ defined(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f22,axiom,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ equalish(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f23,axiom,
    ! [X,Z,Y] :
      ( equalish(X,Z)
      | ~ equalish(X,Y)
      | ~ equalish(Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f24,axiom,
    ! [X,Z,Y] :
      ( equalish(add(X,Z),add(Y,Z))
      | ~ defined(Z)
      | ~ equalish(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f28,hypothesis,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f30,negated_conjecture,
    equalish(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f31,negated_conjecture,
    ~ equalish(additive_identity,add(b,additive_inverse(a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f35,plain,
    ! [X0] :
      ( equalish(add(X0,additive_inverse(X0)),additive_identity)
      | ~ defined(X0) ),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f49,plain,
    ! [X0] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    inference(cnf_transformation,[status(esa)],[f12]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( equalish(X0,X1)
      | ~ equalish(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f22]) ).

fof(f65,plain,
    ! [Z,Y] :
      ( ! [X] :
          ( equalish(X,Z)
          | ~ equalish(X,Y) )
      | ~ equalish(Y,Z) ),
    inference(miniscoping,[status(esa)],[f23]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( equalish(X0,X1)
      | ~ equalish(X0,X2)
      | ~ equalish(X2,X1) ),
    inference(cnf_transformation,[status(esa)],[f65]) ).

fof(f67,plain,
    ! [X,Y] :
      ( ! [Z] :
          ( equalish(add(X,Z),add(Y,Z))
          | ~ defined(Z) )
      | ~ equalish(X,Y) ),
    inference(miniscoping,[status(esa)],[f24]) ).

fof(f68,plain,
    ! [X0,X1,X2] :
      ( equalish(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ equalish(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f67]) ).

fof(f74,plain,
    defined(a),
    inference(cnf_transformation,[status(esa)],[f28]) ).

fof(f76,plain,
    equalish(a,b),
    inference(cnf_transformation,[status(esa)],[f30]) ).

fof(f77,plain,
    ~ equalish(additive_identity,add(b,additive_inverse(a))),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f79,plain,
    ! [X0] :
      ( ~ equalish(additive_identity,X0)
      | ~ equalish(X0,add(b,additive_inverse(a))) ),
    inference(resolution,[status(thm)],[f66,f77]) ).

fof(f83,plain,
    ! [X0] :
      ( ~ equalish(X0,add(b,additive_inverse(a)))
      | ~ equalish(X0,additive_identity) ),
    inference(resolution,[status(thm)],[f79,f64]) ).

fof(f216,plain,
    ( spl0_16
  <=> defined(a) ),
    introduced(split_symbol_definition) ).

fof(f218,plain,
    ( ~ defined(a)
    | spl0_16 ),
    inference(component_clause,[status(thm)],[f216]) ).

fof(f318,plain,
    ( spl0_26
  <=> defined(additive_inverse(a)) ),
    introduced(split_symbol_definition) ).

fof(f320,plain,
    ( ~ defined(additive_inverse(a))
    | spl0_26 ),
    inference(component_clause,[status(thm)],[f318]) ).

fof(f348,plain,
    ! [X0] :
      ( ~ equalish(add(X0,additive_inverse(X0)),add(b,additive_inverse(a)))
      | ~ defined(X0) ),
    inference(resolution,[status(thm)],[f83,f35]) ).

fof(f353,plain,
    ( spl0_32
  <=> equalish(a,b) ),
    introduced(split_symbol_definition) ).

fof(f355,plain,
    ( ~ equalish(a,b)
    | spl0_32 ),
    inference(component_clause,[status(thm)],[f353]) ).

fof(f356,plain,
    ( ~ defined(a)
    | ~ defined(additive_inverse(a))
    | ~ equalish(a,b) ),
    inference(resolution,[status(thm)],[f348,f68]) ).

fof(f357,plain,
    ( ~ spl0_16
    | ~ spl0_26
    | ~ spl0_32 ),
    inference(split_clause,[status(thm)],[f356,f216,f318,f353]) ).

fof(f746,plain,
    ( ~ defined(a)
    | spl0_26 ),
    inference(resolution,[status(thm)],[f320,f49]) ).

fof(f747,plain,
    ( $false
    | spl0_26 ),
    inference(forward_subsumption_resolution,[status(thm)],[f746,f74]) ).

fof(f748,plain,
    spl0_26,
    inference(contradiction_clause,[status(thm)],[f747]) ).

fof(f749,plain,
    ( $false
    | spl0_32 ),
    inference(forward_subsumption_resolution,[status(thm)],[f355,f76]) ).

fof(f750,plain,
    spl0_32,
    inference(contradiction_clause,[status(thm)],[f749]) ).

fof(f751,plain,
    ( $false
    | spl0_16 ),
    inference(forward_subsumption_resolution,[status(thm)],[f218,f74]) ).

fof(f752,plain,
    spl0_16,
    inference(contradiction_clause,[status(thm)],[f751]) ).

fof(f753,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f357,f748,f750,f752]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : FLD023-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n003.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 : Tue May 30 11:03:23 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.41  % Refutation found
% 0.13/0.41  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.29/0.63  % Elapsed time: 0.070603 seconds
% 0.29/0.63  % CPU time: 0.175681 seconds
% 0.29/0.63  % Memory used: 5.108 MB
%------------------------------------------------------------------------------