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

View Problem - Process Solution

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

% Computer : n019.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 08:38:48 EDT 2022

% Result   : Theorem 7.30s 2.30s
% Output   : CNFRefutation 7.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (   4 unt;   6 nHn;  18 RR)
%            Number of literals    :   47 (  10 equ;  22 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_8) ).

cnf(i_0_10,negated_conjecture,
    ( in(esk3_0,esk4_0)
    | subset(singleton(esk3_0),esk4_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_10) ).

cnf(i_0_4,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_4) ).

cnf(i_0_5,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_5) ).

cnf(i_0_7,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_7) ).

cnf(i_0_11,negated_conjecture,
    ( ~ in(esk3_0,esk4_0)
    | ~ subset(singleton(esk3_0),esk4_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_11) ).

cnf(i_0_6,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztkc1_86/input.p',i_0_6) ).

cnf(c_0_19,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_8 ).

cnf(c_0_20,negated_conjecture,
    ( in(esk3_0,esk4_0)
    | subset(singleton(esk3_0),esk4_0) ),
    i_0_10 ).

cnf(c_0_21,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_4 ).

cnf(c_0_22,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_5 ).

cnf(c_0_23,negated_conjecture,
    ( in(esk3_0,esk4_0)
    | in(X1,esk4_0)
    | ~ in(X1,singleton(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).

cnf(c_0_25,plain,
    ( X1 = X2
    | ~ in(X1,singleton(X2)) ),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_26,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    i_0_7 ).

cnf(c_0_27,negated_conjecture,
    ( ~ in(esk3_0,esk4_0)
    | ~ subset(singleton(esk3_0),esk4_0) ),
    i_0_11 ).

cnf(c_0_28,negated_conjecture,
    in(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    i_0_6 ).

cnf(c_0_30,plain,
    ( esk2_2(singleton(X1),X2) = X1
    | subset(singleton(X1),X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    ~ subset(singleton(esk3_0),esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).

cnf(c_0_32,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU144+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n019.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 : Sun Jun 19 06:11:56 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.30/2.30  # ENIGMATIC: Solved by autoschedule:
% 7.30/2.30  # No SInE strategy applied
% 7.30/2.30  # Trying AutoSched0 for 150 seconds
% 7.30/2.30  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.30/2.30  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.30/2.30  #
% 7.30/2.30  # Preprocessing time       : 0.021 s
% 7.30/2.30  
% 7.30/2.30  # Proof found!
% 7.30/2.30  # SZS status Theorem
% 7.30/2.30  # SZS output start CNFRefutation
% See solution above
% 7.30/2.30  # Training examples: 0 positive, 0 negative
% 7.30/2.30  
% 7.30/2.30  # -------------------------------------------------
% 7.30/2.30  # User time                : 0.026 s
% 7.30/2.30  # System time              : 0.002 s
% 7.30/2.30  # Total time               : 0.028 s
% 7.30/2.30  # Maximum resident set size: 7120 pages
% 7.30/2.30  
%------------------------------------------------------------------------------