%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : PUZ132+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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 02:00:09 PM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 11 unt; 3 def)
% Number of atoms : 57 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 40 ( 17 ~; 15 |; 2 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 9 ( 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A] :
( capital(A)
=> city(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
capital(washington),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
country(usa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X] :
( city(X)
=> has_crime(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X] :
( country(X)
=> beautiful(capital_city(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,conjecture,
( has_crime(washington)
& beautiful(washington) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
~ ( has_crime(washington)
& beautiful(washington) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f17,plain,
! [A] :
( city(A)
| ~ capital(A) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f18,plain,
! [X0] :
( city(X0)
| ~ capital(X0) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f21,plain,
capital(washington),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f22,plain,
country(usa),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f25,plain,
! [X] :
( has_crime(X)
| ~ city(X) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f26,plain,
! [X0] :
( has_crime(X0)
| ~ city(X0) ),
inference(cnf_transformation,[status(thm)],[f25]) ).
fof(f27,plain,
capital_city(usa) = washington,
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f28,plain,
! [X] :
( beautiful(capital_city(X))
| ~ country(X) ),
inference(pre_NNF_transformation,[status(thm)],[f10]) ).
fof(f29,plain,
! [X0] :
( beautiful(capital_city(X0))
| ~ country(X0) ),
inference(cnf_transformation,[status(thm)],[f28]) ).
fof(f30,plain,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(pre_NNF_transformation,[status(thm)],[f12]) ).
fof(f31,plain,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f32,definition,
( sQ0_spl
<=> beautiful(washington) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f35,definition,
( sQ1_spl
<=> has_crime(washington) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f37,plain,
( sQ1_spl
| ~ has_crime(washington) ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,plain,
( ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f31,f32,f35]) ).
fof(f39,plain,
city(washington),
inference(resolution,[status(thm)],[f18,f21]) ).
fof(f42,plain,
has_crime(washington),
inference(resolution,[status(thm)],[f26,f39]) ).
fof(f46,definition,
( sQ2_spl
<=> country(usa) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f48,plain,
( sQ2_spl
| ~ country(usa) ),
inference(component_clause,[status(thm)],[f46]) ).
fof(f53,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f48,f22]) ).
fof(f54,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f53]) ).
fof(f55,plain,
( beautiful(washington)
| ~ country(usa) ),
inference(paramodulation,[status(thm)],[f27,f29]) ).
fof(f56,plain,
( sQ0_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f55,f46,f32]) ).
fof(f57,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f37,f42]) ).
fof(f58,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f57]) ).
fof(f59,plain,
$false,
inference(sat_refutation,[status(thm)],[f38,f54,f56,f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ132+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n019.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 03:52:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Drodi V4.1.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41 % Elapsed time: 0.054049 seconds
% 0.13/0.41 % CPU time: 0.164812 seconds
% 0.13/0.41 % Total memory used: 66.299 MB
% 0.13/0.41 % Net memory used: 65.794 MB
%------------------------------------------------------------------------------