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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n013.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 00:09:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_90,plain,
    ( X1 = X2
    | X1 = X3
    | ~ member(X1,unordered_pair(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9qefuzl/lgb.p',i_0_90) ).

cnf(i_0_62,plain,
    ( X1 = null_class
    | member(esk7_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9qefuzl/lgb.p',i_0_62) ).

cnf(i_0_63,plain,
    ( X1 = null_class
    | member(esk7_1(X1),universal_class) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9qefuzl/lgb.p',i_0_63) ).

cnf(i_0_59,negated_conjecture,
    unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,unordered_pair(esk6_0,esk6_0))) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,null_class)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9qefuzl/lgb.p',i_0_59) ).

cnf(i_0_58,negated_conjecture,
    ~ member(esk6_0,universal_class),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9qefuzl/lgb.p',i_0_58) ).

cnf(c_0_96,plain,
    ( X1 = X2
    | X1 = X3
    | ~ member(X1,unordered_pair(X3,X2)) ),
    i_0_90 ).

cnf(c_0_97,plain,
    ( X1 = X2
    | ~ member(X1,unordered_pair(X2,X2)) ),
    inference(ef,[status(thm)],[c_0_96]) ).

cnf(c_0_98,plain,
    ( X1 = null_class
    | member(esk7_1(X1),X1) ),
    i_0_62 ).

cnf(c_0_99,plain,
    ( X1 = null_class
    | member(esk7_1(X1),universal_class) ),
    i_0_63 ).

cnf(c_0_100,plain,
    ( esk7_1(unordered_pair(X1,X1)) = X1
    | unordered_pair(X1,X1) = null_class ),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_101,negated_conjecture,
    unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,unordered_pair(esk6_0,esk6_0))) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,null_class)),
    i_0_59 ).

cnf(c_0_102,plain,
    ( unordered_pair(X1,X1) = null_class
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_103,negated_conjecture,
    ~ member(esk6_0,universal_class),
    i_0_58 ).

cnf(c_0_104,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 16:56:16 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.35/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.32  # No SInE strategy applied
% 7.35/2.32  # Trying AutoSched0 for 150 seconds
% 7.35/2.32  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00EN
% 7.35/2.32  # and selection function PSelectSmallestOrientable.
% 7.35/2.32  #
% 7.35/2.32  # Preprocessing time       : 0.023 s
% 7.35/2.32  # Presaturation interreduction done
% 7.35/2.32  
% 7.35/2.32  # Proof found!
% 7.35/2.32  # SZS status Theorem
% 7.35/2.32  # SZS output start CNFRefutation
% See solution above
% 7.35/2.32  # Training examples: 0 positive, 0 negative
% 7.35/2.32  
% 7.35/2.32  # -------------------------------------------------
% 7.35/2.32  # User time                : 0.029 s
% 7.35/2.32  # System time              : 0.006 s
% 7.35/2.32  # Total time               : 0.036 s
% 7.35/2.32  # Maximum resident set size: 7124 pages
% 7.35/2.32  
%------------------------------------------------------------------------------