0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n018.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:03:04 EDT 2025
0.12/0.33	% CPUTime    : 
0.20/0.48	Running first-order theorem proving
0.20/0.48	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=240 /export/starexec/sandbox/benchmark/theBenchmark.p
0.55/0.53	# Version: 3.0.0
0.55/0.53	# Preprocessing class: FSLMSMSLSSSNFFN.
0.55/0.53	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.55/0.53	# Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 720s (3) cores
0.55/0.53	# Starting new_bool_3 with 480s (2) cores
0.55/0.53	# Starting new_bool_1 with 480s (2) cores
0.55/0.53	# Starting sh5l with 240s (1) cores
0.55/0.53	# sh5l with pid 14578 completed with status 0
0.55/0.53	# Result found by sh5l
0.55/0.53	# Preprocessing class: FSLMSMSLSSSNFFN.
0.55/0.53	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.55/0.53	# Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 720s (3) cores
0.55/0.53	# Starting new_bool_3 with 480s (2) cores
0.55/0.53	# Starting new_bool_1 with 480s (2) cores
0.55/0.53	# Starting sh5l with 240s (1) cores
0.55/0.53	# SinE strategy is gf500_gu_R04_F100_L20000
0.55/0.53	# Search class: FGHSF-FFLM21-MFFFFFNN
0.55/0.53	# partial match(1): FGHSF-FSLM21-MFFFFFNN
0.55/0.53	# Scheduled 11 strats onto 1 cores with 240 seconds (240 total)
0.55/0.53	# Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 22s (1) cores
0.55/0.53	# G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 14584 completed with status 0
0.55/0.53	# Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
0.55/0.53	# Preprocessing class: FSLMSMSLSSSNFFN.
0.55/0.53	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.55/0.53	# Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 720s (3) cores
0.55/0.53	# Starting new_bool_3 with 480s (2) cores
0.55/0.53	# Starting new_bool_1 with 480s (2) cores
0.55/0.53	# Starting sh5l with 240s (1) cores
0.55/0.53	# SinE strategy is gf500_gu_R04_F100_L20000
0.55/0.53	# Search class: FGHSF-FFLM21-MFFFFFNN
0.55/0.53	# partial match(1): FGHSF-FSLM21-MFFFFFNN
0.55/0.53	# Scheduled 11 strats onto 1 cores with 240 seconds (240 total)
0.55/0.53	# Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 22s (1) cores
0.55/0.53	# Preprocessing time       : 0.003 s
0.55/0.53	# Presaturation interreduction done
0.55/0.53	
0.55/0.53	# Proof found!
0.55/0.53	# SZS status Theorem
0.55/0.53	# SZS output start CNFRefutation
0.55/0.53	fof(less_entry_point_pos_pos, axiom, ![X4, X5, X6, X7]:((less(X4,X5)<=((rdn_positive_less(X6,X7)&rdn_translate(X5,rdn_pos(X7)))&rdn_translate(X4,rdn_pos(X6))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', less_entry_point_pos_pos)).
0.55/0.53	fof(something_less_n13, conjecture, ?[X4]:(less(X4,n13)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', something_less_n13)).
0.55/0.53	fof(rdn_non_zero_by_digit, axiom, ![X4]:((rdn_non_zero(rdnn(X4))<=rdn_non_zero_digit(rdnn(X4)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_non_zero_by_digit)).
0.55/0.53	fof(rdn4, axiom, rdn_translate(n4,rdn_pos(rdnn(n4))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdn4)).
0.55/0.53	fof(rdn_extra_digits_positive_less, axiom, ![X1, X2, X3]:((rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3))<=rdn_non_zero(X3))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_extra_digits_positive_less)).
0.55/0.53	fof(rdn13, axiom, rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdn13)).
0.55/0.53	fof(rdn_digit1, axiom, rdn_non_zero_digit(rdnn(n1)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_digit1)).
0.55/0.53	fof(c_0_7, plain, ![X4, X5, X6, X7]:((((rdn_positive_less(X6,X7)&rdn_translate(X5,rdn_pos(X7)))&rdn_translate(X4,rdn_pos(X6)))=>less(X4,X5))), inference(fof_simplification,[status(thm)],[less_entry_point_pos_pos])).
0.55/0.53	fof(c_0_8, plain, ![X34, X35, X36, X37]:((~rdn_positive_less(X36,X37)|~rdn_translate(X35,rdn_pos(X37))|~rdn_translate(X34,rdn_pos(X36))|less(X34,X35))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
0.55/0.53	fof(c_0_9, negated_conjecture, ~(?[X4]:(less(X4,n13))), inference(assume_negation,[status(cth)],[something_less_n13])).
0.55/0.53	fof(c_0_10, plain, ![X4]:((rdn_non_zero_digit(rdnn(X4))=>rdn_non_zero(rdnn(X4)))), inference(fof_simplification,[status(thm)],[rdn_non_zero_by_digit])).
0.55/0.53	cnf(c_0_11, plain, (less(X4,X3)|~rdn_positive_less(X1,X2)|~rdn_translate(X3,rdn_pos(X2))|~rdn_translate(X4,rdn_pos(X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.55/0.53	cnf(c_0_12, plain, (rdn_translate(n4,rdn_pos(rdnn(n4)))), inference(split_conjunct,[status(thm)],[rdn4])).
0.55/0.53	fof(c_0_13, negated_conjecture, ![X33]:(~less(X33,n13)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
0.55/0.53	fof(c_0_14, plain, ![X1, X2, X3]:((rdn_non_zero(X3)=>rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3)))), inference(fof_simplification,[status(thm)],[rdn_extra_digits_positive_less])).
0.55/0.53	fof(c_0_15, plain, ![X110]:((~rdn_non_zero_digit(rdnn(X110))|rdn_non_zero(rdnn(X110)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
0.55/0.53	cnf(c_0_16, plain, (less(n4,X1)|~rdn_positive_less(rdnn(n4),X2)|~rdn_translate(X1,rdn_pos(X2))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.55/0.53	cnf(c_0_17, plain, (rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1))))), inference(split_conjunct,[status(thm)],[rdn13])).
0.55/0.53	cnf(c_0_18, negated_conjecture, (~less(X1,n13)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.55/0.53	fof(c_0_19, plain, ![X53, X54, X55]:((~rdn_non_zero(X55)|rdn_positive_less(rdnn(X53),rdn(rdnn(X54),X55)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
0.55/0.53	cnf(c_0_20, plain, (rdn_non_zero(rdnn(X1))|~rdn_non_zero_digit(rdnn(X1))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.55/0.53	cnf(c_0_21, plain, (rdn_non_zero_digit(rdnn(n1))), inference(split_conjunct,[status(thm)],[rdn_digit1])).
0.55/0.53	cnf(c_0_22, plain, (~rdn_positive_less(rdnn(n4),rdn(rdnn(n3),rdnn(n1)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
0.55/0.53	cnf(c_0_23, plain, (rdn_positive_less(rdnn(X2),rdn(rdnn(X3),X1))|~rdn_non_zero(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.55/0.53	cnf(c_0_24, plain, (rdn_non_zero(rdnn(n1))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.55/0.53	cnf(c_0_25, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']).
0.55/0.53	# SZS output end CNFRefutation
0.55/0.53	# Parsed axioms                        : 402
0.55/0.53	# Removed by relevancy pruning/SinE    : 246
0.55/0.53	# Initial clauses                      : 160
0.55/0.53	# Removed in clause preprocessing      : 0
0.55/0.53	# Initial clauses in saturation        : 160
0.55/0.53	# Processed clauses                    : 258
0.55/0.53	# ...of these trivial                  : 0
0.55/0.53	# ...subsumed                          : 5
0.55/0.53	# ...remaining for further processing  : 253
0.55/0.53	# Other redundant clauses eliminated   : 2
0.55/0.53	# Clauses deleted for lack of memory   : 0
0.55/0.53	# Backward-subsumed                    : 0
0.55/0.53	# Backward-rewritten                   : 0
0.55/0.53	# Generated clauses                    : 90
0.55/0.53	# ...of the previous two non-redundant : 84
0.55/0.53	# ...aggressively subsumed             : 0
0.55/0.53	# Contextual simplify-reflections      : 0
0.55/0.53	# Paramodulations                      : 86
0.55/0.53	# Factorizations                       : 2
0.55/0.53	# NegExts                              : 0
0.55/0.53	# Equation resolutions                 : 2
0.55/0.53	# Disequality decompositions           : 0
0.55/0.53	# Total rewrite steps                  : 3
0.55/0.53	# ...of those cached                   : 0
0.55/0.53	# Propositional unsat checks           : 0
0.55/0.53	#    Propositional check models        : 0
0.55/0.53	#    Propositional check unsatisfiable : 0
0.55/0.53	#    Propositional clauses             : 0
0.55/0.53	#    Propositional clauses after purity: 0
0.55/0.53	#    Propositional unsat core size     : 0
0.55/0.53	#    Propositional preprocessing time  : 0.000
0.55/0.53	#    Propositional encoding time       : 0.000
0.55/0.53	#    Propositional solver time         : 0.000
0.55/0.53	#    Success case prop preproc time    : 0.000
0.55/0.53	#    Success case prop encoding time   : 0.000
0.55/0.53	#    Success case prop solver time     : 0.000
0.55/0.53	# Current number of processed clauses  : 91
0.55/0.53	#    Positive orientable unit clauses  : 55
0.55/0.53	#    Positive unorientable unit clauses: 0
0.55/0.53	#    Negative unit clauses             : 5
0.55/0.53	#    Non-unit-clauses                  : 31
0.55/0.53	# Current number of unprocessed clauses: 146
0.55/0.53	# ...number of literals in the above   : 247
0.55/0.53	# Current number of archived formulas  : 0
0.55/0.53	# Current number of archived clauses   : 160
0.55/0.53	# Clause-clause subsumption calls (NU) : 576
0.55/0.53	# Rec. Clause-clause subsumption calls : 314
0.55/0.53	# Non-unit clause-clause subsumptions  : 4
0.55/0.53	# Unit Clause-clause subsumption calls : 16
0.55/0.53	# Rewrite failures with RHS unbound    : 0
0.55/0.53	# BW rewrite match attempts            : 0
0.55/0.53	# BW rewrite match successes           : 0
0.55/0.53	# Condensation attempts                : 0
0.55/0.53	# Condensation successes               : 0
0.55/0.53	# Termbank termtop insertions          : 13105
0.55/0.53	# Search garbage collected termcells   : 1865
0.55/0.53	
0.55/0.53	# -------------------------------------------------
0.55/0.53	# User time                : 0.018 s
0.55/0.53	# System time              : 0.007 s
0.55/0.53	# Total time               : 0.024 s
0.55/0.53	# Maximum resident set size: 2816 pages
0.55/0.53	
0.55/0.53	# -------------------------------------------------
0.55/0.53	# User time                : 0.024 s
0.55/0.53	# System time              : 0.010 s
0.55/0.53	# Total time               : 0.034 s
0.55/0.53	# Maximum resident set size: 2084 pages
0.55/0.53	% E exiting
0.55/0.53	% E exiting
0.55/0.53	EOF