%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV064+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 : 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 02:53:37 PM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 34 unt; 0 def)
% Number of atoms : 80 ( 22 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 57 ( 15 ~; 12 |; 28 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_3) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_4) ).
fof(cl5_nebula_array_0005,conjecture,
( ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0005) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
cnf(c_0_9,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_10,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_11,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_12,plain,
succ(n1) = n2,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X72] : pred(succ(X72)) = X72,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_14,plain,
! [X50] : minus(X50,n1) = pred(X50),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_15,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_16,plain,
succ(n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
fof(c_0_17,negated_conjecture,
~ ( ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0005]) ).
cnf(c_0_18,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_21,plain,
succ(n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_10]),c_0_12]),c_0_16]) ).
fof(c_0_22,negated_conjecture,
( ( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
cnf(c_0_23,plain,
minus(succ(X1),n1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
succ(n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_10]),c_0_12]),c_0_16]),c_0_21]) ).
fof(c_0_25,plain,
! [X28] : leq(X28,X28),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_26,negated_conjecture,
leq(pv53,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
minus(n5,n1) = n4,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
leq(pv54,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
leq(n0,pv53),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
leq(n0,pv54),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,negated_conjecture,
leq(pv53,n4),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
leq(pv54,n4),
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_34]),c_0_27]),c_0_35]),c_0_27]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV064+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.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 08:27:20 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % sh5l with pid 650577 completed with status 0
% 0.15/0.47 % Result found by sh5l
% 0.15/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.47 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.47 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.47 % SubtermCWHack with pid 650580 completed with status 0
% 0.15/0.47 % Result found by SubtermCWHack
% 0.15/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.47 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.47 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.47 % Preprocessing time : 0.001 s
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Theorem
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 92
% 0.15/0.47 % Removed by relevancy pruning/SinE : 22
% 0.15/0.47 % Initial clauses : 79
% 0.15/0.47 % Removed in clause preprocessing : 0
% 0.15/0.47 % Initial clauses in saturation : 79
% 0.15/0.47 % Processed clauses : 330
% 0.15/0.47 % ...of these trivial : 0
% 0.15/0.47 % ...subsumed : 124
% 0.15/0.47 % ...remaining for further processing : 205
% 0.15/0.47 % Other redundant clauses eliminated : 0
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 0
% 0.15/0.47 % Backward-rewritten : 14
% 0.15/0.47 % Generated clauses : 560
% 0.15/0.47 % ...of the previous two non-redundant : 450
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 0
% 0.15/0.47 % Paramodulations : 558
% 0.15/0.47 % Factorizations : 2
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 0
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 272
% 0.15/0.47 % ...of those cached : 214
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 191
% 0.15/0.47 % Positive orientable unit clauses : 101
% 0.15/0.47 % Positive unorientable unit clauses: 0
% 0.15/0.47 % Negative unit clauses : 55
% 0.15/0.47 % Non-unit-clauses : 35
% 0.15/0.47 % Current number of unprocessed clauses: 199
% 0.15/0.47 % ...number of literals in the above : 478
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 14
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 173
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 106
% 0.15/0.47 % Non-unit clause-clause subsumptions : 15
% 0.15/0.47 % Unit Clause-clause subsumption calls : 271
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 11
% 0.15/0.47 % BW rewrite match successes : 8
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 8390
% 0.15/0.47 % Search garbage collected termcells : 619
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.010 s
% 0.15/0.47 % System time : 0.003 s
% 0.15/0.47 % Total time : 0.013 s
% 0.15/0.47 % Maximum resident set size: 3740 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.014 s
% 0.15/0.47 % System time : 0.006 s
% 0.15/0.47 % Total time : 0.021 s
% 0.15/0.47 % Maximum resident set size: 4864 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------