0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n004.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 16:42:39 EDT 2021 0.13/0.34 % CPUTime : 0.19/0.46 Running first-order theorem proving 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.46 # Version: 2.6 0.19/0.46 # No SInE strategy applied 0.19/0.46 # Trying AutoSched0 for 59 seconds 0.19/0.50 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002I 0.19/0.50 # and selection function SelectNegativeLiterals. 0.19/0.50 # 0.19/0.50 # Preprocessing time : 0.028 s 0.19/0.50 # Presaturation interreduction done 0.19/0.50 0.19/0.50 # Proof found! 0.19/0.50 # SZS status Theorem 0.19/0.50 # SZS output start CNFRefutation 0.19/0.50 fof(background, axiom, ?[X1, X2, X3]:(((((((((((((modifier_pp(X2,in,'DreadburyMansion')&predicate2(X3,kill,X1,'AuntAgatha'))&~(?[X4]:predicate2(X4,hate,'AuntAgatha','Butler')))&![X5]:(?[X6]:predicate2(X6,hate,'AuntAgatha',X5)<=('Butler'!=X5&$true)))&'AuntAgatha'!='Butler')&![X7]:(~(![X8]:(?[X9]:predicate2(X9,hate,X7,X8)<=$true))<=$true))&![X10, X11]:(($true&predicate2(X11,hate,'AuntAgatha',X10))=>?[X12]:predicate2(X12,hate,'Butler',X10)))&![X13]:(?[X14]:predicate2(X14,hate,'Butler',X13)<=(~(?[X15]:(X15=X13&property2(X15,rich,comp_than,'AuntAgatha')))&$true)))&![X16, X17]:((predicate2(X17,hate,'AuntAgatha',X16)&$true)=>~(?[X18]:predicate2(X18,hate,'Charles',X16))))&![X19]:($true=>~(?[X20, X21, X22]:((($true&X22=X19)&property2(X22,rich,comp_than,X20))&predicate2(X21,kill,X19,X20)))))&![X23]:($true=>![X24, X25]:((predicate2(X25,kill,X23,X24)&$true)=>?[X26]:predicate2(X26,hate,X23,X24))))&![X27, X28]:(((predicate1(X28,live,X27)&modifier_pp(X28,in,'DreadburyMansion'))&$true)=>(X27='Charles'|X27='Butler'|'AuntAgatha'=X27)))&predicate1(X2,live,X1))&$true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', background)). 0.19/0.50 fof(prove, conjecture, ?[X1]:predicate2(X1,kill,'AuntAgatha','AuntAgatha'), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)). 0.19/0.50 fof(c_0_2, plain, ?[X1, X2, X3]:((((((((((((modifier_pp(X2,in,'DreadburyMansion')&predicate2(X3,kill,X1,'AuntAgatha'))&~(?[X4]:predicate2(X4,hate,'AuntAgatha','Butler')))&![X5]:('Butler'!=X5=>?[X6]:predicate2(X6,hate,'AuntAgatha',X5)))&'AuntAgatha'!='Butler')&![X7]:~(![X8]:?[X9]:predicate2(X9,hate,X7,X8)))&![X10, X11]:(predicate2(X11,hate,'AuntAgatha',X10)=>?[X12]:predicate2(X12,hate,'Butler',X10)))&![X13]:(~(?[X15]:(X15=X13&property2(X15,rich,comp_than,'AuntAgatha')))=>?[X14]:predicate2(X14,hate,'Butler',X13)))&![X16, X17]:(predicate2(X17,hate,'AuntAgatha',X16)=>~(?[X18]:predicate2(X18,hate,'Charles',X16))))&![X19]:~(?[X20, X21, X22]:((X22=X19&property2(X22,rich,comp_than,X20))&predicate2(X21,kill,X19,X20))))&![X23, X24, X25]:(predicate2(X25,kill,X23,X24)=>?[X26]:predicate2(X26,hate,X23,X24)))&![X27, X28]:((predicate1(X28,live,X27)&modifier_pp(X28,in,'DreadburyMansion'))=>(X27='Charles'|X27='Butler'|'AuntAgatha'=X27)))&predicate1(X2,live,X1)), inference(fof_simplification,[status(thm)],[background])). 0.19/0.50 fof(c_0_3, plain, ![X62, X63, X65, X67, X68, X69, X71, X74, X75, X76, X77, X78, X79, X80, X81, X82, X83, X85, X86]:((((((((((((modifier_pp(esk2_0,in,'DreadburyMansion')&predicate2(esk3_0,kill,esk1_0,'AuntAgatha'))&~predicate2(X62,hate,'AuntAgatha','Butler'))&('Butler'=X63|predicate2(esk4_1(X63),hate,'AuntAgatha',X63)))&'AuntAgatha'!='Butler')&~predicate2(X67,hate,X65,esk5_1(X65)))&(~predicate2(X69,hate,'AuntAgatha',X68)|predicate2(esk6_2(X68,X69),hate,'Butler',X68)))&((esk7_1(X71)=X71|predicate2(esk8_1(X71),hate,'Butler',X71))&(property2(esk7_1(X71),rich,comp_than,'AuntAgatha')|predicate2(esk8_1(X71),hate,'Butler',X71))))&(~predicate2(X75,hate,'AuntAgatha',X74)|~predicate2(X76,hate,'Charles',X74)))&(X80!=X77|~property2(X80,rich,comp_than,X78)|~predicate2(X79,kill,X77,X78)))&(~predicate2(X83,kill,X81,X82)|predicate2(esk9_3(X81,X82,X83),hate,X81,X82)))&(~predicate1(X86,live,X85)|~modifier_pp(X86,in,'DreadburyMansion')|(X85='Charles'|X85='Butler'|'AuntAgatha'=X85)))&predicate1(esk2_0,live,esk1_0)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])). 0.19/0.50 cnf(c_0_4, plain, (X2='Charles'|X2='Butler'|'AuntAgatha'=X2|~predicate1(X1,live,X2)|~modifier_pp(X1,in,'DreadburyMansion')), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_5, plain, (predicate1(esk2_0,live,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_6, plain, (modifier_pp(esk2_0,in,'DreadburyMansion')), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_7, plain, (predicate2(esk3_0,kill,esk1_0,'AuntAgatha')), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_8, plain, (esk1_0='AuntAgatha'|esk1_0='Charles'|esk1_0='Butler'), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_5]), c_0_6])])). 0.19/0.50 cnf(c_0_9, plain, (~predicate2(X1,hate,X2,esk5_1(X2))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_10, plain, (esk7_1(X1)=X1|predicate2(esk8_1(X1),hate,'Butler',X1)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_11, plain, (~predicate2(X1,hate,'AuntAgatha',X2)|~predicate2(X3,hate,'Charles',X2)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_12, plain, ('Butler'=X1|predicate2(esk4_1(X1),hate,'AuntAgatha',X1)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_13, plain, (predicate2(esk9_3(X2,X3,X1),hate,X2,X3)|~predicate2(X1,kill,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_14, plain, (esk1_0='Butler'|esk1_0='AuntAgatha'|predicate2(esk3_0,kill,'Charles','AuntAgatha')), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.19/0.50 cnf(c_0_15, plain, (X1!=X2|~property2(X1,rich,comp_than,X3)|~predicate2(X4,kill,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_16, plain, (property2(esk7_1(X1),rich,comp_than,'AuntAgatha')|predicate2(esk8_1(X1),hate,'Butler',X1)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_17, plain, (esk7_1(esk5_1('Butler'))=esk5_1('Butler')), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.19/0.50 cnf(c_0_18, plain, (predicate2(esk6_2(X2,X1),hate,'Butler',X2)|~predicate2(X1,hate,'AuntAgatha',X2)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_19, plain, ('Butler'=X1|~predicate2(X2,hate,'Charles',X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.19/0.50 cnf(c_0_20, plain, (esk1_0='AuntAgatha'|esk1_0='Butler'|predicate2(esk9_3('Charles','AuntAgatha',esk3_0),hate,'Charles','AuntAgatha')), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.19/0.50 cnf(c_0_21, plain, ('AuntAgatha'!='Butler'), inference(split_conjunct,[status(thm)],[c_0_3])). 0.19/0.50 cnf(c_0_22, plain, (~property2(X1,rich,comp_than,X2)|~predicate2(X3,kill,X1,X2)), inference(er,[status(thm)],[c_0_15])). 0.19/0.50 cnf(c_0_23, plain, (property2(esk5_1('Butler'),rich,comp_than,'AuntAgatha')), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_9])). 0.19/0.50 cnf(c_0_24, plain, ('Butler'=X1|predicate2(esk6_2(X1,esk4_1(X1)),hate,'Butler',X1)), inference(spm,[status(thm)],[c_0_18, c_0_12])). 0.19/0.50 cnf(c_0_25, plain, (esk1_0='Butler'|esk1_0='AuntAgatha'), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])). 0.19/0.50 cnf(c_0_26, plain, (~predicate2(X1,kill,esk5_1('Butler'),'AuntAgatha')), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.19/0.50 cnf(c_0_27, plain, (esk5_1('Butler')='Butler'), inference(spm,[status(thm)],[c_0_9, c_0_24])). 0.19/0.50 fof(c_0_28, negated_conjecture, ~(?[X1]:predicate2(X1,kill,'AuntAgatha','AuntAgatha')), inference(assume_negation,[status(cth)],[prove])). 0.19/0.50 cnf(c_0_29, plain, (esk1_0='AuntAgatha'|predicate2(esk3_0,kill,'Butler','AuntAgatha')), inference(spm,[status(thm)],[c_0_7, c_0_25])). 0.19/0.50 cnf(c_0_30, plain, (~predicate2(X1,kill,'Butler','AuntAgatha')), inference(rw,[status(thm)],[c_0_26, c_0_27])). 0.19/0.50 fof(c_0_31, negated_conjecture, ![X58]:~predicate2(X58,kill,'AuntAgatha','AuntAgatha'), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])). 0.19/0.50 cnf(c_0_32, plain, (esk1_0='AuntAgatha'), inference(sr,[status(thm)],[c_0_29, c_0_30])). 0.19/0.50 cnf(c_0_33, negated_conjecture, (~predicate2(X1,kill,'AuntAgatha','AuntAgatha')), inference(split_conjunct,[status(thm)],[c_0_31])). 0.19/0.50 cnf(c_0_34, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_32]), c_0_33]), ['proof']). 0.19/0.50 # SZS output end CNFRefutation 0.19/0.50 # Proof object total steps : 35 0.19/0.50 # Proof object clause steps : 29 0.19/0.50 # Proof object formula steps : 6 0.19/0.50 # Proof object conjectures : 4 0.19/0.50 # Proof object clause conjectures : 1 0.19/0.50 # Proof object formula conjectures : 3 0.19/0.50 # Proof object initial clauses used : 14 0.19/0.50 # Proof object initial formulas used : 2 0.19/0.50 # Proof object generating inferences : 11 0.19/0.50 # Proof object simplifying inferences : 9 0.19/0.50 # Training examples: 0 positive, 0 negative 0.19/0.50 # Parsed axioms : 2 0.19/0.50 # Removed by relevancy pruning/SinE : 0 0.19/0.50 # Initial clauses : 15 0.19/0.50 # Removed in clause preprocessing : 0 0.19/0.50 # Initial clauses in saturation : 15 0.19/0.50 # Processed clauses : 53 0.19/0.50 # ...of these trivial : 0 0.19/0.50 # ...subsumed : 3 0.19/0.50 # ...remaining for further processing : 50 0.19/0.50 # Other redundant clauses eliminated : 1 0.19/0.50 # Clauses deleted for lack of memory : 0 0.19/0.50 # Backward-subsumed : 6 0.19/0.50 # Backward-rewritten : 7 0.19/0.50 # Generated clauses : 29 0.19/0.50 # ...of the previous two non-trivial : 34 0.19/0.50 # Contextual simplify-reflections : 0 0.19/0.50 # Paramodulations : 24 0.19/0.50 # Factorizations : 3 0.19/0.50 # NegExts : 0 0.19/0.50 # Equation resolutions : 1 0.19/0.50 # Propositional unsat checks : 0 0.19/0.50 # Propositional check models : 0 0.19/0.50 # Propositional check unsatisfiable : 0 0.19/0.50 # Propositional clauses : 0 0.19/0.50 # Propositional clauses after purity: 0 0.19/0.50 # Propositional unsat core size : 0 0.19/0.50 # Propositional preprocessing time : 0.000 0.19/0.50 # Propositional encoding time : 0.000 0.19/0.50 # Propositional solver time : 0.000 0.19/0.50 # Success case prop preproc time : 0.000 0.19/0.50 # Success case prop encoding time : 0.000 0.19/0.50 # Success case prop solver time : 0.000 0.19/0.50 # Current number of processed clauses : 20 0.19/0.50 # Positive orientable unit clauses : 4 0.19/0.50 # Positive unorientable unit clauses: 0 0.19/0.50 # Negative unit clauses : 5 0.19/0.50 # Non-unit-clauses : 11 0.19/0.50 # Current number of unprocessed clauses: 9 0.19/0.50 # ...number of literals in the above : 18 0.19/0.50 # Current number of archived formulas : 0 0.19/0.50 # Current number of archived clauses : 29 0.19/0.50 # Clause-clause subsumption calls (NU) : 26 0.19/0.50 # Rec. Clause-clause subsumption calls : 25 0.19/0.50 # Non-unit clause-clause subsumptions : 6 0.19/0.50 # Unit Clause-clause subsumption calls : 6 0.19/0.50 # Rewrite failures with RHS unbound : 0 0.19/0.50 # BW rewrite match attempts : 2 0.19/0.50 # BW rewrite match successes : 2 0.19/0.50 # Condensation attempts : 0 0.19/0.50 # Condensation successes : 0 0.19/0.50 # Termbank termtop insertions : 1867 0.19/0.50 0.19/0.50 # ------------------------------------------------- 0.19/0.50 # User time : 0.031 s 0.19/0.50 # System time : 0.002 s 0.19/0.50 # Total time : 0.033 s 0.19/0.50 # Maximum resident set size: 1616 pages 0.19/0.50 EOF