TSTP Solution File: SET788+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n011.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:14:11 EDT 2022

% Result   : Theorem 4.35s 2.10s
% Output   : CNFRefutation 4.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   23 (   4 unt;   7 nHn;  19 RR)
%            Number of literals    :   53 (   0 equ;  22 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ equalish(X3,X2)
    | ~ a_member_of(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w26_x0l7/lgb.p',i_0_6) ).

cnf(i_0_1,negated_conjecture,
    ( equalish(esk2_0,esk3_0)
    | equalish(esk3_0,esk2_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w26_x0l7/lgb.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ equalish(X2,X3)
    | ~ a_member_of(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w26_x0l7/lgb.p',i_0_5) ).

cnf(i_0_3,negated_conjecture,
    ( equalish(X1,X2)
    | a_member_of(esk1_2(X1,X2),X2)
    | a_member_of(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w26_x0l7/lgb.p',i_0_3) ).

cnf(i_0_4,negated_conjecture,
    ( equalish(X1,X2)
    | ~ a_member_of(esk1_2(X1,X2),X2)
    | ~ a_member_of(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w26_x0l7/lgb.p',i_0_4) ).

cnf(i_0_2,negated_conjecture,
    ( ~ equalish(esk2_0,esk3_0)
    | ~ equalish(esk3_0,esk2_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w26_x0l7/lgb.p',i_0_2) ).

cnf(c_0_13,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ equalish(X3,X2)
    | ~ a_member_of(X1,X3) ),
    i_0_6 ).

cnf(c_0_14,negated_conjecture,
    ( equalish(esk2_0,esk3_0)
    | equalish(esk3_0,esk2_0) ),
    i_0_1 ).

cnf(c_0_15,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ equalish(X2,X3)
    | ~ a_member_of(X1,X3) ),
    i_0_5 ).

cnf(c_0_16,negated_conjecture,
    ( a_member_of(X1,esk3_0)
    | ~ a_member_of(X1,esk2_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    ( equalish(X1,X2)
    | a_member_of(esk1_2(X1,X2),X2)
    | a_member_of(esk1_2(X1,X2),X1) ),
    i_0_3 ).

cnf(c_0_18,negated_conjecture,
    ( a_member_of(esk1_2(esk2_0,X1),esk3_0)
    | a_member_of(esk1_2(esk2_0,X1),X1)
    | equalish(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    ( equalish(X1,X2)
    | ~ a_member_of(esk1_2(X1,X2),X2)
    | ~ a_member_of(esk1_2(X1,X2),X1) ),
    i_0_4 ).

cnf(c_0_20,negated_conjecture,
    ( a_member_of(esk1_2(esk2_0,esk3_0),esk3_0)
    | equalish(esk2_0,esk3_0) ),
    inference(ef,[status(thm)],[c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    ( equalish(esk2_0,esk3_0)
    | ~ a_member_of(esk1_2(esk2_0,esk3_0),esk2_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    ( a_member_of(X1,esk2_0)
    | ~ a_member_of(X1,esk3_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_13]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ equalish(esk2_0,esk3_0)
    | ~ equalish(esk3_0,esk2_0) ),
    i_0_2 ).

cnf(c_0_24,negated_conjecture,
    equalish(esk2_0,esk3_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    ( a_member_of(esk1_2(X1,esk2_0),esk3_0)
    | a_member_of(esk1_2(X1,esk2_0),X1)
    | equalish(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_26,negated_conjecture,
    ~ equalish(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).

cnf(c_0_27,negated_conjecture,
    ( equalish(X1,esk2_0)
    | ~ a_member_of(esk1_2(X1,esk2_0),esk3_0)
    | ~ a_member_of(esk1_2(X1,esk2_0),X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    a_member_of(esk1_2(esk3_0,esk2_0),esk3_0),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_25]),c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28])]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n011.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 06:34:59 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.35/2.10  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.35/2.10  # No SInE strategy applied
% 4.35/2.10  # Trying AutoSched0 for 150 seconds
% 4.35/2.10  # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 4.35/2.10  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.35/2.10  #
% 4.35/2.10  # Preprocessing time       : 0.022 s
% 4.35/2.10  
% 4.35/2.10  # Proof found!
% 4.35/2.10  # SZS status Theorem
% 4.35/2.10  # SZS output start CNFRefutation
% See solution above
% 4.35/2.10  # Training examples: 0 positive, 0 negative
% 4.35/2.10  
% 4.35/2.10  # -------------------------------------------------
% 4.35/2.10  # User time                : 0.023 s
% 4.35/2.10  # System time              : 0.006 s
% 4.35/2.10  # Total time               : 0.029 s
% 4.35/2.10  # Maximum resident set size: 7124 pages
% 4.35/2.10  
%------------------------------------------------------------------------------