%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:57 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 4 unt; 3 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 51 ( 27 ~; 21 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [P] :
( truth(isa(P,knave))
| truth(isa(P,knight)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [P,Q] :
( reply(P,Q,no)
| reply(P,Q,yes) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
! [R,X,Y] :
( ~ truth(isa(other,Y))
| ~ truth(isa(asked,X))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,plain,
! [X0] :
( truth(isa(X0,knave))
| truth(isa(X0,knight)) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f21,plain,
! [X0,X1] :
( reply(X0,X1,no)
| reply(X0,X1,yes) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f30,plain,
( ! [Y] : ~ truth(isa(other,Y))
| ! [X] : ~ truth(isa(asked,X))
| ! [R] : ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R) ),
inference(miniscoping,[status(thm)],[f14]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ~ truth(isa(other,X2))
| ~ truth(isa(asked,X1))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f32,definition,
! [X0] :
( sQ0_spl
<=> ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f33,plain,
! [X0] :
( ~ sQ0_spl
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
inference(component_clause,[status(thm)],[f32]) ).
fof(f35,definition,
! [X1] :
( sQ1_spl
<=> ~ truth(isa(asked,X1)) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f36,plain,
! [X0] :
( ~ sQ1_spl
| ~ truth(isa(asked,X0)) ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,definition,
! [X2] :
( sQ2_spl
<=> ~ truth(isa(other,X2)) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f39,plain,
! [X0] :
( ~ sQ2_spl
| ~ truth(isa(other,X0)) ),
inference(component_clause,[status(thm)],[f38]) ).
fof(f41,plain,
( sQ2_spl
| sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f31,f32,f35,f38]) ).
fof(f58,plain,
( ~ sQ1_spl
| truth(isa(asked,knight)) ),
inference(resolution,[status(thm)],[f15,f36]) ).
fof(f59,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f58,f36]) ).
fof(f60,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f59]) ).
fof(f62,plain,
( ~ sQ0_spl
| reply(asked,or(isa(asked,knight),isa(other,knight)),yes) ),
inference(resolution,[status(thm)],[f21,f33]) ).
fof(f63,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f62,f33]) ).
fof(f64,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f63]) ).
fof(f65,plain,
( ~ sQ2_spl
| truth(isa(other,knight)) ),
inference(resolution,[status(thm)],[f39,f15]) ).
fof(f66,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f65,f39]) ).
fof(f67,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f66]) ).
fof(f68,plain,
$false,
inference(sat_refutation,[status(thm)],[f41,f60,f64,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:49:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.09/0.40 % Refutation found
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.42 % Elapsed time: 0.045223 seconds
% 0.09/0.42 % CPU time: 0.122135 seconds
% 0.09/0.42 % Total memory used: 16.795 MB
% 0.09/0.42 % Net memory used: 16.361 MB
%------------------------------------------------------------------------------