TSTP Solution File: SEU177+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU177+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:27:12 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP21620/SEU177+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21620/SEU177+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21620/SEU177+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 21716
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(3, 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(13, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(26, conjecture,![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),file('/tmp/SRASS.s.p', t20_relat_1)).
% fof(27, negated_conjecture,~(![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_dom(X3))&in(X2,relation_rng(X3)))))),inference(assume_negation,[status(cth)],[26])).
% fof(36, 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)],[2])).
% fof(37, 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)],[36])).
% fof(38, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk1_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk2_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk2_2(X5,X6),X11),X5)))&(in(esk2_2(X5,X6),X6)|in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk2_2(X5,X6),X11),X5))|~(in(esk2_2(X5,X6),X6)))&(in(esk2_2(X5,X6),X6)|in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk1_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk2_2(X5,X6),X11),X5))|~(in(esk2_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk2_2(X5,X6),X6)|in(ordered_pair(esk2_2(X5,X6),esk3_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,esk1_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[39])).
% cnf(42,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(45, 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)],[3])).
% fof(46, 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)],[45])).
% fof(47, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk4_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk5_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk5_2(X5,X6)),X5)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk5_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk5_2(X5,X6)),X5))|~(in(esk5_2(X5,X6),X6)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk5_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk4_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[47])).
% fof(49, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk5_2(X5,X6)),X5))|~(in(esk5_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk5_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk5_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(esk4_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[48])).
% cnf(51,plain,(in(X3,X2)|~relation(X1)|X2!=relation_rng(X1)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(81, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[13])).
% cnf(82,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[81])).
% fof(100, negated_conjecture,?[X1]:?[X2]:?[X3]:(relation(X3)&(in(ordered_pair(X1,X2),X3)&(~(in(X1,relation_dom(X3)))|~(in(X2,relation_rng(X3)))))),inference(fof_nnf,[status(thm)],[27])).
% fof(101, negated_conjecture,?[X4]:?[X5]:?[X6]:(relation(X6)&(in(ordered_pair(X4,X5),X6)&(~(in(X4,relation_dom(X6)))|~(in(X5,relation_rng(X6)))))),inference(variable_rename,[status(thm)],[100])).
% fof(102, negated_conjecture,(relation(esk13_0)&(in(ordered_pair(esk11_0,esk12_0),esk13_0)&(~(in(esk11_0,relation_dom(esk13_0)))|~(in(esk12_0,relation_rng(esk13_0)))))),inference(skolemize,[status(esa)],[101])).
% cnf(103,negated_conjecture,(~in(esk12_0,relation_rng(esk13_0))|~in(esk11_0,relation_dom(esk13_0))),inference(split_conjunct,[status(thm)],[102])).
% cnf(104,negated_conjecture,(in(ordered_pair(esk11_0,esk12_0),esk13_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(105,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(106,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(rw,[status(thm)],[104,82,theory(equality)]),['unfolding']).
% cnf(109,plain,(in(X3,X2)|relation_dom(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)),inference(rw,[status(thm)],[42,82,theory(equality)]),['unfolding']).
% cnf(110,plain,(in(X3,X2)|relation_rng(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)),inference(rw,[status(thm)],[51,82,theory(equality)]),['unfolding']).
% cnf(135,negated_conjecture,(in(esk11_0,X1)|relation_dom(esk13_0)!=X1|~relation(esk13_0)),inference(spm,[status(thm)],[109,106,theory(equality)])).
% cnf(136,negated_conjecture,(in(esk12_0,X1)|relation_rng(esk13_0)!=X1|~relation(esk13_0)),inference(spm,[status(thm)],[110,106,theory(equality)])).
% cnf(137,negated_conjecture,(in(esk11_0,X1)|relation_dom(esk13_0)!=X1|$false),inference(rw,[status(thm)],[135,105,theory(equality)])).
% cnf(138,negated_conjecture,(in(esk11_0,X1)|relation_dom(esk13_0)!=X1),inference(cn,[status(thm)],[137,theory(equality)])).
% cnf(139,negated_conjecture,(in(esk12_0,X1)|relation_rng(esk13_0)!=X1|$false),inference(rw,[status(thm)],[136,105,theory(equality)])).
% cnf(140,negated_conjecture,(in(esk12_0,X1)|relation_rng(esk13_0)!=X1),inference(cn,[status(thm)],[139,theory(equality)])).
% cnf(169,negated_conjecture,(in(esk11_0,relation_dom(esk13_0))),inference(er,[status(thm)],[138,theory(equality)])).
% cnf(170,negated_conjecture,(in(esk12_0,relation_rng(esk13_0))),inference(er,[status(thm)],[140,theory(equality)])).
% cnf(176,negated_conjecture,($false|~in(esk12_0,relation_rng(esk13_0))),inference(rw,[status(thm)],[103,169,theory(equality)])).
% cnf(177,negated_conjecture,(~in(esk12_0,relation_rng(esk13_0))),inference(cn,[status(thm)],[176,theory(equality)])).
% cnf(191,negated_conjecture,($false),inference(rw,[status(thm)],[177,170,theory(equality)])).
% cnf(192,negated_conjecture,($false),inference(cn,[status(thm)],[191,theory(equality)])).
% cnf(193,negated_conjecture,($false),192,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 48
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 43
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 58
% # ...of the previous two non-trivial : 56
% # Contextual simplify-reflections : 0
% # Paramodulations : 56
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 105
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 17
% # 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: 68 leaves, 1.35+/-0.871 terms/leaf
% # Paramod-from index: 13 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-into index: 47 leaves, 1.28+/-0.764 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.005 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP21620/SEU177+1.tptp
%
%------------------------------------------------------------------------------