%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV005-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:46:25 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.39s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 12 unt; 4 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 21 ~; 22 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 4 ( 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,negated_conjecture,
~ less_than(n,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
~ less_than(k,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
less_than(a(k),a(predecessor(l))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
! [X] :
( ~ less_than(a(X),a(predecessor(l)))
| ~ less_than(one,l)
| less_than(n,X)
| less_than(X,l) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f37,plain,
~ less_than(n,k),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f38,plain,
~ less_than(k,l),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f41,plain,
less_than(one,l),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f42,plain,
less_than(a(k),a(predecessor(l))),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f44,plain,
! [X0] :
( ~ less_than(a(X0),a(predecessor(l)))
| ~ less_than(one,l)
| less_than(n,X0)
| less_than(X0,l) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f46,definition,
! [X0] :
( sQ0_spl
<=> ( ~ less_than(a(X0),a(predecessor(l)))
| less_than(n,X0)
| less_than(X0,l) ) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f47,plain,
! [X0] :
( ~ sQ0_spl
| ~ less_than(a(X0),a(predecessor(l)))
| less_than(n,X0)
| less_than(X0,l) ),
inference(component_clause,[status(thm)],[f46]) ).
fof(f49,definition,
( sQ1_spl
<=> less_than(one,l) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f51,plain,
( sQ1_spl
| ~ less_than(one,l) ),
inference(component_clause,[status(thm)],[f49]) ).
fof(f52,plain,
( ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f44,f46,f49]) ).
fof(f68,plain,
( ~ sQ0_spl
| ~ less_than(a(k),a(predecessor(l)))
| less_than(n,k) ),
inference(resolution,[status(thm)],[f47,f38]) ).
fof(f74,definition,
( sQ2_spl
<=> less_than(n,k) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f75,plain,
( ~ sQ2_spl
| less_than(n,k) ),
inference(component_clause,[status(thm)],[f74]) ).
fof(f77,definition,
( sQ3_spl
<=> less_than(a(k),a(predecessor(l))) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f79,plain,
( sQ3_spl
| ~ less_than(a(k),a(predecessor(l))) ),
inference(component_clause,[status(thm)],[f77]) ).
fof(f80,plain,
( ~ sQ0_spl
| ~ sQ3_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f68,f74,f77,f46]) ).
fof(f90,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f75,f37]) ).
fof(f91,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f90]) ).
fof(f92,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f79,f42]) ).
fof(f93,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f92]) ).
fof(f94,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f51,f41]) ).
fof(f95,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f94]) ).
fof(f96,plain,
$false,
inference(sat_refutation,[status(thm)],[f52,f80,f91,f93,f95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n011.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 21 08:26:26 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.36 % Drodi V4.1.1
% 0.07/0.39 % Refutation found
% 0.07/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.07/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.42 % Elapsed time: 0.064794 seconds
% 0.15/0.42 % CPU time: 0.168638 seconds
% 0.15/0.42 % Total memory used: 66.898 MB
% 0.15/0.42 % Net memory used: 66.672 MB
%------------------------------------------------------------------------------