%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU151+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:36 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP14469/SEU151+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14469/SEU151+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14469/SEU151+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 14565
% 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(2, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(6, conjecture,![X1]:![X2]:![X3]:![X4]:~(((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4))),file('/tmp/SRASS.s.p', t10_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:~(((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4)))),inference(assume_negation,[status(cth)],[6])).
% fof(12, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[13])).
% fof(15, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[14])).
% fof(16, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk1_3(X5,X6,X7)=X5)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk1_3(X5,X6,X7)=X6)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[15])).
% cnf(20,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[16])).
% cnf(21,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[16])).
% cnf(22,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(32, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4)),inference(fof_nnf,[status(thm)],[7])).
% fof(33, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((unordered_pair(X5,X6)=unordered_pair(X7,X8)&~(X5=X7))&~(X5=X8)),inference(variable_rename,[status(thm)],[32])).
% fof(34, negated_conjecture,((unordered_pair(esk4_0,esk5_0)=unordered_pair(esk6_0,esk7_0)&~(esk4_0=esk6_0))&~(esk4_0=esk7_0)),inference(skolemize,[status(esa)],[33])).
% cnf(35,negated_conjecture,(esk4_0!=esk7_0),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,negated_conjecture,(esk4_0!=esk6_0),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,negated_conjecture,(unordered_pair(esk4_0,esk5_0)=unordered_pair(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(39,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(40,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[21,theory(equality)])).
% cnf(41,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X1,X3))),inference(er,[status(thm)],[22,theory(equality)])).
% cnf(46,negated_conjecture,(in(esk7_0,X1)|unordered_pair(esk4_0,esk5_0)!=X1),inference(spm,[status(thm)],[39,37,theory(equality)])).
% cnf(49,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[40,theory(equality)])).
% cnf(53,negated_conjecture,(in(esk7_0,unordered_pair(esk4_0,esk5_0))),inference(er,[status(thm)],[46,theory(equality)])).
% cnf(61,negated_conjecture,(in(esk6_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[49,37,theory(equality)])).
% cnf(79,negated_conjecture,(esk5_0=esk7_0|esk4_0=esk7_0),inference(spm,[status(thm)],[41,53,theory(equality)])).
% cnf(82,negated_conjecture,(esk5_0=esk7_0),inference(sr,[status(thm)],[79,35,theory(equality)])).
% cnf(85,negated_conjecture,(in(esk6_0,unordered_pair(esk4_0,esk7_0))),inference(rw,[status(thm)],[61,82,theory(equality)])).
% cnf(90,negated_conjecture,(unordered_pair(esk6_0,esk7_0)=unordered_pair(esk4_0,esk7_0)),inference(rw,[status(thm)],[37,82,theory(equality)])).
% cnf(103,negated_conjecture,(esk7_0=esk6_0|esk4_0=esk6_0),inference(spm,[status(thm)],[41,85,theory(equality)])).
% cnf(104,negated_conjecture,(esk7_0=esk6_0),inference(sr,[status(thm)],[103,36,theory(equality)])).
% cnf(109,negated_conjecture,(unordered_pair(esk6_0,esk6_0)=unordered_pair(esk4_0,esk7_0)),inference(rw,[status(thm)],[90,104,theory(equality)])).
% cnf(110,negated_conjecture,(unordered_pair(esk6_0,esk6_0)=unordered_pair(esk4_0,esk6_0)),inference(rw,[status(thm)],[109,104,theory(equality)])).
% cnf(180,negated_conjecture,(esk6_0=X1|~in(X1,unordered_pair(esk4_0,esk6_0))),inference(spm,[status(thm)],[41,110,theory(equality)])).
% cnf(189,negated_conjecture,(esk6_0=esk4_0),inference(spm,[status(thm)],[180,49,theory(equality)])).
% cnf(190,negated_conjecture,($false),inference(sr,[status(thm)],[189,36,theory(equality)])).
% cnf(191,negated_conjecture,($false),190,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 62
% # ...of these trivial : 2
% # ...subsumed : 23
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 113
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections : 0
% # Paramodulations : 75
% # Factorizations : 12
% # Equation resolutions : 26
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 33
% # ...number of literals in the above : 149
% # Clause-clause subsumption calls (NU) : 41
% # Rec. Clause-clause subsumption calls : 40
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 19 leaves, 1.53+/-1.045 terms/leaf
% # Paramod-from index: 8 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 18 leaves, 1.44+/-1.012 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.002 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP14469/SEU151+3.tptp
%
%------------------------------------------------------------------------------