%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HEN005-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 18 unt; 0 nHn; 30 RR)
% Number of literals : 76 ( 6 equ; 44 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_property,axiom,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(quotient_less_equal,axiom,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divde_zero_is_x) ).
cnf(yLEz,hypothesis,
less_equal(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yLEz) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(zero_divide_anything_is_zero,axiom,
quotient(zero,X1,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).
cnf(prove_transitivity_of_less_equal,negated_conjecture,
~ less_equal(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_transitivity_of_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(c_0_10,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_11,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_12,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
c_0_10 ).
cnf(c_0_13,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_14,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
c_0_11 ).
cnf(c_0_15,hypothesis,
less_equal(y,z),
yLEz ).
cnf(c_0_16,plain,
( ~ quotient(X6,X3,X5)
| ~ quotient(X6,X4,X1)
| ~ quotient(X5,X4,X2)
| ~ quotient(X3,X4,zero)
| less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
quotient(y,z,zero),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_19,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_20,hypothesis,
( ~ quotient(X4,y,X3)
| ~ quotient(X4,z,X1)
| ~ quotient(X3,z,X2)
| less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
quotient(zero,X1,zero),
zero_divide_anything_is_zero ).
cnf(c_0_22,hypothesis,
less_equal(x,y),
xLEy ).
cnf(c_0_23,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_18 ).
cnf(c_0_24,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
c_0_19 ).
cnf(c_0_25,hypothesis,
( ~ quotient(X2,z,X1)
| ~ quotient(X2,y,zero)
| less_equal(X1,zero) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
quotient(x,y,zero),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_27,plain,
( ~ less_equal(X1,X2)
| ~ quotient(X2,X1,zero)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
( ~ quotient(x,z,X1)
| less_equal(X1,zero) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ less_equal(x,z),
inference(fof_simplification,[status(thm)],[prove_transitivity_of_less_equal]) ).
cnf(c_0_30,hypothesis,
( ~ quotient(x,z,X1)
| X1 = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21])]) ).
cnf(c_0_31,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_32,negated_conjecture,
~ less_equal(x,z),
c_0_29 ).
cnf(c_0_33,hypothesis,
divide(x,z) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ quotient(x,z,zero),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN005-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 20:45:33 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1737428 completed with status 0
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.14/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1737433 completed with status 0
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41 % Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 16
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 16
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 16
% 0.14/0.41 % Processed clauses : 102
% 0.14/0.41 % ...of these trivial : 1
% 0.14/0.41 % ...subsumed : 27
% 0.14/0.41 % ...remaining for further processing : 74
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 1
% 0.14/0.41 % Backward-rewritten : 0
% 0.14/0.41 % Generated clauses : 156
% 0.14/0.41 % ...of the previous two non-redundant : 93
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 156
% 0.14/0.41 % Factorizations : 0
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 58
% 0.14/0.41 % ...of those cached : 30
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 57
% 0.14/0.41 % Positive orientable unit clauses : 22
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 2
% 0.14/0.41 % Non-unit-clauses : 33
% 0.14/0.41 % Current number of unprocessed clauses: 23
% 0.14/0.41 % ...number of literals in the above : 76
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 17
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 252
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 205
% 0.14/0.41 % Non-unit clause-clause subsumptions : 28
% 0.14/0.41 % Unit Clause-clause subsumption calls : 3
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 24
% 0.14/0.41 % BW rewrite match successes : 0
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 1855
% 0.14/0.41 % Search garbage collected termcells : 30
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.006 s
% 0.14/0.41 % System time : 0.001 s
% 0.14/0.41 % Total time : 0.007 s
% 0.14/0.41 % Maximum resident set size: 3640 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.025 s
% 0.14/0.41 % System time : 0.008 s
% 0.14/0.41 % Total time : 0.033 s
% 0.14/0.41 % Maximum resident set size: 4608 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------