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

View Problem - Process Solution

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

% Computer : n020.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:12:22 EDT 2022

% Result   : Theorem 7.49s 2.50s
% Output   : CNFRefutation 7.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   24 (   7 unt;   2 nHn;  22 RR)
%            Number of literals    :   49 (   6 equ;  26 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,negated_conjecture,
    intersection(esk4_0,esk5_0) != esk3_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_16) ).

cnf(i_0_13,plain,
    ( X1 = X2
    | ~ member(esk2_2(X1,X2),X2)
    | ~ member(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_13) ).

cnf(i_0_1,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_1) ).

cnf(i_0_19,negated_conjecture,
    ( member(X1,esk4_0)
    | ~ member(X1,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_19) ).

cnf(i_0_18,negated_conjecture,
    ( member(X1,esk5_0)
    | ~ member(X1,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_18) ).

cnf(i_0_12,plain,
    ( X1 = X2
    | member(esk2_2(X1,X2),X2)
    | member(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_12) ).

cnf(i_0_2,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_2) ).

cnf(i_0_17,negated_conjecture,
    ( member(X1,esk3_0)
    | ~ member(X1,esk4_0)
    | ~ member(X1,esk5_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rfrdurx7/input.p',i_0_17) ).

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

cnf(c_0_29,negated_conjecture,
    intersection(esk4_0,esk5_0) != esk3_0,
    i_0_16 ).

cnf(c_0_30,plain,
    ( X1 = X2
    | ~ member(esk2_2(X1,X2),X2)
    | ~ member(esk2_2(X1,X2),X1) ),
    i_0_13 ).

cnf(c_0_31,negated_conjecture,
    ( ~ member(esk2_2(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,esk5_0))
    | ~ member(esk2_2(esk3_0,intersection(esk4_0,esk5_0)),esk3_0) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30])]) ).

cnf(c_0_32,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    i_0_1 ).

cnf(c_0_33,negated_conjecture,
    ( member(X1,esk4_0)
    | ~ member(X1,esk3_0) ),
    i_0_19 ).

cnf(c_0_34,negated_conjecture,
    ( member(X1,esk5_0)
    | ~ member(X1,esk3_0) ),
    i_0_18 ).

cnf(c_0_35,plain,
    ( X1 = X2
    | member(esk2_2(X1,X2),X2)
    | member(esk2_2(X1,X2),X1) ),
    i_0_12 ).

cnf(c_0_36,negated_conjecture,
    ~ member(esk2_2(esk3_0,intersection(esk4_0,esk5_0)),esk3_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).

cnf(c_0_37,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    i_0_2 ).

cnf(c_0_38,negated_conjecture,
    member(esk2_2(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,esk5_0)),
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35])]),c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    ( member(X1,esk3_0)
    | ~ member(X1,esk4_0)
    | ~ member(X1,esk5_0) ),
    i_0_17 ).

cnf(c_0_40,plain,
    member(esk2_2(esk3_0,intersection(esk4_0,esk5_0)),esk5_0),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    i_0_3 ).

cnf(c_0_42,negated_conjecture,
    ~ member(esk2_2(esk3_0,intersection(esk4_0,esk5_0)),esk4_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]) ).

cnf(c_0_43,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_38]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET578+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 05:12:15 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.49/2.50  # ENIGMATIC: Solved by autoschedule:
% 7.49/2.50  # No SInE strategy applied
% 7.49/2.50  # Trying AutoSched0 for 150 seconds
% 7.49/2.50  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 7.49/2.50  # and selection function MSelectComplexExceptUniqMaxHorn.
% 7.49/2.50  #
% 7.49/2.50  # Preprocessing time       : 0.023 s
% 7.49/2.50  # Presaturation interreduction done
% 7.49/2.50  
% 7.49/2.50  # Proof found!
% 7.49/2.50  # SZS status Theorem
% 7.49/2.50  # SZS output start CNFRefutation
% See solution above
% 7.49/2.50  # Training examples: 0 positive, 0 negative
% 7.49/2.50  
% 7.49/2.50  # -------------------------------------------------
% 7.49/2.50  # User time                : 0.031 s
% 7.49/2.50  # System time              : 0.005 s
% 7.49/2.50  # Total time               : 0.036 s
% 7.49/2.50  # Maximum resident set size: 7116 pages
% 7.49/2.50  
%------------------------------------------------------------------------------