0.00/0.03 % 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.03/0.24 % Computer : n004.star.cs.uiowa.edu 0.03/0.24 % Model : x86_64 x86_64 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.24 % Memory : 32218.625MB 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Fri Jul 13 14:54:25 CDT 2018 0.03/0.24 % CPUTime : 0.06/0.24 # Version: 2.2pre001 0.06/0.24 # No SInE strategy applied 0.06/0.24 # Trying AutoSched0 for 151 seconds 0.06/0.27 # AutoSched0-Mode selected heuristic G_____0014_C18_F1_SE_CS_SP_S0Y 0.06/0.27 # and selection function SelectMaxLComplexAvoidPosPred. 0.06/0.27 # 0.06/0.27 # Preprocessing time : 0.012 s 0.06/0.27 0.06/0.27 # Proof found! 0.06/0.27 # SZS status Theorem 0.06/0.27 # SZS output start CNFRefutation 0.06/0.27 fof(happens_terminates_not_holds, axiom, ![X3, X2, X1]:(~(holdsAt(X1,plus(X2,n1)))<=(terminates(X3,X1,X2)&happens(X3,X2))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.06/0.27 fof(symmetry_of_plus, axiom, ![X9, X10]:plus(X9,X10)=plus(X10,X9), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', symmetry_of_plus)). 0.06/0.27 fof(plus0_1, axiom, n1=plus(n0,n1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus0_1)). 0.06/0.27 fof(terminates_all_defn, axiom, ![X3, X1, X2]:((((X3=pull&forwards=X1)&~(happens(push,X2)))|((X3=pull&happens(push,X2))&X1=forwards)|((happens(push,X2)&backwards=X1)&pull=X3)|((X3=push&~(happens(pull,X2)))&X1=spinning)|((pull=X3&~(happens(push,X2)))&spinning=X1)|((~(happens(pull,X2))&backwards=X1)&X3=push))<=>terminates(X3,X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.06/0.27 fof(not_backwards_1, conjecture, ~(holdsAt(backwards,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not_backwards_1)). 0.06/0.27 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.06/0.27 fof(less_or_equal, axiom, ![X9, X10]:((X10=X9|less(X9,X10))<=>less_or_equal(X9,X10)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less_or_equal)). 0.06/0.27 fof(less2, axiom, ![X9]:(less(X9,n2)<=>less_or_equal(X9,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less2)). 0.06/0.27 fof(less1, axiom, ![X9]:(less_or_equal(X9,n0)<=>less(X9,n1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less1)). 0.06/0.27 fof(less_property, axiom, ![X9, X10]:(less(X9,X10)<=>(X10!=X9&~(less(X10,X9)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less_property)). 0.06/0.27 fof(push_not_pull, axiom, pull!=push, file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.06/0.27 fof(c_0_11, plain, ![X17, X18, X19]:(~terminates(X17,X19,X18)|~happens(X17,X18)|~holdsAt(X19,plus(X18,n1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])])). 0.06/0.27 fof(c_0_12, plain, ![X75, X76]:plus(X75,X76)=plus(X76,X75), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.06/0.27 fof(c_0_13, plain, ![X1, X2, X3]:(epred3_3(X3,X2,X1)<=>(((X3=pull&forwards=X1)&~(happens(push,X2)))|((X3=pull&happens(push,X2))&X1=forwards)|((happens(push,X2)&backwards=X1)&pull=X3)|((X3=push&~(happens(pull,X2)))&X1=spinning)|((pull=X3&~(happens(push,X2)))&spinning=X1)|((~(happens(pull,X2))&backwards=X1)&X3=push))), introduced(definition)). 0.06/0.27 fof(c_0_14, plain, ![X1, X2, X3]:(epred2_3(X3,X2,X1)<=>(((X3=pull&forwards=X1)&~(happens(push,X2)))|((X3=pull&happens(push,X2))&X1=forwards)|((happens(push,X2)&backwards=X1)&pull=X3))), introduced(definition)). 0.06/0.27 cnf(c_0_15, plain, (~terminates(X1,X2,X3)|~happens(X1,X3)|~holdsAt(X2,plus(X3,n1))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.06/0.27 cnf(c_0_16, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.06/0.27 cnf(c_0_17, plain, (n1=plus(n0,n1)), inference(split_conjunct,[status(thm)],[plus0_1])). 0.06/0.27 fof(c_0_18, axiom, ![X3, X1, X2]:(epred3_3(X3,X2,X1)<=>terminates(X3,X1,X2)), inference(apply_def,[status(thm)],[terminates_all_defn, c_0_13])). 0.06/0.27 fof(c_0_19, plain, ![X1, X2, X3]:(epred3_3(X3,X2,X1)<=>(epred2_3(X3,X2,X1)|((X3=push&~(happens(pull,X2)))&X1=spinning)|((pull=X3&~(happens(push,X2)))&spinning=X1)|((~(happens(pull,X2))&backwards=X1)&X3=push))), inference(apply_def,[status(thm)],[c_0_13, c_0_14])). 0.06/0.27 cnf(c_0_20, plain, (~holdsAt(X1,plus(n1,X2))|~happens(X3,X2)|~terminates(X3,X1,X2)), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.06/0.27 cnf(c_0_21, plain, (plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_17, c_0_16])). 0.06/0.27 fof(c_0_22, plain, ![X67, X68, X69, X67, X68, X69]:((~epred3_3(X67,X69,X68)|terminates(X67,X68,X69))&(~terminates(X67,X68,X69)|epred3_3(X67,X69,X68))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])). 0.06/0.27 fof(c_0_23, plain, ![X94, X95, X96, X94, X95, X96]:((((((((~happens(pull,X95)|(pull=X96|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(pull=X96|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(pull=X96|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(((~happens(pull,X95)|(~happens(push,X95)|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(~happens(push,X95)|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(~happens(push,X95)|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))))&(((~happens(pull,X95)|(spinning=X94|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(spinning=X94|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(spinning=X94|(X96=push|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))))&(((((~happens(pull,X95)|(pull=X96|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(pull=X96|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(pull=X96|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(((~happens(pull,X95)|(~happens(push,X95)|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(~happens(push,X95)|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(~happens(push,X95)|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))))&(((~happens(pull,X95)|(spinning=X94|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(spinning=X94|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(spinning=X94|(~happens(pull,X95)|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))))&(((((~happens(pull,X95)|(pull=X96|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(pull=X96|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(pull=X96|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(((~happens(pull,X95)|(~happens(push,X95)|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(~happens(push,X95)|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(~happens(push,X95)|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))))&(((~happens(pull,X95)|(spinning=X94|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94))&(backwards=X94|(spinning=X94|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))&(X96=push|(spinning=X94|(X94=spinning|epred2_3(X96,X95,X94)))|~epred3_3(X96,X95,X94)))))&((((~epred2_3(X96,X95,X94)|epred3_3(X96,X95,X94))&(X96!=push|happens(pull,X95)|X94!=spinning|epred3_3(X96,X95,X94)))&(pull!=X96|happens(push,X95)|spinning!=X94|epred3_3(X96,X95,X94)))&(happens(pull,X95)|backwards!=X94|X96!=push|epred3_3(X96,X95,X94)))), 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_19])])])])])])). 0.06/0.27 fof(c_0_24, negated_conjecture, ~(~(holdsAt(backwards,n1))), inference(assume_negation,[status(cth)],[not_backwards_1])). 0.06/0.27 fof(c_0_25, 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.06/0.27 fof(c_0_26, plain, ![X86, X87, X86, X87]:(((X87!=X86|less_or_equal(X86,X87))&(~less(X86,X87)|less_or_equal(X86,X87)))&(~less_or_equal(X86,X87)|(X87=X86|less(X86,X87)))), 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.06/0.27 cnf(c_0_27, plain, (~holdsAt(X1,n1)|~happens(X2,n0)|~terminates(X2,X1,n0)), inference(spm,[status(thm)],[c_0_20, c_0_21])). 0.06/0.27 cnf(c_0_28, plain, (terminates(X1,X3,X2)|~epred3_3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.06/0.27 cnf(c_0_29, plain, (happens(pull,X1)|epred3_3(X3,X1,X2)|backwards!=X2|X3!=push), inference(split_conjunct,[status(thm)],[c_0_23])). 0.06/0.27 fof(c_0_30, negated_conjecture, holdsAt(backwards,n1), inference(fof_simplification,[status(thm)],[c_0_24])). 0.06/0.27 cnf(c_0_31, plain, (happens(X1,X2)|push!=X1|n0!=X2), inference(split_conjunct,[status(thm)],[c_0_25])). 0.06/0.27 fof(c_0_32, plain, ![X82, X82]:((~less(X82,n2)|less_or_equal(X82,n1))&(~less_or_equal(X82,n1)|less(X82,n2))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])])])). 0.06/0.27 cnf(c_0_33, plain, (less_or_equal(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_26])). 0.06/0.27 fof(c_0_34, plain, ![X71, X71]:((~less_or_equal(X71,n0)|less(X71,n1))&(~less(X71,n1)|less_or_equal(X71,n0))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])])])). 0.06/0.27 cnf(c_0_35, plain, (push=X1|n1=X2|X2=n2|n2=X2|~happens(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.06/0.27 cnf(c_0_36, plain, (~epred3_3(X1,n0,X2)|~holdsAt(X2,n1)|~happens(X1,n0)), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.06/0.27 cnf(c_0_37, plain, (epred3_3(push,X1,backwards)|happens(pull,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])])). 0.06/0.27 cnf(c_0_38, negated_conjecture, (holdsAt(backwards,n1)), inference(split_conjunct,[status(thm)],[c_0_30])). 0.06/0.27 cnf(c_0_39, plain, (happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])])). 0.06/0.27 fof(c_0_40, plain, ![X77, X78, X77, X78]:(((X78!=X77|~less(X77,X78))&(~less(X78,X77)|~less(X77,X78)))&(X78=X77|less(X78,X77)|less(X77,X78))), 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.06/0.27 cnf(c_0_41, plain, (less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_32])). 0.06/0.27 cnf(c_0_42, plain, (less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_33])). 0.06/0.27 cnf(c_0_43, plain, (less(X1,n1)|~less_or_equal(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_34])). 0.06/0.27 cnf(c_0_44, plain, (X2=n2|n1=X2|push=X1|~happens(X1,X2)), inference(cn,[status(thm)],[c_0_35])). 0.06/0.27 cnf(c_0_45, plain, (happens(pull,n0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38]), c_0_39])])). 0.06/0.27 cnf(c_0_46, plain, (pull!=push), inference(split_conjunct,[status(thm)],[push_not_pull])). 0.06/0.27 cnf(c_0_47, plain, (~less(X1,X2)|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_40])). 0.06/0.27 cnf(c_0_48, plain, (less(n1,n2)), inference(spm,[status(thm)],[c_0_41, c_0_42])). 0.06/0.27 cnf(c_0_49, plain, (less(n0,n1)), inference(spm,[status(thm)],[c_0_43, c_0_42])). 0.06/0.27 cnf(c_0_50, plain, (n0=n2|n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_46])). 0.06/0.27 cnf(c_0_51, plain, (~less(n2,n1)), inference(spm,[status(thm)],[c_0_47, c_0_48])). 0.06/0.27 cnf(c_0_52, plain, (X1!=X2|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_40])). 0.06/0.27 cnf(c_0_53, plain, (n0=n1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51])). 0.06/0.27 cnf(c_0_54, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_52])). 0.06/0.27 cnf(c_0_55, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_49, c_0_53]), c_0_54]), ['proof']). 0.06/0.27 # SZS output end CNFRefutation 0.06/0.27 # Proof object total steps : 56 0.06/0.27 # Proof object clause steps : 30 0.06/0.27 # Proof object formula steps : 26 0.06/0.27 # Proof object conjectures : 4 0.06/0.27 # Proof object clause conjectures : 1 0.06/0.27 # Proof object formula conjectures : 3 0.06/0.27 # Proof object initial clauses used : 14 0.06/0.27 # Proof object initial formulas used : 11 0.06/0.27 # Proof object generating inferences : 9 0.06/0.27 # Proof object simplifying inferences : 15 0.06/0.27 # Training examples: 0 positive, 0 negative 0.06/0.27 # Parsed axioms : 48 0.06/0.27 # Removed by relevancy pruning/SinE : 0 0.06/0.27 # Initial clauses : 186 0.06/0.27 # Removed in clause preprocessing : 8 0.06/0.27 # Initial clauses in saturation : 178 0.06/0.27 # Processed clauses : 921 0.06/0.27 # ...of these trivial : 1 0.06/0.27 # ...subsumed : 506 0.06/0.27 # ...remaining for further processing : 414 0.06/0.27 # Other redundant clauses eliminated : 28 0.06/0.27 # Clauses deleted for lack of memory : 0 0.06/0.27 # Backward-subsumed : 1 0.06/0.27 # Backward-rewritten : 30 0.06/0.27 # Generated clauses : 1271 0.06/0.27 # ...of the previous two non-trivial : 1146 0.06/0.27 # Contextual simplify-reflections : 175 0.06/0.28 # Paramodulations : 1253 0.06/0.28 # Factorizations : 3 0.06/0.28 # Equation resolutions : 28 0.06/0.28 # Propositional unsat checks : 0 0.06/0.28 # Propositional check models : 0 0.06/0.28 # Propositional check unsatisfiable : 0 0.06/0.28 # Propositional clauses : 0 0.06/0.28 # Propositional clauses after purity: 0 0.06/0.28 # Propositional unsat core size : 0 0.06/0.28 # Current number of processed clauses : 368 0.06/0.28 # Positive orientable unit clauses : 24 0.06/0.28 # Positive unorientable unit clauses: 1 0.06/0.28 # Negative unit clauses : 105 0.06/0.28 # Non-unit-clauses : 238 0.06/0.28 # Current number of unprocessed clauses: 360 0.06/0.28 # ...number of literals in the above : 1291 0.06/0.28 # Current number of archived formulas : 0 0.06/0.28 # Current number of archived clauses : 31 0.06/0.28 # Clause-clause subsumption calls (NU) : 13787 0.06/0.28 # Rec. Clause-clause subsumption calls : 11344 0.06/0.28 # Non-unit clause-clause subsumptions : 404 0.06/0.28 # Unit Clause-clause subsumption calls : 7887 0.06/0.28 # Rewrite failures with RHS unbound : 0 0.06/0.28 # BW rewrite match attempts : 23 0.06/0.28 # BW rewrite match successes : 23 0.06/0.28 # Condensation attempts : 0 0.06/0.28 # Condensation successes : 0 0.06/0.28 # Termbank termtop insertions : 19246 0.06/0.28 0.06/0.28 # ------------------------------------------------- 0.06/0.28 # User time : 0.030 s 0.06/0.28 # System time : 0.004 s 0.06/0.28 # Total time : 0.033 s 0.06/0.28 # Maximum resident set size: 1576 pages 0.06/0.29 EOF