%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:53:31 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 16 unt; 6 nHn; 33 RR)
% Number of literals : 84 ( 6 equ; 47 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/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,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',this_is_maximal) ).
cnf(predecessor_less,axiom,
( ~ less_than(successor(X1),successor(X2))
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',predecessor_less) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
cnf(transitivity_of_less,axiom,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_before_somewhere) ).
cnf(successor_greater,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_greater) ).
cnf(in_bounds,axiom,
( in_array_bounds(array,X1)
| less_than(upper_bound,X1)
| less_than(X1,lower_bound) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_bounds) ).
cnf(c_0_10,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_11,plain,
~ less_than(index_of_maximal,lower_bound),
inference(fof_simplification,[status(thm)],[maximal_above_lower_bound]) ).
cnf(c_0_12,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_13,plain,
( ~ less_than(successor(X1),successor(X2))
| less_than(X1,X2) ),
inference(fof_simplification,[status(thm)],[predecessor_less]) ).
cnf(c_0_14,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_10 ).
cnf(c_0_15,plain,
~ less_than(index_of_maximal,lower_bound),
c_0_11 ).
cnf(c_0_16,plain,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
c_0_12 ).
cnf(c_0_17,plain,
~ less_than(upper_bound,an_index),
inference(fof_simplification,[status(thm)],[somewhere_below_upper_bound]) ).
cnf(c_0_18,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_19,plain,
( ~ less_than(successor(X1),successor(X2))
| less_than(X1,X2) ),
c_0_13 ).
cnf(c_0_20,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_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
~ less_than(upper_bound,an_index),
c_0_17 ).
cnf(c_0_22,plain,
~ less_than(an_index,lower_bound),
inference(fof_simplification,[status(thm)],[somewhere_above_lower_bound]) ).
cnf(c_0_23,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
c_0_18 ).
cnf(c_0_24,axiom,
less_than(index_of_maximal,an_index),
maximal_before_somewhere ).
cnf(c_0_25,axiom,
less_than(X1,successor(X1)),
successor_greater ).
cnf(c_0_26,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) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,axiom,
( in_array_bounds(array,X1)
| less_than(upper_bound,X1)
| less_than(X1,lower_bound) ),
in_bounds ).
cnf(c_0_28,plain,
~ less_than(an_index,lower_bound),
c_0_22 ).
cnf(c_0_29,plain,
( ~ less_than(X1,index_of_maximal)
| less_than(X1,an_index) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ less_than(X1,X2)
| less_than(X1,successor(X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| less_than(successor(an_index),lower_bound) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21]),c_0_28]) ).
cnf(c_0_32,plain,
~ less_than(upper_bound,index_of_maximal),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_33,plain,
( ~ less_than(successor(X1),X2)
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( ~ less_than(index_of_maximal,successor(an_index))
| less_than(successor(an_index),lower_bound) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_32]),c_0_15]) ).
cnf(c_0_35,negated_conjecture,
~ less_than(index_of_maximal,successor(an_index)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:32:22 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 2023765 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGUSF-FFSF21-SFFFFFNN
% 0.13/0.42 % partial match(1): FGHSF-FFSF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 2023771 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGUSF-FFSF21-SFFFFFNN
% 0.13/0.42 % partial match(1): FGHSF-FFSF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 10
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 10
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 10
% 0.13/0.42 % Processed clauses : 82
% 0.13/0.42 % ...of these trivial : 6
% 0.13/0.42 % ...subsumed : 19
% 0.13/0.42 % ...remaining for further processing : 57
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 5
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 299
% 0.13/0.42 % ...of the previous two non-redundant : 274
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 1
% 0.13/0.42 % Paramodulations : 299
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 29
% 0.13/0.42 % ...of those cached : 20
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 52
% 0.13/0.42 % Positive orientable unit clauses : 9
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 5
% 0.13/0.42 % Non-unit-clauses : 38
% 0.13/0.42 % Current number of unprocessed clauses: 200
% 0.13/0.42 % ...number of literals in the above : 484
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 5
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 449
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 361
% 0.13/0.42 % Non-unit clause-clause subsumptions : 24
% 0.13/0.42 % Unit Clause-clause subsumption calls : 8
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 33
% 0.13/0.42 % BW rewrite match successes : 0
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 4338
% 0.13/0.42 % Search garbage collected termcells : 25
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.006 s
% 0.13/0.42 % System time : 0.001 s
% 0.13/0.42 % Total time : 0.007 s
% 0.13/0.42 % Maximum resident set size: 3636 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.009 s
% 0.13/0.42 % System time : 0.004 s
% 0.13/0.42 % Total time : 0.014 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------