TSTP Solution File: NLP260+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NLP260+1 : TPTP v8.1.0. Bugfixed v4.0.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n013.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:47 EDT 2022

% Result   : Theorem 19.58s 13.78s
% Output   : CNFRefutation 19.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   7 unt;   0 nHn;  10 RR)
%            Number of literals    :   15 (   0 equ;   7 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    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    7 (   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-8qgqi98a/input.p',i_0_1) ).

cnf(i_0_918,plain,
    hypernym(n10126424,n9855630),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qgqi98a/input.p',i_0_918) ).

cnf(i_0_83,plain,
    hypernym(n9986904,n10126424),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qgqi98a/input.p',i_0_83) ).

cnf(i_0_4,negated_conjecture,
    ~ hypernym(n9986904,n9855630),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qgqi98a/input.p',i_0_4) ).

cnf(c_0_923,plain,
    ( hypernym(X1,X2)
    | ~ hypernym(X3,X2)
    | ~ hypernym(X1,X3) ),
    i_0_1 ).

cnf(c_0_924,plain,
    hypernym(n10126424,n9855630),
    i_0_918 ).

cnf(c_0_925,plain,
    ( hypernym(X1,n9855630)
    | ~ hypernym(X1,n10126424) ),
    inference(spm,[status(thm)],[c_0_923,c_0_924]) ).

cnf(c_0_926,plain,
    hypernym(n9986904,n10126424),
    i_0_83 ).

cnf(c_0_927,negated_conjecture,
    ~ hypernym(n9986904,n9855630),
    i_0_4 ).

cnf(c_0_928,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_925,c_0_926]),c_0_927]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NLP260+1 : TPTP v8.1.0. Bugfixed v4.0.1.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 30 20:59:17 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 10.91/11.13  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.91/11.13  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 10.91/11.13  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 10.91/11.13  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 19.58/13.78  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 19.58/13.78  # Version: 2.1pre011
% 19.58/13.78  # Preprocessing time       : 0.037 s
% 19.58/13.78  
% 19.58/13.78  # Proof found!
% 19.58/13.78  # SZS status Theorem
% 19.58/13.78  # SZS output start CNFRefutation
% See solution above
% 19.58/13.79  # Proof object total steps             : 10
% 19.58/13.79  # Proof object clause steps            : 6
% 19.58/13.79  # Proof object formula steps           : 4
% 19.58/13.79  # Proof object conjectures             : 2
% 19.58/13.79  # Proof object clause conjectures      : 1
% 19.58/13.79  # Proof object formula conjectures     : 1
% 19.58/13.79  # Proof object initial clauses used    : 4
% 19.58/13.79  # Proof object initial formulas used   : 4
% 19.58/13.79  # Proof object generating inferences   : 2
% 19.58/13.79  # Proof object simplifying inferences  : 1
% 19.58/13.79  # Training examples: 0 positive, 0 negative
% 19.58/13.79  # Parsed axioms                        : 2713
% 19.58/13.79  # Removed by relevancy pruning/SinE    : 0
% 19.58/13.79  # Initial clauses                      : 2713
% 19.58/13.79  # Removed in clause preprocessing      : 0
% 19.58/13.79  # Initial clauses in saturation        : 2713
% 19.58/13.79  # Processed clauses                    : 2714
% 19.58/13.79  # ...of these trivial                  : 117
% 19.58/13.79  # ...subsumed                          : 0
% 19.58/13.79  # ...remaining for further processing  : 2597
% 19.58/13.79  # Other redundant clauses eliminated   : 0
% 19.58/13.79  # Clauses deleted for lack of memory   : 0
% 19.58/13.79  # Backward-subsumed                    : 0
% 19.58/13.79  # Backward-rewritten                   : 0
% 19.58/13.79  # Generated clauses                    : 720
% 19.58/13.79  # ...of the previous two non-trivial   : 360
% 19.58/13.79  # Contextual simplify-reflections      : 0
% 19.58/13.79  # Paramodulations                      : 720
% 19.58/13.79  # Factorizations                       : 0
% 19.58/13.79  # Equation resolutions                 : 0
% 19.58/13.79  # Propositional unsat checks           : 0
% 19.58/13.79  # Propositional unsat check successes  : 0
% 19.58/13.79  # Current number of processed clauses  : 2597
% 19.58/13.79  #    Positive orientable unit clauses  : 2592
% 19.58/13.79  #    Positive unorientable unit clauses: 0
% 19.58/13.79  #    Negative unit clauses             : 1
% 19.58/13.79  #    Non-unit-clauses                  : 4
% 19.58/13.79  # Current number of unprocessed clauses: 359
% 19.58/13.79  # ...number of literals in the above   : 716
% 19.58/13.79  # Current number of archived formulas  : 0
% 19.58/13.79  # Current number of archived clauses   : 0
% 19.58/13.79  # Clause-clause subsumption calls (NU) : 9
% 19.58/13.79  # Rec. Clause-clause subsumption calls : 2
% 19.58/13.79  # Non-unit clause-clause subsumptions  : 0
% 19.58/13.79  # Unit Clause-clause subsumption calls : 0
% 19.58/13.79  # Rewrite failures with RHS unbound    : 0
% 19.58/13.79  # BW rewrite match attempts            : 0
% 19.58/13.79  # BW rewrite match successes           : 0
% 19.58/13.79  # Condensation attempts                : 0
% 19.58/13.79  # Condensation successes               : 0
% 19.58/13.79  # Termbank termtop insertions          : 26782
% 19.58/13.79  
% 19.58/13.79  # -------------------------------------------------
% 19.58/13.79  # User time                : 0.058 s
% 19.58/13.79  # System time              : 0.012 s
% 19.58/13.79  # Total time               : 0.070 s
% 19.58/13.79  # ...preprocessing         : 0.037 s
% 19.58/13.79  # ...main loop             : 0.033 s
% 19.58/13.79  # Maximum resident set size: 19460 pages
% 19.58/13.79  
%------------------------------------------------------------------------------