TSTP Solution File: SEU128+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n026.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:38:39 EDT 2022

% Result   : Theorem 13.41s 3.20s
% Output   : CNFRefutation 13.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (   7 unt;   6 nHn;  17 RR)
%            Number of literals    :   45 (   2 equ;  19 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_17) ).

cnf(i_0_41,negated_conjecture,
    subset(esk7_0,esk9_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_41) ).

cnf(i_0_21,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_21) ).

cnf(i_0_16,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_16) ).

cnf(i_0_42,negated_conjecture,
    subset(esk7_0,esk8_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_42) ).

cnf(i_0_15,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_15) ).

cnf(i_0_40,negated_conjecture,
    ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ohgwqtu9/input.p',i_0_40) ).

cnf(c_0_50,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_17 ).

cnf(c_0_51,negated_conjecture,
    subset(esk7_0,esk9_0),
    i_0_41 ).

cnf(c_0_52,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    i_0_21 ).

cnf(c_0_53,negated_conjecture,
    ( in(X1,esk9_0)
    | ~ in(X1,esk7_0) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    i_0_16 ).

cnf(c_0_55,negated_conjecture,
    subset(esk7_0,esk8_0),
    i_0_42 ).

cnf(c_0_56,plain,
    ( in(X1,set_intersection2(X2,X3))
    | ~ in(X1,X3)
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_52]) ).

cnf(c_0_57,plain,
    ( in(esk3_2(esk7_0,X1),esk9_0)
    | subset(esk7_0,X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,negated_conjecture,
    ( in(X1,esk8_0)
    | ~ in(X1,esk7_0) ),
    inference(spm,[status(thm)],[c_0_50,c_0_55]) ).

cnf(c_0_59,plain,
    ( in(esk3_2(esk7_0,X1),set_intersection2(X2,esk9_0))
    | subset(esk7_0,X1)
    | ~ in(esk3_2(esk7_0,X1),X2) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,plain,
    ( in(esk3_2(esk7_0,X1),esk8_0)
    | subset(esk7_0,X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_54]) ).

cnf(c_0_61,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    i_0_15 ).

cnf(c_0_62,plain,
    ( in(esk3_2(esk7_0,X1),set_intersection2(esk8_0,esk9_0))
    | subset(esk7_0,X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)),
    i_0_40 ).

cnf(c_0_64,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU128+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 : Sun Jun 19 22:36:57 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 13.41/3.20  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 13.41/3.20  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 30; version: 991; iters: 150)
% 13.41/3.20  # Preprocessing time       : 0.841 s
% 13.41/3.20  # Presaturation interreduction done
% 13.41/3.20  
% 13.41/3.20  # Proof found!
% 13.41/3.20  # SZS status Theorem
% 13.41/3.20  # SZS output start CNFRefutation
% See solution above
% 13.41/3.20  # Training examples: 0 positive, 0 negative
% 13.41/3.20  
% 13.41/3.20  # -------------------------------------------------
% 13.41/3.20  # User time                : 0.737 s
% 13.41/3.20  # System time              : 0.130 s
% 13.41/3.20  # Total time               : 0.867 s
% 13.41/3.20  # ...preprocessing         : 0.841 s
% 13.41/3.20  # ...main loop             : 0.026 s
% 13.41/3.20  # Maximum resident set size: 167896 pages
% 13.41/3.20  
%------------------------------------------------------------------------------