%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV067+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 : 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:38 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 45 ( 32 unt; 0 def)
% Number of atoms : 135 ( 22 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 141 ( 51 ~; 41 |; 38 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-3 aty)
% Number of variables : 23 ( 0 sgn 14 !; 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(cl5_nebula_array_0008,conjecture,
( ( leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) )
=> ( ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv63)
& leq(n0,pv10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0008) ).
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(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X2,X3)
& leq(X1,X2) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(gt_1_0,axiom,
gt(n1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_1_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]) ).
fof(c_0_15,negated_conjecture,
~ ( ( leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) )
=> ( ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv63)
& leq(n0,pv10) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0008]) ).
fof(c_0_16,plain,
! [X64] : pred(succ(X64)) = X64,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_17,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_18,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_19,plain,
succ(n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_14]) ).
fof(c_0_20,negated_conjecture,
~ ( ( leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) )
=> ( ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv63)
& leq(n0,pv10) ) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_24,plain,
succ(n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_14]),c_0_19]) ).
fof(c_0_25,negated_conjecture,
( ( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| gt(a_select3(q,pv10,pv63),pv78) )
& ( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10)
| ~ gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10)
| ~ gt(a_select3(q,pv10,pv63),pv78)
| gt(a_select3(q,pv10,pv63),pv78) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_26,plain,
minus(succ(X1),n1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
succ(n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_12]),c_0_14]),c_0_19]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
leq(pv63,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
minus(n5,n1) = n4,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
! [X29,X30,X31] :
( leq(X29,X31)
| ~ leq(X30,X31)
| ~ leq(X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])])]) ).
fof(c_0_32,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_33,negated_conjecture,
( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10) ),
inference(cn,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
leq(pv63,n4),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
leq(n1,pv63),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_39,plain,
( ~ gt(X1,X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[gt_1_0]) ).
cnf(c_0_41,negated_conjecture,
~ leq(n0,pv63),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_30]),c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
( ~ leq(X1,n1)
| leq(X1,pv63) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
leq(n0,n1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV067+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:29:43 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_3 with pid 1320534 completed with status 0
% 0.10/0.45 % Result found by new_bool_3
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.10/0.45 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 1320537 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.10/0.45 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 92
% 0.10/0.45 % Removed by relevancy pruning/SinE : 24
% 0.10/0.45 % Initial clauses : 78
% 0.10/0.45 % Removed in clause preprocessing : 1
% 0.10/0.45 % Initial clauses in saturation : 77
% 0.10/0.45 % Processed clauses : 558
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 242
% 0.10/0.45 % ...remaining for further processing : 316
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 12
% 0.10/0.45 % Generated clauses : 1306
% 0.10/0.45 % ...of the previous two non-redundant : 922
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 1304
% 0.10/0.45 % Factorizations : 2
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 613
% 0.10/0.45 % ...of those cached : 517
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 304
% 0.10/0.45 % Positive orientable unit clauses : 113
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 105
% 0.10/0.45 % Non-unit-clauses : 86
% 0.10/0.45 % Current number of unprocessed clauses: 440
% 0.10/0.45 % ...number of literals in the above : 1072
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 12
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 453
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 401
% 0.10/0.45 % Non-unit clause-clause subsumptions : 26
% 0.10/0.45 % Unit Clause-clause subsumption calls : 1362
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 9
% 0.10/0.45 % BW rewrite match successes : 7
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 13425
% 0.10/0.45 % Search garbage collected termcells : 634
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.023 s
% 0.10/0.45 % System time : 0.007 s
% 0.10/0.45 % Total time : 0.030 s
% 0.10/0.45 % Maximum resident set size: 3744 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.028 s
% 0.10/0.45 % System time : 0.010 s
% 0.10/0.45 % Total time : 0.038 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------