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

View Problem - Process Solution

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

% Computer : n010.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:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( finite(X1)
    | ~ finite(X2)
    | ~ element(X1,powerset(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-22n0_6gh/lgb.p',i_0_16) ).

cnf(i_0_1322,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-22n0_6gh/lgb.p',i_0_1322) ).

cnf(i_0_1204,negated_conjecture,
    subset(esk231_0,esk232_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-22n0_6gh/lgb.p',i_0_1204) ).

cnf(i_0_1203,negated_conjecture,
    finite(esk232_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-22n0_6gh/lgb.p',i_0_1203) ).

cnf(i_0_1202,negated_conjecture,
    ~ finite(esk231_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-22n0_6gh/lgb.p',i_0_1202) ).

cnf(c_0_1328,plain,
    ( finite(X1)
    | ~ finite(X2)
    | ~ element(X1,powerset(X2)) ),
    i_0_16 ).

cnf(c_0_1329,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    i_0_1322 ).

cnf(c_0_1330,plain,
    ( finite(X1)
    | ~ finite(X2)
    | ~ subset(X1,X2) ),
    inference(spm,[status(thm)],[c_0_1328,c_0_1329]) ).

cnf(c_0_1331,negated_conjecture,
    subset(esk231_0,esk232_0),
    i_0_1204 ).

cnf(c_0_1332,negated_conjecture,
    finite(esk232_0),
    i_0_1203 ).

cnf(c_0_1333,negated_conjecture,
    ~ finite(esk231_0),
    i_0_1202 ).

cnf(c_0_1334,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1330,c_0_1331]),c_0_1332])]),c_0_1333]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU294+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n010.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 : Mon Jun 20 12:29:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.16/2.75  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.16/2.75  # No SInE strategy applied
% 9.16/2.75  # Trying AutoSched0 for 150 seconds
% 9.16/2.75  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 9.16/2.75  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.16/2.75  #
% 9.16/2.75  # Preprocessing time       : 0.027 s
% 9.16/2.75  
% 9.16/2.75  # Proof found!
% 9.16/2.75  # SZS status Theorem
% 9.16/2.75  # SZS output start CNFRefutation
% See solution above
% 9.16/2.75  # Training examples: 0 positive, 0 negative
% 9.16/2.75  
% 9.16/2.75  # -------------------------------------------------
% 9.16/2.75  # User time                : 0.038 s
% 9.16/2.75  # System time              : 0.010 s
% 9.16/2.75  # Total time               : 0.048 s
% 9.16/2.75  # Maximum resident set size: 7124 pages
% 9.16/2.75  
%------------------------------------------------------------------------------