TSTP Solution File: SEU187+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU187+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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:35:42 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.94s
% 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/SystemOnTPTP27463/SEU187+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27463/SEU187+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27463/SEU187+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 27559
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(11, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_dom(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X3,X4),X1)))),file('/tmp/SRASS.s.p', d4_relat_1)).
% fof(12, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X4,X3),X1)))),file('/tmp/SRASS.s.p', d5_relat_1)).
% fof(16, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(20, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(21, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(32, conjecture,(relation_dom(empty_set)=empty_set&relation_rng(empty_set)=empty_set),file('/tmp/SRASS.s.p', t60_relat_1)).
% fof(33, negated_conjecture,~((relation_dom(empty_set)=empty_set&relation_rng(empty_set)=empty_set)),inference(assume_negation,[status(cth)],[32])).
% cnf(45,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[2])).
% fof(64, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(65,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(72, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_dom(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X3,X4),X1))&(![X4]:~(in(ordered_pair(X3,X4),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X3,X4),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X3,X4),X1)))|X2=relation_dom(X1)))),inference(fof_nnf,[status(thm)],[11])).
% fof(73, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X7,X8),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X10,X11),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X10,X12),X5)))|X6=relation_dom(X5)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk5_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk5_2(X5,X6),X11),X5)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[73])).
% fof(75, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk5_2(X5,X6),X11),X5))|~(in(esk5_2(X5,X6),X6)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[74])).
% fof(76, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk5_2(X5,X6),X11),X5))|~(in(esk5_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5))|X6=relation_dom(X5))|~(relation(X5))))&((((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))|~(X6=relation_dom(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),i
% nference(distribute,[status(thm)],[75])).
% cnf(79,plain,(X2=relation_dom(X1)|in(ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),X1)|in(esk5_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(81, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X4,X3),X1))&(![X4]:~(in(ordered_pair(X4,X3),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X4,X3),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X4,X3),X1)))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(82, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X8,X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X11,X10),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X12,X10),X5)))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk7_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk8_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk8_2(X5,X6)),X5)))&(in(esk8_2(X5,X6),X6)|in(ordered_pair(esk9_2(X5,X6),esk8_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk8_2(X5,X6)),X5))|~(in(esk8_2(X5,X6),X6)))&(in(esk8_2(X5,X6),X6)|in(ordered_pair(esk9_2(X5,X6),esk8_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk7_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[83])).
% fof(85, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk8_2(X5,X6)),X5))|~(in(esk8_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk8_2(X5,X6),X6)|in(ordered_pair(esk9_2(X5,X6),esk8_2(X5,X6)),X5))|X6=relation_rng(X5))|~(relation(X5))))&((((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))|~(X6=relation_rng(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(esk7_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[84])).
% cnf(88,plain,(X2=relation_rng(X1)|in(ordered_pair(esk9_2(X1,X2),esk8_2(X1,X2)),X1)|in(esk8_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[85])).
% cnf(98,plain,(relation(empty_set)),inference(split_conjunct,[status(thm)],[16])).
% fof(110, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(111, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[110])).
% cnf(112,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(113, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[21])).
% cnf(114,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[113])).
% fof(130, negated_conjecture,(~(relation_dom(empty_set)=empty_set)|~(relation_rng(empty_set)=empty_set)),inference(fof_nnf,[status(thm)],[33])).
% cnf(131,negated_conjecture,(relation_rng(empty_set)!=empty_set|relation_dom(empty_set)!=empty_set),inference(split_conjunct,[status(thm)],[130])).
% cnf(132,plain,(relation_dom(X1)=X2|in(esk5_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),singleton(esk5_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[79,114,theory(equality)]),['unfolding']).
% cnf(133,plain,(relation_rng(X1)=X2|in(esk8_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk9_2(X1,X2),esk8_2(X1,X2)),singleton(esk9_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[88,114,theory(equality)]),['unfolding']).
% cnf(164,plain,(relation_dom(X1)=X2|in(esk5_2(X1,X2),X2)|in(unordered_pair(singleton(esk5_2(X1,X2)),unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[132,65,theory(equality)])).
% cnf(167,plain,(relation_dom(empty_set)=X1|in(unordered_pair(singleton(esk5_2(empty_set,X1)),unordered_pair(esk5_2(empty_set,X1),esk6_2(empty_set,X1))),empty_set)|in(esk5_2(empty_set,X1),X1)),inference(spm,[status(thm)],[164,98,theory(equality)])).
% cnf(168,plain,(relation_rng(X1)=X2|in(esk8_2(X1,X2),X2)|in(unordered_pair(singleton(esk9_2(X1,X2)),unordered_pair(esk8_2(X1,X2),esk9_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[133,65,theory(equality)]),65,theory(equality)])).
% cnf(171,plain,(relation_rng(empty_set)=X1|in(unordered_pair(singleton(esk9_2(empty_set,X1)),unordered_pair(esk8_2(empty_set,X1),esk9_2(empty_set,X1))),empty_set)|in(esk8_2(empty_set,X1),X1)),inference(spm,[status(thm)],[168,98,theory(equality)])).
% cnf(284,plain,(relation_dom(empty_set)=X1|in(esk5_2(empty_set,X1),X1)|~empty(empty_set)),inference(spm,[status(thm)],[112,167,theory(equality)])).
% cnf(291,plain,(relation_dom(empty_set)=X1|in(esk5_2(empty_set,X1),X1)|$false),inference(rw,[status(thm)],[284,45,theory(equality)])).
% cnf(292,plain,(relation_dom(empty_set)=X1|in(esk5_2(empty_set,X1),X1)),inference(cn,[status(thm)],[291,theory(equality)])).
% cnf(297,plain,(relation_dom(empty_set)=X1|~empty(X1)),inference(spm,[status(thm)],[112,292,theory(equality)])).
% cnf(302,plain,(relation_dom(empty_set)=empty_set),inference(spm,[status(thm)],[297,45,theory(equality)])).
% cnf(306,negated_conjecture,($false|relation_rng(empty_set)!=empty_set),inference(rw,[status(thm)],[131,302,theory(equality)])).
% cnf(307,negated_conjecture,(relation_rng(empty_set)!=empty_set),inference(cn,[status(thm)],[306,theory(equality)])).
% cnf(344,plain,(relation_rng(empty_set)=X1|in(esk8_2(empty_set,X1),X1)|~empty(empty_set)),inference(spm,[status(thm)],[112,171,theory(equality)])).
% cnf(351,plain,(relation_rng(empty_set)=X1|in(esk8_2(empty_set,X1),X1)|$false),inference(rw,[status(thm)],[344,45,theory(equality)])).
% cnf(352,plain,(relation_rng(empty_set)=X1|in(esk8_2(empty_set,X1),X1)),inference(cn,[status(thm)],[351,theory(equality)])).
% cnf(365,plain,(relation_rng(empty_set)=X1|~empty(X1)),inference(spm,[status(thm)],[112,352,theory(equality)])).
% cnf(370,plain,(relation_rng(empty_set)=empty_set),inference(spm,[status(thm)],[365,45,theory(equality)])).
% cnf(371,plain,($false),inference(sr,[status(thm)],[370,307,theory(equality)])).
% cnf(372,plain,($false),371,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 131
% # ...of these trivial : 2
% # ...subsumed : 49
% # ...remaining for further processing: 80
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 8
% # Generated clauses : 179
% # ...of the previous two non-trivial : 173
% # Contextual simplify-reflections : 9
% # Paramodulations : 172
% # Factorizations : 6
% # Equation resolutions : 1
% # Current number of processed clauses: 70
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 57
% # Current number of unprocessed clauses: 52
% # ...number of literals in the above : 208
% # Clause-clause subsumption calls (NU) : 241
% # Rec. Clause-clause subsumption calls : 163
% # 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: 92 leaves, 1.42+/-1.106 terms/leaf
% # Paramod-from index: 23 leaves, 1.17+/-0.379 terms/leaf
% # Paramod-into index: 75 leaves, 1.33+/-0.899 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.003 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP27463/SEU187+1.tptp
%
%------------------------------------------------------------------------------