↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n018.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 : Sat Jul 16 08:39:49 EDT 2022

% Result   : Theorem 10.89s 4.22s
% Output   : CNFRefutation 10.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   23 (  19 unt;   2 nHn;  23 RR)
%            Number of literals    :   37 (   7 equ;  17 neg)
%            Maximal clause size   :    7 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2257,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk383_0),esk384_0) = k1_xboole_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2257) ).

cnf(i_0_3238,plain,
    k1_xboole_0 = np__0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_3238) ).

cnf(i_0_332,plain,
    ( X1 != k1_xboole_0
    | ~ r2_hidden(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_332) ).

cnf(i_0_2185,plain,
    ( v3_struct_0(X1)
    | r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2))
    | ~ l1_group_1(X1)
    | ~ v1_group_1(X2)
    | ~ v3_group_1(X1)
    | ~ v4_group_1(X1)
    | ~ m1_group_2(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2185) ).

cnf(i_0_2261,negated_conjecture,
    v4_group_1(esk383_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2261) ).

cnf(i_0_2262,negated_conjecture,
    v3_group_1(esk383_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2262) ).

cnf(i_0_2259,negated_conjecture,
    v1_group_1(esk384_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2259) ).

cnf(i_0_2260,negated_conjecture,
    l1_group_1(esk383_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2260) ).

cnf(i_0_2258,negated_conjecture,
    m1_group_2(esk384_0,esk383_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2258) ).

cnf(i_0_2263,negated_conjecture,
    ~ v3_struct_0(esk383_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hed4l1__/lgb.p',i_0_2263) ).

cnf(c_0_3249,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk383_0),esk384_0) = k1_xboole_0,
    i_0_2257 ).

cnf(c_0_3250,plain,
    k1_xboole_0 = np__0,
    i_0_3238 ).

cnf(c_0_3251,plain,
    ( X1 != k1_xboole_0
    | ~ r2_hidden(X2,X1) ),
    i_0_332 ).

cnf(c_0_3252,plain,
    ( v3_struct_0(X1)
    | r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2))
    | ~ l1_group_1(X1)
    | ~ v1_group_1(X2)
    | ~ v3_group_1(X1)
    | ~ v4_group_1(X1)
    | ~ m1_group_2(X2,X1) ),
    i_0_2185 ).

cnf(c_0_3253,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk383_0),esk384_0) = np__0,
    inference(rw,[status(thm)],[c_0_3249,c_0_3250]) ).

cnf(c_0_3254,negated_conjecture,
    v4_group_1(esk383_0),
    i_0_2261 ).

cnf(c_0_3255,negated_conjecture,
    v3_group_1(esk383_0),
    i_0_2262 ).

cnf(c_0_3256,negated_conjecture,
    v1_group_1(esk384_0),
    i_0_2259 ).

cnf(c_0_3257,negated_conjecture,
    l1_group_1(esk383_0),
    i_0_2260 ).

cnf(c_0_3258,negated_conjecture,
    m1_group_2(esk384_0,esk383_0),
    i_0_2258 ).

cnf(c_0_3259,plain,
    ~ r2_hidden(X1,np__0),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_3251,c_0_3250])]) ).

cnf(c_0_3260,negated_conjecture,
    ~ v3_struct_0(esk383_0),
    i_0_2263 ).

cnf(c_0_3261,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3252,c_0_3253]),c_0_3254]),c_0_3255]),c_0_3256]),c_0_3257]),c_0_3258])]),c_0_3259]),c_0_3260]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem  : GRP642+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.36  % Computer : n018.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 600
% 0.13/0.36  % DateTime : Mon Jun 13 20:34:15 EDT 2022
% 0.13/0.36  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected SinE mode:
% 0.46/0.70  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.70  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.46/0.70  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.46/0.70  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.89/4.22  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.89/4.22  # No SInE strategy applied
% 10.89/4.22  # Trying AutoSched0 for 149 seconds
% 10.89/4.22  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 10.89/4.22  # and selection function SelectMaxLComplexAvoidPosPred.
% 10.89/4.22  #
% 10.89/4.22  # Preprocessing time       : 0.028 s
% 10.89/4.22  # Presaturation interreduction done
% 10.89/4.22  
% 10.89/4.22  # Proof found!
% 10.89/4.22  # SZS status Theorem
% 10.89/4.22  # SZS output start CNFRefutation
% See solution above
% 10.89/4.22  # Training examples: 0 positive, 0 negative
% 10.89/4.22  
% 10.89/4.22  # -------------------------------------------------
% 10.89/4.22  # User time                : 0.042 s
% 10.89/4.22  # System time              : 0.009 s
% 10.89/4.22  # Total time               : 0.051 s
% 10.89/4.22  # Maximum resident set size: 7124 pages
% 10.89/4.22  
%------------------------------------------------------------------------------