↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n020.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.82s 4.59s
% Output   : CNFRefutation 10.82s
% 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_485,plain,
    ( X1 != k1_xboole_0
    | ~ r2_hidden(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_485) ).

cnf(i_0_2749,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/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2749) ).

cnf(i_0_2874,negated_conjecture,
    m1_group_2(esk469_0,esk468_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2874) ).

cnf(i_0_2873,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk468_0),esk469_0) = k1_xboole_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2873) ).

cnf(i_0_2877,negated_conjecture,
    v4_group_1(esk468_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2877) ).

cnf(i_0_2878,negated_conjecture,
    v3_group_1(esk468_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2878) ).

cnf(i_0_2875,negated_conjecture,
    v1_group_1(esk469_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2875) ).

cnf(i_0_2876,negated_conjecture,
    l1_group_1(esk468_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2876) ).

cnf(i_0_2879,negated_conjecture,
    ~ v3_struct_0(esk468_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u5y_yww/lgb.p',i_0_2879) ).

cnf(c_0_2889,plain,
    ( X1 != k1_xboole_0
    | ~ r2_hidden(X2,X1) ),
    i_0_485 ).

cnf(c_0_2890,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_2749 ).

cnf(c_0_2891,negated_conjecture,
    m1_group_2(esk469_0,esk468_0),
    i_0_2874 ).

cnf(c_0_2892,negated_conjecture,
    k1_funct_1(k1_latsubgr(esk468_0),esk469_0) = k1_xboole_0,
    i_0_2873 ).

cnf(c_0_2893,negated_conjecture,
    v4_group_1(esk468_0),
    i_0_2877 ).

cnf(c_0_2894,negated_conjecture,
    v3_group_1(esk468_0),
    i_0_2878 ).

cnf(c_0_2895,negated_conjecture,
    v1_group_1(esk469_0),
    i_0_2875 ).

cnf(c_0_2896,negated_conjecture,
    l1_group_1(esk468_0),
    i_0_2876 ).

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

cnf(c_0_2898,negated_conjecture,
    ~ v3_struct_0(esk468_0),
    i_0_2879 ).

cnf(c_0_2899,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_2890,c_0_2891]),c_0_2892]),c_0_2893]),c_0_2894]),c_0_2895]),c_0_2896])]),c_0_2897]),c_0_2898]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : GRP642+3 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 : Mon Jun 13 11:06:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.72/0.90  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.72/0.90  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.72/0.90  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.72/0.90  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.82/4.59  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.82/4.59  # No SInE strategy applied
% 10.82/4.59  # Trying AutoSched0 for 149 seconds
% 10.82/4.59  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.82/4.59  # and selection function SelectComplexExceptUniqMaxHorn.
% 10.82/4.59  #
% 10.82/4.59  # Preprocessing time       : 0.029 s
% 10.82/4.59  # Presaturation interreduction done
% 10.82/4.59  
% 10.82/4.59  # Proof found!
% 10.82/4.59  # SZS status Theorem
% 10.82/4.59  # SZS output start CNFRefutation
% See solution above
% 10.82/4.59  # Training examples: 0 positive, 0 negative
% 10.82/4.59  
% 10.82/4.59  # -------------------------------------------------
% 10.82/4.59  # User time                : 0.072 s
% 10.82/4.59  # System time              : 0.007 s
% 10.82/4.59  # Total time               : 0.079 s
% 10.82/4.59  # Maximum resident set size: 7128 pages
% 10.82/4.59  
%------------------------------------------------------------------------------