0.10/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1 0.11/0.32 % Computer : n026.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Thu Jul 2 07:15:41 EDT 2020 0.11/0.32 % CPUTime : 0.18/0.43 # ENIGMATIC: Selected SinE mode: 0.43/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p 0.43/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p 0.43/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p 0.43/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p 8.93/2.86 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y: 8.93/2.86 # Version: 2.1pre011 8.93/2.86 # Preprocessing time : 0.022 s 8.93/2.86 8.93/2.86 # Proof found! 8.93/2.86 # SZS status Theorem 8.93/2.86 # SZS output start CNFRefutation 8.93/2.86 cnf(i_0_672, negated_conjecture, (~loc(X1,X2)|~scar(X1,X3)|~attr(X4,X5)|~subs(X1,stehen_1_1)|~sub(X4,stadt__1_1)|~sub(X5,name_1_1)|~val(X5,rom_0)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_672)). 8.93/2.86 cnf(i_0_59, hypothesis, (val(c137,rom_0)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_59)). 8.93/2.86 cnf(i_0_183, hypothesis, (sub(c137,name_1_1)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_183)). 8.93/2.86 cnf(i_0_57, hypothesis, (attr(c136,c137)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_57)). 8.93/2.86 cnf(i_0_58, hypothesis, (sub(c136,stadt__1_1)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_58)). 8.93/2.86 cnf(i_0_539, plain, (scar(esk27_2(X1,X2),X1)|~loc(X1,X2)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_539)). 8.93/2.86 cnf(i_0_541, plain, (subs(esk27_2(X1,X2),stehen_1_1)|~loc(X1,X2)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_541)). 8.93/2.86 cnf(i_0_540, plain, (loc(esk27_2(X1,X2),X2)|~loc(X1,X2)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_540)). 8.93/2.86 cnf(i_0_630, plain, (loc(X1,esk50_3(X1,X2,X3))|~prop(X1,X2)|~state_adjective_state_binding(X2,X3)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_630)). 8.93/2.86 cnf(i_0_433, plain, (state_adjective_state_binding(italienisch__1_1,italien_0)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_433)). 8.93/2.86 cnf(i_0_56, hypothesis, (prop(c123,italienisch__1_1)), file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hxuahltx/input.p', i_0_56)). 8.93/2.86 cnf(c_0_684, negated_conjecture, (~loc(X1,X2)|~scar(X1,X3)|~attr(X4,X5)|~subs(X1,stehen_1_1)|~sub(X4,stadt__1_1)|~sub(X5,name_1_1)|~val(X5,rom_0)), i_0_672). 8.93/2.86 cnf(c_0_685, hypothesis, (val(c137,rom_0)), i_0_59). 8.93/2.86 cnf(c_0_686, hypothesis, (sub(c137,name_1_1)), i_0_183). 8.93/2.86 cnf(c_0_687, negated_conjecture, (~scar(X1,X2)|~loc(X1,X3)|~attr(X4,c137)|~sub(X4,stadt__1_1)|~subs(X1,stehen_1_1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_684, c_0_685]), c_0_686])])). 8.93/2.86 cnf(c_0_688, hypothesis, (attr(c136,c137)), i_0_57). 8.93/2.86 cnf(c_0_689, hypothesis, (sub(c136,stadt__1_1)), i_0_58). 8.93/2.86 cnf(c_0_690, hypothesis, (~scar(X1,X2)|~loc(X1,X3)|~subs(X1,stehen_1_1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_687, c_0_688]), c_0_689])])). 8.93/2.86 cnf(c_0_691, plain, (scar(esk27_2(X1,X2),X1)|~loc(X1,X2)), i_0_539). 8.93/2.86 cnf(c_0_692, plain, (subs(esk27_2(X1,X2),stehen_1_1)|~loc(X1,X2)), i_0_541). 8.93/2.86 cnf(c_0_693, plain, (~loc(esk27_2(X1,X2),X3)|~loc(X1,X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_690, c_0_691]), c_0_692])). 8.93/2.86 cnf(c_0_694, plain, (loc(esk27_2(X1,X2),X2)|~loc(X1,X2)), i_0_540). 8.93/2.86 cnf(c_0_695, plain, (~loc(X1,X2)), inference(spm,[status(thm)],[c_0_693, c_0_694])). 8.93/2.86 cnf(c_0_696, plain, (loc(X1,esk50_3(X1,X2,X3))|~prop(X1,X2)|~state_adjective_state_binding(X2,X3)), i_0_630). 8.93/2.86 cnf(c_0_697, plain, (~state_adjective_state_binding(X1,X2)|~prop(X3,X1)), inference(spm,[status(thm)],[c_0_695, c_0_696])). 8.93/2.86 cnf(c_0_698, plain, (state_adjective_state_binding(italienisch__1_1,italien_0)), i_0_433). 8.93/2.86 cnf(c_0_699, hypothesis, (prop(c123,italienisch__1_1)), i_0_56). 8.93/2.86 cnf(c_0_700, plain, (~prop(X1,italienisch__1_1)), inference(spm,[status(thm)],[c_0_697, c_0_698])). 8.93/2.86 cnf(c_0_701, hypothesis, ($false), inference(sr,[status(thm)],[c_0_699, c_0_700]), ['proof']). 8.93/2.86 # SZS output end CNFRefutation 8.93/2.86 # Proof object total steps : 29 8.93/2.86 # Proof object clause steps : 18 8.93/2.86 # Proof object formula steps : 11 8.93/2.86 # Proof object conjectures : 3 8.93/2.86 # Proof object clause conjectures : 2 8.93/2.86 # Proof object formula conjectures : 1 8.93/2.86 # Proof object initial clauses used : 11 8.93/2.86 # Proof object initial formulas used : 11 8.93/2.86 # Proof object generating inferences : 6 8.93/2.86 # Proof object simplifying inferences : 6 8.93/2.86 # Training examples: 0 positive, 0 negative 8.93/2.86 # Parsed axioms : 692 8.93/2.86 # Removed by relevancy pruning/SinE : 0 8.93/2.86 # Initial clauses : 692 8.93/2.86 # Removed in clause preprocessing : 0 8.93/2.86 # Initial clauses in saturation : 692 8.93/2.86 # Processed clauses : 733 8.93/2.86 # ...of these trivial : 0 8.93/2.86 # ...subsumed : 8 8.93/2.86 # ...remaining for further processing : 725 8.93/2.86 # Other redundant clauses eliminated : 0 8.93/2.86 # Clauses deleted for lack of memory : 0 8.93/2.86 # Backward-subsumed : 28 8.93/2.86 # Backward-rewritten : 0 8.93/2.86 # Generated clauses : 1705 8.93/2.86 # ...of the previous two non-trivial : 1704 8.93/2.86 # Contextual simplify-reflections : 1 8.93/2.86 # Paramodulations : 1704 8.93/2.86 # Factorizations : 0 8.93/2.86 # Equation resolutions : 0 8.93/2.86 # Propositional unsat checks : 0 8.93/2.86 # Propositional unsat check successes : 0 8.93/2.86 # Current number of processed clauses : 696 8.93/2.86 # Positive orientable unit clauses : 391 8.93/2.86 # Positive unorientable unit clauses: 0 8.93/2.86 # Negative unit clauses : 3 8.93/2.86 # Non-unit-clauses : 302 8.93/2.86 # Current number of unprocessed clauses: 1565 8.93/2.86 # ...number of literals in the above : 4954 8.93/2.86 # Current number of archived formulas : 0 8.93/2.86 # Current number of archived clauses : 29 8.93/2.86 # Clause-clause subsumption calls (NU) : 23631 8.93/2.86 # Rec. Clause-clause subsumption calls : 7905 8.93/2.86 # Non-unit clause-clause subsumptions : 29 8.93/2.86 # Unit Clause-clause subsumption calls : 1120 8.93/2.86 # Rewrite failures with RHS unbound : 0 8.93/2.86 # BW rewrite match attempts : 0 8.93/2.86 # BW rewrite match successes : 0 8.93/2.86 # Condensation attempts : 0 8.93/2.86 # Condensation successes : 0 8.93/2.86 # Termbank termtop insertions : 32640 8.93/2.86 8.93/2.86 # ------------------------------------------------- 8.93/2.86 # User time : 0.051 s 8.93/2.86 # System time : 0.005 s 8.93/2.86 # Total time : 0.056 s 8.93/2.86 # ...preprocessing : 0.022 s 8.93/2.86 # ...main loop : 0.034 s 8.93/2.86 # Maximum resident set size: 9452 pages 8.93/2.86 8.93/2.88 EOF