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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU275+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:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_201,plain,
    ( well_ordering(X1)
    | ~ relation(X1)
    | ~ antisymmetric(X1)
    | ~ connected(X1)
    | ~ transitive(X1)
    | ~ well_founded_relation(X1)
    | ~ reflexive(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_201) ).

cnf(i_0_724,lemma,
    ( well_founded_relation(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_724) ).

cnf(i_0_287,plain,
    relation(inclusion_relation(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_287) ).

cnf(i_0_609,lemma,
    reflexive(inclusion_relation(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_609) ).

cnf(i_0_649,lemma,
    transitive(inclusion_relation(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_649) ).

cnf(i_0_706,lemma,
    antisymmetric(inclusion_relation(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_706) ).

cnf(i_0_677,lemma,
    ( connected(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_677) ).

cnf(i_0_738,negated_conjecture,
    ~ well_ordering(inclusion_relation(esk145_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_738) ).

cnf(i_0_739,negated_conjecture,
    ordinal(esk145_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x7l1cswq/lgb.p',i_0_739) ).

cnf(c_0_749,plain,
    ( well_ordering(X1)
    | ~ relation(X1)
    | ~ antisymmetric(X1)
    | ~ connected(X1)
    | ~ transitive(X1)
    | ~ well_founded_relation(X1)
    | ~ reflexive(X1) ),
    i_0_201 ).

cnf(c_0_750,lemma,
    ( well_founded_relation(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    i_0_724 ).

cnf(c_0_751,plain,
    relation(inclusion_relation(X1)),
    i_0_287 ).

cnf(c_0_752,lemma,
    reflexive(inclusion_relation(X1)),
    i_0_609 ).

cnf(c_0_753,lemma,
    transitive(inclusion_relation(X1)),
    i_0_649 ).

cnf(c_0_754,lemma,
    antisymmetric(inclusion_relation(X1)),
    i_0_706 ).

cnf(c_0_755,lemma,
    ( connected(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    i_0_677 ).

cnf(c_0_756,negated_conjecture,
    ~ well_ordering(inclusion_relation(esk145_0)),
    i_0_738 ).

cnf(c_0_757,plain,
    ( well_ordering(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_749,c_0_750]),c_0_751]),c_0_752]),c_0_753]),c_0_754])]),c_0_755]) ).

cnf(c_0_758,negated_conjecture,
    ordinal(esk145_0),
    i_0_739 ).

cnf(c_0_759,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_756,c_0_757]),c_0_758])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU275+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 : n029.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 03:07:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.56/2.49  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.56/2.49  # No SInE strategy applied
% 7.56/2.49  # Trying AutoSched0 for 150 seconds
% 7.56/2.49  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.56/2.49  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.56/2.49  #
% 7.56/2.49  # Preprocessing time       : 0.026 s
% 7.56/2.49  
% 7.56/2.49  # Proof found!
% 7.56/2.49  # SZS status Theorem
% 7.56/2.49  # SZS output start CNFRefutation
% See solution above
% 7.56/2.49  # Training examples: 0 positive, 0 negative
% 7.56/2.49  
% 7.56/2.49  # -------------------------------------------------
% 7.56/2.49  # User time                : 0.037 s
% 7.56/2.49  # System time              : 0.009 s
% 7.56/2.49  # Total time               : 0.045 s
% 7.56/2.49  # Maximum resident set size: 7120 pages
% 7.56/2.49  
%------------------------------------------------------------------------------