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

% Computer : n020.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:31:45 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ( ~ a_is_a_knight
    | ~ b_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ( ~ b_is_a_knight
    | c_is_a_knight
    | d_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ( ~ e_is_a_knight
    | ~ d_is_a_knight
    | c_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,axiom,
    ( a_is_a_knight
    | e_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f17,axiom,
    ( a_is_a_knight
    | ~ c_is_a_knight ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f18,negated_conjecture,
    b_is_a_knight,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f19,plain,
    ( ~ a_is_a_knight
    | ~ b_is_a_knight ),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f23,plain,
    ( ~ b_is_a_knight
    | c_is_a_knight
    | d_is_a_knight ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f28,plain,
    ( ~ e_is_a_knight
    | ~ d_is_a_knight
    | c_is_a_knight ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f34,plain,
    ( a_is_a_knight
    | e_is_a_knight ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f35,plain,
    ( a_is_a_knight
    | ~ c_is_a_knight ),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f36,plain,
    b_is_a_knight,
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f37,plain,
    ( spl0_0
  <=> a_is_a_knight ),
    introduced(split_symbol_definition) ).

fof(f40,plain,
    ( spl0_1
  <=> b_is_a_knight ),
    introduced(split_symbol_definition) ).

fof(f42,plain,
    ( ~ b_is_a_knight
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f40]) ).

fof(f43,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f19,f37,f40]) ).

fof(f44,plain,
    ( spl0_2
  <=> d_is_a_knight ),
    introduced(split_symbol_definition) ).

fof(f50,plain,
    ( spl0_3
  <=> c_is_a_knight ),
    introduced(split_symbol_definition) ).

fof(f53,plain,
    ( ~ spl0_1
    | spl0_3
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f23,f40,f50,f44]) ).

fof(f58,plain,
    ( spl0_4
  <=> e_is_a_knight ),
    introduced(split_symbol_definition) ).

fof(f61,plain,
    ( ~ spl0_4
    | ~ spl0_2
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f28,f58,f44,f50]) ).

fof(f67,plain,
    ( spl0_0
    | spl0_4 ),
    inference(split_clause,[status(thm)],[f34,f37,f58]) ).

fof(f68,plain,
    ( spl0_0
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f35,f37,f50]) ).

fof(f69,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f42,f36]) ).

fof(f70,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f69]) ).

fof(f71,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f43,f53,f61,f67,f68,f70]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n020.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 10:30:58 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.35  % Refutation found
% 0.13/0.35  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36  % Elapsed time: 0.018183 seconds
% 0.13/0.36  % CPU time: 0.023959 seconds
% 0.13/0.36  % Memory used: 1.658 MB
%------------------------------------------------------------------------------