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

View Problem - Process Solution

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

% Computer : n003.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.50s 2.25s
% Output   : CNFRefutation 7.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   21 (  15 unt;   0 nHn;  13 RR)
%            Number of literals    :   37 (   0 equ;  18 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   :   14 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
    ( well_founded_relation(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_18) ).

cnf(i_0_20,negated_conjecture,
    ordinal(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_20) ).

cnf(i_0_16,plain,
    ( connected(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_16) ).

cnf(i_0_4,plain,
    ( well_ordering(X1)
    | ~ relation(X1)
    | ~ reflexive(X1)
    | ~ transitive(X1)
    | ~ antisymmetric(X1)
    | ~ connected(X1)
    | ~ well_founded_relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_4) ).

cnf(i_0_17,plain,
    antisymmetric(inclusion_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_17) ).

cnf(i_0_15,plain,
    transitive(inclusion_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_15) ).

cnf(i_0_14,plain,
    reflexive(inclusion_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_14) ).

cnf(i_0_10,plain,
    relation(inclusion_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_10) ).

cnf(i_0_19,negated_conjecture,
    ~ well_ordering(inclusion_relation(esk2_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ds32yhx8/input.p',i_0_19) ).

cnf(c_0_30,plain,
    ( well_founded_relation(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    i_0_18 ).

cnf(c_0_31,negated_conjecture,
    ordinal(esk2_0),
    i_0_20 ).

cnf(c_0_32,plain,
    ( connected(inclusion_relation(X1))
    | ~ ordinal(X1) ),
    i_0_16 ).

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

cnf(c_0_34,negated_conjecture,
    well_founded_relation(inclusion_relation(esk2_0)),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    connected(inclusion_relation(esk2_0)),
    inference(spm,[status(thm)],[c_0_32,c_0_31]) ).

cnf(c_0_36,plain,
    antisymmetric(inclusion_relation(X1)),
    i_0_17 ).

cnf(c_0_37,plain,
    transitive(inclusion_relation(X1)),
    i_0_15 ).

cnf(c_0_38,plain,
    reflexive(inclusion_relation(X1)),
    i_0_14 ).

cnf(c_0_39,plain,
    relation(inclusion_relation(X1)),
    i_0_10 ).

cnf(c_0_40,negated_conjecture,
    ~ well_ordering(inclusion_relation(esk2_0)),
    i_0_19 ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),c_0_37]),c_0_38]),c_0_39])]),c_0_40]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU275+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 19 03:10:15 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.50/2.25  # ENIGMATIC: Solved by autoschedule:
% 7.50/2.25  # No SInE strategy applied
% 7.50/2.25  # Trying AutoSched0 for 150 seconds
% 7.50/2.25  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S014A
% 7.50/2.25  # and selection function SelectOptimalLit.
% 7.50/2.25  #
% 7.50/2.25  # Preprocessing time       : 0.022 s
% 7.50/2.25  # Presaturation interreduction done
% 7.50/2.25  
% 7.50/2.25  # Proof found!
% 7.50/2.25  # SZS status Theorem
% 7.50/2.25  # SZS output start CNFRefutation
% See solution above
% 7.50/2.25  # Training examples: 0 positive, 0 negative
% 7.50/2.25  
% 7.50/2.25  # -------------------------------------------------
% 7.50/2.25  # User time                : 0.025 s
% 7.50/2.25  # System time              : 0.004 s
% 7.50/2.25  # Total time               : 0.029 s
% 7.50/2.25  # Maximum resident set size: 7120 pages
% 7.50/2.25  
%------------------------------------------------------------------------------