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

View Problem - Process Solution

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

% Computer : n017.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:39:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
    set_union2(singleton(esk1_0),esk2_0) != esk2_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m6ita6v3/input.p',i_0_6) ).

cnf(i_0_8,plain,
    ( set_union2(singleton(X1),X2) = X2
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m6ita6v3/input.p',i_0_8) ).

cnf(i_0_7,negated_conjecture,
    in(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m6ita6v3/input.p',i_0_7) ).

cnf(c_0_12,negated_conjecture,
    set_union2(singleton(esk1_0),esk2_0) != esk2_0,
    i_0_6 ).

cnf(c_0_13,plain,
    ( set_union2(singleton(X1),X2) = X2
    | ~ in(X1,X2) ),
    i_0_8 ).

cnf(c_0_14,negated_conjecture,
    in(esk1_0,esk2_0),
    i_0_7 ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU161+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 Jun 19 12:02:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.76/2.39  # ENIGMATIC: Solved by autoschedule:
% 7.76/2.39  # No SInE strategy applied
% 7.76/2.39  # Trying AutoSched0 for 150 seconds
% 7.76/2.39  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.76/2.39  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.39  #
% 7.76/2.39  # Preprocessing time       : 0.022 s
% 7.76/2.39  
% 7.76/2.39  # Proof found!
% 7.76/2.39  # SZS status Theorem
% 7.76/2.39  # SZS output start CNFRefutation
% See solution above
% 7.76/2.39  # Training examples: 0 positive, 0 negative
% 7.76/2.39  
% 7.76/2.39  # -------------------------------------------------
% 7.76/2.39  # User time                : 0.023 s
% 7.76/2.39  # System time              : 0.003 s
% 7.76/2.39  # Total time               : 0.025 s
% 7.76/2.39  # Maximum resident set size: 7120 pages
% 7.76/2.39  
%------------------------------------------------------------------------------