%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV131+1 : TPTP v9.3.1. Bugfixed v3.3.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 02:53:47 PM UTC 2026
% Result : Theorem 0.15s 5.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 38 ( 11 avg)
% Number of connectives : 198 ( 56 ~; 28 |; 61 &)
% ( 1 <=>; 52 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0001,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ~ leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0001) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ~ leq(tptp_float_0_001,pv1341) ) ),
introduced(definition) ).
fof(c_0_2,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ~ leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
inference(assume_negation,[status(cth)],[gauss_array_0001]) ).
fof(c_0_3,plain,
( epred1_0
=> ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ~ leq(tptp_float_0_001,pv1341) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_4,negated_conjecture,
~ ( epred1_0
=> leq(n0,s_best7) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_1]) ).
fof(c_0_5,plain,
( ( ~ epred1_0
| leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( ~ epred1_0
| leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( ~ epred1_0
| leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( ~ epred1_0
| leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( ~ epred1_0
| leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( ~ epred1_0
| leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( ~ epred1_0
| ~ leq(tptp_float_0_001,pv1341) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,negated_conjecture,
( ~ leq(n0,s_best7)
& epred1_0 ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,plain,
( ~ epred1_0
| ~ leq(tptp_float_0_001,pv1341) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ epred1_0
| leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ leq(n0,s_best7),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])]),c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV131+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.37 % Computer : n020.cluster.edu
% 0.12/5.37 % Model : x86_64 x86_64
% 0.12/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.37 % Memory : 8046.5625MB
% 0.12/5.37 % OS : Linux 6.8.0-71-generic
% 0.12/5.37 % CPULimit : 300
% 0.12/5.37 % WCLimit : 300
% 0.12/5.37 % DateTime : Mon Sep 21 08:33:09 UTC 2026
% 0.12/5.37 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.41 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.15/5.43 % Version: 3.5.1
% 0.15/5.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.43 % Starting sh5l with 300s (1) cores
% 0.15/5.43 % new_bool_1 with pid 2500623 completed with status 0
% 0.15/5.43 % Result found by new_bool_1
% 0.15/5.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.43 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.15/5.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.43 % SubtermCWHack with pid 2500626 completed with status 0
% 0.15/5.43 % Result found by SubtermCWHack
% 0.15/5.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.43 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.15/5.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.43 % Preprocessing time : 0.001 s
% 0.15/5.43
% 0.15/5.43 % Proof found!
% 0.15/5.43 % SZS status Theorem
% 0.15/5.43 % SZS output start CNFRefutation
% See solution above
% 0.15/5.43 % Parsed axioms : 85
% 0.15/5.43 % Removed by relevancy pruning/SinE : 29
% 0.15/5.43 % Initial clauses : 72
% 0.15/5.43 % Removed in clause preprocessing : 0
% 0.15/5.43 % Initial clauses in saturation : 72
% 0.15/5.43 % Processed clauses : 59
% 0.15/5.43 % ...of these trivial : 0
% 0.15/5.43 % ...subsumed : 0
% 0.15/5.43 % ...remaining for further processing : 58
% 0.15/5.43 % Other redundant clauses eliminated : 0
% 0.15/5.43 % Clauses deleted for lack of memory : 0
% 0.15/5.43 % Backward-subsumed : 0
% 0.15/5.43 % Backward-rewritten : 0
% 0.15/5.43 % Generated clauses : 32
% 0.15/5.43 % ...of the previous two non-redundant : 22
% 0.15/5.43 % ...aggressively subsumed : 0
% 0.15/5.43 % Contextual simplify-reflections : 0
% 0.15/5.43 % Paramodulations : 32
% 0.15/5.43 % Factorizations : 0
% 0.15/5.43 % NegExts : 0
% 0.15/5.43 % Equation resolutions : 0
% 0.15/5.43 % Disequality decompositions : 0
% 0.15/5.43 % Total rewrite steps : 19
% 0.15/5.43 % ...of those cached : 7
% 0.15/5.43 % Propositional unsat checks : 0
% 0.15/5.43 % Propositional check models : 0
% 0.15/5.43 % Propositional check unsatisfiable : 0
% 0.15/5.43 % Propositional clauses : 0
% 0.15/5.43 % Propositional clauses after purity: 0
% 0.15/5.43 % Propositional unsat core size : 0
% 0.15/5.43 % Propositional preprocessing time : 0.000
% 0.15/5.43 % Propositional encoding time : 0.000
% 0.15/5.43 % Propositional solver time : 0.000
% 0.15/5.43 % Success case prop preproc time : 0.000
% 0.15/5.43 % Success case prop encoding time : 0.000
% 0.15/5.43 % Success case prop solver time : 0.000
% 0.15/5.43 % Current number of processed clauses : 58
% 0.15/5.43 % Positive orientable unit clauses : 54
% 0.15/5.43 % Positive unorientable unit clauses: 0
% 0.15/5.43 % Negative unit clauses : 3
% 0.15/5.43 % Non-unit-clauses : 1
% 0.15/5.43 % Current number of unprocessed clauses: 35
% 0.15/5.43 % ...number of literals in the above : 98
% 0.15/5.43 % Current number of archived formulas : 0
% 0.15/5.43 % Current number of archived clauses : 0
% 0.15/5.43 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.43 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.43 % Non-unit clause-clause subsumptions : 0
% 0.15/5.43 % Unit Clause-clause subsumption calls : 0
% 0.15/5.43 % Rewrite failures with RHS unbound : 0
% 0.15/5.43 % BW rewrite match attempts : 0
% 0.15/5.43 % BW rewrite match successes : 0
% 0.15/5.43 % Condensation attempts : 0
% 0.15/5.43 % Condensation successes : 0
% 0.15/5.43 % Termbank termtop insertions : 4150
% 0.15/5.43 % Search garbage collected termcells : 632
% 0.15/5.43
% 0.15/5.43 % -------------------------------------------------
% 0.15/5.43 % User time : 0.006 s
% 0.15/5.43 % System time : 0.001 s
% 0.15/5.43 % Total time : 0.007 s
% 0.15/5.43 % Maximum resident set size: 3740 pages
% 0.15/5.43
% 0.15/5.43 % -------------------------------------------------
% 0.15/5.43 % User time : 0.009 s
% 0.15/5.43 % System time : 0.006 s
% 0.15/5.43 % Total time : 0.015 s
% 0.15/5.43 % Maximum resident set size: 4608 pages
% 0.15/5.43 % E exiting
%------------------------------------------------------------------------------