TSTP Solution File: SEU142+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU142+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 : art07.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:16:10 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP19162/SEU142+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19162/SEU142+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19162/SEU142+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 19258
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(3, 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(63, conjecture,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(64, negated_conjecture,~(![X1]:unordered_pair(X1,X1)=singleton(X1)),inference(assume_negation,[status(cth)],[63])).
% fof(77, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(78, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[78])).
% fof(80, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[79])).
% fof(81, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[80])).
% cnf(82,plain,(X1=singleton(X2)|esk1_2(X2,X1)=X2|in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[81])).
% cnf(83,plain,(X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(86, 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)],[3])).
% fof(87, 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)],[86])).
% fof(88, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[87])).
% fof(89, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[88])).
% fof(90, 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)))))&((((~(esk2_3(X5,X6,X7)=X5)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk2_3(X5,X6,X7)=X6)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[89])).
% cnf(95,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[90])).
% cnf(96,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(296, negated_conjecture,?[X1]:~(unordered_pair(X1,X1)=singleton(X1)),inference(fof_nnf,[status(thm)],[64])).
% fof(297, negated_conjecture,?[X2]:~(unordered_pair(X2,X2)=singleton(X2)),inference(variable_rename,[status(thm)],[296])).
% fof(298, negated_conjecture,~(unordered_pair(esk13_0,esk13_0)=singleton(esk13_0)),inference(skolemize,[status(esa)],[297])).
% cnf(299,negated_conjecture,(unordered_pair(esk13_0,esk13_0)!=singleton(esk13_0)),inference(split_conjunct,[status(thm)],[298])).
% cnf(324,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[95,theory(equality)])).
% cnf(380,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[96,theory(equality)])).
% cnf(388,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[324,theory(equality)])).
% cnf(467,negated_conjecture,(esk1_2(esk13_0,X1)=esk13_0|in(esk1_2(esk13_0,X1),X1)|X1!=unordered_pair(esk13_0,esk13_0)),inference(spm,[status(thm)],[299,82,theory(equality)])).
% cnf(2806,negated_conjecture,(esk1_2(esk13_0,unordered_pair(esk13_0,esk13_0))=esk13_0|in(esk1_2(esk13_0,unordered_pair(esk13_0,esk13_0)),unordered_pair(esk13_0,esk13_0))),inference(er,[status(thm)],[467,theory(equality)])).
% cnf(2822,negated_conjecture,(esk13_0=esk1_2(esk13_0,unordered_pair(esk13_0,esk13_0))),inference(spm,[status(thm)],[380,2806,theory(equality)])).
% cnf(2846,negated_conjecture,(singleton(esk13_0)=unordered_pair(esk13_0,esk13_0)|~in(esk13_0,unordered_pair(esk13_0,esk13_0))),inference(spm,[status(thm)],[83,2822,theory(equality)])).
% cnf(2860,negated_conjecture,(singleton(esk13_0)=unordered_pair(esk13_0,esk13_0)|$false),inference(rw,[status(thm)],[2846,388,theory(equality)])).
% cnf(2861,negated_conjecture,(singleton(esk13_0)=unordered_pair(esk13_0,esk13_0)),inference(cn,[status(thm)],[2860,theory(equality)])).
% cnf(2862,negated_conjecture,($false),inference(sr,[status(thm)],[2861,299,theory(equality)])).
% cnf(2863,negated_conjecture,($false),2862,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 452
% # ...of these trivial : 19
% # ...subsumed : 181
% # ...remaining for further processing: 252
% # Other redundant clauses eliminated : 58
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 1820
% # ...of the previous two non-trivial : 1357
% # Contextual simplify-reflections : 0
% # Paramodulations : 1723
% # Factorizations : 16
% # Equation resolutions : 81
% # Current number of processed clauses: 155
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 12
% # Non-unit-clauses : 95
% # Current number of unprocessed clauses: 999
% # ...number of literals in the above : 2943
% # Clause-clause subsumption calls (NU) : 389
% # Rec. Clause-clause subsumption calls : 363
% # Unit Clause-clause subsumption calls : 54
% # Rewrite failures with RHS unbound : 20
% # Indexed BW rewrite attempts : 87
% # Indexed BW rewrite successes : 32
% # Backwards rewriting index: 87 leaves, 1.79+/-1.703 terms/leaf
% # Paramod-from index: 57 leaves, 1.39+/-0.614 terms/leaf
% # Paramod-into index: 84 leaves, 1.65+/-1.384 terms/leaf
% # -------------------------------------------------
% # User time : 0.071 s
% # System time : 0.004 s
% # Total time : 0.075 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP19162/SEU142+2.tptp
%
%------------------------------------------------------------------------------