%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU122+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:14:59 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP17527/SEU122+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17527/SEU122+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17527/SEU122+2.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 17659
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(6, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(9, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(13, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(21, conjecture,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(22, negated_conjecture,~(![X1]:subset(empty_set,X1)),inference(assume_negation,[status(cth)],[21])).
% fof(33, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(34, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(45, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[6])).
% fof(46, plain,empty(esk2_0),inference(skolemize,[status(esa)],[45])).
% cnf(47,plain,(empty(esk2_0)),inference(split_conjunct,[status(thm)],[46])).
% fof(57, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[9])).
% fof(58, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(78, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(79, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(104, negated_conjecture,?[X1]:~(subset(empty_set,X1)),inference(fof_nnf,[status(thm)],[22])).
% fof(105, negated_conjecture,?[X2]:~(subset(empty_set,X2)),inference(variable_rename,[status(thm)],[104])).
% fof(106, negated_conjecture,~(subset(empty_set,esk8_0)),inference(skolemize,[status(esa)],[105])).
% cnf(107,negated_conjecture,(~subset(empty_set,esk8_0)),inference(split_conjunct,[status(thm)],[106])).
% cnf(108,plain,(empty_set=esk2_0),inference(spm,[status(thm)],[59,47,theory(equality)])).
% cnf(214,negated_conjecture,(~subset(esk2_0,esk8_0)),inference(rw,[status(thm)],[107,108,theory(equality)])).
% cnf(217,negated_conjecture,(in(esk1_2(esk2_0,esk8_0),esk2_0)),inference(spm,[status(thm)],[214,39,theory(equality)])).
% cnf(225,negated_conjecture,(~empty(esk2_0)),inference(spm,[status(thm)],[80,217,theory(equality)])).
% cnf(227,negated_conjecture,($false),inference(rw,[status(thm)],[225,47,theory(equality)])).
% cnf(228,negated_conjecture,($false),inference(cn,[status(thm)],[227,theory(equality)])).
% cnf(229,negated_conjecture,($false),228,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 68
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 68
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 107
% # ...of the previous two non-trivial : 95
% # Contextual simplify-reflections : 0
% # Paramodulations : 97
% # Factorizations : 4
% # Equation resolutions : 6
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 126
% # Clause-clause subsumption calls (NU) : 52
% # Rec. Clause-clause subsumption calls : 48
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 26 leaves, 1.73+/-1.429 terms/leaf
% # Paramod-from index: 10 leaves, 1.60+/-0.800 terms/leaf
% # Paramod-into index: 23 leaves, 1.52+/-1.137 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.005 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.18 WC
% FINAL PrfWatch: 0.13 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP17527/SEU122+2.tptp
%
%------------------------------------------------------------------------------