TSTP Solution File: COM016+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM016+1 : TPTP v5.0.0. Released v4.0.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 : Tue Dec 28 22:41:32 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP7713/COM016+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7713/COM016+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7713/COM016+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 7809
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aRewritingSystem0(X2))&aElement0(X3))=>(sdtmndtplgtdt0(X1,X2,X3)<=>(aReductOfIn0(X3,X1,X2)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X1,X2))&sdtmndtplgtdt0(X4,X2,X3))))),file('/tmp/SRASS.s.p', mTCDef)).
% fof(7, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(9, axiom,((aElement0(xa)&aElement0(xb))&aElement0(xc)),file('/tmp/SRASS.s.p', m__731)).
% fof(11, axiom,(sdtmndtplgtdt0(xa,xR,xb)&sdtmndtplgtdt0(xa,xR,xc)),file('/tmp/SRASS.s.p', m__731_02)).
% fof(13, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aRewritingSystem0(X2))&aElement0(X3))=>(sdtmndtasgtdt0(X1,X2,X3)<=>(X1=X3|sdtmndtplgtdt0(X1,X2,X3)))),file('/tmp/SRASS.s.p', mTCRDef)).
% fof(20, conjecture,?[X1]:((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtasgtdt0(X1,xR,xb)),file('/tmp/SRASS.s.p', m__)).
% fof(21, negated_conjecture,~(?[X1]:((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtasgtdt0(X1,xR,xb))),inference(assume_negation,[status(cth)],[20])).
% fof(30, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aRewritingSystem0(X2)))|~(aElement0(X3)))|((~(sdtmndtplgtdt0(X1,X2,X3))|(aReductOfIn0(X3,X1,X2)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X1,X2))&sdtmndtplgtdt0(X4,X2,X3))))&((~(aReductOfIn0(X3,X1,X2))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,X1,X2)))|~(sdtmndtplgtdt0(X4,X2,X3))))|sdtmndtplgtdt0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(31, plain,![X5]:![X6]:![X7]:(((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|((~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|?[X8]:((aElement0(X8)&aReductOfIn0(X8,X5,X6))&sdtmndtplgtdt0(X8,X6,X7))))&((~(aReductOfIn0(X7,X5,X6))&![X9]:((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7))))|sdtmndtplgtdt0(X5,X6,X7)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:(((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|((~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|((aElement0(esk1_3(X5,X6,X7))&aReductOfIn0(esk1_3(X5,X6,X7),X5,X6))&sdtmndtplgtdt0(esk1_3(X5,X6,X7),X6,X7))))&((~(aReductOfIn0(X7,X5,X6))&![X9]:((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7))))|sdtmndtplgtdt0(X5,X6,X7)))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X5]:![X6]:![X7]:![X9]:((((((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7)))&~(aReductOfIn0(X7,X5,X6)))|sdtmndtplgtdt0(X5,X6,X7))&(~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|((aElement0(esk1_3(X5,X6,X7))&aReductOfIn0(esk1_3(X5,X6,X7),X5,X6))&sdtmndtplgtdt0(esk1_3(X5,X6,X7),X6,X7)))))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X5]:![X6]:![X7]:![X9]:((((((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7)))|sdtmndtplgtdt0(X5,X6,X7))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7))))&((~(aReductOfIn0(X7,X5,X6))|sdtmndtplgtdt0(X5,X6,X7))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))&(((((aElement0(esk1_3(X5,X6,X7))|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7))))&(((aReductOfIn0(esk1_3(X5,X6,X7),X5,X6)|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))&(((sdtmndtplgtdt0(esk1_3(X5,X6,X7),X6,X7)|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(aReductOfIn0(X1,X3,X2)|sdtmndtplgtdt0(esk1_3(X3,X2,X1),X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(aReductOfIn0(X1,X3,X2)|aReductOfIn0(esk1_3(X3,X2,X1),X3,X2)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,plain,(aReductOfIn0(X1,X3,X2)|aElement0(esk1_3(X3,X2,X1))|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(70,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[7])).
% cnf(74,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[9])).
% cnf(75,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[9])).
% cnf(84,plain,(sdtmndtplgtdt0(xa,xR,xb)),inference(split_conjunct,[status(thm)],[11])).
% fof(94, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aRewritingSystem0(X2)))|~(aElement0(X3)))|((~(sdtmndtasgtdt0(X1,X2,X3))|(X1=X3|sdtmndtplgtdt0(X1,X2,X3)))&((~(X1=X3)&~(sdtmndtplgtdt0(X1,X2,X3)))|sdtmndtasgtdt0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[13])).
% fof(95, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6)))|((~(sdtmndtasgtdt0(X4,X5,X6))|(X4=X6|sdtmndtplgtdt0(X4,X5,X6)))&((~(X4=X6)&~(sdtmndtplgtdt0(X4,X5,X6)))|sdtmndtasgtdt0(X4,X5,X6)))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X4]:![X5]:![X6]:(((~(sdtmndtasgtdt0(X4,X5,X6))|(X4=X6|sdtmndtplgtdt0(X4,X5,X6)))|((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6))))&(((~(X4=X6)|sdtmndtasgtdt0(X4,X5,X6))|((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6))))&((~(sdtmndtplgtdt0(X4,X5,X6))|sdtmndtasgtdt0(X4,X5,X6))|((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6)))))),inference(distribute,[status(thm)],[95])).
% cnf(97,plain,(sdtmndtasgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[96])).
% cnf(98,plain,(sdtmndtasgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|X3!=X1),inference(split_conjunct,[status(thm)],[96])).
% fof(127, negated_conjecture,![X1]:((~(aElement0(X1))|~(aReductOfIn0(X1,xa,xR)))|~(sdtmndtasgtdt0(X1,xR,xb))),inference(fof_nnf,[status(thm)],[21])).
% fof(128, negated_conjecture,![X2]:((~(aElement0(X2))|~(aReductOfIn0(X2,xa,xR)))|~(sdtmndtasgtdt0(X2,xR,xb))),inference(variable_rename,[status(thm)],[127])).
% cnf(129,negated_conjecture,(~sdtmndtasgtdt0(X1,xR,xb)|~aReductOfIn0(X1,xa,xR)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[128])).
% cnf(146,plain,(sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1)),inference(er,[status(thm)],[98,theory(equality)])).
% cnf(153,plain,(aReductOfIn0(xb,xa,xR)|aElement0(esk1_3(xa,xR,xb))|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xb)),inference(spm,[status(thm)],[37,84,theory(equality)])).
% cnf(155,plain,(aReductOfIn0(xb,xa,xR)|aElement0(esk1_3(xa,xR,xb))|$false|~aElement0(xa)|~aElement0(xb)),inference(rw,[status(thm)],[153,70,theory(equality)])).
% cnf(156,plain,(aReductOfIn0(xb,xa,xR)|aElement0(esk1_3(xa,xR,xb))|$false|$false|~aElement0(xb)),inference(rw,[status(thm)],[155,75,theory(equality)])).
% cnf(157,plain,(aReductOfIn0(xb,xa,xR)|aElement0(esk1_3(xa,xR,xb))|$false|$false|$false),inference(rw,[status(thm)],[156,74,theory(equality)])).
% cnf(158,plain,(aReductOfIn0(xb,xa,xR)|aElement0(esk1_3(xa,xR,xb))),inference(cn,[status(thm)],[157,theory(equality)])).
% cnf(164,plain,(aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)|aReductOfIn0(xb,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xb)),inference(spm,[status(thm)],[36,84,theory(equality)])).
% cnf(166,plain,(aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)|aReductOfIn0(xb,xa,xR)|$false|~aElement0(xa)|~aElement0(xb)),inference(rw,[status(thm)],[164,70,theory(equality)])).
% cnf(167,plain,(aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)|aReductOfIn0(xb,xa,xR)|$false|$false|~aElement0(xb)),inference(rw,[status(thm)],[166,75,theory(equality)])).
% cnf(168,plain,(aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)|aReductOfIn0(xb,xa,xR)|$false|$false|$false),inference(rw,[status(thm)],[167,74,theory(equality)])).
% cnf(169,plain,(aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)|aReductOfIn0(xb,xa,xR)),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(210,plain,(sdtmndtplgtdt0(esk1_3(xa,xR,xb),xR,xb)|aReductOfIn0(xb,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xb)),inference(spm,[status(thm)],[35,84,theory(equality)])).
% cnf(212,plain,(sdtmndtplgtdt0(esk1_3(xa,xR,xb),xR,xb)|aReductOfIn0(xb,xa,xR)|$false|~aElement0(xa)|~aElement0(xb)),inference(rw,[status(thm)],[210,70,theory(equality)])).
% cnf(213,plain,(sdtmndtplgtdt0(esk1_3(xa,xR,xb),xR,xb)|aReductOfIn0(xb,xa,xR)|$false|$false|~aElement0(xb)),inference(rw,[status(thm)],[212,75,theory(equality)])).
% cnf(214,plain,(sdtmndtplgtdt0(esk1_3(xa,xR,xb),xR,xb)|aReductOfIn0(xb,xa,xR)|$false|$false|$false),inference(rw,[status(thm)],[213,74,theory(equality)])).
% cnf(215,plain,(sdtmndtplgtdt0(esk1_3(xa,xR,xb),xR,xb)|aReductOfIn0(xb,xa,xR)),inference(cn,[status(thm)],[214,theory(equality)])).
% cnf(375,negated_conjecture,(~aReductOfIn0(xb,xa,xR)|~aElement0(xb)|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[129,146,theory(equality)])).
% cnf(381,negated_conjecture,(~aReductOfIn0(xb,xa,xR)|$false|~aRewritingSystem0(xR)),inference(rw,[status(thm)],[375,74,theory(equality)])).
% cnf(382,negated_conjecture,(~aReductOfIn0(xb,xa,xR)|$false|$false),inference(rw,[status(thm)],[381,70,theory(equality)])).
% cnf(383,negated_conjecture,(~aReductOfIn0(xb,xa,xR)),inference(cn,[status(thm)],[382,theory(equality)])).
% cnf(396,plain,(aElement0(esk1_3(xa,xR,xb))),inference(sr,[status(thm)],[158,383,theory(equality)])).
% cnf(397,plain,(aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)),inference(sr,[status(thm)],[169,383,theory(equality)])).
% cnf(508,plain,(sdtmndtplgtdt0(esk1_3(xa,xR,xb),xR,xb)),inference(sr,[status(thm)],[215,383,theory(equality)])).
% cnf(509,plain,(sdtmndtasgtdt0(esk1_3(xa,xR,xb),xR,xb)|~aRewritingSystem0(xR)|~aElement0(esk1_3(xa,xR,xb))|~aElement0(xb)),inference(spm,[status(thm)],[97,508,theory(equality)])).
% cnf(515,plain,(sdtmndtasgtdt0(esk1_3(xa,xR,xb),xR,xb)|$false|~aElement0(esk1_3(xa,xR,xb))|~aElement0(xb)),inference(rw,[status(thm)],[509,70,theory(equality)])).
% cnf(516,plain,(sdtmndtasgtdt0(esk1_3(xa,xR,xb),xR,xb)|$false|$false|~aElement0(xb)),inference(rw,[status(thm)],[515,396,theory(equality)])).
% cnf(517,plain,(sdtmndtasgtdt0(esk1_3(xa,xR,xb),xR,xb)|$false|$false|$false),inference(rw,[status(thm)],[516,74,theory(equality)])).
% cnf(518,plain,(sdtmndtasgtdt0(esk1_3(xa,xR,xb),xR,xb)),inference(cn,[status(thm)],[517,theory(equality)])).
% cnf(546,negated_conjecture,(~aReductOfIn0(esk1_3(xa,xR,xb),xa,xR)|~aElement0(esk1_3(xa,xR,xb))),inference(spm,[status(thm)],[129,518,theory(equality)])).
% cnf(572,negated_conjecture,($false|~aElement0(esk1_3(xa,xR,xb))),inference(rw,[status(thm)],[546,397,theory(equality)])).
% cnf(573,negated_conjecture,($false|$false),inference(rw,[status(thm)],[572,396,theory(equality)])).
% cnf(574,negated_conjecture,($false),inference(cn,[status(thm)],[573,theory(equality)])).
% cnf(575,negated_conjecture,($false),574,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 83
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 129
% # ...of the previous two non-trivial : 104
% # Contextual simplify-reflections : 14
% # Paramodulations : 126
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 76
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 67
% # ...number of literals in the above : 297
% # Clause-clause subsumption calls (NU) : 58
% # Rec. Clause-clause subsumption calls : 38
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 81 leaves, 1.74+/-1.831 terms/leaf
% # Paramod-from index: 32 leaves, 1.22+/-0.544 terms/leaf
% # Paramod-into index: 60 leaves, 1.40+/-1.003 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.004 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP7713/COM016+1.tptp
%
%------------------------------------------------------------------------------