TSTP Solution File: SEU229+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU229+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 : art02.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 02:07:32 EST 2010
% Result : Theorem 9.60s
% Output : Solution 9.60s
% 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/SystemOnTPTP22374/SEU229+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22374/SEU229+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22374/SEU229+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 22470
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.04 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:~((in(X1,X2)&![X3]:~((in(X3,X2)&![X4]:~((in(X4,X2)&in(X4,X3))))))),file('/tmp/SRASS.s.p', t7_tarski)).
% fof(8, axiom,![X1]:![X2]:![X3]:![X4]:(X4=unordered_triple(X1,X2,X3)<=>![X5]:(in(X5,X4)<=>~(((~(X5=X1)&~(X5=X2))&~(X5=X3))))),file('/tmp/SRASS.s.p', d1_enumset1)).
% fof(28, conjecture,![X1]:![X2]:![X3]:~(((in(X1,X2)&in(X2,X3))&in(X3,X1))),file('/tmp/SRASS.s.p', t3_ordinal1)).
% fof(29, negated_conjecture,~(![X1]:![X2]:![X3]:~(((in(X1,X2)&in(X2,X3))&in(X3,X1)))),inference(assume_negation,[status(cth)],[28])).
% fof(36, plain,![X1]:![X2]:(~(in(X1,X2))|?[X3]:(in(X3,X2)&![X4]:(~(in(X4,X2))|~(in(X4,X3))))),inference(fof_nnf,[status(thm)],[2])).
% fof(37, plain,![X5]:![X6]:(~(in(X5,X6))|?[X7]:(in(X7,X6)&![X8]:(~(in(X8,X6))|~(in(X8,X7))))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X5]:![X6]:(~(in(X5,X6))|(in(esk1_2(X5,X6),X6)&![X8]:(~(in(X8,X6))|~(in(X8,esk1_2(X5,X6)))))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X5]:![X6]:![X8]:(((~(in(X8,X6))|~(in(X8,esk1_2(X5,X6))))&in(esk1_2(X5,X6),X6))|~(in(X5,X6))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X8]:(((~(in(X8,X6))|~(in(X8,esk1_2(X5,X6))))|~(in(X5,X6)))&(in(esk1_2(X5,X6),X6)|~(in(X5,X6)))),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(in(esk1_2(X1,X2),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(~in(X1,X2)|~in(X3,esk1_2(X1,X2))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(58, plain,![X1]:![X2]:![X3]:![X4]:((~(X4=unordered_triple(X1,X2,X3))|![X5]:((~(in(X5,X4))|((X5=X1|X5=X2)|X5=X3))&(((~(X5=X1)&~(X5=X2))&~(X5=X3))|in(X5,X4))))&(?[X5]:((~(in(X5,X4))|((~(X5=X1)&~(X5=X2))&~(X5=X3)))&(in(X5,X4)|((X5=X1|X5=X2)|X5=X3)))|X4=unordered_triple(X1,X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(59, plain,![X6]:![X7]:![X8]:![X9]:((~(X9=unordered_triple(X6,X7,X8))|![X10]:((~(in(X10,X9))|((X10=X6|X10=X7)|X10=X8))&(((~(X10=X6)&~(X10=X7))&~(X10=X8))|in(X10,X9))))&(?[X11]:((~(in(X11,X9))|((~(X11=X6)&~(X11=X7))&~(X11=X8)))&(in(X11,X9)|((X11=X6|X11=X7)|X11=X8)))|X9=unordered_triple(X6,X7,X8))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X6]:![X7]:![X8]:![X9]:((~(X9=unordered_triple(X6,X7,X8))|![X10]:((~(in(X10,X9))|((X10=X6|X10=X7)|X10=X8))&(((~(X10=X6)&~(X10=X7))&~(X10=X8))|in(X10,X9))))&(((~(in(esk5_4(X6,X7,X8,X9),X9))|((~(esk5_4(X6,X7,X8,X9)=X6)&~(esk5_4(X6,X7,X8,X9)=X7))&~(esk5_4(X6,X7,X8,X9)=X8)))&(in(esk5_4(X6,X7,X8,X9),X9)|((esk5_4(X6,X7,X8,X9)=X6|esk5_4(X6,X7,X8,X9)=X7)|esk5_4(X6,X7,X8,X9)=X8)))|X9=unordered_triple(X6,X7,X8))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((~(in(X10,X9))|((X10=X6|X10=X7)|X10=X8))&(((~(X10=X6)&~(X10=X7))&~(X10=X8))|in(X10,X9)))|~(X9=unordered_triple(X6,X7,X8)))&(((~(in(esk5_4(X6,X7,X8,X9),X9))|((~(esk5_4(X6,X7,X8,X9)=X6)&~(esk5_4(X6,X7,X8,X9)=X7))&~(esk5_4(X6,X7,X8,X9)=X8)))&(in(esk5_4(X6,X7,X8,X9),X9)|((esk5_4(X6,X7,X8,X9)=X6|esk5_4(X6,X7,X8,X9)=X7)|esk5_4(X6,X7,X8,X9)=X8)))|X9=unordered_triple(X6,X7,X8))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((~(in(X10,X9))|((X10=X6|X10=X7)|X10=X8))|~(X9=unordered_triple(X6,X7,X8)))&((((~(X10=X6)|in(X10,X9))|~(X9=unordered_triple(X6,X7,X8)))&((~(X10=X7)|in(X10,X9))|~(X9=unordered_triple(X6,X7,X8))))&((~(X10=X8)|in(X10,X9))|~(X9=unordered_triple(X6,X7,X8)))))&(((((~(esk5_4(X6,X7,X8,X9)=X6)|~(in(esk5_4(X6,X7,X8,X9),X9)))|X9=unordered_triple(X6,X7,X8))&((~(esk5_4(X6,X7,X8,X9)=X7)|~(in(esk5_4(X6,X7,X8,X9),X9)))|X9=unordered_triple(X6,X7,X8)))&((~(esk5_4(X6,X7,X8,X9)=X8)|~(in(esk5_4(X6,X7,X8,X9),X9)))|X9=unordered_triple(X6,X7,X8)))&((in(esk5_4(X6,X7,X8,X9),X9)|((esk5_4(X6,X7,X8,X9)=X6|esk5_4(X6,X7,X8,X9)=X7)|esk5_4(X6,X7,X8,X9)=X8))|X9=unordered_triple(X6,X7,X8)))),inference(distribute,[status(thm)],[61])).
% cnf(67,plain,(in(X5,X1)|X1!=unordered_triple(X2,X3,X4)|X5!=X4),inference(split_conjunct,[status(thm)],[62])).
% cnf(68,plain,(in(X5,X1)|X1!=unordered_triple(X2,X3,X4)|X5!=X3),inference(split_conjunct,[status(thm)],[62])).
% cnf(69,plain,(in(X5,X1)|X1!=unordered_triple(X2,X3,X4)|X5!=X2),inference(split_conjunct,[status(thm)],[62])).
% cnf(70,plain,(X5=X4|X5=X3|X5=X2|X1!=unordered_triple(X2,X3,X4)|~in(X5,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(132, negated_conjecture,?[X1]:?[X2]:?[X3]:((in(X1,X2)&in(X2,X3))&in(X3,X1)),inference(fof_nnf,[status(thm)],[29])).
% fof(133, negated_conjecture,?[X4]:?[X5]:?[X6]:((in(X4,X5)&in(X5,X6))&in(X6,X4)),inference(variable_rename,[status(thm)],[132])).
% fof(134, negated_conjecture,((in(esk13_0,esk14_0)&in(esk14_0,esk15_0))&in(esk15_0,esk13_0)),inference(skolemize,[status(esa)],[133])).
% cnf(135,negated_conjecture,(in(esk15_0,esk13_0)),inference(split_conjunct,[status(thm)],[134])).
% cnf(136,negated_conjecture,(in(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[134])).
% cnf(137,negated_conjecture,(in(esk13_0,esk14_0)),inference(split_conjunct,[status(thm)],[134])).
% cnf(145,plain,(in(X1,X2)|unordered_triple(X3,X4,X1)!=X2),inference(er,[status(thm)],[67,theory(equality)])).
% cnf(147,plain,(in(X1,X2)|unordered_triple(X3,X1,X4)!=X2),inference(er,[status(thm)],[68,theory(equality)])).
% cnf(148,plain,(in(X1,X2)|unordered_triple(X1,X3,X4)!=X2),inference(er,[status(thm)],[69,theory(equality)])).
% cnf(159,plain,(X1=X2|X3=X2|X4=X2|~in(X2,unordered_triple(X1,X3,X4))),inference(er,[status(thm)],[70,theory(equality)])).
% cnf(177,plain,(in(X1,unordered_triple(X2,X3,X1))),inference(er,[status(thm)],[145,theory(equality)])).
% cnf(180,plain,(in(X1,unordered_triple(X2,X1,X3))),inference(er,[status(thm)],[147,theory(equality)])).
% cnf(183,plain,(in(X1,unordered_triple(X1,X2,X3))),inference(er,[status(thm)],[148,theory(equality)])).
% cnf(187,plain,(X1=esk1_2(X2,unordered_triple(X3,X4,X1))|X4=esk1_2(X2,unordered_triple(X3,X4,X1))|X3=esk1_2(X2,unordered_triple(X3,X4,X1))|~in(X2,unordered_triple(X3,X4,X1))),inference(spm,[status(thm)],[159,41,theory(equality)])).
% cnf(389,plain,(esk1_2(X1,unordered_triple(X2,X3,X1))=X2|esk1_2(X1,unordered_triple(X2,X3,X1))=X3|esk1_2(X1,unordered_triple(X2,X3,X1))=X1),inference(spm,[status(thm)],[187,177,theory(equality)])).
% cnf(401,plain,(esk1_2(X2,unordered_triple(X3,X4,X2))=X2|esk1_2(X2,unordered_triple(X3,X4,X2))=X4|~in(X1,X3)|~in(X1,unordered_triple(X3,X4,X2))|~in(X2,unordered_triple(X3,X4,X2))),inference(spm,[status(thm)],[42,389,theory(equality)])).
% cnf(428,plain,(esk1_2(X2,unordered_triple(X3,X4,X2))=X2|esk1_2(X2,unordered_triple(X3,X4,X2))=X4|~in(X1,X3)|~in(X1,unordered_triple(X3,X4,X2))|$false),inference(rw,[status(thm)],[401,177,theory(equality)])).
% cnf(429,plain,(esk1_2(X2,unordered_triple(X3,X4,X2))=X2|esk1_2(X2,unordered_triple(X3,X4,X2))=X4|~in(X1,X3)|~in(X1,unordered_triple(X3,X4,X2))),inference(cn,[status(thm)],[428,theory(equality)])).
% cnf(6038,plain,(esk1_2(X1,unordered_triple(X2,X3,X1))=X3|esk1_2(X1,unordered_triple(X2,X3,X1))=X1|~in(X1,X2)),inference(spm,[status(thm)],[429,177,theory(equality)])).
% cnf(30009,negated_conjecture,(esk1_2(esk15_0,unordered_triple(esk13_0,X1,esk15_0))=esk15_0|esk1_2(esk15_0,unordered_triple(esk13_0,X1,esk15_0))=X1),inference(spm,[status(thm)],[6038,135,theory(equality)])).
% cnf(30145,negated_conjecture,(esk1_2(esk15_0,unordered_triple(esk13_0,X2,esk15_0))=X2|~in(X1,esk15_0)|~in(X1,unordered_triple(esk13_0,X2,esk15_0))|~in(esk15_0,unordered_triple(esk13_0,X2,esk15_0))),inference(spm,[status(thm)],[42,30009,theory(equality)])).
% cnf(30442,negated_conjecture,(esk1_2(esk15_0,unordered_triple(esk13_0,X2,esk15_0))=X2|~in(X1,esk15_0)|~in(X1,unordered_triple(esk13_0,X2,esk15_0))|$false),inference(rw,[status(thm)],[30145,177,theory(equality)])).
% cnf(30443,negated_conjecture,(esk1_2(esk15_0,unordered_triple(esk13_0,X2,esk15_0))=X2|~in(X1,esk15_0)|~in(X1,unordered_triple(esk13_0,X2,esk15_0))),inference(cn,[status(thm)],[30442,theory(equality)])).
% cnf(266851,negated_conjecture,(esk1_2(esk15_0,unordered_triple(esk13_0,X1,esk15_0))=X1|~in(X1,esk15_0)),inference(spm,[status(thm)],[30443,180,theory(equality)])).
% cnf(266932,negated_conjecture,(~in(X1,X2)|~in(X1,unordered_triple(esk13_0,X2,esk15_0))|~in(esk15_0,unordered_triple(esk13_0,X2,esk15_0))|~in(X2,esk15_0)),inference(spm,[status(thm)],[42,266851,theory(equality)])).
% cnf(267212,negated_conjecture,(~in(X1,X2)|~in(X1,unordered_triple(esk13_0,X2,esk15_0))|$false|~in(X2,esk15_0)),inference(rw,[status(thm)],[266932,177,theory(equality)])).
% cnf(267213,negated_conjecture,(~in(X1,X2)|~in(X1,unordered_triple(esk13_0,X2,esk15_0))|~in(X2,esk15_0)),inference(cn,[status(thm)],[267212,theory(equality)])).
% cnf(267459,negated_conjecture,(~in(X1,esk15_0)|~in(esk13_0,X1)),inference(spm,[status(thm)],[267213,183,theory(equality)])).
% cnf(267461,negated_conjecture,(~in(esk13_0,esk14_0)),inference(spm,[status(thm)],[267459,136,theory(equality)])).
% cnf(267465,negated_conjecture,($false),inference(rw,[status(thm)],[267461,137,theory(equality)])).
% cnf(267466,negated_conjecture,($false),inference(cn,[status(thm)],[267465,theory(equality)])).
% cnf(267467,negated_conjecture,($false),267466,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6734
% # ...of these trivial : 61
% # ...subsumed : 4592
% # ...remaining for further processing: 2081
% # Other redundant clauses eliminated : 1774
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 28
% # Backward-rewritten : 6
% # Generated clauses : 100302
% # ...of the previous two non-trivial : 97011
% # Contextual simplify-reflections : 527
% # Paramodulations : 97417
% # Factorizations : 1104
% # Equation resolutions : 1781
% # Current number of processed clauses: 2044
% # Positive orientable unit clauses: 104
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 227
% # Non-unit-clauses : 1713
% # Current number of unprocessed clauses: 87687
% # ...number of literals in the above : 312476
% # Clause-clause subsumption calls (NU) : 890467
% # Rec. Clause-clause subsumption calls : 425265
% # Unit Clause-clause subsumption calls : 144508
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 590
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 482 leaves, 5.87+/-15.466 terms/leaf
% # Paramod-from index: 95 leaves, 2.78+/-6.056 terms/leaf
% # Paramod-into index: 453 leaves, 5.98+/-15.719 terms/leaf
% # -------------------------------------------------
% # User time : 5.011 s
% # System time : 0.157 s
% # Total time : 5.168 s
% # Maximum resident set size: 0 pages
% PrfWatch: 8.77 CPU 8.91 WC
% FINAL PrfWatch: 8.77 CPU 8.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP22374/SEU229+1.tptp
%
%------------------------------------------------------------------------------