↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n025.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 : Thu Jul 14 15:33:10 EDT 2022

% Result   : Theorem 12.83s 6.25s
% Output   : CNFRefutation 12.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   32 (  26 unt;   3 nHn;  32 RR)
%            Number of literals    :   48 (  17 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2762,plain,
    k2_tarski(np__0,np__0) = np__1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_2762) ).

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

cnf(i_0_5256,plain,
    ( k1_funct_4(k2_zfmisc_1(X1,k2_tarski(k1_xboole_0,k1_xboole_0)),k7_relat_1(X2,k1_closure3(X1,X2))) = X2
    | v1_xboole_0(X1)
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5256) ).

cnf(i_0_5515,negated_conjecture,
    k7_relat_1(esk719_0,k1_closure3(esk717_0,esk719_0)) = k7_relat_1(esk718_0,k1_closure3(esk717_0,esk718_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5515) ).

cnf(i_0_5516,negated_conjecture,
    k1_closure3(esk717_0,esk719_0) = k1_closure3(esk717_0,esk718_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5516) ).

cnf(i_0_5519,negated_conjecture,
    m1_pboole(esk718_0,esk717_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5519) ).

cnf(i_0_5520,negated_conjecture,
    v2_relat_1(esk718_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5520) ).

cnf(i_0_5521,negated_conjecture,
    ~ v1_xboole_0(esk717_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5521) ).

cnf(i_0_1648,plain,
    ( r6_pboole(X1,X2,X3)
    | X2 != X3
    | ~ m1_pboole(X3,X1)
    | ~ m1_pboole(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_1648) ).

cnf(i_0_5517,negated_conjecture,
    m1_pboole(esk719_0,esk717_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5517) ).

cnf(i_0_5518,negated_conjecture,
    v2_relat_1(esk719_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5518) ).

cnf(i_0_5514,negated_conjecture,
    ~ r6_pboole(esk717_0,esk718_0,esk719_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp4iu0f4/lgb.p',i_0_5514) ).

cnf(c_0_5534,plain,
    k2_tarski(np__0,np__0) = np__1,
    i_0_2762 ).

cnf(c_0_5535,plain,
    np__0 = k1_xboole_0,
    i_0_4778 ).

cnf(c_0_5536,plain,
    ( k1_funct_4(k2_zfmisc_1(X1,k2_tarski(k1_xboole_0,k1_xboole_0)),k7_relat_1(X2,k1_closure3(X1,X2))) = X2
    | v1_xboole_0(X1)
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    i_0_5256 ).

cnf(c_0_5537,plain,
    k2_tarski(k1_xboole_0,k1_xboole_0) = np__1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5534,c_0_5535]),c_0_5535]) ).

cnf(c_0_5538,negated_conjecture,
    k7_relat_1(esk719_0,k1_closure3(esk717_0,esk719_0)) = k7_relat_1(esk718_0,k1_closure3(esk717_0,esk718_0)),
    i_0_5515 ).

cnf(c_0_5539,negated_conjecture,
    k1_closure3(esk717_0,esk719_0) = k1_closure3(esk717_0,esk718_0),
    i_0_5516 ).

cnf(c_0_5540,plain,
    ( k1_funct_4(k2_zfmisc_1(X1,np__1),k7_relat_1(X2,k1_closure3(X1,X2))) = X2
    | v1_xboole_0(X1)
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    inference(rw,[status(thm)],[c_0_5536,c_0_5537]) ).

cnf(c_0_5541,negated_conjecture,
    m1_pboole(esk718_0,esk717_0),
    i_0_5519 ).

cnf(c_0_5542,negated_conjecture,
    k7_relat_1(esk718_0,k1_closure3(esk717_0,esk719_0)) = k7_relat_1(esk719_0,k1_closure3(esk717_0,esk719_0)),
    inference(rw,[status(thm)],[c_0_5538,c_0_5539]) ).

cnf(c_0_5543,negated_conjecture,
    v2_relat_1(esk718_0),
    i_0_5520 ).

cnf(c_0_5544,negated_conjecture,
    ~ v1_xboole_0(esk717_0),
    i_0_5521 ).

cnf(c_0_5545,plain,
    ( r6_pboole(X1,X2,X3)
    | X2 != X3
    | ~ m1_pboole(X3,X1)
    | ~ m1_pboole(X2,X1) ),
    i_0_1648 ).

cnf(c_0_5546,negated_conjecture,
    m1_pboole(esk719_0,esk717_0),
    i_0_5517 ).

cnf(c_0_5547,negated_conjecture,
    v2_relat_1(esk719_0),
    i_0_5518 ).

cnf(c_0_5548,negated_conjecture,
    k1_funct_4(k2_zfmisc_1(esk717_0,np__1),k7_relat_1(esk719_0,k1_closure3(esk717_0,esk719_0))) = esk718_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5540,c_0_5541]),c_0_5539]),c_0_5542]),c_0_5543])]),c_0_5544]) ).

cnf(c_0_5549,plain,
    ( r6_pboole(X1,X2,X2)
    | ~ m1_pboole(X2,X1) ),
    inference(er,[status(thm)],[c_0_5545]) ).

cnf(c_0_5550,negated_conjecture,
    ~ r6_pboole(esk717_0,esk718_0,esk719_0),
    i_0_5514 ).

cnf(c_0_5551,negated_conjecture,
    esk718_0 = esk719_0,
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5540,c_0_5546]),c_0_5547])]),c_0_5544]),c_0_5548]) ).

cnf(c_0_5552,negated_conjecture,
    r6_pboole(esk717_0,esk719_0,esk719_0),
    inference(spm,[status(thm)],[c_0_5549,c_0_5546]) ).

cnf(c_0_5553,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5550,c_0_5551]),c_0_5552])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ALG226+4 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Wed Jun  8 00:56:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 1.69/1.92  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.69/1.92  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 1.69/1.92  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 1.69/1.92  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 12.83/6.25  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.83/6.25  # No SInE strategy applied
% 12.83/6.25  # Trying AutoSched0 for 148 seconds
% 12.83/6.25  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 12.83/6.25  # and selection function SelectCQIPrecWNTNp.
% 12.83/6.25  #
% 12.83/6.25  # Preprocessing time       : 0.028 s
% 12.83/6.25  # Presaturation interreduction done
% 12.83/6.25  
% 12.83/6.25  # Proof found!
% 12.83/6.25  # SZS status Theorem
% 12.83/6.25  # SZS output start CNFRefutation
% See solution above
% 12.83/6.25  # Training examples: 0 positive, 0 negative
% 12.83/6.25  
% 12.83/6.25  # -------------------------------------------------
% 12.83/6.25  # User time                : 0.103 s
% 12.83/6.25  # System time              : 0.012 s
% 12.83/6.25  # Total time               : 0.115 s
% 12.83/6.25  # Maximum resident set size: 7124 pages
% 12.83/6.25  
%------------------------------------------------------------------------------