%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:28 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.46s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 15 unt; 6 nHn; 22 RR)
% Number of literals : 45 ( 3 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(X1)))
| ~ less_than(X1,n)
| ~ less_than(one,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_3,negated_conjecture,
less_than(a(l),a(predecessor(l))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
~ less_than(n,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(all_related,axiom,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',all_related) ).
cnf(clause_4,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(n)))
| ~ less_than(one,n)
| less_than(n,X1)
| less_than(X1,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(x_not_less_than_x,axiom,
~ less_than(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).
cnf(c_0_7,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(X1)))
| ~ less_than(X1,n)
| ~ less_than(one,X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(X1)))
| ~ less_than(X1,n)
| ~ less_than(one,X1) ),
c_0_7 ).
cnf(c_0_9,negated_conjecture,
less_than(a(l),a(predecessor(l))),
clause_3 ).
cnf(c_0_10,negated_conjecture,
less_than(one,l),
clause_2 ).
cnf(c_0_11,negated_conjecture,
~ less_than(n,l),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_12,negated_conjecture,
~ less_than(l,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,axiom,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
all_related ).
cnf(c_0_14,negated_conjecture,
~ less_than(n,l),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(n)))
| ~ less_than(one,n)
| less_than(n,X1)
| less_than(X1,n) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_16,negated_conjecture,
l = n,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(n)))
| ~ less_than(one,n)
| less_than(n,X1)
| less_than(X1,n) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
less_than(one,n),
inference(rw,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_19,plain,
~ less_than(X1,X1),
inference(fof_simplification,[status(thm)],[x_not_less_than_x]) ).
cnf(c_0_20,negated_conjecture,
( ~ less_than(a(X1),a(predecessor(n)))
| less_than(X1,n)
| less_than(n,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
less_than(a(n),a(predecessor(n))),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_22,plain,
~ less_than(X1,X1),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n013.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 21 08:25:51 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.12/0.46 % Version: 3.5.1
% 0.12/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.46 % Starting sh5l with 300s (1) cores
% 0.12/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 357341 completed with status 0
% 0.12/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.46 % No SInE strategy applied
% 0.12/0.46 % Search class: FGHSM-FFSF11-SFFFFFNN
% 0.12/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.12/0.46 % Starting new_bool_3 with 169s (1) cores
% 0.12/0.46 % Starting new_bool_1 with 169s (1) cores
% 0.12/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 357351 completed with status 0
% 0.12/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.46 % No SInE strategy applied
% 0.12/0.46 % Search class: FGHSM-FFSF11-SFFFFFNN
% 0.12/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.46 % Preprocessing time : 0.002 s
% 0.12/0.46 % Presaturation interreduction done
% 0.12/0.46
% 0.12/0.46 % Proof found!
% 0.12/0.46 % SZS status Unsatisfiable
% 0.12/0.46 % SZS output start CNFRefutation
% See solution above
% 0.12/0.46 % Parsed axioms : 17
% 0.12/0.46 % Removed by relevancy pruning/SinE : 0
% 0.12/0.46 % Initial clauses : 17
% 0.12/0.46 % Removed in clause preprocessing : 2
% 0.12/0.46 % Initial clauses in saturation : 15
% 0.12/0.46 % Processed clauses : 50
% 0.12/0.46 % ...of these trivial : 2
% 0.12/0.46 % ...subsumed : 7
% 0.12/0.46 % ...remaining for further processing : 41
% 0.12/0.46 % Other redundant clauses eliminated : 4
% 0.12/0.46 % Clauses deleted for lack of memory : 0
% 0.12/0.46 % Backward-subsumed : 0
% 0.12/0.46 % Backward-rewritten : 5
% 0.12/0.46 % Generated clauses : 50
% 0.12/0.46 % ...of the previous two non-redundant : 35
% 0.12/0.46 % ...aggressively subsumed : 0
% 0.12/0.46 % Contextual simplify-reflections : 0
% 0.12/0.46 % Paramodulations : 42
% 0.12/0.46 % Factorizations : 2
% 0.12/0.46 % NegExts : 0
% 0.12/0.46 % Equation resolutions : 6
% 0.12/0.46 % Disequality decompositions : 0
% 0.12/0.46 % Total rewrite steps : 18
% 0.12/0.46 % ...of those cached : 9
% 0.12/0.46 % Propositional unsat checks : 0
% 0.12/0.46 % Propositional check models : 0
% 0.12/0.46 % Propositional check unsatisfiable : 0
% 0.12/0.46 % Propositional clauses : 0
% 0.12/0.46 % Propositional clauses after purity: 0
% 0.12/0.46 % Propositional unsat core size : 0
% 0.12/0.46 % Propositional preprocessing time : 0.000
% 0.12/0.46 % Propositional encoding time : 0.000
% 0.12/0.46 % Propositional solver time : 0.000
% 0.12/0.46 % Success case prop preproc time : 0.000
% 0.12/0.46 % Success case prop encoding time : 0.000
% 0.12/0.46 % Success case prop solver time : 0.000
% 0.12/0.46 % Current number of processed clauses : 21
% 0.12/0.46 % Positive orientable unit clauses : 8
% 0.12/0.46 % Positive unorientable unit clauses: 0
% 0.12/0.46 % Negative unit clauses : 6
% 0.12/0.46 % Non-unit-clauses : 7
% 0.12/0.46 % Current number of unprocessed clauses: 12
% 0.12/0.46 % ...number of literals in the above : 34
% 0.12/0.46 % Current number of archived formulas : 0
% 0.12/0.46 % Current number of archived clauses : 20
% 0.12/0.46 % Clause-clause subsumption calls (NU) : 35
% 0.12/0.46 % Rec. Clause-clause subsumption calls : 26
% 0.12/0.46 % Non-unit clause-clause subsumptions : 0
% 0.12/0.46 % Unit Clause-clause subsumption calls : 9
% 0.12/0.46 % Rewrite failures with RHS unbound : 0
% 0.12/0.46 % BW rewrite match attempts : 2
% 0.12/0.46 % BW rewrite match successes : 2
% 0.12/0.46 % Condensation attempts : 0
% 0.12/0.46 % Condensation successes : 0
% 0.12/0.46 % Termbank termtop insertions : 816
% 0.12/0.46 % Search garbage collected termcells : 40
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.006 s
% 0.12/0.46 % System time : 0.005 s
% 0.12/0.46 % Total time : 0.011 s
% 0.12/0.46 % Maximum resident set size: 3388 pages
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.027 s
% 0.12/0.46 % System time : 0.014 s
% 0.12/0.46 % Total time : 0.041 s
% 0.12/0.46 % Maximum resident set size: 4608 pages
% 0.12/0.46 % E exiting
%------------------------------------------------------------------------------