0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.12/0.34 % Computer : n021.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 180 0.12/0.34 % DateTime : Thu Aug 29 14:58:34 EDT 2019 0.12/0.34 % CPUTime : 0.12/0.34 # Version: 2.4_pre003 0.12/0.34 # No SInE strategy applied 0.12/0.34 # Trying AutoSched0 for 90 seconds 0.19/0.48 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y 0.19/0.48 # and selection function SelectMaxLComplexAvoidPosPred. 0.19/0.48 # 0.19/0.48 # Preprocessing time : 0.037 s 0.19/0.48 # Presaturation interreduction done 0.19/0.48 0.19/0.48 # Proof found! 0.19/0.48 # SZS status Theorem 0.19/0.48 # SZS output start CNFRefutation 0.19/0.48 fof(co1, conjecture, ![X1]:(![X2]:(![X3]:(![X4]:(~(ssList(X4))|X1!=X3|nil=X1|(![X7]:(![X8]:(ssList(X8)=>![X9]:(?[X10]:((((ssItem(X10)&memberP(X9,X10))<(X7,X10))&memberP(X8,X10))&~(leq(X7,X10)))|app(app(X8,cons(X7,nil)),X9)!=X3|~(ssList(X9))))<=ssItem(X7))&nil!=X3)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X11]:((ssList(X11)&![X12]:(~(ssItem(X12))|~(leq(X5,X12))|leq(X12,X5)|~(memberP(X11,X12))|~(memberP(X6,X12))))&X1=app(app(X6,cons(X5,nil)),X11))))|X2!=X4)<=ssList(X3))<=ssList(X2))<=ssList(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co1)). 0.19/0.48 fof(ax38, axiom, ![X1]:(ssItem(X1)=>~(memberP(nil,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax38)). 0.19/0.48 fof(ax17, axiom, ssList(nil), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax17)). 0.19/0.48 fof(ax28, axiom, ![X1]:(X1=app(nil,X1)<=ssList(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax28)). 0.19/0.48 fof(ax81, axiom, ![X1]:(ssList(X1)=>![X2]:(app(cons(X2,nil),X1)=cons(X2,X1)<=ssItem(X2))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax81)). 0.19/0.48 fof(ax16, axiom, ![X1]:(![X2]:(ssList(cons(X2,X1))<=ssItem(X2))<=ssList(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax16)). 0.19/0.48 fof(ax20, axiom, ![X1]:((?[X2]:(ssList(X2)&?[X3]:(X1=cons(X3,X2)&ssItem(X3)))|X1=nil)<=ssList(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax', ax20)). 0.19/0.48 fof(c_0_7, negated_conjecture, ~(![X1]:(![X2]:(![X3]:(![X4]:(~(ssList(X4))|X1!=X3|nil=X1|(![X7]:(![X8]:(ssList(X8)=>![X9]:(?[X10]:((((ssItem(X10)&memberP(X9,X10))<(X7,X10))&memberP(X8,X10))&~(leq(X7,X10)))|app(app(X8,cons(X7,nil)),X9)!=X3|~(ssList(X9))))<=ssItem(X7))&nil!=X3)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X11]:((ssList(X11)&![X12]:(~(ssItem(X12))|~(leq(X5,X12))|leq(X12,X5)|~(memberP(X11,X12))|~(memberP(X6,X12))))&X1=app(app(X6,cons(X5,nil)),X11))))|X2!=X4)<=ssList(X3))<=ssList(X2))<=ssList(X1))), inference(assume_negation,[status(cth)],[co1])). 0.19/0.48 fof(c_0_8, plain, ![X140]:(~ssItem(X140)|~memberP(nil,X140)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])])). 0.19/0.48 fof(c_0_9, negated_conjecture, ![X264, X265, X266, X267]:(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(((((ssList(esk51_0)&esk48_0=esk50_0)&nil!=esk48_0)&((ssItem(esk52_0)|nil=esk50_0)&((ssList(esk53_0)|nil=esk50_0)&(((~ssItem(X264)|~memberP(esk54_0,X264)|~lt(esk52_0,X264)|~memberP(esk53_0,X264)|leq(esk52_0,X264)|nil=esk50_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk50_0|nil=esk50_0))&(ssList(esk54_0)|nil=esk50_0)))))&(((((ssItem(esk55_3(X265,X266,X267))|~ssList(X267)|esk48_0!=app(app(X266,cons(X265,nil)),X267)|~ssList(X266)|~ssItem(X265))&(leq(X265,esk55_3(X265,X266,X267))|~ssList(X267)|esk48_0!=app(app(X266,cons(X265,nil)),X267)|~ssList(X266)|~ssItem(X265)))&(~leq(esk55_3(X265,X266,X267),X265)|~ssList(X267)|esk48_0!=app(app(X266,cons(X265,nil)),X267)|~ssList(X266)|~ssItem(X265)))&(memberP(X267,esk55_3(X265,X266,X267))|~ssList(X267)|esk48_0!=app(app(X266,cons(X265,nil)),X267)|~ssList(X266)|~ssItem(X265)))&(memberP(X266,esk55_3(X265,X266,X267))|~ssList(X267)|esk48_0!=app(app(X266,cons(X265,nil)),X267)|~ssList(X266)|~ssItem(X265))))&esk49_0=esk51_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])). 0.19/0.48 cnf(c_0_10, plain, (~ssItem(X1)|~memberP(nil,X1)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.19/0.48 cnf(c_0_11, negated_conjecture, (memberP(X1,esk55_3(X2,X1,X3))|~ssList(X3)|esk48_0!=app(app(X1,cons(X2,nil)),X3)|~ssList(X1)|~ssItem(X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.48 cnf(c_0_12, plain, (ssList(nil)), inference(split_conjunct,[status(thm)],[ax17])). 0.19/0.48 cnf(c_0_13, negated_conjecture, (app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(esk55_3(X1,nil,X2))|~ssItem(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])])). 0.19/0.48 cnf(c_0_14, negated_conjecture, (ssItem(esk55_3(X1,X2,X3))|~ssList(X3)|esk48_0!=app(app(X2,cons(X1,nil)),X3)|~ssList(X2)|~ssItem(X1)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.48 fof(c_0_15, plain, ![X178]:(~ssList(X178)|X178=app(nil,X178)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax28])])])). 0.19/0.48 cnf(c_0_16, negated_conjecture, (app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_12])])). 0.19/0.48 cnf(c_0_17, plain, (X1=app(nil,X1)|~ssList(X1)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.19/0.48 fof(c_0_18, plain, ![X55, X56]:(~ssList(X55)|(~ssItem(X56)|app(cons(X56,nil),X55)=cons(X56,X55))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax81])])])])). 0.19/0.48 cnf(c_0_19, negated_conjecture, (app(cons(X1,nil),X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.19/0.48 cnf(c_0_20, plain, (app(cons(X2,nil),X1)=cons(X2,X1)|~ssList(X1)|~ssItem(X2)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.19/0.48 fof(c_0_21, plain, ![X38, X39]:(~ssList(X38)|(~ssItem(X39)|ssList(cons(X39,X38)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax16])])])])). 0.19/0.48 cnf(c_0_22, negated_conjecture, (cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.19/0.48 cnf(c_0_23, plain, (ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)), inference(split_conjunct,[status(thm)],[c_0_21])). 0.19/0.48 fof(c_0_24, plain, ![X16]:((ssList(esk1_1(X16))|X16=nil|~ssList(X16))&((X16=cons(esk2_1(X16),esk1_1(X16))|X16=nil|~ssList(X16))&(ssItem(esk2_1(X16))|X16=nil|~ssList(X16)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax20])])])])])). 0.19/0.48 cnf(c_0_25, negated_conjecture, (cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_12])])). 0.19/0.48 cnf(c_0_26, plain, (X1=cons(esk2_1(X1),esk1_1(X1))|X1=nil|~ssList(X1)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.19/0.48 cnf(c_0_27, negated_conjecture, (ssList(esk48_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.48 cnf(c_0_28, negated_conjecture, (nil!=esk48_0), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.48 cnf(c_0_29, negated_conjecture, (~ssList(esk1_1(esk48_0))|~ssItem(esk2_1(esk48_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26])]), c_0_27])]), c_0_28])). 0.19/0.48 cnf(c_0_30, plain, (ssItem(esk2_1(X1))|X1=nil|~ssList(X1)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.19/0.48 cnf(c_0_31, negated_conjecture, (~ssList(esk1_1(esk48_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_27])]), c_0_28])). 0.19/0.48 cnf(c_0_32, plain, (ssList(esk1_1(X1))|X1=nil|~ssList(X1)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.19/0.48 cnf(c_0_33, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_27])]), c_0_28]), ['proof']). 0.19/0.48 # SZS output end CNFRefutation 0.19/0.48 # Proof object total steps : 34 0.19/0.48 # Proof object clause steps : 20 0.19/0.48 # Proof object formula steps : 14 0.19/0.48 # Proof object conjectures : 15 0.19/0.48 # Proof object clause conjectures : 12 0.19/0.48 # Proof object formula conjectures : 3 0.19/0.48 # Proof object initial clauses used : 12 0.19/0.48 # Proof object initial formulas used : 7 0.19/0.48 # Proof object generating inferences : 8 0.19/0.48 # Proof object simplifying inferences : 16 0.19/0.48 # Training examples: 0 positive, 0 negative 0.19/0.48 # Parsed axioms : 96 0.19/0.48 # Removed by relevancy pruning/SinE : 0 0.19/0.48 # Initial clauses : 207 0.19/0.48 # Removed in clause preprocessing : 2 0.19/0.48 # Initial clauses in saturation : 205 0.19/0.48 # Processed clauses : 950 0.19/0.48 # ...of these trivial : 5 0.19/0.48 # ...subsumed : 280 0.19/0.48 # ...remaining for further processing : 665 0.19/0.48 # Other redundant clauses eliminated : 124 0.19/0.48 # Clauses deleted for lack of memory : 0 0.19/0.48 # Backward-subsumed : 63 0.19/0.48 # Backward-rewritten : 2 0.19/0.48 # Generated clauses : 2175 0.19/0.48 # ...of the previous two non-trivial : 1932 0.19/0.48 # Contextual simplify-reflections : 66 0.19/0.48 # Paramodulations : 2048 0.19/0.48 # Factorizations : 0 0.19/0.48 # Equation resolutions : 129 0.19/0.48 # Propositional unsat checks : 0 0.19/0.48 # Propositional check models : 0 0.19/0.48 # Propositional check unsatisfiable : 0 0.19/0.48 # Propositional clauses : 0 0.19/0.48 # Propositional clauses after purity: 0 0.19/0.48 # Propositional unsat core size : 0 0.19/0.48 # Propositional preprocessing time : 0.000 0.19/0.48 # Propositional encoding time : 0.000 0.19/0.48 # Propositional solver time : 0.000 0.19/0.48 # Success case prop preproc time : 0.000 0.19/0.48 # Success case prop encoding time : 0.000 0.19/0.48 # Success case prop solver time : 0.000 0.19/0.48 # Current number of processed clauses : 378 0.19/0.48 # Positive orientable unit clauses : 24 0.19/0.48 # Positive unorientable unit clauses: 0 0.19/0.48 # Negative unit clauses : 10 0.19/0.48 # Non-unit-clauses : 344 0.19/0.48 # Current number of unprocessed clauses: 1349 0.19/0.48 # ...number of literals in the above : 9065 0.19/0.48 # Current number of archived formulas : 0 0.19/0.48 # Current number of archived clauses : 264 0.19/0.48 # Clause-clause subsumption calls (NU) : 37641 0.19/0.48 # Rec. Clause-clause subsumption calls : 11169 0.19/0.48 # Non-unit clause-clause subsumptions : 288 0.19/0.48 # Unit Clause-clause subsumption calls : 724 0.19/0.48 # Rewrite failures with RHS unbound : 0 0.19/0.48 # BW rewrite match attempts : 2 0.19/0.48 # BW rewrite match successes : 2 0.19/0.48 # Condensation attempts : 0 0.19/0.48 # Condensation successes : 0 0.19/0.48 # Termbank termtop insertions : 60842 0.19/0.48 0.19/0.48 # ------------------------------------------------- 0.19/0.48 # User time : 0.135 s 0.19/0.48 # System time : 0.008 s 0.19/0.48 # Total time : 0.143 s 0.19/0.48 # Maximum resident set size: 1736 pages 0.19/0.49 EOF