0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer   : n011.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 16:51:40 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.46	Running first-order theorem proving
0.19/0.46	Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.46	# Version: 2.6
0.19/0.46	# No SInE strategy applied
0.19/0.46	# Trying AutoSched0 for 59 seconds
0.19/0.51	# AutoSched0-Mode selected heuristic G_E___107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y
0.19/0.51	# and selection function SelectMaxLComplexAvoidPosPred.
0.19/0.51	#
0.19/0.51	# Preprocessing time       : 0.033 s
0.19/0.51	# Presaturation interreduction done
0.19/0.51	
0.19/0.51	# Proof found!
0.19/0.51	# SZS status Theorem
0.19/0.51	# SZS output start CNFRefutation
0.19/0.51	fof(singleton_identified_by_element2, conjecture, ![X1, X2]:(X2=X1<=(singleton(X2)=singleton(X1)&member(X2,universal_class))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', singleton_identified_by_element2)).
0.19/0.51	fof(singleton_set_defn, axiom, ![X1]:unordered_pair(X1,X1)=singleton(X1), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', singleton_set_defn)).
0.19/0.51	fof(unordered_pair_defn, axiom, ![X4, X1, X2]:(member(X4,unordered_pair(X1,X2))<=>(member(X4,universal_class)&(X4=X1|X2=X4))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', unordered_pair_defn)).
0.19/0.51	fof(c_0_3, negated_conjecture, ~(![X1, X2]:((singleton(X2)=singleton(X1)&member(X2,universal_class))=>X2=X1)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[singleton_identified_by_element2])])).
0.19/0.51	fof(c_0_4, negated_conjecture, ((singleton(esk9_0)=singleton(esk8_0)&member(esk9_0,universal_class))&esk9_0!=esk8_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
0.19/0.51	fof(c_0_5, plain, ![X108]:unordered_pair(X108,X108)=singleton(X108), inference(variable_rename,[status(thm)],[singleton_set_defn])).
0.19/0.51	fof(c_0_6, plain, ![X185, X186, X187]:(((member(X185,universal_class)|~member(X185,unordered_pair(X186,X187)))&(X185=X186|X187=X185|~member(X185,unordered_pair(X186,X187))))&((X185!=X186|~member(X185,universal_class)|member(X185,unordered_pair(X186,X187)))&(X187!=X185|~member(X185,universal_class)|member(X185,unordered_pair(X186,X187))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])).
0.19/0.51	cnf(c_0_7, negated_conjecture, (singleton(esk9_0)=singleton(esk8_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.19/0.51	cnf(c_0_8, plain, (unordered_pair(X1,X1)=singleton(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.19/0.51	cnf(c_0_9, plain, (X1=X2|X3=X1|~member(X1,unordered_pair(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.19/0.51	cnf(c_0_10, negated_conjecture, (unordered_pair(esk9_0,esk9_0)=unordered_pair(esk8_0,esk8_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_8])).
0.19/0.51	cnf(c_0_11, plain, (member(X2,unordered_pair(X3,X1))|X1!=X2|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.19/0.51	cnf(c_0_12, negated_conjecture, (X1=esk8_0|~member(X1,unordered_pair(esk9_0,esk9_0))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.19/0.51	cnf(c_0_13, plain, (member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)), inference(er,[status(thm)],[c_0_11])).
0.19/0.51	cnf(c_0_14, negated_conjecture, (member(esk9_0,universal_class)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.19/0.51	cnf(c_0_15, negated_conjecture, (esk9_0!=esk8_0), inference(split_conjunct,[status(thm)],[c_0_4])).
0.19/0.51	cnf(c_0_16, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), c_0_15]), ['proof']).
0.19/0.51	# SZS output end CNFRefutation
0.19/0.51	# Proof object total steps             : 17
0.19/0.51	# Proof object clause steps            : 10
0.19/0.51	# Proof object formula steps           : 7
0.19/0.51	# Proof object conjectures             : 9
0.19/0.51	# Proof object clause conjectures      : 6
0.19/0.51	# Proof object formula conjectures     : 3
0.19/0.51	# Proof object initial clauses used    : 6
0.19/0.51	# Proof object initial formulas used   : 3
0.19/0.51	# Proof object generating inferences   : 2
0.19/0.51	# Proof object simplifying inferences  : 6
0.19/0.51	# Training examples: 0 positive, 0 negative
0.19/0.51	# Parsed axioms                        : 44
0.19/0.51	# Removed by relevancy pruning/SinE    : 0
0.19/0.51	# Initial clauses                      : 92
0.19/0.51	# Removed in clause preprocessing      : 8
0.19/0.51	# Initial clauses in saturation        : 84
0.19/0.51	# Processed clauses                    : 180
0.19/0.51	# ...of these trivial                  : 1
0.19/0.51	# ...subsumed                          : 4
0.19/0.51	# ...remaining for further processing  : 175
0.19/0.51	# Other redundant clauses eliminated   : 5
0.19/0.51	# Clauses deleted for lack of memory   : 0
0.19/0.51	# Backward-subsumed                    : 4
0.19/0.51	# Backward-rewritten                   : 0
0.19/0.51	# Generated clauses                    : 341
0.19/0.51	# ...of the previous two non-trivial   : 303
0.19/0.51	# Contextual simplify-reflections      : 0
0.19/0.51	# Paramodulations                      : 335
0.19/0.51	# Factorizations                       : 0
0.19/0.51	# NegExts                              : 0
0.19/0.51	# Equation resolutions                 : 6
0.19/0.51	# Propositional unsat checks           : 0
0.19/0.51	#    Propositional check models        : 0
0.19/0.51	#    Propositional check unsatisfiable : 0
0.19/0.51	#    Propositional clauses             : 0
0.19/0.51	#    Propositional clauses after purity: 0
0.19/0.51	#    Propositional unsat core size     : 0
0.19/0.51	#    Propositional preprocessing time  : 0.000
0.19/0.51	#    Propositional encoding time       : 0.000
0.19/0.51	#    Propositional solver time         : 0.000
0.19/0.51	#    Success case prop preproc time    : 0.000
0.19/0.51	#    Success case prop encoding time   : 0.000
0.19/0.51	#    Success case prop solver time     : 0.000
0.19/0.51	# Current number of processed clauses  : 84
0.19/0.51	#    Positive orientable unit clauses  : 14
0.19/0.51	#    Positive unorientable unit clauses: 0
0.19/0.51	#    Negative unit clauses             : 3
0.19/0.51	#    Non-unit-clauses                  : 67
0.19/0.51	# Current number of unprocessed clauses: 274
0.19/0.51	# ...number of literals in the above   : 721
0.19/0.51	# Current number of archived formulas  : 0
0.19/0.51	# Current number of archived clauses   : 95
0.19/0.51	# Clause-clause subsumption calls (NU) : 1817
0.19/0.51	# Rec. Clause-clause subsumption calls : 1630
0.19/0.51	# Non-unit clause-clause subsumptions  : 8
0.19/0.51	# Unit Clause-clause subsumption calls : 38
0.19/0.51	# Rewrite failures with RHS unbound    : 0
0.19/0.51	# BW rewrite match attempts            : 14
0.19/0.51	# BW rewrite match successes           : 0
0.19/0.51	# Condensation attempts                : 0
0.19/0.51	# Condensation successes               : 0
0.19/0.51	# Termbank termtop insertions          : 15174
0.19/0.51	
0.19/0.51	# -------------------------------------------------
0.19/0.51	# User time                : 0.045 s
0.19/0.51	# System time              : 0.007 s
0.19/0.51	# Total time               : 0.051 s
0.19/0.51	# Maximum resident set size: 1648 pages
0.19/0.51	EOF