0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s 0.11/0.33 % Computer : n017.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 960 0.11/0.33 % WCLimit : 120 0.11/0.33 % DateTime : Tue Aug 9 04:14:30 EDT 2022 0.11/0.33 % CPUTime : 0.18/0.44 openjdk version "1.8.0_171" 0.18/0.44 OpenJDK Runtime Environment (build 1.8.0_171-b10) 0.18/0.44 OpenJDK 64-Bit Server VM (build 25.171-b10, mixed mode) 0.18/0.45 file=/export/starexec/sandbox/benchmark/theBenchmark.p 0.60/0.64 start to proof: theBenchmark 0.61/0.95 % Version : CSE_E---1.4 0.61/0.95 % Problem : theBenchmark.p 0.61/0.95 % Proof found 0.61/0.95 % SZS status Theorem for theBenchmark.p 0.61/0.96 % SZS output start Proof 0.61/0.96 fof(int_less_transitive, axiom, ![X5, X6, X8]:(int_less(X5,X8)<=(int_less(X5,X6)&int_less(X6,X8))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', int_less_transitive)). 0.61/0.96 fof(plus_and_order1, axiom, ![X1, X2, X3, X4]:((int_less(X1,X2)&int_leq(X3,X4))=>int_leq(plus(X1,X3),plus(X2,X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus_and_order1)). 0.61/0.96 fof(plus_commutative, axiom, ![X5, X6]:plus(X5,X6)=plus(X6,X5), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus_commutative)). 0.61/0.96 fof(int_leq, axiom, ![X5, X6]:((X6=X5|int_less(X5,X6))<=>int_leq(X5,X6)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', int_leq)). 0.61/0.96 fof(ut, conjecture, ![X5, X6]:(((int_less(X6,X5)&int_leq(X5,n))&int_leq(int_one,X6))=>real_zero=a(X5,X6)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ut)). 0.61/0.96 fof(plus_and_inverse, axiom, ![X5, X6]:(?[X8]:(plus(X5,X8)=X6&int_less(int_zero,X8))<=>int_less(X5,X6)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus_and_inverse)). 0.61/0.96 fof(plus_zero, axiom, ![X5]:X5=plus(X5,int_zero), file('/export/starexec/sandbox/benchmark/theBenchmark.p', plus_zero)). 0.61/0.96 fof(qii, hypothesis, ![X5, X6]:((((int_leq(int_one,X5)&int_leq(X6,n))&int_leq(int_one,X6))&int_leq(X5,n))=>((![X7]:((int_less(int_zero,X7)&plus(X6,X7)=X5)=>![X8]:(real_zero=a(plus(X8,X7),X8)<=(int_leq(X8,X6)&int_leq(int_one,X8))))&![X8]:((int_leq(X8,X6)&int_leq(int_one,X8))=>a(X8,X8)=real_one))&![X7]:((plus(X5,X7)=X6&int_less(int_zero,X7))=>![X8]:(a(X8,plus(X8,X7))=real_zero<=(int_leq(int_one,X8)&int_leq(X8,X5)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', qii)). 0.61/0.96 fof(c_0_8, plain, ![X6, X5]:(epred1_2(X5,X6)<=>((![X7]:((int_less(int_zero,X7)&plus(X6,X7)=X5)=>![X8]:((int_leq(X8,X6)&int_leq(int_one,X8))=>real_zero=a(plus(X8,X7),X8)))&![X8]:((int_leq(X8,X6)&int_leq(int_one,X8))=>a(X8,X8)=real_one))&![X7]:((plus(X5,X7)=X6&int_less(int_zero,X7))=>![X8]:((int_leq(int_one,X8)&int_leq(X8,X5))=>a(X8,plus(X8,X7))=real_zero)))), introduced(definition)). 0.61/0.96 fof(c_0_9, plain, ![X5, X6, X8]:((int_less(X5,X6)&int_less(X6,X8))=>int_less(X5,X8)), inference(fof_simplification,[status(thm)],[int_less_transitive])). 0.61/0.96 fof(c_0_10, plain, ![X6, X5]:(epred1_2(X5,X6)=>((![X7]:((int_less(int_zero,X7)&plus(X6,X7)=X5)=>![X8]:((int_leq(X8,X6)&int_leq(int_one,X8))=>real_zero=a(plus(X8,X7),X8)))&![X8]:((int_leq(X8,X6)&int_leq(int_one,X8))=>a(X8,X8)=real_one))&![X7]:((plus(X5,X7)=X6&int_less(int_zero,X7))=>![X8]:((int_leq(int_one,X8)&int_leq(X8,X5))=>a(X8,plus(X8,X7))=real_zero)))), inference(split_equiv,[status(thm)],[c_0_8])). 0.61/0.96 fof(c_0_11, plain, ![X38, X39, X40, X41]:(~int_less(X38,X39)|~int_leq(X40,X41)|int_leq(plus(X38,X40),plus(X39,X41))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])])). 0.61/0.96 fof(c_0_12, plain, ![X52, X53]:plus(X52,X53)=plus(X53,X52), inference(variable_rename,[status(thm)],[plus_commutative])). 0.61/0.96 fof(c_0_13, plain, ![X49, X50, X51]:(~int_less(X49,X50)|~int_less(X50,X51)|int_less(X49,X51)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])). 0.61/0.96 fof(c_0_14, plain, ![X47, X48]:(((X48!=X47|int_leq(X47,X48))&(~int_less(X47,X48)|int_leq(X47,X48)))&(~int_leq(X47,X48)|(X48=X47|int_less(X47,X48)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])). 0.61/0.96 fof(c_0_15, negated_conjecture, ~(![X5, X6]:(((int_less(X6,X5)&int_leq(X5,n))&int_leq(int_one,X6))=>real_zero=a(X5,X6))), inference(assume_negation,[status(cth)],[ut])). 0.61/0.96 fof(c_0_16, plain, ![X65, X66, X67, X68, X69, X70, X71]:(((~int_less(int_zero,X67)|plus(X65,X67)!=X66|(~int_leq(X68,X65)|~int_leq(int_one,X68)|real_zero=a(plus(X68,X67),X68))|~epred1_2(X66,X65))&(~int_leq(X69,X65)|~int_leq(int_one,X69)|a(X69,X69)=real_one|~epred1_2(X66,X65)))&(plus(X66,X70)!=X65|~int_less(int_zero,X70)|(~int_leq(int_one,X71)|~int_leq(X71,X66)|a(X71,plus(X71,X70))=real_zero)|~epred1_2(X66,X65))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])). 0.61/0.96 fof(c_0_17, plain, ![X59, X60, X61, X62, X63]:((plus(X59,X61)!=X60|~int_less(int_zero,X61)|int_less(X59,X60))&((plus(X62,esk3_2(X62,X63))=X63|~int_less(X62,X63))&(int_less(int_zero,esk3_2(X62,X63))|~int_less(X62,X63)))), 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])])])])])])). 0.61/0.96 cnf(c_0_18, plain, (int_leq(plus(X1,X3),plus(X2,X4))|~int_less(X1,X2)|~int_leq(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.61/0.96 cnf(c_0_19, plain, (plus(X1,X2)=plus(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.61/0.96 fof(c_0_20, plain, ![X42]:X42=plus(X42,int_zero), inference(variable_rename,[status(thm)],[plus_zero])). 0.61/0.96 cnf(c_0_21, plain, (int_less(X1,X3)|~int_less(X1,X2)|~int_less(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.61/0.96 cnf(c_0_22, plain, (X2=X1|int_less(X1,X2)|~int_leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.61/0.96 fof(c_0_23, negated_conjecture, (((int_less(esk2_0,esk1_0)&int_leq(esk1_0,n))&int_leq(int_one,esk2_0))&real_zero!=a(esk1_0,esk2_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])). 0.61/0.96 cnf(c_0_24, plain, (real_zero=a(plus(X4,X1),X4)|~int_less(int_zero,X1)|plus(X2,X1)!=X3|~int_leq(X4,X2)|~int_leq(int_one,X4)|~epred1_2(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.61/0.96 cnf(c_0_25, plain, (plus(X1,esk3_2(X1,X2))=X2|~int_less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.61/0.96 cnf(c_0_26, plain, (int_less(int_zero,esk3_2(X1,X2))|~int_less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.61/0.96 cnf(c_0_27, plain, (int_leq(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_14])). 0.61/0.96 fof(c_0_28, hypothesis, ![X5, X6]:((((int_leq(int_one,X5)&int_leq(X6,n))&int_leq(int_one,X6))&int_leq(X5,n))=>epred1_2(X5,X6)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[qii]), c_0_8])). 0.61/0.96 cnf(c_0_29, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_leq(X2,X3)|~int_less(X1,X4)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.61/0.96 cnf(c_0_30, plain, (X1=plus(X1,int_zero)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.61/0.96 cnf(c_0_31, plain, (X1=X2|int_less(X3,X2)|~int_leq(X1,X2)|~int_less(X3,X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.61/0.96 cnf(c_0_32, negated_conjecture, (int_leq(esk1_0,n)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.61/0.96 cnf(c_0_33, plain, (a(plus(X1,esk3_2(X2,X3)),X1)=real_zero|~epred1_2(X3,X2)|~int_leq(int_one,X1)|~int_leq(X1,X2)|~int_less(X2,X3)), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25])]), c_0_26])). 0.61/0.96 cnf(c_0_34, plain, (int_leq(X1,X1)), inference(er,[status(thm)],[c_0_27])). 0.61/0.96 fof(c_0_35, hypothesis, ![X43, X44]:(~int_leq(int_one,X43)|~int_leq(X44,n)|~int_leq(int_one,X44)|~int_leq(X43,n)|epred1_2(X43,X44)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])). 0.61/0.96 cnf(c_0_36, plain, (int_leq(plus(X1,X2),X3)|~int_leq(X2,X4)|~int_less(X1,esk3_2(X4,X3))|~int_less(X4,X3)), inference(spm,[status(thm)],[c_0_29, c_0_25])). 0.61/0.96 cnf(c_0_37, plain, (plus(int_zero,X1)=X1), inference(spm,[status(thm)],[c_0_30, c_0_19])). 0.61/0.96 cnf(c_0_38, negated_conjecture, (esk1_0=n|int_less(X1,n)|~int_less(X1,esk1_0)), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.61/0.96 cnf(c_0_39, negated_conjecture, (int_less(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.61/0.96 cnf(c_0_40, plain, (a(X1,X2)=real_zero|~epred1_2(X1,X2)|~int_leq(int_one,X2)|~int_less(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_25]), c_0_34])])). 0.61/0.96 cnf(c_0_41, hypothesis, (epred1_2(X1,X2)|~int_leq(int_one,X1)|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_leq(X1,n)), inference(split_conjunct,[status(thm)],[c_0_35])). 0.61/0.96 cnf(c_0_42, plain, (int_leq(X1,X2)|~int_leq(X1,X3)|~int_less(X3,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_26]), c_0_37])). 0.61/0.96 cnf(c_0_43, plain, (int_leq(X1,X2)|~int_less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.61/0.96 cnf(c_0_44, negated_conjecture, (esk1_0=n|int_less(esk2_0,n)), inference(spm,[status(thm)],[c_0_38, c_0_39])). 0.61/0.96 cnf(c_0_45, negated_conjecture, (real_zero!=a(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.61/0.96 cnf(c_0_46, hypothesis, (a(X1,X2)=real_zero|~int_leq(int_one,X2)|~int_leq(X2,n)|~int_leq(X1,n)|~int_less(X2,X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])). 0.61/0.96 cnf(c_0_47, negated_conjecture, (int_leq(int_one,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.61/0.96 cnf(c_0_48, negated_conjecture, (esk1_0=n|int_leq(esk2_0,n)), inference(spm,[status(thm)],[c_0_43, c_0_44])). 0.61/0.96 cnf(c_0_49, negated_conjecture, (~int_leq(esk2_0,n)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_47]), c_0_32]), c_0_39])])). 0.61/0.96 cnf(c_0_50, negated_conjecture, (int_leq(esk2_0,esk1_0)), inference(spm,[status(thm)],[c_0_43, c_0_39])). 0.61/0.96 cnf(c_0_51, negated_conjecture, (esk1_0=n), inference(sr,[status(thm)],[c_0_48, c_0_49])). 0.61/0.96 cnf(c_0_52, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_50, c_0_51]), c_0_49]), ['proof']). 0.61/0.96 % SZS output end Proof 0.61/0.96 % Total time : 0.312000 s 0.95/0.98 EOF