%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HEN009-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 : n001.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:48 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.55s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 38 ( 37 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 5 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(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(zero_is_smallest,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
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(prove_this,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_6,plain,
( divide(X2,X1) != zero
| divide(X1,X2) != zero
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[divide_and_equal]) ).
cnf(c_0_7,plain,
( divide(divide(X1,X2),X3) != zero
| divide(divide(X1,X3),X2) = zero ),
inference(fof_simplification,[status(thm)],[property_of_divide1]) ).
cnf(c_0_8,plain,
( divide(X2,X1) != zero
| divide(X1,X2) != zero
| X1 = X2 ),
c_0_6 ).
cnf(c_0_9,axiom,
divide(zero,X1) = zero,
zero_is_smallest ).
cnf(c_0_10,plain,
( divide(divide(X1,X2),X3) != zero
| divide(divide(X1,X3),X2) = zero ),
c_0_7 ).
cnf(c_0_11,axiom,
divide(divide(X1,X2),X1) = zero,
quotient_smaller_than_numerator ).
cnf(c_0_12,plain,
( divide(X1,X2) != zero
| divide(divide(X3,X2),divide(X3,X1)) = zero ),
inference(fof_simplification,[status(thm)],[property_of_divide2]) ).
cnf(c_0_13,plain,
( divide(X1,zero) != zero
| X1 = zero ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
divide(divide(X1,X1),X2) = zero,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( divide(X1,X2) != zero
| divide(divide(X3,X2),divide(X3,X1)) = zero ),
c_0_12 ).
cnf(c_0_16,plain,
divide(X1,X1) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_18,plain,
( divide(X2,X3) != zero
| divide(divide(X1,X2),divide(X1,X3)) != zero
| divide(X1,X2) = divide(X1,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,plain,
divide(divide(X1,divide(X1,X2)),X2) = zero,
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
c_0_17 ).
cnf(c_0_21,plain,
divide(X1,divide(X1,divide(X1,X2))) = divide(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN009-5 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.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:51:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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.55 % Version: 3.5.1
% 0.14/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.55 % Starting sh5l with 300s (1) cores
% 0.14/0.55 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1389173 completed with status 0
% 0.14/0.55 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.55 % No SInE strategy applied
% 0.14/0.55 % Search class: FHUPM-FFSF22-MFFFFFNN
% 0.14/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.55 % Starting U----_210g_05_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.55 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1389176 completed with status 0
% 0.14/0.55 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.14/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.55 % No SInE strategy applied
% 0.14/0.55 % Search class: FHUPM-FFSF22-MFFFFFNN
% 0.14/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.55 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.55 % Preprocessing time : 0.003 s
% 0.14/0.55
% 0.14/0.55 % Proof found!
% 0.14/0.55 % SZS status Unsatisfiable
% 0.14/0.55 % SZS output start CNFRefutation
% See solution above
% 0.14/0.55 % Parsed axioms : 9
% 0.14/0.55 % Removed by relevancy pruning/SinE : 0
% 0.14/0.55 % Initial clauses : 9
% 0.14/0.55 % Removed in clause preprocessing : 0
% 0.14/0.55 % Initial clauses in saturation : 9
% 0.14/0.55 % Processed clauses : 45
% 0.14/0.55 % ...of these trivial : 1
% 0.14/0.55 % ...subsumed : 15
% 0.14/0.55 % ...remaining for further processing : 29
% 0.14/0.55 % Other redundant clauses eliminated : 0
% 0.14/0.55 % Clauses deleted for lack of memory : 0
% 0.14/0.55 % Backward-subsumed : 0
% 0.14/0.55 % Backward-rewritten : 4
% 0.14/0.55 % Generated clauses : 572
% 0.14/0.55 % ...of the previous two non-redundant : 294
% 0.14/0.55 % ...aggressively subsumed : 0
% 0.14/0.55 % Contextual simplify-reflections : 0
% 0.14/0.55 % Paramodulations : 572
% 0.14/0.55 % Factorizations : 0
% 0.14/0.55 % NegExts : 0
% 0.14/0.55 % Equation resolutions : 0
% 0.14/0.55 % Disequality decompositions : 0
% 0.14/0.55 % Total rewrite steps : 426
% 0.14/0.55 % ...of those cached : 350
% 0.14/0.55 % Propositional unsat checks : 0
% 0.14/0.55 % Propositional check models : 0
% 0.14/0.55 % Propositional check unsatisfiable : 0
% 0.14/0.55 % Propositional clauses : 0
% 0.14/0.55 % Propositional clauses after purity: 0
% 0.14/0.55 % Propositional unsat core size : 0
% 0.14/0.55 % Propositional preprocessing time : 0.000
% 0.14/0.55 % Propositional encoding time : 0.000
% 0.14/0.55 % Propositional solver time : 0.000
% 0.14/0.55 % Success case prop preproc time : 0.000
% 0.14/0.55 % Success case prop encoding time : 0.000
% 0.14/0.55 % Success case prop solver time : 0.000
% 0.14/0.55 % Current number of processed clauses : 25
% 0.14/0.55 % Positive orientable unit clauses : 10
% 0.14/0.55 % Positive unorientable unit clauses: 1
% 0.14/0.55 % Negative unit clauses : 0
% 0.14/0.55 % Non-unit-clauses : 14
% 0.14/0.55 % Current number of unprocessed clauses: 242
% 0.14/0.55 % ...number of literals in the above : 508
% 0.14/0.55 % Current number of archived formulas : 0
% 0.14/0.55 % Current number of archived clauses : 4
% 0.14/0.55 % Clause-clause subsumption calls (NU) : 67
% 0.14/0.55 % Rec. Clause-clause subsumption calls : 67
% 0.14/0.55 % Non-unit clause-clause subsumptions : 11
% 0.14/0.55 % Unit Clause-clause subsumption calls : 16
% 0.14/0.55 % Rewrite failures with RHS unbound : 0
% 0.14/0.55 % BW rewrite match attempts : 86
% 0.14/0.55 % BW rewrite match successes : 8
% 0.14/0.55 % Condensation attempts : 0
% 0.14/0.55 % Condensation successes : 0
% 0.14/0.55 % Termbank termtop insertions : 5197
% 0.14/0.55 % Search garbage collected termcells : 16
% 0.14/0.55
% 0.14/0.55 % -------------------------------------------------
% 0.14/0.55 % User time : 0.014 s
% 0.14/0.55 % System time : 0.008 s
% 0.14/0.55 % Total time : 0.021 s
% 0.14/0.55 % Maximum resident set size: 3380 pages
% 0.14/0.55
% 0.14/0.55 % -------------------------------------------------
% 0.14/0.55 % User time : 0.128 s
% 0.14/0.55 % System time : 0.024 s
% 0.14/0.55 % Total time : 0.152 s
% 0.14/0.55 % Maximum resident set size: 4608 pages
% 0.14/0.55 % E exiting
%------------------------------------------------------------------------------