0.03/0.15	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.15	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.13/0.36	% Computer   : n027.cluster.edu
0.13/0.36	% Model      : x86_64 x86_64
0.13/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.36	% Memory     : 8042.1875MB
0.13/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.36	% CPULimit   : 180
0.13/0.36	% DateTime   : Thu Aug 29 09:20:09 EDT 2019
0.13/0.37	% CPUTime    : 
0.13/0.37	# Version: 2.4_pre003
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Trying AutoSched0 for 90 seconds
0.20/0.40	# AutoSched0-Mode selected heuristic G_E___208_C09_12_F1_SE_CS_SP_PS_S070I
0.20/0.40	# and selection function SelectVGNonCR.
0.20/0.40	#
0.20/0.40	# Preprocessing time       : 0.028 s
0.20/0.40	# Presaturation interreduction done
0.20/0.40	
0.20/0.40	# Proof found!
0.20/0.40	# SZS status Theorem
0.20/0.40	# SZS output start CNFRefutation
0.20/0.40	fof(thI18, conjecture, ![X2]:equal_set(union(X2,empty_set),X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thI18)).
0.20/0.40	fof(equal_set, axiom, ![X2, X3]:((subset(X2,X3)&subset(X3,X2))<=>equal_set(X2,X3)), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax', equal_set)).
0.20/0.40	fof(subset, axiom, ![X2, X3]:(![X1]:(member(X1,X2)=>member(X1,X3))<=>subset(X2,X3)), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax', subset)).
0.20/0.40	fof(union, axiom, ![X1, X2, X3]:((member(X1,X2)|member(X1,X3))<=>member(X1,union(X2,X3))), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax', union)).
0.20/0.40	fof(empty_set, axiom, ![X1]:~(member(X1,empty_set)), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax', empty_set)).
0.20/0.40	fof(c_0_5, negated_conjecture, ~(![X2]:equal_set(union(X2,empty_set),X2)), inference(assume_negation,[status(cth)],[thI18])).
0.20/0.40	fof(c_0_6, negated_conjecture, ~equal_set(union(esk4_0,empty_set),esk4_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.20/0.40	fof(c_0_7, plain, ![X27, X28]:((~subset(X27,X28)|~subset(X28,X27)|equal_set(X27,X28))&((subset(X27,X28)|~equal_set(X27,X28))&(subset(X28,X27)|~equal_set(X27,X28)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])).
0.20/0.40	cnf(c_0_8, negated_conjecture, (~equal_set(union(esk4_0,empty_set),esk4_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.40	cnf(c_0_9, plain, (equal_set(X1,X2)|~subset(X1,X2)|~subset(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.40	fof(c_0_10, plain, ![X12, X13, X15, X16, X17]:(((member(esk1_2(X12,X13),X12)|subset(X12,X13))&(~member(esk1_2(X12,X13),X13)|subset(X12,X13)))&(~subset(X15,X16)|(~member(X17,X15)|member(X17,X16)))), inference(distribute,[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)],[subset])])])])])])).
0.20/0.40	cnf(c_0_11, negated_conjecture, (~subset(esk4_0,union(esk4_0,empty_set))|~subset(union(esk4_0,empty_set),esk4_0)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.20/0.40	cnf(c_0_12, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.40	cnf(c_0_13, negated_conjecture, (~subset(esk4_0,union(esk4_0,empty_set))|~member(esk1_2(union(esk4_0,empty_set),esk4_0),esk4_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.20/0.40	fof(c_0_14, plain, ![X32, X33, X34]:(((~member(X32,X33)|member(X32,union(X33,X34)))&(~member(X32,X34)|member(X32,union(X33,X34))))&(~member(X32,union(X33,X34))|(member(X32,X33)|member(X32,X34)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])).
0.20/0.40	cnf(c_0_15, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.40	cnf(c_0_16, negated_conjecture, (~member(esk1_2(esk4_0,union(esk4_0,empty_set)),union(esk4_0,empty_set))|~member(esk1_2(union(esk4_0,empty_set),esk4_0),esk4_0)), inference(spm,[status(thm)],[c_0_13, c_0_12])).
0.20/0.40	cnf(c_0_17, plain, (member(X1,union(X2,X3))|~member(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.40	cnf(c_0_18, negated_conjecture, (member(esk1_2(union(esk4_0,empty_set),esk4_0),union(esk4_0,empty_set))|~subset(esk4_0,union(esk4_0,empty_set))), inference(spm,[status(thm)],[c_0_11, c_0_15])).
0.20/0.40	fof(c_0_19, plain, ![X11]:~member(X11,empty_set), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set])])).
0.20/0.40	cnf(c_0_20, negated_conjecture, (~member(esk1_2(union(esk4_0,empty_set),esk4_0),esk4_0)|~member(esk1_2(esk4_0,union(esk4_0,empty_set)),esk4_0)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.20/0.40	cnf(c_0_21, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.40	cnf(c_0_22, negated_conjecture, (member(esk1_2(union(esk4_0,empty_set),esk4_0),union(esk4_0,empty_set))|~member(esk1_2(esk4_0,union(esk4_0,empty_set)),union(esk4_0,empty_set))), inference(spm,[status(thm)],[c_0_18, c_0_12])).
0.20/0.40	cnf(c_0_23, plain, (~member(X1,empty_set)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.40	cnf(c_0_24, negated_conjecture, (~member(esk1_2(union(esk4_0,empty_set),esk4_0),esk4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_15]), c_0_20])).
0.20/0.40	cnf(c_0_25, negated_conjecture, (~member(esk1_2(esk4_0,union(esk4_0,empty_set)),union(esk4_0,empty_set))), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])).
0.20/0.40	cnf(c_0_26, negated_conjecture, (~member(esk1_2(esk4_0,union(esk4_0,empty_set)),esk4_0)), inference(spm,[status(thm)],[c_0_25, c_0_17])).
0.20/0.40	cnf(c_0_27, negated_conjecture, (member(esk1_2(union(esk4_0,empty_set),esk4_0),union(esk4_0,empty_set))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_15]), c_0_26])).
0.20/0.40	cnf(c_0_28, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_27]), c_0_23]), c_0_24]), ['proof']).
0.20/0.40	# SZS output end CNFRefutation
0.20/0.40	# Proof object total steps             : 29
0.20/0.40	# Proof object clause steps            : 18
0.20/0.40	# Proof object formula steps           : 11
0.20/0.40	# Proof object conjectures             : 15
0.20/0.40	# Proof object clause conjectures      : 12
0.20/0.40	# Proof object formula conjectures     : 3
0.20/0.40	# Proof object initial clauses used    : 7
0.20/0.40	# Proof object initial formulas used   : 5
0.20/0.40	# Proof object generating inferences   : 11
0.20/0.40	# Proof object simplifying inferences  : 6
0.20/0.40	# Training examples: 0 positive, 0 negative
0.20/0.40	# Parsed axioms                        : 12
0.20/0.40	# Removed by relevancy pruning/SinE    : 0
0.20/0.40	# Initial clauses                      : 30
0.20/0.40	# Removed in clause preprocessing      : 0
0.20/0.40	# Initial clauses in saturation        : 30
0.20/0.40	# Processed clauses                    : 89
0.20/0.40	# ...of these trivial                  : 0
0.20/0.40	# ...subsumed                          : 4
0.20/0.40	# ...remaining for further processing  : 85
0.20/0.40	# Other redundant clauses eliminated   : 3
0.20/0.40	# Clauses deleted for lack of memory   : 0
0.20/0.40	# Backward-subsumed                    : 2
0.20/0.40	# Backward-rewritten                   : 1
0.20/0.40	# Generated clauses                    : 85
0.20/0.40	# ...of the previous two non-trivial   : 75
0.20/0.40	# Contextual simplify-reflections      : 2
0.20/0.40	# Paramodulations                      : 82
0.20/0.40	# Factorizations                       : 0
0.20/0.40	# Equation resolutions                 : 3
0.20/0.40	# Propositional unsat checks           : 0
0.20/0.40	#    Propositional check models        : 0
0.20/0.40	#    Propositional check unsatisfiable : 0
0.20/0.40	#    Propositional clauses             : 0
0.20/0.40	#    Propositional clauses after purity: 0
0.20/0.40	#    Propositional unsat core size     : 0
0.20/0.40	#    Propositional preprocessing time  : 0.000
0.20/0.40	#    Propositional encoding time       : 0.000
0.20/0.40	#    Propositional solver time         : 0.000
0.20/0.40	#    Success case prop preproc time    : 0.000
0.20/0.40	#    Success case prop encoding time   : 0.000
0.20/0.40	#    Success case prop solver time     : 0.000
0.20/0.40	# Current number of processed clauses  : 49
0.20/0.40	#    Positive orientable unit clauses  : 4
0.20/0.40	#    Positive unorientable unit clauses: 0
0.20/0.40	#    Negative unit clauses             : 7
0.20/0.40	#    Non-unit-clauses                  : 38
0.20/0.40	# Current number of unprocessed clauses: 45
0.20/0.40	# ...number of literals in the above   : 115
0.20/0.40	# Current number of archived formulas  : 0
0.20/0.40	# Current number of archived clauses   : 33
0.20/0.40	# Clause-clause subsumption calls (NU) : 297
0.20/0.40	# Rec. Clause-clause subsumption calls : 280
0.20/0.40	# Non-unit clause-clause subsumptions  : 2
0.20/0.40	# Unit Clause-clause subsumption calls : 50
0.20/0.40	# Rewrite failures with RHS unbound    : 0
0.20/0.40	# BW rewrite match attempts            : 5
0.20/0.40	# BW rewrite match successes           : 1
0.20/0.40	# Condensation attempts                : 0
0.20/0.40	# Condensation successes               : 0
0.20/0.40	# Termbank termtop insertions          : 2858
0.20/0.40	
0.20/0.40	# -------------------------------------------------
0.20/0.40	# User time                : 0.031 s
0.20/0.40	# System time              : 0.005 s
0.20/0.40	# Total time               : 0.036 s
0.20/0.40	# Maximum resident set size: 1596 pages
0.20/0.40	EOF