0.02/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.09 % Command : enigmatic-eprover.py %s %d 1 0.08/0.29 % Computer : n003.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 960 0.08/0.29 % WCLimit : 120 0.08/0.29 % DateTime : Thu Jul 2 06:42:58 EDT 2020 0.08/0.29 % CPUTime : 0.14/0.39 # ENIGMATIC: Selected SinE mode: 0.14/0.40 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p 0.14/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p 0.14/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p 0.14/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p 10.41/3.04 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y: 10.41/3.04 # Version: 2.1pre011 10.41/3.04 # Preprocessing time : 0.015 s 10.41/3.04 10.41/3.04 # Proof found! 10.41/3.04 # SZS status Theorem 10.41/3.04 # SZS output start CNFRefutation 10.41/3.04 cnf(i_0_59, negated_conjecture, (~r1(X1)|~id(X2,X3)|~r2(X1,X4)|~r2(X4,X5)|~r3(X6,X5,X2)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mdhvhwy3/input.p', i_0_59)). 10.41/3.04 cnf(i_0_13, plain, (r3(X1,X2,esk2_2(X1,X2))), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mdhvhwy3/input.p', i_0_13)). 10.41/3.04 cnf(i_0_48, plain, (id(X1,X2)|~id(X2,X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mdhvhwy3/input.p', i_0_48)). 10.41/3.04 cnf(i_0_32, plain, (id(esk12_1(X1),X1)), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mdhvhwy3/input.p', i_0_32)). 10.41/3.04 cnf(i_0_21, plain, (r2(X1,esk8_2(X2,X1))), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mdhvhwy3/input.p', i_0_21)). 10.41/3.04 cnf(i_0_34, plain, (r1(esk13_1(X1))), file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mdhvhwy3/input.p', i_0_34)). 10.41/3.04 cnf(c_0_66, negated_conjecture, (~r1(X1)|~id(X2,X3)|~r2(X1,X4)|~r2(X4,X5)|~r3(X6,X5,X2)), i_0_59). 10.41/3.04 cnf(c_0_67, plain, (r3(X1,X2,esk2_2(X1,X2))), i_0_13). 10.41/3.04 cnf(c_0_68, plain, (id(X1,X2)|~id(X2,X1)), i_0_48). 10.41/3.04 cnf(c_0_69, plain, (id(esk12_1(X1),X1)), i_0_32). 10.41/3.04 cnf(c_0_70, negated_conjecture, (~r2(X1,X2)|~r2(X3,X1)|~id(esk2_2(X4,X2),X5)|~r1(X3)), inference(spm,[status(thm)],[c_0_66, c_0_67])). 10.41/3.04 cnf(c_0_71, plain, (id(X1,esk12_1(X1))), inference(spm,[status(thm)],[c_0_68, c_0_69])). 10.41/3.04 cnf(c_0_72, plain, (~r2(X1,X2)|~r2(X3,X1)|~r1(X3)), inference(spm,[status(thm)],[c_0_70, c_0_71])). 10.41/3.04 cnf(c_0_73, plain, (r2(X1,esk8_2(X2,X1))), i_0_21). 10.41/3.04 cnf(c_0_74, plain, (~r2(X1,X2)|~r1(X1)), inference(spm,[status(thm)],[c_0_72, c_0_73])). 10.41/3.04 cnf(c_0_75, plain, (r1(esk13_1(X1))), i_0_34). 10.41/3.04 cnf(c_0_76, plain, (~r1(X1)), inference(spm,[status(thm)],[c_0_74, c_0_73])). 10.41/3.04 cnf(c_0_77, plain, ($false), inference(sr,[status(thm)],[c_0_75, c_0_76]), ['proof']). 10.41/3.04 # SZS output end CNFRefutation 10.41/3.04 # Proof object total steps : 18 10.41/3.04 # Proof object clause steps : 12 10.41/3.04 # Proof object formula steps : 6 10.41/3.04 # Proof object conjectures : 3 10.41/3.04 # Proof object clause conjectures : 2 10.41/3.04 # Proof object formula conjectures : 1 10.41/3.04 # Proof object initial clauses used : 6 10.41/3.04 # Proof object initial formulas used : 6 10.41/3.04 # Proof object generating inferences : 5 10.41/3.04 # Proof object simplifying inferences : 1 10.41/3.04 # Training examples: 0 positive, 0 negative 10.41/3.04 # Parsed axioms : 43 10.41/3.04 # Removed by relevancy pruning/SinE : 0 10.41/3.04 # Initial clauses : 43 10.41/3.04 # Removed in clause preprocessing : 0 10.41/3.04 # Initial clauses in saturation : 43 10.41/3.04 # Processed clauses : 81 10.41/3.04 # ...of these trivial : 1 10.41/3.04 # ...subsumed : 5 10.41/3.04 # ...remaining for further processing : 75 10.41/3.04 # Other redundant clauses eliminated : 0 10.41/3.04 # Clauses deleted for lack of memory : 0 10.41/3.04 # Backward-subsumed : 4 10.41/3.04 # Backward-rewritten : 0 10.41/3.04 # Generated clauses : 217 10.41/3.04 # ...of the previous two non-trivial : 182 10.41/3.04 # Contextual simplify-reflections : 2 10.41/3.04 # Paramodulations : 210 10.41/3.04 # Factorizations : 0 10.41/3.04 # Equation resolutions : 0 10.41/3.04 # Propositional unsat checks : 0 10.41/3.04 # Propositional unsat check successes : 0 10.41/3.04 # Current number of processed clauses : 64 10.41/3.04 # Positive orientable unit clauses : 21 10.41/3.04 # Positive unorientable unit clauses: 0 10.41/3.04 # Negative unit clauses : 9 10.41/3.04 # Non-unit-clauses : 34 10.41/3.04 # Current number of unprocessed clauses: 118 10.41/3.04 # ...number of literals in the above : 315 10.41/3.04 # Current number of archived formulas : 0 10.41/3.04 # Current number of archived clauses : 11 10.41/3.04 # Clause-clause subsumption calls (NU) : 316 10.41/3.04 # Rec. Clause-clause subsumption calls : 156 10.41/3.04 # Non-unit clause-clause subsumptions : 9 10.41/3.04 # Unit Clause-clause subsumption calls : 233 10.41/3.04 # Rewrite failures with RHS unbound : 0 10.41/3.04 # BW rewrite match attempts : 8 10.41/3.04 # BW rewrite match successes : 0 10.41/3.04 # Condensation attempts : 0 10.41/3.04 # Condensation successes : 0 10.41/3.04 # Termbank termtop insertions : 2848 10.41/3.04 10.41/3.04 # ------------------------------------------------- 10.41/3.04 # User time : 0.018 s 10.41/3.04 # System time : 0.002 s 10.41/3.04 # Total time : 0.020 s 10.41/3.04 # ...preprocessing : 0.015 s 10.41/3.04 # ...main loop : 0.005 s 10.41/3.04 # Maximum resident set size: 7124 pages 10.41/3.04 10.41/14.73 EOF