0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_epr.jar %d %s 0.12/0.33 % Computer : n003.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Thu Jul 2 08:51:41 EDT 2020 0.12/0.33 % CPUTime : 0.18/0.42 openjdk version "1.8.0_171" 0.18/0.42 OpenJDK Runtime Environment (build 1.8.0_171-b10) 0.18/0.42 OpenJDK 64-Bit Server VM (build 25.171-b10, mixed mode) 0.18/0.43 file=/export/starexec/sandbox2/benchmark/theBenchmark.p 0.43/0.57 start to proof:theBenchmark.p 42.07/42.15 % Version : CSE_E---1.2 42.07/42.15 % Problem : theBenchmark.p 42.07/42.15 % Proof found! 42.07/42.15 % SZS status Theorem for theBenchmark.p 42.07/42.15 % SZS output start Proof 42.07/42.15 fof(id, conjecture, ![X1, X2]:(((a(X1,X2)=real_one<=X1=X2)&(X2!=X1=>a(X1,X2)=real_zero))<=(((int_leq(int_one,X2)&int_leq(X2,n))&int_leq(X1,n))&int_leq(int_one,X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', id)). 42.07/42.15 fof(qii, hypothesis, ![X1, X2]:(((![X4]:(![X3]:(real_zero=a(plus(X3,X4),X3)<=(int_leq(int_one,X3)&int_leq(X3,X2)))<=(int_less(int_zero,X4)&X1=plus(X2,X4)))&![X3]:(a(X3,X3)=real_one<=(int_leq(int_one,X3)&int_leq(X3,X2))))&![X4]:(![X3]:(a(X3,plus(X3,X4))=real_zero<=(int_leq(X3,X1)&int_leq(int_one,X3)))<=(X2=plus(X1,X4)&int_less(int_zero,X4))))<=(((int_leq(X2,n)&int_leq(int_one,X2))&int_leq(X1,n))&int_leq(int_one,X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', qii)). 42.07/42.15 fof(int_leq, axiom, ![X1, X2]:((int_less(X1,X2)|X1=X2)<=>int_leq(X1,X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', int_leq)). 42.07/42.15 fof(plus_and_inverse, axiom, ![X1, X2]:(?[X3]:(int_less(int_zero,X3)&plus(X1,X3)=X2)<=>int_less(X1,X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', plus_and_inverse)). 42.07/42.15 fof(int_less_total, axiom, ![X1, X2]:(int_less(X1,X2)|int_leq(X2,X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', int_less_total)). 42.07/42.15 fof(c_0_5, negated_conjecture, ~(![X1, X2]:(((a(X1,X2)=real_one<=X1=X2)&(X2!=X1=>a(X1,X2)=real_zero))<=(((int_leq(int_one,X2)&int_leq(X2,n))&int_leq(X1,n))&int_leq(int_one,X1)))), inference(assume_negation,[status(cth)],[id])). 42.07/42.15 fof(c_0_6, hypothesis, ![X19, X20, X21, X22, X23, X24, X25]:(((~int_less(int_zero,X21)|X19!=plus(X20,X21)|(~int_leq(int_one,X22)|~int_leq(X22,X20)|real_zero=a(plus(X22,X21),X22))|(~int_leq(X20,n)|~int_leq(int_one,X20)|~int_leq(X19,n)|~int_leq(int_one,X19)))&(~int_leq(int_one,X23)|~int_leq(X23,X20)|a(X23,X23)=real_one|(~int_leq(X20,n)|~int_leq(int_one,X20)|~int_leq(X19,n)|~int_leq(int_one,X19))))&(X20!=plus(X19,X24)|~int_less(int_zero,X24)|(~int_leq(X25,X19)|~int_leq(int_one,X25)|a(X25,plus(X25,X24))=real_zero)|(~int_leq(X20,n)|~int_leq(int_one,X20)|~int_leq(X19,n)|~int_leq(int_one,X19)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[qii])])])])])). 42.07/42.15 fof(c_0_7, negated_conjecture, ((((int_leq(int_one,esk3_0)&int_leq(esk3_0,n))&int_leq(esk2_0,n))&int_leq(int_one,esk2_0))&(((esk3_0!=esk2_0|esk2_0=esk3_0)&(a(esk2_0,esk3_0)!=real_zero|esk2_0=esk3_0))&((esk3_0!=esk2_0|a(esk2_0,esk3_0)!=real_one)&(a(esk2_0,esk3_0)!=real_zero|a(esk2_0,esk3_0)!=real_one)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])). 42.07/42.15 fof(c_0_8, plain, ![X28, X29]:(((~int_less(X28,X29)|int_leq(X28,X29))&(X28!=X29|int_leq(X28,X29)))&(~int_leq(X28,X29)|(int_less(X28,X29)|X28=X29))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])). 42.07/42.15 cnf(c_0_9, hypothesis, (a(X4,plus(X4,X3))=real_zero|X1!=plus(X2,X3)|~int_less(int_zero,X3)|~int_leq(X4,X2)|~int_leq(int_one,X4)|~int_leq(X1,n)|~int_leq(int_one,X1)|~int_leq(X2,n)|~int_leq(int_one,X2)), inference(split_conjunct,[status(thm)],[c_0_6])). 42.07/42.15 cnf(c_0_10, negated_conjecture, (int_leq(esk3_0,n)), inference(split_conjunct,[status(thm)],[c_0_7])). 42.07/42.15 cnf(c_0_11, negated_conjecture, (int_leq(int_one,esk3_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 42.07/42.15 cnf(c_0_12, plain, (int_leq(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_8])). 42.07/42.15 cnf(c_0_13, hypothesis, (real_zero=a(plus(X4,X1),X4)|~int_less(int_zero,X1)|X2!=plus(X3,X1)|~int_leq(int_one,X4)|~int_leq(X4,X3)|~int_leq(X3,n)|~int_leq(int_one,X3)|~int_leq(X2,n)|~int_leq(int_one,X2)), inference(split_conjunct,[status(thm)],[c_0_6])). 42.07/42.15 cnf(c_0_14, negated_conjecture, (int_leq(esk2_0,n)), inference(split_conjunct,[status(thm)],[c_0_7])). 42.07/42.15 cnf(c_0_15, negated_conjecture, (int_leq(int_one,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 42.07/42.15 cnf(c_0_16, negated_conjecture, (a(X1,plus(X1,X2))=real_zero|plus(X3,X2)!=esk3_0|~int_leq(X3,n)|~int_leq(int_one,X1)|~int_leq(int_one,X3)|~int_leq(X1,X3)|~int_less(int_zero,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])])). 42.07/42.15 cnf(c_0_17, plain, (int_leq(X1,X1)), inference(er,[status(thm)],[c_0_12])). 42.07/42.15 fof(c_0_18, plain, ![X10, X11, X12, X13, X14]:((~int_less(int_zero,X12)|plus(X10,X12)!=X11|int_less(X10,X11))&((int_less(int_zero,esk1_2(X13,X14))|~int_less(X13,X14))&(plus(X13,esk1_2(X13,X14))=X14|~int_less(X13,X14)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])])). 42.07/42.15 cnf(c_0_19, negated_conjecture, (a(plus(X1,X2),X1)=real_zero|plus(X3,X2)!=esk2_0|~int_leq(X3,n)|~int_leq(int_one,X1)|~int_leq(int_one,X3)|~int_leq(X1,X3)|~int_less(int_zero,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])])). 42.07/42.15 cnf(c_0_20, negated_conjecture, (a(X1,plus(X1,X2))=real_zero|plus(X1,X2)!=esk3_0|~int_leq(X1,n)|~int_leq(int_one,X1)|~int_less(int_zero,X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 42.07/42.15 cnf(c_0_21, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_18])). 42.07/42.15 cnf(c_0_22, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_18])). 42.07/42.15 cnf(c_0_23, negated_conjecture, (a(plus(X1,X2),X1)=real_zero|plus(X1,X2)!=esk2_0|~int_leq(X1,n)|~int_leq(int_one,X1)|~int_less(int_zero,X2)), inference(spm,[status(thm)],[c_0_19, c_0_17])). 42.07/42.15 cnf(c_0_24, negated_conjecture, (esk2_0=esk3_0|a(esk2_0,esk3_0)!=real_zero), inference(split_conjunct,[status(thm)],[c_0_7])). 42.07/42.15 cnf(c_0_25, negated_conjecture, (a(X1,X2)=real_zero|X2!=esk3_0|~int_leq(X1,n)|~int_leq(int_one,X1)|~int_less(X1,X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])). 42.07/42.15 cnf(c_0_26, negated_conjecture, (a(X1,X2)=real_zero|X1!=esk2_0|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_less(X2,X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_21]), c_0_22])). 42.07/42.15 fof(c_0_27, plain, ![X39, X40]:(int_less(X39,X40)|int_leq(X40,X39)), inference(variable_rename,[status(thm)],[int_less_total])). 42.07/42.15 cnf(c_0_28, negated_conjecture, (esk3_0=esk2_0|~int_less(esk2_0,esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_14]), c_0_15])])). 42.07/42.15 cnf(c_0_29, plain, (int_less(X1,X2)|X1=X2|~int_leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_8])). 42.07/42.15 cnf(c_0_30, negated_conjecture, (esk3_0=esk2_0|~int_less(esk3_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_26]), c_0_10]), c_0_11])])). 42.07/42.15 cnf(c_0_31, plain, (int_less(X1,X2)|int_leq(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_27])). 42.07/42.15 cnf(c_0_32, negated_conjecture, (esk3_0=esk2_0|~int_leq(esk2_0,esk3_0)), inference(spm,[status(thm)],[c_0_28, c_0_29])). 42.07/42.15 cnf(c_0_33, hypothesis, (a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X1,X2)|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_leq(X3,n)|~int_leq(int_one,X3)), inference(split_conjunct,[status(thm)],[c_0_6])). 42.07/42.15 cnf(c_0_34, negated_conjecture, (esk3_0!=esk2_0|a(esk2_0,esk3_0)!=real_one), inference(split_conjunct,[status(thm)],[c_0_7])). 42.07/42.15 cnf(c_0_35, negated_conjecture, (esk3_0=esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])). 42.07/42.15 cnf(c_0_36, negated_conjecture, (a(X1,X1)=real_one|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_leq(int_one,X1)|~int_leq(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_10]), c_0_11])])). 42.07/42.15 cnf(c_0_37, negated_conjecture, (a(esk2_0,esk2_0)!=real_one), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35]), c_0_35])])). 42.07/42.15 cnf(c_0_38, negated_conjecture, (a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X1,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_14]), c_0_15])])). 42.07/42.15 cnf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_15]), c_0_17])]), ['proof']). 42.07/42.15 % SZS output end Proof 42.07/42.15 % User time : 40.414 s 42.07/42.15 % System time : 1.003 s 42.07/42.15 % Total time : 41.417 s 42.07/42.15 42.07/42.16 EOF