%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV007-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 : 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:19 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 16 unt; 5 nHn; 22 RR)
% Number of literals : 55 ( 8 equ; 24 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 : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,negated_conjecture,
( ~ less_than(a(X1),a(k))
| ~ less_than(X1,successor(n))
| less_than(X1,i) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(anti_symmetry_of_less_than,axiom,
( ~ less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',anti_symmetry_of_less_than) ).
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_5,negated_conjecture,
less_than(i,m),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(transitivity_of_less_than,axiom,
( ~ less_than(X3,X2)
| ~ less_than(X1,X3)
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).
cnf(clause_8,negated_conjecture,
less_than(a(m),a(k)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_4,negated_conjecture,
~ less_than(n,m),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(predecessor_less_than,axiom,
less_than(predecessor(X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',predecessor_less_than) ).
cnf(predecessor_successor,axiom,
predecessor(successor(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',predecessor_successor) ).
cnf(less_than_successor,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).
cnf(c_0_10,negated_conjecture,
( ~ less_than(a(X1),a(k))
| ~ less_than(X1,successor(n))
| less_than(X1,i) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_11,plain,
( ~ less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(fof_simplification,[status(thm)],[anti_symmetry_of_less_than]) ).
cnf(c_0_12,negated_conjecture,
( ~ less_than(a(X1),a(k))
| ~ less_than(X1,successor(n))
| less_than(X1,i) ),
c_0_10 ).
cnf(c_0_13,axiom,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
all_related ).
cnf(c_0_14,plain,
( ~ less_than(X2,X1)
| ~ less_than(X1,X2) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
less_than(i,m),
clause_5 ).
cnf(c_0_16,plain,
( ~ less_than(X3,X2)
| ~ less_than(X1,X3)
| less_than(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_than]) ).
cnf(c_0_17,negated_conjecture,
( ~ less_than(a(X1),a(k))
| less_than(X1,i)
| less_than(successor(n),X1)
| X1 = successor(n) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
less_than(a(m),a(k)),
clause_8 ).
cnf(c_0_19,negated_conjecture,
~ less_than(m,i),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ less_than(X3,X2)
| ~ less_than(X1,X3)
| less_than(X1,X2) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( less_than(successor(n),m)
| successor(n) = m ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ less_than(n,m),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_23,negated_conjecture,
( ~ less_than(X1,successor(n))
| less_than(X1,m)
| successor(n) = m ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
less_than(predecessor(X1),X1),
predecessor_less_than ).
cnf(c_0_25,axiom,
predecessor(successor(X1)) = X1,
predecessor_successor ).
cnf(c_0_26,negated_conjecture,
~ less_than(n,m),
c_0_22 ).
cnf(c_0_27,axiom,
less_than(X1,successor(X1)),
less_than_successor ).
cnf(c_0_28,negated_conjecture,
successor(n) = m,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n006.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:26:13 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2421546 completed with status 0
% 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSM-FFSS11-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % new_bool_3 with pid 2421553 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSM-FFSS11-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42 % Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 23
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 23
% 0.13/0.42 % Removed in clause preprocessing : 2
% 0.13/0.42 % Initial clauses in saturation : 21
% 0.13/0.42 % Processed clauses : 77
% 0.13/0.42 % ...of these trivial : 1
% 0.13/0.42 % ...subsumed : 6
% 0.13/0.42 % ...remaining for further processing : 70
% 0.13/0.42 % Other redundant clauses eliminated : 4
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 5
% 0.13/0.42 % Generated clauses : 92
% 0.13/0.42 % ...of the previous two non-redundant : 69
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 84
% 0.13/0.42 % Factorizations : 2
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 6
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 25
% 0.13/0.42 % ...of those cached : 16
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 44
% 0.13/0.42 % Positive orientable unit clauses : 10
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 14
% 0.13/0.42 % Non-unit-clauses : 20
% 0.13/0.42 % Current number of unprocessed clauses: 31
% 0.13/0.42 % ...number of literals in the above : 110
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 26
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 142
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 113
% 0.13/0.42 % Non-unit clause-clause subsumptions : 2
% 0.13/0.42 % Unit Clause-clause subsumption calls : 21
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 1
% 0.13/0.42 % BW rewrite match successes : 1
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 1412
% 0.13/0.42 % Search garbage collected termcells : 52
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.43 % User time : 0.001 s
% 0.13/0.43 % System time : 0.004 s
% 0.13/0.43 % Total time : 0.006 s
% 0.13/0.43 % Maximum resident set size: 3592 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.013 s
% 0.13/0.43 % System time : 0.015 s
% 0.13/0.43 % Total time : 0.028 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------