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

View Problem - Process Solution

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

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

% Result   : Theorem 4.49s 2.22s
% Output   : CNFRefutation 4.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  10 unt;   0 nHn;  19 RR)
%            Number of literals    :   54 (   0 equ;  35 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   :   34 (   4 sgn)

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

cnf(i_0_40,plain,
    ilf_type(X1,set_type),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgnr5gxc/input.p',i_0_40) ).

cnf(i_0_1,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,set_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgnr5gxc/input.p',i_0_1) ).

cnf(i_0_3,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-dgnr5gxc/input.p',i_0_3) ).

cnf(i_0_43,negated_conjecture,
    ilf_type(esk13_0,relation_type(esk10_0,esk12_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgnr5gxc/input.p',i_0_43) ).

cnf(i_0_42,negated_conjecture,
    subset(esk10_0,esk11_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgnr5gxc/input.p',i_0_42) ).

cnf(i_0_41,negated_conjecture,
    ~ ilf_type(esk13_0,relation_type(esk11_0,esk12_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgnr5gxc/input.p',i_0_41) ).

cnf(c_0_51,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X4,set_type)
    | ~ subset(domain_of(X1),X2)
    | ~ ilf_type(X1,relation_type(X4,X3)) ),
    i_0_4 ).

cnf(c_0_52,plain,
    ilf_type(X1,set_type),
    i_0_40 ).

cnf(c_0_53,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,set_type) ),
    i_0_1 ).

cnf(c_0_54,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_3 ).

cnf(c_0_55,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ subset(domain_of(X1),X2)
    | ~ ilf_type(X1,relation_type(X4,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_52])]) ).

cnf(c_0_56,negated_conjecture,
    ilf_type(esk13_0,relation_type(esk10_0,esk12_0)),
    i_0_43 ).

cnf(c_0_57,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_52]),c_0_52]),c_0_52])]) ).

cnf(c_0_58,negated_conjecture,
    subset(esk10_0,esk11_0),
    i_0_42 ).

cnf(c_0_59,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_54,c_0_52]),c_0_52])]) ).

cnf(c_0_60,negated_conjecture,
    ( ilf_type(esk13_0,relation_type(X1,esk12_0))
    | ~ subset(domain_of(esk13_0),X1) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_61,negated_conjecture,
    ( subset(X1,esk11_0)
    | ~ subset(X1,esk10_0) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_62,negated_conjecture,
    subset(domain_of(esk13_0),esk10_0),
    inference(spm,[status(thm)],[c_0_59,c_0_56]) ).

cnf(c_0_63,negated_conjecture,
    ~ ilf_type(esk13_0,relation_type(esk11_0,esk12_0)),
    i_0_41 ).

cnf(c_0_64,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]),c_0_63]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET653+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 : n023.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 23:26:12 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.49/2.22  # ENIGMATIC: Solved by autoschedule:
% 4.49/2.22  # No SInE strategy applied
% 4.49/2.22  # Trying AutoSched0 for 150 seconds
% 4.49/2.22  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 4.49/2.22  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.49/2.22  #
% 4.49/2.22  # Preprocessing time       : 0.013 s
% 4.49/2.22  # Presaturation interreduction done
% 4.49/2.22  
% 4.49/2.22  # Proof found!
% 4.49/2.22  # SZS status Theorem
% 4.49/2.22  # SZS output start CNFRefutation
% See solution above
% 4.49/2.22  # Training examples: 0 positive, 0 negative
% 4.49/2.22  
% 4.49/2.22  # -------------------------------------------------
% 4.49/2.22  # User time                : 0.015 s
% 4.49/2.22  # System time              : 0.005 s
% 4.49/2.22  # Total time               : 0.020 s
% 4.49/2.22  # Maximum resident set size: 7124 pages
% 4.49/2.22  
%------------------------------------------------------------------------------