0.00/0.04	% 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.26	% Computer   : n139.star.cs.uiowa.edu
0.02/0.26	% Model      : x86_64 x86_64
0.02/0.26	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.26	% Memory     : 32218.625MB
0.02/0.26	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.26	% CPULimit   : 300
0.02/0.26	% DateTime   : Sat Jul 14 04:39:55 CDT 2018
0.02/0.26	% CPUTime    : 
0.02/0.26	# Version: 2.2pre001
0.02/0.26	# No SInE strategy applied
0.02/0.26	# Trying AutoSched0 for 151 seconds
0.02/0.29	# AutoSched0-Mode selected heuristic G_____0014_C18_F1_SE_CS_SP_S0Y
0.02/0.29	# and selection function SelectMaxLComplexAvoidPosPred.
0.02/0.29	#
0.02/0.29	# Preprocessing time       : 0.011 s
0.02/0.29	
0.02/0.29	# Proof found!
0.02/0.29	# SZS status Theorem
0.02/0.29	# SZS output start CNFRefutation
0.02/0.29	fof(initiates_all_defn, axiom, ![X3, X1, X2]:((((~(happens(push,X2))&X1=backwards)&pull=X3)|((X3=pull&spinning=X1)&happens(push,X2))|((push=X3&~(happens(pull,X2)))&forwards=X1))<=>initiates(X3,X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', initiates_all_defn)).
0.02/0.29	fof(happens_holds, axiom, ![X3, X2, X1]:((happens(X3,X2)&initiates(X3,X1,X2))=>holdsAt(X1,plus(X2,n1))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax', happens_holds)).
0.02/0.29	fof(happens_all_defn, axiom, ![X3, X2]:(happens(X3,X2)<=>((X3=pull&n2=X2)|(X2=n2&push=X3)|(n1=X2&pull=X3)|(push=X3&n0=X2))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', happens_all_defn)).
0.02/0.29	fof(backwards_2, conjecture, holdsAt(backwards,n2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', backwards_2)).
0.02/0.29	fof(less_or_equal, axiom, ![X9, X10]:(less_or_equal(X9,X10)<=>(X9=X10|less(X9,X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less_or_equal)).
0.02/0.29	fof(plus1_1, axiom, plus(n1,n1)=n2, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus1_1)).
0.02/0.29	fof(less2, axiom, ![X9]:(less_or_equal(X9,n1)<=>less(X9,n2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less2)).
0.02/0.29	fof(push_not_pull, axiom, pull!=push, file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', push_not_pull)).
0.02/0.29	fof(less_property, axiom, ![X9, X10]:((~(less(X10,X9))&X10!=X9)<=>less(X9,X10)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less_property)).
0.02/0.29	fof(plus0_0, axiom, plus(n0,n0)=n0, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus0_0)).
0.02/0.29	fof(c_0_10, plain, ![X3, X2, X1]:(epred1_3(X1,X2,X3)<=>(((~(happens(push,X2))&X1=backwards)&pull=X3)|((X3=pull&spinning=X1)&happens(push,X2))|((push=X3&~(happens(pull,X2)))&forwards=X1))), introduced(definition)).
0.02/0.29	fof(c_0_11, axiom, ![X3, X1, X2]:(epred1_3(X1,X2,X3)<=>initiates(X3,X1,X2)), inference(apply_def,[status(thm)],[initiates_all_defn, c_0_10])).
0.02/0.29	fof(c_0_12, plain, ![X35, X36, X37]:(~happens(X35,X36)|~initiates(X35,X37,X36)|holdsAt(X37,plus(X36,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_holds])])).
0.02/0.29	fof(c_0_13, plain, ![X64, X65, X66, X64, X65, X66]:((~epred1_3(X65,X66,X64)|initiates(X64,X65,X66))&(~initiates(X64,X65,X66)|epred1_3(X65,X66,X64))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])).
0.02/0.29	fof(c_0_14, plain, ![X88, X89, X90, X88, X89, X90]:((((((((push=X88|(X88=pull|~happens(push,X89))|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(X88=pull|~happens(push,X89))|~epred1_3(X90,X89,X88)))&(forwards=X90|(X88=pull|~happens(push,X89))|~epred1_3(X90,X89,X88)))&(((push=X88|(spinning=X90|~happens(push,X89))|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(spinning=X90|~happens(push,X89))|~epred1_3(X90,X89,X88)))&(forwards=X90|(spinning=X90|~happens(push,X89))|~epred1_3(X90,X89,X88))))&(((push=X88|(happens(push,X89)|~happens(push,X89))|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(happens(push,X89)|~happens(push,X89))|~epred1_3(X90,X89,X88)))&(forwards=X90|(happens(push,X89)|~happens(push,X89))|~epred1_3(X90,X89,X88))))&(((((push=X88|(X88=pull|X90=backwards)|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(X88=pull|X90=backwards)|~epred1_3(X90,X89,X88)))&(forwards=X90|(X88=pull|X90=backwards)|~epred1_3(X90,X89,X88)))&(((push=X88|(spinning=X90|X90=backwards)|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(spinning=X90|X90=backwards)|~epred1_3(X90,X89,X88)))&(forwards=X90|(spinning=X90|X90=backwards)|~epred1_3(X90,X89,X88))))&(((push=X88|(happens(push,X89)|X90=backwards)|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(happens(push,X89)|X90=backwards)|~epred1_3(X90,X89,X88)))&(forwards=X90|(happens(push,X89)|X90=backwards)|~epred1_3(X90,X89,X88)))))&(((((push=X88|(X88=pull|pull=X88)|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(X88=pull|pull=X88)|~epred1_3(X90,X89,X88)))&(forwards=X90|(X88=pull|pull=X88)|~epred1_3(X90,X89,X88)))&(((push=X88|(spinning=X90|pull=X88)|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(spinning=X90|pull=X88)|~epred1_3(X90,X89,X88)))&(forwards=X90|(spinning=X90|pull=X88)|~epred1_3(X90,X89,X88))))&(((push=X88|(happens(push,X89)|pull=X88)|~epred1_3(X90,X89,X88))&(~happens(pull,X89)|(happens(push,X89)|pull=X88)|~epred1_3(X90,X89,X88)))&(forwards=X90|(happens(push,X89)|pull=X88)|~epred1_3(X90,X89,X88)))))&(((happens(push,X89)|X90!=backwards|pull!=X88|epred1_3(X90,X89,X88))&(X88!=pull|spinning!=X90|~happens(push,X89)|epred1_3(X90,X89,X88)))&(push!=X88|happens(pull,X89)|forwards!=X90|epred1_3(X90,X89,X88)))), inference(distribute,[status(thm)],[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)],[c_0_10])])])])])])).
0.02/0.29	cnf(c_0_15, plain, (holdsAt(X3,plus(X2,n1))|~happens(X1,X2)|~initiates(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.02/0.29	cnf(c_0_16, plain, (initiates(X3,X1,X2)|~epred1_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.02/0.29	cnf(c_0_17, plain, (happens(push,X1)|epred1_3(X2,X1,X3)|X2!=backwards|pull!=X3), inference(split_conjunct,[status(thm)],[c_0_14])).
0.02/0.29	fof(c_0_18, plain, ![X62, X63, X62, X63]:((((((push=X62|(n1=X63|(X63=n2|X62=pull))|~happens(X62,X63))&(n0=X63|(n1=X63|(X63=n2|X62=pull))|~happens(X62,X63)))&((push=X62|(pull=X62|(X63=n2|X62=pull))|~happens(X62,X63))&(n0=X63|(pull=X62|(X63=n2|X62=pull))|~happens(X62,X63))))&(((push=X62|(n1=X63|(push=X62|X62=pull))|~happens(X62,X63))&(n0=X63|(n1=X63|(push=X62|X62=pull))|~happens(X62,X63)))&((push=X62|(pull=X62|(push=X62|X62=pull))|~happens(X62,X63))&(n0=X63|(pull=X62|(push=X62|X62=pull))|~happens(X62,X63)))))&((((push=X62|(n1=X63|(X63=n2|n2=X63))|~happens(X62,X63))&(n0=X63|(n1=X63|(X63=n2|n2=X63))|~happens(X62,X63)))&((push=X62|(pull=X62|(X63=n2|n2=X63))|~happens(X62,X63))&(n0=X63|(pull=X62|(X63=n2|n2=X63))|~happens(X62,X63))))&(((push=X62|(n1=X63|(push=X62|n2=X63))|~happens(X62,X63))&(n0=X63|(n1=X63|(push=X62|n2=X63))|~happens(X62,X63)))&((push=X62|(pull=X62|(push=X62|n2=X63))|~happens(X62,X63))&(n0=X63|(pull=X62|(push=X62|n2=X63))|~happens(X62,X63))))))&((((X62!=pull|n2!=X63|happens(X62,X63))&(X63!=n2|push!=X62|happens(X62,X63)))&(n1!=X63|pull!=X62|happens(X62,X63)))&(push!=X62|n0!=X63|happens(X62,X63)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])])])).
0.02/0.29	fof(c_0_19, negated_conjecture, ~(holdsAt(backwards,n2)), inference(assume_negation,[status(cth)],[backwards_2])).
0.02/0.29	cnf(c_0_20, plain, (holdsAt(X1,plus(X2,n1))|~epred1_3(X1,X2,X3)|~happens(X3,X2)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.02/0.29	cnf(c_0_21, plain, (epred1_3(backwards,X1,pull)|happens(push,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])).
0.02/0.29	cnf(c_0_22, plain, (happens(X2,X1)|n1!=X1|pull!=X2), inference(split_conjunct,[status(thm)],[c_0_18])).
0.02/0.29	fof(c_0_23, negated_conjecture, ~holdsAt(backwards,n2), inference(fof_simplification,[status(thm)],[c_0_19])).
0.02/0.29	fof(c_0_24, plain, ![X71, X72, X71, X72]:((~less_or_equal(X71,X72)|(X71=X72|less(X71,X72)))&((X71!=X72|less_or_equal(X71,X72))&(~less(X71,X72)|less_or_equal(X71,X72)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])])])).
0.02/0.29	cnf(c_0_25, plain, (n0=X1|pull=X2|X1=n2|n2=X1|~happens(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.02/0.29	cnf(c_0_26, plain, (holdsAt(backwards,plus(X1,n1))|happens(push,X1)|~happens(pull,X1)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.02/0.29	cnf(c_0_27, plain, (plus(n1,n1)=n2), inference(split_conjunct,[status(thm)],[plus1_1])).
0.02/0.29	cnf(c_0_28, plain, (happens(pull,n1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])])).
0.02/0.29	cnf(c_0_29, negated_conjecture, (~holdsAt(backwards,n2)), inference(split_conjunct,[status(thm)],[c_0_23])).
0.02/0.29	fof(c_0_30, plain, ![X81, X81]:((~less_or_equal(X81,n1)|less(X81,n2))&(~less(X81,n2)|less_or_equal(X81,n1))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])])])).
0.02/0.29	cnf(c_0_31, plain, (less_or_equal(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_24])).
0.02/0.29	cnf(c_0_32, plain, (X1=n2|n0=X1|pull=X2|~happens(X2,X1)), inference(cn,[status(thm)],[c_0_25])).
0.02/0.29	cnf(c_0_33, plain, (happens(push,n1)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])]), c_0_29])).
0.02/0.29	cnf(c_0_34, plain, (pull!=push), inference(split_conjunct,[status(thm)],[push_not_pull])).
0.02/0.29	fof(c_0_35, plain, ![X73, X74, X73, X74]:((less(X74,X73)|X74=X73|less(X73,X74))&((~less(X74,X73)|~less(X73,X74))&(X74!=X73|~less(X73,X74)))), inference(distribute,[status(thm)],[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)],[less_property])])])])])])).
0.02/0.29	cnf(c_0_36, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_30])).
0.02/0.29	cnf(c_0_37, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_31])).
0.02/0.29	cnf(c_0_38, plain, (plus(n0,n0)=n0), inference(split_conjunct,[status(thm)],[plus0_0])).
0.02/0.29	cnf(c_0_39, plain, (n2=n1|n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34])).
0.02/0.29	cnf(c_0_40, plain, (X1!=X2|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_35])).
0.02/0.29	cnf(c_0_41, plain, (less(n1,n2)), inference(spm,[status(thm)],[c_0_36, c_0_37])).
0.02/0.29	cnf(c_0_42, plain, (n2=n1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_27])])).
0.02/0.29	cnf(c_0_43, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_40])).
0.02/0.29	cnf(c_0_44, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_42]), c_0_43]), ['proof']).
0.02/0.29	# SZS output end CNFRefutation
0.02/0.29	# Proof object total steps             : 45
0.02/0.29	# Proof object clause steps            : 24
0.02/0.29	# Proof object formula steps           : 21
0.02/0.29	# Proof object conjectures             : 4
0.02/0.29	# Proof object clause conjectures      : 1
0.02/0.29	# Proof object formula conjectures     : 3
0.02/0.29	# Proof object initial clauses used    : 12
0.02/0.29	# Proof object initial formulas used   : 10
0.02/0.29	# Proof object generating inferences   : 6
0.02/0.29	# Proof object simplifying inferences  : 15
0.02/0.29	# Training examples: 0 positive, 0 negative
0.02/0.29	# Parsed axioms                        : 48
0.02/0.29	# Removed by relevancy pruning/SinE    : 0
0.02/0.29	# Initial clauses                      : 186
0.02/0.29	# Removed in clause preprocessing      : 8
0.02/0.29	# Initial clauses in saturation        : 178
0.02/0.29	# Processed clauses                    : 876
0.02/0.29	# ...of these trivial                  : 0
0.02/0.29	# ...subsumed                          : 491
0.02/0.29	# ...remaining for further processing  : 385
0.02/0.29	# Other redundant clauses eliminated   : 28
0.02/0.29	# Clauses deleted for lack of memory   : 0
0.02/0.29	# Backward-subsumed                    : 1
0.02/0.29	# Backward-rewritten                   : 82
0.02/0.29	# Generated clauses                    : 1202
0.02/0.29	# ...of the previous two non-trivial   : 1141
0.02/0.29	# Contextual simplify-reflections      : 171
0.02/0.29	# Paramodulations                      : 1185
0.02/0.29	# Factorizations                       : 2
0.02/0.29	# Equation resolutions                 : 28
0.02/0.29	# Propositional unsat checks           : 0
0.02/0.29	#    Propositional check models        : 0
0.02/0.29	#    Propositional check unsatisfiable : 0
0.02/0.29	#    Propositional clauses             : 0
0.02/0.29	#    Propositional clauses after purity: 0
0.02/0.29	#    Propositional unsat core size     : 0
0.02/0.29	# Current number of processed clauses  : 287
0.02/0.29	#    Positive orientable unit clauses  : 19
0.02/0.29	#    Positive unorientable unit clauses: 1
0.02/0.29	#    Negative unit clauses             : 86
0.02/0.29	#    Non-unit-clauses                  : 181
0.02/0.29	# Current number of unprocessed clauses: 272
0.02/0.29	# ...number of literals in the above   : 970
0.02/0.29	# Current number of archived formulas  : 0
0.02/0.29	# Current number of archived clauses   : 83
0.02/0.29	# Clause-clause subsumption calls (NU) : 13019
0.02/0.29	# Rec. Clause-clause subsumption calls : 11293
0.02/0.29	# Non-unit clause-clause subsumptions  : 384
0.02/0.29	# Unit Clause-clause subsumption calls : 6488
0.02/0.29	# Rewrite failures with RHS unbound    : 0
0.02/0.29	# BW rewrite match attempts            : 23
0.02/0.29	# BW rewrite match successes           : 23
0.02/0.29	# Condensation attempts                : 0
0.02/0.29	# Condensation successes               : 0
0.02/0.29	# Termbank termtop insertions          : 18352
0.02/0.29	
0.02/0.29	# -------------------------------------------------
0.02/0.29	# User time                : 0.029 s
0.02/0.29	# System time              : 0.004 s
0.02/0.29	# Total time               : 0.033 s
0.02/0.29	# Maximum resident set size: 1576 pages
0.02/0.30	EOF