TSTP Solution File: NLP262+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NLP262+1 : TPTP v8.1.0. Bugfixed v4.0.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 01:54:48 EDT 2022
% Result : Theorem 18.65s 12.71s
% Output : CNFRefutation 18.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 13 unt; 0 nHn; 18 RR)
% Number of literals : 25 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( hypernym(X1,X2)
| ~ hypernym(X3,X2)
| ~ hypernym(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qk4a5p7i/input.p',i_0_1) ).
cnf(i_0_198,plain,
hypernym(n10560637,n7846),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qk4a5p7i/input.p',i_0_198) ).
cnf(i_0_2664,plain,
hypernym(n9855630,n10560637),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qk4a5p7i/input.p',i_0_2664) ).
cnf(i_0_904,plain,
hypernym(n10126424,n9855630),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qk4a5p7i/input.p',i_0_904) ).
cnf(i_0_121,plain,
hypernym(n9986904,n10126424),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qk4a5p7i/input.p',i_0_121) ).
cnf(i_0_4,negated_conjecture,
~ hypernym(n9986904,n7846),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qk4a5p7i/input.p',i_0_4) ).
cnf(c_0_2671,plain,
( hypernym(X1,X2)
| ~ hypernym(X3,X2)
| ~ hypernym(X1,X3) ),
i_0_1 ).
cnf(c_0_2672,plain,
hypernym(n10560637,n7846),
i_0_198 ).
cnf(c_0_2673,plain,
( hypernym(X1,n7846)
| ~ hypernym(X1,n10560637) ),
inference(spm,[status(thm)],[c_0_2671,c_0_2672]) ).
cnf(c_0_2674,plain,
hypernym(n9855630,n10560637),
i_0_2664 ).
cnf(c_0_2675,plain,
hypernym(n10126424,n9855630),
i_0_904 ).
cnf(c_0_2676,plain,
hypernym(n9855630,n7846),
inference(spm,[status(thm)],[c_0_2673,c_0_2674]) ).
cnf(c_0_2677,plain,
( hypernym(X1,n9855630)
| ~ hypernym(X1,n10126424) ),
inference(spm,[status(thm)],[c_0_2671,c_0_2675]) ).
cnf(c_0_2678,plain,
hypernym(n9986904,n10126424),
i_0_121 ).
cnf(c_0_2679,plain,
( hypernym(X1,n7846)
| ~ hypernym(X1,n9855630) ),
inference(spm,[status(thm)],[c_0_2671,c_0_2676]) ).
cnf(c_0_2680,plain,
hypernym(n9986904,n9855630),
inference(spm,[status(thm)],[c_0_2677,c_0_2678]) ).
cnf(c_0_2681,negated_conjecture,
~ hypernym(n9986904,n7846),
i_0_4 ).
cnf(c_0_2682,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2679,c_0_2680]),c_0_2681]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP262+1 : TPTP v8.1.0. Bugfixed v4.0.1.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 09:53:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 9.83/10.10 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.83/10.10 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 9.83/10.10 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 9.83/10.10 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 18.65/12.71 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 18.65/12.71 # Version: 2.1pre011
% 18.65/12.71 # Preprocessing time : 0.039 s
% 18.65/12.71
% 18.65/12.71 # Proof found!
% 18.65/12.71 # SZS status Theorem
% 18.65/12.71 # SZS output start CNFRefutation
% See solution above
% 18.65/12.71 # Proof object total steps : 18
% 18.65/12.71 # Proof object clause steps : 12
% 18.65/12.71 # Proof object formula steps : 6
% 18.65/12.71 # Proof object conjectures : 2
% 18.65/12.71 # Proof object clause conjectures : 1
% 18.65/12.71 # Proof object formula conjectures : 1
% 18.65/12.71 # Proof object initial clauses used : 6
% 18.65/12.71 # Proof object initial formulas used : 6
% 18.65/12.71 # Proof object generating inferences : 6
% 18.65/12.71 # Proof object simplifying inferences : 1
% 18.65/12.71 # Training examples: 0 positive, 0 negative
% 18.65/12.71 # Parsed axioms : 2988
% 18.65/12.71 # Removed by relevancy pruning/SinE : 0
% 18.65/12.71 # Initial clauses : 2988
% 18.65/12.71 # Removed in clause preprocessing : 0
% 18.65/12.71 # Initial clauses in saturation : 2988
% 18.65/12.71 # Processed clauses : 3220
% 18.65/12.71 # ...of these trivial : 124
% 18.65/12.71 # ...subsumed : 0
% 18.65/12.71 # ...remaining for further processing : 3096
% 18.65/12.71 # Other redundant clauses eliminated : 0
% 18.65/12.71 # Clauses deleted for lack of memory : 0
% 18.65/12.71 # Backward-subsumed : 0
% 18.65/12.71 # Backward-rewritten : 0
% 18.65/12.71 # Generated clauses : 2306
% 18.65/12.71 # ...of the previous two non-trivial : 1559
% 18.65/12.71 # Contextual simplify-reflections : 0
% 18.65/12.71 # Paramodulations : 2306
% 18.65/12.71 # Factorizations : 0
% 18.65/12.71 # Equation resolutions : 0
% 18.65/12.71 # Propositional unsat checks : 0
% 18.65/12.71 # Propositional unsat check successes : 0
% 18.65/12.71 # Current number of processed clauses : 3096
% 18.65/12.71 # Positive orientable unit clauses : 2970
% 18.65/12.71 # Positive unorientable unit clauses: 0
% 18.65/12.71 # Negative unit clauses : 3
% 18.65/12.71 # Non-unit-clauses : 123
% 18.65/12.71 # Current number of unprocessed clauses: 1320
% 18.65/12.71 # ...number of literals in the above : 2441
% 18.65/12.71 # Current number of archived formulas : 0
% 18.65/12.71 # Current number of archived clauses : 0
% 18.65/12.71 # Clause-clause subsumption calls (NU) : 7122
% 18.65/12.71 # Rec. Clause-clause subsumption calls : 4048
% 18.65/12.71 # Non-unit clause-clause subsumptions : 0
% 18.65/12.71 # Unit Clause-clause subsumption calls : 23
% 18.65/12.71 # Rewrite failures with RHS unbound : 0
% 18.65/12.71 # BW rewrite match attempts : 0
% 18.65/12.71 # BW rewrite match successes : 0
% 18.65/12.71 # Condensation attempts : 0
% 18.65/12.71 # Condensation successes : 0
% 18.65/12.71 # Termbank termtop insertions : 41162
% 18.65/12.71
% 18.65/12.71 # -------------------------------------------------
% 18.65/12.71 # User time : 0.083 s
% 18.65/12.71 # System time : 0.010 s
% 18.65/12.71 # Total time : 0.093 s
% 18.65/12.71 # ...preprocessing : 0.039 s
% 18.65/12.71 # ...main loop : 0.054 s
% 18.65/12.71 # Maximum resident set size: 22360 pages
% 18.65/12.71
%------------------------------------------------------------------------------