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

% Computer : n001.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:15:25 EDT 2023

% Result   : Theorem 0.16s 0.36s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   39 (  24 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   32 (  13   ~;  12   |;   2   &)
%                                         (   4 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (;   7   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [A] : addition(A,A) = A,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,conjecture,
    ( ! [X0] : addition(X0,X0) = X0
  <=> addition(one,one) = one ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f14,negated_conjecture,
    ~ ( ! [X0] : addition(X0,X0) = X0
    <=> addition(one,one) = one ),
    inference(negated_conjecture,[status(cth)],[f13]) ).

fof(f18,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f30,plain,
    ( ! [X0] : addition(X0,X0) = X0
  <~> addition(one,one) = one ),
    inference(pre_NNF_transformation,[status(esa)],[f14]) ).

fof(f31,plain,
    ( ( ! [X0] : addition(X0,X0) = X0
      | addition(one,one) = one )
    & ( ? [X0] : addition(X0,X0) != X0
      | addition(one,one) != one ) ),
    inference(NNF_transformation,[status(esa)],[f30]) ).

fof(f32,plain,
    ( ( ! [X0] : addition(X0,X0) = X0
      | addition(one,one) = one )
    & ( addition(sk0_0,sk0_0) != sk0_0
      | addition(one,one) != one ) ),
    inference(skolemization,[status(esa)],[f31]) ).

fof(f34,plain,
    ( addition(sk0_0,sk0_0) != sk0_0
    | addition(one,one) != one ),
    inference(cnf_transformation,[status(esa)],[f32]) ).

fof(f38,plain,
    ( spl0_1
  <=> addition(one,one) = one ),
    introduced(split_symbol_definition) ).

fof(f40,plain,
    ( addition(one,one) != one
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f38]) ).

fof(f42,plain,
    ( spl0_2
  <=> addition(sk0_0,sk0_0) = sk0_0 ),
    introduced(split_symbol_definition) ).

fof(f44,plain,
    ( addition(sk0_0,sk0_0) != sk0_0
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f42]) ).

fof(f45,plain,
    ( ~ spl0_2
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f34,f42,f38]) ).

fof(f419,plain,
    ( sk0_0 != sk0_0
    | spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f18,f44]) ).

fof(f420,plain,
    ( $false
    | spl0_2 ),
    inference(trivial_equality_resolution,[status(esa)],[f419]) ).

fof(f421,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f420]) ).

fof(f422,plain,
    ( one != one
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f18,f40]) ).

fof(f423,plain,
    ( $false
    | spl0_1 ),
    inference(trivial_equality_resolution,[status(esa)],[f422]) ).

fof(f424,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f423]) ).

fof(f425,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f45,f421,f424]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : KLE003+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n001.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31  % CPULimit : 300
% 0.16/0.31  % WCLimit  : 300
% 0.16/0.31  % DateTime : Tue May 30 12:18:15 EDT 2023
% 0.16/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.5.1
% 0.16/0.36  % Refutation found
% 0.16/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.58  % Elapsed time: 0.042574 seconds
% 0.17/0.58  % CPU time: 0.025007 seconds
% 0.17/0.58  % Memory used: 3.864 MB
%------------------------------------------------------------------------------