TSTP Solution File: SET642+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n018.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:13:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( subset(X1,cross_product(X2,X3))
    | ~ subset(X1,X4)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X4,relation_type(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nsuyp1wq/lgb.p',i_0_1) ).

cnf(i_0_36,plain,
    ilf_type(X1,set_type),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nsuyp1wq/lgb.p',i_0_36) ).

cnf(i_0_2,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ subset(X1,cross_product(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nsuyp1wq/lgb.p',i_0_2) ).

cnf(i_0_38,negated_conjecture,
    subset(esk10_0,esk13_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nsuyp1wq/lgb.p',i_0_38) ).

cnf(i_0_39,negated_conjecture,
    ilf_type(esk13_0,relation_type(esk11_0,esk12_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nsuyp1wq/lgb.p',i_0_39) ).

cnf(i_0_37,negated_conjecture,
    ~ ilf_type(esk10_0,relation_type(esk11_0,esk12_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nsuyp1wq/lgb.p',i_0_37) ).

cnf(c_0_46,plain,
    ( subset(X1,cross_product(X2,X3))
    | ~ subset(X1,X4)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X4,relation_type(X2,X3)) ),
    i_0_1 ).

cnf(c_0_47,plain,
    ilf_type(X1,set_type),
    i_0_36 ).

cnf(c_0_48,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ subset(X1,cross_product(X2,X3)) ),
    i_0_2 ).

cnf(c_0_49,plain,
    ( subset(X1,cross_product(X2,X3))
    | ~ subset(X1,X4)
    | ~ ilf_type(X4,relation_type(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_47]),c_0_47])]) ).

cnf(c_0_50,negated_conjecture,
    subset(esk10_0,esk13_0),
    i_0_38 ).

cnf(c_0_51,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ subset(X1,cross_product(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47]),c_0_47]),c_0_47])]) ).

cnf(c_0_52,negated_conjecture,
    ( subset(esk10_0,cross_product(X1,X2))
    | ~ ilf_type(esk13_0,relation_type(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_53,plain,
    ( ilf_type(esk10_0,relation_type(X1,X2))
    | ~ ilf_type(esk13_0,relation_type(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_54,negated_conjecture,
    ilf_type(esk13_0,relation_type(esk11_0,esk12_0)),
    i_0_39 ).

cnf(c_0_55,negated_conjecture,
    ~ ilf_type(esk10_0,relation_type(esk11_0,esk12_0)),
    i_0_37 ).

cnf(c_0_56,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET642+3 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n018.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jul 10 09:10:44 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.56/2.22  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.56/2.22  # No SInE strategy applied
% 4.56/2.22  # Trying AutoSched0 for 150 seconds
% 4.56/2.22  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
% 4.56/2.22  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.56/2.22  #
% 4.56/2.22  # Preprocessing time       : 0.021 s
% 4.56/2.22  # Presaturation interreduction done
% 4.56/2.22  
% 4.56/2.22  # Proof found!
% 4.56/2.22  # SZS status Theorem
% 4.56/2.22  # SZS output start CNFRefutation
% See solution above
% 4.56/2.22  # Training examples: 0 positive, 0 negative
% 4.56/2.22  
% 4.56/2.22  # -------------------------------------------------
% 4.56/2.22  # User time                : 0.023 s
% 4.56/2.22  # System time              : 0.006 s
% 4.56/2.22  # Total time               : 0.028 s
% 4.56/2.22  # Maximum resident set size: 7124 pages
% 4.56/2.22  
%------------------------------------------------------------------------------