0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.02/0.23	% Computer   : n065.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:37:54 CDT 2018
0.02/0.23	% CPUTime    : 
0.02/0.23	# Version: 2.2pre001
0.02/0.24	# No SInE strategy applied
0.02/0.24	# Trying AutoSched0 for 151 seconds
0.06/0.30	# AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
0.06/0.30	# and selection function SelectMaxLComplexAvoidPosPred.
0.06/0.30	#
0.06/0.30	# Preprocessing time       : 0.016 s
0.06/0.30	# Presaturation interreduction done
0.06/0.30	
0.06/0.30	# Proof found!
0.06/0.30	# SZS status Theorem
0.06/0.30	# SZS output start CNFRefutation
0.06/0.30	fof(d5_tarski, axiom, ![X1, X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', d5_tarski)).
0.06/0.30	fof(t69_enumset1, lemma, ![X1]:singleton(X1)=unordered_pair(X1,X1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t69_enumset1)).
0.06/0.30	fof(d4_relat_1, axiom, ![X1]:(relation(X1)=>![X2]:(![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X3,X4),X1))<=>relation_dom(X1)=X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', d4_relat_1)).
0.06/0.30	fof(d1_xboole_0, axiom, ![X1]:(empty_set=X1<=>![X2]:~(in(X2,X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', d1_xboole_0)).
0.06/0.30	fof(commutativity_k2_tarski, axiom, ![X1, X2]:unordered_pair(X2,X1)=unordered_pair(X1,X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', commutativity_k2_tarski)).
0.06/0.30	fof(d5_relat_1, axiom, ![X1]:(![X2]:(![X3]:(?[X4]:in(ordered_pair(X4,X3),X1)<=>in(X3,X2))<=>relation_rng(X1)=X2)<=relation(X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', d5_relat_1)).
0.06/0.30	fof(t60_relat_1, conjecture, (empty_set=relation_rng(empty_set)&empty_set=relation_dom(empty_set)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t60_relat_1)).
0.06/0.30	fof(fc4_relat_1, axiom, (empty(empty_set)&relation(empty_set)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fc4_relat_1)).
0.06/0.30	fof(c_0_8, plain, ![X12, X13]:ordered_pair(X12,X13)=unordered_pair(unordered_pair(X12,X13),singleton(X12)), inference(variable_rename,[status(thm)],[d5_tarski])).
0.06/0.30	fof(c_0_9, lemma, ![X299]:singleton(X299)=unordered_pair(X299,X299), inference(variable_rename,[status(thm)],[t69_enumset1])).
0.06/0.30	fof(c_0_10, plain, ![X43, X44, X46, X44, X48, X48, X50]:(((~in(esk4_2(X43,X44),X44)|~in(ordered_pair(esk4_2(X43,X44),X46),X43)|relation_dom(X43)=X44|~relation(X43))&(in(esk4_2(X43,X44),X44)|in(ordered_pair(esk4_2(X43,X44),esk5_2(X43,X44)),X43)|relation_dom(X43)=X44|~relation(X43)))&((~in(X48,X44)|in(ordered_pair(X48,esk6_3(X43,X44,X48)),X43)|relation_dom(X43)!=X44|~relation(X43))&(~in(ordered_pair(X48,X50),X43)|in(X48,X44)|relation_dom(X43)!=X44|~relation(X43)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_1])])])])])])])).
0.06/0.30	cnf(c_0_11, plain, (ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.06/0.30	cnf(c_0_12, lemma, (singleton(X1)=unordered_pair(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.06/0.30	fof(c_0_13, plain, ![X51, X52, X51]:((empty_set!=X51|~in(X52,X51))&(in(esk7_1(X51),X51)|empty_set=X51)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d1_xboole_0])])])])])])])).
0.06/0.30	cnf(c_0_14, plain, (in(ordered_pair(X1,esk6_3(X3,X2,X1)),X3)|~in(X1,X2)|relation_dom(X3)!=X2|~relation(X3)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.06/0.30	cnf(c_0_15, plain, (ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))), inference(rw,[status(thm)],[c_0_11, c_0_12])).
0.06/0.30	fof(c_0_16, plain, ![X252, X253]:unordered_pair(X253,X252)=unordered_pair(X252,X253), inference(variable_rename,[status(thm)],[commutativity_k2_tarski])).
0.06/0.30	fof(c_0_17, plain, ![X327, X328, X330, X328, X332, X333, X332]:(((~in(ordered_pair(X330,esk43_2(X327,X328)),X327)|~in(esk43_2(X327,X328),X328)|relation_rng(X327)=X328|~relation(X327))&(in(ordered_pair(esk44_2(X327,X328),esk43_2(X327,X328)),X327)|in(esk43_2(X327,X328),X328)|relation_rng(X327)=X328|~relation(X327)))&((~in(ordered_pair(X333,X332),X327)|in(X332,X328)|relation_rng(X327)!=X328|~relation(X327))&(~in(X332,X328)|in(ordered_pair(esk45_3(X327,X328,X332),X332),X327)|relation_rng(X327)!=X328|~relation(X327)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d5_relat_1])])])])])])])])).
0.06/0.30	cnf(c_0_18, plain, (empty_set!=X1|~in(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.06/0.30	cnf(c_0_19, plain, (in(unordered_pair(unordered_pair(X1,esk6_3(X3,X2,X1)),unordered_pair(X1,X1)),X3)|relation_dom(X3)!=X2|~relation(X3)|~in(X1,X2)), inference(rw,[status(thm)],[c_0_14, c_0_15])).
0.06/0.30	cnf(c_0_20, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.06/0.30	cnf(c_0_21, plain, (in(ordered_pair(esk45_3(X3,X2,X1),X1),X3)|~in(X1,X2)|relation_rng(X3)!=X2|~relation(X3)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.06/0.31	fof(c_0_22, negated_conjecture, ~((empty_set=relation_rng(empty_set)&empty_set=relation_dom(empty_set))), inference(assume_negation,[status(cth)],[t60_relat_1])).
0.06/0.31	cnf(c_0_23, plain, (~in(X1,empty_set)), inference(er,[status(thm)],[c_0_18])).
0.06/0.31	cnf(c_0_24, plain, (in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,esk6_3(X2,relation_dom(X2),X1))),X2)|~relation(X2)|~in(X1,relation_dom(X2))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])])).
0.06/0.31	cnf(c_0_25, plain, (relation(empty_set)), inference(split_conjunct,[status(thm)],[fc4_relat_1])).
0.06/0.31	cnf(c_0_26, plain, (in(unordered_pair(unordered_pair(esk45_3(X3,X2,X1),X1),unordered_pair(esk45_3(X3,X2,X1),esk45_3(X3,X2,X1))),X3)|relation_rng(X3)!=X2|~relation(X3)|~in(X1,X2)), inference(rw,[status(thm)],[c_0_21, c_0_15])).
0.06/0.31	fof(c_0_27, negated_conjecture, (empty_set!=relation_rng(empty_set)|empty_set!=relation_dom(empty_set)), inference(fof_nnf,[status(thm)],[c_0_22])).
0.06/0.31	cnf(c_0_28, plain, (~in(X1,relation_dom(empty_set))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])])).
0.06/0.31	cnf(c_0_29, plain, (in(esk7_1(X1),X1)|empty_set=X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.06/0.31	cnf(c_0_30, plain, (in(unordered_pair(unordered_pair(X1,esk45_3(X2,relation_rng(X2),X1)),unordered_pair(esk45_3(X2,relation_rng(X2),X1),esk45_3(X2,relation_rng(X2),X1))),X2)|~relation(X2)|~in(X1,relation_rng(X2))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_20])])).
0.06/0.31	cnf(c_0_31, negated_conjecture, (empty_set!=relation_rng(empty_set)|empty_set!=relation_dom(empty_set)), inference(split_conjunct,[status(thm)],[c_0_27])).
0.06/0.31	cnf(c_0_32, plain, (relation_dom(empty_set)=empty_set), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.06/0.31	cnf(c_0_33, plain, (~in(X1,relation_rng(empty_set))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_30]), c_0_25])])).
0.06/0.31	cnf(c_0_34, negated_conjecture, (relation_rng(empty_set)!=empty_set), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])])).
0.06/0.31	cnf(c_0_35, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_29]), c_0_34]), ['proof']).
0.06/0.31	# SZS output end CNFRefutation
0.06/0.31	# Proof object total steps             : 36
0.06/0.31	# Proof object clause steps            : 20
0.06/0.31	# Proof object formula steps           : 16
0.06/0.31	# Proof object conjectures             : 5
0.06/0.31	# Proof object clause conjectures      : 2
0.06/0.31	# Proof object formula conjectures     : 3
0.06/0.31	# Proof object initial clauses used    : 9
0.06/0.31	# Proof object initial formulas used   : 8
0.06/0.31	# Proof object generating inferences   : 4
0.06/0.31	# Proof object simplifying inferences  : 15
0.06/0.31	# Training examples: 0 positive, 0 negative
0.06/0.31	# Parsed axioms                        : 167
0.06/0.31	# Removed by relevancy pruning/SinE    : 0
0.06/0.31	# Initial clauses                      : 284
0.06/0.31	# Removed in clause preprocessing      : 19
0.06/0.31	# Initial clauses in saturation        : 265
0.06/0.31	# Processed clauses                    : 563
0.06/0.31	# ...of these trivial                  : 6
0.06/0.31	# ...subsumed                          : 29
0.06/0.31	# ...remaining for further processing  : 528
0.06/0.31	# Other redundant clauses eliminated   : 90
0.06/0.31	# Clauses deleted for lack of memory   : 0
0.06/0.31	# Backward-subsumed                    : 0
0.06/0.31	# Backward-rewritten                   : 8
0.06/0.31	# Generated clauses                    : 3044
0.06/0.31	# ...of the previous two non-trivial   : 2824
0.06/0.31	# Contextual simplify-reflections      : 9
0.06/0.31	# Paramodulations                      : 2941
0.06/0.31	# Factorizations                       : 14
0.06/0.31	# Equation resolutions                 : 95
0.06/0.31	# Propositional unsat checks           : 0
0.06/0.31	#    Propositional check models        : 0
0.06/0.31	#    Propositional check unsatisfiable : 0
0.06/0.31	#    Propositional clauses             : 0
0.06/0.31	#    Propositional clauses after purity: 0
0.06/0.31	#    Propositional unsat core size     : 0
0.06/0.31	# Current number of processed clauses  : 240
0.06/0.31	#    Positive orientable unit clauses  : 31
0.06/0.31	#    Positive unorientable unit clauses: 3
0.06/0.31	#    Negative unit clauses             : 12
0.06/0.31	#    Non-unit-clauses                  : 194
0.06/0.31	# Current number of unprocessed clauses: 2670
0.06/0.31	# ...number of literals in the above   : 10307
0.06/0.31	# Current number of archived formulas  : 0
0.06/0.31	# Current number of archived clauses   : 245
0.06/0.31	# Clause-clause subsumption calls (NU) : 24269
0.06/0.31	# Rec. Clause-clause subsumption calls : 12751
0.06/0.31	# Non-unit clause-clause subsumptions  : 27
0.06/0.31	# Unit Clause-clause subsumption calls : 1482
0.06/0.31	# Rewrite failures with RHS unbound    : 0
0.06/0.31	# BW rewrite match attempts            : 71
0.06/0.31	# BW rewrite match successes           : 54
0.06/0.31	# Condensation attempts                : 0
0.06/0.31	# Condensation successes               : 0
0.06/0.31	# Termbank termtop insertions          : 61746
0.06/0.31	
0.06/0.31	# -------------------------------------------------
0.06/0.31	# User time                : 0.067 s
0.06/0.31	# System time              : 0.005 s
0.06/0.31	# Total time               : 0.072 s
0.06/0.31	# Maximum resident set size: 1664 pages
0.06/0.31	EOF