TSTP Solution File: SET988+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET988+1 : TPTP v5.0.0. Released v3.2.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 00:35:01 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP7390/SET988+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7390/SET988+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7390/SET988+1.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 7522
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(function(X1)<=>![X2]:![X3]:![X4]:((in(ordered_pair(X2,X3),X1)&in(ordered_pair(X2,X4),X1))=>X3=X4)),file('/tmp/SRASS.s.p', d1_funct_1)).
% fof(4, axiom,![X1]:(relation(X1)<=>![X2]:~((in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4))))),file('/tmp/SRASS.s.p', d1_relat_1)).
% fof(17, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(18, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(33, conjecture,![X1]:((![X2]:~((in(X2,X1)&![X3]:![X4]:~(ordered_pair(X3,X4)=X2)))&![X2]:![X3]:![X4]:((in(ordered_pair(X2,X3),X1)&in(ordered_pair(X2,X4),X1))=>X3=X4))=>(relation(X1)&function(X1))),file('/tmp/SRASS.s.p', t2_funct_1)).
% fof(34, negated_conjecture,~(![X1]:((![X2]:~((in(X2,X1)&![X3]:![X4]:~(ordered_pair(X3,X4)=X2)))&![X2]:![X3]:![X4]:((in(ordered_pair(X2,X3),X1)&in(ordered_pair(X2,X4),X1))=>X3=X4))=>(relation(X1)&function(X1)))),inference(assume_negation,[status(cth)],[33])).
% fof(50, plain,![X1]:((~(function(X1))|![X2]:![X3]:![X4]:((~(in(ordered_pair(X2,X3),X1))|~(in(ordered_pair(X2,X4),X1)))|X3=X4))&(?[X2]:?[X3]:?[X4]:((in(ordered_pair(X2,X3),X1)&in(ordered_pair(X2,X4),X1))&~(X3=X4))|function(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(51, plain,![X5]:((~(function(X5))|![X6]:![X7]:![X8]:((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X6,X8),X5)))|X7=X8))&(?[X9]:?[X10]:?[X11]:((in(ordered_pair(X9,X10),X5)&in(ordered_pair(X9,X11),X5))&~(X10=X11))|function(X5))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X5]:((~(function(X5))|![X6]:![X7]:![X8]:((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X6,X8),X5)))|X7=X8))&(((in(ordered_pair(esk2_1(X5),esk3_1(X5)),X5)&in(ordered_pair(esk2_1(X5),esk4_1(X5)),X5))&~(esk3_1(X5)=esk4_1(X5)))|function(X5))),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X6,X8),X5)))|X7=X8)|~(function(X5)))&(((in(ordered_pair(esk2_1(X5),esk3_1(X5)),X5)&in(ordered_pair(esk2_1(X5),esk4_1(X5)),X5))&~(esk3_1(X5)=esk4_1(X5)))|function(X5))),inference(shift_quantors,[status(thm)],[52])).
% fof(54, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X6,X8),X5)))|X7=X8)|~(function(X5)))&(((in(ordered_pair(esk2_1(X5),esk3_1(X5)),X5)|function(X5))&(in(ordered_pair(esk2_1(X5),esk4_1(X5)),X5)|function(X5)))&(~(esk3_1(X5)=esk4_1(X5))|function(X5)))),inference(distribute,[status(thm)],[53])).
% cnf(55,plain,(function(X1)|esk3_1(X1)!=esk4_1(X1)),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(function(X1)|in(ordered_pair(esk2_1(X1),esk4_1(X1)),X1)),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,plain,(function(X1)|in(ordered_pair(esk2_1(X1),esk3_1(X1)),X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(59, plain,![X1]:((~(relation(X1))|![X2]:(~(in(X2,X1))|?[X3]:?[X4]:X2=ordered_pair(X3,X4)))&(?[X2]:(in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4)))|relation(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(60, plain,![X5]:((~(relation(X5))|![X6]:(~(in(X6,X5))|?[X7]:?[X8]:X6=ordered_pair(X7,X8)))&(?[X9]:(in(X9,X5)&![X10]:![X11]:~(X9=ordered_pair(X10,X11)))|relation(X5))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X5]:((~(relation(X5))|![X6]:(~(in(X6,X5))|X6=ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6))))&((in(esk7_1(X5),X5)&![X10]:![X11]:~(esk7_1(X5)=ordered_pair(X10,X11)))|relation(X5))),inference(skolemize,[status(esa)],[60])).
% fof(62, plain,![X5]:![X6]:![X10]:![X11]:(((~(esk7_1(X5)=ordered_pair(X10,X11))&in(esk7_1(X5),X5))|relation(X5))&((~(in(X6,X5))|X6=ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)))|~(relation(X5)))),inference(shift_quantors,[status(thm)],[61])).
% fof(63, plain,![X5]:![X6]:![X10]:![X11]:(((~(esk7_1(X5)=ordered_pair(X10,X11))|relation(X5))&(in(esk7_1(X5),X5)|relation(X5)))&((~(in(X6,X5))|X6=ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)))|~(relation(X5)))),inference(distribute,[status(thm)],[62])).
% cnf(65,plain,(relation(X1)|in(esk7_1(X1),X1)),inference(split_conjunct,[status(thm)],[63])).
% cnf(66,plain,(relation(X1)|esk7_1(X1)!=ordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[63])).
% fof(102, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[17])).
% cnf(103,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[102])).
% fof(104, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[18])).
% cnf(105,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(149, negated_conjecture,?[X1]:((![X2]:(~(in(X2,X1))|?[X3]:?[X4]:ordered_pair(X3,X4)=X2)&![X2]:![X3]:![X4]:((~(in(ordered_pair(X2,X3),X1))|~(in(ordered_pair(X2,X4),X1)))|X3=X4))&(~(relation(X1))|~(function(X1)))),inference(fof_nnf,[status(thm)],[34])).
% fof(150, negated_conjecture,?[X5]:((![X6]:(~(in(X6,X5))|?[X7]:?[X8]:ordered_pair(X7,X8)=X6)&![X9]:![X10]:![X11]:((~(in(ordered_pair(X9,X10),X5))|~(in(ordered_pair(X9,X11),X5)))|X10=X11))&(~(relation(X5))|~(function(X5)))),inference(variable_rename,[status(thm)],[149])).
% fof(151, negated_conjecture,((![X6]:(~(in(X6,esk16_0))|ordered_pair(esk17_1(X6),esk18_1(X6))=X6)&![X9]:![X10]:![X11]:((~(in(ordered_pair(X9,X10),esk16_0))|~(in(ordered_pair(X9,X11),esk16_0)))|X10=X11))&(~(relation(esk16_0))|~(function(esk16_0)))),inference(skolemize,[status(esa)],[150])).
% fof(152, negated_conjecture,![X6]:![X9]:![X10]:![X11]:((((~(in(ordered_pair(X9,X10),esk16_0))|~(in(ordered_pair(X9,X11),esk16_0)))|X10=X11)&(~(in(X6,esk16_0))|ordered_pair(esk17_1(X6),esk18_1(X6))=X6))&(~(relation(esk16_0))|~(function(esk16_0)))),inference(shift_quantors,[status(thm)],[151])).
% cnf(153,negated_conjecture,(~function(esk16_0)|~relation(esk16_0)),inference(split_conjunct,[status(thm)],[152])).
% cnf(154,negated_conjecture,(ordered_pair(esk17_1(X1),esk18_1(X1))=X1|~in(X1,esk16_0)),inference(split_conjunct,[status(thm)],[152])).
% cnf(155,negated_conjecture,(X1=X2|~in(ordered_pair(X3,X2),esk16_0)|~in(ordered_pair(X3,X1),esk16_0)),inference(split_conjunct,[status(thm)],[152])).
% cnf(156,plain,(function(X1)|in(unordered_pair(unordered_pair(esk2_1(X1),esk3_1(X1)),singleton(esk2_1(X1))),X1)),inference(rw,[status(thm)],[57,103,theory(equality)]),['unfolding']).
% cnf(157,plain,(function(X1)|in(unordered_pair(unordered_pair(esk2_1(X1),esk4_1(X1)),singleton(esk2_1(X1))),X1)),inference(rw,[status(thm)],[56,103,theory(equality)]),['unfolding']).
% cnf(158,plain,(relation(X1)|unordered_pair(unordered_pair(X2,X3),singleton(X2))!=esk7_1(X1)),inference(rw,[status(thm)],[66,103,theory(equality)]),['unfolding']).
% cnf(159,negated_conjecture,(unordered_pair(unordered_pair(esk17_1(X1),esk18_1(X1)),singleton(esk17_1(X1)))=X1|~in(X1,esk16_0)),inference(rw,[status(thm)],[154,103,theory(equality)]),['unfolding']).
% cnf(160,negated_conjecture,(X1=X2|~in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),esk16_0)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),esk16_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[155,103,theory(equality)]),103,theory(equality)]),['unfolding']).
% cnf(175,plain,(relation(X1)|unordered_pair(singleton(X2),unordered_pair(X2,X3))!=esk7_1(X1)),inference(spm,[status(thm)],[158,105,theory(equality)])).
% cnf(187,negated_conjecture,(unordered_pair(singleton(esk17_1(X1)),unordered_pair(esk17_1(X1),esk18_1(X1)))=X1|~in(X1,esk16_0)),inference(rw,[status(thm)],[159,105,theory(equality)])).
% cnf(193,negated_conjecture,(X1=X2|~in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),esk16_0)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),esk16_0)),inference(spm,[status(thm)],[160,105,theory(equality)])).
% cnf(219,plain,(function(X1)|in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1)),inference(rw,[status(thm)],[156,105,theory(equality)])).
% cnf(222,plain,(function(X1)|in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk4_1(X1))),X1)),inference(rw,[status(thm)],[157,105,theory(equality)])).
% cnf(265,negated_conjecture,(relation(X1)|X2!=esk7_1(X1)|~in(X2,esk16_0)),inference(spm,[status(thm)],[175,187,theory(equality)])).
% cnf(282,negated_conjecture,(relation(X1)|relation(esk16_0)|esk7_1(esk16_0)!=esk7_1(X1)),inference(spm,[status(thm)],[265,65,theory(equality)])).
% cnf(320,negated_conjecture,(relation(esk16_0)),inference(er,[status(thm)],[282,theory(equality)])).
% cnf(323,negated_conjecture,(~function(esk16_0)|$false),inference(rw,[status(thm)],[153,320,theory(equality)])).
% cnf(324,negated_conjecture,(~function(esk16_0)),inference(cn,[status(thm)],[323,theory(equality)])).
% cnf(358,negated_conjecture,(X1=esk3_1(esk16_0)|function(esk16_0)|~in(unordered_pair(unordered_pair(esk2_1(esk16_0),X1),singleton(esk2_1(esk16_0))),esk16_0)),inference(spm,[status(thm)],[193,219,theory(equality)])).
% cnf(361,negated_conjecture,(X1=esk3_1(esk16_0)|~in(unordered_pair(unordered_pair(esk2_1(esk16_0),X1),singleton(esk2_1(esk16_0))),esk16_0)),inference(sr,[status(thm)],[358,324,theory(equality)])).
% cnf(600,negated_conjecture,(X1=esk3_1(esk16_0)|~in(unordered_pair(singleton(esk2_1(esk16_0)),unordered_pair(esk2_1(esk16_0),X1)),esk16_0)),inference(spm,[status(thm)],[361,105,theory(equality)])).
% cnf(615,negated_conjecture,(esk4_1(esk16_0)=esk3_1(esk16_0)|function(esk16_0)),inference(spm,[status(thm)],[600,222,theory(equality)])).
% cnf(616,negated_conjecture,(esk4_1(esk16_0)=esk3_1(esk16_0)),inference(sr,[status(thm)],[615,324,theory(equality)])).
% cnf(617,negated_conjecture,(function(esk16_0)),inference(spm,[status(thm)],[55,616,theory(equality)])).
% cnf(621,negated_conjecture,($false),inference(sr,[status(thm)],[617,324,theory(equality)])).
% cnf(622,negated_conjecture,($false),621,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 310
% # ...of these trivial : 4
% # ...subsumed : 153
% # ...remaining for further processing: 153
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 13
% # Generated clauses : 366
% # ...of the previous two non-trivial : 348
% # Contextual simplify-reflections : 7
% # Paramodulations : 359
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 137
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 20
% # Non-unit-clauses : 92
% # Current number of unprocessed clauses: 72
% # ...number of literals in the above : 269
% # Clause-clause subsumption calls (NU) : 1150
% # Rec. Clause-clause subsumption calls : 793
% # Unit Clause-clause subsumption calls : 281
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 131 leaves, 1.80+/-1.660 terms/leaf
% # Paramod-from index: 44 leaves, 1.07+/-0.252 terms/leaf
% # Paramod-into index: 127 leaves, 1.68+/-1.419 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.006 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP7390/SET988+1.tptp
%
%------------------------------------------------------------------------------