0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n006.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 : 1200 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Jul 13 16:35:10 EDT 2021 0.10/0.31 % CPUTime : 0.16/0.42 Running first-order theorem proving 0.16/0.42 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.16/0.42 # Version: 2.6 0.16/0.42 # No SInE strategy applied 0.16/0.42 # Trying AutoSched0 for 59 seconds 0.16/0.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b 0.16/0.52 # and selection function SelectCQIPrecW. 0.16/0.52 # 0.16/0.52 # Preprocessing time : 0.027 s 0.16/0.52 # Presaturation interreduction done 0.16/0.52 0.16/0.52 # Proof found! 0.16/0.52 # SZS status Theorem 0.16/0.52 # SZS output start CNFRefutation 0.16/0.52 fof(axiom_3a, axiom, ![X1, X2]:(![X3]:(![X4]:(~(r2(X1,X4))|X4!=X3)|~(r2(X2,X3)))|X2=X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_3a)). 0.16/0.52 fof(axiom_2, axiom, ![X41]:?[X42]:![X43]:((X42!=X43&~(r2(X41,X43)))|(r2(X41,X43)&X43=X42)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_2)). 0.16/0.52 fof(axiom_7a, axiom, ![X38, X39]:(~(r2(X38,X39))|![X40]:(~(r1(X40))|X39!=X40)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_7a)). 0.16/0.52 fof(nonzerononetwoexist, conjecture, ?[X35]:(![X24]:(~(r1(X24))|X24!=X35)&![X30]:(![X32]:(![X22]:(~(r2(X22,X32))|~(r1(X22)))|~(r2(X32,X30)))|X30!=X35)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', nonzerononetwoexist)). 0.16/0.52 fof(axiom_1, axiom, ?[X26]:![X27]:((r1(X27)&X26=X27)|(X27!=X26&~(r1(X27)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_1)). 0.16/0.52 fof(c_0_5, plain, ![X1, X2]:(![X3]:(![X4]:(~r2(X1,X4)|X4!=X3)|~r2(X2,X3))|X2=X1), inference(fof_simplification,[status(thm)],[axiom_3a])). 0.16/0.52 fof(c_0_6, plain, ![X41]:?[X42]:![X43]:((X42!=X43&~r2(X41,X43))|(r2(X41,X43)&X43=X42)), inference(fof_simplification,[status(thm)],[axiom_2])). 0.16/0.52 fof(c_0_7, plain, ![X38, X39]:(~r2(X38,X39)|![X40]:(~r1(X40)|X39!=X40)), inference(fof_simplification,[status(thm)],[axiom_7a])). 0.16/0.52 fof(c_0_8, plain, ![X92, X93, X94, X95]:(~r2(X92,X95)|X95!=X94|~r2(X93,X94)|X93=X92), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])])). 0.16/0.52 fof(c_0_9, plain, ![X132, X134]:(((r2(X132,X134)|esk20_1(X132)!=X134)&(X134=esk20_1(X132)|esk20_1(X132)!=X134))&((r2(X132,X134)|~r2(X132,X134))&(X134=esk20_1(X132)|~r2(X132,X134)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])])). 0.16/0.52 fof(c_0_10, negated_conjecture, ~(?[X35]:(![X24]:(~r1(X24)|X24!=X35)&![X30]:(![X32]:(![X22]:(~r2(X22,X32)|~r1(X22))|~r2(X32,X30))|X30!=X35))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerononetwoexist])])). 0.16/0.52 fof(c_0_11, plain, ![X129, X130, X131]:(~r2(X129,X130)|(~r1(X131)|X130!=X131)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])])). 0.16/0.52 cnf(c_0_12, plain, (X4=X1|~r2(X1,X2)|X2!=X3|~r2(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.16/0.52 cnf(c_0_13, plain, (r2(X1,X2)|esk20_1(X1)!=X2), inference(split_conjunct,[status(thm)],[c_0_9])). 0.16/0.52 fof(c_0_14, negated_conjecture, ![X135]:(((((r2(esk24_1(X135),esk23_1(X135))|r1(esk21_1(X135)))&(r1(esk24_1(X135))|r1(esk21_1(X135))))&(r2(esk23_1(X135),esk22_1(X135))|r1(esk21_1(X135))))&(esk22_1(X135)=X135|r1(esk21_1(X135))))&((((r2(esk24_1(X135),esk23_1(X135))|esk21_1(X135)=X135)&(r1(esk24_1(X135))|esk21_1(X135)=X135))&(r2(esk23_1(X135),esk22_1(X135))|esk21_1(X135)=X135))&(esk22_1(X135)=X135|esk21_1(X135)=X135))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])). 0.16/0.52 cnf(c_0_15, plain, (~r2(X1,X2)|~r1(X3)|X2!=X3), inference(split_conjunct,[status(thm)],[c_0_11])). 0.16/0.52 cnf(c_0_16, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3)), inference(er,[status(thm)],[c_0_12])). 0.16/0.52 cnf(c_0_17, plain, (r2(X1,esk20_1(X1))), inference(er,[status(thm)],[c_0_13])). 0.16/0.52 cnf(c_0_18, negated_conjecture, (r2(esk23_1(X1),esk22_1(X1))|r1(esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.52 cnf(c_0_19, negated_conjecture, (esk22_1(X1)=X1|r1(esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.52 fof(c_0_20, plain, ?[X26]:![X27]:((r1(X27)&X26=X27)|(X27!=X26&~r1(X27))), inference(fof_simplification,[status(thm)],[axiom_1])). 0.16/0.52 cnf(c_0_21, plain, (~r1(X1)|~r2(X2,X1)), inference(er,[status(thm)],[c_0_15])). 0.16/0.52 cnf(c_0_22, negated_conjecture, (r2(esk24_1(X1),esk23_1(X1))|r1(esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.52 cnf(c_0_23, plain, (X1=X2|~r2(X1,esk20_1(X2))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.16/0.52 cnf(c_0_24, negated_conjecture, (r1(esk21_1(X1))|r2(esk23_1(X1),X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.16/0.52 fof(c_0_25, plain, ![X118]:(((X118!=esk12_0|r1(X118))&(~r1(X118)|r1(X118)))&((X118!=esk12_0|esk12_0=X118)&(~r1(X118)|esk12_0=X118))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_20])])])). 0.16/0.52 cnf(c_0_26, negated_conjecture, (r2(esk23_1(X1),esk22_1(X1))|esk21_1(X1)=X1), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.52 cnf(c_0_27, negated_conjecture, (esk22_1(X1)=X1|esk21_1(X1)=X1), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.52 cnf(c_0_28, negated_conjecture, (r1(esk21_1(X1))|~r1(esk23_1(X1))), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.16/0.52 cnf(c_0_29, negated_conjecture, (esk23_1(esk20_1(X1))=X1|r1(esk21_1(esk20_1(X1)))), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.16/0.52 cnf(c_0_30, plain, (r1(X1)|X1!=esk12_0), inference(split_conjunct,[status(thm)],[c_0_25])). 0.16/0.52 cnf(c_0_31, negated_conjecture, (r2(esk24_1(X1),esk23_1(X1))|esk21_1(X1)=X1), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.52 cnf(c_0_32, negated_conjecture, (esk21_1(X1)=X1|r2(esk23_1(X1),X1)), inference(spm,[status(thm)],[c_0_26, c_0_27])). 0.16/0.52 cnf(c_0_33, negated_conjecture, (r1(esk21_1(esk20_1(X1)))|~r1(X1)), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.16/0.52 cnf(c_0_34, plain, (r1(esk12_0)), inference(er,[status(thm)],[c_0_30])). 0.16/0.52 cnf(c_0_35, negated_conjecture, (esk21_1(X1)=X1|~r1(esk23_1(X1))), inference(spm,[status(thm)],[c_0_21, c_0_31])). 0.16/0.52 cnf(c_0_36, negated_conjecture, (esk21_1(esk20_1(X1))=esk20_1(X1)|esk23_1(esk20_1(X1))=X1), inference(spm,[status(thm)],[c_0_23, c_0_32])). 0.16/0.52 cnf(c_0_37, plain, (esk12_0=X1|~r1(X1)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.16/0.52 cnf(c_0_38, negated_conjecture, (r1(esk21_1(esk20_1(esk12_0)))), inference(spm,[status(thm)],[c_0_33, c_0_34])). 0.16/0.52 cnf(c_0_39, negated_conjecture, (esk21_1(esk20_1(X1))=esk20_1(X1)|~r1(X1)), inference(spm,[status(thm)],[c_0_35, c_0_36])). 0.16/0.52 cnf(c_0_40, negated_conjecture, (esk21_1(esk20_1(esk12_0))=esk12_0), inference(spm,[status(thm)],[c_0_37, c_0_38])). 0.16/0.52 cnf(c_0_41, plain, (~r1(esk20_1(X1))), inference(spm,[status(thm)],[c_0_21, c_0_17])). 0.16/0.52 cnf(c_0_42, negated_conjecture, (esk20_1(esk12_0)=esk12_0), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_34]), c_0_40])). 0.16/0.52 cnf(c_0_43, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_34])]), ['proof']). 0.16/0.52 # SZS output end CNFRefutation 0.16/0.52 # Proof object total steps : 44 0.16/0.52 # Proof object clause steps : 29 0.16/0.52 # Proof object formula steps : 15 0.16/0.52 # Proof object conjectures : 21 0.16/0.52 # Proof object clause conjectures : 18 0.16/0.52 # Proof object formula conjectures : 3 0.16/0.52 # Proof object initial clauses used : 11 0.16/0.52 # Proof object initial formulas used : 5 0.16/0.52 # Proof object generating inferences : 14 0.16/0.52 # Proof object simplifying inferences : 7 0.16/0.52 # Training examples: 0 positive, 0 negative 0.16/0.52 # Parsed axioms : 12 0.16/0.52 # Removed by relevancy pruning/SinE : 0 0.16/0.52 # Initial clauses : 47 0.16/0.52 # Removed in clause preprocessing : 12 0.16/0.52 # Initial clauses in saturation : 35 0.16/0.52 # Processed clauses : 889 0.16/0.52 # ...of these trivial : 2 0.16/0.52 # ...subsumed : 517 0.16/0.52 # ...remaining for further processing : 370 0.16/0.52 # Other redundant clauses eliminated : 6 0.16/0.52 # Clauses deleted for lack of memory : 0 0.16/0.52 # Backward-subsumed : 0 0.16/0.52 # Backward-rewritten : 25 0.16/0.52 # Generated clauses : 7111 0.16/0.52 # ...of the previous two non-trivial : 4313 0.16/0.52 # Contextual simplify-reflections : 0 0.16/0.52 # Paramodulations : 7105 0.16/0.52 # Factorizations : 0 0.16/0.52 # NegExts : 0 0.16/0.52 # Equation resolutions : 6 0.16/0.52 # Propositional unsat checks : 0 0.16/0.52 # Propositional check models : 0 0.16/0.52 # Propositional check unsatisfiable : 0 0.16/0.52 # Propositional clauses : 0 0.16/0.52 # Propositional clauses after purity: 0 0.16/0.52 # Propositional unsat core size : 0 0.16/0.52 # Propositional preprocessing time : 0.000 0.16/0.52 # Propositional encoding time : 0.000 0.16/0.52 # Propositional solver time : 0.000 0.16/0.52 # Success case prop preproc time : 0.000 0.16/0.52 # Success case prop encoding time : 0.000 0.16/0.52 # Success case prop solver time : 0.000 0.16/0.52 # Current number of processed clauses : 304 0.16/0.52 # Positive orientable unit clauses : 23 0.16/0.52 # Positive unorientable unit clauses: 0 0.16/0.52 # Negative unit clauses : 2 0.16/0.52 # Non-unit-clauses : 279 0.16/0.52 # Current number of unprocessed clauses: 3471 0.16/0.52 # ...number of literals in the above : 11354 0.16/0.52 # Current number of archived formulas : 0 0.16/0.52 # Current number of archived clauses : 64 0.16/0.52 # Clause-clause subsumption calls (NU) : 17796 0.16/0.52 # Rec. Clause-clause subsumption calls : 13929 0.16/0.52 # Non-unit clause-clause subsumptions : 509 0.16/0.52 # Unit Clause-clause subsumption calls : 822 0.16/0.52 # Rewrite failures with RHS unbound : 0 0.16/0.52 # BW rewrite match attempts : 27 0.16/0.52 # BW rewrite match successes : 13 0.16/0.52 # Condensation attempts : 0 0.16/0.52 # Condensation successes : 0 0.16/0.52 # Termbank termtop insertions : 104689 0.16/0.52 0.16/0.52 # ------------------------------------------------- 0.16/0.52 # User time : 0.095 s 0.16/0.52 # System time : 0.006 s 0.16/0.52 # Total time : 0.101 s 0.16/0.52 # Maximum resident set size: 1640 pages 0.16/0.52 EOF