%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV077+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:31 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 60 ( 10 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 78 ( 29 ~; 20 |; 20 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0018,conjecture,
( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv40
=> true )
& ( n0 != pv40
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0018) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(c_0_2,negated_conjecture,
~ ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv40
=> true )
& ( n0 != pv40
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0018]) ).
fof(c_0_3,negated_conjecture,
~ ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv40
=> true )
& ( n0 != pv40
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,negated_conjecture,
( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ true )
& ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| n0 = pv40 )
& ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| n0 != pv40
| ~ true )
& ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| n0 != pv40
| n0 = pv40 )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ true ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ true ),
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_8,negated_conjecture,
leq(n0,pv31),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
leq(pv31,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV077+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n007.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 08:27:36 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % new_bool_1 with pid 651355 completed with status 0
% 0.13/0.45 % Result found by new_bool_1
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 651357 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.002 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 85
% 0.13/0.45 % Removed by relevancy pruning/SinE : 23
% 0.13/0.45 % Initial clauses : 70
% 0.13/0.45 % Removed in clause preprocessing : 1
% 0.13/0.45 % Initial clauses in saturation : 69
% 0.13/0.45 % Processed clauses : 297
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 126
% 0.13/0.45 % ...remaining for further processing : 170
% 0.13/0.45 % Other redundant clauses eliminated : 0
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 0
% 0.13/0.45 % Backward-rewritten : 6
% 0.13/0.45 % Generated clauses : 516
% 0.13/0.45 % ...of the previous two non-redundant : 415
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 514
% 0.13/0.45 % Factorizations : 2
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 0
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 229
% 0.13/0.45 % ...of those cached : 177
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 164
% 0.13/0.45 % Positive orientable unit clauses : 75
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 53
% 0.13/0.45 % Non-unit-clauses : 36
% 0.13/0.45 % Current number of unprocessed clauses: 187
% 0.13/0.45 % ...number of literals in the above : 437
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 6
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 97
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 42
% 0.13/0.45 % Non-unit clause-clause subsumptions : 15
% 0.13/0.45 % Unit Clause-clause subsumption calls : 346
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 6
% 0.13/0.45 % BW rewrite match successes : 5
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 7653
% 0.13/0.45 % Search garbage collected termcells : 613
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.013 s
% 0.13/0.45 % System time : 0.003 s
% 0.13/0.45 % Total time : 0.017 s
% 0.13/0.45 % Maximum resident set size: 3684 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.015 s
% 0.13/0.45 % System time : 0.009 s
% 0.13/0.45 % Total time : 0.024 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------