0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.13/0.33	% Computer : n023.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1920
0.13/0.33	% WCLimit    : 240
0.13/0.33	% DateTime   : Wed Jul 30 02:02:19 EDT 2025
0.13/0.33	% CPUTime    : 
0.20/0.45	Running first-order theorem proving
0.20/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=240 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0.0
0.20/0.47	# Preprocessing class: FSSSSMSSSSSNFFN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.47	# Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1200s (5) cores
0.20/0.47	# Starting new_bool_3 with 240s (1) cores
0.20/0.47	# Starting new_bool_1 with 240s (1) cores
0.20/0.47	# Starting sh5l with 240s (1) cores
0.20/0.47	# G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24248 completed with status 0
0.20/0.47	# Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
0.20/0.47	# Preprocessing class: FSSSSMSSSSSNFFN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.47	# Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1200s (5) cores
0.20/0.47	# No SInE strategy applied
0.20/0.47	# Search class: FHUSF-FFSS21-SFFFFFNN
0.20/0.47	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.47	# Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 649s (1) cores
0.20/0.47	# Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 121s (1) cores
0.20/0.47	# Starting new_bool_3 with 109s (1) cores
0.20/0.47	# Starting new_bool_1 with 109s (1) cores
0.20/0.47	# Starting sh5l with 109s (1) cores
0.20/0.47	# G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24253 completed with status 0
0.20/0.47	# Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
0.20/0.47	# Preprocessing class: FSSSSMSSSSSNFFN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.47	# Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1200s (5) cores
0.20/0.47	# No SInE strategy applied
0.20/0.47	# Search class: FHUSF-FFSS21-SFFFFFNN
0.20/0.47	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.47	# Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 649s (1) cores
0.20/0.47	# Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 121s (1) cores
0.20/0.47	# Preprocessing time       : 0.001 s
0.20/0.47	
0.20/0.47	# Proof found!
0.20/0.47	# SZS status Theorem
0.20/0.47	# SZS output start CNFRefutation
0.20/0.47	fof(conjecture_1, conjecture, ![X1, X2, X3]:((((element(X1)&element(X2))&X3=times(X1,X2))=>element(X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conjecture_1)).
0.20/0.47	fof(axiom_1, axiom, ![X1, X2, X3]:(times(times(X1,X2),X3)=times(X2,times(X3,X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1)).
0.20/0.47	fof(axiom_2, axiom, ![X2]:((?[X3]:((times(X2,X2)=X3&X2=times(X2,X3)))<=>element(X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_2)).
0.20/0.47	fof(c_0_3, negated_conjecture, ~(![X1, X2, X3]:((((element(X1)&element(X2))&X3=times(X1,X2))=>element(X3)))), inference(assume_negation,[status(cth)],[conjecture_1])).
0.20/0.47	fof(c_0_4, plain, ![X7, X8, X9]:(times(times(X7,X8),X9)=times(X8,times(X9,X7))), inference(variable_rename,[status(thm)],[axiom_1])).
0.20/0.47	fof(c_0_5, negated_conjecture, (((element(esk1_0)&element(esk2_0))&esk3_0=times(esk1_0,esk2_0))&~element(esk3_0)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
0.20/0.47	cnf(c_0_6, plain, (times(times(X1,X2),X3)=times(X2,times(X3,X1))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.47	cnf(c_0_7, negated_conjecture, (esk3_0=times(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.47	fof(c_0_8, plain, ![X10, X11, X12]:(((times(X10,X10)!=X11|X10!=times(X10,X11)|element(X10))&((times(X12,X12)=esk4_1(X12)|~element(X12))&(X12=times(X12,esk4_1(X12))|~element(X12))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])])).
0.20/0.47	cnf(c_0_9, negated_conjecture, (times(esk2_0,times(X1,esk1_0))=times(esk3_0,X1)), inference(spm,[status(thm)],[c_0_6, c_0_7])).
0.20/0.47	cnf(c_0_10, plain, (X1=times(X1,esk4_1(X1))|~element(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.47	cnf(c_0_11, plain, (times(X1,X1)=esk4_1(X1)|~element(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.47	cnf(c_0_12, negated_conjecture, (times(esk1_0,times(esk2_0,times(X1,X2)))=times(X1,times(X2,esk3_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_9]), c_0_6]), c_0_6]), c_0_6])).
0.20/0.47	cnf(c_0_13, plain, (times(X1,times(X1,X1))=X1|~element(X1)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.20/0.47	cnf(c_0_14, negated_conjecture, (element(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.47	cnf(c_0_15, negated_conjecture, (times(esk2_0,times(esk2_0,esk3_0))=esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_7]), c_0_14])])).
0.20/0.47	cnf(c_0_16, negated_conjecture, (times(esk2_0,times(esk3_0,esk3_0))=times(esk1_0,esk3_0)), inference(spm,[status(thm)],[c_0_12, c_0_15])).
0.20/0.47	cnf(c_0_17, plain, (times(X1,times(X1,times(X1,X2)))=times(X1,X2)|~element(X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_13]), c_0_6]), c_0_6])).
0.20/0.47	cnf(c_0_18, negated_conjecture, (times(esk1_0,times(esk1_0,esk3_0))=times(esk3_0,times(esk3_0,esk3_0))), inference(spm,[status(thm)],[c_0_12, c_0_16])).
0.20/0.47	cnf(c_0_19, negated_conjecture, (element(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.47	cnf(c_0_20, plain, (element(X1)|times(X1,X1)!=X2|X1!=times(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.47	cnf(c_0_21, negated_conjecture, (times(esk3_0,times(esk3_0,esk3_0))=esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_7]), c_0_18]), c_0_19])])).
0.20/0.47	cnf(c_0_22, negated_conjecture, (~element(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.47	cnf(c_0_23, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), ['proof']).
0.20/0.47	# SZS output end CNFRefutation
0.20/0.47	# Parsed axioms                        : 3
0.20/0.47	# Removed by relevancy pruning/SinE    : 0
0.20/0.47	# Initial clauses                      : 8
0.20/0.47	# Removed in clause preprocessing      : 0
0.20/0.47	# Initial clauses in saturation        : 8
0.20/0.47	# Processed clauses                    : 49
0.20/0.47	# ...of these trivial                  : 2
0.20/0.47	# ...subsumed                          : 13
0.20/0.47	# ...remaining for further processing  : 34
0.20/0.47	# Other redundant clauses eliminated   : 0
0.20/0.47	# Clauses deleted for lack of memory   : 0
0.20/0.47	# Backward-subsumed                    : 0
0.20/0.47	# Backward-rewritten                   : 1
0.20/0.47	# Generated clauses                    : 472
0.20/0.47	# ...of the previous two non-redundant : 437
0.20/0.47	# ...aggressively subsumed             : 0
0.20/0.47	# Contextual simplify-reflections      : 0
0.20/0.47	# Paramodulations                      : 472
0.20/0.47	# Factorizations                       : 0
0.20/0.47	# NegExts                              : 0
0.20/0.47	# Equation resolutions                 : 0
0.20/0.47	# Disequality decompositions           : 0
0.20/0.47	# Total rewrite steps                  : 5548
0.20/0.47	# ...of those cached                   : 3439
0.20/0.47	# Propositional unsat checks           : 0
0.20/0.47	#    Propositional check models        : 0
0.20/0.47	#    Propositional check unsatisfiable : 0
0.20/0.47	#    Propositional clauses             : 0
0.20/0.47	#    Propositional clauses after purity: 0
0.20/0.47	#    Propositional unsat core size     : 0
0.20/0.47	#    Propositional preprocessing time  : 0.000
0.20/0.47	#    Propositional encoding time       : 0.000
0.20/0.47	#    Propositional solver time         : 0.000
0.20/0.47	#    Success case prop preproc time    : 0.000
0.20/0.47	#    Success case prop encoding time   : 0.000
0.20/0.47	#    Success case prop solver time     : 0.000
0.20/0.47	# Current number of processed clauses  : 33
0.20/0.47	#    Positive orientable unit clauses  : 14
0.20/0.47	#    Positive unorientable unit clauses: 1
0.20/0.47	#    Negative unit clauses             : 3
0.20/0.47	#    Non-unit-clauses                  : 15
0.20/0.47	# Current number of unprocessed clauses: 395
0.20/0.47	# ...number of literals in the above   : 811
0.20/0.47	# Current number of archived formulas  : 0
0.20/0.47	# Current number of archived clauses   : 1
0.20/0.47	# Clause-clause subsumption calls (NU) : 55
0.20/0.47	# Rec. Clause-clause subsumption calls : 54
0.20/0.47	# Non-unit clause-clause subsumptions  : 5
0.20/0.47	# Unit Clause-clause subsumption calls : 0
0.20/0.47	# Rewrite failures with RHS unbound    : 0
0.20/0.47	# BW rewrite match attempts            : 1
0.20/0.47	# BW rewrite match successes           : 1
0.20/0.47	# Condensation attempts                : 0
0.20/0.47	# Condensation successes               : 0
0.20/0.47	# Termbank termtop insertions          : 13140
0.20/0.47	# Search garbage collected termcells   : 108
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.012 s
0.20/0.47	# System time              : 0.005 s
0.20/0.47	# Total time               : 0.016 s
0.20/0.47	# Maximum resident set size: 1680 pages
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.067 s
0.20/0.47	# System time              : 0.009 s
0.20/0.47	# Total time               : 0.076 s
0.20/0.47	# Maximum resident set size: 1696 pages
0.20/0.47	% E exiting
0.20/0.47	% E exiting
0.20/0.48	EOF