0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.11 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.10/0.31 % Computer : n011.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 06:34:16 EDT 2020 0.17/0.31 % CPUTime : 0.17/0.31 # Version: 2.5pre002 0.17/0.32 # No SInE strategy applied 0.17/0.32 # Trying AutoSched0 for 59 seconds 0.17/0.35 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S 0.17/0.35 # and selection function SelectNewComplexAHP. 0.17/0.35 # 0.17/0.35 # Preprocessing time : 0.029 s 0.17/0.35 # Presaturation interreduction done 0.17/0.35 0.17/0.35 # Proof found! 0.17/0.35 # SZS status Theorem 0.17/0.35 # SZS output start CNFRefutation 0.17/0.35 fof(axiom_6, axiom, ![X54, X55]:(id(X55,X54)|~(id(X54,X55))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_6)). 0.17/0.35 fof(axiom_4a, axiom, ![X59]:?[X60]:(?[X61]:(r1(X61)&r3(X59,X61,X60))&id(X60,X59)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_4a)). 0.17/0.35 fof(xplustwoidy, conjecture, ?[X23, X9, X10]:(?[X64]:(r3(X23,X64,X10)&?[X66]:(r2(X66,X64)&?[X12]:(r2(X12,X66)&r1(X12))))&id(X10,X9)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', xplustwoidy)). 0.17/0.35 fof(axiom_7, axiom, ![X56, X57, X58]:(~(id(X57,X58))|id(X56,X58)|~(id(X56,X57))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_7)). 0.17/0.35 fof(axiom_1a, axiom, ![X62, X63]:?[X64]:(?[X65]:(r3(X62,X63,X65)&r2(X65,X64))&?[X66]:(id(X66,X64)&?[X67]:(r2(X63,X67)&r3(X62,X67,X66)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_1a)). 0.17/0.35 fof(axiom_2, axiom, ![X41]:?[X42]:![X43]:((~(id(X43,X42))&~(r2(X41,X43)))|(id(X43,X42)&r2(X41,X43))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_2)). 0.17/0.35 fof(axiom_5, axiom, ![X25]:id(X25,X25), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_5)). 0.17/0.35 fof(axiom_1, axiom, ?[X19]:![X20]:((id(X20,X19)&r1(X20))|(~(id(X20,X19))&~(r1(X20)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_1)). 0.17/0.35 fof(c_0_8, plain, ![X121, X122]:(id(X122,X121)|~id(X121,X122)), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_6])])). 0.17/0.35 fof(c_0_9, plain, ![X126]:((r1(esk16_1(X126))&r3(X126,esk16_1(X126),esk15_1(X126)))&id(esk15_1(X126),X126)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])])). 0.17/0.35 fof(c_0_10, negated_conjecture, ~(?[X23, X9, X10]:(?[X64]:(r3(X23,X64,X10)&?[X66]:(r2(X66,X64)&?[X12]:(r2(X12,X66)&r1(X12))))&id(X10,X9))), inference(assume_negation,[status(cth)],[xplustwoidy])). 0.17/0.35 fof(c_0_11, plain, ![X123, X124, X125]:(~id(X124,X125)|id(X123,X125)|~id(X123,X124)), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7])])). 0.17/0.35 cnf(c_0_12, plain, (id(X1,X2)|~id(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.17/0.35 cnf(c_0_13, plain, (id(esk15_1(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.17/0.35 fof(c_0_14, negated_conjecture, ![X135, X136, X137, X138, X139, X140]:(~r3(X135,X138,X137)|(~r2(X139,X138)|(~r2(X140,X139)|~r1(X140)))|~id(X137,X136)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])). 0.17/0.35 fof(c_0_15, plain, ![X129, X130]:((r3(X129,X130,esk18_2(X129,X130))&r2(esk18_2(X129,X130),esk17_2(X129,X130)))&(id(esk19_2(X129,X130),esk17_2(X129,X130))&(r2(X130,esk20_2(X129,X130))&r3(X129,esk20_2(X129,X130),esk19_2(X129,X130))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])])). 0.17/0.35 cnf(c_0_16, plain, (id(X3,X2)|~id(X1,X2)|~id(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.17/0.35 cnf(c_0_17, plain, (id(X1,esk15_1(X1))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.17/0.35 cnf(c_0_18, negated_conjecture, (~r3(X1,X2,X3)|~r2(X4,X2)|~r2(X5,X4)|~r1(X5)|~id(X3,X6)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.17/0.35 cnf(c_0_19, plain, (r3(X1,X2,esk18_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.17/0.35 cnf(c_0_20, plain, (id(X1,X2)|~id(esk15_1(X1),X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.17/0.35 fof(c_0_21, plain, ![X108, X110]:(((id(X110,esk13_1(X108))|~id(X110,esk13_1(X108)))&(r2(X108,X110)|~id(X110,esk13_1(X108))))&((id(X110,esk13_1(X108))|~r2(X108,X110))&(r2(X108,X110)|~r2(X108,X110)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])])). 0.17/0.35 fof(c_0_22, plain, ![X92]:id(X92,X92), inference(variable_rename,[status(thm)],[axiom_5])). 0.17/0.35 cnf(c_0_23, negated_conjecture, (~r2(X1,X2)|~r2(X2,X3)|~r1(X1)|~id(esk18_2(X4,X3),X5)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.17/0.35 cnf(c_0_24, plain, (id(X1,esk15_1(esk15_1(X1)))), inference(spm,[status(thm)],[c_0_20, c_0_17])). 0.17/0.35 cnf(c_0_25, plain, (r2(X1,X2)|~id(X2,esk13_1(X1))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.17/0.35 cnf(c_0_26, plain, (id(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.17/0.35 fof(c_0_27, plain, ![X87]:(((~id(X87,esk6_0)|id(X87,esk6_0))&(~r1(X87)|id(X87,esk6_0)))&((~id(X87,esk6_0)|r1(X87))&(~r1(X87)|r1(X87)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])])). 0.17/0.35 cnf(c_0_28, negated_conjecture, (~r2(X1,X2)|~r2(X2,X3)|~r1(X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.17/0.35 cnf(c_0_29, plain, (r2(X1,esk13_1(X1))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.17/0.35 cnf(c_0_30, plain, (r1(X1)|~id(X1,esk6_0)), inference(split_conjunct,[status(thm)],[c_0_27])). 0.17/0.35 cnf(c_0_31, negated_conjecture, (~r2(esk13_1(X1),X2)|~r1(X1)), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.17/0.35 cnf(c_0_32, plain, (r2(X1,esk20_2(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.17/0.35 cnf(c_0_33, plain, (r1(esk6_0)), inference(spm,[status(thm)],[c_0_30, c_0_26])). 0.17/0.35 cnf(c_0_34, negated_conjecture, (~r1(X1)), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.17/0.35 cnf(c_0_35, plain, ($false), inference(sr,[status(thm)],[c_0_33, c_0_34]), ['proof']). 0.17/0.35 # SZS output end CNFRefutation 0.17/0.35 # Proof object total steps : 36 0.17/0.35 # Proof object clause steps : 19 0.17/0.35 # Proof object formula steps : 17 0.17/0.35 # Proof object conjectures : 8 0.17/0.35 # Proof object clause conjectures : 5 0.17/0.35 # Proof object formula conjectures : 3 0.17/0.35 # Proof object initial clauses used : 9 0.17/0.35 # Proof object initial formulas used : 8 0.17/0.35 # Proof object generating inferences : 9 0.17/0.35 # Proof object simplifying inferences : 1 0.17/0.35 # Training examples: 0 positive, 0 negative 0.17/0.35 # Parsed axioms : 19 0.17/0.35 # Removed by relevancy pruning/SinE : 0 0.17/0.35 # Initial clauses : 59 0.17/0.35 # Removed in clause preprocessing : 16 0.17/0.35 # Initial clauses in saturation : 43 0.17/0.35 # Processed clauses : 114 0.17/0.35 # ...of these trivial : 0 0.17/0.35 # ...subsumed : 13 0.17/0.35 # ...remaining for further processing : 101 0.17/0.35 # Other redundant clauses eliminated : 0 0.17/0.35 # Clauses deleted for lack of memory : 0 0.17/0.35 # Backward-subsumed : 2 0.17/0.35 # Backward-rewritten : 0 0.17/0.35 # Generated clauses : 108 0.17/0.35 # ...of the previous two non-trivial : 78 0.17/0.35 # Contextual simplify-reflections : 0 0.17/0.35 # Paramodulations : 102 0.17/0.35 # Factorizations : 0 0.17/0.35 # Equation resolutions : 0 0.17/0.35 # Propositional unsat checks : 0 0.17/0.35 # Propositional check models : 0 0.17/0.35 # Propositional check unsatisfiable : 0 0.17/0.35 # Propositional clauses : 0 0.17/0.35 # Propositional clauses after purity: 0 0.17/0.35 # Propositional unsat core size : 0 0.17/0.35 # Propositional preprocessing time : 0.000 0.17/0.35 # Propositional encoding time : 0.000 0.17/0.35 # Propositional solver time : 0.000 0.17/0.35 # Success case prop preproc time : 0.000 0.17/0.35 # Success case prop encoding time : 0.000 0.17/0.35 # Success case prop solver time : 0.000 0.17/0.35 # Current number of processed clauses : 50 0.17/0.35 # Positive orientable unit clauses : 15 0.17/0.35 # Positive unorientable unit clauses: 0 0.17/0.35 # Negative unit clauses : 8 0.17/0.35 # Non-unit-clauses : 27 0.17/0.35 # Current number of unprocessed clauses: 50 0.17/0.35 # ...number of literals in the above : 108 0.17/0.35 # Current number of archived formulas : 0 0.17/0.35 # Current number of archived clauses : 51 0.17/0.35 # Clause-clause subsumption calls (NU) : 274 0.17/0.35 # Rec. Clause-clause subsumption calls : 142 0.17/0.35 # Non-unit clause-clause subsumptions : 5 0.17/0.35 # Unit Clause-clause subsumption calls : 88 0.17/0.35 # Rewrite failures with RHS unbound : 0 0.17/0.35 # BW rewrite match attempts : 18 0.17/0.35 # BW rewrite match successes : 0 0.17/0.35 # Condensation attempts : 0 0.17/0.35 # Condensation successes : 0 0.17/0.35 # Termbank termtop insertions : 4075 0.17/0.35 0.17/0.35 # ------------------------------------------------- 0.17/0.35 # User time : 0.032 s 0.17/0.35 # System time : 0.005 s 0.17/0.35 # Total time : 0.036 s 0.17/0.35 # Maximum resident set size: 1660 pages 0.17/0.35 EOF