## TSTP Solution File: SEU163+1 by SRASS---0.1

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU163+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 01:22:34 EST 2010

% Result   : Theorem 0.87s
% Output   : Solution 0.87s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP22047/SEU163+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22047/SEU163+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 22143
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2))),file('/tmp/SRASS.s.p', l50_zfmisc_1)).
% fof(5, conjecture,![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2))),file('/tmp/SRASS.s.p', t92_zfmisc_1)).
% fof(6, negated_conjecture,~(![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2)))),inference(assume_negation,[status(cth)],[5])).
% fof(13, plain,![X1]:![X2]:(~(in(X1,X2))|subset(X1,union(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(14, plain,![X3]:![X4]:(~(in(X3,X4))|subset(X3,union(X4))),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(subset(X1,union(X2))|~in(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(17, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&~(subset(X1,union(X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(18, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&~(subset(X3,union(X4)))),inference(variable_rename,[status(thm)],[17])).
% fof(19, negated_conjecture,(in(esk1_0,esk2_0)&~(subset(esk1_0,union(esk2_0)))),inference(skolemize,[status(esa)],[18])).
% cnf(20,negated_conjecture,(~subset(esk1_0,union(esk2_0))),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,negated_conjecture,(in(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[19])).
% cnf(23,negated_conjecture,(~in(esk1_0,esk2_0)),inference(spm,[status(thm)],[20,15,theory(equality)])).
% cnf(24,negated_conjecture,(\$false),inference(rw,[status(thm)],[23,21,theory(equality)])).
% cnf(25,negated_conjecture,(\$false),inference(cn,[status(thm)],[24,theory(equality)])).
% cnf(26,negated_conjecture,(\$false),25,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 10
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 2
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 2
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 5
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    10 leaves,   1.10+/-0.300 terms/leaf
% # Paramod-from index:            3 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            9 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.008 s
% # System time            : 0.003 s
% # Total time             : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP22047/SEU163+1.tptp
%
%------------------------------------------------------------------------------
```