0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n007.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 12:21:34 EDT 2021 0.13/0.35 % CPUTime : 0.21/0.47 Running first-order theorem proving 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.21/0.48 # Version: 2.6 0.21/0.48 # No SInE strategy applied 0.21/0.48 # Trying AutoSched0 for 59 seconds 0.21/0.54 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m 0.21/0.54 # and selection function SelectCQArNTNpEqFirst. 0.21/0.54 # 0.21/0.54 # Preprocessing time : 0.038 s 0.21/0.54 # Presaturation interreduction done 0.21/0.54 0.21/0.54 # Proof found! 0.21/0.54 # SZS status Theorem 0.21/0.54 # SZS output start CNFRefutation 0.21/0.54 fof(terminates_all_defn, axiom, ![X4, X3, X5]:(terminates(X4,X3,X5)<=>(((~(happens(pull,X5))&backwards=X3)&X4=push)|((pull=X4&~(happens(push,X5)))&forwards=X3)|((push=X4&~(happens(pull,X5)))&X3=spinning)|((~(happens(push,X5))&X3=spinning)&pull=X4)|((X4=pull&happens(push,X5))&backwards=X3)|((happens(push,X5)&X3=forwards)&X4=pull))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.21/0.54 fof(happens_terminates_not_holds, axiom, ![X4, X5, X3]:((terminates(X4,X3,X5)&happens(X4,X5))=>~(holdsAt(X3,plus(X5,n1)))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.21/0.54 fof(happens_all_defn, axiom, ![X4, X5]:(happens(X4,X5)<=>((push=X4&n2=X5)|(n2=X5&pull=X4)|(X4=pull&X5=n1)|(X5=n0&push=X4))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', happens_all_defn)). 0.21/0.54 fof(not_spinning_2, conjecture, ~(holdsAt(spinning,n2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', not_spinning_2)). 0.21/0.54 fof(less_or_equal, axiom, ![X9, X10]:(less_or_equal(X9,X10)<=>(less(X9,X10)|X9=X10)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_or_equal)). 0.21/0.54 fof(symmetry_of_plus, axiom, ![X9, X10]:plus(X9,X10)=plus(X10,X9), file('/export/starexec/sandbox/benchmark/theBenchmark.p', symmetry_of_plus)). 0.21/0.54 fof(plus1_1, axiom, plus(n1,n1)=n2, file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus1_1)). 0.21/0.54 fof(less_property, axiom, ![X9, X10]:(less(X9,X10)<=>(~(less(X10,X9))&X9!=X10)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_property)). 0.21/0.54 fof(less2, axiom, ![X9]:(less_or_equal(X9,n1)<=>less(X9,n2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less2)). 0.21/0.54 fof(plus0_1, axiom, plus(n0,n1)=n1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus0_1)). 0.21/0.54 fof(push_not_pull, axiom, push!=pull, file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.21/0.54 fof(c_0_11, plain, ![X3, X5, X4]:(epred3_3(X4,X5,X3)<=>(((~happens(pull,X5)&backwards=X3)&X4=push)|((pull=X4&~happens(push,X5))&forwards=X3)|((push=X4&~happens(pull,X5))&X3=spinning)|((~happens(push,X5)&X3=spinning)&pull=X4)|((X4=pull&happens(push,X5))&backwards=X3)|((happens(push,X5)&X3=forwards)&X4=pull))), introduced(definition)). 0.21/0.54 fof(c_0_12, plain, ![X5, X4, X3]:(epred2_3(X3,X4,X5)<=>(((~happens(pull,X5)&backwards=X3)&X4=push)|((pull=X4&~happens(push,X5))&forwards=X3)|((push=X4&~happens(pull,X5))&X3=spinning))), introduced(definition)). 0.21/0.54 fof(c_0_13, plain, ![X3, X5, X4]:(epred3_3(X4,X5,X3)<=>(epred2_3(X3,X4,X5)|((~happens(push,X5)&X3=spinning)&pull=X4)|((X4=pull&happens(push,X5))&backwards=X3)|((happens(push,X5)&X3=forwards)&X4=pull))), inference(apply_def,[status(thm)],[c_0_11, c_0_12])). 0.21/0.54 fof(c_0_14, plain, ![X4, X3, X5]:(terminates(X4,X3,X5)<=>epred3_3(X4,X5,X3)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]), c_0_11])). 0.21/0.54 fof(c_0_15, plain, ![X173, X174, X175]:((((((((happens(push,X174)|(X175=pull|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(X175=pull|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(X175=pull|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(((happens(push,X174)|(happens(push,X174)|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(happens(push,X174)|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(happens(push,X174)|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))))&(((happens(push,X174)|(backwards=X173|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(backwards=X173|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(backwards=X173|(~happens(push,X174)|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))))&(((((happens(push,X174)|(X175=pull|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(X175=pull|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(X175=pull|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(((happens(push,X174)|(happens(push,X174)|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(happens(push,X174)|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(happens(push,X174)|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))))&(((happens(push,X174)|(backwards=X173|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(backwards=X173|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(backwards=X173|(X173=spinning|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))))&(((((happens(push,X174)|(X175=pull|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(X175=pull|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(X175=pull|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(((happens(push,X174)|(happens(push,X174)|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(happens(push,X174)|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(happens(push,X174)|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))))&(((happens(push,X174)|(backwards=X173|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173))&(X173=forwards|(backwards=X173|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))&(X175=pull|(backwards=X173|(pull=X175|epred2_3(X173,X175,X174)))|~epred3_3(X175,X174,X173)))))&((((~epred2_3(X173,X175,X174)|epred3_3(X175,X174,X173))&(happens(push,X174)|X173!=spinning|pull!=X175|epred3_3(X175,X174,X173)))&(X175!=pull|~happens(push,X174)|backwards!=X173|epred3_3(X175,X174,X173)))&(~happens(push,X174)|X173!=forwards|X175!=pull|epred3_3(X175,X174,X173)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])). 0.21/0.54 fof(c_0_16, plain, ![X4, X5, X3]:((terminates(X4,X3,X5)&happens(X4,X5))=>~holdsAt(X3,plus(X5,n1))), inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])). 0.21/0.54 fof(c_0_17, plain, ![X144, X145, X146]:((~terminates(X144,X145,X146)|epred3_3(X144,X146,X145))&(~epred3_3(X144,X146,X145)|terminates(X144,X145,X146))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])). 0.21/0.54 cnf(c_0_18, plain, (happens(push,X1)|epred3_3(X3,X1,X2)|X2!=spinning|pull!=X3), inference(split_conjunct,[status(thm)],[c_0_15])). 0.21/0.54 fof(c_0_19, plain, ![X108, X109, X110]:(~terminates(X108,X110,X109)|~happens(X108,X109)|~holdsAt(X110,plus(X109,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])). 0.21/0.54 cnf(c_0_20, plain, (terminates(X1,X3,X2)|~epred3_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.21/0.54 cnf(c_0_21, plain, (epred3_3(pull,X1,spinning)|happens(push,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])])). 0.21/0.54 fof(c_0_22, plain, ![X147, X148]:((((((X148=n0|(X147=pull|(n2=X148|push=X147))|~happens(X147,X148))&(push=X147|(X147=pull|(n2=X148|push=X147))|~happens(X147,X148)))&((X148=n0|(X148=n1|(n2=X148|push=X147))|~happens(X147,X148))&(push=X147|(X148=n1|(n2=X148|push=X147))|~happens(X147,X148))))&(((X148=n0|(X147=pull|(pull=X147|push=X147))|~happens(X147,X148))&(push=X147|(X147=pull|(pull=X147|push=X147))|~happens(X147,X148)))&((X148=n0|(X148=n1|(pull=X147|push=X147))|~happens(X147,X148))&(push=X147|(X148=n1|(pull=X147|push=X147))|~happens(X147,X148)))))&((((X148=n0|(X147=pull|(n2=X148|n2=X148))|~happens(X147,X148))&(push=X147|(X147=pull|(n2=X148|n2=X148))|~happens(X147,X148)))&((X148=n0|(X148=n1|(n2=X148|n2=X148))|~happens(X147,X148))&(push=X147|(X148=n1|(n2=X148|n2=X148))|~happens(X147,X148))))&(((X148=n0|(X147=pull|(pull=X147|n2=X148))|~happens(X147,X148))&(push=X147|(X147=pull|(pull=X147|n2=X148))|~happens(X147,X148)))&((X148=n0|(X148=n1|(pull=X147|n2=X148))|~happens(X147,X148))&(push=X147|(X148=n1|(pull=X147|n2=X148))|~happens(X147,X148))))))&((((push!=X147|n2!=X148|happens(X147,X148))&(n2!=X148|pull!=X147|happens(X147,X148)))&(X147!=pull|X148!=n1|happens(X147,X148)))&(X148!=n0|push!=X147|happens(X147,X148)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])). 0.21/0.54 cnf(c_0_23, plain, (~terminates(X1,X2,X3)|~happens(X1,X3)|~holdsAt(X2,plus(X3,n1))), inference(split_conjunct,[status(thm)],[c_0_19])). 0.21/0.54 cnf(c_0_24, plain, (terminates(pull,spinning,X1)|happens(push,X1)), inference(spm,[status(thm)],[c_0_20, c_0_21])). 0.21/0.54 cnf(c_0_25, plain, (happens(X1,X2)|X1!=pull|X2!=n1), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.54 fof(c_0_26, negated_conjecture, holdsAt(spinning,n2), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_spinning_2])])). 0.21/0.54 fof(c_0_27, plain, ![X152, X153]:((~less_or_equal(X152,X153)|(less(X152,X153)|X152=X153))&((~less(X152,X153)|less_or_equal(X152,X153))&(X152!=X153|less_or_equal(X152,X153)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])). 0.21/0.54 fof(c_0_28, plain, ![X165, X166]:plus(X165,X166)=plus(X166,X165), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.21/0.54 cnf(c_0_29, plain, (X1=n0|X2=pull|pull=X2|n2=X1|~happens(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.54 cnf(c_0_30, plain, (happens(push,X1)|~holdsAt(spinning,plus(X1,n1))|~happens(pull,X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.21/0.54 cnf(c_0_31, plain, (happens(pull,n1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])])). 0.21/0.54 cnf(c_0_32, plain, (plus(n1,n1)=n2), inference(split_conjunct,[status(thm)],[plus1_1])). 0.21/0.54 cnf(c_0_33, negated_conjecture, (holdsAt(spinning,n2)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.21/0.54 fof(c_0_34, plain, ![X9, X10]:(less(X9,X10)<=>(~less(X10,X9)&X9!=X10)), inference(fof_simplification,[status(thm)],[less_property])). 0.21/0.54 fof(c_0_35, plain, ![X151]:((~less_or_equal(X151,n1)|less(X151,n2))&(~less(X151,n2)|less_or_equal(X151,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])). 0.21/0.54 cnf(c_0_36, plain, (less_or_equal(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_27])). 0.21/0.54 cnf(c_0_37, plain, (plus(n0,n1)=n1), inference(split_conjunct,[status(thm)],[plus0_1])). 0.21/0.54 cnf(c_0_38, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_28])). 0.21/0.54 cnf(c_0_39, plain, (X2=pull|X1=n0|n2=X1|~happens(X2,X1)), inference(cn,[status(thm)],[c_0_29])). 0.21/0.54 cnf(c_0_40, plain, (happens(push,n1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32]), c_0_33])])). 0.21/0.54 cnf(c_0_41, plain, (push!=pull), inference(split_conjunct,[status(thm)],[push_not_pull])). 0.21/0.54 fof(c_0_42, plain, ![X155, X156]:(((~less(X156,X155)|~less(X155,X156))&(X155!=X156|~less(X155,X156)))&(less(X156,X155)|X155=X156|less(X155,X156))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])). 0.21/0.54 cnf(c_0_43, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_35])). 0.21/0.54 cnf(c_0_44, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_36])). 0.21/0.54 cnf(c_0_45, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_37, c_0_38])). 0.21/0.54 cnf(c_0_46, plain, (n2=n1|n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41])). 0.21/0.54 cnf(c_0_47, plain, (X1!=X2|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_42])). 0.21/0.54 cnf(c_0_48, plain, (less(n1,n2)), inference(spm,[status(thm)],[c_0_43, c_0_44])). 0.21/0.54 cnf(c_0_49, plain, (n2=n1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_32])])). 0.21/0.54 cnf(c_0_50, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_47])). 0.21/0.54 cnf(c_0_51, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_48, c_0_49]), c_0_50]), ['proof']). 0.21/0.54 # SZS output end CNFRefutation 0.21/0.54 # Proof object total steps : 52 0.21/0.54 # Proof object clause steps : 26 0.21/0.54 # Proof object formula steps : 26 0.21/0.54 # Proof object conjectures : 3 0.21/0.54 # Proof object clause conjectures : 1 0.21/0.54 # Proof object formula conjectures : 2 0.21/0.54 # Proof object initial clauses used : 13 0.21/0.54 # Proof object initial formulas used : 11 0.21/0.54 # Proof object generating inferences : 6 0.21/0.54 # Proof object simplifying inferences : 16 0.21/0.54 # Training examples: 0 positive, 0 negative 0.21/0.54 # Parsed axioms : 48 0.21/0.54 # Removed by relevancy pruning/SinE : 0 0.21/0.54 # Initial clauses : 186 0.21/0.54 # Removed in clause preprocessing : 8 0.21/0.54 # Initial clauses in saturation : 178 0.21/0.54 # Processed clauses : 606 0.21/0.54 # ...of these trivial : 11 0.21/0.54 # ...subsumed : 116 0.21/0.54 # ...remaining for further processing : 479 0.21/0.54 # Other redundant clauses eliminated : 28 0.21/0.54 # Clauses deleted for lack of memory : 0 0.21/0.54 # Backward-subsumed : 29 0.21/0.54 # Backward-rewritten : 72 0.21/0.54 # Generated clauses : 787 0.21/0.54 # ...of the previous two non-trivial : 557 0.21/0.54 # Contextual simplify-reflections : 1 0.21/0.54 # Paramodulations : 769 0.21/0.54 # Factorizations : 3 0.21/0.54 # NegExts : 0 0.21/0.54 # Equation resolutions : 28 0.21/0.54 # Propositional unsat checks : 0 0.21/0.54 # Propositional check models : 0 0.21/0.54 # Propositional check unsatisfiable : 0 0.21/0.54 # Propositional clauses : 0 0.21/0.54 # Propositional clauses after purity: 0 0.21/0.54 # Propositional unsat core size : 0 0.21/0.54 # Propositional preprocessing time : 0.000 0.21/0.54 # Propositional encoding time : 0.000 0.21/0.54 # Propositional solver time : 0.000 0.21/0.54 # Success case prop preproc time : 0.000 0.21/0.54 # Success case prop encoding time : 0.000 0.21/0.54 # Success case prop solver time : 0.000 0.21/0.54 # Current number of processed clauses : 252 0.21/0.54 # Positive orientable unit clauses : 105 0.21/0.54 # Positive unorientable unit clauses: 1 0.21/0.54 # Negative unit clauses : 43 0.21/0.54 # Non-unit-clauses : 103 0.21/0.54 # Current number of unprocessed clauses: 187 0.21/0.54 # ...number of literals in the above : 420 0.21/0.54 # Current number of archived formulas : 0 0.21/0.54 # Current number of archived clauses : 212 0.21/0.54 # Clause-clause subsumption calls (NU) : 2964 0.21/0.54 # Rec. Clause-clause subsumption calls : 1856 0.21/0.54 # Non-unit clause-clause subsumptions : 91 0.21/0.54 # Unit Clause-clause subsumption calls : 1355 0.21/0.54 # Rewrite failures with RHS unbound : 0 0.21/0.54 # BW rewrite match attempts : 102 0.21/0.54 # BW rewrite match successes : 55 0.21/0.54 # Condensation attempts : 0 0.21/0.54 # Condensation successes : 0 0.21/0.54 # Termbank termtop insertions : 16636 0.21/0.54 0.21/0.54 # ------------------------------------------------- 0.21/0.54 # User time : 0.061 s 0.21/0.54 # System time : 0.007 s 0.21/0.54 # Total time : 0.068 s 0.21/0.54 # Maximum resident set size: 1648 pages 0.21/0.54 EOF