%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN011-5 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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:41 PM UTC 2026
% Result : Unsatisfiable 35.06s 5.51s
% Output : CNFRefutation 35.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 45 ( 33 unt; 0 nHn; 13 RR)
% Number of literals : 60 ( 59 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divide_and_equal,axiom,
( divide(X2,X1) != zero
| divide(X1,X2) != zero
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).
cnf(quotient_property,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',quotient_property) ).
cnf(identity_is_largest,axiom,
divide(X1,identity) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',identity_is_largest) ).
cnf(zero_is_smallest,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
cnf(x_divide_zero_is_x,axiom,
divide(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_zero_is_x) ).
cnf(property_of_divide1,axiom,
( divide(divide(X1,X2),X3) != zero
| divide(divide(X1,X3),X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide1) ).
cnf(x_divide_x_is_zero,axiom,
divide(X1,X1) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(quotient_smaller_than_numerator,axiom,
divide(divide(X1,X2),X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',quotient_smaller_than_numerator) ).
cnf(property_of_divide2,axiom,
( divide(X1,X2) != zero
| divide(divide(X3,X2),divide(X3,X1)) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide2) ).
cnf(one_inversion_equals_three,axiom,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_inversion_equals_three) ).
cnf(prove_this,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,plain,
( divide(X2,X1) != zero
| divide(X1,X2) != zero
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[divide_and_equal]) ).
cnf(c_0_12,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
quotient_property ).
cnf(c_0_13,axiom,
divide(X1,identity) = zero,
identity_is_largest ).
cnf(c_0_14,axiom,
divide(zero,X1) = zero,
zero_is_smallest ).
cnf(c_0_15,axiom,
divide(X1,zero) = X1,
x_divide_zero_is_x ).
cnf(c_0_16,plain,
( divide(divide(X1,X2),X3) != zero
| divide(divide(X1,X3),X2) = zero ),
inference(fof_simplification,[status(thm)],[property_of_divide1]) ).
cnf(c_0_17,plain,
( divide(X2,X1) != zero
| divide(X1,X2) != zero
| X1 = X2 ),
c_0_11 ).
cnf(c_0_18,plain,
divide(divide(X1,X2),divide(identity,X2)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).
cnf(c_0_19,axiom,
divide(X1,X1) = zero,
x_divide_x_is_zero ).
cnf(c_0_20,plain,
( divide(divide(X1,X2),X3) != zero
| divide(divide(X1,X3),X2) = zero ),
c_0_16 ).
cnf(c_0_21,plain,
( divide(divide(identity,X1),divide(X2,X1)) != zero
| divide(identity,X1) = divide(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(X1,X2)),divide(X2,divide(X1,X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_15]) ).
cnf(c_0_23,plain,
divide(divide(X1,divide(identity,X2)),X2) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_24,axiom,
divide(divide(X1,X2),X1) = zero,
quotient_smaller_than_numerator ).
cnf(c_0_25,plain,
divide(divide(divide(divide(X1,X2),divide(X3,X2)),X4),divide(divide(X1,X3),X2)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_14])]) ).
cnf(c_0_26,plain,
divide(identity,divide(identity,X1)) = divide(X1,divide(identity,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( divide(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) != zero
| divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_28,plain,
divide(divide(divide(X1,divide(identity,X2)),X3),X2) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_14])]) ).
cnf(c_0_29,plain,
divide(divide(divide(X1,X2),X3),divide(X1,X3)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_14]),c_0_15]) ).
cnf(c_0_30,plain,
( divide(X1,X2) != zero
| divide(divide(X3,X2),divide(X3,X1)) = zero ),
inference(fof_simplification,[status(thm)],[property_of_divide2]) ).
cnf(c_0_31,plain,
divide(divide(X1,divide(X1,X2)),X2) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_32,plain,
divide(divide(divide(divide(identity,X1),divide(divide(identity,X2),X1)),X3),divide(divide(X2,divide(identity,X2)),X1)) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
divide(divide(X1,divide(divide(X2,divide(identity,X3)),X4)),X3) = divide(X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15]),c_0_15]),c_0_29])]) ).
cnf(c_0_34,axiom,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
one_inversion_equals_three ).
cnf(c_0_35,plain,
( divide(X1,X2) != zero
| divide(divide(X3,X2),divide(X3,X1)) = zero ),
c_0_30 ).
cnf(c_0_36,plain,
( divide(X2,divide(X1,divide(X1,X2))) != zero
| divide(X1,divide(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_37,plain,
divide(divide(divide(identity,X1),X2),divide(divide(identity,X2),X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]),c_0_34]) ).
cnf(c_0_38,plain,
divide(divide(X1,X2),divide(X1,divide(X3,divide(X3,X2)))) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_40,plain,
divide(divide(identity,X1),X2) = divide(divide(identity,X2),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_15]),c_0_15]),c_0_37])]) ).
cnf(c_0_41,plain,
divide(X1,divide(X1,divide(X1,X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
c_0_39 ).
cnf(c_0_43,plain,
divide(divide(identity,X1),divide(identity,divide(identity,X2))) = divide(divide(identity,X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN011-5 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:46:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 35.06/5.51 % Version: 3.5.1
% 35.06/5.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 35.06/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.06/5.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.06/5.51 % Starting new_bool_3 with 300s (1) cores
% 35.06/5.51 % Starting new_bool_1 with 300s (1) cores
% 35.06/5.51 % Starting sh5l with 300s (1) cores
% 35.06/5.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1740834 completed with status 0
% 35.06/5.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 35.06/5.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 35.06/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.06/5.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.06/5.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.06/5.51 % No SInE strategy applied
% 35.06/5.51 % Search class: FHUPM-FFSF22-MFFFFFNN
% 35.06/5.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.06/5.51 % Starting SubtermCWHack with 136s (1) cores
% 35.06/5.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 35.06/5.51 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 35.06/5.51 % Starting U----_210g_05_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 35.06/5.51 % Starting new_bool_3 with 136s (1) cores
% 35.06/5.51 % new_bool_3 with pid 1740845 completed with status 0
% 35.06/5.51 % Result found by new_bool_3
% 35.06/5.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 35.06/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.06/5.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.06/5.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.06/5.51 % No SInE strategy applied
% 35.06/5.51 % Search class: FHUPM-FFSF22-MFFFFFNN
% 35.06/5.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.06/5.51 % Starting SubtermCWHack with 136s (1) cores
% 35.06/5.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 35.06/5.51 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 35.06/5.51 % Starting U----_210g_05_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 35.06/5.51 % Starting new_bool_3 with 136s (1) cores
% 35.06/5.51 % Preprocessing time : 0.001 s
% 35.06/5.51 % Presaturation interreduction done
% 35.06/5.51
% 35.06/5.51 % Proof found!
% 35.06/5.51 % SZS status Unsatisfiable
% 35.06/5.51 % SZS output start CNFRefutation
% See solution above
% 35.06/5.51 % Parsed axioms : 14
% 35.06/5.51 % Removed by relevancy pruning/SinE : 0
% 35.06/5.51 % Initial clauses : 14
% 35.06/5.51 % Removed in clause preprocessing : 0
% 35.06/5.51 % Initial clauses in saturation : 14
% 35.06/5.51 % Processed clauses : 7362
% 35.06/5.51 % ...of these trivial : 658
% 35.06/5.51 % ...subsumed : 6033
% 35.06/5.51 % ...remaining for further processing : 671
% 35.06/5.51 % Other redundant clauses eliminated : 19545
% 35.06/5.51 % Clauses deleted for lack of memory : 0
% 35.06/5.51 % Backward-subsumed : 80
% 35.06/5.51 % Backward-rewritten : 103
% 35.06/5.51 % Generated clauses : 393212
% 35.06/5.51 % ...of the previous two non-redundant : 142624
% 35.06/5.51 % ...aggressively subsumed : 0
% 35.06/5.51 % Contextual simplify-reflections : 0
% 35.06/5.51 % Paramodulations : 373667
% 35.06/5.51 % Factorizations : 0
% 35.06/5.51 % NegExts : 0
% 35.06/5.51 % Equation resolutions : 19545
% 35.06/5.51 % Disequality decompositions : 0
% 35.06/5.51 % Total rewrite steps : 970808
% 35.06/5.51 % ...of those cached : 887804
% 35.06/5.51 % Propositional unsat checks : 0
% 35.06/5.51 % Propositional check models : 0
% 35.06/5.51 % Propositional check unsatisfiable : 0
% 35.06/5.51 % Propositional clauses : 0
% 35.06/5.51 % Propositional clauses after purity: 0
% 35.06/5.51 % Propositional unsat core size : 0
% 35.06/5.51 % Propositional preprocessing time : 0.000
% 35.06/5.51 % Propositional encoding time : 0.000
% 35.06/5.51 % Propositional solver time : 0.000
% 35.06/5.51 % Success case prop preproc time : 0.000
% 35.06/5.51 % Success case prop encoding time : 0.000
% 35.06/5.51 % Success case prop solver time : 0.000
% 35.06/5.51 % Current number of processed clauses : 474
% 35.06/5.51 % Positive orientable unit clauses : 254
% 35.06/5.51 % Positive unorientable unit clauses: 2
% 35.06/5.51 % Negative unit clauses : 0
% 35.06/5.51 % Non-unit-clauses : 218
% 35.06/5.51 % Current number of unprocessed clauses: 134549
% 35.06/5.51 % ...number of literals in the above : 157740
% 35.06/5.51 % Current number of archived formulas : 0
% 35.06/5.51 % Current number of archived clauses : 197
% 35.06/5.51 % Clause-clause subsumption calls (NU) : 60252
% 35.06/5.51 % Rec. Clause-clause subsumption calls : 60252
% 35.06/5.51 % Non-unit clause-clause subsumptions : 5969
% 35.06/5.51 % Unit Clause-clause subsumption calls : 2267
% 35.06/5.51 % Rewrite failures with RHS unbound : 0
% 35.06/5.51 % BW rewrite match attempts : 11174
% 35.06/5.51 % BW rewrite match successes : 218
% 35.06/5.51 % Condensation attempts : 0
% 35.06/5.51 % Condensation successes : 0
% 35.06/5.51 % Termbank termtop insertions : 6977076
% 35.06/5.51 % Search garbage collected termcells : 17
% 35.06/5.51
% 35.06/5.51 % -------------------------------------------------
% 35.06/5.51 % User time : 4.679 s
% 35.06/5.51 % System time : 0.156 s
% 35.06/5.51 % Total time : 4.836 s
% 35.06/5.51 % Maximum resident set size: 3640 pages
% 35.06/5.51
% 35.06/5.51 % -------------------------------------------------
% 35.06/5.51 % User time : 23.979 s
% 35.06/5.51 % System time : 0.802 s
% 35.06/5.51 % Total time : 24.782 s
% 35.06/5.51 % Maximum resident set size: 4864 pages
% 35.06/5.51 % E exiting
%------------------------------------------------------------------------------