0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.09/0.35 % Computer : n010.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.36 % CPULimit : 1440 0.09/0.36 % WCLimit : 180 0.09/0.36 % DateTime : Mon Jul 27 09:54:49 UTC 2026 0.09/0.36 % CPUTime : 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.14/0.42 Running first-order theorem proving 0.14/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 0.14/0.44 % Version: 3.5.1 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN. 0.14/0.44 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.14/0.44 % Starting new_bool_3 with 180s (1) cores 0.14/0.44 % Starting new_bool_1 with 180s (1) cores 0.14/0.44 % Starting sh5l with 180s (1) cores 0.14/0.44 % new_bool_3 with pid 966923 completed with status 0 0.14/0.44 % Result found by new_bool_3 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN. 0.14/0.44 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.14/0.44 % Starting new_bool_3 with 180s (1) cores 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)) 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.14/0.44 % Search class: FHHSF-FFSS11-SFFFFFNN 0.14/0.44 % partial match(1): FGHSF-FFSS11-SFFFFFNN 0.14/0.44 % Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.14/0.44 % Starting SubtermCWHack with 19s (1) cores 0.14/0.44 % SubtermCWHack with pid 966929 completed with status 0 0.14/0.44 % Result found by SubtermCWHack 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN. 0.14/0.44 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.14/0.44 % Starting new_bool_3 with 180s (1) cores 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)) 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.14/0.44 % Search class: FHHSF-FFSS11-SFFFFFNN 0.14/0.44 % partial match(1): FGHSF-FFSS11-SFFFFFNN 0.14/0.44 % Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.14/0.44 % Starting SubtermCWHack with 19s (1) cores 0.14/0.44 % Preprocessing time : 0.001 s 0.14/0.44 0.14/0.44 % Proof found! 0.14/0.44 % SZS status Theorem 0.14/0.44 % SZS output start CNFRefutation 0.14/0.44 fof(prove, conjecture, (![X1]:((grocer(X1)=>~(?[X2]:((X1=X2&cyclist(X2))))))<=((((((((![X3]:((((property1(X3,honest,pos)&property1(X3,industrious,pos))&person(X3))=>?[X4]:((property1(X4,healthy,pos)&X3=X4))))&![X5]:((?[X6]:((property1(X6,honest,pos)&X5=X6))<=(property1(X5,industrious,pos)&grocer(X5)))))&![X7]:((cyclist(X7)=>?[X8]:((X8=X7&property1(X8,industrious,pos))))))&![X9]:(((property1(X9,unhealthy,pos)&cyclist(X9))=>?[X10]:((X9=X10&property1(X10,dishonest,pos))))))&![X11]:((~(?[X12]:((property1(X12,unhealthy,pos)&X12=X11)))<=(person(X11)&property1(X11,healthy,pos)))))&![X13]:((~(?[X14]:((property1(X14,dishonest,pos)&X14=X13)))<=(property1(X13,honest,pos)&person(X13)))))&![X15]:((cyclist(X15)=>?[X16]:((person(X16)&X16=X15)))))&![X17]:((?[X18]:((person(X18)&X17=X18))<=grocer(X17))))&![X19]:((~(?[X20]:((property1(X20,healthy,pos)&X19=X20)))<=grocer(X19))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)). 0.14/0.44 fof(c_0_1, plain, (epred1_0<=>((((((((![X3]:((((property1(X3,honest,pos)&property1(X3,industrious,pos))&person(X3))=>?[X4]:((property1(X4,healthy,pos)&X3=X4))))&![X5]:(((property1(X5,industrious,pos)&grocer(X5))=>?[X6]:((property1(X6,honest,pos)&X5=X6)))))&![X7]:((cyclist(X7)=>?[X8]:((X8=X7&property1(X8,industrious,pos))))))&![X9]:(((property1(X9,unhealthy,pos)&cyclist(X9))=>?[X10]:((X9=X10&property1(X10,dishonest,pos))))))&![X11]:(((person(X11)&property1(X11,healthy,pos))=>~(?[X12]:((property1(X12,unhealthy,pos)&X12=X11))))))&![X13]:(((property1(X13,honest,pos)&person(X13))=>~(?[X14]:((property1(X14,dishonest,pos)&X14=X13))))))&![X15]:((cyclist(X15)=>?[X16]:((person(X16)&X16=X15)))))&![X17]:((grocer(X17)=>?[X18]:((person(X18)&X17=X18)))))&![X19]:((grocer(X19)=>~(?[X20]:((property1(X20,healthy,pos)&X19=X20))))))), introduced(definition)). 0.14/0.44 fof(c_0_2, negated_conjecture, ~((![X1]:((grocer(X1)=>~(?[X2]:((X1=X2&cyclist(X2))))))<=((((((((![X3]:((((property1(X3,honest,pos)&property1(X3,industrious,pos))&person(X3))=>?[X4]:((property1(X4,healthy,pos)&X3=X4))))&![X5]:((?[X6]:((property1(X6,honest,pos)&X5=X6))<=(property1(X5,industrious,pos)&grocer(X5)))))&![X7]:((cyclist(X7)=>?[X8]:((X8=X7&property1(X8,industrious,pos))))))&![X9]:(((property1(X9,unhealthy,pos)&cyclist(X9))=>?[X10]:((X9=X10&property1(X10,dishonest,pos))))))&![X11]:((~(?[X12]:((property1(X12,unhealthy,pos)&X12=X11)))<=(person(X11)&property1(X11,healthy,pos)))))&![X13]:((~(?[X14]:((property1(X14,dishonest,pos)&X14=X13)))<=(property1(X13,honest,pos)&person(X13)))))&![X15]:((cyclist(X15)=>?[X16]:((person(X16)&X16=X15)))))&![X17]:((?[X18]:((person(X18)&X17=X18))<=grocer(X17))))&![X19]:((~(?[X20]:((property1(X20,healthy,pos)&X19=X20)))<=grocer(X19)))))), inference(assume_negation,[status(cth)],[prove])). 0.14/0.44 fof(c_0_3, plain, (epred1_0=>((((((((![X3]:((((property1(X3,honest,pos)&property1(X3,industrious,pos))&person(X3))=>?[X4]:((property1(X4,healthy,pos)&X3=X4))))&![X5]:(((property1(X5,industrious,pos)&grocer(X5))=>?[X6]:((property1(X6,honest,pos)&X5=X6)))))&![X7]:((cyclist(X7)=>?[X8]:((X8=X7&property1(X8,industrious,pos))))))&![X9]:(((property1(X9,unhealthy,pos)&cyclist(X9))=>?[X10]:((X9=X10&property1(X10,dishonest,pos))))))&![X11]:(((person(X11)&property1(X11,healthy,pos))=>~(?[X12]:((property1(X12,unhealthy,pos)&X12=X11))))))&![X13]:(((property1(X13,honest,pos)&person(X13))=>~(?[X14]:((property1(X14,dishonest,pos)&X14=X13))))))&![X15]:((cyclist(X15)=>?[X16]:((person(X16)&X16=X15)))))&![X17]:((grocer(X17)=>?[X18]:((person(X18)&X17=X18)))))&![X19]:((grocer(X19)=>~(?[X20]:((property1(X20,healthy,pos)&X19=X20))))))), inference(split_equiv,[status(thm)],[c_0_1])). 0.14/0.44 fof(c_0_4, negated_conjecture, ~((epred1_0=>![X1]:((grocer(X1)=>~(?[X2]:((X1=X2&cyclist(X2)))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]), c_0_1])). 0.14/0.44 fof(c_0_5, plain, ![X23, X25, X27, X29, X31, X32, X33, X34, X35, X37, X39, X40]:(((((((((((property1(esk3_1(X23),healthy,pos)|(~property1(X23,honest,pos)|~property1(X23,industrious,pos)|~person(X23))|~epred1_0)&(X23=esk3_1(X23)|(~property1(X23,honest,pos)|~property1(X23,industrious,pos)|~person(X23))|~epred1_0))&((property1(esk4_1(X25),honest,pos)|(~property1(X25,industrious,pos)|~grocer(X25))|~epred1_0)&(X25=esk4_1(X25)|(~property1(X25,industrious,pos)|~grocer(X25))|~epred1_0)))&((esk5_1(X27)=X27|~cyclist(X27)|~epred1_0)&(property1(esk5_1(X27),industrious,pos)|~cyclist(X27)|~epred1_0)))&((X29=esk6_1(X29)|(~property1(X29,unhealthy,pos)|~cyclist(X29))|~epred1_0)&(property1(esk6_1(X29),dishonest,pos)|(~property1(X29,unhealthy,pos)|~cyclist(X29))|~epred1_0)))&(~person(X31)|~property1(X31,healthy,pos)|(~property1(X32,unhealthy,pos)|X32!=X31)|~epred1_0))&(~property1(X33,honest,pos)|~person(X33)|(~property1(X34,dishonest,pos)|X34!=X33)|~epred1_0))&((person(esk7_1(X35))|~cyclist(X35)|~epred1_0)&(esk7_1(X35)=X35|~cyclist(X35)|~epred1_0)))&((person(esk8_1(X37))|~grocer(X37)|~epred1_0)&(X37=esk8_1(X37)|~grocer(X37)|~epred1_0)))&(~grocer(X39)|(~property1(X40,healthy,pos)|X39!=X40)|~epred1_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])). 0.14/0.44 fof(c_0_6, negated_conjecture, (epred1_0&(grocer(esk1_0)&(esk1_0=esk2_0&cyclist(esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 0.14/0.44 cnf(c_0_7, plain, (property1(esk3_1(X1),healthy,pos)|~property1(X1,honest,pos)|~property1(X1,industrious,pos)|~person(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_8, negated_conjecture, (epred1_0), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.44 cnf(c_0_9, plain, (X1=esk3_1(X1)|~property1(X1,honest,pos)|~property1(X1,industrious,pos)|~person(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_10, plain, (person(esk8_1(X1))|~grocer(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_11, plain, (X1=esk8_1(X1)|~grocer(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_12, plain, (property1(esk4_1(X1),honest,pos)|~property1(X1,industrious,pos)|~grocer(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_13, plain, (X1=esk4_1(X1)|~property1(X1,industrious,pos)|~grocer(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_14, plain, (property1(esk5_1(X1),industrious,pos)|~cyclist(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_15, plain, (esk5_1(X1)=X1|~cyclist(X1)|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_16, plain, (property1(esk3_1(X1),healthy,pos)|~person(X1)|~property1(X1,honest,pos)|~property1(X1,industrious,pos)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])). 0.14/0.44 cnf(c_0_17, plain, (esk3_1(X1)=X1|~person(X1)|~property1(X1,honest,pos)|~property1(X1,industrious,pos)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_8])])). 0.14/0.44 cnf(c_0_18, plain, (person(esk8_1(X1))|~grocer(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_8])])). 0.14/0.44 cnf(c_0_19, plain, (esk8_1(X1)=X1|~grocer(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_8])])). 0.14/0.44 cnf(c_0_20, plain, (property1(esk4_1(X1),honest,pos)|~property1(X1,industrious,pos)|~grocer(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_8])])). 0.14/0.44 cnf(c_0_21, plain, (esk4_1(X1)=X1|~property1(X1,industrious,pos)|~grocer(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_8])])). 0.14/0.44 cnf(c_0_22, plain, (~grocer(X1)|~property1(X2,healthy,pos)|X1!=X2|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.44 cnf(c_0_23, plain, (property1(esk5_1(X1),industrious,pos)|~cyclist(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_8])])). 0.14/0.44 cnf(c_0_24, plain, (esk5_1(X1)=X1|~cyclist(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_8])])). 0.14/0.44 cnf(c_0_25, negated_conjecture, (cyclist(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.44 cnf(c_0_26, negated_conjecture, (esk1_0=esk2_0), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.44 cnf(c_0_27, plain, (property1(X1,healthy,pos)|~person(X1)|~property1(X1,honest,pos)|~property1(X1,industrious,pos)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.14/0.44 cnf(c_0_28, plain, (person(X1)|~grocer(X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.14/0.44 cnf(c_0_29, plain, (property1(X1,honest,pos)|~property1(X1,industrious,pos)|~grocer(X1)), inference(spm,[status(thm)],[c_0_20, c_0_21])). 0.14/0.44 cnf(c_0_30, plain, (~property1(X1,healthy,pos)|~grocer(X1)), inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_8])])])). 0.14/0.44 cnf(c_0_31, plain, (property1(X1,industrious,pos)|~cyclist(X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.14/0.44 cnf(c_0_32, negated_conjecture, (cyclist(esk1_0)), inference(rw,[status(thm)],[c_0_25, c_0_26])). 0.14/0.44 cnf(c_0_33, plain, (~property1(X1,industrious,pos)|~grocer(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29]), c_0_30])). 0.14/0.44 cnf(c_0_34, negated_conjecture, (grocer(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.44 cnf(c_0_35, negated_conjecture, (property1(esk1_0,industrious,pos)), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.14/0.44 cnf(c_0_36, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])]), ['proof']). 0.14/0.44 % SZS output end CNFRefutation 0.14/0.44 % Parsed axioms : 1 0.14/0.44 % Removed by relevancy pruning/SinE : 0 0.14/0.44 % Initial clauses : 19 0.14/0.44 % Removed in clause preprocessing : 0 0.14/0.44 % Initial clauses in saturation : 19 0.14/0.44 % Processed clauses : 50 0.14/0.44 % ...of these trivial : 0 0.14/0.44 % ...subsumed : 7 0.14/0.44 % ...remaining for further processing : 43 0.14/0.44 % Other redundant clauses eliminated : 3 0.14/0.44 % Clauses deleted for lack of memory : 0 0.14/0.44 % Backward-subsumed : 4 0.14/0.44 % Backward-rewritten : 1 0.14/0.44 % Generated clauses : 34 0.14/0.44 % ...of the previous two non-redundant : 34 0.14/0.44 % ...aggressively subsumed : 0 0.14/0.44 % Contextual simplify-reflections : 2 0.14/0.44 % Paramodulations : 31 0.14/0.44 % Factorizations : 0 0.14/0.44 % NegExts : 0 0.14/0.44 % Equation resolutions : 3 0.14/0.44 % Disequality decompositions : 0 0.14/0.44 % Total rewrite steps : 20 0.14/0.44 % ...of those cached : 16 0.14/0.44 % Propositional unsat checks : 0 0.14/0.44 % Propositional check models : 0 0.14/0.44 % Propositional check unsatisfiable : 0 0.14/0.44 % Propositional clauses : 0 0.14/0.44 % Propositional clauses after purity: 0 0.14/0.44 % Propositional unsat core size : 0 0.14/0.44 % Propositional preprocessing time : 0.000 0.14/0.44 % Propositional encoding time : 0.000 0.14/0.44 % Propositional solver time : 0.000 0.14/0.44 % Success case prop preproc time : 0.000 0.14/0.44 % Success case prop encoding time : 0.000 0.14/0.44 % Success case prop solver time : 0.000 0.14/0.44 % Current number of processed clauses : 35 0.14/0.44 % Positive orientable unit clauses : 6 0.14/0.44 % Positive unorientable unit clauses: 0 0.14/0.44 % Negative unit clauses : 3 0.14/0.44 % Non-unit-clauses : 26 0.14/0.44 % Current number of unprocessed clauses: 3 0.14/0.44 % ...number of literals in the above : 12 0.14/0.44 % Current number of archived formulas : 0 0.14/0.44 % Current number of archived clauses : 5 0.14/0.44 % Clause-clause subsumption calls (NU) : 214 0.14/0.44 % Rec. Clause-clause subsumption calls : 183 0.14/0.44 % Non-unit clause-clause subsumptions : 10 0.14/0.44 % Unit Clause-clause subsumption calls : 29 0.14/0.44 % Rewrite failures with RHS unbound : 0 0.14/0.44 % BW rewrite match attempts : 1 0.14/0.44 % BW rewrite match successes : 1 0.14/0.44 % Condensation attempts : 0 0.14/0.44 % Condensation successes : 0 0.14/0.44 % Termbank termtop insertions : 2127 0.14/0.44 % Search garbage collected termcells : 386 0.14/0.44 0.14/0.44 % ------------------------------------------------- 0.14/0.44 % User time : 0.005 s 0.14/0.44 % System time : 0.001 s 0.14/0.44 % Total time : 0.007 s 0.14/0.44 % Maximum resident set size: 3648 pages 0.14/0.44 0.14/0.44 % ------------------------------------------------- 0.14/0.44 % User time : 0.007 s 0.14/0.44 % System time : 0.005 s 0.14/0.44 % Total time : 0.012 s 0.14/0.44 % Maximum resident set size: 4608 pages 0.14/0.44 % E exiting 0.14/0.44 EOF