TSTP Solution File: CSR099+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR099+3 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n021.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 10.49s 4.66s
% Output   : CNFRefutation 10.49s
% 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_842,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-7iby1pwf/input.p',i_0_842) ).

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

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

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

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

cnf(c_0_3255,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass) ),
    i_0_842 ).

cnf(c_0_3256,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    i_0_621 ).

cnf(c_0_3257,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3255,c_0_3256]),c_0_3256]) ).

cnf(c_0_3258,plain,
    s__subclass(s__Reptile,s__Class30_1),
    i_0_3248 ).

cnf(c_0_3259,plain,
    s__subclass(s__Class30_1,s__Reptile),
    i_0_3247 ).

cnf(c_0_3260,negated_conjecture,
    s__Reptile != s__Class30_1,
    i_0_3249 ).

cnf(c_0_3261,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3257,c_0_3258]),c_0_3259])]),c_0_3260]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR099+3 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n021.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 18:01:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 1.67/1.93  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.67/1.93  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 1.67/1.93  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 1.67/1.93  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.49/4.66  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 10.49/4.66  # Version: 2.1pre011
% 10.49/4.66  # Preprocessing time       : 0.070 s
% 10.49/4.66  
% 10.49/4.66  # Proof found!
% 10.49/4.66  # SZS status Theorem
% 10.49/4.66  # SZS output start CNFRefutation
% See solution above
% 10.49/4.66  # Proof object total steps             : 12
% 10.49/4.66  # Proof object clause steps            : 7
% 10.49/4.66  # Proof object formula steps           : 5
% 10.49/4.66  # Proof object conjectures             : 2
% 10.49/4.66  # Proof object clause conjectures      : 1
% 10.49/4.66  # Proof object formula conjectures     : 1
% 10.49/4.66  # Proof object initial clauses used    : 5
% 10.49/4.66  # Proof object initial formulas used   : 5
% 10.49/4.66  # Proof object generating inferences   : 1
% 10.49/4.66  # Proof object simplifying inferences  : 5
% 10.49/4.66  # Training examples: 0 positive, 0 negative
% 10.49/4.66  # Parsed axioms                        : 3164
% 10.49/4.66  # Removed by relevancy pruning/SinE    : 0
% 10.49/4.66  # Initial clauses                      : 3164
% 10.49/4.66  # Removed in clause preprocessing      : 0
% 10.49/4.66  # Initial clauses in saturation        : 3164
% 10.49/4.66  # Processed clauses                    : 585
% 10.49/4.66  # ...of these trivial                  : 0
% 10.49/4.66  # ...subsumed                          : 1
% 10.49/4.66  # ...remaining for further processing  : 584
% 10.49/4.66  # Other redundant clauses eliminated   : 0
% 10.49/4.66  # Clauses deleted for lack of memory   : 0
% 10.49/4.66  # Backward-subsumed                    : 0
% 10.49/4.66  # Backward-rewritten                   : 10
% 10.49/4.66  # Generated clauses                    : 1004
% 10.49/4.66  # ...of the previous two non-trivial   : 700
% 10.49/4.66  # Contextual simplify-reflections      : 6
% 10.49/4.66  # Paramodulations                      : 1004
% 10.49/4.66  # Factorizations                       : 0
% 10.49/4.66  # Equation resolutions                 : 0
% 10.49/4.66  # Propositional unsat checks           : 0
% 10.49/4.66  # Propositional unsat check successes  : 0
% 10.49/4.66  # Current number of processed clauses  : 574
% 10.49/4.66  #    Positive orientable unit clauses  : 438
% 10.49/4.66  #    Positive unorientable unit clauses: 0
% 10.49/4.66  #    Negative unit clauses             : 1
% 10.49/4.66  #    Non-unit-clauses                  : 135
% 10.49/4.66  # Current number of unprocessed clauses: 3272
% 10.49/4.66  # ...number of literals in the above   : 7825
% 10.49/4.66  # Current number of archived formulas  : 0
% 10.49/4.66  # Current number of archived clauses   : 10
% 10.49/4.66  # Clause-clause subsumption calls (NU) : 4849
% 10.49/4.66  # Rec. Clause-clause subsumption calls : 2252
% 10.49/4.66  # Non-unit clause-clause subsumptions  : 7
% 10.49/4.66  # Unit Clause-clause subsumption calls : 1202
% 10.49/4.66  # Rewrite failures with RHS unbound    : 0
% 10.49/4.66  # BW rewrite match attempts            : 11
% 10.49/4.66  # BW rewrite match successes           : 10
% 10.49/4.66  # Condensation attempts                : 0
% 10.49/4.66  # Condensation successes               : 0
% 10.49/4.66  # Termbank termtop insertions          : 69231
% 10.49/4.66  
% 10.49/4.66  # -------------------------------------------------
% 10.49/4.66  # User time                : 0.081 s
% 10.49/4.66  # System time              : 0.005 s
% 10.49/4.66  # Total time               : 0.086 s
% 10.49/4.66  # ...preprocessing         : 0.070 s
% 10.49/4.66  # ...main loop             : 0.016 s
% 10.49/4.66  # Maximum resident set size: 14640 pages
% 10.49/4.66  
%------------------------------------------------------------------------------