TSTP Solution File: CSR101+6 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR101+6 : TPTP v8.1.0. Bugfixed v7.3.0.
% 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 : Fri Jul 15 02:47:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2318,plain,
    ( s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q2ynej2g/lgb.p',i_0_2318) ).

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

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

cnf(i_0_4899,plain,
    s__subclass(s__Class32_3,s__Class32_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q2ynej2g/lgb.p',i_0_4899) ).

cnf(i_0_4898,plain,
    s__subclass(s__Class32_2,s__Class32_3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q2ynej2g/lgb.p',i_0_4898) ).

cnf(i_0_4900,negated_conjecture,
    ~ s__instance(esk771_0,s__Class32_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q2ynej2g/lgb.p',i_0_4900) ).

cnf(i_0_4901,negated_conjecture,
    s__instance(esk771_0,s__Class32_2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q2ynej2g/lgb.p',i_0_4901) ).

cnf(c_0_4909,plain,
    ( s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    i_0_2318 ).

cnf(c_0_4910,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    i_0_2316 ).

cnf(c_0_4911,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    i_0_2317 ).

cnf(c_0_4912,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_4909,c_0_4910]),c_0_4911]) ).

cnf(c_0_4913,plain,
    s__subclass(s__Class32_3,s__Class32_1),
    i_0_4899 ).

cnf(c_0_4914,plain,
    s__subclass(s__Class32_2,s__Class32_3),
    i_0_4898 ).

cnf(c_0_4915,plain,
    ( s__instance(X1,s__Class32_1)
    | ~ s__instance(X1,s__Class32_3) ),
    inference(spm,[status(thm)],[c_0_4912,c_0_4913]) ).

cnf(c_0_4916,plain,
    ( s__instance(X1,s__Class32_3)
    | ~ s__instance(X1,s__Class32_2) ),
    inference(spm,[status(thm)],[c_0_4912,c_0_4914]) ).

cnf(c_0_4917,negated_conjecture,
    ~ s__instance(esk771_0,s__Class32_1),
    i_0_4900 ).

cnf(c_0_4918,plain,
    ( s__instance(X1,s__Class32_1)
    | ~ s__instance(X1,s__Class32_2) ),
    inference(spm,[status(thm)],[c_0_4915,c_0_4916]) ).

cnf(c_0_4919,negated_conjecture,
    s__instance(esk771_0,s__Class32_2),
    i_0_4901 ).

cnf(c_0_4920,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4917,c_0_4918]),c_0_4919])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : CSR101+6 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n024.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun  9 18:10:51 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 1.30/1.55  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.30/1.55  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 1.30/1.55  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 1.30/1.55  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 12.44/5.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.44/5.44  # No SInE strategy applied
% 12.44/5.44  # Trying AutoSched0 for 149 seconds
% 12.44/5.44  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 12.44/5.44  # and selection function SelectMaxLComplexAvoidPosPred.
% 12.44/5.44  #
% 12.44/5.44  # Preprocessing time       : 0.023 s
% 12.44/5.44  
% 12.44/5.44  # Proof found!
% 12.44/5.44  # SZS status Theorem
% 12.44/5.44  # SZS output start CNFRefutation
% See solution above
% 12.44/5.44  # Training examples: 0 positive, 0 negative
% 12.44/5.44  
% 12.44/5.44  # -------------------------------------------------
% 12.44/5.44  # User time                : 0.059 s
% 12.44/5.44  # System time              : 0.014 s
% 12.44/5.44  # Total time               : 0.072 s
% 12.44/5.44  # Maximum resident set size: 7128 pages
% 12.44/5.44  
%------------------------------------------------------------------------------