0.00/0.02 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.09/0.35 % Computer : n026.cluster.edu 0.09/0.35 % Model : x86_64 x86_64 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.35 % Memory : 8046.5625MB 0.09/0.35 % OS : Linux 6.8.0-71-generic 0.09/0.35 % CPULimit : 1440 0.09/0.35 % WCLimit : 180 0.09/0.35 % DateTime : Mon Jul 27 09:20:34 UTC 2026 0.09/0.35 % CPUTime : 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.13/0.39 Running first-order theorem proving 0.13/0.39 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/benchmark/theBenchmark.p 0.13/0.42 % Version: 3.5.1 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN. 0.13/0.42 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.13/0.42 % Starting new_bool_3 with 180s (1) cores 0.13/0.42 % Starting new_bool_1 with 180s (1) cores 0.13/0.42 % Starting sh5l with 180s (1) cores 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2518654 completed with status 0 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN. 0.13/0.42 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.13/0.42 % No SInE strategy applied 0.13/0.42 % Search class: FGHSS-FFMM22-SFFFFFNN 0.13/0.42 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 0.13/0.42 % Starting SubtermCWHack with 82s (1) cores 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 82s (1) cores 0.13/0.42 % Starting new_bool_3 with 82s (1) cores 0.13/0.42 % Starting new_bool_1 with 82s (1) cores 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2518659 completed with status 0 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN. 0.13/0.42 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.13/0.42 % No SInE strategy applied 0.13/0.42 % Search class: FGHSS-FFMM22-SFFFFFNN 0.13/0.42 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 0.13/0.42 % Starting SubtermCWHack with 82s (1) cores 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores 0.13/0.42 % Preprocessing time : 0.002 s 0.13/0.42 % Presaturation interreduction done 0.13/0.42 0.13/0.42 % Proof found! 0.13/0.42 % SZS status Theorem 0.13/0.42 % SZS output start CNFRefutation 0.13/0.42 fof(uti, conjecture, ![X1, X2]:(((X2=X1=>a(X1,X2)!=real_zero)<=((int_leq(X1,n)&int_leq(X2,X1))&int_leq(int_one,X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', uti)). 0.13/0.42 fof(real_constants, axiom, real_one!=real_zero, file('/export/starexec/sandbox/benchmark/theBenchmark.p', real_constants)). 0.13/0.42 fof(qii, hypothesis, ![X1, X2]:(((((int_leq(X1,n)&int_leq(int_one,X2))&int_leq(X2,n))&int_leq(int_one,X1))=>((![X7]:(((int_leq(int_one,X7)&int_leq(X7,X2))=>a(X7,X7)=real_one))&![X8]:((![X7]:((a(X7,plus(X7,X8))=real_zero<=(int_leq(int_one,X7)&int_leq(X7,X1))))<=(int_less(int_zero,X8)&X2=plus(X1,X8)))))&![X8]:(((plus(X2,X8)=X1&int_less(int_zero,X8))=>![X7]:((real_zero=a(plus(X7,X8),X7)<=(int_leq(int_one,X7)&int_leq(X7,X2))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', qii)). 0.13/0.42 fof(int_leq, axiom, ![X1, X2]:(((int_less(X1,X2)|X2=X1)<=>int_leq(X1,X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', int_leq)). 0.13/0.42 fof(c_0_4, negated_conjecture, ~(![X1, X2]:(((X2=X1=>a(X1,X2)!=real_zero)<=((int_leq(X1,n)&int_leq(X2,X1))&int_leq(int_one,X2))))), inference(assume_negation,[status(cth)],[uti])). 0.13/0.42 fof(c_0_5, plain, ![X1, X2]:((epred1_2(X2,X1)<=>((![X7]:(((int_leq(int_one,X7)&int_leq(X7,X2))=>a(X7,X7)=real_one))&![X8]:(((int_less(int_zero,X8)&X2=plus(X1,X8))=>![X7]:(((int_leq(int_one,X7)&int_leq(X7,X1))=>a(X7,plus(X7,X8))=real_zero)))))&![X8]:(((plus(X2,X8)=X1&int_less(int_zero,X8))=>![X7]:(((int_leq(int_one,X7)&int_leq(X7,X2))=>real_zero=a(plus(X7,X8),X7)))))))), introduced(definition)). 0.13/0.42 fof(c_0_6, negated_conjecture, ~(![X1, X2]:((((int_leq(X1,n)&int_leq(X2,X1))&int_leq(int_one,X2))=>(X2=X1=>a(X1,X2)!=real_zero)))), inference(fof_simplification,[status(thm)],[c_0_4])). 0.13/0.42 fof(c_0_7, plain, ![X1, X2]:((epred1_2(X2,X1)=>((![X7]:(((int_leq(int_one,X7)&int_leq(X7,X2))=>a(X7,X7)=real_one))&![X8]:(((int_less(int_zero,X8)&X2=plus(X1,X8))=>![X7]:(((int_leq(int_one,X7)&int_leq(X7,X1))=>a(X7,plus(X7,X8))=real_zero)))))&![X8]:(((plus(X2,X8)=X1&int_less(int_zero,X8))=>![X7]:(((int_leq(int_one,X7)&int_leq(X7,X2))=>real_zero=a(plus(X7,X8),X7)))))))), inference(split_equiv,[status(thm)],[c_0_5])). 0.13/0.42 fof(c_0_8, negated_conjecture, (((int_leq(esk1_0,n)&int_leq(esk2_0,esk1_0))&int_leq(int_one,esk2_0))&(esk2_0=esk1_0&a(esk1_0,esk2_0)=real_zero)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])). 0.13/0.42 fof(c_0_9, plain, real_one!=real_zero, inference(fof_simplification,[status(thm)],[real_constants])). 0.13/0.42 fof(c_0_10, plain, ![X36, X37, X38, X39, X40, X41, X42]:((((~int_leq(int_one,X38)|~int_leq(X38,X37)|a(X38,X38)=real_one|~epred1_2(X37,X36))&(~int_less(int_zero,X39)|X37!=plus(X36,X39)|(~int_leq(int_one,X40)|~int_leq(X40,X36)|a(X40,plus(X40,X39))=real_zero)|~epred1_2(X37,X36)))&(plus(X37,X41)!=X36|~int_less(int_zero,X41)|(~int_leq(int_one,X42)|~int_leq(X42,X37)|real_zero=a(plus(X42,X41),X42))|~epred1_2(X37,X36)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])). 0.13/0.42 cnf(c_0_11, negated_conjecture, (int_leq(int_one,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.13/0.42 cnf(c_0_12, negated_conjecture, (esk2_0=esk1_0), inference(split_conjunct,[status(thm)],[c_0_8])). 0.13/0.42 cnf(c_0_13, negated_conjecture, (a(esk1_0,esk2_0)=real_zero), inference(split_conjunct,[status(thm)],[c_0_8])). 0.13/0.42 fof(c_0_14, plain, real_one!=real_zero, inference(fof_nnf,[status(thm)],[c_0_9])). 0.13/0.42 fof(c_0_15, hypothesis, ![X1, X2]:(((((int_leq(X1,n)&int_leq(int_one,X2))&int_leq(X2,n))&int_leq(int_one,X1))=>epred1_2(X2,X1))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[qii]), c_0_5])). 0.13/0.42 cnf(c_0_16, plain, (a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X1,X2)|~epred1_2(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.13/0.42 cnf(c_0_17, negated_conjecture, (int_leq(int_one,esk1_0)), inference(rw,[status(thm)],[c_0_11, c_0_12])). 0.13/0.42 cnf(c_0_18, negated_conjecture, (a(esk1_0,esk1_0)=real_zero), inference(rw,[status(thm)],[c_0_13, c_0_12])). 0.13/0.42 cnf(c_0_19, plain, (real_one!=real_zero), inference(split_conjunct,[status(thm)],[c_0_14])). 0.13/0.42 fof(c_0_20, hypothesis, ![X18, X19]:((~int_leq(X18,n)|~int_leq(int_one,X19)|~int_leq(X19,n)|~int_leq(int_one,X18)|epred1_2(X19,X18))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])). 0.13/0.42 fof(c_0_21, plain, ![X34, X35]:((((~int_less(X34,X35)|int_leq(X34,X35))&(X35!=X34|int_leq(X34,X35)))&(~int_leq(X34,X35)|(int_less(X34,X35)|X35=X34)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])])). 0.13/0.42 cnf(c_0_22, negated_conjecture, (~epred1_2(X1,X2)|~int_leq(esk1_0,X1)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])). 0.13/0.42 cnf(c_0_23, hypothesis, (epred1_2(X2,X1)|~int_leq(X1,n)|~int_leq(int_one,X2)|~int_leq(X2,n)|~int_leq(int_one,X1)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.13/0.42 cnf(c_0_24, plain, (int_leq(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_21])). 0.13/0.42 cnf(c_0_25, hypothesis, (~int_leq(esk1_0,X1)|~int_leq(X1,n)|~int_leq(X2,n)|~int_leq(int_one,X1)|~int_leq(int_one,X2)), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.13/0.42 cnf(c_0_26, plain, (int_leq(X1,X1)), inference(er,[status(thm)],[c_0_24])). 0.13/0.42 cnf(c_0_27, negated_conjecture, (int_leq(esk1_0,n)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.13/0.42 cnf(c_0_28, hypothesis, (~int_leq(X1,n)|~int_leq(int_one,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_17])])). 0.13/0.42 cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_27]), c_0_17])]), ['proof']). 0.13/0.42 % SZS output end CNFRefutation 0.13/0.42 % Parsed axioms : 13 0.13/0.42 % Removed by relevancy pruning/SinE : 0 0.13/0.42 % Initial clauses : 25 0.13/0.42 % Removed in clause preprocessing : 0 0.13/0.42 % Initial clauses in saturation : 25 0.13/0.42 % Processed clauses : 108 0.13/0.42 % ...of these trivial : 1 0.13/0.42 % ...subsumed : 15 0.13/0.42 % ...remaining for further processing : 92 0.13/0.42 % Other redundant clauses eliminated : 5 0.13/0.42 % Clauses deleted for lack of memory : 0 0.13/0.42 % Backward-subsumed : 5 0.13/0.42 % Backward-rewritten : 1 0.13/0.42 % Generated clauses : 211 0.13/0.42 % ...of the previous two non-redundant : 176 0.13/0.42 % ...aggressively subsumed : 0 0.13/0.42 % Contextual simplify-reflections : 2 0.13/0.42 % Paramodulations : 204 0.13/0.42 % Factorizations : 2 0.13/0.42 % NegExts : 0 0.13/0.42 % Equation resolutions : 5 0.13/0.42 % Disequality decompositions : 0 0.13/0.42 % Total rewrite steps : 41 0.13/0.42 % ...of those cached : 26 0.13/0.42 % Propositional unsat checks : 0 0.13/0.42 % Propositional check models : 0 0.13/0.42 % Propositional check unsatisfiable : 0 0.13/0.42 % Propositional clauses : 0 0.13/0.42 % Propositional clauses after purity: 0 0.13/0.42 % Propositional unsat core size : 0 0.13/0.42 % Propositional preprocessing time : 0.000 0.13/0.42 % Propositional encoding time : 0.000 0.13/0.42 % Propositional solver time : 0.000 0.13/0.42 % Success case prop preproc time : 0.000 0.13/0.42 % Success case prop encoding time : 0.000 0.13/0.42 % Success case prop solver time : 0.000 0.13/0.42 % Current number of processed clauses : 57 0.13/0.42 % Positive orientable unit clauses : 9 0.13/0.42 % Positive unorientable unit clauses: 1 0.13/0.42 % Negative unit clauses : 4 0.13/0.42 % Non-unit-clauses : 43 0.13/0.42 % Current number of unprocessed clauses: 109 0.13/0.42 % ...number of literals in the above : 367 0.13/0.42 % Current number of archived formulas : 0 0.13/0.42 % Current number of archived clauses : 30 0.13/0.42 % Clause-clause subsumption calls (NU) : 260 0.13/0.42 % Rec. Clause-clause subsumption calls : 150 0.13/0.42 % Non-unit clause-clause subsumptions : 20 0.13/0.42 % Unit Clause-clause subsumption calls : 3 0.13/0.42 % Rewrite failures with RHS unbound : 0 0.13/0.42 % BW rewrite match attempts : 10 0.13/0.42 % BW rewrite match successes : 5 0.13/0.42 % Condensation attempts : 0 0.13/0.42 % Condensation successes : 0 0.13/0.42 % Termbank termtop insertions : 3964 0.13/0.42 % Search garbage collected termcells : 397 0.13/0.42 0.13/0.42 % ------------------------------------------------- 0.13/0.42 % User time : 0.010 s 0.13/0.42 % System time : 0.005 s 0.13/0.42 % Total time : 0.015 s 0.13/0.42 % Maximum resident set size: 3644 pages 0.13/0.42 0.13/0.42 % ------------------------------------------------- 0.13/0.42 % User time : 0.037 s 0.13/0.42 % System time : 0.013 s 0.13/0.42 % Total time : 0.050 s 0.13/0.42 % Maximum resident set size: 4608 pages 0.13/0.42 % E exiting 0.13/0.42 EOF