TSTP Solution File: SEU435+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n022.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ~ m1_subset_1(a_6_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),k1_zfmisc_1(k1_zfmisc_1(esk5_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t7vimkhp/lgb.p',i_0_1) ).

cnf(i_0_61,plain,
    ( m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))
    | ~ m1_subset_1(X6,k1_zfmisc_1(X4))
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2)))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t7vimkhp/lgb.p',i_0_61) ).

cnf(i_0_3,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t7vimkhp/lgb.p',i_0_3) ).

cnf(i_0_2,negated_conjecture,
    m1_subset_1(esk6_0,k1_zfmisc_1(esk4_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t7vimkhp/lgb.p',i_0_2) ).

cnf(c_0_66,negated_conjecture,
    ~ m1_subset_1(a_6_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),k1_zfmisc_1(k1_zfmisc_1(esk5_0))),
    i_0_1 ).

cnf(c_0_67,plain,
    ( m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))
    | ~ m1_subset_1(X6,k1_zfmisc_1(X4))
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2)))) ),
    i_0_61 ).

cnf(c_0_68,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))),
    i_0_3 ).

cnf(c_0_69,negated_conjecture,
    m1_subset_1(esk6_0,k1_zfmisc_1(esk4_0)),
    i_0_2 ).

cnf(c_0_70,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU435+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n022.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun Jun 19 21:47:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 6.94/2.19  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.94/2.19  # No SInE strategy applied
% 6.94/2.19  # Trying AutoSched0 for 150 seconds
% 6.94/2.19  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.94/2.19  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.94/2.19  #
% 6.94/2.19  # Preprocessing time       : 0.023 s
% 6.94/2.19  # Presaturation interreduction done
% 6.94/2.19  
% 6.94/2.19  # Proof found!
% 6.94/2.19  # SZS status Theorem
% 6.94/2.19  # SZS output start CNFRefutation
% See solution above
% 6.94/2.19  # Training examples: 0 positive, 0 negative
% 6.94/2.19  
% 6.94/2.19  # -------------------------------------------------
% 6.94/2.19  # User time                : 0.023 s
% 6.94/2.19  # System time              : 0.005 s
% 6.94/2.19  # Total time               : 0.028 s
% 6.94/2.19  # Maximum resident set size: 7128 pages
% 6.94/2.19  
%------------------------------------------------------------------------------