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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS089+1 : TPTP v8.1.0. Released v3.1.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:55:34 EDT 2022

% Result   : Unsatisfiable 7.57s 2.29s
% Output   : CNFRefutation 7.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (   7 unt;   5 nHn;  15 RR)
%            Number of literals    :   48 (  22 equ;  26 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   30 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
    ( rinvP(X1,X2)
    | ~ rp(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_25) ).

cnf(i_0_23,plain,
    rp(X1,ispy),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_23) ).

cnf(i_0_26,plain,
    ( X1 = X2
    | X3 = X2
    | X3 = X1
    | ~ rinvP(ispy,X2)
    | ~ rinvP(ispy,X1)
    | ~ rinvP(ispy,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_26) ).

cnf(i_0_17,plain,
    ( esk3_1(X1) != esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_17) ).

cnf(i_0_16,plain,
    ( esk3_1(X1) != esk2_1(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_16) ).

cnf(i_0_18,plain,
    ( esk2_1(X1) != esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_18) ).

cnf(i_0_28,plain,
    cUnsatisfiable(i2003_11_14_17_19_53168),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xyqc_uac/lgb.p',i_0_28) ).

cnf(c_0_36,plain,
    ( rinvP(X1,X2)
    | ~ rp(X2,X1) ),
    i_0_25 ).

cnf(c_0_37,plain,
    rp(X1,ispy),
    i_0_23 ).

cnf(c_0_38,plain,
    ( X1 = X2
    | X3 = X2
    | X3 = X1
    | ~ rinvP(ispy,X2)
    | ~ rinvP(ispy,X1)
    | ~ rinvP(ispy,X3) ),
    i_0_26 ).

cnf(c_0_39,plain,
    rinvP(ispy,X1),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_40,plain,
    ( esk3_1(X1) != esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_17 ).

cnf(c_0_41,plain,
    ( X1 = X2
    | X3 = X2
    | X3 = X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_39])]) ).

cnf(c_0_42,plain,
    ( esk3_1(X1) = X2
    | X3 = X2
    | X3 != esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_43,plain,
    ( esk3_1(X1) != esk2_1(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_16 ).

cnf(c_0_44,plain,
    ( esk1_1(X1) = X2
    | esk3_1(X1) = X2
    | ~ cUnsatisfiable(X1) ),
    inference(er,[status(thm)],[c_0_42]) ).

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

cnf(c_0_46,plain,
    ( esk2_1(X1) != esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_18 ).

cnf(c_0_47,plain,
    cUnsatisfiable(i2003_11_14_17_19_53168),
    i_0_28 ).

cnf(c_0_48,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46]) ).

cnf(c_0_49,plain,
    $false,
    inference(sr,[status(thm)],[c_0_47,c_0_48]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KRS089+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n020.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Tue Jun  7 20:11:38 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 7.57/2.29  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.57/2.29  # No SInE strategy applied
% 7.57/2.29  # Trying AutoSched0 for 150 seconds
% 7.57/2.29  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.57/2.29  # and selection function SelectCQPrecWNTNp.
% 7.57/2.29  #
% 7.57/2.29  # Preprocessing time       : 0.023 s
% 7.57/2.29  
% 7.57/2.29  # Proof found!
% 7.57/2.29  # SZS status Theorem
% 7.57/2.29  # SZS output start CNFRefutation
% See solution above
% 7.57/2.29  # Training examples: 0 positive, 0 negative
% 7.57/2.29  
% 7.57/2.29  # -------------------------------------------------
% 7.57/2.29  # User time                : 0.025 s
% 7.57/2.29  # System time              : 0.005 s
% 7.57/2.29  # Total time               : 0.030 s
% 7.57/2.29  # Maximum resident set size: 7120 pages
% 7.57/2.29  
%------------------------------------------------------------------------------