%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HEN005-4 : 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 : 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 12:45:44 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 19 unt; 0 nHn; 18 RR)
% Number of literals : 31 ( 13 equ; 10 neg)
% Maximal clause size : 2 ( 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; 4 con; 0-2 aty)
% Number of variables : 23 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(a_LE_b,hypothesis,
less_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(b_LE_c,hypothesis,
less_equal(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_LE_c) ).
cnf(prove_a_LE_c,negated_conjecture,
~ less_equal(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_LE_c) ).
cnf(quotient_less_equal2,axiom,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(x_divide_zero_is_x,axiom,
divide(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_zero_is_x) ).
cnf(c_0_8,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal1]) ).
cnf(c_0_9,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
c_0_8 ).
cnf(c_0_10,hypothesis,
less_equal(a,b),
a_LE_b ).
cnf(c_0_11,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_12,hypothesis,
divide(a,b) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_14,hypothesis,
less_equal(b,c),
b_LE_c ).
cnf(c_0_15,negated_conjecture,
~ less_equal(a,c),
inference(fof_simplification,[status(thm)],[prove_a_LE_c]) ).
cnf(c_0_16,plain,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
cnf(c_0_17,hypothesis,
less_equal(divide(divide(a,X1),divide(b,X1)),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_18,hypothesis,
divide(b,c) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_19,axiom,
divide(X1,zero) = X1,
x_divide_zero_is_x ).
cnf(c_0_20,negated_conjecture,
~ less_equal(a,c),
c_0_15 ).
cnf(c_0_21,plain,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_22,hypothesis,
less_equal(divide(a,c),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
divide(a,c) != zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_19]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-4 : 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.51 % Computer : n015.cluster.edu
% 0.10/0.51 % Model : x86_64 x86_64
% 0.10/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.51 % Memory : 8046.5625MB
% 0.10/0.51 % OS : Linux 6.8.0-71-generic
% 0.10/0.51 % CPULimit : 300
% 0.10/0.51 % WCLimit : 300
% 0.10/0.51 % DateTime : Sun Sep 20 20:48:50 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.56 Running first-order theorem proving
% 0.10/0.56 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.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3909542 completed with status 0
% 0.23/0.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.58 % No SInE strategy applied
% 0.23/0.58 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.23/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.58 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.23/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.58 % SubtermCWHack with pid 3909546 completed with status 0
% 0.23/0.58 % Result found by SubtermCWHack
% 0.23/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.58 % No SInE strategy applied
% 0.23/0.58 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.23/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.58 % Preprocessing time : 0.001 s
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Unsatisfiable
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 14
% 0.23/0.58 % Removed by relevancy pruning/SinE : 0
% 0.23/0.58 % Initial clauses : 14
% 0.23/0.58 % Removed in clause preprocessing : 0
% 0.23/0.58 % Initial clauses in saturation : 14
% 0.23/0.58 % Processed clauses : 29
% 0.23/0.58 % ...of these trivial : 0
% 0.23/0.58 % ...subsumed : 0
% 0.23/0.58 % ...remaining for further processing : 29
% 0.23/0.58 % Other redundant clauses eliminated : 0
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 0
% 0.23/0.58 % Backward-rewritten : 0
% 0.23/0.58 % Generated clauses : 88
% 0.23/0.58 % ...of the previous two non-redundant : 32
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 0
% 0.23/0.58 % Paramodulations : 88
% 0.23/0.58 % Factorizations : 0
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 0
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 129
% 0.23/0.58 % ...of those cached : 81
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 29
% 0.23/0.58 % Positive orientable unit clauses : 17
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 2
% 0.23/0.58 % Non-unit-clauses : 10
% 0.23/0.58 % Current number of unprocessed clauses: 17
% 0.23/0.58 % ...number of literals in the above : 21
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 0
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 0
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 0
% 0.23/0.58 % Non-unit clause-clause subsumptions : 0
% 0.23/0.58 % Unit Clause-clause subsumption calls : 0
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 11
% 0.23/0.58 % BW rewrite match successes : 0
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 995
% 0.23/0.58 % Search garbage collected termcells : 10
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.001 s
% 0.23/0.58 % System time : 0.004 s
% 0.23/0.58 % Total time : 0.005 s
% 0.23/0.58 % Maximum resident set size: 3636 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.005 s
% 0.23/0.58 % System time : 0.014 s
% 0.23/0.58 % Total time : 0.020 s
% 0.23/0.58 % Maximum resident set size: 4864 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------