%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD071-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 12:23:26 PM UTC 2026
% Result : Unsatisfiable 0.06s 0.33s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_less_or_equal_5,negated_conjecture,
~ less_or_equal(additive_identity,multiply(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_5) ).
cnf(compatibility_of_order_relation_and_multiplication,axiom,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(c_0_4,negated_conjecture,
~ less_or_equal(additive_identity,multiply(a,b)),
inference(fof_simplification,[status(thm)],[not_less_or_equal_5]) ).
cnf(c_0_5,plain,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_multiplication]) ).
cnf(c_0_6,negated_conjecture,
~ less_or_equal(additive_identity,multiply(a,b)),
c_0_4 ).
cnf(c_0_7,plain,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X1,X2)) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_4 ).
cnf(c_0_9,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_3 ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : FLD071-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 15:44:36 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.06/0.33 % Version: 3.5.1
% 0.06/0.33 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.33 % Starting sh5l with 300s (1) cores
% 0.06/0.33 % new_bool_3 with pid 2680743 completed with status 0
% 0.06/0.33 % Result found by new_bool_3
% 0.06/0.33 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.33 % Search class: FGUNF-FFMS22-SFFFFFNN
% 0.06/0.33 % partial match(1): FGUNF-FFMS21-SFFFFFNN
% 0.06/0.33 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.33 % SubtermCWHack with pid 2680749 completed with status 0
% 0.06/0.33 % Result found by SubtermCWHack
% 0.06/0.33 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.33 % Search class: FGUNF-FFMS22-SFFFFFNN
% 0.06/0.33 % partial match(1): FGUNF-FFMS21-SFFFFFNN
% 0.06/0.33 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.33 % Preprocessing time : 0.001 s
% 0.06/0.33
% 0.06/0.33 % Proof found!
% 0.06/0.33 % SZS status Unsatisfiable
% 0.06/0.33 % SZS output start CNFRefutation
% See solution above
% 0.06/0.33 % Parsed axioms : 32
% 0.06/0.33 % Removed by relevancy pruning/SinE : 7
% 0.06/0.33 % Initial clauses : 25
% 0.06/0.33 % Removed in clause preprocessing : 0
% 0.06/0.33 % Initial clauses in saturation : 25
% 0.06/0.33 % Processed clauses : 33
% 0.06/0.33 % ...of these trivial : 0
% 0.06/0.33 % ...subsumed : 3
% 0.06/0.33 % ...remaining for further processing : 30
% 0.06/0.33 % Other redundant clauses eliminated : 0
% 0.06/0.33 % Clauses deleted for lack of memory : 0
% 0.06/0.33 % Backward-subsumed : 0
% 0.06/0.33 % Backward-rewritten : 0
% 0.06/0.33 % Generated clauses : 53
% 0.06/0.33 % ...of the previous two non-redundant : 33
% 0.06/0.33 % ...aggressively subsumed : 0
% 0.06/0.33 % Contextual simplify-reflections : 0
% 0.06/0.33 % Paramodulations : 53
% 0.06/0.33 % Factorizations : 0
% 0.06/0.33 % NegExts : 0
% 0.06/0.33 % Equation resolutions : 0
% 0.06/0.33 % Disequality decompositions : 0
% 0.06/0.33 % Total rewrite steps : 12
% 0.06/0.33 % ...of those cached : 4
% 0.06/0.33 % Propositional unsat checks : 0
% 0.06/0.33 % Propositional check models : 0
% 0.06/0.33 % Propositional check unsatisfiable : 0
% 0.06/0.33 % Propositional clauses : 0
% 0.06/0.33 % Propositional clauses after purity: 0
% 0.06/0.33 % Propositional unsat core size : 0
% 0.06/0.33 % Propositional preprocessing time : 0.000
% 0.06/0.33 % Propositional encoding time : 0.000
% 0.06/0.33 % Propositional solver time : 0.000
% 0.06/0.33 % Success case prop preproc time : 0.000
% 0.06/0.33 % Success case prop encoding time : 0.000
% 0.06/0.33 % Success case prop solver time : 0.000
% 0.06/0.33 % Current number of processed clauses : 30
% 0.06/0.33 % Positive orientable unit clauses : 11
% 0.06/0.33 % Positive unorientable unit clauses: 0
% 0.06/0.33 % Negative unit clauses : 1
% 0.06/0.33 % Non-unit-clauses : 18
% 0.06/0.33 % Current number of unprocessed clauses: 23
% 0.06/0.33 % ...number of literals in the above : 80
% 0.06/0.33 % Current number of archived formulas : 0
% 0.06/0.33 % Current number of archived clauses : 0
% 0.06/0.33 % Clause-clause subsumption calls (NU) : 13
% 0.06/0.33 % Rec. Clause-clause subsumption calls : 13
% 0.06/0.33 % Non-unit clause-clause subsumptions : 3
% 0.06/0.33 % Unit Clause-clause subsumption calls : 4
% 0.06/0.33 % Rewrite failures with RHS unbound : 0
% 0.06/0.33 % BW rewrite match attempts : 0
% 0.06/0.33 % BW rewrite match successes : 0
% 0.06/0.33 % Condensation attempts : 0
% 0.06/0.33 % Condensation successes : 0
% 0.06/0.33 % Termbank termtop insertions : 1398
% 0.06/0.33 % Search garbage collected termcells : 93
% 0.06/0.33
% 0.06/0.33 % -------------------------------------------------
% 0.06/0.33 % User time : 0.001 s
% 0.06/0.33 % System time : 0.003 s
% 0.06/0.33 % Total time : 0.004 s
% 0.06/0.33 % Maximum resident set size: 3608 pages
% 0.06/0.33
% 0.06/0.33 % -------------------------------------------------
% 0.06/0.33 % User time : 0.002 s
% 0.06/0.33 % System time : 0.005 s
% 0.06/0.33 % Total time : 0.007 s
% 0.06/0.33 % Maximum resident set size: 4608 pages
% 0.06/0.33 % E exiting
%------------------------------------------------------------------------------