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

View Problem - Process Solution

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

% Computer : n028.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:08:00 EDT 2022

% Result   : Theorem 4.35s 2.21s
% Output   : CNFRefutation 4.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  10 unt;   5 nHn;  19 RR)
%            Number of literals    :   36 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   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   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,negated_conjecture,
    ~ subset(union(esk3_0,esk5_0),esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_13) ).

cnf(i_0_5,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_5) ).

cnf(i_0_6,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_6) ).

cnf(i_0_14,negated_conjecture,
    subset(esk5_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_14) ).

cnf(i_0_3,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_3) ).

cnf(i_0_4,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_4) ).

cnf(i_0_15,negated_conjecture,
    subset(esk3_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eqqjdoz4/input.p',i_0_15) ).

cnf(c_0_23,negated_conjecture,
    ~ subset(union(esk3_0,esk5_0),esk4_0),
    i_0_13 ).

cnf(c_0_24,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    i_0_5 ).

cnf(c_0_25,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_6 ).

cnf(c_0_26,negated_conjecture,
    subset(esk5_0,esk4_0),
    i_0_14 ).

cnf(c_0_27,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    i_0_3 ).

cnf(c_0_28,negated_conjecture,
    member(esk1_2(union(esk3_0,esk5_0),esk4_0),union(esk3_0,esk5_0)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    i_0_4 ).

cnf(c_0_30,negated_conjecture,
    subset(esk3_0,esk4_0),
    i_0_15 ).

cnf(c_0_31,negated_conjecture,
    ( member(X1,esk4_0)
    | ~ member(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    ( member(esk1_2(union(esk3_0,esk5_0),esk4_0),esk5_0)
    | member(esk1_2(union(esk3_0,esk5_0),esk4_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    ~ member(esk1_2(union(esk3_0,esk5_0),esk4_0),esk4_0),
    inference(spm,[status(thm)],[c_0_23,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ( member(X1,esk4_0)
    | ~ member(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    member(esk1_2(union(esk3_0,esk5_0),esk4_0),esk3_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SET014+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun Jul 10 13:21:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 4.35/2.21  # ENIGMATIC: Solved by autoschedule:
% 4.35/2.21  # No SInE strategy applied
% 4.35/2.21  # Trying AutoSched0 for 150 seconds
% 4.35/2.21  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 4.35/2.21  # and selection function MSelectComplexExceptUniqMaxHorn.
% 4.35/2.21  #
% 4.35/2.21  # Preprocessing time       : 0.023 s
% 4.35/2.21  # Presaturation interreduction done
% 4.35/2.21  
% 4.35/2.21  # Proof found!
% 4.35/2.21  # SZS status Theorem
% 4.35/2.21  # SZS output start CNFRefutation
% See solution above
% 4.35/2.21  # Training examples: 0 positive, 0 negative
% 4.35/2.21  
% 4.35/2.21  # -------------------------------------------------
% 4.35/2.21  # User time                : 0.029 s
% 4.35/2.21  # System time              : 0.002 s
% 4.35/2.21  # Total time               : 0.031 s
% 4.35/2.21  # Maximum resident set size: 7120 pages
% 4.35/2.21  
%------------------------------------------------------------------------------