## TSTP Solution File: SEU163+1 by Enigma---0.5.1

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU163+1 : TPTP v8.1.0. Released v3.3.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 08:39:02 EDT 2022

% Result   : Theorem 7.38s 2.34s
% Output   : CNFRefutation 7.38s
% 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 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 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-1 aty)
%            Number of variables   :    4 (   0 sgn)

%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
~ subset(esk1_0,union(esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rm0wn0o6/lgb.p',i_0_4) ).

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

cnf(i_0_5,negated_conjecture,
in(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rm0wn0o6/lgb.p',i_0_5) ).

cnf(c_0_10,negated_conjecture,
~ subset(esk1_0,union(esk2_0)),
i_0_4 ).

cnf(c_0_11,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
i_0_6 ).

cnf(c_0_12,negated_conjecture,
in(esk1_0,esk2_0),
i_0_5 ).

cnf(c_0_13,negated_conjecture,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU163+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.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 00:50:16 EDT 2022
% 0.12/0.33  % CPUTime  :
% 0.20/0.44  # ENIGMATIC: Selected complete mode:
% 7.38/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.38/2.34  # No SInE strategy applied
% 7.38/2.34  # Trying AutoSched0 for 150 seconds
% 7.38/2.34  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 7.38/2.34  # and selection function PSelectComplexExceptRRHorn.
% 7.38/2.34  #
% 7.38/2.34  # Preprocessing time       : 0.023 s
% 7.38/2.34
% 7.38/2.34  # Proof found!
% 7.38/2.34  # SZS status Theorem
% 7.38/2.34  # SZS output start CNFRefutation
% See solution above
% 7.38/2.34  # Training examples: 0 positive, 0 negative
% 7.38/2.34
% 7.38/2.34  # -------------------------------------------------
% 7.38/2.34  # User time                : 0.024 s
% 7.38/2.34  # System time              : 0.004 s
% 7.38/2.34  # Total time               : 0.028 s
% 7.38/2.34  # Maximum resident set size: 7124 pages
% 7.38/2.34
%------------------------------------------------------------------------------
```