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

View Problem - Process Solution

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

% Computer : n019.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:36 EDT 2022

% Result   : Unsatisfiable 7.47s 2.39s
% Output   : CNFRefutation 7.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   43 (   5 unt;   0 nHn;  43 RR)
%            Number of literals    :   92 (   9 equ;  53 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   58 (   1 sgn)

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

cnf(i_0_86,plain,
    ( rr3(X1,esk5_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_86) ).

cnf(i_0_48,plain,
    ( rtt(X1,X2)
    | ~ rt2(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_48) ).

cnf(i_0_80,plain,
    ( rt2(esk7_1(X1),esk8_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_80) ).

cnf(i_0_78,plain,
    ( X1 = X2
    | ~ epred1_1(X3)
    | ~ rr(X3,X2)
    | ~ rr(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_78) ).

cnf(i_0_46,plain,
    ( rr(X1,X2)
    | ~ rr2(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_46) ).

cnf(i_0_82,plain,
    ( rr2(X1,esk7_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_82) ).

cnf(i_0_81,plain,
    ( X1 = X2
    | ~ epred1_1(X3)
    | ~ rtt(esk7_1(X3),X2)
    | ~ rtt(esk7_1(X3),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_81) ).

cnf(i_0_50,plain,
    ( rtt(X1,X2)
    | ~ rt3(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_50) ).

cnf(i_0_85,plain,
    ( rt3(esk5_1(X1),esk6_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_85) ).

cnf(i_0_44,plain,
    ( ~ cd(X1)
    | ~ ce(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_44) ).

cnf(i_0_84,plain,
    ( ce(esk6_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_84) ).

cnf(i_0_37,plain,
    ( epred1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_37) ).

cnf(i_0_41,plain,
    cUnsatisfiable(i2003_11_14_17_20_25524),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_41) ).

cnf(i_0_79,plain,
    ( cd(esk8_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lzdxdzn0/lgb.p',i_0_79) ).

cnf(c_0_102,plain,
    ( rr(X1,X2)
    | ~ rr3(X1,X2) ),
    i_0_49 ).

cnf(c_0_103,plain,
    ( rr3(X1,esk5_1(X1))
    | ~ epred1_1(X1) ),
    i_0_86 ).

cnf(c_0_104,plain,
    ( rtt(X1,X2)
    | ~ rt2(X1,X2) ),
    i_0_48 ).

cnf(c_0_105,plain,
    ( rt2(esk7_1(X1),esk8_1(X1))
    | ~ epred1_1(X1) ),
    i_0_80 ).

cnf(c_0_106,plain,
    ( X1 = X2
    | ~ epred1_1(X3)
    | ~ rr(X3,X2)
    | ~ rr(X3,X1) ),
    i_0_78 ).

cnf(c_0_107,plain,
    ( rr(X1,esk5_1(X1))
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_102,c_0_103]) ).

cnf(c_0_108,plain,
    ( rr(X1,X2)
    | ~ rr2(X1,X2) ),
    i_0_46 ).

cnf(c_0_109,plain,
    ( rr2(X1,esk7_1(X1))
    | ~ epred1_1(X1) ),
    i_0_82 ).

cnf(c_0_110,plain,
    ( X1 = X2
    | ~ epred1_1(X3)
    | ~ rtt(esk7_1(X3),X2)
    | ~ rtt(esk7_1(X3),X1) ),
    i_0_81 ).

cnf(c_0_111,plain,
    ( rtt(esk7_1(X1),esk8_1(X1))
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_104,c_0_105]) ).

cnf(c_0_112,plain,
    ( X1 = esk5_1(X2)
    | ~ rr(X2,X1)
    | ~ epred1_1(X2) ),
    inference(spm,[status(thm)],[c_0_106,c_0_107]) ).

cnf(c_0_113,plain,
    ( rr(X1,esk7_1(X1))
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_108,c_0_109]) ).

cnf(c_0_114,plain,
    ( X1 = esk8_1(X2)
    | ~ rtt(esk7_1(X2),X1)
    | ~ epred1_1(X2) ),
    inference(spm,[status(thm)],[c_0_110,c_0_111]) ).

cnf(c_0_115,plain,
    ( esk7_1(X1) = esk5_1(X1)
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_112,c_0_113]) ).

cnf(c_0_116,plain,
    ( rtt(X1,X2)
    | ~ rt3(X1,X2) ),
    i_0_50 ).

cnf(c_0_117,plain,
    ( rt3(esk5_1(X1),esk6_1(X1))
    | ~ epred1_1(X1) ),
    i_0_85 ).

cnf(c_0_118,plain,
    ( X1 = esk8_1(X2)
    | ~ rtt(esk5_1(X2),X1)
    | ~ epred1_1(X2) ),
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_119,plain,
    ( rtt(esk5_1(X1),esk6_1(X1))
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_116,c_0_117]) ).

cnf(c_0_120,plain,
    ( ~ cd(X1)
    | ~ ce(X1) ),
    i_0_44 ).

cnf(c_0_121,plain,
    ( ce(esk6_1(X1))
    | ~ epred1_1(X1) ),
    i_0_84 ).

cnf(c_0_122,plain,
    ( epred1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_37 ).

cnf(c_0_123,plain,
    cUnsatisfiable(i2003_11_14_17_20_25524),
    i_0_41 ).

cnf(c_0_124,plain,
    ( cd(esk8_1(X1))
    | ~ epred1_1(X1) ),
    i_0_79 ).

cnf(c_0_125,plain,
    ( esk8_1(X1) = esk6_1(X1)
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_118,c_0_119]) ).

cnf(c_0_126,plain,
    ( ~ cd(esk6_1(X1))
    | ~ epred1_1(X1) ),
    inference(spm,[status(thm)],[c_0_120,c_0_121]) ).

cnf(c_0_127,plain,
    epred1_1(i2003_11_14_17_20_25524),
    inference(spm,[status(thm)],[c_0_122,c_0_123]) ).

cnf(c_0_128,plain,
    ~ epred1_1(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]) ).

cnf(c_0_129,plain,
    $false,
    inference(sr,[status(thm)],[c_0_127,c_0_128]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS098+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 20:07:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.47/2.39  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.39  # No SInE strategy applied
% 7.47/2.39  # Trying AutoSched0 for 150 seconds
% 7.47/2.39  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.47/2.39  # and selection function SelectCQPrecWNTNp.
% 7.47/2.39  #
% 7.47/2.39  # Preprocessing time       : 0.023 s
% 7.47/2.39  
% 7.47/2.39  # Proof found!
% 7.47/2.39  # SZS status Theorem
% 7.47/2.39  # SZS output start CNFRefutation
% See solution above
% 7.47/2.39  # Training examples: 0 positive, 0 negative
% 7.47/2.39  
% 7.47/2.39  # -------------------------------------------------
% 7.47/2.39  # User time                : 0.025 s
% 7.47/2.39  # System time              : 0.006 s
% 7.47/2.39  # Total time               : 0.031 s
% 7.47/2.39  # Maximum resident set size: 7124 pages
% 7.47/2.39  
%------------------------------------------------------------------------------