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

View Problem - Process Solution

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

% Computer : n029.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:31 EDT 2022

% Result   : Unsatisfiable 7.62s 2.49s
% Output   : CNFRefutation 7.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   4 unt;   0 nHn;  23 RR)
%            Number of literals    :   47 (   4 equ;  29 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   :   27 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
    ( rr(X1,X2)
    | ~ rinvR(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_38) ).

cnf(i_0_26,plain,
    ( rinvR(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_26) ).

cnf(i_0_29,plain,
    ( ~ cp1(X1)
    | ~ cp2(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_29) ).

cnf(i_0_23,plain,
    ( cp1(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_23) ).

cnf(i_0_25,plain,
    ( X1 = X2
    | ~ cUnsatisfiable(X3)
    | ~ rr(esk1_1(X3),X2)
    | ~ rr(esk1_1(X3),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_25) ).

cnf(i_0_22,plain,
    ( cp2(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_22) ).

cnf(i_0_24,plain,
    ( rr(esk1_1(X1),esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_24) ).

cnf(i_0_39,plain,
    cUnsatisfiable(i2003_11_14_17_18_50190),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zyc4bckz/lgb.p',i_0_39) ).

cnf(c_0_48,plain,
    ( rr(X1,X2)
    | ~ rinvR(X2,X1) ),
    i_0_38 ).

cnf(c_0_49,plain,
    ( rinvR(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_26 ).

cnf(c_0_50,plain,
    ( ~ cp1(X1)
    | ~ cp2(X1) ),
    i_0_29 ).

cnf(c_0_51,plain,
    ( cp1(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_23 ).

cnf(c_0_52,plain,
    ( X1 = X2
    | ~ cUnsatisfiable(X3)
    | ~ rr(esk1_1(X3),X2)
    | ~ rr(esk1_1(X3),X1) ),
    i_0_25 ).

cnf(c_0_53,plain,
    ( rr(esk1_1(X1),X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_54,plain,
    ( ~ cp2(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_55,plain,
    ( cp2(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_22 ).

cnf(c_0_56,plain,
    ( X1 = X2
    | ~ rr(esk1_1(X2),X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_57,plain,
    ( rr(esk1_1(X1),esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_24 ).

cnf(c_0_58,plain,
    ( ~ cUnsatisfiable(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_59,plain,
    ( esk2_1(X1) = X1
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,plain,
    cUnsatisfiable(i2003_11_14_17_18_50190),
    i_0_39 ).

cnf(c_0_61,plain,
    ~ cUnsatisfiable(X1),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_62,plain,
    $false,
    inference(sr,[status(thm)],[c_0_60,c_0_61]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun  7 20:27:37 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.62/2.49  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.49  # No SInE strategy applied
% 7.62/2.49  # Trying AutoSched0 for 150 seconds
% 7.62/2.49  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.62/2.49  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.62/2.49  #
% 7.62/2.49  # Preprocessing time       : 0.013 s
% 7.62/2.49  # Presaturation interreduction done
% 7.62/2.49  
% 7.62/2.49  # Proof found!
% 7.62/2.49  # SZS status Theorem
% 7.62/2.49  # SZS output start CNFRefutation
% See solution above
% 7.62/2.49  # Training examples: 0 positive, 0 negative
% 7.62/2.49  
% 7.62/2.49  # -------------------------------------------------
% 7.62/2.49  # User time                : 0.013 s
% 7.62/2.49  # System time              : 0.008 s
% 7.62/2.49  # Total time               : 0.021 s
% 7.62/2.49  # Maximum resident set size: 7120 pages
% 7.62/2.49  
%------------------------------------------------------------------------------