↑ Up

Enigma---0.5.1.UNS-CRf.s

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

% Computer : n027.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 4.40s 2.11s
% Output   : CNFRefutation 4.40s
% 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    :   54 (   4 equ;  36 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   37 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
    ( X1 = X2
    | ~ rf(X3,X2)
    | ~ rf(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_25) ).

cnf(i_0_24,plain,
    ( rf(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_24) ).

cnf(i_0_23,plain,
    ( rf(X1,esk2_2(X2,X1))
    | ~ cUnsatisfiable(X2)
    | ~ rinvF(esk1_1(X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_23) ).

cnf(i_0_26,plain,
    ( rinvF(X1,X2)
    | ~ rf(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_26) ).

cnf(i_0_22,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cp1(esk2_2(X1,X2))
    | ~ rinvF(esk1_1(X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_22) ).

cnf(i_0_27,plain,
    ( rf(X1,X2)
    | ~ rinvF(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_27) ).

cnf(i_0_21,plain,
    ( cp1(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6zoglvu8/lgb.p',i_0_21) ).

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

cnf(c_0_40,plain,
    ( X1 = X2
    | ~ rf(X3,X2)
    | ~ rf(X3,X1) ),
    i_0_25 ).

cnf(c_0_41,plain,
    ( rf(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_24 ).

cnf(c_0_42,plain,
    ( rf(X1,esk2_2(X2,X1))
    | ~ cUnsatisfiable(X2)
    | ~ rinvF(esk1_1(X2),X1) ),
    i_0_23 ).

cnf(c_0_43,plain,
    ( rinvF(X1,X2)
    | ~ rf(X2,X1) ),
    i_0_26 ).

cnf(c_0_44,plain,
    ( X1 = esk1_1(X2)
    | ~ cUnsatisfiable(X2)
    | ~ rf(X2,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ( rf(X1,esk2_2(X2,X1))
    | ~ cUnsatisfiable(X2)
    | ~ rf(X1,esk1_1(X2)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cp1(esk2_2(X1,X2))
    | ~ rinvF(esk1_1(X1),X2) ),
    i_0_22 ).

cnf(c_0_47,plain,
    ( esk2_2(X1,X2) = esk1_1(X2)
    | ~ cUnsatisfiable(X2)
    | ~ cUnsatisfiable(X1)
    | ~ rf(X2,esk1_1(X1)) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,plain,
    ( rf(X1,X2)
    | ~ rinvF(X2,X1) ),
    i_0_27 ).

cnf(c_0_49,plain,
    ( cp1(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_21 ).

cnf(c_0_50,plain,
    ( ~ rinvF(esk1_1(X1),X2)
    | ~ cUnsatisfiable(X1)
    | ~ cUnsatisfiable(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).

cnf(c_0_51,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rf(X2,esk1_1(X1)) ),
    inference(spm,[status(thm)],[c_0_50,c_0_43]) ).

cnf(c_0_52,plain,
    cUnsatisfiable(i2003_11_14_17_19_49673),
    i_0_31 ).

cnf(c_0_53,plain,
    ~ cUnsatisfiable(X1),
    inference(spm,[status(thm)],[c_0_51,c_0_41]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS088+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 19:51:27 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.40/2.11  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.40/2.11  # No SInE strategy applied
% 4.40/2.11  # Trying AutoSched0 for 150 seconds
% 4.40/2.11  # AutoSched0-Mode selected heuristic G_____0010_evo
% 4.40/2.11  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.40/2.11  #
% 4.40/2.11  # Preprocessing time       : 0.012 s
% 4.40/2.11  
% 4.40/2.11  # Proof found!
% 4.40/2.11  # SZS status Theorem
% 4.40/2.11  # SZS output start CNFRefutation
% See solution above
% 4.40/2.11  # Training examples: 0 positive, 0 negative
% 4.40/2.11  
% 4.40/2.11  # -------------------------------------------------
% 4.40/2.11  # User time                : 0.014 s
% 4.40/2.11  # System time              : 0.003 s
% 4.40/2.11  # Total time               : 0.018 s
% 4.40/2.11  # Maximum resident set size: 7124 pages
% 4.40/2.11  
%------------------------------------------------------------------------------