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

% Computer : n017.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:45:46 EDT 2023

% Result   : Theorem 0.16s 0.56s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (   1 unt;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   51 (  18   ~;  21   |;   3   &)
%                                         (   5 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    7 (   6 usr;   7 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (;   0   !;   0   ?)

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

fof(f2,axiom,
    ( r
   => ( p
      & q ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ( p
   => ( q
      | r ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,conjecture,
    ( p
  <=> q ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ ( p
    <=> q ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ( ~ q
    | r ),
    inference(pre_NNF_transformation,[status(esa)],[f1]) ).

fof(f7,plain,
    ( ~ q
    | r ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f8,plain,
    ( ~ r
    | ( p
      & q ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f9,plain,
    ( ~ r
    | p ),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f10,plain,
    ( ~ r
    | q ),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f11,plain,
    ( ~ p
    | q
    | r ),
    inference(pre_NNF_transformation,[status(esa)],[f3]) ).

fof(f12,plain,
    ( ~ p
    | q
    | r ),
    inference(cnf_transformation,[status(esa)],[f11]) ).

fof(f13,plain,
    ( p
  <~> q ),
    inference(pre_NNF_transformation,[status(esa)],[f5]) ).

fof(f14,plain,
    ( ( p
      | q )
    & ( ~ p
      | ~ q ) ),
    inference(NNF_transformation,[status(esa)],[f13]) ).

fof(f15,plain,
    ( p
    | q ),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f16,plain,
    ( ~ p
    | ~ q ),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f17,plain,
    ( spl0_0
  <=> q ),
    introduced(split_symbol_definition) ).

fof(f20,plain,
    ( spl0_1
  <=> r ),
    introduced(split_symbol_definition) ).

fof(f23,plain,
    ( ~ spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f7,f17,f20]) ).

fof(f24,plain,
    ( spl0_2
  <=> p ),
    introduced(split_symbol_definition) ).

fof(f27,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f9,f20,f24]) ).

fof(f28,plain,
    ( ~ spl0_1
    | spl0_0 ),
    inference(split_clause,[status(thm)],[f10,f20,f17]) ).

fof(f29,plain,
    ( ~ spl0_2
    | spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f12,f24,f17,f20]) ).

fof(f30,plain,
    ( spl0_2
    | spl0_0 ),
    inference(split_clause,[status(thm)],[f15,f24,f17]) ).

fof(f31,plain,
    ( ~ spl0_2
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f16,f24,f17]) ).

fof(f32,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f23,f27,f28,f29,f30,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN044+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33  % Computer : n017.cluster.edu
% 0.10/0.33  % Model    : x86_64 x86_64
% 0.10/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33  % Memory   : 8042.1875MB
% 0.10/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33  % CPULimit : 300
% 0.10/0.33  % WCLimit  : 300
% 0.10/0.33  % DateTime : Tue May 30 09:54:40 EDT 2023
% 0.10/0.33  % CPUTime  : 
% 0.10/0.33  % Drodi V3.5.1
% 0.16/0.56  % Refutation found
% 0.16/0.56  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.56  % Elapsed time: 0.009568 seconds
% 0.16/0.56  % CPU time: 0.008491 seconds
% 0.16/0.56  % Memory used: 464.926 KB
%------------------------------------------------------------------------------