%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM027-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 01:44:17 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 15 unt; 5 nHn; 23 RR)
% Number of literals : 55 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
cnf(b_times_c_less_than_a_times_c,hypothesis,
less(multiply(b,c),multiply(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_c_less_than_a_times_c) ).
cnf(multiply_lemma,axiom,
( ~ less(X1,X2)
| less(multiply(X1,X3),multiply(X2,X3))
| equalish(X3,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_lemma) ).
cnf(prove_c_is_0,negated_conjecture,
~ equalish(c,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_is_0) ).
cnf(not_less_and_equal,axiom,
( ~ equalish(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_and_equal) ).
cnf(number_not_less_than_itself,axiom,
~ less(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',number_not_less_than_itself) ).
cnf(equality_preserved_over_times,axiom,
( ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equality_preserved_over_times) ).
cnf(b_not_less_than_a,hypothesis,
~ less(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_not_less_than_a) ).
cnf(numbers_either_less_or_equal,axiom,
( less(X2,X1)
| equalish(X2,X1)
| less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',numbers_either_less_or_equal) ).
cnf(c_0_9,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_10,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
c_0_9 ).
cnf(c_0_11,hypothesis,
less(multiply(b,c),multiply(a,c)),
b_times_c_less_than_a_times_c ).
cnf(c_0_12,plain,
( ~ less(X1,X2)
| less(multiply(X1,X3),multiply(X2,X3))
| equalish(X3,n0) ),
inference(fof_simplification,[status(thm)],[multiply_lemma]) ).
cnf(c_0_13,negated_conjecture,
~ equalish(c,n0),
inference(fof_simplification,[status(thm)],[prove_c_is_0]) ).
cnf(c_0_14,plain,
( ~ equalish(X1,X2)
| ~ less(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_less_and_equal]) ).
cnf(c_0_15,plain,
~ less(X1,X1),
inference(fof_simplification,[status(thm)],[number_not_less_than_itself]) ).
cnf(c_0_16,hypothesis,
( ~ less(multiply(a,c),X1)
| less(multiply(b,c),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( ~ less(X1,X2)
| less(multiply(X1,X3),multiply(X2,X3))
| equalish(X3,n0) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
~ equalish(c,n0),
c_0_13 ).
cnf(c_0_19,plain,
( ~ equalish(X1,X2)
| ~ less(X1,X2) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3)) ),
inference(fof_simplification,[status(thm)],[equality_preserved_over_times]) ).
cnf(c_0_21,plain,
~ less(X1,X1),
c_0_15 ).
cnf(c_0_22,hypothesis,
( ~ less(a,X1)
| less(multiply(b,c),multiply(X1,c)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,hypothesis,
~ less(b,a),
inference(fof_simplification,[status(thm)],[b_not_less_than_a]) ).
cnf(c_0_24,hypothesis,
~ equalish(multiply(b,c),multiply(a,c)),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_25,plain,
( ~ equalish(X1,X2)
| equalish(multiply(X1,X3),multiply(X2,X3)) ),
c_0_20 ).
cnf(c_0_26,hypothesis,
~ less(a,b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
( less(X2,X1)
| equalish(X2,X1)
| less(X1,X2) ),
numbers_either_less_or_equal ).
cnf(c_0_28,hypothesis,
~ less(b,a),
c_0_23 ).
cnf(c_0_29,hypothesis,
~ equalish(b,a),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM027-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 02:02:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.43 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.18/0.46 % Version: 3.5.1
% 0.18/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 % Starting sh5l with 300s (1) cores
% 0.18/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 324301 completed with status 0
% 0.18/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.46 % No SInE strategy applied
% 0.18/0.46 % Search class: FGHNM-FFSF21-MFFFFFNN
% 0.18/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.18/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.18/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.18/0.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 324308 completed with status 0
% 0.18/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.18/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.46 % No SInE strategy applied
% 0.18/0.46 % Search class: FGHNM-FFSF21-MFFFFFNN
% 0.18/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.18/0.46 % Preprocessing time : 0.002 s
% 0.18/0.46 % Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 % Proof found!
% 0.18/0.46 % SZS status Unsatisfiable
% 0.18/0.46 % SZS output start CNFRefutation
% See solution above
% 0.18/0.46 % Parsed axioms : 21
% 0.18/0.46 % Removed by relevancy pruning/SinE : 0
% 0.18/0.46 % Initial clauses : 21
% 0.18/0.46 % Removed in clause preprocessing : 0
% 0.18/0.46 % Initial clauses in saturation : 21
% 0.18/0.46 % Processed clauses : 141
% 0.18/0.46 % ...of these trivial : 0
% 0.18/0.46 % ...subsumed : 34
% 0.18/0.46 % ...remaining for further processing : 107
% 0.18/0.46 % Other redundant clauses eliminated : 0
% 0.18/0.46 % Clauses deleted for lack of memory : 0
% 0.18/0.46 % Backward-subsumed : 1
% 0.18/0.46 % Backward-rewritten : 0
% 0.18/0.46 % Generated clauses : 347
% 0.18/0.46 % ...of the previous two non-redundant : 252
% 0.18/0.46 % ...aggressively subsumed : 0
% 0.18/0.46 % Contextual simplify-reflections : 0
% 0.18/0.46 % Paramodulations : 345
% 0.18/0.46 % Factorizations : 2
% 0.18/0.46 % NegExts : 0
% 0.18/0.46 % Equation resolutions : 0
% 0.18/0.46 % Disequality decompositions : 0
% 0.18/0.46 % Total rewrite steps : 114
% 0.18/0.46 % ...of those cached : 86
% 0.18/0.46 % Propositional unsat checks : 0
% 0.18/0.46 % Propositional check models : 0
% 0.18/0.46 % Propositional check unsatisfiable : 0
% 0.18/0.46 % Propositional clauses : 0
% 0.18/0.46 % Propositional clauses after purity: 0
% 0.18/0.46 % Propositional unsat core size : 0
% 0.18/0.46 % Propositional preprocessing time : 0.000
% 0.18/0.46 % Propositional encoding time : 0.000
% 0.18/0.46 % Propositional solver time : 0.000
% 0.18/0.46 % Success case prop preproc time : 0.000
% 0.18/0.46 % Success case prop encoding time : 0.000
% 0.18/0.46 % Success case prop solver time : 0.000
% 0.18/0.46 % Current number of processed clauses : 85
% 0.18/0.46 % Positive orientable unit clauses : 28
% 0.18/0.46 % Positive unorientable unit clauses: 0
% 0.18/0.46 % Negative unit clauses : 17
% 0.18/0.46 % Non-unit-clauses : 40
% 0.18/0.46 % Current number of unprocessed clauses: 152
% 0.18/0.46 % ...number of literals in the above : 305
% 0.18/0.46 % Current number of archived formulas : 0
% 0.18/0.46 % Current number of archived clauses : 22
% 0.18/0.46 % Clause-clause subsumption calls (NU) : 330
% 0.18/0.46 % Rec. Clause-clause subsumption calls : 320
% 0.18/0.46 % Non-unit clause-clause subsumptions : 30
% 0.18/0.46 % Unit Clause-clause subsumption calls : 55
% 0.18/0.46 % Rewrite failures with RHS unbound : 0
% 0.18/0.46 % BW rewrite match attempts : 8
% 0.18/0.46 % BW rewrite match successes : 0
% 0.18/0.46 % Condensation attempts : 0
% 0.18/0.46 % Condensation successes : 0
% 0.18/0.46 % Termbank termtop insertions : 4588
% 0.18/0.46 % Search garbage collected termcells : 29
% 0.18/0.46
% 0.18/0.46 % -------------------------------------------------
% 0.18/0.46 % User time : 0.008 s
% 0.18/0.46 % System time : 0.006 s
% 0.18/0.46 % Total time : 0.014 s
% 0.18/0.46 % Maximum resident set size: 3648 pages
% 0.18/0.46
% 0.18/0.46 % -------------------------------------------------
% 0.18/0.46 % User time : 0.069 s
% 0.18/0.46 % System time : 0.023 s
% 0.18/0.46 % Total time : 0.092 s
% 0.18/0.46 % Maximum resident set size: 4864 pages
% 0.18/0.46 % E exiting
%------------------------------------------------------------------------------