%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n008.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:27 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 67 ( 18 unt; 10 def)
% Number of atoms : 140 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 128 ( 55 ~; 63 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 11 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X1] :
( in_array_bounds(array,X1)
| less_than(upper_bound,X1)
| less_than(X1,lower_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y] :
( less_than(X,Y)
| ~ less_than(successor(X),successor(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] :
( less_than(X,Z)
| ~ less_than(Y,Z)
| ~ less_than(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] : less_than(X,successor(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
( maximal_value != array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index))
| less_than(index_of_maximal,lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,an_index) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,plain,
! [X0] :
( in_array_bounds(array,X0)
| less_than(upper_bound,X0)
| less_than(X0,lower_bound) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( less_than(X0,X1)
| ~ less_than(successor(X0),successor(X1)) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f13,plain,
! [X,Z] :
( less_than(X,Z)
| ! [Y] :
( ~ less_than(Y,Z)
| ~ less_than(X,Y) ) ),
inference(miniscoping,[status(thm)],[f3]) ).
fof(f14,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X1,X2)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f15,plain,
! [X0] : less_than(X0,successor(X0)),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f16,plain,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f17,plain,
less_than(index_of_maximal,an_index),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f18,plain,
~ less_than(an_index,lower_bound),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f19,plain,
~ less_than(upper_bound,an_index),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f20,plain,
~ less_than(index_of_maximal,lower_bound),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f21,plain,
( maximal_value != array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index))
| less_than(index_of_maximal,lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,an_index) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f22,definition,
( sQ0_spl
<=> in_array_bounds(array,index_of_maximal) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f24,plain,
( sQ0_spl
| ~ in_array_bounds(array,index_of_maximal) ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,definition,
( sQ1_spl
<=> maximal_value = array_value_at(array,index_of_maximal) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f28,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f16,f22,f25]) ).
fof(f29,definition,
( sQ2_spl
<=> in_array_bounds(array,an_index) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f31,plain,
( sQ2_spl
| ~ in_array_bounds(array,an_index) ),
inference(component_clause,[status(thm)],[f29]) ).
fof(f32,definition,
( sQ3_spl
<=> less_than(successor(an_index),lower_bound) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f33,plain,
( ~ sQ3_spl
| less_than(successor(an_index),lower_bound) ),
inference(component_clause,[status(thm)],[f32]) ).
fof(f35,definition,
( sQ4_spl
<=> less_than(successor(upper_bound),successor(an_index)) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f36,plain,
( ~ sQ4_spl
| less_than(successor(upper_bound),successor(an_index)) ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,definition,
( sQ5_spl
<=> less_than(index_of_maximal,lower_bound) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f39,plain,
( ~ sQ5_spl
| less_than(index_of_maximal,lower_bound) ),
inference(component_clause,[status(thm)],[f38]) ).
fof(f41,definition,
( sQ6_spl
<=> less_than(index_of_maximal,successor(an_index)) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f43,plain,
( sQ6_spl
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(component_clause,[status(thm)],[f41]) ).
fof(f44,plain,
( ~ sQ1_spl
| ~ sQ0_spl
| ~ sQ6_spl
| sQ5_spl
| sQ4_spl
| sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f21,f29,f32,f35,f38,f41,f22,f25]) ).
fof(f45,plain,
( sQ0_spl
| less_than(upper_bound,index_of_maximal)
| less_than(index_of_maximal,lower_bound) ),
inference(resolution,[status(thm)],[f24,f11]) ).
fof(f46,definition,
( sQ7_spl
<=> less_than(upper_bound,index_of_maximal) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f47,plain,
( ~ sQ7_spl
| less_than(upper_bound,index_of_maximal) ),
inference(component_clause,[status(thm)],[f46]) ).
fof(f49,plain,
( sQ0_spl
| sQ7_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f45,f38,f46,f22]) ).
fof(f50,plain,
( ~ sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f39,f20]) ).
fof(f51,plain,
~ sQ5_spl,
inference(contradiction_clause,[status(thm)],[f50]) ).
fof(f54,plain,
! [X0] :
( less_than(X0,an_index)
| ~ less_than(X0,index_of_maximal) ),
inference(resolution,[status(thm)],[f14,f17]) ).
fof(f55,plain,
! [X0,X1] :
( less_than(X0,successor(X1))
| ~ less_than(X0,X1) ),
inference(resolution,[status(thm)],[f14,f15]) ).
fof(f56,plain,
( ~ sQ7_spl
| less_than(upper_bound,an_index) ),
inference(resolution,[status(thm)],[f54,f47]) ).
fof(f57,plain,
( ~ sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f19]) ).
fof(f58,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f57]) ).
fof(f59,plain,
less_than(index_of_maximal,successor(an_index)),
inference(resolution,[status(thm)],[f55,f17]) ).
fof(f61,plain,
( sQ6_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f59,f43]) ).
fof(f62,plain,
sQ6_spl,
inference(contradiction_clause,[status(thm)],[f61]) ).
fof(f68,plain,
( ~ sQ4_spl
| less_than(upper_bound,an_index) ),
inference(resolution,[status(thm)],[f36,f12]) ).
fof(f71,plain,
( ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f68,f19]) ).
fof(f72,plain,
~ sQ4_spl,
inference(contradiction_clause,[status(thm)],[f71]) ).
fof(f73,plain,
( sQ2_spl
| less_than(upper_bound,an_index)
| less_than(an_index,lower_bound) ),
inference(resolution,[status(thm)],[f31,f11]) ).
fof(f74,definition,
( sQ8_spl
<=> less_than(an_index,lower_bound) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f75,plain,
( ~ sQ8_spl
| less_than(an_index,lower_bound) ),
inference(component_clause,[status(thm)],[f74]) ).
fof(f77,definition,
( sQ9_spl
<=> less_than(upper_bound,an_index) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f78,plain,
( ~ sQ9_spl
| less_than(upper_bound,an_index) ),
inference(component_clause,[status(thm)],[f77]) ).
fof(f80,plain,
( sQ2_spl
| sQ9_spl
| sQ8_spl ),
inference(split_clause,[status(thm)],[f73,f74,f77,f29]) ).
fof(f81,plain,
( ~ sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f78,f19]) ).
fof(f82,plain,
~ sQ9_spl,
inference(contradiction_clause,[status(thm)],[f81]) ).
fof(f83,plain,
( ~ sQ8_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f75,f18]) ).
fof(f84,plain,
~ sQ8_spl,
inference(contradiction_clause,[status(thm)],[f83]) ).
fof(f85,plain,
( ~ sQ3_spl
| less_than(successor(an_index),successor(lower_bound)) ),
inference(resolution,[status(thm)],[f33,f55]) ).
fof(f87,plain,
( ~ sQ3_spl
| less_than(an_index,lower_bound) ),
inference(resolution,[status(thm)],[f85,f12]) ).
fof(f90,plain,
( ~ sQ3_spl
| sQ8_spl ),
inference(split_clause,[status(thm)],[f87,f74,f32]) ).
fof(f91,plain,
$false,
inference(sat_refutation,[status(thm)],[f28,f44,f49,f51,f58,f62,f72,f80,f82,f84,f90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36 % Computer : n008.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 08:28:23 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 % Drodi V4.1.1
% 0.12/0.40 % Refutation found
% 0.12/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42 % Elapsed time: 0.050558 seconds
% 0.12/0.42 % CPU time: 0.145236 seconds
% 0.12/0.42 % Total memory used: 65.142 MB
% 0.12/0.42 % Net memory used: 64.756 MB
%------------------------------------------------------------------------------