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

% Computer : n015.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:52:06 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( p
  <=> p ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( p
    <=> p ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( p
  <~> p ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( ( p
      | p )
    & ( ~ p
      | ~ p ) ),
    inference(NNF_transformation,[status(esa)],[f3]) ).

fof(f5,plain,
    ( p
    | p ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f6,plain,
    ( ~ p
    | ~ p ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f7,plain,
    ( spl0_0
  <=> p ),
    introduced(split_symbol_definition) ).

fof(f10,plain,
    spl0_0,
    inference(split_clause,[status(thm)],[f5,f7]) ).

fof(f11,plain,
    ~ spl0_0,
    inference(split_clause,[status(thm)],[f6,f7]) ).

fof(f12,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f10,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN390+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 22:18:47 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39  % Elapsed time: 0.023612 seconds
% 0.13/0.39  % CPU time: 0.016592 seconds
% 0.13/0.39  % Total memory used: 532.480 KB
% 0.13/0.39  % Net memory used: 477.344 KB
%------------------------------------------------------------------------------