%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV069+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 : n006.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:29 PM UTC 2026
% Result : Theorem 0.21s 0.75s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 31 unt; 0 def)
% Number of atoms : 59 ( 21 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 33 ( 12 ~; 8 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 10 !; 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(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(cl5_nebula_array_0010,conjecture,
( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_5) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(gt_4_0,axiom,
gt(n4,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_0) ).
cnf(c_0_11,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_12,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_13,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_14,plain,
succ(n1) = n2,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
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_13,c_0_12]),c_0_14]) ).
fof(c_0_17,negated_conjecture,
~ ( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0010]) ).
fof(c_0_18,plain,
! [X64] : pred(succ(X64)) = X64,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_19,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_20,plain,
succ(n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12]),c_0_14]),c_0_16]) ).
fof(c_0_21,negated_conjecture,
( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
fof(c_0_22,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_23,plain,
! [X28] : leq(X28,X28),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_24,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
succ(n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_12]),c_0_14]),c_0_16]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
pred(n5) = n4,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
leq(pv10,pred(n135300)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_33,plain,
! [X32,X33] :
( leq(X32,X33)
| ~ gt(X33,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])])]) ).
cnf(c_0_34,negated_conjecture,
~ leq(n0,n4),
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_27]),c_0_31]),c_0_27]),c_0_32])]) ).
cnf(c_0_35,plain,
( ~ gt(X1,X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
gt(n4,n0),
inference(split_conjunct,[status(thm)],[gt_4_0]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.62 % Computer : n006.cluster.edu
% 0.16/0.62 % Model : x86_64 x86_64
% 0.16/0.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.62 % Memory : 8046.5625MB
% 0.16/0.62 % OS : Linux 6.8.0-71-generic
% 0.16/0.62 % CPULimit : 300
% 0.16/0.62 % WCLimit : 300
% 0.16/0.62 % DateTime : Mon Sep 21 08:29:27 UTC 2026
% 0.16/0.63 % CPUTime :
% 0.16/0.63 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.69 Running first-order theorem proving
% 0.21/0.69 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.21/0.75 % Version: 3.5.1
% 0.21/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.75 % Starting sh5l with 300s (1) cores
% 0.21/0.75 % new_bool_3 with pid 2429610 completed with status 0
% 0.21/0.75 % Result found by new_bool_3
% 0.21/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.75 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.21/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.75 % SubtermCWHack with pid 2429613 completed with status 0
% 0.21/0.75 % Result found by SubtermCWHack
% 0.21/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.75 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.21/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.75 % Preprocessing time : 0.003 s
% 0.21/0.75
% 0.21/0.75 % Proof found!
% 0.21/0.75 % SZS status Theorem
% 0.21/0.75 % SZS output start CNFRefutation
% See solution above
% 0.21/0.75 % Parsed axioms : 92
% 0.21/0.75 % Removed by relevancy pruning/SinE : 24
% 0.21/0.75 % Initial clauses : 73
% 0.21/0.75 % Removed in clause preprocessing : 0
% 0.21/0.75 % Initial clauses in saturation : 73
% 0.21/0.75 % Processed clauses : 297
% 0.21/0.75 % ...of these trivial : 0
% 0.21/0.75 % ...subsumed : 105
% 0.21/0.75 % ...remaining for further processing : 192
% 0.21/0.75 % Other redundant clauses eliminated : 0
% 0.21/0.75 % Clauses deleted for lack of memory : 0
% 0.21/0.75 % Backward-subsumed : 1
% 0.21/0.75 % Backward-rewritten : 5
% 0.21/0.75 % Generated clauses : 718
% 0.21/0.75 % ...of the previous two non-redundant : 481
% 0.21/0.75 % ...aggressively subsumed : 0
% 0.21/0.75 % Contextual simplify-reflections : 0
% 0.21/0.75 % Paramodulations : 716
% 0.21/0.75 % Factorizations : 2
% 0.21/0.75 % NegExts : 0
% 0.21/0.75 % Equation resolutions : 0
% 0.21/0.75 % Disequality decompositions : 0
% 0.21/0.75 % Total rewrite steps : 326
% 0.21/0.75 % ...of those cached : 274
% 0.21/0.75 % Propositional unsat checks : 0
% 0.21/0.75 % Propositional check models : 0
% 0.21/0.75 % Propositional check unsatisfiable : 0
% 0.21/0.75 % Propositional clauses : 0
% 0.21/0.75 % Propositional clauses after purity: 0
% 0.21/0.75 % Propositional unsat core size : 0
% 0.21/0.75 % Propositional preprocessing time : 0.000
% 0.21/0.75 % Propositional encoding time : 0.000
% 0.21/0.75 % Propositional solver time : 0.000
% 0.21/0.75 % Success case prop preproc time : 0.000
% 0.21/0.75 % Success case prop encoding time : 0.000
% 0.21/0.75 % Success case prop solver time : 0.000
% 0.21/0.75 % Current number of processed clauses : 186
% 0.21/0.75 % Positive orientable unit clauses : 74
% 0.21/0.75 % Positive unorientable unit clauses: 0
% 0.21/0.75 % Negative unit clauses : 33
% 0.21/0.75 % Non-unit-clauses : 79
% 0.21/0.75 % Current number of unprocessed clauses: 257
% 0.21/0.75 % ...number of literals in the above : 653
% 0.21/0.75 % Current number of archived formulas : 0
% 0.21/0.75 % Current number of archived clauses : 6
% 0.21/0.75 % Clause-clause subsumption calls (NU) : 273
% 0.21/0.75 % Rec. Clause-clause subsumption calls : 199
% 0.21/0.75 % Non-unit clause-clause subsumptions : 18
% 0.21/0.75 % Unit Clause-clause subsumption calls : 539
% 0.21/0.75 % Rewrite failures with RHS unbound : 0
% 0.21/0.75 % BW rewrite match attempts : 3
% 0.21/0.75 % BW rewrite match successes : 2
% 0.21/0.75 % Condensation attempts : 0
% 0.21/0.75 % Condensation successes : 0
% 0.21/0.75 % Termbank termtop insertions : 9290
% 0.21/0.75 % Search garbage collected termcells : 589
% 0.21/0.75
% 0.21/0.75 % -------------------------------------------------
% 0.21/0.75 % User time : 0.026 s
% 0.21/0.75 % System time : 0.004 s
% 0.21/0.75 % Total time : 0.030 s
% 0.21/0.75 % Maximum resident set size: 3688 pages
% 0.21/0.75
% 0.21/0.75 % -------------------------------------------------
% 0.21/0.75 % User time : 0.030 s
% 0.21/0.75 % System time : 0.007 s
% 0.21/0.75 % Total time : 0.037 s
% 0.21/0.75 % Maximum resident set size: 4864 pages
% 0.21/0.75 % E exiting
%------------------------------------------------------------------------------