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

View Problem - Process Solution

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

% Computer : n006.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 : Mon Jul 18 08:35:38 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
    ( epsilon_transitive(X1)
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_5) ).

cnf(i_0_57,negated_conjecture,
    ordinal(esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_57) ).

cnf(i_0_13,plain,
    ( subset(X1,X2)
    | ~ epsilon_transitive(X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_13) ).

cnf(i_0_52,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_52) ).

cnf(i_0_53,plain,
    ( in(X1,X2)
    | ~ ordinal(X2)
    | ~ epsilon_transitive(X1)
    | ~ proper_subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_53) ).

cnf(i_0_14,plain,
    ( X1 = X2
    | proper_subset(X1,X2)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_14) ).

cnf(i_0_56,negated_conjecture,
    subset(esk14_0,esk15_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_56) ).

cnf(i_0_55,negated_conjecture,
    in(esk15_0,esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_55) ).

cnf(i_0_67,plain,
    ( ~ in(X1,X2)
    | ~ subset(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_67) ).

cnf(i_0_59,negated_conjecture,
    epsilon_transitive(esk14_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_59) ).

cnf(i_0_54,negated_conjecture,
    ~ in(esk14_0,esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-862fsxyw/input.p',i_0_54) ).

cnf(c_0_79,plain,
    ( epsilon_transitive(X1)
    | ~ ordinal(X1) ),
    i_0_5 ).

cnf(c_0_80,negated_conjecture,
    ordinal(esk16_0),
    i_0_57 ).

cnf(c_0_81,plain,
    ( subset(X1,X2)
    | ~ epsilon_transitive(X2)
    | ~ in(X1,X2) ),
    i_0_13 ).

cnf(c_0_82,negated_conjecture,
    epsilon_transitive(esk16_0),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_83,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    i_0_52 ).

cnf(c_0_84,plain,
    ( subset(X1,esk16_0)
    | ~ in(X1,esk16_0) ),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_85,plain,
    ( in(X1,X2)
    | ~ ordinal(X2)
    | ~ epsilon_transitive(X1)
    | ~ proper_subset(X1,X2) ),
    i_0_53 ).

cnf(c_0_86,plain,
    ( X1 = X2
    | proper_subset(X1,X2)
    | ~ subset(X1,X2) ),
    i_0_14 ).

cnf(c_0_87,plain,
    ( subset(X1,esk16_0)
    | ~ subset(X1,X2)
    | ~ in(X2,esk16_0) ),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_88,negated_conjecture,
    subset(esk14_0,esk15_0),
    i_0_56 ).

cnf(c_0_89,negated_conjecture,
    in(esk15_0,esk16_0),
    i_0_55 ).

cnf(c_0_90,plain,
    ( ~ in(X1,X2)
    | ~ subset(X2,X1) ),
    i_0_67 ).

cnf(c_0_91,plain,
    ( X1 = X2
    | in(X1,X2)
    | ~ subset(X1,X2)
    | ~ epsilon_transitive(X1)
    | ~ ordinal(X2) ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_92,negated_conjecture,
    subset(esk14_0,esk16_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).

cnf(c_0_93,negated_conjecture,
    epsilon_transitive(esk14_0),
    i_0_59 ).

cnf(c_0_94,negated_conjecture,
    ~ in(esk14_0,esk16_0),
    i_0_54 ).

cnf(c_0_95,negated_conjecture,
    ~ in(esk15_0,esk14_0),
    inference(spm,[status(thm)],[c_0_90,c_0_88]) ).

cnf(c_0_96,negated_conjecture,
    esk14_0 = esk16_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_80])]),c_0_94]) ).

cnf(c_0_97,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_89])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM390+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n006.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 : Wed Jul  6 07:08:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.44/2.16  # ENIGMATIC: Solved by autoschedule:
% 4.44/2.16  # No SInE strategy applied
% 4.44/2.16  # Trying AutoSched0 for 150 seconds
% 4.44/2.16  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 4.44/2.16  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.44/2.16  #
% 4.44/2.16  # Preprocessing time       : 0.023 s
% 4.44/2.16  
% 4.44/2.16  # Proof found!
% 4.44/2.16  # SZS status Theorem
% 4.44/2.16  # SZS output start CNFRefutation
% See solution above
% 4.44/2.16  # Training examples: 0 positive, 0 negative
% 4.44/2.16  
% 4.44/2.16  # -------------------------------------------------
% 4.44/2.16  # User time                : 0.034 s
% 4.44/2.16  # System time              : 0.002 s
% 4.44/2.16  # Total time               : 0.036 s
% 4.44/2.16  # Maximum resident set size: 7120 pages
% 4.44/2.16  
%------------------------------------------------------------------------------