%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV019-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:20:37 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.72s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 13 unt; 8 nHn; 26 RR)
% Number of literals : 69 ( 4 equ; 32 neg)
% Maximal clause size : 7 ( 2 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(maximal_above_lower_bound,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
cnf(this_is_maximal,axiom,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',this_is_maximal) ).
cnf(in_bounds,axiom,
( less_than(X1,lower_bound)
| less_than(upper_bound,X1)
| in_array_bounds(array,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_bounds) ).
cnf(transitivity_of_less,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_before_somewhere) ).
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
cnf(successor_greater,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_greater) ).
cnf(predecessor_less,axiom,
( less_than(X1,X2)
| ~ less_than(successor(X1),successor(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',predecessor_less) ).
cnf(c_0_10,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
prove_this ).
cnf(c_0_11,axiom,
~ less_than(index_of_maximal,lower_bound),
maximal_above_lower_bound ).
cnf(c_0_12,axiom,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
this_is_maximal ).
cnf(c_0_13,negated_conjecture,
( less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,index_of_maximal)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,axiom,
( less_than(X1,lower_bound)
| less_than(upper_bound,X1)
| in_array_bounds(array,X1) ),
in_bounds ).
cnf(c_0_15,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
transitivity_of_less ).
cnf(c_0_16,axiom,
less_than(index_of_maximal,an_index),
maximal_before_somewhere ).
cnf(c_0_17,negated_conjecture,
( less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| less_than(upper_bound,index_of_maximal)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).
cnf(c_0_18,axiom,
~ less_than(an_index,lower_bound),
somewhere_above_lower_bound ).
cnf(c_0_19,axiom,
~ less_than(upper_bound,an_index),
somewhere_below_upper_bound ).
cnf(c_0_20,axiom,
less_than(X1,successor(X1)),
successor_greater ).
cnf(c_0_21,plain,
( less_than(X1,an_index)
| ~ less_than(X1,index_of_maximal) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| less_than(upper_bound,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( less_than(X1,successor(X2))
| ~ less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,plain,
~ less_than(upper_bound,index_of_maximal),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_25,axiom,
( less_than(X1,X2)
| ~ less_than(successor(X1),successor(X2)) ),
predecessor_less ).
cnf(c_0_26,negated_conjecture,
( less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16])]),c_0_24]) ).
cnf(c_0_27,plain,
( less_than(X1,X2)
| ~ less_than(successor(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
less_than(successor(an_index),lower_bound),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV019-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n014.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:54:21 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.72 % Version : CSE_E---1.7
% 1.24/1.72 % Problem : theBenchmark.p
% 1.24/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.72 % SZS output start CNFRefutation
% See solution above
% 1.24/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------