TSTP Solution File: SEU156+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU156+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 : 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:20:20 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/SystemOnTPTP29807/SEU156+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29807/SEU156+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29807/SEU156+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 29903
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(5, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(6, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(7, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3),file('/tmp/SRASS.s.p', t9_zfmisc_1)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(9, axiom,![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(15, conjecture,![X1]:![X2]:![X3]:![X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)=>(X1=X3&X2=X4)),file('/tmp/SRASS.s.p', t33_zfmisc_1)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)=>(X1=X3&X2=X4))),inference(assume_negation,[status(cth)],[15])).
% fof(19, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[19])).
% fof(29, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X1=X2),inference(fof_nnf,[status(thm)],[6])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X4=X5),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(X1=X2|singleton(X1)!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X2=X3),inference(fof_nnf,[status(thm)],[7])).
% fof(35, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X5=X6),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(X1=X2|singleton(X3)!=unordered_pair(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:![X2]:![X3]:![X4]:((~(unordered_pair(X1,X2)=unordered_pair(X3,X4))|X1=X3)|X1=X4),inference(fof_nnf,[status(thm)],[9])).
% fof(40, plain,![X5]:![X6]:![X7]:![X8]:((~(unordered_pair(X5,X6)=unordered_pair(X7,X8))|X5=X7)|X5=X8),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X3,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(50, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)&(~(X1=X3)|~(X2=X4))),inference(fof_nnf,[status(thm)],[16])).
% fof(51, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(ordered_pair(X5,X6)=ordered_pair(X7,X8)&(~(X5=X7)|~(X6=X8))),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,(ordered_pair(esk3_0,esk4_0)=ordered_pair(esk5_0,esk6_0)&(~(esk3_0=esk5_0)|~(esk4_0=esk6_0))),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(esk4_0!=esk6_0|esk3_0!=esk5_0),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(ordered_pair(esk3_0,esk4_0)=ordered_pair(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[20,30,theory(equality)]),['unfolding']).
% cnf(56,plain,(X1=X2|unordered_pair(X2,X3)!=unordered_pair(X1,X1)),inference(rw,[status(thm)],[33,30,theory(equality)]),['unfolding']).
% cnf(57,plain,(X1=X2|unordered_pair(X1,X2)!=unordered_pair(X3,X3)),inference(rw,[status(thm)],[36,30,theory(equality)]),['unfolding']).
% cnf(59,negated_conjecture,(unordered_pair(unordered_pair(esk5_0,esk6_0),unordered_pair(esk5_0,esk5_0))=unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,55,theory(equality)]),55,theory(equality)]),['unfolding']).
% cnf(67,plain,(X1=X2|unordered_pair(X1,X1)!=unordered_pair(X3,X2)),inference(spm,[status(thm)],[56,38,theory(equality)])).
% cnf(80,plain,(X1=X2|X1=X3|unordered_pair(X4,X1)!=unordered_pair(X3,X2)),inference(spm,[status(thm)],[41,38,theory(equality)])).
% cnf(82,negated_conjecture,(unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))=unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0))),inference(rw,[status(thm)],[59,38,theory(equality)])).
% cnf(83,negated_conjecture,(unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))=unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0))),inference(rw,[status(thm)],[82,38,theory(equality)])).
% cnf(88,negated_conjecture,(X1=unordered_pair(esk3_0,esk4_0)|X1=unordered_pair(esk3_0,esk3_0)|unordered_pair(X1,X2)!=unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[41,83,theory(equality)])).
% cnf(126,negated_conjecture,(X1=unordered_pair(esk3_0,esk3_0)|X1=unordered_pair(esk3_0,esk4_0)|unordered_pair(X2,X1)!=unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[80,83,theory(equality)])).
% cnf(129,negated_conjecture,(unordered_pair(esk3_0,esk4_0)=X1|unordered_pair(esk3_0,esk4_0)=X2|unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))!=unordered_pair(X1,X2)),inference(spm,[status(thm)],[80,83,theory(equality)])).
% cnf(207,negated_conjecture,(unordered_pair(esk5_0,esk5_0)=unordered_pair(esk3_0,esk3_0)|unordered_pair(esk5_0,esk5_0)=unordered_pair(esk3_0,esk4_0)),inference(er,[status(thm)],[88,theory(equality)])).
% cnf(212,negated_conjecture,(esk3_0=esk4_0|unordered_pair(esk3_0,esk3_0)=unordered_pair(esk5_0,esk5_0)|unordered_pair(esk5_0,esk5_0)!=unordered_pair(X1,X1)),inference(spm,[status(thm)],[57,207,theory(equality)])).
% cnf(278,negated_conjecture,(unordered_pair(esk5_0,esk6_0)=unordered_pair(esk3_0,esk4_0)|unordered_pair(esk5_0,esk6_0)=unordered_pair(esk3_0,esk3_0)),inference(er,[status(thm)],[126,theory(equality)])).
% cnf(316,negated_conjecture,(unordered_pair(esk3_0,esk4_0)=unordered_pair(esk5_0,esk6_0)|unordered_pair(esk3_0,esk4_0)=unordered_pair(esk5_0,esk5_0)),inference(er,[status(thm)],[129,theory(equality)])).
% cnf(321,negated_conjecture,(unordered_pair(esk3_0,esk4_0)=unordered_pair(esk5_0,esk5_0)|unordered_pair(esk5_0,esk6_0)!=unordered_pair(esk5_0,esk5_0)),inference(ef,[status(thm)],[316,theory(equality)])).
% cnf(393,negated_conjecture,(unordered_pair(esk3_0,esk3_0)=unordered_pair(esk5_0,esk5_0)|esk4_0=esk3_0),inference(er,[status(thm)],[212,theory(equality)])).
% cnf(407,negated_conjecture,(esk3_0=X1|esk4_0=esk3_0|unordered_pair(esk5_0,esk5_0)!=unordered_pair(X1,X2)),inference(spm,[status(thm)],[56,393,theory(equality)])).
% cnf(438,negated_conjecture,(esk4_0=esk3_0|esk3_0=esk5_0),inference(er,[status(thm)],[407,theory(equality)])).
% cnf(446,negated_conjecture,(unordered_pair(esk3_0,esk3_0)=unordered_pair(esk5_0,esk6_0)|esk3_0=esk5_0),inference(spm,[status(thm)],[278,438,theory(equality)])).
% cnf(455,negated_conjecture,(esk3_0=esk5_0),inference(csr,[status(thm)],[446,56])).
% cnf(463,negated_conjecture,(unordered_pair(esk5_0,esk4_0)=unordered_pair(esk5_0,esk5_0)|unordered_pair(esk5_0,esk6_0)!=unordered_pair(esk5_0,esk5_0)),inference(rw,[status(thm)],[321,455,theory(equality)])).
% cnf(499,negated_conjecture,(unordered_pair(esk5_0,esk5_0)=unordered_pair(esk5_0,esk6_0)|unordered_pair(esk3_0,esk4_0)=unordered_pair(esk5_0,esk6_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[278,455,theory(equality)]),455,theory(equality)])).
% cnf(500,negated_conjecture,(unordered_pair(esk5_0,esk5_0)=unordered_pair(esk5_0,esk6_0)|unordered_pair(esk5_0,esk4_0)=unordered_pair(esk5_0,esk6_0)),inference(rw,[status(thm)],[499,455,theory(equality)])).
% cnf(506,negated_conjecture,($false|esk4_0!=esk6_0),inference(rw,[status(thm)],[53,455,theory(equality)])).
% cnf(507,negated_conjecture,(esk4_0!=esk6_0),inference(cn,[status(thm)],[506,theory(equality)])).
% cnf(542,negated_conjecture,(X1=esk5_0|X1=esk4_0|unordered_pair(esk5_0,esk6_0)=unordered_pair(esk5_0,esk5_0)|unordered_pair(X2,X1)!=unordered_pair(esk5_0,esk6_0)),inference(spm,[status(thm)],[80,500,theory(equality)])).
% cnf(619,negated_conjecture,(unordered_pair(esk5_0,esk6_0)=unordered_pair(esk5_0,esk5_0)|esk6_0=esk4_0|esk6_0=esk5_0),inference(er,[status(thm)],[542,theory(equality)])).
% cnf(623,negated_conjecture,(unordered_pair(esk5_0,esk6_0)=unordered_pair(esk5_0,esk5_0)|esk6_0=esk5_0),inference(sr,[status(thm)],[619,507,theory(equality)])).
% cnf(624,negated_conjecture,(esk6_0=esk5_0),inference(csr,[status(thm)],[623,67])).
% cnf(628,negated_conjecture,(unordered_pair(esk5_0,esk4_0)=unordered_pair(esk5_0,esk5_0)|$false),inference(rw,[status(thm)],[463,624,theory(equality)])).
% cnf(629,negated_conjecture,(unordered_pair(esk5_0,esk4_0)=unordered_pair(esk5_0,esk5_0)),inference(cn,[status(thm)],[628,theory(equality)])).
% cnf(651,negated_conjecture,(esk4_0!=esk5_0),inference(rw,[status(thm)],[507,624,theory(equality)])).
% cnf(656,negated_conjecture,(esk5_0=esk4_0|unordered_pair(esk5_0,esk5_0)!=unordered_pair(X1,X1)),inference(spm,[status(thm)],[57,629,theory(equality)])).
% cnf(667,negated_conjecture,(unordered_pair(esk5_0,esk5_0)!=unordered_pair(X1,X1)),inference(sr,[status(thm)],[656,651,theory(equality)])).
% cnf(670,negated_conjecture,($false),inference(er,[status(thm)],[667,theory(equality)])).
% cnf(675,negated_conjecture,($false),670,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 237
% # ...of these trivial : 2
% # ...subsumed : 158
% # ...remaining for further processing: 77
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 52
% # Generated clauses : 471
% # ...of the previous two non-trivial : 488
% # Contextual simplify-reflections : 9
% # Paramodulations : 452
% # Factorizations : 3
% # Equation resolutions : 16
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 8
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 48
% # Clause-clause subsumption calls (NU) : 1169
% # Rec. Clause-clause subsumption calls : 1157
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 18 leaves, 1.83+/-2.062 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 17 leaves, 1.88+/-2.111 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.005 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP29807/SEU156+1.tptp
%
%------------------------------------------------------------------------------