TSTP Solution File: SEU149+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU149+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 : art09.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:19:10 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP6665/SEU149+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6665/SEU149+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6665/SEU149+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 6761
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(3, axiom,![X1]:![X2]:(subset(singleton(X1),singleton(X2))=>X1=X2),file('/tmp/SRASS.s.p', t6_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(23, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(72, conjecture,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(73, negated_conjecture,~(![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2)),inference(assume_negation,[status(cth)],[72])).
% fof(86, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[2])).
% cnf(87,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[86])).
% fof(88, plain,![X1]:![X2]:(~(subset(singleton(X1),singleton(X2)))|X1=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(89, plain,![X3]:![X4]:(~(subset(singleton(X3),singleton(X4)))|X3=X4),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(X1=X2|~subset(singleton(X1),singleton(X2))),inference(split_conjunct,[status(thm)],[89])).
% fof(91, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(92, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[92])).
% fof(94, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk1_3(X5,X6,X7)=X5)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk1_3(X5,X6,X7)=X6)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[94])).
% cnf(100,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[95])).
% fof(164, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[23])).
% fof(165, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[164])).
% cnf(166,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[165])).
% fof(336, negated_conjecture,?[X1]:?[X2]:?[X3]:(singleton(X1)=unordered_pair(X2,X3)&~(X1=X2)),inference(fof_nnf,[status(thm)],[73])).
% fof(337, negated_conjecture,?[X4]:?[X5]:?[X6]:(singleton(X4)=unordered_pair(X5,X6)&~(X4=X5)),inference(variable_rename,[status(thm)],[336])).
% fof(338, negated_conjecture,(singleton(esk14_0)=unordered_pair(esk15_0,esk16_0)&~(esk14_0=esk15_0)),inference(skolemize,[status(esa)],[337])).
% cnf(339,negated_conjecture,(esk14_0!=esk15_0),inference(split_conjunct,[status(thm)],[338])).
% cnf(340,negated_conjecture,(singleton(esk14_0)=unordered_pair(esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[338])).
% cnf(342,negated_conjecture,(unordered_pair(esk15_0,esk16_0)=unordered_pair(esk14_0,esk14_0)),inference(rw,[status(thm)],[340,87,theory(equality)]),['unfolding']).
% cnf(345,plain,(X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[90,87,theory(equality)]),87,theory(equality)]),['unfolding']).
% cnf(348,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[166,87,theory(equality)]),['unfolding']).
% cnf(379,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[100,theory(equality)])).
% cnf(474,plain,(X1=X2|~in(X1,unordered_pair(X2,X2))),inference(spm,[status(thm)],[345,348,theory(equality)])).
% cnf(542,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[379,theory(equality)])).
% cnf(1370,negated_conjecture,(in(esk15_0,unordered_pair(esk14_0,esk14_0))),inference(spm,[status(thm)],[542,342,theory(equality)])).
% cnf(3136,negated_conjecture,(esk15_0=esk14_0),inference(spm,[status(thm)],[474,1370,theory(equality)])).
% cnf(3154,negated_conjecture,($false),inference(sr,[status(thm)],[3136,339,theory(equality)])).
% cnf(3155,negated_conjecture,($false),3154,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 540
% # ...of these trivial : 18
% # ...subsumed : 231
% # ...remaining for further processing: 291
% # Other redundant clauses eliminated : 64
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 4
% # Generated clauses : 2155
% # ...of the previous two non-trivial : 1691
% # Contextual simplify-reflections : 0
% # Paramodulations : 2056
% # Factorizations : 14
% # Equation resolutions : 85
% # Current number of processed clauses: 180
% # Positive orientable unit clauses: 44
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 24
% # Non-unit-clauses : 107
% # Current number of unprocessed clauses: 1261
% # ...number of literals in the above : 3802
% # Clause-clause subsumption calls (NU) : 380
% # Rec. Clause-clause subsumption calls : 362
% # Unit Clause-clause subsumption calls : 76
% # Rewrite failures with RHS unbound : 18
% # Indexed BW rewrite attempts : 101
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 115 leaves, 1.58+/-1.480 terms/leaf
% # Paramod-from index: 65 leaves, 1.34+/-0.615 terms/leaf
% # Paramod-into index: 111 leaves, 1.48+/-1.192 terms/leaf
% # -------------------------------------------------
% # User time : 0.081 s
% # System time : 0.007 s
% # Total time : 0.088 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP6665/SEU149+2.tptp
%
%------------------------------------------------------------------------------