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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET663+3 : TPTP v8.1.0. Released v2.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 : Tue Jul 19 00:13:17 EDT 2022

% Result   : Theorem 5.21s 2.23s
% Output   : CNFRefutation 5.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  14 unt;   0 nHn;  29 RR)
%            Number of literals    :   66 (  10 equ;  38 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   37 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
    ( subset(domain_of(X1),X2)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_5) ).

cnf(i_0_60,plain,
    ilf_type(X1,set_type),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_60) ).

cnf(i_0_9,plain,
    ( ilf_type(X1,subset_type(cross_product(X2,X3)))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_9) ).

cnf(i_0_1,plain,
    ( X1 = empty_set
    | ~ ilf_type(X1,set_type)
    | ~ subset(X1,empty_set) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_1) ).

cnf(i_0_62,negated_conjecture,
    ilf_type(esk15_0,relation_type(empty_set,esk14_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_62) ).

cnf(i_0_55,plain,
    ( relation_like(X1)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,subset_type(cross_product(X3,X2))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_55) ).

cnf(i_0_63,negated_conjecture,
    ilf_type(esk15_0,relation_type(esk13_0,esk14_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_63) ).

cnf(i_0_22,plain,
    ( ilf_type(X1,binary_relation_type)
    | ~ relation_like(X1)
    | ~ ilf_type(X1,set_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_22) ).

cnf(i_0_3,plain,
    ( X1 = empty_set
    | domain_of(X1) != empty_set
    | ~ ilf_type(X1,binary_relation_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_3) ).

cnf(i_0_61,negated_conjecture,
    esk15_0 != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j_9h61fu/lgb.p',i_0_61) ).

cnf(c_0_74,plain,
    ( subset(domain_of(X1),X2)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    i_0_5 ).

cnf(c_0_75,plain,
    ilf_type(X1,set_type),
    i_0_60 ).

cnf(c_0_76,plain,
    ( ilf_type(X1,subset_type(cross_product(X2,X3)))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    i_0_9 ).

cnf(c_0_77,plain,
    ( X1 = empty_set
    | ~ ilf_type(X1,set_type)
    | ~ subset(X1,empty_set) ),
    i_0_1 ).

cnf(c_0_78,plain,
    ( subset(domain_of(X1),X2)
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75])]) ).

cnf(c_0_79,negated_conjecture,
    ilf_type(esk15_0,relation_type(empty_set,esk14_0)),
    i_0_62 ).

cnf(c_0_80,plain,
    ( relation_like(X1)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,subset_type(cross_product(X3,X2))) ),
    i_0_55 ).

cnf(c_0_81,plain,
    ( ilf_type(X1,subset_type(cross_product(X2,X3)))
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_75]),c_0_75])]) ).

cnf(c_0_82,negated_conjecture,
    ilf_type(esk15_0,relation_type(esk13_0,esk14_0)),
    i_0_63 ).

cnf(c_0_83,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_75])]) ).

cnf(c_0_84,negated_conjecture,
    subset(domain_of(esk15_0),empty_set),
    inference(spm,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_85,plain,
    ( ilf_type(X1,binary_relation_type)
    | ~ relation_like(X1)
    | ~ ilf_type(X1,set_type) ),
    i_0_22 ).

cnf(c_0_86,plain,
    ( relation_like(X1)
    | ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_75]),c_0_75])]) ).

cnf(c_0_87,negated_conjecture,
    ilf_type(esk15_0,subset_type(cross_product(esk13_0,esk14_0))),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_88,plain,
    ( X1 = empty_set
    | domain_of(X1) != empty_set
    | ~ ilf_type(X1,binary_relation_type) ),
    i_0_3 ).

cnf(c_0_89,plain,
    domain_of(esk15_0) = empty_set,
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_90,negated_conjecture,
    esk15_0 != empty_set,
    i_0_61 ).

cnf(c_0_91,plain,
    ( ilf_type(X1,binary_relation_type)
    | ~ relation_like(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_75])]) ).

cnf(c_0_92,plain,
    relation_like(esk15_0),
    inference(spm,[status(thm)],[c_0_86,c_0_87]) ).

cnf(c_0_93,plain,
    ~ ilf_type(esk15_0,binary_relation_type),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).

cnf(c_0_94,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET663+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n006.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 : Mon Jul 11 09:44:52 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 5.21/2.23  # ENIGMATIC: Solved by autoschedule-lgb:
% 5.21/2.23  # No SInE strategy applied
% 5.21/2.23  # Trying AutoSched0 for 150 seconds
% 5.21/2.23  # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 5.21/2.23  # and selection function SelectNewComplexAHPNS.
% 5.21/2.23  #
% 5.21/2.23  # Preprocessing time       : 0.023 s
% 5.21/2.23  
% 5.21/2.23  # Proof found!
% 5.21/2.23  # SZS status Theorem
% 5.21/2.23  # SZS output start CNFRefutation
% See solution above
% 5.21/2.23  # Training examples: 0 positive, 0 negative
% 5.21/2.23  
% 5.21/2.23  # -------------------------------------------------
% 5.21/2.23  # User time                : 0.023 s
% 5.21/2.23  # System time              : 0.005 s
% 5.21/2.23  # Total time               : 0.028 s
% 5.21/2.23  # Maximum resident set size: 7128 pages
% 5.21/2.23  
%------------------------------------------------------------------------------