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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET643+3 : TPTP v8.1.0. Released v2.2.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 00:13:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,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-wcjyqrkw/lgb.p',i_0_1) ).

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

cnf(i_0_20,plain,
    ( subset(X1,X1)
    | ~ ilf_type(X1,set_type) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wcjyqrkw/lgb.p',i_0_20) ).

cnf(i_0_42,negated_conjecture,
    ~ ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wcjyqrkw/lgb.p',i_0_42) ).

cnf(c_0_47,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_1 ).

cnf(c_0_48,plain,
    ilf_type(X1,set_type),
    i_0_41 ).

cnf(c_0_49,plain,
    ( subset(X1,X1)
    | ~ ilf_type(X1,set_type) ),
    i_0_20 ).

cnf(c_0_50,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_47,c_0_48]),c_0_48]),c_0_48])]) ).

cnf(c_0_51,plain,
    subset(X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48])]) ).

cnf(c_0_52,negated_conjecture,
    ~ ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0)),
    i_0_42 ).

cnf(c_0_53,plain,
    ilf_type(cross_product(X1,X2),relation_type(X1,X2)),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.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 Jul 10 04:10:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 4.38/2.10  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.38/2.10  # No SInE strategy applied
% 4.38/2.10  # Trying AutoSched0 for 150 seconds
% 4.38/2.10  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0a
% 4.38/2.10  # and selection function SelectNegativeLiterals.
% 4.38/2.10  #
% 4.38/2.10  # Preprocessing time       : 0.024 s
% 4.38/2.10  
% 4.38/2.10  # Proof found!
% 4.38/2.10  # SZS status Theorem
% 4.38/2.10  # SZS output start CNFRefutation
% See solution above
% 4.38/2.10  # Training examples: 0 positive, 0 negative
% 4.38/2.10  
% 4.38/2.10  # -------------------------------------------------
% 4.38/2.10  # User time                : 0.025 s
% 4.38/2.10  # System time              : 0.006 s
% 4.38/2.10  # Total time               : 0.030 s
% 4.38/2.10  # Maximum resident set size: 7124 pages
% 4.38/2.10  
%------------------------------------------------------------------------------