TSTP Solution File: SEU177+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU177+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 : 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:39 EST 2010
% Result : Theorem 2.70s
% Output : Solution 2.70s
% 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/SystemOnTPTP21879/SEU177+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21879/SEU177+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21879/SEU177+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 21975
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 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(22, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(60, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(105, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(142, 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(143, 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)],[142])).
% fof(168, 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(169, 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)],[168])).
% fof(170, 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)],[169])).
% fof(171, 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)],[170])).
% fof(172, 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)],[171])).
% cnf(174,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[172])).
% fof(177, 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(178, 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)],[177])).
% fof(179, 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)],[178])).
% fof(180, 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)],[179])).
% fof(181, 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)],[180])).
% cnf(183,plain,(in(X3,X2)|~relation(X1)|X2!=relation_rng(X1)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[181])).
% fof(270, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[22])).
% cnf(271,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[270])).
% fof(463, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[60])).
% cnf(464,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[463])).
% fof(600, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[105])).
% cnf(601,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[600])).
% fof(700, 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)],[143])).
% fof(701, 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)],[700])).
% fof(702, negated_conjecture,(relation(esk42_0)&(in(ordered_pair(esk40_0,esk41_0),esk42_0)&(~(in(esk40_0,relation_dom(esk42_0)))|~(in(esk41_0,relation_rng(esk42_0)))))),inference(skolemize,[status(esa)],[701])).
% cnf(703,negated_conjecture,(~in(esk41_0,relation_rng(esk42_0))|~in(esk40_0,relation_dom(esk42_0))),inference(split_conjunct,[status(thm)],[702])).
% cnf(704,negated_conjecture,(in(ordered_pair(esk40_0,esk41_0),esk42_0)),inference(split_conjunct,[status(thm)],[702])).
% cnf(705,negated_conjecture,(relation(esk42_0)),inference(split_conjunct,[status(thm)],[702])).
% cnf(710,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[464,601,theory(equality)]),['unfolding']).
% cnf(754,negated_conjecture,(in(unordered_pair(unordered_pair(esk40_0,esk41_0),unordered_pair(esk40_0,esk40_0)),esk42_0)),inference(rw,[status(thm)],[704,710,theory(equality)]),['unfolding']).
% cnf(767,plain,(in(X3,X2)|relation_dom(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X3,X4),unordered_pair(X3,X3)),X1)),inference(rw,[status(thm)],[174,710,theory(equality)]),['unfolding']).
% cnf(768,plain,(in(X3,X2)|relation_rng(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X3),unordered_pair(X4,X4)),X1)),inference(rw,[status(thm)],[183,710,theory(equality)]),['unfolding']).
% cnf(777,negated_conjecture,(in(unordered_pair(unordered_pair(esk40_0,esk40_0),unordered_pair(esk40_0,esk41_0)),esk42_0)),inference(rw,[status(thm)],[754,271,theory(equality)])).
% cnf(1451,plain,(in(X1,X2)|relation_dom(X3)!=X2|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X4)),X3)),inference(spm,[status(thm)],[767,271,theory(equality)])).
% cnf(1461,plain,(in(X1,X2)|relation_rng(X3)!=X2|~relation(X3)|~in(unordered_pair(unordered_pair(X4,X4),unordered_pair(X4,X1)),X3)),inference(spm,[status(thm)],[768,271,theory(equality)])).
% cnf(23387,negated_conjecture,(in(esk40_0,X1)|relation_dom(esk42_0)!=X1|~relation(esk42_0)),inference(spm,[status(thm)],[1451,777,theory(equality)])).
% cnf(23398,negated_conjecture,(in(esk40_0,X1)|relation_dom(esk42_0)!=X1|$false),inference(rw,[status(thm)],[23387,705,theory(equality)])).
% cnf(23399,negated_conjecture,(in(esk40_0,X1)|relation_dom(esk42_0)!=X1),inference(cn,[status(thm)],[23398,theory(equality)])).
% cnf(23400,negated_conjecture,(in(esk40_0,relation_dom(esk42_0))),inference(er,[status(thm)],[23399,theory(equality)])).
% cnf(23427,negated_conjecture,($false|~in(esk41_0,relation_rng(esk42_0))),inference(rw,[status(thm)],[703,23400,theory(equality)])).
% cnf(23428,negated_conjecture,(~in(esk41_0,relation_rng(esk42_0))),inference(cn,[status(thm)],[23427,theory(equality)])).
% cnf(24078,negated_conjecture,(in(esk41_0,X1)|relation_rng(esk42_0)!=X1|~relation(esk42_0)),inference(spm,[status(thm)],[1461,777,theory(equality)])).
% cnf(24089,negated_conjecture,(in(esk41_0,X1)|relation_rng(esk42_0)!=X1|$false),inference(rw,[status(thm)],[24078,705,theory(equality)])).
% cnf(24090,negated_conjecture,(in(esk41_0,X1)|relation_rng(esk42_0)!=X1),inference(cn,[status(thm)],[24089,theory(equality)])).
% cnf(24091,negated_conjecture,(in(esk41_0,relation_rng(esk42_0))),inference(er,[status(thm)],[24090,theory(equality)])).
% cnf(24094,negated_conjecture,($false),inference(sr,[status(thm)],[24091,23428,theory(equality)])).
% cnf(24095,negated_conjecture,($false),24094,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4639
% # ...of these trivial : 30
% # ...subsumed : 3191
% # ...remaining for further processing: 1418
% # Other redundant clauses eliminated : 120
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 24
% # Generated clauses : 20583
% # ...of the previous two non-trivial : 19582
% # Contextual simplify-reflections : 85
% # Paramodulations : 20365
% # Factorizations : 15
% # Equation resolutions : 203
% # Current number of processed clauses: 1184
% # Positive orientable unit clauses: 105
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 350
% # Non-unit-clauses : 725
% # Current number of unprocessed clauses: 15019
% # ...number of literals in the above : 50501
% # Clause-clause subsumption calls (NU) : 17229
% # Rec. Clause-clause subsumption calls : 15940
% # Unit Clause-clause subsumption calls : 5810
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 119
% # Indexed BW rewrite successes : 75
% # Backwards rewriting index: 819 leaves, 1.54+/-1.602 terms/leaf
% # Paramod-from index: 200 leaves, 1.26+/-0.659 terms/leaf
% # Paramod-into index: 768 leaves, 1.49+/-1.413 terms/leaf
% # -------------------------------------------------
% # User time : 0.846 s
% # System time : 0.028 s
% # Total time : 0.874 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.30 CPU 1.38 WC
% FINAL PrfWatch: 1.30 CPU 1.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP21879/SEU177+2.tptp
%
%------------------------------------------------------------------------------