0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/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 07:24:46 EDT 2020 0.15/0.31 % CPUTime : 0.15/0.31 # Version: 2.5pre002 0.15/0.31 # No SInE strategy applied 0.15/0.31 # Trying AutoSched0 for 59 seconds 0.15/0.37 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI 0.15/0.37 # and selection function SelectNewComplexAHP. 0.15/0.37 # 0.15/0.37 # Preprocessing time : 0.029 s 0.15/0.37 # Presaturation interreduction done 0.15/0.37 0.15/0.37 # Proof found! 0.15/0.37 # SZS status Theorem 0.15/0.37 # SZS output start CNFRefutation 0.15/0.37 fof(m__, conjecture, ?[X1]:((aElement0(X1)&(aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|sdteqdtlpzmzozddtrp0(X1,xx,xI)))&(sdteqdtlpzmzozddtrp0(X1,xy,xJ)|aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__)). 0.15/0.37 fof(mSortsB, axiom, ![X1, X2]:(aElement0(sdtpldt0(X1,X2))<=(aElement0(X2)&aElement0(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mSortsB)). 0.15/0.37 fof(m__1332, hypothesis, aElementOf0(sdtpldt0(xw,smndt0(xx)),xI), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__1332)). 0.15/0.37 fof(m__1409, hypothesis, aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__1409)). 0.15/0.37 fof(mEOfElem, axiom, ![X1]:(![X2]:(aElementOf0(X2,X1)=>aElement0(X2))<=aSet0(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mEOfElem)). 0.15/0.37 fof(m__1205, hypothesis, (((((aSet0(xI)&![X1]:(aElementOf0(X1,xI)=>(![X2]:(aElementOf0(sdtasdt0(X2,X1),xI)<=aElement0(X2))&![X2]:(aElementOf0(X2,xI)=>aElementOf0(sdtpldt0(X1,X2),xI)))))&aIdeal0(xI))&aSet0(xJ))&aIdeal0(xJ))&![X1]:((![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xJ))&![X2]:(aElementOf0(X2,xJ)=>aElementOf0(sdtpldt0(X1,X2),xJ)))<=aElementOf0(X1,xJ))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__1205)). 0.15/0.37 fof(m__1319, hypothesis, xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__1319)). 0.15/0.37 fof(mSortsB_02, axiom, ![X1, X2]:((aElement0(X2)&aElement0(X1))=>aElement0(sdtasdt0(X1,X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mSortsB_02)). 0.15/0.37 fof(m__1294, hypothesis, ((sz10=sdtpldt0(xa,xb)&aElementOf0(xb,xJ))&aElementOf0(xa,xI)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__1294)). 0.15/0.37 fof(m__1217, hypothesis, (aElement0(xx)&aElement0(xy)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m__1217)). 0.15/0.37 fof(c_0_10, negated_conjecture, ~(?[X1]:((aElement0(X1)&(aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|sdteqdtlpzmzozddtrp0(X1,xx,xI)))&(sdteqdtlpzmzozddtrp0(X1,xy,xJ)|aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)))), inference(assume_negation,[status(cth)],[m__])). 0.15/0.37 fof(c_0_11, negated_conjecture, ![X61]:(((~sdteqdtlpzmzozddtrp0(X61,xy,xJ)|(~aElementOf0(sdtpldt0(X61,smndt0(xx)),xI)|~aElement0(X61)))&(~aElementOf0(sdtpldt0(X61,smndt0(xy)),xJ)|(~aElementOf0(sdtpldt0(X61,smndt0(xx)),xI)|~aElement0(X61))))&((~sdteqdtlpzmzozddtrp0(X61,xy,xJ)|(~sdteqdtlpzmzozddtrp0(X61,xx,xI)|~aElement0(X61)))&(~aElementOf0(sdtpldt0(X61,smndt0(xy)),xJ)|(~sdteqdtlpzmzozddtrp0(X61,xx,xI)|~aElement0(X61))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])). 0.15/0.37 fof(c_0_12, plain, ![X63, X64]:(~aElement0(X64)|~aElement0(X63)|aElement0(sdtpldt0(X63,X64))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mSortsB])])])). 0.15/0.37 cnf(c_0_13, negated_conjecture, (~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|~aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|~aElement0(X1)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.15/0.37 cnf(c_0_14, hypothesis, (aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)), inference(split_conjunct,[status(thm)],[m__1332])). 0.15/0.37 cnf(c_0_15, hypothesis, (aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ)), inference(split_conjunct,[status(thm)],[m__1409])). 0.15/0.37 fof(c_0_16, plain, ![X59, X60]:(~aSet0(X59)|(~aElementOf0(X60,X59)|aElement0(X60))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mEOfElem])])])])). 0.15/0.37 fof(c_0_17, hypothesis, ![X71, X72, X73, X74, X75, X76]:(((((aSet0(xI)&((~aElement0(X72)|aElementOf0(sdtasdt0(X72,X71),xI)|~aElementOf0(X71,xI))&(~aElementOf0(X73,xI)|aElementOf0(sdtpldt0(X71,X73),xI)|~aElementOf0(X71,xI))))&aIdeal0(xI))&aSet0(xJ))&aIdeal0(xJ))&((~aElement0(X75)|aElementOf0(sdtasdt0(X75,X74),xJ)|~aElementOf0(X74,xJ))&(~aElementOf0(X76,xJ)|aElementOf0(sdtpldt0(X74,X76),xJ)|~aElementOf0(X74,xJ)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__1205])])])])])). 0.15/0.37 cnf(c_0_18, plain, (aElement0(sdtpldt0(X2,X1))|~aElement0(X1)|~aElement0(X2)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.15/0.37 cnf(c_0_19, hypothesis, (xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb))), inference(split_conjunct,[status(thm)],[m__1319])). 0.15/0.37 cnf(c_0_20, hypothesis, (~aElement0(xw)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])])). 0.15/0.37 fof(c_0_21, plain, ![X41, X42]:(~aElement0(X42)|~aElement0(X41)|aElement0(sdtasdt0(X41,X42))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])). 0.15/0.37 cnf(c_0_22, plain, (aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.15/0.37 cnf(c_0_23, hypothesis, (aElementOf0(xa,xI)), inference(split_conjunct,[status(thm)],[m__1294])). 0.15/0.37 cnf(c_0_24, hypothesis, (aSet0(xI)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.15/0.37 cnf(c_0_25, hypothesis, (~aElement0(sdtasdt0(xy,xa))|~aElement0(sdtasdt0(xx,xb))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 0.15/0.37 cnf(c_0_26, plain, (aElement0(sdtasdt0(X2,X1))|~aElement0(X1)|~aElement0(X2)), inference(split_conjunct,[status(thm)],[c_0_21])). 0.15/0.37 cnf(c_0_27, hypothesis, (aElement0(xy)), inference(split_conjunct,[status(thm)],[m__1217])). 0.15/0.37 cnf(c_0_28, hypothesis, (aElement0(xa)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])])). 0.15/0.37 cnf(c_0_29, hypothesis, (aElementOf0(xb,xJ)), inference(split_conjunct,[status(thm)],[m__1294])). 0.15/0.37 cnf(c_0_30, hypothesis, (aSet0(xJ)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.15/0.37 cnf(c_0_31, hypothesis, (~aElement0(sdtasdt0(xx,xb))), 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_28])])). 0.15/0.37 cnf(c_0_32, hypothesis, (aElement0(xx)), inference(split_conjunct,[status(thm)],[m__1217])). 0.15/0.37 cnf(c_0_33, hypothesis, (aElement0(xb)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_29]), c_0_30])])). 0.15/0.37 cnf(c_0_34, hypothesis, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_26]), c_0_32]), c_0_33])]), ['proof']). 0.15/0.37 # SZS output end CNFRefutation 0.15/0.37 # Proof object total steps : 35 0.15/0.37 # Proof object clause steps : 19 0.15/0.37 # Proof object formula steps : 16 0.15/0.37 # Proof object conjectures : 4 0.15/0.37 # Proof object clause conjectures : 1 0.15/0.37 # Proof object formula conjectures : 3 0.15/0.37 # Proof object initial clauses used : 13 0.15/0.37 # Proof object initial formulas used : 10 0.15/0.37 # Proof object generating inferences : 6 0.15/0.37 # Proof object simplifying inferences : 13 0.15/0.37 # Training examples: 0 positive, 0 negative 0.15/0.37 # Parsed axioms : 35 0.15/0.37 # Removed by relevancy pruning/SinE : 0 0.15/0.37 # Initial clauses : 82 0.15/0.37 # Removed in clause preprocessing : 2 0.15/0.37 # Initial clauses in saturation : 80 0.15/0.37 # Processed clauses : 297 0.15/0.37 # ...of these trivial : 5 0.15/0.37 # ...subsumed : 6 0.15/0.37 # ...remaining for further processing : 286 0.15/0.37 # Other redundant clauses eliminated : 10 0.15/0.37 # Clauses deleted for lack of memory : 0 0.15/0.37 # Backward-subsumed : 0 0.15/0.37 # Backward-rewritten : 3 0.15/0.37 # Generated clauses : 1688 0.15/0.37 # ...of the previous two non-trivial : 1599 0.15/0.37 # Contextual simplify-reflections : 0 0.15/0.37 # Paramodulations : 1679 0.15/0.37 # Factorizations : 0 0.15/0.37 # Equation resolutions : 10 0.15/0.37 # Propositional unsat checks : 0 0.15/0.37 # Propositional check models : 0 0.15/0.37 # Propositional check unsatisfiable : 0 0.15/0.37 # Propositional clauses : 0 0.15/0.37 # Propositional clauses after purity: 0 0.15/0.37 # Propositional unsat core size : 0 0.15/0.37 # Propositional preprocessing time : 0.000 0.15/0.37 # Propositional encoding time : 0.000 0.15/0.37 # Propositional solver time : 0.000 0.15/0.37 # Success case prop preproc time : 0.000 0.15/0.37 # Success case prop encoding time : 0.000 0.15/0.37 # Success case prop solver time : 0.000 0.15/0.37 # Current number of processed clauses : 194 0.15/0.37 # Positive orientable unit clauses : 110 0.15/0.37 # Positive unorientable unit clauses: 0 0.15/0.37 # Negative unit clauses : 4 0.15/0.37 # Non-unit-clauses : 80 0.15/0.37 # Current number of unprocessed clauses: 1462 0.15/0.37 # ...number of literals in the above : 3111 0.15/0.37 # Current number of archived formulas : 0 0.15/0.37 # Current number of archived clauses : 83 0.15/0.37 # Clause-clause subsumption calls (NU) : 1318 0.15/0.37 # Rec. Clause-clause subsumption calls : 544 0.15/0.37 # Non-unit clause-clause subsumptions : 4 0.15/0.37 # Unit Clause-clause subsumption calls : 1157 0.15/0.37 # Rewrite failures with RHS unbound : 0 0.15/0.37 # BW rewrite match attempts : 22 0.15/0.37 # BW rewrite match successes : 3 0.15/0.37 # Condensation attempts : 0 0.15/0.37 # Condensation successes : 0 0.15/0.37 # Termbank termtop insertions : 26899 0.15/0.37 0.15/0.37 # ------------------------------------------------- 0.15/0.37 # User time : 0.053 s 0.15/0.37 # System time : 0.006 s 0.15/0.37 # Total time : 0.058 s 0.15/0.37 # Maximum resident set size: 1616 pages 0.15/0.37 EOF