TSTP Solution File: SEU160+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU160+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 : art06.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:21:41 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP21190/SEU160+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21190/SEU160+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21190/SEU160+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 21286
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.024 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(6, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(20, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(21, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(29, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(35, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(90, conjecture,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', t39_zfmisc_1)).
% fof(91, negated_conjecture,~(![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2)))),inference(assume_negation,[status(cth)],[90])).
% fof(112, plain,![X1]:![X2]:((~(subset(X1,singleton(X2)))|(X1=empty_set|X1=singleton(X2)))&((~(X1=empty_set)&~(X1=singleton(X2)))|subset(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(113, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)&~(X3=singleton(X4)))|subset(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)|subset(X3,singleton(X4)))&(~(X3=singleton(X4))|subset(X3,singleton(X4))))),inference(distribute,[status(thm)],[113])).
% cnf(115,plain,(subset(X1,singleton(X2))|X1!=singleton(X2)),inference(split_conjunct,[status(thm)],[114])).
% cnf(116,plain,(subset(X1,singleton(X2))|X1!=empty_set),inference(split_conjunct,[status(thm)],[114])).
% cnf(117,plain,(X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[114])).
% fof(123, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[6])).
% cnf(124,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(171, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[20])).
% fof(172, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[171])).
% cnf(173,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[172])).
% fof(174, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[21])).
% cnf(175,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[174])).
% fof(200, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[29])).
% cnf(201,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[200])).
% fof(212, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[35])).
% fof(213, plain,empty(esk3_0),inference(skolemize,[status(esa)],[212])).
% cnf(214,plain,(empty(esk3_0)),inference(split_conjunct,[status(thm)],[213])).
% fof(429, negated_conjecture,?[X1]:?[X2]:((~(subset(X1,singleton(X2)))|(~(X1=empty_set)&~(X1=singleton(X2))))&(subset(X1,singleton(X2))|(X1=empty_set|X1=singleton(X2)))),inference(fof_nnf,[status(thm)],[91])).
% fof(430, negated_conjecture,?[X3]:?[X4]:((~(subset(X3,singleton(X4)))|(~(X3=empty_set)&~(X3=singleton(X4))))&(subset(X3,singleton(X4))|(X3=empty_set|X3=singleton(X4)))),inference(variable_rename,[status(thm)],[429])).
% fof(431, negated_conjecture,((~(subset(esk22_0,singleton(esk23_0)))|(~(esk22_0=empty_set)&~(esk22_0=singleton(esk23_0))))&(subset(esk22_0,singleton(esk23_0))|(esk22_0=empty_set|esk22_0=singleton(esk23_0)))),inference(skolemize,[status(esa)],[430])).
% fof(432, negated_conjecture,(((~(esk22_0=empty_set)|~(subset(esk22_0,singleton(esk23_0))))&(~(esk22_0=singleton(esk23_0))|~(subset(esk22_0,singleton(esk23_0)))))&(subset(esk22_0,singleton(esk23_0))|(esk22_0=empty_set|esk22_0=singleton(esk23_0)))),inference(distribute,[status(thm)],[431])).
% cnf(433,negated_conjecture,(esk22_0=singleton(esk23_0)|esk22_0=empty_set|subset(esk22_0,singleton(esk23_0))),inference(split_conjunct,[status(thm)],[432])).
% cnf(434,negated_conjecture,(~subset(esk22_0,singleton(esk23_0))|esk22_0!=singleton(esk23_0)),inference(split_conjunct,[status(thm)],[432])).
% cnf(435,negated_conjecture,(~subset(esk22_0,singleton(esk23_0))|esk22_0!=empty_set),inference(split_conjunct,[status(thm)],[432])).
% cnf(440,negated_conjecture,(esk22_0=empty_set|unordered_pair(esk23_0,esk23_0)=esk22_0|subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[433,175,theory(equality)]),175,theory(equality)]),['unfolding']).
% cnf(443,plain,(subset(X1,unordered_pair(X2,X2))|empty_set!=X1),inference(rw,[status(thm)],[116,175,theory(equality)]),['unfolding']).
% cnf(445,plain,(subset(X1,unordered_pair(X2,X2))|unordered_pair(X2,X2)!=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,175,theory(equality)]),175,theory(equality)]),['unfolding']).
% cnf(451,plain,(empty_set=X1|unordered_pair(X2,X2)=X1|~subset(X1,unordered_pair(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[117,175,theory(equality)]),175,theory(equality)]),['unfolding']).
% cnf(457,negated_conjecture,(esk22_0!=empty_set|~subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(rw,[status(thm)],[435,175,theory(equality)]),['unfolding']).
% cnf(459,negated_conjecture,(unordered_pair(esk23_0,esk23_0)!=esk22_0|~subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[434,175,theory(equality)]),175,theory(equality)]),['unfolding']).
% cnf(491,negated_conjecture,(esk22_0=unordered_pair(esk23_0,esk23_0)|subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(csr,[status(thm)],[440,443])).
% cnf(511,plain,(empty_set=esk3_0),inference(spm,[status(thm)],[173,214,theory(equality)])).
% cnf(517,negated_conjecture,(esk22_0=unordered_pair(esk23_0,esk23_0)|subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(spm,[status(thm)],[491,201,theory(equality)])).
% cnf(2237,plain,(unordered_pair(X1,X1)=X2|esk3_0=X2|~subset(X2,unordered_pair(X1,X1))),inference(rw,[status(thm)],[451,511,theory(equality)])).
% cnf(2240,negated_conjecture,(esk22_0!=esk3_0|~subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(rw,[status(thm)],[457,511,theory(equality)])).
% cnf(2253,plain,(subset(esk3_0,X1)),inference(rw,[status(thm)],[124,511,theory(equality)])).
% cnf(2268,negated_conjecture,(subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(csr,[status(thm)],[517,445])).
% cnf(2290,negated_conjecture,(esk22_0!=unordered_pair(esk23_0,esk23_0)|$false),inference(rw,[status(thm)],[459,2268,theory(equality)])).
% cnf(2291,negated_conjecture,(esk22_0!=unordered_pair(esk23_0,esk23_0)),inference(cn,[status(thm)],[2290,theory(equality)])).
% cnf(2326,negated_conjecture,(unordered_pair(esk23_0,esk23_0)=esk22_0|esk3_0=esk22_0),inference(spm,[status(thm)],[2237,2268,theory(equality)])).
% cnf(2344,negated_conjecture,(esk22_0=esk3_0),inference(sr,[status(thm)],[2326,2291,theory(equality)])).
% cnf(2391,negated_conjecture,($false|~subset(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(rw,[status(thm)],[2240,2344,theory(equality)])).
% cnf(2392,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2391,2344,theory(equality)]),2253,theory(equality)])).
% cnf(2393,negated_conjecture,($false),inference(cn,[status(thm)],[2392,theory(equality)])).
% cnf(2394,negated_conjecture,($false),2393,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 291
% # ...of these trivial : 1
% # ...subsumed : 13
% # ...remaining for further processing: 277
% # Other redundant clauses eliminated : 46
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 22
% # Generated clauses : 1674
% # ...of the previous two non-trivial : 1526
% # Contextual simplify-reflections : 2
% # Paramodulations : 1595
% # Factorizations : 14
% # Equation resolutions : 65
% # Current number of processed clauses: 118
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 4
% # Non-unit-clauses : 98
% # Current number of unprocessed clauses: 1044
% # ...number of literals in the above : 3785
% # Clause-clause subsumption calls (NU) : 607
% # Rec. Clause-clause subsumption calls : 493
% # Unit Clause-clause subsumption calls : 71
% # Rewrite failures with RHS unbound : 6
% # Indexed BW rewrite attempts : 60
% # Indexed BW rewrite successes : 37
% # Backwards rewriting index: 88 leaves, 1.94+/-2.293 terms/leaf
% # Paramod-from index: 47 leaves, 1.34+/-0.661 terms/leaf
% # Paramod-into index: 83 leaves, 1.72+/-1.786 terms/leaf
% # -------------------------------------------------
% # User time : 0.084 s
% # System time : 0.005 s
% # Total time : 0.089 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.30 WC
% FINAL PrfWatch: 0.21 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP21190/SEU160+2.tptp
%
%------------------------------------------------------------------------------