TSTP Solution File: GRP642+4 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n021.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 12.99s 5.91s
% Output   : CNFRefutation 12.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   20 (  16 unt;   2 nHn;  20 RR)
%            Number of literals    :   34 (   4 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    9 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_312,plain,
    ( X1 != k1_xboole_0
    | ~ r2_hidden(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_312) ).

cnf(i_0_2673,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-9aib3w6z/lgb.p',i_0_2673) ).

cnf(i_0_2900,negated_conjecture,
    m1_group_2(esk453_0,esk452_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2900) ).

cnf(i_0_2899,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk452_0),esk453_0) = k1_xboole_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2899) ).

cnf(i_0_2903,negated_conjecture,
    v4_group_1(esk452_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2903) ).

cnf(i_0_2904,negated_conjecture,
    v3_group_1(esk452_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2904) ).

cnf(i_0_2901,negated_conjecture,
    v1_group_1(esk453_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2901) ).

cnf(i_0_2902,negated_conjecture,
    l1_group_1(esk452_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2902) ).

cnf(i_0_2905,negated_conjecture,
    ~ v3_struct_0(esk452_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9aib3w6z/lgb.p',i_0_2905) ).

cnf(c_0_2915,plain,
    ( X1 != k1_xboole_0
    | ~ r2_hidden(X2,X1) ),
    i_0_312 ).

cnf(c_0_2916,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_2673 ).

cnf(c_0_2917,negated_conjecture,
    m1_group_2(esk453_0,esk452_0),
    i_0_2900 ).

cnf(c_0_2918,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk452_0),esk453_0) = k1_xboole_0,
    i_0_2899 ).

cnf(c_0_2919,negated_conjecture,
    v4_group_1(esk452_0),
    i_0_2903 ).

cnf(c_0_2920,negated_conjecture,
    v3_group_1(esk452_0),
    i_0_2904 ).

cnf(c_0_2921,negated_conjecture,
    v1_group_1(esk453_0),
    i_0_2901 ).

cnf(c_0_2922,negated_conjecture,
    l1_group_1(esk452_0),
    i_0_2902 ).

cnf(c_0_2923,plain,
    ~ r2_hidden(X1,k1_xboole_0),
    inference(er,[status(thm)],[c_0_2915]) ).

cnf(c_0_2924,negated_conjecture,
    ~ v3_struct_0(esk452_0),
    i_0_2905 ).

cnf(c_0_2925,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_2916,c_0_2917]),c_0_2918]),c_0_2919]),c_0_2920]),c_0_2921]),c_0_2922])]),c_0_2923]),c_0_2924]),
    [proof] ).

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