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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS077+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n026.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:55:32 EDT 2022

% Result   : Unsatisfiable 4.66s 2.23s
% Output   : CNFRefutation 4.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   4 unt;   0 nHn;  23 RR)
%            Number of literals    :   51 (   4 equ;  31 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   33 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
    ( rr(X1,X2)
    | ~ rs(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_32) ).

cnf(i_0_24,plain,
    ( rs(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_24) ).

cnf(i_0_28,plain,
    ( X1 = X2
    | ~ cUnsatisfiable(X3)
    | ~ rr(X3,X2)
    | ~ rr(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_28) ).

cnf(i_0_26,plain,
    ( cp(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rinvS(esk1_1(X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_26) ).

cnf(i_0_29,plain,
    ( rinvS(X1,X2)
    | ~ rs(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_29) ).

cnf(i_0_27,plain,
    ( rr(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_27) ).

cnf(i_0_25,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cp(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_25) ).

cnf(i_0_31,plain,
    cUnsatisfiable(i2003_11_14_17_19_09372),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l0d5ryvx/lgb.p',i_0_31) ).

cnf(c_0_41,plain,
    ( rr(X1,X2)
    | ~ rs(X1,X2) ),
    i_0_32 ).

cnf(c_0_42,plain,
    ( rs(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_24 ).

cnf(c_0_43,plain,
    ( X1 = X2
    | ~ cUnsatisfiable(X3)
    | ~ rr(X3,X2)
    | ~ rr(X3,X1) ),
    i_0_28 ).

cnf(c_0_44,plain,
    ( rr(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    ( cp(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rinvS(esk1_1(X2),X1) ),
    i_0_26 ).

cnf(c_0_46,plain,
    ( rinvS(X1,X2)
    | ~ rs(X2,X1) ),
    i_0_29 ).

cnf(c_0_47,plain,
    ( X1 = esk2_1(X2)
    | ~ cUnsatisfiable(X2)
    | ~ rr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,plain,
    ( rr(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_27 ).

cnf(c_0_49,plain,
    ( cp(X1)
    | ~ rs(X1,esk1_1(X2))
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,plain,
    ( esk1_1(X1) = esk2_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,plain,
    ( cp(X1)
    | ~ rs(X1,esk2_1(X2))
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_52,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cp(X1) ),
    i_0_25 ).

cnf(c_0_53,plain,
    cUnsatisfiable(i2003_11_14_17_19_09372),
    i_0_31 ).

cnf(c_0_54,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_42]),c_0_52]) ).

cnf(c_0_55,plain,
    $false,
    inference(sr,[status(thm)],[c_0_53,c_0_54]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : KRS077+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 : Tue Jun  7 13:27:18 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.66/2.23  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.66/2.23  # No SInE strategy applied
% 4.66/2.23  # Trying AutoSched0 for 150 seconds
% 4.66/2.23  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.66/2.23  # and selection function SelectComplexExceptUniqMaxHorn.
% 4.66/2.23  #
% 4.66/2.23  # Preprocessing time       : 0.012 s
% 4.66/2.23  # Presaturation interreduction done
% 4.66/2.23  
% 4.66/2.23  # Proof found!
% 4.66/2.23  # SZS status Theorem
% 4.66/2.23  # SZS output start CNFRefutation
% See solution above
% 4.66/2.23  # Training examples: 0 positive, 0 negative
% 4.66/2.23  
% 4.66/2.23  # -------------------------------------------------
% 4.66/2.23  # User time                : 0.015 s
% 4.66/2.23  # System time              : 0.003 s
% 4.66/2.23  # Total time               : 0.018 s
% 4.66/2.23  # Maximum resident set size: 7128 pages
% 4.66/2.23  
%------------------------------------------------------------------------------