%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HEN006-2 : 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 : n017.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:45 PM UTC 2026
% Result : Unsatisfiable 2.13s 0.73s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 42 ( 19 unt; 0 nHn; 37 RR)
% Number of literals : 92 ( 4 equ; 53 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 91 ( 7 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/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(quotient_less_equal,axiom,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(xQz,hypothesis,
quotient(x,z,xQz),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQz) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(xQy,hypothesis,
quotient(x,y,xQy),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQy) ).
cnf(xQyLEz,hypothesis,
less_equal(xQy,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQyLEz) ).
cnf(divisor_existence,axiom,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(transitivity_of_less_equal,axiom,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(prove_xQzLEy,negated_conjecture,
~ less_equal(xQz,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xQzLEy) ).
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) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_13,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_12 ).
cnf(c_0_14,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_15,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_16,plain,
( ~ quotient(X7,X6,X4)
| ~ quotient(X7,X5,X1)
| ~ quotient(X6,X5,X2)
| ~ quotient(X4,X5,X3)
| less_equal(divide(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
c_0_15 ).
cnf(c_0_18,plain,
( ~ less_equal(X6,X4)
| ~ quotient(X5,X3,X6)
| ~ quotient(X5,X4,X1)
| ~ quotient(X3,X4,X2)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( ~ less_equal(X5,X3)
| ~ quotient(X4,X2,X5)
| ~ quotient(X4,X3,X1)
| less_equal(divide(X1,divide(X2,X3)),zero) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_20,hypothesis,
quotient(x,z,xQz),
xQz ).
cnf(c_0_21,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_22,hypothesis,
( ~ less_equal(X2,z)
| ~ quotient(x,X1,X2)
| less_equal(divide(xQz,divide(X1,z)),zero) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
quotient(x,y,xQy),
xQy ).
cnf(c_0_24,hypothesis,
less_equal(xQy,z),
xQyLEz ).
cnf(c_0_25,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_26,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_21 ).
cnf(c_0_27,hypothesis,
less_equal(divide(xQz,divide(y,z)),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_29,plain,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_equal]) ).
cnf(c_0_30,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
c_0_25 ).
cnf(c_0_31,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_32,hypothesis,
divide(xQz,divide(y,z)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
c_0_29 ).
cnf(c_0_34,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_35,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
c_0_31 ).
cnf(c_0_36,hypothesis,
quotient(xQz,divide(y,z),zero),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ less_equal(xQz,y),
inference(fof_simplification,[status(thm)],[prove_xQzLEy]) ).
cnf(c_0_38,plain,
( ~ less_equal(X1,divide(X2,X3))
| less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,hypothesis,
less_equal(xQz,divide(y,z)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
~ less_equal(xQz,y),
c_0_37 ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN006-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 20:41:11 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 2.13/0.73 % Version: 3.5.1
% 2.13/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.13/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.13/0.73 % Starting new_bool_3 with 300s (1) cores
% 2.13/0.73 % Starting new_bool_1 with 300s (1) cores
% 2.13/0.73 % Starting sh5l with 300s (1) cores
% 2.13/0.73 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 605170 completed with status 0
% 2.13/0.73 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.13/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.13/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.13/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.13/0.73 % No SInE strategy applied
% 2.13/0.73 % Search class: FHUSM-FFSS22-SFFFFFNN
% 2.13/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.13/0.73 % Starting SubtermCWHack with 136s (1) cores
% 2.13/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.13/0.73 % Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.13/0.73 % Starting new_bool_3 with 136s (1) cores
% 2.13/0.73 % Starting new_bool_1 with 136s (1) cores
% 2.13/0.73 % G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 605176 completed with status 0
% 2.13/0.73 % Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 2.13/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.13/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.13/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.13/0.73 % No SInE strategy applied
% 2.13/0.73 % Search class: FHUSM-FFSS22-SFFFFFNN
% 2.13/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.13/0.73 % Starting SubtermCWHack with 136s (1) cores
% 2.13/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.13/0.73 % Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.13/0.73 % Preprocessing time : 0.001 s
% 2.13/0.73 % Presaturation interreduction done
% 2.13/0.73
% 2.13/0.73 % Proof found!
% 2.13/0.73 % SZS status Unsatisfiable
% 2.13/0.73 % SZS output start CNFRefutation
% See solution above
% 2.13/0.73 % Parsed axioms : 18
% 2.13/0.73 % Removed by relevancy pruning/SinE : 0
% 2.13/0.73 % Initial clauses : 18
% 2.13/0.73 % Removed in clause preprocessing : 0
% 2.13/0.73 % Initial clauses in saturation : 18
% 2.13/0.73 % Processed clauses : 7517
% 2.13/0.73 % ...of these trivial : 15
% 2.13/0.73 % ...subsumed : 6417
% 2.13/0.73 % ...remaining for further processing : 1085
% 2.13/0.73 % Other redundant clauses eliminated : 0
% 2.13/0.73 % Clauses deleted for lack of memory : 0
% 2.13/0.73 % Backward-subsumed : 316
% 2.13/0.73 % Backward-rewritten : 3
% 2.13/0.73 % Generated clauses : 34235
% 2.13/0.73 % ...of the previous two non-redundant : 25998
% 2.13/0.73 % ...aggressively subsumed : 0
% 2.13/0.73 % Contextual simplify-reflections : 22
% 2.13/0.73 % Paramodulations : 34235
% 2.13/0.73 % Factorizations : 0
% 2.13/0.73 % NegExts : 0
% 2.13/0.73 % Equation resolutions : 0
% 2.13/0.73 % Disequality decompositions : 0
% 2.13/0.73 % Total rewrite steps : 20796
% 2.13/0.73 % ...of those cached : 20264
% 2.13/0.73 % Propositional unsat checks : 0
% 2.13/0.73 % Propositional check models : 0
% 2.13/0.73 % Propositional check unsatisfiable : 0
% 2.13/0.73 % Propositional clauses : 0
% 2.13/0.73 % Propositional clauses after purity: 0
% 2.13/0.73 % Propositional unsat core size : 0
% 2.13/0.73 % Propositional preprocessing time : 0.000
% 2.13/0.73 % Propositional encoding time : 0.000
% 2.13/0.73 % Propositional solver time : 0.000
% 2.13/0.73 % Success case prop preproc time : 0.000
% 2.13/0.73 % Success case prop encoding time : 0.000
% 2.13/0.73 % Success case prop solver time : 0.000
% 2.13/0.73 % Current number of processed clauses : 748
% 2.13/0.73 % Positive orientable unit clauses : 66
% 2.13/0.73 % Positive unorientable unit clauses: 0
% 2.13/0.73 % Negative unit clauses : 60
% 2.13/0.73 % Non-unit-clauses : 622
% 2.13/0.73 % Current number of unprocessed clauses: 18130
% 2.13/0.73 % ...number of literals in the above : 62174
% 2.13/0.73 % Current number of archived formulas : 0
% 2.13/0.73 % Current number of archived clauses : 337
% 2.13/0.73 % Clause-clause subsumption calls (NU) : 157754
% 2.13/0.73 % Rec. Clause-clause subsumption calls : 86996
% 2.13/0.73 % Non-unit clause-clause subsumptions : 4042
% 2.13/0.73 % Unit Clause-clause subsumption calls : 18035
% 2.13/0.73 % Rewrite failures with RHS unbound : 0
% 2.13/0.73 % BW rewrite match attempts : 229
% 2.13/0.73 % BW rewrite match successes : 3
% 2.13/0.73 % Condensation attempts : 0
% 2.13/0.73 % Condensation successes : 0
% 2.13/0.73 % Termbank termtop insertions : 359417
% 2.13/0.73 % Search garbage collected termcells : 34
% 2.13/0.73
% 2.13/0.73 % -------------------------------------------------
% 2.13/0.73 % User time : 0.281 s
% 2.13/0.73 % System time : 0.010 s
% 2.13/0.73 % Total time : 0.291 s
% 2.13/0.73 % Maximum resident set size: 3644 pages
% 2.13/0.73
% 2.13/0.73 % -------------------------------------------------
% 2.13/0.73 % User time : 1.305 s
% 2.13/0.73 % System time : 0.045 s
% 2.13/0.73 % Total time : 1.350 s
% 2.13/0.73 % Maximum resident set size: 4864 pages
% 2.13/0.73 % E exiting
%------------------------------------------------------------------------------