↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR099+2 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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 : Fri Jul 15 02:47:54 EDT 2022

% Result   : Theorem 9.77s 3.51s
% Output   : CNFRefutation 9.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   12 (   7 unt;   0 nHn;  12 RR)
%            Number of literals    :   24 (   5 equ;  14 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   10 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_910,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ikqyeo8j/input.p',i_0_910) ).

cnf(i_0_1776,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ikqyeo8j/input.p',i_0_1776) ).

cnf(i_0_3002,plain,
    s__subclass(s__Class30_1,s__Reptile),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ikqyeo8j/input.p',i_0_3002) ).

cnf(i_0_3003,plain,
    s__subclass(s__Reptile,s__Class30_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ikqyeo8j/input.p',i_0_3003) ).

cnf(i_0_3004,negated_conjecture,
    s__Class30_1 != s__Reptile,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ikqyeo8j/input.p',i_0_3004) ).

cnf(c_0_3010,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass) ),
    i_0_910 ).

cnf(c_0_3011,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    i_0_1776 ).

cnf(c_0_3012,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3010,c_0_3011]),c_0_3011]) ).

cnf(c_0_3013,plain,
    s__subclass(s__Class30_1,s__Reptile),
    i_0_3002 ).

cnf(c_0_3014,plain,
    s__subclass(s__Reptile,s__Class30_1),
    i_0_3003 ).

cnf(c_0_3015,negated_conjecture,
    s__Class30_1 != s__Reptile,
    i_0_3004 ).

cnf(c_0_3016,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3012,c_0_3013]),c_0_3014])]),c_0_3015]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR099+2 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 : Sat Jun 11 10:21:12 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.71/0.89  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.71/0.89  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.71/0.89  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.71/0.89  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.77/3.51  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.77/3.51  # Version: 2.1pre011
% 9.77/3.51  # Preprocessing time       : 0.071 s
% 9.77/3.51  
% 9.77/3.51  # Proof found!
% 9.77/3.51  # SZS status Theorem
% 9.77/3.51  # SZS output start CNFRefutation
% See solution above
% 9.77/3.51  # Proof object total steps             : 12
% 9.77/3.51  # Proof object clause steps            : 7
% 9.77/3.51  # Proof object formula steps           : 5
% 9.77/3.51  # Proof object conjectures             : 2
% 9.77/3.51  # Proof object clause conjectures      : 1
% 9.77/3.51  # Proof object formula conjectures     : 1
% 9.77/3.51  # Proof object initial clauses used    : 5
% 9.77/3.51  # Proof object initial formulas used   : 5
% 9.77/3.51  # Proof object generating inferences   : 1
% 9.77/3.51  # Proof object simplifying inferences  : 5
% 9.77/3.51  # Training examples: 0 positive, 0 negative
% 9.77/3.51  # Parsed axioms                        : 2951
% 9.77/3.51  # Removed by relevancy pruning/SinE    : 0
% 9.77/3.51  # Initial clauses                      : 2951
% 9.77/3.51  # Removed in clause preprocessing      : 0
% 9.77/3.51  # Initial clauses in saturation        : 2951
% 9.77/3.51  # Processed clauses                    : 405
% 9.77/3.51  # ...of these trivial                  : 0
% 9.77/3.51  # ...subsumed                          : 2
% 9.77/3.51  # ...remaining for further processing  : 403
% 9.77/3.51  # Other redundant clauses eliminated   : 2
% 9.77/3.51  # Clauses deleted for lack of memory   : 0
% 9.77/3.51  # Backward-subsumed                    : 0
% 9.77/3.51  # Backward-rewritten                   : 0
% 9.77/3.51  # Generated clauses                    : 1565
% 9.77/3.51  # ...of the previous two non-trivial   : 1291
% 9.77/3.51  # Contextual simplify-reflections      : 6
% 9.77/3.51  # Paramodulations                      : 1563
% 9.77/3.51  # Factorizations                       : 0
% 9.77/3.51  # Equation resolutions                 : 2
% 9.77/3.51  # Propositional unsat checks           : 0
% 9.77/3.51  # Propositional unsat check successes  : 0
% 9.77/3.51  # Current number of processed clauses  : 403
% 9.77/3.51  #    Positive orientable unit clauses  : 308
% 9.77/3.51  #    Positive unorientable unit clauses: 0
% 9.77/3.51  #    Negative unit clauses             : 1
% 9.77/3.51  #    Non-unit-clauses                  : 94
% 9.77/3.51  # Current number of unprocessed clauses: 3832
% 9.77/3.51  # ...number of literals in the above   : 7677
% 9.77/3.51  # Current number of archived formulas  : 0
% 9.77/3.51  # Current number of archived clauses   : 0
% 9.77/3.51  # Clause-clause subsumption calls (NU) : 2676
% 9.77/3.51  # Rec. Clause-clause subsumption calls : 764
% 9.77/3.51  # Non-unit clause-clause subsumptions  : 8
% 9.77/3.51  # Unit Clause-clause subsumption calls : 404
% 9.77/3.51  # Rewrite failures with RHS unbound    : 0
% 9.77/3.51  # BW rewrite match attempts            : 0
% 9.77/3.51  # BW rewrite match successes           : 0
% 9.77/3.51  # Condensation attempts                : 0
% 9.77/3.51  # Condensation successes               : 0
% 9.77/3.51  # Termbank termtop insertions          : 57921
% 9.77/3.51  
% 9.77/3.51  # -------------------------------------------------
% 9.77/3.51  # User time                : 0.076 s
% 9.77/3.51  # System time              : 0.011 s
% 9.77/3.51  # Total time               : 0.087 s
% 9.77/3.51  # ...preprocessing         : 0.071 s
% 9.77/3.51  # ...main loop             : 0.016 s
% 9.77/3.51  # Maximum resident set size: 13148 pages
% 9.77/3.51  
%------------------------------------------------------------------------------