%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV002-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 : n014.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:27 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 17 unt; 3 nHn; 29 RR)
% Number of literals : 55 ( 5 equ; 32 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_6,negated_conjecture,
( ~ less_than(a(X1),a(k))
| ~ less_than(X1,j)
| less_than(X1,i) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
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(clause_11,negated_conjecture,
less_than(a(q),a(j)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
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(a(j),a(k)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_9,negated_conjecture,
~ less_than(q,i),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_10,negated_conjecture,
~ less_than(j,q),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
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_9,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_10,negated_conjecture,
( ~ less_than(a(X1),a(k))
| ~ less_than(X1,j)
| less_than(X1,i) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
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,plain,
( ~ less_than(X3,X2)
| ~ less_than(X1,X3)
| less_than(X1,X2) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
less_than(a(q),a(j)),
clause_11 ).
cnf(c_0_14,negated_conjecture,
( ~ less_than(a(X1),a(k))
| ~ less_than(X1,j)
| less_than(X1,i) ),
c_0_10 ).
cnf(c_0_15,axiom,
( X1 = X2
| less_than(X2,X1)
| less_than(X1,X2) ),
all_related ).
cnf(c_0_16,plain,
( ~ less_than(X2,X1)
| ~ less_than(X1,X2) ),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
less_than(a(j),a(k)),
clause_5 ).
cnf(c_0_18,negated_conjecture,
~ less_than(q,i),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_19,negated_conjecture,
( ~ less_than(X1,a(q))
| less_than(X1,a(j)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ less_than(X1,j)
| less_than(X1,i)
| less_than(a(k),a(X1))
| a(X1) = a(k) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ less_than(a(k),a(j)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ less_than(q,i),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( ~ less_than(q,j)
| a(q) = a(k) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
~ less_than(j,q),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_25,negated_conjecture,
~ less_than(q,j),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_23]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ less_than(j,q),
c_0_24 ).
cnf(c_0_27,plain,
~ less_than(X1,X1),
inference(fof_simplification,[status(thm)],[x_not_less_than_x]) ).
cnf(c_0_28,negated_conjecture,
q = j,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_26]) ).
cnf(c_0_29,plain,
~ less_than(X1,X1),
c_0_27 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n014.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 08:26:34 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.55 % Version: 3.5.1
% 0.23/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % Starting sh5l with 300s (1) cores
% 0.23/0.55 % new_bool_1 with pid 3642078 completed with status 0
% 0.23/0.55 % Result found by new_bool_1
% 0.23/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 % Search class: FGHSM-FFSS11-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % SubtermCWHack with pid 3642084 completed with status 0
% 0.23/0.55 % Result found by SubtermCWHack
% 0.23/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 % Search class: FGHSM-FFSS11-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % Preprocessing time : 0.001 s
% 0.23/0.55
% 0.23/0.55 % Proof found!
% 0.23/0.55 % SZS status Unsatisfiable
% 0.23/0.55 % SZS output start CNFRefutation
% See solution above
% 0.23/0.55 % Parsed axioms : 23
% 0.23/0.55 % Removed by relevancy pruning/SinE : 0
% 0.23/0.55 % Initial clauses : 23
% 0.23/0.55 % Removed in clause preprocessing : 2
% 0.23/0.55 % Initial clauses in saturation : 21
% 0.23/0.55 % Processed clauses : 251
% 0.23/0.55 % ...of these trivial : 4
% 0.23/0.55 % ...subsumed : 100
% 0.23/0.55 % ...remaining for further processing : 147
% 0.23/0.55 % Other redundant clauses eliminated : 4
% 0.23/0.55 % Clauses deleted for lack of memory : 0
% 0.23/0.55 % Backward-subsumed : 1
% 0.23/0.55 % Backward-rewritten : 8
% 0.23/0.55 % Generated clauses : 616
% 0.23/0.55 % ...of the previous two non-redundant : 563
% 0.23/0.55 % ...aggressively subsumed : 0
% 0.23/0.55 % Contextual simplify-reflections : 0
% 0.23/0.55 % Paramodulations : 608
% 0.23/0.55 % Factorizations : 2
% 0.23/0.55 % NegExts : 0
% 0.23/0.55 % Equation resolutions : 6
% 0.23/0.55 % Disequality decompositions : 0
% 0.23/0.55 % Total rewrite steps : 60
% 0.23/0.55 % ...of those cached : 32
% 0.23/0.55 % Propositional unsat checks : 0
% 0.23/0.55 % Propositional check models : 0
% 0.23/0.55 % Propositional check unsatisfiable : 0
% 0.23/0.55 % Propositional clauses : 0
% 0.23/0.55 % Propositional clauses after purity: 0
% 0.23/0.55 % Propositional unsat core size : 0
% 0.23/0.55 % Propositional preprocessing time : 0.000
% 0.23/0.55 % Propositional encoding time : 0.000
% 0.23/0.55 % Propositional solver time : 0.000
% 0.23/0.55 % Success case prop preproc time : 0.000
% 0.23/0.55 % Success case prop encoding time : 0.000
% 0.23/0.55 % Success case prop solver time : 0.000
% 0.23/0.55 % Current number of processed clauses : 138
% 0.23/0.55 % Positive orientable unit clauses : 35
% 0.23/0.55 % Positive unorientable unit clauses: 0
% 0.23/0.55 % Negative unit clauses : 46
% 0.23/0.55 % Non-unit-clauses : 57
% 0.23/0.55 % Current number of unprocessed clauses: 324
% 0.23/0.55 % ...number of literals in the above : 848
% 0.23/0.55 % Current number of archived formulas : 0
% 0.23/0.55 % Current number of archived clauses : 9
% 0.23/0.55 % Clause-clause subsumption calls (NU) : 385
% 0.23/0.55 % Rec. Clause-clause subsumption calls : 354
% 0.23/0.55 % Non-unit clause-clause subsumptions : 26
% 0.23/0.55 % Unit Clause-clause subsumption calls : 51
% 0.23/0.55 % Rewrite failures with RHS unbound : 0
% 0.23/0.55 % BW rewrite match attempts : 49
% 0.23/0.55 % BW rewrite match successes : 1
% 0.23/0.55 % Condensation attempts : 0
% 0.23/0.55 % Condensation successes : 0
% 0.23/0.55 % Termbank termtop insertions : 5989
% 0.23/0.55 % Search garbage collected termcells : 52
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.010 s
% 0.23/0.55 % System time : 0.006 s
% 0.23/0.55 % Total time : 0.016 s
% 0.23/0.55 % Maximum resident set size: 3644 pages
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.012 s
% 0.23/0.55 % System time : 0.009 s
% 0.23/0.55 % Total time : 0.022 s
% 0.23/0.55 % Maximum resident set size: 4864 pages
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------