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

View Problem - Process Solution

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

% Computer : n029.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:40:44 EDT 2022

% Result   : Theorem 280.60s 37.33s
% Output   : CNFRefutation 280.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (   8 unt;  11 nHn;  22 RR)
%            Number of literals    :   72 (   0 equ;  30 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   41 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1815,plain,
    ( subset(X1,X2)
    | ~ element(X1,powerset(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_1815) ).

cnf(i_0_1856,negated_conjecture,
    element(esk331_0,powerset(the_carrier(esk330_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_1856) ).

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

cnf(i_0_1836,lemma,
    ( in(X1,topstr_closure(X2,X3))
    | subset(X3,esk328_3(X2,X3,X1))
    | ~ top_str(X2)
    | ~ in(X1,the_carrier(X2))
    | ~ element(X3,powerset(the_carrier(X2))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_1836) ).

cnf(i_0_1857,negated_conjecture,
    top_str(esk330_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_1857) ).

cnf(i_0_272,plain,
    ( subset(X1,X2)
    | in(esk60_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_272) ).

cnf(i_0_1835,lemma,
    ( in(X1,topstr_closure(X2,X3))
    | ~ top_str(X2)
    | ~ in(X1,the_carrier(X2))
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X1,esk328_3(X2,X3,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_1835) ).

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

cnf(i_0_1855,negated_conjecture,
    ~ subset(esk331_0,topstr_closure(esk330_0,esk331_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k08j1jn8/input.p',i_0_1855) ).

cnf(c_0_1867,plain,
    ( subset(X1,X2)
    | ~ element(X1,powerset(X2)) ),
    i_0_1815 ).

cnf(c_0_1868,negated_conjecture,
    element(esk331_0,powerset(the_carrier(esk330_0))),
    i_0_1856 ).

cnf(c_0_1869,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_273 ).

cnf(c_0_1870,negated_conjecture,
    subset(esk331_0,the_carrier(esk330_0)),
    inference(spm,[status(thm)],[c_0_1867,c_0_1868]) ).

cnf(c_0_1871,lemma,
    ( in(X1,topstr_closure(X2,X3))
    | subset(X3,esk328_3(X2,X3,X1))
    | ~ top_str(X2)
    | ~ in(X1,the_carrier(X2))
    | ~ element(X3,powerset(the_carrier(X2))) ),
    i_0_1836 ).

cnf(c_0_1872,negated_conjecture,
    top_str(esk330_0),
    i_0_1857 ).

cnf(c_0_1873,plain,
    ( in(X1,the_carrier(esk330_0))
    | ~ in(X1,esk331_0) ),
    inference(spm,[status(thm)],[c_0_1869,c_0_1870]) ).

cnf(c_0_1874,plain,
    ( subset(X1,X2)
    | in(esk60_2(X1,X2),X1) ),
    i_0_272 ).

cnf(c_0_1875,negated_conjecture,
    ( in(X1,topstr_closure(esk330_0,esk331_0))
    | subset(esk331_0,esk328_3(esk330_0,esk331_0,X1))
    | ~ in(X1,the_carrier(esk330_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1871,c_0_1868]),c_0_1872])]) ).

cnf(c_0_1876,plain,
    ( in(esk60_2(esk331_0,X1),the_carrier(esk330_0))
    | subset(esk331_0,X1) ),
    inference(spm,[status(thm)],[c_0_1873,c_0_1874]) ).

cnf(c_0_1877,lemma,
    ( in(X1,topstr_closure(X2,X3))
    | ~ top_str(X2)
    | ~ in(X1,the_carrier(X2))
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X1,esk328_3(X2,X3,X1)) ),
    i_0_1835 ).

cnf(c_0_1878,negated_conjecture,
    ( in(esk60_2(esk331_0,X1),topstr_closure(esk330_0,esk331_0))
    | subset(esk331_0,esk328_3(esk330_0,esk331_0,esk60_2(esk331_0,X1)))
    | subset(esk331_0,X1) ),
    inference(spm,[status(thm)],[c_0_1875,c_0_1876]) ).

cnf(c_0_1879,negated_conjecture,
    ( in(X1,topstr_closure(esk330_0,esk331_0))
    | ~ in(X1,esk328_3(esk330_0,esk331_0,X1))
    | ~ in(X1,the_carrier(esk330_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1877,c_0_1868]),c_0_1872])]) ).

cnf(c_0_1880,plain,
    ( in(X1,esk328_3(esk330_0,esk331_0,esk60_2(esk331_0,X2)))
    | in(esk60_2(esk331_0,X2),topstr_closure(esk330_0,esk331_0))
    | subset(esk331_0,X2)
    | ~ in(X1,esk331_0) ),
    inference(spm,[status(thm)],[c_0_1869,c_0_1878]) ).

cnf(c_0_1881,negated_conjecture,
    ( in(esk60_2(esk331_0,X1),topstr_closure(esk330_0,esk331_0))
    | subset(esk331_0,X1)
    | ~ in(esk60_2(esk331_0,X1),esk328_3(esk330_0,esk331_0,esk60_2(esk331_0,X1))) ),
    inference(spm,[status(thm)],[c_0_1879,c_0_1876]) ).

cnf(c_0_1882,plain,
    ( in(esk60_2(esk331_0,X1),esk328_3(esk330_0,esk331_0,esk60_2(esk331_0,X2)))
    | in(esk60_2(esk331_0,X2),topstr_closure(esk330_0,esk331_0))
    | subset(esk331_0,X2)
    | subset(esk331_0,X1) ),
    inference(spm,[status(thm)],[c_0_1880,c_0_1874]) ).

cnf(c_0_1883,plain,
    ( subset(X1,X2)
    | ~ in(esk60_2(X1,X2),X2) ),
    i_0_271 ).

cnf(c_0_1884,negated_conjecture,
    ( in(esk60_2(esk331_0,X1),topstr_closure(esk330_0,esk331_0))
    | subset(esk331_0,X1) ),
    inference(spm,[status(thm)],[c_0_1881,c_0_1882]) ).

cnf(c_0_1885,negated_conjecture,
    ~ subset(esk331_0,topstr_closure(esk330_0,esk331_0)),
    i_0_1855 ).

cnf(c_0_1886,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1883,c_0_1884]),c_0_1885]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU317+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.33  % Computer : n029.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Sat Jun 18 20:42:31 EDT 2022
% 0.14/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.48  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.48  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.48  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 280.60/37.33  # ENIGMATIC: Solved by Enigma+tptp-cade20-model01-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 280.60/37.33  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model01-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 41; version: 991; iters: 150)
% 280.60/37.33  # Preprocessing time       : 1.042 s
% 280.60/37.33  # Presaturation interreduction done
% 280.60/37.33  
% 280.60/37.33  # Proof found!
% 280.60/37.33  # SZS status Theorem
% 280.60/37.33  # SZS output start CNFRefutation
% See solution above
% 280.60/37.33  # Training examples: 0 positive, 0 negative
% 280.60/37.33  
% 280.60/37.33  # -------------------------------------------------
% 280.60/37.33  # User time                : 3.004 s
% 280.60/37.33  # System time              : 0.089 s
% 280.60/37.33  # Total time               : 3.094 s
% 280.60/37.33  # ...preprocessing         : 1.042 s
% 280.60/37.33  # ...main loop             : 2.051 s
% 280.60/37.33  # Maximum resident set size: 107160 pages
% 280.60/37.33  
%------------------------------------------------------------------------------