0.08/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.10 % Command : enigmatic-eprover.py %s %d 1 0.09/0.30 % Computer : n015.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Thu Jul 2 06:46:32 EDT 2020 0.09/0.30 % CPUTime : 0.15/0.40 # ENIGMATIC: Selected SinE mode: 0.15/0.41 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p 0.15/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p 0.15/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p 0.15/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p 11.53/3.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN: 11.53/3.39 # Version: 2.1pre011 11.53/3.39 # Preprocessing time : 0.016 s 11.53/3.39 11.53/3.39 # Proof found! 11.53/3.39 # SZS status Theorem 11.53/3.39 # SZS output start CNFRefutation 11.53/3.39 cnf(i_0_59, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~id(X4,X5)|~r2(X1,X5)|~r2(X3,X6)|~r3(X6,X2,X4)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cgkhlnw8/input.p', i_0_59)). 11.53/3.39 cnf(i_0_33, plain, (r3(X1,esk13_1(X1),esk12_1(X1))), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cgkhlnw8/input.p', i_0_33)). 11.53/3.39 cnf(i_0_34, plain, (r1(esk13_1(X1))), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cgkhlnw8/input.p', i_0_34)). 11.53/3.39 cnf(i_0_32, plain, (id(esk12_1(X1),X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cgkhlnw8/input.p', i_0_32)). 11.53/3.39 cnf(i_0_25, plain, (r2(X1,X2)|~id(X2,esk10_1(X1))), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cgkhlnw8/input.p', i_0_25)). 11.53/3.39 cnf(i_0_43, plain, (id(X1,X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cgkhlnw8/input.p', i_0_43)). 11.53/3.39 cnf(c_0_66, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~id(X4,X5)|~r2(X1,X5)|~r2(X3,X6)|~r3(X6,X2,X4)), i_0_59). 11.53/3.39 cnf(c_0_67, plain, (r3(X1,esk13_1(X1),esk12_1(X1))), i_0_33). 11.53/3.39 cnf(c_0_68, plain, (r1(esk13_1(X1))), i_0_34). 11.53/3.39 cnf(c_0_69, negated_conjecture, (~r2(X1,X2)|~r2(X3,X4)|~id(esk12_1(X2),X4)|~r1(X1)|~r1(X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66, c_0_67]), c_0_68])])). 11.53/3.39 cnf(c_0_70, plain, (id(esk12_1(X1),X1)), i_0_32). 11.53/3.39 cnf(c_0_71, plain, (r2(X1,X2)|~id(X2,esk10_1(X1))), i_0_25). 11.53/3.39 cnf(c_0_72, plain, (id(X1,X1)), i_0_43). 11.53/3.39 cnf(c_0_73, plain, (~r2(X1,X2)|~r2(X3,X2)|~r1(X1)|~r1(X3)), inference(spm,[status(thm)],[c_0_69, c_0_70])). 11.53/3.39 cnf(c_0_74, plain, (r2(X1,esk10_1(X1))), inference(spm,[status(thm)],[c_0_71, c_0_72])). 11.53/3.39 cnf(c_0_75, plain, (~r2(X1,esk10_1(X2))|~r1(X2)|~r1(X1)), inference(spm,[status(thm)],[c_0_73, c_0_74])). 11.53/3.39 cnf(c_0_76, plain, (~r1(X1)), inference(spm,[status(thm)],[c_0_75, c_0_74])). 11.53/3.39 cnf(c_0_77, plain, ($false), inference(sr,[status(thm)],[c_0_68, c_0_76]), ['proof']). 11.53/3.39 # SZS output end CNFRefutation 11.53/3.39 # Proof object total steps : 18 11.53/3.39 # Proof object clause steps : 12 11.53/3.39 # Proof object formula steps : 6 11.53/3.39 # Proof object conjectures : 3 11.53/3.39 # Proof object clause conjectures : 2 11.53/3.39 # Proof object formula conjectures : 1 11.53/3.39 # Proof object initial clauses used : 6 11.53/3.39 # Proof object initial formulas used : 6 11.53/3.39 # Proof object generating inferences : 5 11.53/3.39 # Proof object simplifying inferences : 3 11.53/3.39 # Training examples: 0 positive, 0 negative 11.53/3.39 # Parsed axioms : 43 11.53/3.39 # Removed by relevancy pruning/SinE : 0 11.53/3.39 # Initial clauses : 43 11.53/3.39 # Removed in clause preprocessing : 0 11.53/3.39 # Initial clauses in saturation : 43 11.53/3.39 # Processed clauses : 126 11.53/3.39 # ...of these trivial : 1 11.53/3.39 # ...subsumed : 19 11.53/3.39 # ...remaining for further processing : 106 11.53/3.39 # Other redundant clauses eliminated : 0 11.53/3.39 # Clauses deleted for lack of memory : 0 11.53/3.39 # Backward-subsumed : 0 11.53/3.39 # Backward-rewritten : 0 11.53/3.39 # Generated clauses : 319 11.53/3.39 # ...of the previous two non-trivial : 267 11.53/3.39 # Contextual simplify-reflections : 3 11.53/3.39 # Paramodulations : 311 11.53/3.39 # Factorizations : 0 11.53/3.39 # Equation resolutions : 0 11.53/3.39 # Propositional unsat checks : 0 11.53/3.39 # Propositional unsat check successes : 0 11.53/3.39 # Current number of processed clauses : 98 11.53/3.39 # Positive orientable unit clauses : 29 11.53/3.39 # Positive unorientable unit clauses: 0 11.53/3.39 # Negative unit clauses : 17 11.53/3.39 # Non-unit-clauses : 52 11.53/3.39 # Current number of unprocessed clauses: 156 11.53/3.39 # ...number of literals in the above : 493 11.53/3.39 # Current number of archived formulas : 0 11.53/3.39 # Current number of archived clauses : 8 11.53/3.39 # Clause-clause subsumption calls (NU) : 682 11.53/3.39 # Rec. Clause-clause subsumption calls : 366 11.53/3.39 # Non-unit clause-clause subsumptions : 11 11.53/3.39 # Unit Clause-clause subsumption calls : 556 11.53/3.39 # Rewrite failures with RHS unbound : 0 11.53/3.39 # BW rewrite match attempts : 23 11.53/3.39 # BW rewrite match successes : 0 11.53/3.39 # Condensation attempts : 0 11.53/3.39 # Condensation successes : 0 11.53/3.39 # Termbank termtop insertions : 4084 11.53/3.39 11.53/3.39 # ------------------------------------------------- 11.53/3.39 # User time : 0.020 s 11.53/3.39 # System time : 0.004 s 11.53/3.39 # Total time : 0.024 s 11.53/3.39 # ...preprocessing : 0.016 s 11.53/3.39 # ...main loop : 0.008 s 11.53/3.39 # Maximum resident set size: 7140 pages 11.53/3.39 11.53/14.96 EOF