↑ Up

Enigma---0.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS127+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n022.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:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
    ( X1 = X2
    | ~ cUnsatisfiable(X3)
    | ~ rr(X3,X2)
    | ~ rr(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_20) ).

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

cnf(i_0_27,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_27) ).

cnf(i_0_29,plain,
    ( ra_Px1(X1,esk6_1(X1))
    | ~ cdxcomp(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_29) ).

cnf(i_0_25,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_25) ).

cnf(i_0_23,plain,
    ( cc(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_23) ).

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

cnf(i_0_21,plain,
    ( cd(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_21) ).

cnf(i_0_30,plain,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u1ept39v/lgb.p',i_0_30) ).

cnf(c_0_40,plain,
    ( X1 = X2
    | ~ cUnsatisfiable(X3)
    | ~ rr(X3,X2)
    | ~ rr(X3,X1) ),
    i_0_20 ).

cnf(c_0_41,plain,
    ( rr(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_22 ).

cnf(c_0_42,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    i_0_27 ).

cnf(c_0_43,plain,
    ( ra_Px1(X1,esk6_1(X1))
    | ~ cdxcomp(X1) ),
    i_0_29 ).

cnf(c_0_44,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    i_0_25 ).

cnf(c_0_45,plain,
    ( cc(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_23 ).

cnf(c_0_46,plain,
    ( X1 = esk2_1(X2)
    | ~ cUnsatisfiable(X2)
    | ~ rr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

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

cnf(c_0_48,plain,
    ( ~ cd(X1)
    | ~ cdxcomp(X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_49,plain,
    ( cdxcomp(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_50,plain,
    ( cd(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_21 ).

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

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

cnf(c_0_53,plain,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    i_0_30 ).

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

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

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