%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU150+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 : art02.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:19:24 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP21005/SEU150+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21005/SEU150+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21005/SEU150+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 21101
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(2, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(73, conjecture,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3),file('/tmp/SRASS.s.p', t9_zfmisc_1)).
% fof(74, negated_conjecture,~(![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3)),inference(assume_negation,[status(cth)],[73])).
% fof(85, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(86,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(87, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[2])).
% cnf(88,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[87])).
% fof(89, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X1=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(90, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X4=X5),inference(variable_rename,[status(thm)],[89])).
% cnf(91,plain,(X1=X2|singleton(X1)!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[90])).
% fof(340, negated_conjecture,?[X1]:?[X2]:?[X3]:(singleton(X1)=unordered_pair(X2,X3)&~(X2=X3)),inference(fof_nnf,[status(thm)],[74])).
% fof(341, negated_conjecture,?[X4]:?[X5]:?[X6]:(singleton(X4)=unordered_pair(X5,X6)&~(X5=X6)),inference(variable_rename,[status(thm)],[340])).
% fof(342, negated_conjecture,(singleton(esk14_0)=unordered_pair(esk15_0,esk16_0)&~(esk15_0=esk16_0)),inference(skolemize,[status(esa)],[341])).
% cnf(343,negated_conjecture,(esk15_0!=esk16_0),inference(split_conjunct,[status(thm)],[342])).
% cnf(344,negated_conjecture,(singleton(esk14_0)=unordered_pair(esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[342])).
% cnf(346,negated_conjecture,(unordered_pair(esk15_0,esk16_0)=unordered_pair(esk14_0,esk14_0)),inference(rw,[status(thm)],[344,88,theory(equality)]),['unfolding']).
% cnf(348,plain,(X1=X2|unordered_pair(X2,X3)!=unordered_pair(X1,X1)),inference(rw,[status(thm)],[91,88,theory(equality)]),['unfolding']).
% cnf(403,plain,(X1=X2|unordered_pair(X1,X1)!=unordered_pair(X3,X2)),inference(spm,[status(thm)],[348,86,theory(equality)])).
% cnf(405,negated_conjecture,(esk14_0=X1|unordered_pair(esk15_0,esk16_0)!=unordered_pair(X1,X2)),inference(spm,[status(thm)],[348,346,theory(equality)])).
% cnf(1621,negated_conjecture,(esk14_0=esk15_0),inference(er,[status(thm)],[405,theory(equality)])).
% cnf(1722,negated_conjecture,(unordered_pair(esk15_0,esk15_0)=unordered_pair(esk15_0,esk16_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[346,1621,theory(equality)]),1621,theory(equality)])).
% cnf(1731,negated_conjecture,(X1=esk16_0|unordered_pair(X1,X1)!=unordered_pair(esk15_0,esk15_0)),inference(spm,[status(thm)],[403,1722,theory(equality)])).
% cnf(1945,negated_conjecture,(esk15_0=esk16_0),inference(er,[status(thm)],[1731,theory(equality)])).
% cnf(1962,negated_conjecture,($false),inference(sr,[status(thm)],[1945,343,theory(equality)])).
% cnf(1963,negated_conjecture,($false),1962,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 304
% # ...of these trivial : 6
% # ...subsumed : 54
% # ...remaining for further processing: 244
% # Other redundant clauses eliminated : 45
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 7
% # Generated clauses : 1298
% # ...of the previous two non-trivial : 1058
% # Contextual simplify-reflections : 0
% # Paramodulations : 1222
% # Factorizations : 14
% # Equation resolutions : 62
% # Current number of processed clauses: 128
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 13
% # Non-unit-clauses : 81
% # Current number of unprocessed clauses: 855
% # ...number of literals in the above : 2643
% # Clause-clause subsumption calls (NU) : 282
% # Rec. Clause-clause subsumption calls : 264
% # Unit Clause-clause subsumption calls : 49
% # Rewrite failures with RHS unbound : 8
% # Indexed BW rewrite attempts : 55
% # Indexed BW rewrite successes : 39
% # Backwards rewriting index: 83 leaves, 1.71+/-1.690 terms/leaf
% # Paramod-from index: 51 leaves, 1.33+/-0.647 terms/leaf
% # Paramod-into index: 80 leaves, 1.59+/-1.394 terms/leaf
% # -------------------------------------------------
% # User time : 0.058 s
% # System time : 0.008 s
% # Total time : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP21005/SEU150+2.tptp
%
%------------------------------------------------------------------------------