0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.12/0.34 % Computer : n024.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 180 0.12/0.34 % DateTime : Thu Aug 29 09:16:05 EDT 2019 0.12/0.35 % CPUTime : 0.12/0.35 # Version: 2.4_pre003 0.12/0.35 # No SInE strategy applied 0.12/0.35 # Trying AutoSched0 for 90 seconds 0.12/0.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m 0.12/0.40 # and selection function SelectCQArNTNpEqFirst. 0.12/0.40 # 0.12/0.40 # Preprocessing time : 0.033 s 0.12/0.40 # Presaturation interreduction done 0.12/0.40 0.12/0.40 # Proof found! 0.12/0.40 # SZS status Theorem 0.12/0.40 # SZS output start CNFRefutation 0.12/0.40 fof(terminates_all_defn, axiom, ![X3, X1, X2]:(terminates(X3,X1,X2)<=>(((push=X3&backwards=X1)&~(happens(pull,X2)))|((pull=X3&forwards=X1)&~(happens(push,X2)))|((forwards=X1&happens(push,X2))&pull=X3)|((happens(push,X2)&X1=backwards)&pull=X3)|((X1=spinning&~(happens(pull,X2)))&X3=push)|((spinning=X1&~(happens(push,X2)))&pull=X3))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.12/0.40 fof(happens_terminates_not_holds, axiom, ![X3, X2, X1]:((terminates(X3,X1,X2)&happens(X3,X2))=>~(holdsAt(X1,plus(X2,n1)))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.12/0.40 fof(happens_all_defn, axiom, ![X3, X2]:(happens(X3,X2)<=>((X2=n0&push=X3)|(pull=X3&n1=X2)|(pull=X3&n2=X2)|(n2=X2&push=X3))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', happens_all_defn)). 0.12/0.40 fof(symmetry_of_plus, axiom, ![X9, X10]:plus(X10,X9)=plus(X9,X10), file('/export/starexec/sandbox/benchmark/theBenchmark.p', symmetry_of_plus)). 0.12/0.40 fof(not_spinning_1, conjecture, ~(holdsAt(spinning,n1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', not_spinning_1)). 0.12/0.40 fof(less_or_equal, axiom, ![X9, X10]:(less_or_equal(X9,X10)<=>(less(X9,X10)|X10=X9)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_or_equal)). 0.12/0.40 fof(plus0_1, axiom, plus(n0,n1)=n1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus0_1)). 0.12/0.40 fof(less2, axiom, ![X9]:(less(X9,n2)<=>less_or_equal(X9,n1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less2)). 0.12/0.40 fof(less1, axiom, ![X9]:(less(X9,n1)<=>less_or_equal(X9,n0)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less1)). 0.12/0.40 fof(less_property, axiom, ![X9, X10]:((~(less(X10,X9))&X9!=X10)<=>less(X9,X10)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_property)). 0.12/0.40 fof(push_not_pull, axiom, pull!=push, file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.12/0.40 fof(c_0_11, plain, ![X1, X2, X3]:(epred2_3(X3,X2,X1)<=>(((push=X3&backwards=X1)&~(happens(pull,X2)))|((pull=X3&forwards=X1)&~(happens(push,X2)))|((forwards=X1&happens(push,X2))&pull=X3)|((happens(push,X2)&X1=backwards)&pull=X3)|((X1=spinning&~(happens(pull,X2)))&X3=push)|((spinning=X1&~(happens(push,X2)))&pull=X3))), introduced(definition)). 0.12/0.40 fof(c_0_12, plain, ![X1, X2, X3]:(epred1_3(X3,X2,X1)<=>(((push=X3&backwards=X1)&~(happens(pull,X2)))|((pull=X3&forwards=X1)&~(happens(push,X2)))|((forwards=X1&happens(push,X2))&pull=X3))), introduced(definition)). 0.12/0.40 fof(c_0_13, plain, ![X1, X2, X3]:(epred2_3(X3,X2,X1)<=>(epred1_3(X3,X2,X1)|((happens(push,X2)&X1=backwards)&pull=X3)|((X1=spinning&~(happens(pull,X2)))&X3=push)|((spinning=X1&~(happens(push,X2)))&pull=X3))), inference(apply_def,[status(thm)],[c_0_11, c_0_12])). 0.12/0.40 fof(c_0_14, axiom, ![X3, X1, X2]:(terminates(X3,X1,X2)<=>epred2_3(X3,X2,X1)), inference(apply_def,[status(thm)],[terminates_all_defn, c_0_11])). 0.12/0.40 fof(c_0_15, plain, ![X97, X98, X99]:((((((((spinning=X97|(X97=spinning|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X97=spinning|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(X97=spinning|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(((spinning=X97|(~happens(pull,X98)|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(~happens(pull,X98)|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(~happens(pull,X98)|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))))&(((spinning=X97|(X99=push|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X99=push|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(X99=push|(happens(push,X98)|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))))&(((((spinning=X97|(X97=spinning|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X97=spinning|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(X97=spinning|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(((spinning=X97|(~happens(pull,X98)|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(~happens(pull,X98)|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(~happens(pull,X98)|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))))&(((spinning=X97|(X99=push|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X99=push|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(X99=push|(X97=backwards|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))))&(((((spinning=X97|(X97=spinning|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X97=spinning|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(X97=spinning|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(((spinning=X97|(~happens(pull,X98)|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(~happens(pull,X98)|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(~happens(pull,X98)|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))))&(((spinning=X97|(X99=push|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97))&(~happens(push,X98)|(X99=push|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))&(pull=X99|(X99=push|(pull=X99|epred1_3(X99,X98,X97)))|~epred2_3(X99,X98,X97)))))&((((~epred1_3(X99,X98,X97)|epred2_3(X99,X98,X97))&(~happens(push,X98)|X97!=backwards|pull!=X99|epred2_3(X99,X98,X97)))&(X97!=spinning|happens(pull,X98)|X99!=push|epred2_3(X99,X98,X97)))&(spinning!=X97|happens(push,X98)|pull!=X99|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.12/0.40 fof(c_0_16, plain, ![X67, X68, X69]:((~terminates(X67,X68,X69)|epred2_3(X67,X69,X68))&(~epred2_3(X67,X69,X68)|terminates(X67,X68,X69))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])). 0.12/0.40 cnf(c_0_17, plain, (happens(pull,X2)|epred2_3(X3,X2,X1)|X1!=spinning|X3!=push), inference(split_conjunct,[status(thm)],[c_0_15])). 0.12/0.40 fof(c_0_18, plain, ![X28, X29, X30]:(~terminates(X28,X30,X29)|~happens(X28,X29)|~holdsAt(X30,plus(X29,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])])). 0.12/0.40 cnf(c_0_19, plain, (terminates(X1,X3,X2)|~epred2_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.12/0.40 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.12/0.40 fof(c_0_21, plain, ![X65, X66]:((((((n2=X66|(pull=X65|(pull=X65|X66=n0))|~happens(X65,X66))&(push=X65|(pull=X65|(pull=X65|X66=n0))|~happens(X65,X66)))&((n2=X66|(n2=X66|(pull=X65|X66=n0))|~happens(X65,X66))&(push=X65|(n2=X66|(pull=X65|X66=n0))|~happens(X65,X66))))&(((n2=X66|(pull=X65|(n1=X66|X66=n0))|~happens(X65,X66))&(push=X65|(pull=X65|(n1=X66|X66=n0))|~happens(X65,X66)))&((n2=X66|(n2=X66|(n1=X66|X66=n0))|~happens(X65,X66))&(push=X65|(n2=X66|(n1=X66|X66=n0))|~happens(X65,X66)))))&((((n2=X66|(pull=X65|(pull=X65|push=X65))|~happens(X65,X66))&(push=X65|(pull=X65|(pull=X65|push=X65))|~happens(X65,X66)))&((n2=X66|(n2=X66|(pull=X65|push=X65))|~happens(X65,X66))&(push=X65|(n2=X66|(pull=X65|push=X65))|~happens(X65,X66))))&(((n2=X66|(pull=X65|(n1=X66|push=X65))|~happens(X65,X66))&(push=X65|(pull=X65|(n1=X66|push=X65))|~happens(X65,X66)))&((n2=X66|(n2=X66|(n1=X66|push=X65))|~happens(X65,X66))&(push=X65|(n2=X66|(n1=X66|push=X65))|~happens(X65,X66))))))&((((X66!=n0|push!=X65|happens(X65,X66))&(pull!=X65|n1!=X66|happens(X65,X66)))&(pull!=X65|n2!=X66|happens(X65,X66)))&(n2!=X66|push!=X65|happens(X65,X66)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])). 0.12/0.40 fof(c_0_22, plain, ![X79, X80]:plus(X80,X79)=plus(X79,X80), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.12/0.40 fof(c_0_23, negated_conjecture, ~(~(holdsAt(spinning,n1))), inference(assume_negation,[status(cth)],[not_spinning_1])). 0.12/0.40 fof(c_0_24, plain, ![X76, X77]:((~less_or_equal(X76,X77)|(less(X76,X77)|X77=X76))&((~less(X76,X77)|less_or_equal(X76,X77))&(X77!=X76|less_or_equal(X76,X77)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])). 0.12/0.40 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.12/0.40 cnf(c_0_26, plain, (terminates(push,spinning,X1)|happens(pull,X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.12/0.40 cnf(c_0_27, plain, (happens(X2,X1)|X1!=n0|push!=X2), inference(split_conjunct,[status(thm)],[c_0_21])). 0.12/0.40 cnf(c_0_28, plain, (plus(n0,n1)=n1), inference(split_conjunct,[status(thm)],[plus0_1])). 0.12/0.40 cnf(c_0_29, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.12/0.40 fof(c_0_30, negated_conjecture, holdsAt(spinning,n1), inference(fof_simplification,[status(thm)],[c_0_23])). 0.12/0.40 fof(c_0_31, plain, ![X83]:((~less(X83,n2)|less_or_equal(X83,n1))&(~less_or_equal(X83,n1)|less(X83,n2))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])). 0.12/0.40 cnf(c_0_32, plain, (less_or_equal(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_24])). 0.12/0.40 fof(c_0_33, plain, ![X84]:((~less(X84,n1)|less_or_equal(X84,n0))&(~less_or_equal(X84,n0)|less(X84,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])). 0.12/0.40 cnf(c_0_34, plain, (push=X1|n2=X2|n1=X2|push=X1|~happens(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_21])). 0.12/0.40 cnf(c_0_35, plain, (happens(pull,X1)|~happens(push,X1)|~holdsAt(spinning,plus(X1,n1))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.12/0.40 cnf(c_0_36, plain, (happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])])). 0.12/0.40 cnf(c_0_37, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_28, c_0_29])). 0.12/0.40 cnf(c_0_38, negated_conjecture, (holdsAt(spinning,n1)), inference(split_conjunct,[status(thm)],[c_0_30])). 0.12/0.40 fof(c_0_39, plain, ![X81, X82]:((less(X82,X81)|X81=X82|less(X81,X82))&((~less(X82,X81)|~less(X81,X82))&(X81!=X82|~less(X81,X82)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[less_property])])])])). 0.12/0.40 cnf(c_0_40, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_31])). 0.12/0.40 cnf(c_0_41, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_32])). 0.12/0.40 cnf(c_0_42, plain, (less(X1,n1)|~less_or_equal(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.12/0.40 cnf(c_0_43, plain, (n1=X2|push=X1|n2=X2|~happens(X1,X2)), inference(cn,[status(thm)],[c_0_34])). 0.12/0.40 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.12/0.40 cnf(c_0_45, plain, (pull!=push), inference(split_conjunct,[status(thm)],[push_not_pull])). 0.12/0.40 cnf(c_0_46, plain, (~less(X1,X2)|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_39])). 0.12/0.40 cnf(c_0_47, plain, (less(n1,n2)), inference(spm,[status(thm)],[c_0_40, c_0_41])). 0.12/0.40 cnf(c_0_48, plain, (less(n0,n1)), inference(spm,[status(thm)],[c_0_42, c_0_41])). 0.12/0.40 cnf(c_0_49, plain, (n0=n2|n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45])). 0.12/0.40 cnf(c_0_50, plain, (~less(n2,n1)), inference(spm,[status(thm)],[c_0_46, c_0_47])). 0.12/0.40 cnf(c_0_51, plain, (X1!=X2|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_39])). 0.12/0.40 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.12/0.40 cnf(c_0_53, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_51])). 0.12/0.40 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.12/0.40 # SZS output end CNFRefutation 0.12/0.40 # Proof object total steps : 55 0.12/0.40 # Proof object clause steps : 29 0.12/0.40 # Proof object formula steps : 26 0.12/0.40 # Proof object conjectures : 4 0.12/0.40 # Proof object clause conjectures : 1 0.12/0.40 # Proof object formula conjectures : 3 0.12/0.40 # Proof object initial clauses used : 14 0.12/0.40 # Proof object initial formulas used : 11 0.12/0.40 # Proof object generating inferences : 8 0.12/0.40 # Proof object simplifying inferences : 16 0.12/0.40 # Training examples: 0 positive, 0 negative 0.12/0.40 # Parsed axioms : 48 0.12/0.40 # Removed by relevancy pruning/SinE : 0 0.12/0.40 # Initial clauses : 186 0.12/0.40 # Removed in clause preprocessing : 9 0.12/0.40 # Initial clauses in saturation : 177 0.12/0.40 # Processed clauses : 530 0.12/0.40 # ...of these trivial : 2 0.12/0.40 # ...subsumed : 105 0.12/0.40 # ...remaining for further processing : 423 0.12/0.40 # Other redundant clauses eliminated : 28 0.12/0.40 # Clauses deleted for lack of memory : 0 0.12/0.40 # Backward-subsumed : 23 0.12/0.40 # Backward-rewritten : 46 0.12/0.40 # Generated clauses : 549 0.12/0.40 # ...of the previous two non-trivial : 327 0.12/0.40 # Contextual simplify-reflections : 3 0.12/0.40 # Paramodulations : 529 0.12/0.40 # Factorizations : 5 0.12/0.40 # Equation resolutions : 28 0.12/0.40 # Propositional unsat checks : 0 0.12/0.40 # Propositional check models : 0 0.12/0.40 # Propositional check unsatisfiable : 0 0.12/0.40 # Propositional clauses : 0 0.12/0.40 # Propositional clauses after purity: 0 0.12/0.40 # Propositional unsat core size : 0 0.12/0.40 # Propositional preprocessing time : 0.000 0.12/0.40 # Propositional encoding time : 0.000 0.12/0.40 # Propositional solver time : 0.000 0.12/0.40 # Success case prop preproc time : 0.000 0.12/0.40 # Success case prop encoding time : 0.000 0.12/0.40 # Success case prop solver time : 0.000 0.12/0.40 # Current number of processed clauses : 229 0.12/0.40 # Positive orientable unit clauses : 92 0.12/0.40 # Positive unorientable unit clauses: 1 0.12/0.40 # Negative unit clauses : 48 0.12/0.40 # Non-unit-clauses : 88 0.12/0.40 # Current number of unprocessed clauses: 60 0.12/0.40 # ...number of literals in the above : 173 0.12/0.40 # Current number of archived formulas : 0 0.12/0.40 # Current number of archived clauses : 179 0.12/0.40 # Clause-clause subsumption calls (NU) : 2328 0.12/0.40 # Rec. Clause-clause subsumption calls : 1438 0.12/0.40 # Non-unit clause-clause subsumptions : 82 0.12/0.40 # Unit Clause-clause subsumption calls : 1134 0.12/0.40 # Rewrite failures with RHS unbound : 0 0.12/0.40 # BW rewrite match attempts : 59 0.12/0.40 # BW rewrite match successes : 55 0.12/0.40 # Condensation attempts : 0 0.12/0.40 # Condensation successes : 0 0.12/0.40 # Termbank termtop insertions : 13394 0.12/0.40 0.12/0.40 # ------------------------------------------------- 0.12/0.40 # User time : 0.054 s 0.12/0.40 # System time : 0.003 s 0.12/0.40 # Total time : 0.057 s 0.12/0.40 # Maximum resident set size: 1640 pages 0.12/0.40 EOF