%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU151+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 : art03.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:33 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP29030/SEU151+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29030/SEU151+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29030/SEU151+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 29126
% 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(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(74, 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(75, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:~(((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4)))),inference(assume_negation,[status(cth)],[74])).
% fof(88, 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(89, 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)],[88])).
% fof(90, 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)],[89])).
% fof(91, 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)],[90])).
% fof(92, 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)],[91])).
% cnf(97,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[92])).
% cnf(98,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(344, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4)),inference(fof_nnf,[status(thm)],[75])).
% fof(345, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((unordered_pair(X5,X6)=unordered_pair(X7,X8)&~(X5=X7))&~(X5=X8)),inference(variable_rename,[status(thm)],[344])).
% fof(346, negated_conjecture,((unordered_pair(esk14_0,esk15_0)=unordered_pair(esk16_0,esk17_0)&~(esk14_0=esk16_0))&~(esk14_0=esk17_0)),inference(skolemize,[status(esa)],[345])).
% cnf(347,negated_conjecture,(esk14_0!=esk17_0),inference(split_conjunct,[status(thm)],[346])).
% cnf(348,negated_conjecture,(esk14_0!=esk16_0),inference(split_conjunct,[status(thm)],[346])).
% cnf(349,negated_conjecture,(unordered_pair(esk14_0,esk15_0)=unordered_pair(esk16_0,esk17_0)),inference(split_conjunct,[status(thm)],[346])).
% cnf(389,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[97,theory(equality)])).
% cnf(518,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[389,theory(equality)])).
% cnf(608,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[98,theory(equality)])).
% cnf(1418,negated_conjecture,(in(esk14_0,unordered_pair(esk16_0,esk17_0))),inference(spm,[status(thm)],[518,349,theory(equality)])).
% cnf(5953,negated_conjecture,(esk16_0=esk14_0|esk17_0=esk14_0),inference(spm,[status(thm)],[608,1418,theory(equality)])).
% cnf(5971,negated_conjecture,(esk17_0=esk14_0),inference(sr,[status(thm)],[5953,348,theory(equality)])).
% cnf(5972,negated_conjecture,($false),inference(sr,[status(thm)],[5971,347,theory(equality)])).
% cnf(5973,negated_conjecture,($false),5972,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 954
% # ...of these trivial : 35
% # ...subsumed : 550
% # ...remaining for further processing: 369
% # Other redundant clauses eliminated : 104
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 5
% # Generated clauses : 4154
% # ...of the previous two non-trivial : 3156
% # Contextual simplify-reflections : 2
% # Paramodulations : 4005
% # Factorizations : 15
% # Equation resolutions : 134
% # Current number of processed clauses: 254
% # Positive orientable unit clauses: 56
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 30
% # Non-unit-clauses : 162
% # Current number of unprocessed clauses: 2281
% # ...number of literals in the above : 6721
% # Clause-clause subsumption calls (NU) : 919
% # Rec. Clause-clause subsumption calls : 889
% # Unit Clause-clause subsumption calls : 101
% # Rewrite failures with RHS unbound : 24
% # Indexed BW rewrite attempts : 114
% # Indexed BW rewrite successes : 43
% # Backwards rewriting index: 141 leaves, 1.60+/-1.496 terms/leaf
% # Paramod-from index: 78 leaves, 1.37+/-0.681 terms/leaf
% # Paramod-into index: 131 leaves, 1.54+/-1.315 terms/leaf
% # -------------------------------------------------
% # User time : 0.139 s
% # System time : 0.005 s
% # Total time : 0.144 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.30 CPU 0.39 WC
% FINAL PrfWatch: 0.30 CPU 0.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP29030/SEU151+2.tptp
%
%------------------------------------------------------------------------------