0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.02/0.23 % Computer : n063.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:25:25 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.23 # Version: 2.2pre001 0.02/0.23 # No SInE strategy applied 0.02/0.23 # Trying AutoSched0 for 151 seconds 0.06/0.26 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S4S 0.06/0.26 # and selection function SelectNewComplexAHPNS. 0.06/0.26 # 0.06/0.26 # Preprocessing time : 0.015 s 0.06/0.26 0.06/0.26 # Proof found! 0.06/0.26 # SZS status Theorem 0.06/0.26 # SZS output start CNFRefutation 0.06/0.26 fof(co1, conjecture, ![X1]:(ssList(X1)=>![X2]:(![X3]:(![X4]:((nil!=X2|X3!=X1|X1=nil|![X5]:((X4!=app(X3,X5)|~(strictorderedP(X3))|?[X6]:(?[X7]:((ssList(X7)&?[X8]:(?[X9]:((ssList(X9)&X3=app(X9,cons(X8,nil)))<(X8,X6))&ssItem(X8)))&app(cons(X6,nil),X7)=X5)&ssItem(X6)))<=ssList(X5))|(X4!=nil&X3=nil)|X4!=X2)<=ssList(X4))<=ssList(X3))<=ssList(X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co1)). 0.06/0.26 fof(ax83, axiom, ![X1]:(ssList(X1)=>![X2]:((nil=app(X1,X2)<=>(X1=nil&nil=X2))<=ssList(X2))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax83)). 0.06/0.26 fof(c_0_2, negated_conjecture, ~(![X1]:(ssList(X1)=>![X2]:(![X3]:(![X4]:((nil!=X2|X3!=X1|X1=nil|![X5]:((X4!=app(X3,X5)|~(strictorderedP(X3))|?[X6]:(?[X7]:((ssList(X7)&?[X8]:(?[X9]:((ssList(X9)&X3=app(X9,cons(X8,nil)))<(X8,X6))&ssItem(X8)))&app(cons(X6,nil),X7)=X5)&ssItem(X6)))<=ssList(X5))|(X4!=nil&X3=nil)|X4!=X2)<=ssList(X4))<=ssList(X3))<=ssList(X2)))), inference(assume_negation,[status(cth)],[co1])). 0.06/0.26 fof(c_0_3, negated_conjecture, ![X259, X260, X261, X262]:(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((((nil=esk49_0&esk50_0=esk48_0)&esk48_0!=nil)&(ssList(esk52_0)&((esk51_0=app(esk50_0,esk52_0)&strictorderedP(esk50_0))&(~ssList(X260)|(~ssList(X262)|esk50_0!=app(X262,cons(X261,nil))|~lt(X261,X259)|~ssItem(X261))|app(cons(X259,nil),X260)!=esk52_0|~ssItem(X259)))))&(esk51_0=nil|esk50_0!=nil))&esk51_0=esk49_0))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])])])). 0.06/0.26 cnf(c_0_4, negated_conjecture, (esk51_0=esk49_0), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 cnf(c_0_5, negated_conjecture, (nil=esk49_0), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 fof(c_0_6, plain, ![X240, X241]:(((X240=nil|nil!=app(X240,X241)|~ssList(X241)|~ssList(X240))&(nil=X241|nil!=app(X240,X241)|~ssList(X241)|~ssList(X240)))&(X240!=nil|nil!=X241|nil=app(X240,X241)|~ssList(X241)|~ssList(X240))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax83])])])])])])])). 0.06/0.26 cnf(c_0_7, negated_conjecture, (esk51_0=app(esk50_0,esk52_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 cnf(c_0_8, negated_conjecture, (esk51_0=nil), inference(rw,[status(thm)],[c_0_4, c_0_5])). 0.06/0.26 cnf(c_0_9, negated_conjecture, (ssList(esk48_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 cnf(c_0_10, negated_conjecture, (esk50_0=esk48_0), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 cnf(c_0_11, negated_conjecture, (esk48_0!=nil), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 cnf(c_0_12, plain, (X1=nil|nil!=app(X1,X2)|~ssList(X2)|~ssList(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.06/0.26 cnf(c_0_13, negated_conjecture, (app(esk50_0,esk52_0)=nil), inference(rw,[status(thm)],[c_0_7, c_0_8])). 0.06/0.26 cnf(c_0_14, negated_conjecture, (ssList(esk52_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.06/0.26 cnf(c_0_15, negated_conjecture, (ssList(esk50_0)), inference(rw,[status(thm)],[c_0_9, c_0_10])). 0.06/0.26 cnf(c_0_16, negated_conjecture, (esk50_0!=nil), inference(rw,[status(thm)],[c_0_11, c_0_10])). 0.06/0.26 cnf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), c_0_15])]), c_0_16]), ['proof']). 0.06/0.26 # SZS output end CNFRefutation 0.06/0.26 # Proof object total steps : 18 0.06/0.26 # Proof object clause steps : 13 0.06/0.26 # Proof object formula steps : 5 0.06/0.26 # Proof object conjectures : 15 0.06/0.26 # Proof object clause conjectures : 12 0.06/0.26 # Proof object formula conjectures : 3 0.06/0.26 # Proof object initial clauses used : 8 0.06/0.26 # Proof object initial formulas used : 2 0.06/0.26 # Proof object generating inferences : 1 0.06/0.26 # Proof object simplifying inferences : 8 0.06/0.26 # Training examples: 0 positive, 0 negative 0.06/0.26 # Parsed axioms : 96 0.06/0.26 # Removed by relevancy pruning/SinE : 0 0.06/0.26 # Initial clauses : 203 0.06/0.26 # Removed in clause preprocessing : 2 0.06/0.26 # Initial clauses in saturation : 201 0.06/0.26 # Processed clauses : 203 0.06/0.26 # ...of these trivial : 4 0.06/0.26 # ...subsumed : 1 0.06/0.26 # ...remaining for further processing : 197 0.06/0.26 # Other redundant clauses eliminated : 59 0.06/0.26 # Clauses deleted for lack of memory : 0 0.06/0.26 # Backward-subsumed : 0 0.06/0.26 # Backward-rewritten : 1 0.06/0.26 # Generated clauses : 336 0.06/0.26 # ...of the previous two non-trivial : 257 0.06/0.26 # Contextual simplify-reflections : 0 0.06/0.26 # Paramodulations : 274 0.06/0.26 # Factorizations : 0 0.06/0.26 # Equation resolutions : 64 0.06/0.26 # Propositional unsat checks : 0 0.06/0.26 # Propositional check models : 0 0.06/0.26 # Propositional check unsatisfiable : 0 0.06/0.26 # Propositional clauses : 0 0.06/0.26 # Propositional clauses after purity: 0 0.06/0.26 # Propositional unsat core size : 0 0.06/0.26 # Current number of processed clauses : 173 0.06/0.26 # Positive orientable unit clauses : 17 0.06/0.26 # Positive unorientable unit clauses: 0 0.06/0.26 # Negative unit clauses : 3 0.06/0.26 # Non-unit-clauses : 153 0.06/0.26 # Current number of unprocessed clauses: 255 0.06/0.26 # ...number of literals in the above : 1413 0.06/0.26 # Current number of archived formulas : 0 0.06/0.26 # Current number of archived clauses : 1 0.06/0.26 # Clause-clause subsumption calls (NU) : 6127 0.06/0.26 # Rec. Clause-clause subsumption calls : 1301 0.06/0.26 # Non-unit clause-clause subsumptions : 1 0.06/0.26 # Unit Clause-clause subsumption calls : 19 0.06/0.26 # Rewrite failures with RHS unbound : 0 0.06/0.26 # BW rewrite match attempts : 1 0.06/0.26 # BW rewrite match successes : 1 0.06/0.26 # Condensation attempts : 0 0.06/0.26 # Condensation successes : 0 0.06/0.26 # Termbank termtop insertions : 22034 0.06/0.26 0.06/0.26 # ------------------------------------------------- 0.06/0.26 # User time : 0.021 s 0.06/0.26 # System time : 0.007 s 0.06/0.26 # Total time : 0.028 s 0.06/0.26 # Maximum resident set size: 1664 pages 0.06/0.26 EOF