%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN007-6 : 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 : n004.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:37 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.55s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 16 unt; 0 nHn; 29 RR)
% Number of literals : 73 ( 0 equ; 42 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 5 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(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).
cnf(divisor_existence,axiom,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(transitivity_of_less_equal,axiom,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(zQy,hypothesis,
quotient(z,y,zQy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQy) ).
cnf(prove_zQyLEzQx,negated_conjecture,
~ less_equal(zQy,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zQyLEzQx) ).
cnf(zQx,hypothesis,
quotient(z,x,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQx) ).
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(x,y),
xLEy ).
cnf(c_0_16,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_17,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_18,hypothesis,
quotient(x,y,zero),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,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_20,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
c_0_16 ).
cnf(c_0_21,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_22,hypothesis,
( ~ quotient(X4,x,X3)
| ~ quotient(X4,y,X1)
| ~ quotient(X3,y,X2)
| less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
c_0_19 ).
cnf(c_0_24,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
( ~ quotient(X3,x,X2)
| ~ quotient(X3,y,X1)
| less_equal(X1,divide(X2,y)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,hypothesis,
quotient(z,y,zQy),
zQy ).
cnf(c_0_27,negated_conjecture,
~ less_equal(zQy,zQx),
inference(fof_simplification,[status(thm)],[prove_zQyLEzQx]) ).
cnf(c_0_28,plain,
( ~ less_equal(X1,divide(X2,X3))
| less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
( ~ quotient(z,x,X1)
| less_equal(zQy,divide(X1,y)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ less_equal(zQy,zQx),
c_0_27 ).
cnf(c_0_31,hypothesis,
( ~ quotient(z,x,X1)
| less_equal(zQy,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,hypothesis,
quotient(z,x,zQx),
zQx ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN007-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n004.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Sun Sep 20 20:46:10 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.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.16/5.55 % Version: 3.5.1
% 0.16/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.55 % Starting sh5l with 300s (1) cores
% 0.16/5.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1461617 completed with status 0
% 0.16/5.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.55 % No SInE strategy applied
% 0.16/5.55 % Search class: FHUSM-FFSS22-SFFFFFNN
% 0.16/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.55 % Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/5.55 % Starting new_bool_3 with 136s (1) cores
% 0.16/5.55 % Starting new_bool_1 with 136s (1) cores
% 0.16/5.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1461623 completed with status 0
% 0.16/5.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.55 % No SInE strategy applied
% 0.16/5.55 % Search class: FHUSM-FFSS22-SFFFFFNN
% 0.16/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.55 % Preprocessing time : 0.001 s
% 0.16/5.55 % Presaturation interreduction done
% 0.16/5.55
% 0.16/5.55 % Proof found!
% 0.16/5.55 % SZS status Unsatisfiable
% 0.16/5.55 % SZS output start CNFRefutation
% See solution above
% 0.16/5.55 % Parsed axioms : 18
% 0.16/5.55 % Removed by relevancy pruning/SinE : 0
% 0.16/5.55 % Initial clauses : 18
% 0.16/5.55 % Removed in clause preprocessing : 0
% 0.16/5.55 % Initial clauses in saturation : 18
% 0.16/5.55 % Processed clauses : 1802
% 0.16/5.55 % ...of these trivial : 10
% 0.16/5.55 % ...subsumed : 1358
% 0.16/5.55 % ...remaining for further processing : 434
% 0.16/5.55 % Other redundant clauses eliminated : 0
% 0.16/5.55 % Clauses deleted for lack of memory : 0
% 0.16/5.55 % Backward-subsumed : 50
% 0.16/5.55 % Backward-rewritten : 0
% 0.16/5.55 % Generated clauses : 4618
% 0.16/5.55 % ...of the previous two non-redundant : 3414
% 0.16/5.55 % ...aggressively subsumed : 0
% 0.16/5.55 % Contextual simplify-reflections : 0
% 0.16/5.55 % Paramodulations : 4618
% 0.16/5.55 % Factorizations : 0
% 0.16/5.55 % NegExts : 0
% 0.16/5.55 % Equation resolutions : 0
% 0.16/5.55 % Disequality decompositions : 0
% 0.16/5.55 % Total rewrite steps : 2110
% 0.16/5.55 % ...of those cached : 1942
% 0.16/5.55 % Propositional unsat checks : 0
% 0.16/5.55 % Propositional check models : 0
% 0.16/5.55 % Propositional check unsatisfiable : 0
% 0.16/5.55 % Propositional clauses : 0
% 0.16/5.55 % Propositional clauses after purity: 0
% 0.16/5.55 % Propositional unsat core size : 0
% 0.16/5.55 % Propositional preprocessing time : 0.000
% 0.16/5.55 % Propositional encoding time : 0.000
% 0.16/5.55 % Propositional solver time : 0.000
% 0.16/5.55 % Success case prop preproc time : 0.000
% 0.16/5.55 % Success case prop encoding time : 0.000
% 0.16/5.55 % Success case prop solver time : 0.000
% 0.16/5.55 % Current number of processed clauses : 366
% 0.16/5.55 % Positive orientable unit clauses : 54
% 0.16/5.55 % Positive unorientable unit clauses: 0
% 0.16/5.55 % Negative unit clauses : 14
% 0.16/5.55 % Non-unit-clauses : 298
% 0.16/5.55 % Current number of unprocessed clauses: 1498
% 0.16/5.55 % ...number of literals in the above : 4757
% 0.16/5.55 % Current number of archived formulas : 0
% 0.16/5.55 % Current number of archived clauses : 68
% 0.16/5.55 % Clause-clause subsumption calls (NU) : 24354
% 0.16/5.55 % Rec. Clause-clause subsumption calls : 20829
% 0.16/5.55 % Non-unit clause-clause subsumptions : 1238
% 0.16/5.55 % Unit Clause-clause subsumption calls : 1299
% 0.16/5.55 % Rewrite failures with RHS unbound : 0
% 0.16/5.55 % BW rewrite match attempts : 83
% 0.16/5.55 % BW rewrite match successes : 0
% 0.16/5.55 % Condensation attempts : 0
% 0.16/5.55 % Condensation successes : 0
% 0.16/5.55 % Termbank termtop insertions : 42443
% 0.16/5.55 % Search garbage collected termcells : 34
% 0.16/5.55
% 0.16/5.55 % -------------------------------------------------
% 0.16/5.55 % User time : 0.089 s
% 0.16/5.55 % System time : 0.007 s
% 0.16/5.55 % Total time : 0.097 s
% 0.16/5.55 % Maximum resident set size: 3644 pages
% 0.16/5.55
% 0.16/5.55 % -------------------------------------------------
% 0.16/5.55 % User time : 0.454 s
% 0.16/5.55 % System time : 0.028 s
% 0.16/5.55 % Total time : 0.481 s
% 0.16/5.55 % Maximum resident set size: 4864 pages
% 0.16/5.55 % E exiting
%------------------------------------------------------------------------------