%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV065+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 : n009.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.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 31 unt; 0 def)
% Number of atoms : 63 ( 22 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 39 ( 11 ~; 8 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_3) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(cl5_nebula_array_0006,conjecture,
( ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0006) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_5) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/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,
! [X64] : pred(succ(X64)) = X64,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_14,plain,
! [X45] : minus(X45,n1) = pred(X45),
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(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0006]) ).
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(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& 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(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
leq(n0,pv53),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
leq(pv53,n4),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,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)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_27]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV065+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.10/0.35 % Computer : n009.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:29:43 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % new_bool_1 with pid 1320412 completed with status 0
% 0.14/0.42 % Result found by new_bool_1
% 0.14/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.14/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.42 % SubtermCWHack with pid 1320415 completed with status 0
% 0.14/0.42 % Result found by SubtermCWHack
% 0.14/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.14/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 92
% 0.14/0.42 % Removed by relevancy pruning/SinE : 24
% 0.14/0.42 % Initial clauses : 75
% 0.14/0.42 % Removed in clause preprocessing : 0
% 0.14/0.42 % Initial clauses in saturation : 75
% 0.14/0.42 % Processed clauses : 308
% 0.14/0.42 % ...of these trivial : 0
% 0.14/0.42 % ...subsumed : 101
% 0.14/0.42 % ...remaining for further processing : 206
% 0.14/0.42 % Other redundant clauses eliminated : 0
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 1
% 0.14/0.42 % Backward-rewritten : 11
% 0.14/0.42 % Generated clauses : 777
% 0.14/0.42 % ...of the previous two non-redundant : 517
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 0
% 0.14/0.42 % Paramodulations : 775
% 0.14/0.42 % Factorizations : 2
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 0
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 369
% 0.14/0.42 % ...of those cached : 305
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 194
% 0.14/0.42 % Positive orientable unit clauses : 81
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 31
% 0.14/0.42 % Non-unit-clauses : 82
% 0.14/0.42 % Current number of unprocessed clauses: 284
% 0.14/0.42 % ...number of literals in the above : 708
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 12
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 250
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 176
% 0.14/0.42 % Non-unit clause-clause subsumptions : 18
% 0.14/0.42 % Unit Clause-clause subsumption calls : 475
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 9
% 0.14/0.42 % BW rewrite match successes : 7
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 9884
% 0.14/0.42 % Search garbage collected termcells : 605
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.009 s
% 0.14/0.42 % System time : 0.004 s
% 0.14/0.42 % Total time : 0.013 s
% 0.14/0.42 % Maximum resident set size: 3996 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.011 s
% 0.14/0.42 % System time : 0.006 s
% 0.14/0.42 % Total time : 0.017 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------