%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 03:00:22 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 16 unt; 9 nHn; 33 RR)
% Number of literals : 84 ( 6 equ; 43 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 : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
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))
| ~ in_array_bounds(array,an_index)
| less_than(index_of_maximal,lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(maximal_above_lower_bound,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
cnf(this_is_maximal,axiom,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).
cnf(in_bounds,axiom,
( in_array_bounds(array,X1)
| less_than(upper_bound,X1)
| less_than(X1,lower_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
cnf(successor_greater,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).
cnf(predecessor_less,axiom,
( ~ less_than(successor(X1),successor(X2))
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).
cnf(c_0_10,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_11,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))
| ~ in_array_bounds(array,an_index)
| less_than(index_of_maximal,lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound) ),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_12,plain,
~ less_than(index_of_maximal,lower_bound),
inference(fof_simplification,[status(thm)],[maximal_above_lower_bound]) ).
cnf(c_0_13,plain,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
inference(fof_simplification,[status(thm)],[this_is_maximal]) ).
cnf(c_0_14,plain,
~ less_than(upper_bound,an_index),
inference(fof_simplification,[status(thm)],[somewhere_below_upper_bound]) ).
cnf(c_0_15,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
c_0_10 ).
cnf(c_0_16,axiom,
less_than(index_of_maximal,an_index),
maximal_before_somewhere ).
cnf(c_0_17,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))
| ~ in_array_bounds(array,an_index)
| less_than(index_of_maximal,lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound) ),
c_0_11 ).
cnf(c_0_18,plain,
~ less_than(index_of_maximal,lower_bound),
c_0_12 ).
cnf(c_0_19,plain,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
c_0_13 ).
cnf(c_0_20,plain,
~ less_than(upper_bound,an_index),
c_0_14 ).
cnf(c_0_21,plain,
( ~ less_than(X1,index_of_maximal)
| less_than(X1,an_index) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,an_index)
| ~ in_array_bounds(array,index_of_maximal)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,axiom,
( in_array_bounds(array,X1)
| less_than(upper_bound,X1)
| less_than(X1,lower_bound) ),
in_bounds ).
cnf(c_0_24,plain,
~ less_than(upper_bound,index_of_maximal),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
~ less_than(an_index,lower_bound),
inference(fof_simplification,[status(thm)],[somewhere_above_lower_bound]) ).
cnf(c_0_26,negated_conjecture,
( ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]),c_0_24]) ).
cnf(c_0_27,plain,
~ less_than(an_index,lower_bound),
c_0_25 ).
cnf(c_0_28,axiom,
less_than(X1,successor(X1)),
successor_greater ).
cnf(c_0_29,plain,
( ~ less_than(successor(X1),successor(X2))
| less_than(X1,X2) ),
inference(fof_simplification,[status(thm)],[predecessor_less]) ).
cnf(c_0_30,negated_conjecture,
( ~ less_than(index_of_maximal,successor(an_index))
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_27]),c_0_20]) ).
cnf(c_0_31,plain,
( ~ less_than(X1,X2)
| less_than(X1,successor(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_32,plain,
( ~ less_than(successor(X1),successor(X2))
| less_than(X1,X2) ),
c_0_29 ).
cnf(c_0_33,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16])]) ).
cnf(c_0_34,negated_conjecture,
less_than(successor(an_index),lower_bound),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]) ).
cnf(c_0_35,negated_conjecture,
( ~ less_than(X1,successor(an_index))
| less_than(X1,lower_bound) ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:28:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2492327 completed with status 0
% 0.11/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGUSF-FFSF21-SFFFFFNN
% 0.11/0.47 % partial match(1): FGHSF-FFSF21-SFFFFFNN
% 0.11/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2492332 completed with status 0
% 0.11/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGUSF-FFSF21-SFFFFFNN
% 0.11/0.47 % partial match(1): FGHSF-FFSF21-SFFFFFNN
% 0.11/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47 % Preprocessing time : 0.001 s
% 0.11/0.47 % Presaturation interreduction done
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Unsatisfiable
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.11/0.47 % Parsed axioms : 10
% 0.11/0.47 % Removed by relevancy pruning/SinE : 0
% 0.11/0.47 % Initial clauses : 10
% 0.11/0.47 % Removed in clause preprocessing : 0
% 0.11/0.47 % Initial clauses in saturation : 10
% 0.11/0.47 % Processed clauses : 29
% 0.11/0.47 % ...of these trivial : 0
% 0.11/0.47 % ...subsumed : 0
% 0.11/0.47 % ...remaining for further processing : 29
% 0.11/0.47 % Other redundant clauses eliminated : 0
% 0.11/0.47 % Clauses deleted for lack of memory : 0
% 0.11/0.47 % Backward-subsumed : 3
% 0.11/0.47 % Backward-rewritten : 1
% 0.11/0.47 % Generated clauses : 15
% 0.11/0.47 % ...of the previous two non-redundant : 12
% 0.11/0.47 % ...aggressively subsumed : 0
% 0.11/0.47 % Contextual simplify-reflections : 1
% 0.11/0.47 % Paramodulations : 15
% 0.11/0.47 % Factorizations : 0
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 0
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 3
% 0.11/0.47 % ...of those cached : 0
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 15
% 0.11/0.47 % Positive orientable unit clauses : 3
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 4
% 0.11/0.47 % Non-unit-clauses : 8
% 0.11/0.47 % Current number of unprocessed clauses: 3
% 0.11/0.47 % ...number of literals in the above : 8
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 14
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 43
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 31
% 0.11/0.47 % Non-unit clause-clause subsumptions : 4
% 0.11/0.47 % Unit Clause-clause subsumption calls : 6
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 3
% 0.11/0.47 % BW rewrite match successes : 1
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 525
% 0.11/0.47 % Search garbage collected termcells : 25
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.003 s
% 0.11/0.47 % System time : 0.004 s
% 0.11/0.47 % Total time : 0.008 s
% 0.11/0.47 % Maximum resident set size: 3584 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.015 s
% 0.11/0.47 % System time : 0.012 s
% 0.11/0.47 % Total time : 0.027 s
% 0.11/0.47 % Maximum resident set size: 4864 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------