## TSTP Solution File: SEU163+1 by E---3.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : E---3.0
% Problem  : SEU163+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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  : 300s
% DateTime : Tue Sep 20 05:38:52 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   14 (   3 unt;   5 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   2   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            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   :   10 (   0 sgn   8   !;   0   ?;   0   :)

%------------------------------------------------------------------------------
tff(decl_22,type,
subset: ( \$i * \$i ) > \$o ).

tff(decl_23,type,
in: ( \$i * \$i ) > \$o ).

tff(decl_24,type,
union: \$i > \$i ).

tff(decl_25,type,
esk1_0: \$i ).

tff(decl_26,type,
esk2_0: \$i ).

fof(t92_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t92_zfmisc_1) ).

fof(l50_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).

fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[t92_zfmisc_1]) ).

fof(c_0_3,negated_conjecture,
( in(esk1_0,esk2_0)
& ~ subset(esk1_0,union(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
! [X6,X7] :
( ~ in(X6,X7)
| subset(X6,union(X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).

cnf(c_0_5,negated_conjecture,
~ subset(esk1_0,union(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SEU163+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sat Sep  3 10:02:54 EDT 2022
% 0.12/0.34  % CPUTime    :
% 0.19/0.46  Running first-order on 8 cores theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  # Version: 3.0pre003
% 0.19/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47  # Starting sh5l with 300s (1) cores
% 0.19/0.47  # new_bool_3 with pid 27497 completed with status 0
% 0.19/0.47  # Result found by new_bool_3
% 0.19/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47  # ...ProofStateSinE()=4/5
% 0.19/0.47  # Search class: FHHNF-FFSF11-SFFFFFNN
% 0.19/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.47  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27502 completed with status 0
% 0.19/0.47  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47  # ...ProofStateSinE()=4/5
% 0.19/0.47  # Search class: FHHNF-FFSF11-SFFFFFNN
% 0.19/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.47  # Preprocessing time       : 0.001 s
% 0.19/0.47  # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47  # Proof found!
% 0.19/0.47  # SZS status Theorem
% 0.19/0.47  # SZS output start CNFRefutation
% See solution above
% 0.19/0.47  # Parsed axioms                        : 5
% 0.19/0.47  # Removed by relevancy pruning/SinE    : 1
% 0.19/0.47  # Initial clauses                      : 5
% 0.19/0.47  # Removed in clause preprocessing      : 0
% 0.19/0.47  # Initial clauses in saturation        : 5
% 0.19/0.47  # Processed clauses                    : 11
% 0.19/0.47  # ...of these trivial                  : 0
% 0.19/0.47  # ...subsumed                          : 0
% 0.19/0.47  # ...remaining for further processing  : 11
% 0.19/0.47  # Other redundant clauses eliminated   : 0
% 0.19/0.47  # Clauses deleted for lack of memory   : 0
% 0.19/0.47  # Backward-subsumed                    : 0
% 0.19/0.47  # Backward-rewritten                   : 0
% 0.19/0.47  # Generated clauses                    : 2
% 0.19/0.47  # ...of the previous two non-redundant : 1
% 0.19/0.47  # ...aggressively subsumed             : 0
% 0.19/0.47  # Contextual simplify-reflections      : 0
% 0.19/0.47  # Paramodulations                      : 2
% 0.19/0.47  # Factorizations                       : 0
% 0.19/0.47  # NegExts                              : 0
% 0.19/0.47  # Equation resolutions                 : 0
% 0.19/0.47  # Propositional unsat checks           : 0
% 0.19/0.47  #    Propositional check models        : 0
% 0.19/0.47  #    Propositional check unsatisfiable : 0
% 0.19/0.47  #    Propositional clauses             : 0
% 0.19/0.47  #    Propositional clauses after purity: 0
% 0.19/0.47  #    Propositional unsat core size     : 0
% 0.19/0.47  #    Propositional preprocessing time  : 0.000
% 0.19/0.47  #    Propositional encoding time       : 0.000
% 0.19/0.47  #    Propositional solver time         : 0.000
% 0.19/0.47  #    Success case prop preproc time    : 0.000
% 0.19/0.47  #    Success case prop encoding time   : 0.000
% 0.19/0.47  #    Success case prop solver time     : 0.000
% 0.19/0.47  # Current number of processed clauses  : 6
% 0.19/0.47  #    Positive orientable unit clauses  : 2
% 0.19/0.47  #    Positive unorientable unit clauses: 0
% 0.19/0.47  #    Negative unit clauses             : 2
% 0.19/0.47  #    Non-unit-clauses                  : 2
% 0.19/0.47  # Current number of unprocessed clauses: 0
% 0.19/0.47  # ...number of literals in the above   : 0
% 0.19/0.47  # Current number of archived formulas  : 0
% 0.19/0.47  # Current number of archived clauses   : 5
% 0.19/0.47  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.47  # Unit Clause-clause subsumption calls : 0
% 0.19/0.47  # Rewrite failures with RHS unbound    : 0
% 0.19/0.47  # BW rewrite match attempts            : 1
% 0.19/0.47  # BW rewrite match successes           : 0
% 0.19/0.47  # Condensation attempts                : 0
% 0.19/0.47  # Condensation successes               : 0
% 0.19/0.47  # Termbank termtop insertions          : 255
% 0.19/0.47
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.003 s
% 0.19/0.47  # System time              : 0.002 s
% 0.19/0.47  # Total time               : 0.005 s
% 0.19/0.47  # Maximum resident set size: 1596 pages
% 0.19/0.47
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.003 s
% 0.19/0.47  # System time              : 0.005 s
% 0.19/0.47  # Total time               : 0.008 s
% 0.19/0.47  # Maximum resident set size: 1692 pages
%------------------------------------------------------------------------------
```