TSTP Solution File: ALG226+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : ALG226+3 : 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 : Thu Jul 14 15:33:10 EDT 2022

% Result   : Theorem 20.25s 5.94s
% Output   : CNFRefutation 20.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  23 unt;   3 nHn;  27 RR)
%            Number of literals    :   45 (  14 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5013,plain,
    ( k1_funct_4(k2_zfmisc_1(X1,k2_relat_1(k10_finseq_1(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/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5013) ).

cnf(i_0_1962,plain,
    k2_relat_1(k10_finseq_1(X1,X1)) = k3_classes1(X1,k1_xboole_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_1962) ).

cnf(i_0_5211,negated_conjecture,
    k7_relat_1(esk732_0,k1_closure3(esk730_0,esk732_0)) = k7_relat_1(esk731_0,k1_closure3(esk730_0,esk731_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5211) ).

cnf(i_0_5212,negated_conjecture,
    k1_closure3(esk730_0,esk732_0) = k1_closure3(esk730_0,esk731_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5212) ).

cnf(i_0_5215,negated_conjecture,
    m1_pboole(esk731_0,esk730_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5215) ).

cnf(i_0_5216,negated_conjecture,
    v2_relat_1(esk731_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5216) ).

cnf(i_0_5217,negated_conjecture,
    ~ v1_xboole_0(esk730_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5217) ).

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

cnf(i_0_5213,negated_conjecture,
    m1_pboole(esk732_0,esk730_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5213) ).

cnf(i_0_5214,negated_conjecture,
    v2_relat_1(esk732_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5214) ).

cnf(i_0_5210,negated_conjecture,
    ~ r6_pboole(esk730_0,esk731_0,esk732_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j49udq28/lgb.p',i_0_5210) ).

cnf(c_0_5229,plain,
    ( k1_funct_4(k2_zfmisc_1(X1,k2_relat_1(k10_finseq_1(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_5013 ).

cnf(c_0_5230,plain,
    k2_relat_1(k10_finseq_1(X1,X1)) = k3_classes1(X1,k1_xboole_0),
    i_0_1962 ).

cnf(c_0_5231,negated_conjecture,
    k7_relat_1(esk732_0,k1_closure3(esk730_0,esk732_0)) = k7_relat_1(esk731_0,k1_closure3(esk730_0,esk731_0)),
    i_0_5211 ).

cnf(c_0_5232,negated_conjecture,
    k1_closure3(esk730_0,esk732_0) = k1_closure3(esk730_0,esk731_0),
    i_0_5212 ).

cnf(c_0_5233,plain,
    ( k1_funct_4(k2_zfmisc_1(X1,k3_classes1(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) ),
    inference(rw,[status(thm)],[c_0_5229,c_0_5230]) ).

cnf(c_0_5234,negated_conjecture,
    m1_pboole(esk731_0,esk730_0),
    i_0_5215 ).

cnf(c_0_5235,negated_conjecture,
    k7_relat_1(esk731_0,k1_closure3(esk730_0,esk732_0)) = k7_relat_1(esk732_0,k1_closure3(esk730_0,esk732_0)),
    inference(rw,[status(thm)],[c_0_5231,c_0_5232]) ).

cnf(c_0_5236,negated_conjecture,
    v2_relat_1(esk731_0),
    i_0_5216 ).

cnf(c_0_5237,negated_conjecture,
    ~ v1_xboole_0(esk730_0),
    i_0_5217 ).

cnf(c_0_5238,plain,
    ( r6_pboole(X1,X2,X3)
    | X2 != X3
    | ~ m1_pboole(X3,X1)
    | ~ m1_pboole(X2,X1) ),
    i_0_1892 ).

cnf(c_0_5239,negated_conjecture,
    m1_pboole(esk732_0,esk730_0),
    i_0_5213 ).

cnf(c_0_5240,negated_conjecture,
    v2_relat_1(esk732_0),
    i_0_5214 ).

cnf(c_0_5241,negated_conjecture,
    k1_funct_4(k2_zfmisc_1(esk730_0,k3_classes1(k1_xboole_0,k1_xboole_0)),k7_relat_1(esk732_0,k1_closure3(esk730_0,esk732_0))) = esk731_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_5233,c_0_5234]),c_0_5232]),c_0_5235]),c_0_5236])]),c_0_5237]) ).

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

cnf(c_0_5243,negated_conjecture,
    ~ r6_pboole(esk730_0,esk731_0,esk732_0),
    i_0_5210 ).

cnf(c_0_5244,negated_conjecture,
    esk731_0 = esk732_0,
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5233,c_0_5239]),c_0_5240])]),c_0_5237]),c_0_5241]) ).

cnf(c_0_5245,negated_conjecture,
    r6_pboole(esk730_0,esk732_0,esk732_0),
    inference(spm,[status(thm)],[c_0_5242,c_0_5239]) ).

cnf(c_0_5246,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5243,c_0_5244]),c_0_5245])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : ALG226+3 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Wed Jun  8 03:19:25 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.76/0.94  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.76/0.94  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.76/0.94  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.76/0.94  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 20.25/5.94  # ENIGMATIC: Solved by autoschedule-lgb:
% 20.25/5.94  # No SInE strategy applied
% 20.25/5.94  # Trying AutoSched0 for 149 seconds
% 20.25/5.94  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 20.25/5.94  # and selection function SelectCQIPrecWNTNp.
% 20.25/5.94  #
% 20.25/5.94  # Preprocessing time       : 0.028 s
% 20.25/5.94  # Presaturation interreduction done
% 20.25/5.94  
% 20.25/5.94  # Proof found!
% 20.25/5.94  # SZS status Theorem
% 20.25/5.94  # SZS output start CNFRefutation
% See solution above
% 20.25/5.94  # Training examples: 0 positive, 0 negative
% 20.25/5.94  
% 20.25/5.94  # -------------------------------------------------
% 20.25/5.94  # User time                : 1.224 s
% 20.25/5.94  # System time              : 0.039 s
% 20.25/5.94  # Total time               : 1.262 s
% 20.25/5.94  # Maximum resident set size: 7128 pages
% 20.25/5.94  
%------------------------------------------------------------------------------