%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU150+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:27 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP14210/SEU150+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14210/SEU150+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14210/SEU150+3.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 14306
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 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]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(5, conjecture,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3),file('/tmp/SRASS.s.p', t9_zfmisc_1)).
% fof(6, negated_conjecture,~(![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3)),inference(assume_negation,[status(cth)],[5])).
% fof(8, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(9,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X1=X2),inference(fof_nnf,[status(thm)],[2])).
% fof(11, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X4=X5),inference(variable_rename,[status(thm)],[10])).
% cnf(12,plain,(X1=X2|singleton(X1)!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[11])).
% fof(19, negated_conjecture,?[X1]:?[X2]:?[X3]:(singleton(X1)=unordered_pair(X2,X3)&~(X2=X3)),inference(fof_nnf,[status(thm)],[6])).
% fof(20, negated_conjecture,?[X4]:?[X5]:?[X6]:(singleton(X4)=unordered_pair(X5,X6)&~(X5=X6)),inference(variable_rename,[status(thm)],[19])).
% fof(21, negated_conjecture,(singleton(esk3_0)=unordered_pair(esk4_0,esk5_0)&~(esk4_0=esk5_0)),inference(skolemize,[status(esa)],[20])).
% cnf(22,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,negated_conjecture,(singleton(esk3_0)=unordered_pair(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,negated_conjecture,(esk3_0=X1|unordered_pair(X1,X2)!=unordered_pair(esk4_0,esk5_0)),inference(spm,[status(thm)],[12,23,theory(equality)])).
% cnf(25,plain,(X1=X2|unordered_pair(X3,X2)!=singleton(X1)),inference(spm,[status(thm)],[12,9,theory(equality)])).
% cnf(30,negated_conjecture,(esk3_0=esk4_0),inference(er,[status(thm)],[24,theory(equality)])).
% cnf(34,negated_conjecture,(singleton(esk4_0)=unordered_pair(esk4_0,esk5_0)),inference(rw,[status(thm)],[23,30,theory(equality)])).
% cnf(36,negated_conjecture,(esk4_0=X1|unordered_pair(X2,X1)!=unordered_pair(esk4_0,esk5_0)),inference(spm,[status(thm)],[25,34,theory(equality)])).
% cnf(40,negated_conjecture,(esk4_0=esk5_0),inference(er,[status(thm)],[36,theory(equality)])).
% cnf(43,negated_conjecture,($false),inference(sr,[status(thm)],[40,22,theory(equality)])).
% cnf(44,negated_conjecture,($false),43,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 22
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 17
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections : 0
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 4
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 12 leaves, 1.25+/-0.829 terms/leaf
% # Paramod-from index: 4 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 11 leaves, 1.27+/-0.862 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP14210/SEU150+3.tptp
%
%------------------------------------------------------------------------------