%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : PUZ009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:59:50 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 4 unt; 5 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,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
( d_is_a_knight
| c_is_a_knight
| ~ b_is_a_knight ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
( e_is_a_knight
| a_is_a_knight ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
( ~ c_is_a_knight
| a_is_a_knight ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
b_is_a_knight,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,plain,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f23,plain,
( d_is_a_knight
| c_is_a_knight
| ~ b_is_a_knight ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f28,plain,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f34,plain,
( e_is_a_knight
| a_is_a_knight ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f35,plain,
( ~ c_is_a_knight
| a_is_a_knight ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f36,plain,
b_is_a_knight,
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f37,definition,
( sQ0_spl
<=> a_is_a_knight ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f40,definition,
( sQ1_spl
<=> b_is_a_knight ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f42,plain,
( sQ1_spl
| ~ b_is_a_knight ),
inference(component_clause,[status(thm)],[f40]) ).
fof(f43,plain,
( ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f19,f37,f40]) ).
fof(f44,definition,
( sQ2_spl
<=> d_is_a_knight ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f50,definition,
( sQ3_spl
<=> c_is_a_knight ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f53,plain,
( sQ2_spl
| sQ3_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f23,f40,f50,f44]) ).
fof(f58,definition,
( sQ4_spl
<=> e_is_a_knight ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f61,plain,
( sQ3_spl
| ~ sQ2_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f28,f58,f44,f50]) ).
fof(f67,plain,
( sQ4_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f34,f37,f58]) ).
fof(f68,plain,
( ~ sQ3_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f35,f37,f50]) ).
fof(f69,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f42,f36]) ).
fof(f70,plain,
sQ1_spl,
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.00/0.03 % Problem : PUZ009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n013.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 03:44:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.12/0.39 % Refutation found
% 0.12/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42 % Elapsed time: 0.047538 seconds
% 0.12/0.42 % CPU time: 0.111310 seconds
% 0.12/0.42 % Total memory used: 16.657 MB
% 0.12/0.42 % Net memory used: 16.233 MB
%------------------------------------------------------------------------------