0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : java -jar mcs_epr.jar %d %s 0.02/0.24 % Computer : n170.star.cs.uiowa.edu 0.02/0.24 % Model : x86_64 x86_64 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.24 % Memory : 32218.625MB 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.24 % CPULimit : 300 0.02/0.24 % DateTime : Fri Jul 13 14:54:25 CDT 2018 0.02/0.24 % CPUTime : 0.06/0.31 openjdk version "1.8.0_144" 0.06/0.31 OpenJDK Runtime Environment (build 1.8.0_144-b01) 0.06/0.31 OpenJDK 64-Bit Server VM (build 25.144-b01, mixed mode) 0.14/0.42 start to proof:theBenchmark.p 0.43/0.54 % Version : CSE_E---1.0 0.43/0.54 % Problem : theBenchmark.p 0.43/0.54 % Proof found! 0.43/0.54 % SZS status Theorem for theBenchmark.p 0.43/0.54 % SZS output start Proof 0.43/0.54 fof(happens_terminates_not_holds, axiom, (![X3]:![X2]:![X1]:(~(holdsAt(X1,plus(X2,n1)))<=(terminates(X3,X1,X2)&happens(X3,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax', happens_terminates_not_holds)). 0.43/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.43/0.54 fof(plus0_1, axiom, (n1=plus(n0,n1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus0_1)). 0.43/0.54 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/sandbox/benchmark/Axioms/CSR001+2.ax', terminates_all_defn)). 0.43/0.54 fof(not_backwards_1, conjecture, (~(holdsAt(backwards,n1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', not_backwards_1)). 0.43/0.54 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/sandbox/benchmark/Axioms/CSR001+2.ax', happens_all_defn)). 0.43/0.54 fof(less_or_equal, axiom, (![X9]:![X10]:((X10=X9|less(X9,X10))<=>less_or_equal(X9,X10))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_or_equal)). 0.43/0.54 fof(less2, axiom, (![X9]:(less(X9,n2)<=>less_or_equal(X9,n1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less2)). 0.43/0.54 fof(less1, axiom, (![X9]:(less_or_equal(X9,n0)<=>less(X9,n1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less1)). 0.43/0.54 fof(less_property, axiom, (![X9]:![X10]:(less(X9,X10)<=>(X10!=X9&~(less(X10,X9))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less_property)). 0.43/0.54 fof(push_not_pull, axiom, (pull!=push), file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax', push_not_pull)). 0.43/0.54 fof(c_0_11, plain, (![X4]:![X5]:![X6]:((~terminates(X4,X6,X5)|~happens(X4,X5))|~holdsAt(X6,plus(X5,n1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])])). 0.43/0.54 fof(c_0_12, plain, (![X11]:![X12]:plus(X11,X12)=plus(X12,X11)), inference(variable_rename,[status(thm)],[symmetry_of_plus])). 0.43/0.54 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.43/0.54 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.43/0.54 cnf(c_0_15,plain,(~holdsAt(X1,plus(X2,n1))|~happens(X3,X2)|~terminates(X3,X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.43/0.54 cnf(c_0_16,plain,(plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.43/0.54 cnf(c_0_17,plain,(n1=plus(n0,n1)), inference(split_conjunct,[status(thm)],[plus0_1])). 0.43/0.54 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.43/0.54 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.43/0.54 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.43/0.54 cnf(c_0_21,plain,(plus(n1,n0)=n1), inference(rw,[status(thm)],[c_0_17, c_0_16])). 0.43/0.54 fof(c_0_22, plain, (![X4]:![X5]:![X6]:![X4]:![X5]:![X6]:((~epred3_3(X4,X6,X5)|terminates(X4,X5,X6))&(~terminates(X4,X5,X6)|epred3_3(X4,X6,X5)))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])). 0.43/0.54 fof(c_0_23, plain, (![X4]:![X5]:![X6]:![X4]:![X5]:![X6]:(((((((((~happens(pull,X5)|(pull=X6|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(pull=X6|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(pull=X6|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((((~happens(pull,X5)|(~happens(push,X5)|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(~happens(push,X5)|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(~happens(push,X5)|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))))&((((~happens(pull,X5)|(spinning=X4|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(spinning=X4|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(spinning=X4|(X6=push|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))))&((((((~happens(pull,X5)|(pull=X6|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(pull=X6|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(pull=X6|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((((~happens(pull,X5)|(~happens(push,X5)|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(~happens(push,X5)|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(~happens(push,X5)|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))))&((((~happens(pull,X5)|(spinning=X4|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(spinning=X4|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(spinning=X4|(~happens(pull,X5)|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))))&((((((~happens(pull,X5)|(pull=X6|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(pull=X6|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(pull=X6|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((((~happens(pull,X5)|(~happens(push,X5)|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(~happens(push,X5)|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(~happens(push,X5)|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))))&((((~happens(pull,X5)|(spinning=X4|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4))&((backwards=X4|(spinning=X4|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))&((X6=push|(spinning=X4|(X4=spinning|epred2_3(X6,X5,X4))))|~epred3_3(X6,X5,X4)))))&((((~epred2_3(X6,X5,X4)|epred3_3(X6,X5,X4))&(((X6!=push|happens(pull,X5))|X4!=spinning)|epred3_3(X6,X5,X4)))&(((pull!=X6|happens(push,X5))|spinning!=X4)|epred3_3(X6,X5,X4)))&(((happens(pull,X5)|backwards!=X4)|X6!=push)|epred3_3(X6,X5,X4))))), 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.43/0.54 fof(c_0_24, negated_conjecture, (~(~(holdsAt(backwards,n1)))), inference(assume_negation,[status(cth)],[not_backwards_1])). 0.43/0.54 fof(c_0_25, plain, (![X4]:![X5]:![X4]:![X5]:(((((((push=X4|(n1=X5|(X5=n2|X4=pull)))|~happens(X4,X5))&((n0=X5|(n1=X5|(X5=n2|X4=pull)))|~happens(X4,X5)))&(((push=X4|(pull=X4|(X5=n2|X4=pull)))|~happens(X4,X5))&((n0=X5|(pull=X4|(X5=n2|X4=pull)))|~happens(X4,X5))))&((((push=X4|(n1=X5|(push=X4|X4=pull)))|~happens(X4,X5))&((n0=X5|(n1=X5|(push=X4|X4=pull)))|~happens(X4,X5)))&(((push=X4|(pull=X4|(push=X4|X4=pull)))|~happens(X4,X5))&((n0=X5|(pull=X4|(push=X4|X4=pull)))|~happens(X4,X5)))))&(((((push=X4|(n1=X5|(X5=n2|n2=X5)))|~happens(X4,X5))&((n0=X5|(n1=X5|(X5=n2|n2=X5)))|~happens(X4,X5)))&(((push=X4|(pull=X4|(X5=n2|n2=X5)))|~happens(X4,X5))&((n0=X5|(pull=X4|(X5=n2|n2=X5)))|~happens(X4,X5))))&((((push=X4|(n1=X5|(push=X4|n2=X5)))|~happens(X4,X5))&((n0=X5|(n1=X5|(push=X4|n2=X5)))|~happens(X4,X5)))&(((push=X4|(pull=X4|(push=X4|n2=X5)))|~happens(X4,X5))&((n0=X5|(pull=X4|(push=X4|n2=X5)))|~happens(X4,X5))))))&(((((X4!=pull|n2!=X5)|happens(X4,X5))&((X5!=n2|push!=X4)|happens(X4,X5)))&((n1!=X5|pull!=X4)|happens(X4,X5)))&((push!=X4|n0!=X5)|happens(X4,X5))))), 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.43/0.54 fof(c_0_26, plain, (![X11]:![X12]:![X11]:![X12]:(((X12!=X11|less_or_equal(X11,X12))&(~less(X11,X12)|less_or_equal(X11,X12)))&(~less_or_equal(X11,X12)|(X12=X11|less(X11,X12))))), 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.43/0.54 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.43/0.54 cnf(c_0_28,plain,(terminates(X1,X2,X3)|~epred3_3(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.43/0.54 cnf(c_0_29,plain,(epred3_3(X1,X2,X3)|happens(pull,X2)|X1!=push|backwards!=X3), inference(split_conjunct,[status(thm)],[c_0_23])). 0.43/0.54 fof(c_0_30, negated_conjecture, (holdsAt(backwards,n1)), inference(fof_simplification,[status(thm)],[c_0_24])). 0.43/0.54 cnf(c_0_31,plain,(happens(X1,X2)|n0!=X2|push!=X1), inference(split_conjunct,[status(thm)],[c_0_25])). 0.43/0.54 fof(c_0_32, plain, (![X10]:![X10]:((~less(X10,n2)|less_or_equal(X10,n1))&(~less_or_equal(X10,n1)|less(X10,n2)))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])])])). 0.43/0.54 cnf(c_0_33,plain,(less_or_equal(X1,X2)|X2!=X1), inference(split_conjunct,[status(thm)],[c_0_26])). 0.43/0.54 fof(c_0_34, plain, (![X10]:![X10]:((~less_or_equal(X10,n0)|less(X10,n1))&(~less(X10,n1)|less_or_equal(X10,n0)))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])])])). 0.43/0.54 cnf(c_0_35,plain,(n2=X2|push=X1|n1=X2|push=X1|~happens(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.43/0.54 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.43/0.54 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.43/0.54 cnf(c_0_38,negated_conjecture,(holdsAt(backwards,n1)), inference(split_conjunct,[status(thm)],[c_0_30])). 0.43/0.54 cnf(c_0_39,plain,(happens(push,n0)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])])). 0.43/0.54 fof(c_0_40, plain, (![X11]:![X12]:![X11]:![X12]:(((X12!=X11|~less(X11,X12))&(~less(X12,X11)|~less(X11,X12)))&((X12=X11|less(X12,X11))|less(X11,X12)))), 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.43/0.54 cnf(c_0_41,plain,(less(X1,n2)|~less_or_equal(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_32])). 0.43/0.54 cnf(c_0_42,plain,(less_or_equal(X1,X1)), inference(er,[status(thm)],[c_0_33])). 0.43/0.54 cnf(c_0_43,plain,(less(X1,n1)|~less_or_equal(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_34])). 0.43/0.54 cnf(c_0_44,plain,(n1=X2|n2=X2|push=X1|~happens(X1,X2)), inference(cn,[status(thm)],[c_0_35])). 0.43/0.54 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.43/0.54 cnf(c_0_46,plain,(pull!=push), inference(split_conjunct,[status(thm)],[push_not_pull])). 0.43/0.54 cnf(c_0_47,plain,(~less(X1,X2)|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_40])). 0.43/0.54 cnf(c_0_48,plain,(less(n1,n2)), inference(spm,[status(thm)],[c_0_41, c_0_42])). 0.43/0.54 cnf(c_0_49,plain,(less(n0,n1)), inference(spm,[status(thm)],[c_0_43, c_0_42])). 0.43/0.54 cnf(c_0_50,plain,(n0=n1|n0=n2), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_46])). 0.43/0.54 cnf(c_0_51,plain,(~less(n2,n1)), inference(spm,[status(thm)],[c_0_47, c_0_48])). 0.43/0.54 cnf(c_0_52,plain,(~less(X1,X2)|X2!=X1), inference(split_conjunct,[status(thm)],[c_0_40])). 0.43/0.54 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.43/0.54 cnf(c_0_54,plain,(~less(X1,X1)), inference(er,[status(thm)],[c_0_52])). 0.43/0.54 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.43/0.54 % SZS output end Proof 0.43/0.54 % User time : 0.031 s 0.43/0.54 % System time : 0.003 s 0.43/0.54 % Total time : 0.034 s 0.43/0.54 0.46/1.18 EOF