0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/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.10/0.30 % Computer : n012.cluster.edu 0.10/0.30 % Model : x86_64 x86_64 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.30 % Memory : 8042.1875MB 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.30 % CPULimit : 960 0.10/0.30 % WCLimit : 120 0.10/0.30 % DateTime : Thu Jul 2 07:06:51 EDT 2020 0.10/0.30 % CPUTime : 0.10/0.31 # Version: 2.5pre002 0.10/0.31 # No SInE strategy applied 0.10/0.31 # Trying AutoSched0 for 59 seconds 0.15/0.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m 0.15/0.36 # and selection function SelectCQArNTNpEqFirst. 0.15/0.36 # 0.15/0.36 # Preprocessing time : 0.032 s 0.15/0.36 # Presaturation interreduction done 0.15/0.36 0.15/0.36 # Proof found! 0.15/0.36 # SZS status Theorem 0.15/0.36 # SZS output start CNFRefutation 0.15/0.36 fof(keep_not_holding, axiom, ![X3, X5]:(~(holdsAt(X3,plus(X5,n1)))<=((~(holdsAt(X3,X5))&~(?[X4]:(happens(X4,X5)&initiates(X4,X3,X5))))&~(releasedAt(X3,plus(X5,n1))))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax', keep_not_holding)). 0.15/0.36 fof(not_releasedAt, hypothesis, ![X3, X5]:~(releasedAt(X3,X5)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not_releasedAt)). 0.15/0.36 fof(symmetry_of_plus, axiom, ![X9, X10]:plus(X9,X10)=plus(X10,X9), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', symmetry_of_plus)). 0.15/0.36 fof(plus0_1, axiom, n1=plus(n0,n1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus0_1)). 0.15/0.36 fof(not_backwards_1, conjecture, ~(holdsAt(backwards,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not_backwards_1)). 0.15/0.36 fof(initiates_all_defn, axiom, ![X4, X3, X5]:((((X4=pull&spinning=X3)&happens(push,X5))|((X3=forwards&push=X4)&~(happens(pull,X5)))|((X3=backwards&X4=pull)&~(happens(push,X5))))<=>initiates(X4,X3,X5)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', initiates_all_defn)). 0.15/0.36 fof(not_backwards_0, hypothesis, ~(holdsAt(backwards,n0)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not_backwards_0)). 0.15/0.36 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.15/0.36 fof(forwards_not_backwards, axiom, forwards!=backwards, file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', forwards_not_backwards)). 0.15/0.36 fof(spinning_not_backwards, axiom, spinning!=backwards, file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', spinning_not_backwards)). 0.15/0.36 fof(c_0_10, plain, ![X21, X22]:((happens(esk3_2(X21,X22),X22)|holdsAt(X21,X22)|releasedAt(X21,plus(X22,n1))|~holdsAt(X21,plus(X22,n1)))&(initiates(esk3_2(X21,X22),X21,X22)|holdsAt(X21,X22)|releasedAt(X21,plus(X22,n1))|~holdsAt(X21,plus(X22,n1)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[keep_not_holding])])])])])). 0.15/0.36 fof(c_0_11, hypothesis, ![X81, X82]:~releasedAt(X81,X82), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[not_releasedAt])])). 0.15/0.36 cnf(c_0_12, plain, (initiates(esk3_2(X1,X2),X1,X2)|holdsAt(X1,X2)|releasedAt(X1,plus(X2,n1))|~holdsAt(X1,plus(X2,n1))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.15/0.36 cnf(c_0_13, hypothesis, (~releasedAt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.15/0.36 fof(c_0_14, plain, ![X79, X80]:plus(X79,X80)=plus(X80,X79), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.15/0.36 fof(c_0_15, plain, ![X3, X4, X5]:(epred3_3(X5,X4,X3)<=>(((X4=pull&spinning=X3)&happens(push,X5))|((X3=forwards&push=X4)&~(happens(pull,X5)))|((X3=backwards&X4=pull)&~(happens(push,X5))))), introduced(definition)). 0.15/0.36 cnf(c_0_16, plain, (holdsAt(X1,X2)|initiates(esk3_2(X1,X2),X1,X2)|~holdsAt(X1,plus(X2,n1))), inference(sr,[status(thm)],[c_0_12, c_0_13])). 0.15/0.36 cnf(c_0_17, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.15/0.36 cnf(c_0_18, plain, (n1=plus(n0,n1)), inference(split_conjunct,[status(thm)],[plus0_1])). 0.15/0.36 fof(c_0_19, negated_conjecture, ~(~(holdsAt(backwards,n1))), inference(assume_negation,[status(cth)],[not_backwards_1])). 0.15/0.36 fof(c_0_20, axiom, ![X4, X3, X5]:(epred3_3(X5,X4,X3)<=>initiates(X4,X3,X5)), inference(apply_def,[status(thm)],[initiates_all_defn, c_0_15])). 0.15/0.36 cnf(c_0_21, plain, (holdsAt(X1,X2)|initiates(esk3_2(X1,X2),X1,X2)|~holdsAt(X1,plus(n1,X2))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.15/0.36 cnf(c_0_22, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_18, c_0_17])). 0.15/0.36 fof(c_0_23, negated_conjecture, holdsAt(backwards,n1), inference(fof_simplification,[status(thm)],[c_0_19])). 0.15/0.36 fof(c_0_24, hypothesis, ~holdsAt(backwards,n0), inference(fof_simplification,[status(thm)],[not_backwards_0])). 0.15/0.36 fof(c_0_25, plain, ![X68, X69, X70]:((~epred3_3(X70,X68,X69)|initiates(X68,X69,X70))&(~initiates(X68,X69,X70)|epred3_3(X70,X68,X69))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])). 0.15/0.36 cnf(c_0_26, plain, (holdsAt(X1,n0)|initiates(esk3_2(X1,n0),X1,n0)|~holdsAt(X1,n1)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.15/0.36 cnf(c_0_27, negated_conjecture, (holdsAt(backwards,n1)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.15/0.36 cnf(c_0_28, hypothesis, (~holdsAt(backwards,n0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.15/0.36 fof(c_0_29, 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.15/0.36 fof(c_0_30, plain, ![X100, X101, X102]:((((((((X100=backwards|(X100=forwards|X101=pull)|~epred3_3(X102,X101,X100))&(X101=pull|(X100=forwards|X101=pull)|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(X100=forwards|X101=pull)|~epred3_3(X102,X101,X100)))&(((X100=backwards|(push=X101|X101=pull)|~epred3_3(X102,X101,X100))&(X101=pull|(push=X101|X101=pull)|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(push=X101|X101=pull)|~epred3_3(X102,X101,X100))))&(((X100=backwards|(~happens(pull,X102)|X101=pull)|~epred3_3(X102,X101,X100))&(X101=pull|(~happens(pull,X102)|X101=pull)|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(~happens(pull,X102)|X101=pull)|~epred3_3(X102,X101,X100))))&(((((X100=backwards|(X100=forwards|spinning=X100)|~epred3_3(X102,X101,X100))&(X101=pull|(X100=forwards|spinning=X100)|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(X100=forwards|spinning=X100)|~epred3_3(X102,X101,X100)))&(((X100=backwards|(push=X101|spinning=X100)|~epred3_3(X102,X101,X100))&(X101=pull|(push=X101|spinning=X100)|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(push=X101|spinning=X100)|~epred3_3(X102,X101,X100))))&(((X100=backwards|(~happens(pull,X102)|spinning=X100)|~epred3_3(X102,X101,X100))&(X101=pull|(~happens(pull,X102)|spinning=X100)|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(~happens(pull,X102)|spinning=X100)|~epred3_3(X102,X101,X100)))))&(((((X100=backwards|(X100=forwards|happens(push,X102))|~epred3_3(X102,X101,X100))&(X101=pull|(X100=forwards|happens(push,X102))|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(X100=forwards|happens(push,X102))|~epred3_3(X102,X101,X100)))&(((X100=backwards|(push=X101|happens(push,X102))|~epred3_3(X102,X101,X100))&(X101=pull|(push=X101|happens(push,X102))|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(push=X101|happens(push,X102))|~epred3_3(X102,X101,X100))))&(((X100=backwards|(~happens(pull,X102)|happens(push,X102))|~epred3_3(X102,X101,X100))&(X101=pull|(~happens(pull,X102)|happens(push,X102))|~epred3_3(X102,X101,X100)))&(~happens(push,X102)|(~happens(pull,X102)|happens(push,X102))|~epred3_3(X102,X101,X100)))))&(((X101!=pull|spinning!=X100|~happens(push,X102)|epred3_3(X102,X101,X100))&(X100!=forwards|push!=X101|happens(pull,X102)|epred3_3(X102,X101,X100)))&(X100!=backwards|X101!=pull|happens(push,X102)|epred3_3(X102,X101,X100)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_15])])])])). 0.15/0.36 cnf(c_0_31, plain, (epred3_3(X3,X1,X2)|~initiates(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.15/0.36 cnf(c_0_32, negated_conjecture, (initiates(esk3_2(backwards,n0),backwards,n0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])). 0.15/0.36 cnf(c_0_33, plain, (happens(X2,X1)|X1!=n0|X2!=push), inference(split_conjunct,[status(thm)],[c_0_29])). 0.15/0.36 cnf(c_0_34, plain, (X2=forwards|spinning=X2|~happens(push,X1)|~epred3_3(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_30])). 0.15/0.36 cnf(c_0_35, negated_conjecture, (epred3_3(n0,esk3_2(backwards,n0),backwards)), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.15/0.36 cnf(c_0_36, plain, (happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])])). 0.15/0.36 cnf(c_0_37, plain, (forwards!=backwards), inference(split_conjunct,[status(thm)],[forwards_not_backwards])). 0.15/0.36 cnf(c_0_38, plain, (spinning!=backwards), inference(split_conjunct,[status(thm)],[spinning_not_backwards])). 0.15/0.36 cnf(c_0_39, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), c_0_37]), c_0_38]), ['proof']). 0.15/0.36 # SZS output end CNFRefutation 0.15/0.36 # Proof object total steps : 40 0.15/0.36 # Proof object clause steps : 19 0.15/0.36 # Proof object formula steps : 21 0.15/0.36 # Proof object conjectures : 6 0.15/0.36 # Proof object clause conjectures : 3 0.15/0.36 # Proof object formula conjectures : 3 0.15/0.36 # Proof object initial clauses used : 11 0.15/0.36 # Proof object initial formulas used : 10 0.15/0.36 # Proof object generating inferences : 5 0.15/0.36 # Proof object simplifying inferences : 9 0.15/0.36 # Training examples: 0 positive, 0 negative 0.15/0.36 # Parsed axioms : 48 0.15/0.36 # Removed by relevancy pruning/SinE : 0 0.15/0.36 # Initial clauses : 186 0.15/0.36 # Removed in clause preprocessing : 9 0.15/0.36 # Initial clauses in saturation : 177 0.15/0.36 # Processed clauses : 529 0.15/0.36 # ...of these trivial : 2 0.15/0.36 # ...subsumed : 107 0.15/0.36 # ...remaining for further processing : 420 0.15/0.36 # Other redundant clauses eliminated : 28 0.15/0.36 # Clauses deleted for lack of memory : 0 0.15/0.36 # Backward-subsumed : 24 0.15/0.36 # Backward-rewritten : 2 0.15/0.36 # Generated clauses : 526 0.15/0.36 # ...of the previous two non-trivial : 311 0.15/0.36 # Contextual simplify-reflections : 3 0.15/0.36 # Paramodulations : 507 0.15/0.36 # Factorizations : 4 0.15/0.36 # Equation resolutions : 28 0.15/0.36 # Propositional unsat checks : 0 0.15/0.36 # Propositional check models : 0 0.15/0.36 # Propositional check unsatisfiable : 0 0.15/0.36 # Propositional clauses : 0 0.15/0.36 # Propositional clauses after purity: 0 0.15/0.36 # Propositional unsat core size : 0 0.15/0.36 # Propositional preprocessing time : 0.000 0.15/0.36 # Propositional encoding time : 0.000 0.15/0.36 # Propositional solver time : 0.000 0.15/0.36 # Success case prop preproc time : 0.000 0.15/0.36 # Success case prop encoding time : 0.000 0.15/0.36 # Success case prop solver time : 0.000 0.15/0.36 # Current number of processed clauses : 269 0.15/0.36 # Positive orientable unit clauses : 121 0.15/0.36 # Positive unorientable unit clauses: 1 0.15/0.36 # Negative unit clauses : 51 0.15/0.36 # Non-unit-clauses : 96 0.15/0.36 # Current number of unprocessed clauses: 46 0.15/0.36 # ...number of literals in the above : 138 0.15/0.36 # Current number of archived formulas : 0 0.15/0.36 # Current number of archived clauses : 136 0.15/0.36 # Clause-clause subsumption calls (NU) : 2402 0.15/0.36 # Rec. Clause-clause subsumption calls : 1423 0.15/0.36 # Non-unit clause-clause subsumptions : 81 0.15/0.36 # Unit Clause-clause subsumption calls : 1306 0.15/0.36 # Rewrite failures with RHS unbound : 0 0.15/0.36 # BW rewrite match attempts : 60 0.15/0.36 # BW rewrite match successes : 54 0.15/0.36 # Condensation attempts : 0 0.15/0.36 # Condensation successes : 0 0.15/0.36 # Termbank termtop insertions : 13315 0.15/0.36 0.15/0.36 # ------------------------------------------------- 0.15/0.36 # User time : 0.046 s 0.15/0.36 # System time : 0.006 s 0.15/0.36 # Total time : 0.052 s 0.15/0.36 # Maximum resident set size: 1640 pages 0.15/0.36 EOF