%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/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 09:02:28 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 49 ( 36 unt; 5 nHn; 47 RR)
% Number of literals : 79 ( 4 equ; 29 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(in_bounds,axiom,
( in_array_bounds(array,X1)
| less_than(upper_bound,X1)
| less_than(X1,lower_bound) ),
file('theBenchmark.p',in_bounds) ).
cnf(predecessor_less,axiom,
( less_than(X,Y)
| ~ less_than(successor(X),successor(Y)) ),
file('theBenchmark.p',predecessor_less) ).
cnf(transitivity_of_less,axiom,
( less_than(X,Z)
| ~ less_than(Y,Z)
| ~ less_than(X,Y) ),
file('theBenchmark.p',transitivity_of_less) ).
cnf(successor_greater,axiom,
less_than(X,successor(X)),
file('theBenchmark.p',successor_greater) ).
cnf(this_is_maximal,axiom,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
file('theBenchmark.p',this_is_maximal) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('theBenchmark.p',maximal_before_somewhere) ).
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('theBenchmark.p',somewhere_above_lower_bound) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('theBenchmark.p',somewhere_below_upper_bound) ).
cnf(maximal_above_lower_bound,axiom,
~ less_than(index_of_maximal,lower_bound),
file('theBenchmark.p',maximal_above_lower_bound) ).
cnf(prove_this,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('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ less_than(index_of_maximal,lower_bound),
inference(start,[status(thm),parent(0:0)],[maximal_above_lower_bound]) ).
cnf(t2,plain,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| maximal_value != array_value_at(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| ~ in_array_bounds(array,an_index)
| less_than(index_of_maximal,lower_bound) ),
inference(extension,[status(thm),parent(t1:1)],[prove_this]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( less_than(upper_bound,an_index)
| less_than(an_index,lower_bound)
| in_array_bounds(array,an_index) ),
inference(extension,[status(thm),parent(t2:2)],[in_bounds]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ less_than(an_index,lower_bound),
inference(extension,[status(thm),parent(t4:2)],[somewhere_above_lower_bound]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
~ less_than(upper_bound,an_index),
inference(extension,[status(thm),parent(t4:3)],[somewhere_below_upper_bound]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
( less_than(upper_bound,index_of_maximal)
| less_than(index_of_maximal,lower_bound)
| in_array_bounds(array,index_of_maximal) ),
inference(extension,[status(thm),parent(t2:3)],[in_bounds]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).
cnf(t12,plain,
$false,
inference(reduction,[status(thm),parent(t10:2)],[t10:2,t1:1]) ).
cnf(t13,plain,
( ~ less_than(index_of_maximal,an_index)
| less_than(upper_bound,an_index)
| ~ less_than(upper_bound,index_of_maximal) ),
inference(extension,[status(thm),parent(t10:3)],[transitivity_of_less]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t10:3]) ).
cnf(t15,plain,
~ less_than(upper_bound,an_index),
inference(extension,[status(thm),parent(t13:2)],[somewhere_below_upper_bound]) ).
cnf(t16,plain,
$false,
inference(connection,[status(thm),parent(t15:1)],[t15:1,t13:2]) ).
cnf(t17,plain,
less_than(index_of_maximal,an_index),
inference(extension,[status(thm),parent(t13:3)],[maximal_before_somewhere]) ).
cnf(t18,plain,
$false,
inference(connection,[status(thm),parent(t17:1)],[t17:1,t13:3]) ).
cnf(l5,lemma,
in_array_bounds(array,index_of_maximal),
inference(lemma,[status(cth),parent(t2:3),below(t1:1)],[t2:3]) ).
cnf(t19,plain,
( ~ less_than(an_index,successor(an_index))
| ~ less_than(index_of_maximal,an_index)
| less_than(index_of_maximal,successor(an_index)) ),
inference(extension,[status(thm),parent(t2:4)],[transitivity_of_less]) ).
cnf(t20,plain,
$false,
inference(connection,[status(thm),parent(t19:1)],[t19:1,t2:4]) ).
cnf(t21,plain,
less_than(index_of_maximal,an_index),
inference(extension,[status(thm),parent(t19:2)],[maximal_before_somewhere]) ).
cnf(t22,plain,
$false,
inference(connection,[status(thm),parent(t21:1)],[t21:1,t19:2]) ).
cnf(t23,plain,
less_than(an_index,successor(an_index)),
inference(extension,[status(thm),parent(t19:3)],[successor_greater]) ).
cnf(t24,plain,
$false,
inference(connection,[status(thm),parent(t23:1)],[t23:1,t19:3]) ).
cnf(t25,plain,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
inference(extension,[status(thm),parent(t2:5)],[this_is_maximal]) ).
cnf(t26,plain,
$false,
inference(connection,[status(thm),parent(t25:1)],[t25:1,t2:5]) ).
cnf(t27,plain,
in_array_bounds(array,index_of_maximal),
inference(lemma_extension,[status(thm),parent(t25:2)],[l5:1]) ).
cnf(t28,plain,
$false,
inference(connection,[status(thm),parent(t27:1)],[t27:1,t25:2]) ).
cnf(t29,plain,
( less_than(upper_bound,an_index)
| ~ less_than(successor(upper_bound),successor(an_index)) ),
inference(extension,[status(thm),parent(t2:6)],[predecessor_less]) ).
cnf(t30,plain,
$false,
inference(connection,[status(thm),parent(t29:1)],[t29:1,t2:6]) ).
cnf(t31,plain,
~ less_than(upper_bound,an_index),
inference(extension,[status(thm),parent(t29:2)],[somewhere_below_upper_bound]) ).
cnf(t32,plain,
$false,
inference(connection,[status(thm),parent(t31:1)],[t31:1,t29:2]) ).
cnf(t33,plain,
( less_than(an_index,lower_bound)
| ~ less_than(an_index,successor(an_index))
| ~ less_than(successor(an_index),lower_bound) ),
inference(extension,[status(thm),parent(t2:7)],[transitivity_of_less]) ).
cnf(t34,plain,
$false,
inference(connection,[status(thm),parent(t33:1)],[t33:1,t2:7]) ).
cnf(t35,plain,
less_than(an_index,successor(an_index)),
inference(extension,[status(thm),parent(t33:2)],[successor_greater]) ).
cnf(t36,plain,
$false,
inference(connection,[status(thm),parent(t35:1)],[t35:1,t33:2]) ).
cnf(t37,plain,
~ less_than(an_index,lower_bound),
inference(extension,[status(thm),parent(t33:3)],[somewhere_above_lower_bound]) ).
cnf(t38,plain,
$false,
inference(connection,[status(thm),parent(t37:1)],[t37:1,t33:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n008.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 : Sun Sep 20 02:59:54 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.14/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------