%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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:49:57 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45 % Computer : n006.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 08:27:27 UTC 2026
% 0.17/0.46 % CPUTime :
% 0.17/0.49 % Drodi V4.1.1
% 0.17/0.50 % Refutation found
% 0.17/0.50 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.50 % SZS output start CNFRefutation for theBenchmark
% 0.17/0.50 fof(f1,axiom,(
% 0.17/0.50 (![X1]: (( less_than(X1,lower_bound)| less_than(upper_bound,X1)| in_array_bounds(array,X1) ) ))),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f2,axiom,(
% 0.17/0.50 (![X,Y]: (( ~ less_than(successor(X),successor(Y))| less_than(X,Y) ) ))),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f3,axiom,(
% 0.17/0.50 (![X,Y,Z]: (( ~ less_than(X,Y)| ~ less_than(Y,Z)| less_than(X,Z) ) ))),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f4,axiom,(
% 0.17/0.50 (![X]: (less_than(X,successor(X)) ))),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f5,axiom,(
% 0.17/0.50 ( ~ in_array_bounds(array,index_of_maximal)| maximal_value = array_value_at(array,index_of_maximal) ) ),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f6,axiom,(
% 0.17/0.50 less_than(index_of_maximal,an_index) ),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f7,axiom,(
% 0.17/0.50 ~ less_than(an_index,lower_bound) ),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f8,axiom,(
% 0.17/0.50 ~ less_than(upper_bound,an_index) ),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f9,axiom,(
% 0.17/0.50 ~ less_than(index_of_maximal,lower_bound) ),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f10,negated_conjecture,(
% 0.17/0.50 ( ~ in_array_bounds(array,an_index)| less_than(successor(an_index),lower_bound)| less_than(successor(upper_bound),successor(an_index))| less_than(index_of_maximal,lower_bound)| ~ less_than(index_of_maximal,successor(an_index))| ~ in_array_bounds(array,index_of_maximal)| maximal_value != array_value_at(array,index_of_maximal) ) ),
% 0.17/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.50 fof(f11,plain,(
% 0.17/0.50 ![X0]: (less_than(X0,lower_bound)|less_than(upper_bound,X0)|in_array_bounds(array,X0))),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f1])).
% 0.17/0.50 fof(f12,plain,(
% 0.17/0.50 ![X0,X1]: (~less_than(successor(X0),successor(X1))|less_than(X0,X1))),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f2])).
% 0.17/0.50 fof(f13,plain,(
% 0.17/0.50 ![X,Z]: ((![Y]: (~less_than(X,Y)|~less_than(Y,Z)))|less_than(X,Z))),
% 0.17/0.50 inference(miniscoping,[status(thm)],[f3])).
% 0.17/0.50 fof(f14,plain,(
% 0.17/0.50 ![X0,X1,X2]: (~less_than(X0,X1)|~less_than(X1,X2)|less_than(X0,X2))),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f13])).
% 0.17/0.50 fof(f15,plain,(
% 0.17/0.50 ![X0]: (less_than(X0,successor(X0)))),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f4])).
% 0.17/0.50 fof(f16,plain,(
% 0.17/0.50 ~in_array_bounds(array,index_of_maximal)|maximal_value=array_value_at(array,index_of_maximal)),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f5])).
% 0.17/0.50 fof(f17,plain,(
% 0.17/0.50 less_than(index_of_maximal,an_index)),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f6])).
% 0.17/0.50 fof(f18,plain,(
% 0.17/0.50 ~less_than(an_index,lower_bound)),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f7])).
% 0.17/0.50 fof(f19,plain,(
% 0.17/0.50 ~less_than(upper_bound,an_index)),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f8])).
% 0.17/0.50 fof(f20,plain,(
% 0.17/0.50 ~less_than(index_of_maximal,lower_bound)),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f9])).
% 0.17/0.50 fof(f21,plain,(
% 0.17/0.50 ~in_array_bounds(array,an_index)|less_than(successor(an_index),lower_bound)|less_than(successor(upper_bound),successor(an_index))|less_than(index_of_maximal,lower_bound)|~less_than(index_of_maximal,successor(an_index))|~in_array_bounds(array,index_of_maximal)|~maximal_value=array_value_at(array,index_of_maximal)),
% 0.17/0.50 inference(cnf_transformation,[status(thm)],[f10])).
% 0.17/0.50 fof(f22,definition,(
% 0.17/0.50 sQ0_spl <=> (in_array_bounds(array,index_of_maximal))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f24,plain,(
% 0.17/0.50 ~in_array_bounds(array,index_of_maximal)|sQ0_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f22])).
% 0.17/0.50 fof(f25,definition,(
% 0.17/0.50 sQ1_spl <=> (maximal_value=array_value_at(array,index_of_maximal))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f28,plain,(
% 0.17/0.50 ~sQ0_spl|sQ1_spl),
% 0.17/0.50 inference(split_clause,[status(thm)],[f16,f22,f25])).
% 0.17/0.50 fof(f29,definition,(
% 0.17/0.50 sQ2_spl <=> (in_array_bounds(array,an_index))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f31,plain,(
% 0.17/0.50 ~in_array_bounds(array,an_index)|sQ2_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f29])).
% 0.17/0.50 fof(f32,definition,(
% 0.17/0.50 sQ3_spl <=> (less_than(successor(an_index),lower_bound))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f33,plain,(
% 0.17/0.50 less_than(successor(an_index),lower_bound)|~sQ3_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f32])).
% 0.17/0.50 fof(f35,definition,(
% 0.17/0.50 sQ4_spl <=> (less_than(successor(upper_bound),successor(an_index)))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f36,plain,(
% 0.17/0.50 less_than(successor(upper_bound),successor(an_index))|~sQ4_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f35])).
% 0.17/0.50 fof(f38,definition,(
% 0.17/0.50 sQ5_spl <=> (less_than(index_of_maximal,lower_bound))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f39,plain,(
% 0.17/0.50 less_than(index_of_maximal,lower_bound)|~sQ5_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f38])).
% 0.17/0.50 fof(f41,definition,(
% 0.17/0.50 sQ6_spl <=> (less_than(index_of_maximal,successor(an_index)))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f43,plain,(
% 0.17/0.50 ~less_than(index_of_maximal,successor(an_index))|sQ6_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f41])).
% 0.17/0.50 fof(f44,plain,(
% 0.17/0.50 ~sQ2_spl|sQ3_spl|sQ4_spl|sQ5_spl|~sQ6_spl|~sQ0_spl|~sQ1_spl),
% 0.17/0.50 inference(split_clause,[status(thm)],[f21,f29,f32,f35,f38,f41,f22,f25])).
% 0.17/0.50 fof(f46,plain,(
% 0.17/0.50 ![X0]: (~less_than(X0,index_of_maximal)|less_than(X0,an_index))),
% 0.17/0.50 inference(resolution,[status(thm)],[f14,f17])).
% 0.17/0.50 fof(f47,plain,(
% 0.17/0.50 ![X0,X1]: (~less_than(X0,X1)|less_than(X0,successor(X1)))),
% 0.17/0.50 inference(resolution,[status(thm)],[f14,f15])).
% 0.17/0.50 fof(f49,plain,(
% 0.17/0.50 ![X0]: (~less_than(an_index,X0)|~less_than(X0,lower_bound))),
% 0.17/0.50 inference(resolution,[status(thm)],[f14,f18])).
% 0.17/0.50 fof(f55,plain,(
% 0.17/0.50 less_than(index_of_maximal,successor(an_index))),
% 0.17/0.50 inference(resolution,[status(thm)],[f47,f17])).
% 0.17/0.50 fof(f65,plain,(
% 0.17/0.50 ~less_than(successor(an_index),lower_bound)),
% 0.17/0.50 inference(resolution,[status(thm)],[f49,f15])).
% 0.17/0.50 fof(f67,plain,(
% 0.17/0.50 less_than(index_of_maximal,lower_bound)|less_than(upper_bound,index_of_maximal)|sQ0_spl),
% 0.17/0.50 inference(resolution,[status(thm)],[f11,f24])).
% 0.17/0.50 fof(f68,definition,(
% 0.17/0.50 sQ7_spl <=> (less_than(upper_bound,index_of_maximal))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f69,plain,(
% 0.17/0.50 less_than(upper_bound,index_of_maximal)|~sQ7_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f68])).
% 0.17/0.50 fof(f71,plain,(
% 0.17/0.50 sQ5_spl|sQ7_spl|sQ0_spl),
% 0.17/0.50 inference(split_clause,[status(thm)],[f67,f38,f68,f22])).
% 0.17/0.50 fof(f72,plain,(
% 0.17/0.50 $false|~sQ5_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f39,f20])).
% 0.17/0.50 fof(f73,plain,(
% 0.17/0.50 ~sQ5_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f72])).
% 0.17/0.50 fof(f74,plain,(
% 0.17/0.50 less_than(upper_bound,an_index)|~sQ7_spl),
% 0.17/0.50 inference(resolution,[status(thm)],[f69,f46])).
% 0.17/0.50 fof(f79,plain,(
% 0.17/0.50 $false|~sQ7_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f74,f19])).
% 0.17/0.50 fof(f80,plain,(
% 0.17/0.50 ~sQ7_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f79])).
% 0.17/0.50 fof(f81,plain,(
% 0.17/0.50 $false|sQ6_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f43,f55])).
% 0.17/0.50 fof(f82,plain,(
% 0.17/0.50 sQ6_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f81])).
% 0.17/0.50 fof(f83,plain,(
% 0.17/0.50 less_than(upper_bound,an_index)|~sQ4_spl),
% 0.17/0.50 inference(resolution,[status(thm)],[f36,f12])).
% 0.17/0.50 fof(f88,plain,(
% 0.17/0.50 $false|~sQ4_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f83,f19])).
% 0.17/0.50 fof(f89,plain,(
% 0.17/0.50 ~sQ4_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f88])).
% 0.17/0.50 fof(f90,plain,(
% 0.17/0.50 less_than(an_index,lower_bound)|less_than(upper_bound,an_index)|sQ2_spl),
% 0.17/0.50 inference(resolution,[status(thm)],[f31,f11])).
% 0.17/0.50 fof(f91,definition,(
% 0.17/0.50 sQ8_spl <=> (less_than(an_index,lower_bound))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f92,plain,(
% 0.17/0.50 less_than(an_index,lower_bound)|~sQ8_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f91])).
% 0.17/0.50 fof(f94,definition,(
% 0.17/0.50 sQ9_spl <=> (less_than(upper_bound,an_index))),
% 0.17/0.50 introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition])).
% 0.17/0.50 fof(f95,plain,(
% 0.17/0.50 less_than(upper_bound,an_index)|~sQ9_spl),
% 0.17/0.50 inference(component_clause,[status(thm)],[f94])).
% 0.17/0.50 fof(f97,plain,(
% 0.17/0.50 sQ8_spl|sQ9_spl|sQ2_spl),
% 0.17/0.50 inference(split_clause,[status(thm)],[f90,f91,f94,f29])).
% 0.17/0.50 fof(f98,plain,(
% 0.17/0.50 $false|~sQ3_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f33,f65])).
% 0.17/0.50 fof(f99,plain,(
% 0.17/0.50 ~sQ3_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f98])).
% 0.17/0.50 fof(f100,plain,(
% 0.17/0.50 $false|~sQ8_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f92,f18])).
% 0.17/0.50 fof(f101,plain,(
% 0.17/0.50 ~sQ8_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f100])).
% 0.17/0.50 fof(f102,plain,(
% 0.17/0.50 $false|~sQ9_spl),
% 0.17/0.50 inference(forward_subsumption_resolution,[status(thm)],[f95,f19])).
% 0.17/0.50 fof(f103,plain,(
% 0.17/0.50 ~sQ9_spl),
% 0.17/0.50 inference(contradiction_clause,[status(thm)],[f102])).
% 0.17/0.50 fof(f104,plain,(
% 0.17/0.50 $false),
% 0.17/0.50 inference(sat_refutation,[status(thm)],[f28,f44,f71,f73,f80,f82,f89,f97,f99,f101,f103])).
% 0.17/0.50 % SZS output end CNFRefutation for theBenchmark.p
% 0.17/0.54 % Elapsed time: 0.064524 seconds
% 0.17/0.54 % CPU time: 0.143019 seconds
% 0.17/0.54 % Total memory used: 20.380 MB
% 0.17/0.54 % Net memory used: 20.261 MB
%------------------------------------------------------------------------------