0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1 0.13/0.34 % Computer : n017.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Thu Jul 2 08:10:08 EDT 2020 0.13/0.35 % CPUTime : 0.21/0.46 # ENIGMATIC: Selected SinE mode: 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p 8.16/2.58 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y: 8.16/2.58 # Version: 2.1pre011 8.16/2.58 # Preprocessing time : 0.013 s 8.16/2.58 8.16/2.58 # Proof found! 8.16/2.58 # SZS status Theorem 8.16/2.58 # SZS output start CNFRefutation 8.16/2.58 cnf(i_0_195, negated_conjecture, (memberP(X1,esk53_3(X2,X1,X3))|app(app(X1,cons(X2,nil)),X3)!=esk48_0|~ssList(X3)|~ssList(X1)|~ssItem(X2)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_195)). 8.16/2.58 cnf(i_0_205, negated_conjecture, (esk50_0=esk48_0), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_205)). 8.16/2.58 cnf(i_0_79, plain, (~ssItem(X1)|~memberP(nil,X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_79)). 8.16/2.58 cnf(i_0_44, plain, (ssList(nil)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_44)). 8.16/2.58 cnf(i_0_196, negated_conjecture, (ssItem(esk53_3(X1,X2,X3))|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_196)). 8.16/2.58 cnf(i_0_191, negated_conjecture, (nil!=esk48_0), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_191)). 8.16/2.58 cnf(i_0_197, negated_conjecture, (esk50_0=nil|cons(esk52_0,nil)=esk50_0), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_197)). 8.16/2.58 cnf(i_0_203, negated_conjecture, (esk50_0=nil|ssItem(esk52_0)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_203)). 8.16/2.58 cnf(i_0_159, plain, (app(X1,nil)=X1|~ssList(X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_159)). 8.16/2.58 cnf(i_0_60, plain, (app(nil,X1)=X1|~ssList(X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_60)). 8.16/2.58 cnf(i_0_208, negated_conjecture, (ssList(esk50_0)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9emqplrg/input.p', i_0_208)). 8.16/2.58 cnf(c_0_220, negated_conjecture, (memberP(X1,esk53_3(X2,X1,X3))|app(app(X1,cons(X2,nil)),X3)!=esk48_0|~ssList(X3)|~ssList(X1)|~ssItem(X2)), i_0_195). 8.16/2.58 cnf(c_0_221, negated_conjecture, (esk50_0=esk48_0), i_0_205). 8.16/2.58 cnf(c_0_222, plain, (~ssItem(X1)|~memberP(nil,X1)), i_0_79). 8.16/2.58 cnf(c_0_223, negated_conjecture, (memberP(X1,esk53_3(X2,X1,X3))|app(app(X1,cons(X2,nil)),X3)!=esk50_0|~ssItem(X2)|~ssList(X3)|~ssList(X1)), inference(rw,[status(thm)],[c_0_220, c_0_221])). 8.16/2.58 cnf(c_0_224, plain, (ssList(nil)), i_0_44). 8.16/2.58 cnf(c_0_225, negated_conjecture, (ssItem(esk53_3(X1,X2,X3))|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)), i_0_196). 8.16/2.58 cnf(c_0_226, negated_conjecture, (nil!=esk48_0), i_0_191). 8.16/2.58 cnf(c_0_227, plain, (app(app(nil,cons(X1,nil)),X2)!=esk50_0|~ssItem(esk53_3(X1,nil,X2))|~ssItem(X1)|~ssList(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222, c_0_223]), c_0_224])])). 8.16/2.58 cnf(c_0_228, negated_conjecture, (ssItem(esk53_3(X1,X2,X3))|app(app(X2,cons(X1,nil)),X3)!=esk50_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)), inference(rw,[status(thm)],[c_0_225, c_0_221])). 8.16/2.58 cnf(c_0_229, negated_conjecture, (esk50_0=nil|cons(esk52_0,nil)=esk50_0), i_0_197). 8.16/2.58 cnf(c_0_230, negated_conjecture, (esk50_0!=nil), inference(rw,[status(thm)],[c_0_226, c_0_221])). 8.16/2.58 cnf(c_0_231, negated_conjecture, (esk50_0=nil|ssItem(esk52_0)), i_0_203). 8.16/2.58 cnf(c_0_232, negated_conjecture, (app(app(nil,cons(X1,nil)),X2)!=esk50_0|~ssItem(X1)|~ssList(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227, c_0_228]), c_0_224])])). 8.16/2.58 cnf(c_0_233, negated_conjecture, (cons(esk52_0,nil)=esk50_0), inference(sr,[status(thm)],[c_0_229, c_0_230])). 8.16/2.58 cnf(c_0_234, negated_conjecture, (ssItem(esk52_0)), inference(sr,[status(thm)],[c_0_231, c_0_230])). 8.16/2.58 cnf(c_0_235, negated_conjecture, (app(app(nil,esk50_0),X1)!=esk50_0|~ssList(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232, c_0_233]), c_0_234])])). 8.16/2.58 cnf(c_0_236, plain, (app(X1,nil)=X1|~ssList(X1)), i_0_159). 8.16/2.58 cnf(c_0_237, plain, (app(nil,esk50_0)!=esk50_0|~ssList(app(nil,esk50_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235, c_0_236]), c_0_224])])). 8.16/2.58 cnf(c_0_238, plain, (app(nil,X1)=X1|~ssList(X1)), i_0_60). 8.16/2.58 cnf(c_0_239, negated_conjecture, (ssList(esk50_0)), i_0_208). 8.16/2.58 cnf(c_0_240, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237, c_0_238]), c_0_239])]), ['proof']). 8.16/2.58 # SZS output end CNFRefutation 8.16/2.58 # Proof object total steps : 32 8.16/2.58 # Proof object clause steps : 21 8.16/2.58 # Proof object formula steps : 11 8.16/2.58 # Proof object conjectures : 21 8.16/2.58 # Proof object clause conjectures : 14 8.16/2.58 # Proof object formula conjectures : 7 8.16/2.58 # Proof object initial clauses used : 11 8.16/2.58 # Proof object initial formulas used : 11 8.16/2.58 # Proof object generating inferences : 5 8.16/2.58 # Proof object simplifying inferences : 15 8.16/2.58 # Training examples: 0 positive, 0 negative 8.16/2.58 # Parsed axioms : 208 8.16/2.58 # Removed by relevancy pruning/SinE : 0 8.16/2.58 # Initial clauses : 208 8.16/2.58 # Removed in clause preprocessing : 0 8.16/2.58 # Initial clauses in saturation : 208 8.16/2.58 # Processed clauses : 303 8.16/2.58 # ...of these trivial : 5 8.16/2.58 # ...subsumed : 39 8.16/2.58 # ...remaining for further processing : 259 8.16/2.58 # Other redundant clauses eliminated : 87 8.16/2.58 # Clauses deleted for lack of memory : 0 8.16/2.58 # Backward-subsumed : 5 8.16/2.58 # Backward-rewritten : 1 8.16/2.58 # Generated clauses : 1247 8.16/2.58 # ...of the previous two non-trivial : 1067 8.16/2.58 # Contextual simplify-reflections : 25 8.16/2.58 # Paramodulations : 1137 8.16/2.58 # Factorizations : 0 8.16/2.58 # Equation resolutions : 107 8.16/2.58 # Propositional unsat checks : 0 8.16/2.58 # Propositional unsat check successes : 0 8.16/2.58 # Current number of processed clauses : 244 8.16/2.58 # Positive orientable unit clauses : 27 8.16/2.58 # Positive unorientable unit clauses: 0 8.16/2.58 # Negative unit clauses : 4 8.16/2.58 # Non-unit-clauses : 213 8.16/2.58 # Current number of unprocessed clauses: 896 8.16/2.58 # ...number of literals in the above : 6468 8.16/2.58 # Current number of archived formulas : 0 8.16/2.58 # Current number of archived clauses : 9 8.16/2.58 # Clause-clause subsumption calls (NU) : 8065 8.16/2.58 # Rec. Clause-clause subsumption calls : 1906 8.16/2.58 # Non-unit clause-clause subsumptions : 53 8.16/2.58 # Unit Clause-clause subsumption calls : 105 8.16/2.58 # Rewrite failures with RHS unbound : 0 8.16/2.58 # BW rewrite match attempts : 4 8.16/2.58 # BW rewrite match successes : 4 8.16/2.58 # Condensation attempts : 0 8.16/2.58 # Condensation successes : 0 8.16/2.58 # Termbank termtop insertions : 29013 8.16/2.58 8.16/2.58 # ------------------------------------------------- 8.16/2.58 # User time : 0.036 s 8.16/2.58 # System time : 0.002 s 8.16/2.58 # Total time : 0.038 s 8.16/2.58 # ...preprocessing : 0.013 s 8.16/2.58 # ...main loop : 0.026 s 8.16/2.58 # Maximum resident set size: 7132 pages 8.16/2.58 8.16/2.61 EOF