0.00/0.07 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.08 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.07/0.27 % Computer : n013.cluster.edu 0.07/0.27 % Model : x86_64 x86_64 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.07/0.27 % Memory : 8042.1875MB 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64 0.07/0.27 % CPULimit : 960 0.07/0.27 % WCLimit : 120 0.07/0.27 % DateTime : Thu Jul 2 06:57:03 EDT 2020 0.07/0.27 % CPUTime : 0.07/0.27 # Version: 2.5pre002 0.11/0.27 # No SInE strategy applied 0.11/0.27 # Trying AutoSched0 for 59 seconds 0.11/0.31 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_AE_CS_SP_CO_S4S 0.11/0.31 # and selection function SelectNewComplexAHPNS. 0.11/0.31 # 0.11/0.31 # Preprocessing time : 0.022 s 0.11/0.31 0.11/0.31 # Proof found! 0.11/0.31 # SZS status Theorem 0.11/0.31 # SZS output start CNFRefutation 0.11/0.31 fof(co1, conjecture, ![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(![X4]:((X3!=X1|~(neq(X2,nil))|(nil=X4&X3!=nil)|(![X5]:((X3!=cons(X5,nil)|~(memberP(X4,X5)))<=ssItem(X5))&neq(X4,nil))|neq(X1,nil)|X2!=X4)<=ssList(X4))<=ssList(X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co1)). 0.11/0.31 fof(ax21, axiom, ![X1]:(ssList(X1)=>![X2]:(nil!=cons(X2,X1)<=ssItem(X2))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax21)). 0.11/0.31 fof(ax15, axiom, ![X1]:(ssList(X1)=>![X2]:((X2!=X1<=>neq(X1,X2))<=ssList(X2))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax15)). 0.11/0.31 fof(ax17, axiom, ssList(nil), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax17)). 0.11/0.31 fof(c_0_4, negated_conjecture, ~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(![X4]:((X3!=X1|~(neq(X2,nil))|(nil=X4&X3!=nil)|(![X5]:((X3!=cons(X5,nil)|~(memberP(X4,X5)))<=ssItem(X5))&neq(X4,nil))|neq(X1,nil)|X2!=X4)<=ssList(X4))<=ssList(X3))))), inference(assume_negation,[status(cth)],[co1])). 0.11/0.31 fof(c_0_5, negated_conjecture, (ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((((esk50_0=esk48_0&neq(esk49_0,nil))&(nil!=esk51_0|esk50_0=nil))&((ssItem(esk52_0)|~neq(esk51_0,nil))&((esk50_0=cons(esk52_0,nil)|~neq(esk51_0,nil))&(memberP(esk51_0,esk52_0)|~neq(esk51_0,nil)))))&~neq(esk48_0,nil))&esk49_0=esk51_0))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])). 0.11/0.31 cnf(c_0_6, negated_conjecture, (neq(esk49_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 cnf(c_0_7, negated_conjecture, (esk49_0=esk51_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 fof(c_0_8, plain, ![X242, X243]:(~ssList(X242)|(~ssItem(X243)|nil!=cons(X243,X242))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax21])])])])). 0.11/0.31 cnf(c_0_9, negated_conjecture, (esk50_0=cons(esk52_0,nil)|~neq(esk51_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 cnf(c_0_10, negated_conjecture, (neq(esk51_0,nil)), inference(rw,[status(thm)],[c_0_6, c_0_7])). 0.11/0.31 cnf(c_0_11, negated_conjecture, (ssItem(esk52_0)|~neq(esk51_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 cnf(c_0_12, negated_conjecture, (~neq(esk48_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 cnf(c_0_13, negated_conjecture, (esk50_0=esk48_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 fof(c_0_14, plain, ![X10, X11]:((X11=X10|neq(X10,X11)|~ssList(X11)|~ssList(X10))&(~neq(X10,X11)|X11!=X10|~ssList(X11)|~ssList(X10))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax15])])])])])). 0.11/0.31 cnf(c_0_15, negated_conjecture, (ssList(esk48_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.11/0.31 cnf(c_0_16, plain, (~ssList(X1)|~ssItem(X2)|nil!=cons(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.11/0.31 cnf(c_0_17, negated_conjecture, (cons(esk52_0,nil)=esk50_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])). 0.11/0.31 cnf(c_0_18, negated_conjecture, (ssItem(esk52_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_10])])). 0.11/0.31 cnf(c_0_19, plain, (ssList(nil)), inference(split_conjunct,[status(thm)],[ax17])). 0.11/0.31 cnf(c_0_20, negated_conjecture, (~neq(esk50_0,nil)), inference(rw,[status(thm)],[c_0_12, c_0_13])). 0.11/0.31 cnf(c_0_21, plain, (X1=X2|neq(X2,X1)|~ssList(X1)|~ssList(X2)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.11/0.31 cnf(c_0_22, negated_conjecture, (ssList(esk50_0)), inference(rw,[status(thm)],[c_0_15, c_0_13])). 0.11/0.31 cnf(c_0_23, negated_conjecture, (esk50_0!=nil), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])])). 0.11/0.31 cnf(c_0_24, 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_20, c_0_21]), c_0_22]), c_0_19])]), c_0_23]), ['proof']). 0.11/0.31 # SZS output end CNFRefutation 0.11/0.31 # Proof object total steps : 25 0.11/0.31 # Proof object clause steps : 17 0.11/0.31 # Proof object formula steps : 8 0.11/0.31 # Proof object conjectures : 17 0.11/0.31 # Proof object clause conjectures : 14 0.11/0.31 # Proof object formula conjectures : 3 0.11/0.31 # Proof object initial clauses used : 10 0.11/0.31 # Proof object initial formulas used : 4 0.11/0.31 # Proof object generating inferences : 2 0.11/0.31 # Proof object simplifying inferences : 14 0.11/0.31 # Training examples: 0 positive, 0 negative 0.11/0.31 # Parsed axioms : 96 0.11/0.31 # Removed by relevancy pruning/SinE : 0 0.11/0.31 # Initial clauses : 202 0.11/0.31 # Removed in clause preprocessing : 2 0.11/0.31 # Initial clauses in saturation : 200 0.11/0.31 # Processed clauses : 203 0.11/0.31 # ...of these trivial : 2 0.11/0.31 # ...subsumed : 2 0.11/0.31 # ...remaining for further processing : 198 0.11/0.31 # Other redundant clauses eliminated : 69 0.11/0.31 # Clauses deleted for lack of memory : 0 0.11/0.31 # Backward-subsumed : 0 0.11/0.31 # Backward-rewritten : 0 0.11/0.31 # Generated clauses : 583 0.11/0.31 # ...of the previous two non-trivial : 481 0.11/0.31 # Contextual simplify-reflections : 2 0.11/0.31 # Paramodulations : 492 0.11/0.31 # Factorizations : 0 0.11/0.31 # Equation resolutions : 91 0.11/0.31 # Propositional unsat checks : 0 0.11/0.31 # Propositional check models : 0 0.11/0.31 # Propositional check unsatisfiable : 0 0.11/0.31 # Propositional clauses : 0 0.11/0.31 # Propositional clauses after purity: 0 0.11/0.31 # Propositional unsat core size : 0 0.11/0.31 # Propositional preprocessing time : 0.000 0.11/0.31 # Propositional encoding time : 0.000 0.11/0.31 # Propositional solver time : 0.000 0.11/0.31 # Success case prop preproc time : 0.000 0.11/0.31 # Success case prop encoding time : 0.000 0.11/0.31 # Success case prop solver time : 0.000 0.11/0.31 # Current number of processed clauses : 192 0.11/0.31 # Positive orientable unit clauses : 18 0.11/0.31 # Positive unorientable unit clauses: 0 0.11/0.31 # Negative unit clauses : 4 0.11/0.31 # Non-unit-clauses : 170 0.11/0.31 # Current number of unprocessed clauses: 478 0.11/0.31 # ...number of literals in the above : 3305 0.11/0.31 # Current number of archived formulas : 0 0.11/0.31 # Current number of archived clauses : 0 0.11/0.31 # Clause-clause subsumption calls (NU) : 6238 0.11/0.31 # Rec. Clause-clause subsumption calls : 1332 0.11/0.31 # Non-unit clause-clause subsumptions : 3 0.11/0.31 # Unit Clause-clause subsumption calls : 21 0.11/0.31 # Rewrite failures with RHS unbound : 0 0.11/0.31 # BW rewrite match attempts : 0 0.11/0.31 # BW rewrite match successes : 0 0.11/0.31 # Condensation attempts : 203 0.11/0.31 # Condensation successes : 0 0.11/0.31 # Termbank termtop insertions : 30477 0.11/0.31 0.11/0.31 # ------------------------------------------------- 0.11/0.31 # User time : 0.031 s 0.11/0.31 # System time : 0.008 s 0.11/0.31 # Total time : 0.038 s 0.11/0.31 # Maximum resident set size: 1728 pages 0.11/0.31 EOF