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

View Problem - Process Solution

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

% Computer : n006.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 : Tue Jul 19 08:42:46 EDT 2022

% Result   : Theorem 16.65s 6.47s
% Output   : CNFRefutation 16.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   27 (  10 unt;   0 nHn;  25 RR)
%            Number of literals    :   49 (  13 equ;  27 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-5 aty)
%            Number of variables   :   51 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2360,plain,
    ( k9_relset_2(X1,X2,X3,X4,X5) = k5_relat_1(X4,X5)
    | ~ m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_2360) ).

cnf(i_0_4461,plain,
    ( m1_subset_1(X1,k1_zfmisc_1(X2))
    | ~ r1_tarski(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_4461) ).

cnf(i_0_4278,plain,
    ( k5_relat_1(X1,k2_group_1(k20_monoid_0(X2))) = X1
    | ~ m2_relset_1(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_4278) ).

cnf(i_0_5505,negated_conjecture,
    m2_relset_1(esk673_0,esk671_0,esk672_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_5505) ).

cnf(i_0_5504,negated_conjecture,
    k9_relset_2(esk671_0,esk672_0,esk672_0,esk673_0,k2_group_1(k20_monoid_0(esk672_0))) != k9_relset_2(esk671_0,esk671_0,esk672_0,k2_group_1(k20_monoid_0(esk671_0)),esk673_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_5504) ).

cnf(i_0_1045,plain,
    ( m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m2_relset_1(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_1045) ).

cnf(i_0_4253,plain,
    ( k5_relat_1(k2_group_1(k20_monoid_0(X1)),X2) = X2
    | ~ m2_relset_1(X2,X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_4253) ).

cnf(i_0_5596,plain,
    m2_relset_1(k2_group_1(k20_monoid_0(X1)),X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_5596) ).

cnf(i_0_4462,plain,
    ( r1_tarski(X1,X2)
    | ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gfkbsdux/lgb.p',i_0_4462) ).

cnf(c_0_5606,plain,
    ( k9_relset_2(X1,X2,X3,X4,X5) = k5_relat_1(X4,X5)
    | ~ m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
    i_0_2360 ).

cnf(c_0_5607,plain,
    ( m1_subset_1(X1,k1_zfmisc_1(X2))
    | ~ r1_tarski(X1,X2) ),
    i_0_4461 ).

cnf(c_0_5608,plain,
    ( k5_relat_1(X1,k2_group_1(k20_monoid_0(X2))) = X1
    | ~ m2_relset_1(X1,X3,X2) ),
    i_0_4278 ).

cnf(c_0_5609,negated_conjecture,
    m2_relset_1(esk673_0,esk671_0,esk672_0),
    i_0_5505 ).

cnf(c_0_5610,negated_conjecture,
    k9_relset_2(esk671_0,esk672_0,esk672_0,esk673_0,k2_group_1(k20_monoid_0(esk672_0))) != k9_relset_2(esk671_0,esk671_0,esk672_0,k2_group_1(k20_monoid_0(esk671_0)),esk673_0),
    i_0_5504 ).

cnf(c_0_5611,plain,
    ( k9_relset_2(X1,X2,X3,X4,X5) = k5_relat_1(X4,X5)
    | ~ r1_tarski(X5,k2_zfmisc_1(X2,X3))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
    inference(spm,[status(thm)],[c_0_5606,c_0_5607]) ).

cnf(c_0_5612,negated_conjecture,
    k5_relat_1(esk673_0,k2_group_1(k20_monoid_0(esk672_0))) = esk673_0,
    inference(spm,[status(thm)],[c_0_5608,c_0_5609]) ).

cnf(c_0_5613,plain,
    ( m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m2_relset_1(X1,X2,X3) ),
    i_0_1045 ).

cnf(c_0_5614,plain,
    ( k5_relat_1(k2_group_1(k20_monoid_0(X1)),X2) = X2
    | ~ m2_relset_1(X2,X1,X3) ),
    i_0_4253 ).

cnf(c_0_5615,negated_conjecture,
    ( k9_relset_2(esk671_0,esk671_0,esk672_0,k2_group_1(k20_monoid_0(esk671_0)),esk673_0) != esk673_0
    | ~ r1_tarski(k2_group_1(k20_monoid_0(esk672_0)),k2_zfmisc_1(esk672_0,esk672_0))
    | ~ m1_subset_1(esk673_0,k1_zfmisc_1(k2_zfmisc_1(esk671_0,esk672_0))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5610,c_0_5611]),c_0_5612]) ).

cnf(c_0_5616,plain,
    ( k9_relset_2(X1,X2,X3,X4,X5) = k5_relat_1(X4,X5)
    | ~ m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m2_relset_1(X4,X1,X2) ),
    inference(spm,[status(thm)],[c_0_5606,c_0_5613]) ).

cnf(c_0_5617,negated_conjecture,
    k5_relat_1(k2_group_1(k20_monoid_0(esk671_0)),esk673_0) = esk673_0,
    inference(spm,[status(thm)],[c_0_5614,c_0_5609]) ).

cnf(c_0_5618,plain,
    m2_relset_1(k2_group_1(k20_monoid_0(X1)),X1,X1),
    i_0_5596 ).

cnf(c_0_5619,plain,
    ( r1_tarski(X1,X2)
    | ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
    i_0_4462 ).

cnf(c_0_5620,plain,
    ( ~ r1_tarski(k2_group_1(k20_monoid_0(esk672_0)),k2_zfmisc_1(esk672_0,esk672_0))
    | ~ m1_subset_1(esk673_0,k1_zfmisc_1(k2_zfmisc_1(esk671_0,esk672_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5615,c_0_5616]),c_0_5617]),c_0_5618])]) ).

cnf(c_0_5621,plain,
    ( r1_tarski(X1,k2_zfmisc_1(X2,X3))
    | ~ m2_relset_1(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_5619,c_0_5613]) ).

cnf(c_0_5622,plain,
    ~ m1_subset_1(esk673_0,k1_zfmisc_1(k2_zfmisc_1(esk671_0,esk672_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5620,c_0_5621]),c_0_5618])]) ).

cnf(c_0_5623,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5622,c_0_5613]),c_0_5609])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : SEU451+3 : TPTP v8.1.0. Released v3.4.0.
% 0.05/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.29  % Computer : n006.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sun Jun 19 19:40:14 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.13/0.37  # ENIGMATIC: Selected SinE mode:
% 0.78/0.97  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.97  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.78/0.97  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.78/0.97  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 16.65/6.47  # ENIGMATIC: Solved by autoschedule-lgb:
% 16.65/6.47  # No SInE strategy applied
% 16.65/6.47  # Trying AutoSched0 for 148 seconds
% 16.65/6.47  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S069N
% 16.65/6.47  # and selection function SelectComplexAHPExceptRRHorn.
% 16.65/6.47  #
% 16.65/6.47  # Preprocessing time       : 0.022 s
% 16.65/6.47  # Presaturation interreduction done
% 16.65/6.47  
% 16.65/6.47  # Proof found!
% 16.65/6.47  # SZS status Theorem
% 16.65/6.47  # SZS output start CNFRefutation
% See solution above
% 16.65/6.47  # Training examples: 0 positive, 0 negative
% 16.65/6.47  
% 16.65/6.47  # -------------------------------------------------
% 16.65/6.47  # User time                : 0.182 s
% 16.65/6.47  # System time              : 0.012 s
% 16.65/6.47  # Total time               : 0.194 s
% 16.65/6.47  # Maximum resident set size: 7124 pages
% 16.65/6.47  
%------------------------------------------------------------------------------