0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.09/0.30 % Computer : n015.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Thu Jul 2 07:16:30 EDT 2020 0.09/0.30 % CPUTime : 0.09/0.30 # Version: 2.5pre002 0.09/0.30 # No SInE strategy applied 0.09/0.30 # Trying AutoSched0 for 59 seconds 0.14/0.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m 0.14/0.35 # and selection function SelectCQArNTNpEqFirst. 0.14/0.35 # 0.14/0.35 # Preprocessing time : 0.032 s 0.14/0.35 # Presaturation interreduction done 0.14/0.35 0.14/0.35 # Proof found! 0.14/0.35 # SZS status Theorem 0.14/0.35 # SZS output start CNFRefutation 0.14/0.35 fof(terminates_all_defn, axiom, ![X4, X3, X5]:(terminates(X4,X3,X5)<=>(((X3=backwards&~(happens(pull,X5)))&push=X4)|((~(happens(push,X5))&forwards=X3)&pull=X4)|((happens(push,X5)&X4=pull)&forwards=X3)|((pull=X4&happens(push,X5))&X3=backwards)|((~(happens(pull,X5))&X3=spinning)&X4=push)|((X3=spinning&~(happens(push,X5)))&X4=pull))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.14/0.35 fof(happens_terminates_not_holds, axiom, ![X4, X5, X3]:(~(holdsAt(X3,plus(X5,n1)))<=(terminates(X4,X3,X5)&happens(X4,X5))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.14/0.35 fof(happens_all_defn, axiom, ![X4, X5]:(((X5=n0&X4=push)|(X5=n2&push=X4)|(pull=X4&X5=n2)|(n1=X5&pull=X4))<=>happens(X4,X5)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', happens_all_defn)). 0.14/0.35 fof(symmetry_of_plus, axiom, ![X9, X10]:plus(X10,X9)=plus(X9,X10), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', symmetry_of_plus)). 0.14/0.35 fof(not_spinning_1, conjecture, ~(holdsAt(spinning,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not_spinning_1)). 0.14/0.35 fof(less_or_equal, axiom, ![X9, X10]:(less_or_equal(X9,X10)<=>(X10=X9|less(X9,X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less_or_equal)). 0.14/0.35 fof(plus0_1, axiom, plus(n0,n1)=n1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus0_1)). 0.14/0.35 fof(less2, axiom, ![X9]:(less(X9,n2)<=>less_or_equal(X9,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less2)). 0.14/0.35 fof(less1, axiom, ![X9]:(less_or_equal(X9,n0)<=>less(X9,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less1)). 0.14/0.35 fof(less_property, axiom, ![X9, X10]:((X10!=X9&~(less(X10,X9)))<=>less(X9,X10)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less_property)). 0.14/0.35 fof(push_not_pull, axiom, push!=pull, file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.14/0.35 fof(c_0_11, plain, ![X3, X5, X4]:(epred2_3(X4,X5,X3)<=>(((X3=backwards&~(happens(pull,X5)))&push=X4)|((~(happens(push,X5))&forwards=X3)&pull=X4)|((happens(push,X5)&X4=pull)&forwards=X3)|((pull=X4&happens(push,X5))&X3=backwards)|((~(happens(pull,X5))&X3=spinning)&X4=push)|((X3=spinning&~(happens(push,X5)))&X4=pull))), introduced(definition)). 0.14/0.35 fof(c_0_12, plain, ![X5, X4, X3]:(epred1_3(X3,X4,X5)<=>(((X3=backwards&~(happens(pull,X5)))&push=X4)|((~(happens(push,X5))&forwards=X3)&pull=X4)|((happens(push,X5)&X4=pull)&forwards=X3))), introduced(definition)). 0.14/0.35 fof(c_0_13, plain, ![X3, X5, X4]:(epred2_3(X4,X5,X3)<=>(epred1_3(X3,X4,X5)|((pull=X4&happens(push,X5))&X3=backwards)|((~(happens(pull,X5))&X3=spinning)&X4=push)|((X3=spinning&~(happens(push,X5)))&X4=pull))), inference(apply_def,[status(thm)],[c_0_11, c_0_12])). 0.14/0.35 fof(c_0_14, axiom, ![X4, X3, X5]:(terminates(X4,X3,X5)<=>epred2_3(X4,X5,X3)), inference(apply_def,[status(thm)],[terminates_all_defn, c_0_11])). 0.14/0.35 fof(c_0_15, plain, ![X97, X98, X99]:((((((((X97=spinning|(~happens(pull,X98)|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(~happens(pull,X98)|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(~happens(pull,X98)|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(((X97=spinning|(X97=spinning|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X97=spinning|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(X97=spinning|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))))&(((X97=spinning|(X99=push|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X99=push|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(X99=push|(pull=X99|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))))&(((((X97=spinning|(~happens(pull,X98)|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(~happens(pull,X98)|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(~happens(pull,X98)|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(((X97=spinning|(X97=spinning|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X97=spinning|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(X97=spinning|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))))&(((X97=spinning|(X99=push|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X99=push|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(X99=push|(happens(push,X98)|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))))&(((((X97=spinning|(~happens(pull,X98)|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(~happens(pull,X98)|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(~happens(pull,X98)|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(((X97=spinning|(X97=spinning|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X97=spinning|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(X97=spinning|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))))&(((X97=spinning|(X99=push|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X99=push|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))&(X99=pull|(X99=push|(X97=backwards|epred1_3(X97,X99,X98)))|~epred2_3(X99,X98,X97)))))&((((~epred1_3(X97,X99,X98)|epred2_3(X99,X98,X97))&(pull!=X99|~happens(push,X98)|X97!=backwards|epred2_3(X99,X98,X97)))&(happens(pull,X98)|X97!=spinning|X99!=push|epred2_3(X99,X98,X97)))&(X97!=spinning|happens(push,X98)|X99!=pull|epred2_3(X99,X98,X97)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_13])])])])). 0.14/0.35 fof(c_0_16, plain, ![X65, X66, X67]:((~terminates(X65,X66,X67)|epred2_3(X65,X67,X66))&(~epred2_3(X65,X67,X66)|terminates(X65,X66,X67))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])). 0.14/0.35 cnf(c_0_17, plain, (happens(pull,X1)|epred2_3(X3,X1,X2)|X2!=spinning|X3!=push), inference(split_conjunct,[status(thm)],[c_0_15])). 0.14/0.35 fof(c_0_18, plain, ![X32, X33, X34]:(~terminates(X32,X34,X33)|~happens(X32,X33)|~holdsAt(X34,plus(X33,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])])). 0.14/0.35 cnf(c_0_19, plain, (terminates(X1,X3,X2)|~epred2_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.14/0.35 cnf(c_0_20, plain, (epred2_3(push,X1,spinning)|happens(pull,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])). 0.14/0.35 fof(c_0_21, plain, ![X71, X72]:(((((X72!=n0|X71!=push|happens(X71,X72))&(X72!=n2|push!=X71|happens(X71,X72)))&(pull!=X71|X72!=n2|happens(X71,X72)))&(n1!=X72|pull!=X71|happens(X71,X72)))&(((((n1=X72|(pull=X71|(X72=n2|X72=n0))|~happens(X71,X72))&(pull=X71|(pull=X71|(X72=n2|X72=n0))|~happens(X71,X72)))&((n1=X72|(X72=n2|(X72=n2|X72=n0))|~happens(X71,X72))&(pull=X71|(X72=n2|(X72=n2|X72=n0))|~happens(X71,X72))))&(((n1=X72|(pull=X71|(push=X71|X72=n0))|~happens(X71,X72))&(pull=X71|(pull=X71|(push=X71|X72=n0))|~happens(X71,X72)))&((n1=X72|(X72=n2|(push=X71|X72=n0))|~happens(X71,X72))&(pull=X71|(X72=n2|(push=X71|X72=n0))|~happens(X71,X72)))))&((((n1=X72|(pull=X71|(X72=n2|X71=push))|~happens(X71,X72))&(pull=X71|(pull=X71|(X72=n2|X71=push))|~happens(X71,X72)))&((n1=X72|(X72=n2|(X72=n2|X71=push))|~happens(X71,X72))&(pull=X71|(X72=n2|(X72=n2|X71=push))|~happens(X71,X72))))&(((n1=X72|(pull=X71|(push=X71|X71=push))|~happens(X71,X72))&(pull=X71|(pull=X71|(push=X71|X71=push))|~happens(X71,X72)))&((n1=X72|(X72=n2|(push=X71|X71=push))|~happens(X71,X72))&(pull=X71|(X72=n2|(push=X71|X71=push))|~happens(X71,X72))))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])). 0.14/0.35 fof(c_0_22, plain, ![X79, X80]:plus(X80,X79)=plus(X79,X80), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.14/0.35 fof(c_0_23, negated_conjecture, ~(~(holdsAt(spinning,n1))), inference(assume_negation,[status(cth)],[not_spinning_1])). 0.14/0.35 fof(c_0_24, plain, ![X89, X90]:((~less_or_equal(X89,X90)|(X90=X89|less(X89,X90)))&((X90!=X89|less_or_equal(X89,X90))&(~less(X89,X90)|less_or_equal(X89,X90)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])). 0.14/0.35 cnf(c_0_25, plain, (~terminates(X1,X2,X3)|~happens(X1,X3)|~holdsAt(X2,plus(X3,n1))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.14/0.35 cnf(c_0_26, plain, (terminates(push,spinning,X1)|happens(pull,X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.14/0.35 cnf(c_0_27, plain, (happens(X2,X1)|X1!=n0|X2!=push), inference(split_conjunct,[status(thm)],[c_0_21])). 0.14/0.35 cnf(c_0_28, plain, (plus(n0,n1)=n1), inference(split_conjunct,[status(thm)],[plus0_1])). 0.14/0.35 cnf(c_0_29, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.14/0.35 fof(c_0_30, negated_conjecture, holdsAt(spinning,n1), inference(fof_simplification,[status(thm)],[c_0_23])). 0.14/0.35 fof(c_0_31, plain, ![X82]:((~less(X82,n2)|less_or_equal(X82,n1))&(~less_or_equal(X82,n1)|less(X82,n2))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])). 0.14/0.35 cnf(c_0_32, plain, (less_or_equal(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.35 fof(c_0_33, plain, ![X78]:((~less_or_equal(X78,n0)|less(X78,n1))&(~less(X78,n1)|less_or_equal(X78,n0))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])). 0.14/0.35 cnf(c_0_34, plain, (n1=X1|X1=n2|X1=n2|X2=push|~happens(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_21])). 0.14/0.35 cnf(c_0_35, plain, (happens(pull,X1)|~holdsAt(spinning,plus(X1,n1))|~happens(push,X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.14/0.35 cnf(c_0_36, plain, (happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])])). 0.14/0.35 cnf(c_0_37, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_28, c_0_29])). 0.14/0.35 cnf(c_0_38, negated_conjecture, (holdsAt(spinning,n1)), inference(split_conjunct,[status(thm)],[c_0_30])). 0.14/0.35 fof(c_0_39, plain, ![X76, X77]:((X77=X76|less(X77,X76)|less(X76,X77))&((X77!=X76|~less(X76,X77))&(~less(X77,X76)|~less(X76,X77)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[less_property])])])])). 0.14/0.35 cnf(c_0_40, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_31])). 0.14/0.35 cnf(c_0_41, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_32])). 0.14/0.35 cnf(c_0_42, plain, (less(X1,n1)|~less_or_equal(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.14/0.35 cnf(c_0_43, plain, (X2=push|X1=n2|n1=X1|~happens(X2,X1)), inference(cn,[status(thm)],[c_0_34])). 0.14/0.35 cnf(c_0_44, plain, (happens(pull,n0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_29]), c_0_37]), c_0_38])])). 0.14/0.35 cnf(c_0_45, plain, (push!=pull), inference(split_conjunct,[status(thm)],[push_not_pull])). 0.14/0.35 cnf(c_0_46, plain, (~less(X1,X2)|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_39])). 0.14/0.35 cnf(c_0_47, plain, (less(n1,n2)), inference(spm,[status(thm)],[c_0_40, c_0_41])). 0.14/0.35 cnf(c_0_48, plain, (less(n0,n1)), inference(spm,[status(thm)],[c_0_42, c_0_41])). 0.14/0.35 cnf(c_0_49, plain, (n0=n1|n0=n2), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45])). 0.14/0.35 cnf(c_0_50, plain, (~less(n2,n1)), inference(spm,[status(thm)],[c_0_46, c_0_47])). 0.14/0.35 cnf(c_0_51, plain, (X1!=X2|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_39])). 0.14/0.35 cnf(c_0_52, plain, (n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_50])). 0.14/0.35 cnf(c_0_53, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_51])). 0.14/0.35 cnf(c_0_54, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_48, c_0_52]), c_0_53]), ['proof']). 0.14/0.35 # SZS output end CNFRefutation 0.14/0.35 # Proof object total steps : 55 0.14/0.35 # Proof object clause steps : 29 0.14/0.35 # Proof object formula steps : 26 0.14/0.35 # Proof object conjectures : 4 0.14/0.35 # Proof object clause conjectures : 1 0.14/0.35 # Proof object formula conjectures : 3 0.14/0.35 # Proof object initial clauses used : 14 0.14/0.35 # Proof object initial formulas used : 11 0.14/0.35 # Proof object generating inferences : 8 0.14/0.35 # Proof object simplifying inferences : 16 0.14/0.35 # Training examples: 0 positive, 0 negative 0.14/0.35 # Parsed axioms : 48 0.14/0.35 # Removed by relevancy pruning/SinE : 0 0.14/0.35 # Initial clauses : 186 0.14/0.35 # Removed in clause preprocessing : 9 0.14/0.35 # Initial clauses in saturation : 177 0.14/0.35 # Processed clauses : 526 0.14/0.35 # ...of these trivial : 2 0.14/0.35 # ...subsumed : 106 0.14/0.35 # ...remaining for further processing : 418 0.14/0.35 # Other redundant clauses eliminated : 28 0.14/0.35 # Clauses deleted for lack of memory : 0 0.14/0.35 # Backward-subsumed : 22 0.14/0.35 # Backward-rewritten : 46 0.14/0.35 # Generated clauses : 541 0.14/0.35 # ...of the previous two non-trivial : 316 0.14/0.35 # Contextual simplify-reflections : 3 0.14/0.35 # Paramodulations : 521 0.14/0.35 # Factorizations : 5 0.14/0.35 # Equation resolutions : 28 0.14/0.35 # Propositional unsat checks : 0 0.14/0.35 # Propositional check models : 0 0.14/0.35 # Propositional check unsatisfiable : 0 0.14/0.35 # Propositional clauses : 0 0.14/0.35 # Propositional clauses after purity: 0 0.14/0.35 # Propositional unsat core size : 0 0.14/0.35 # Propositional preprocessing time : 0.000 0.14/0.35 # Propositional encoding time : 0.000 0.14/0.35 # Propositional solver time : 0.000 0.14/0.35 # Success case prop preproc time : 0.000 0.14/0.35 # Success case prop encoding time : 0.000 0.14/0.35 # Success case prop solver time : 0.000 0.14/0.35 # Current number of processed clauses : 225 0.14/0.35 # Positive orientable unit clauses : 92 0.14/0.35 # Positive unorientable unit clauses: 1 0.14/0.35 # Negative unit clauses : 48 0.14/0.35 # Non-unit-clauses : 84 0.14/0.35 # Current number of unprocessed clauses: 56 0.14/0.35 # ...number of literals in the above : 158 0.14/0.35 # Current number of archived formulas : 0 0.14/0.35 # Current number of archived clauses : 178 0.14/0.35 # Clause-clause subsumption calls (NU) : 2092 0.14/0.35 # Rec. Clause-clause subsumption calls : 1269 0.14/0.35 # Non-unit clause-clause subsumptions : 83 0.14/0.35 # Unit Clause-clause subsumption calls : 1281 0.14/0.35 # Rewrite failures with RHS unbound : 0 0.14/0.35 # BW rewrite match attempts : 59 0.14/0.35 # BW rewrite match successes : 55 0.14/0.35 # Condensation attempts : 0 0.14/0.35 # Condensation successes : 0 0.14/0.35 # Termbank termtop insertions : 13240 0.14/0.35 0.14/0.35 # ------------------------------------------------- 0.14/0.35 # User time : 0.049 s 0.14/0.35 # System time : 0.004 s 0.14/0.35 # Total time : 0.052 s 0.14/0.35 # Maximum resident set size: 1640 pages 0.14/0.35 EOF