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

View Problem - Process Solution

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

% Computer : n020.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 : Sun Jul 17 02:56:06 EDT 2022

% Result   : Theorem 4.85s 2.16s
% Output   : CNFRefutation 4.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   26 (  11 unt;   4 nHn;  16 RR)
%            Number of literals    :   47 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-1 aty)
%            Number of variables   :   47 (  18 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_49,negated_conjecture,
    ~ nota(sap,thm),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_49) ).

cnf(i_0_48,plain,
    ( nota(X1,X2)
    | status(X3,X4,X2)
    | ~ status(X3,X4,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_48) ).

cnf(i_0_76,plain,
    ( model(X1,X2)
    | ~ model(X1,X3)
    | ~ status(X3,X2,thm) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_76) ).

cnf(i_0_53,plain,
    ( status(X1,X2,sap)
    | ~ model(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_53) ).

cnf(i_0_1,plain,
    ( ~ model(X1,X2)
    | ~ status(X2,X3,cax) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_1) ).

cnf(i_0_2,plain,
    ( model(esk1_1(X1),X1)
    | status(X1,X2,cax) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_2) ).

cnf(i_0_72,plain,
    model(X1,esk48_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_72) ).

cnf(i_0_31,plain,
    model(esk20_0,esk18_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_31) ).

cnf(i_0_30,plain,
    ~ model(esk21_0,esk18_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g5s7puaq/lgb.p',i_0_30) ).

cnf(c_0_86,negated_conjecture,
    ~ nota(sap,thm),
    i_0_49 ).

cnf(c_0_87,plain,
    ( nota(X1,X2)
    | status(X3,X4,X2)
    | ~ status(X3,X4,X1) ),
    i_0_48 ).

cnf(c_0_88,plain,
    ( model(X1,X2)
    | ~ model(X1,X3)
    | ~ status(X3,X2,thm) ),
    i_0_76 ).

cnf(c_0_89,negated_conjecture,
    ( status(X1,X2,thm)
    | ~ status(X1,X2,sap) ),
    inference(spm,[status(thm)],[c_0_86,c_0_87]) ).

cnf(c_0_90,plain,
    ( model(X1,X2)
    | ~ status(X3,X2,sap)
    | ~ model(X1,X3) ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_91,plain,
    ( status(X1,X2,sap)
    | ~ model(X3,X2) ),
    i_0_53 ).

cnf(c_0_92,plain,
    ( ~ model(X1,X2)
    | ~ status(X2,X3,cax) ),
    i_0_1 ).

cnf(c_0_93,plain,
    ( model(esk1_1(X1),X1)
    | status(X1,X2,cax) ),
    i_0_2 ).

cnf(c_0_94,plain,
    ( model(X1,X2)
    | ~ model(X1,X3)
    | ~ model(X4,X2) ),
    inference(spm,[status(thm)],[c_0_90,c_0_91]) ).

cnf(c_0_95,plain,
    model(X1,esk48_0),
    i_0_72 ).

cnf(c_0_96,plain,
    ( model(esk1_1(X1),X1)
    | ~ model(X2,X1) ),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_97,plain,
    model(esk20_0,esk18_0),
    i_0_31 ).

cnf(c_0_98,plain,
    ( model(X1,X2)
    | ~ model(X3,X2) ),
    inference(spm,[status(thm)],[c_0_94,c_0_95]) ).

cnf(c_0_99,plain,
    model(esk1_1(esk18_0),esk18_0),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_100,plain,
    ~ model(esk21_0,esk18_0),
    i_0_30 ).

cnf(c_0_101,plain,
    model(X1,esk18_0),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_102,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : KRS201+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun  7 11:22:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.85/2.16  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.85/2.16  # No SInE strategy applied
% 4.85/2.16  # Trying AutoSched0 for 150 seconds
% 4.85/2.16  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
% 4.85/2.16  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.85/2.16  #
% 4.85/2.16  # Preprocessing time       : 0.025 s
% 4.85/2.16  # Presaturation interreduction done
% 4.85/2.16  
% 4.85/2.16  # Proof found!
% 4.85/2.16  # SZS status Theorem
% 4.85/2.16  # SZS output start CNFRefutation
% See solution above
% 4.85/2.16  # Training examples: 0 positive, 0 negative
% 4.85/2.16  
% 4.85/2.16  # -------------------------------------------------
% 4.85/2.16  # User time                : 0.034 s
% 4.85/2.16  # System time              : 0.006 s
% 4.85/2.16  # Total time               : 0.040 s
% 4.85/2.16  # Maximum resident set size: 7120 pages
% 4.85/2.16  
%------------------------------------------------------------------------------