TSTP Solution File: COM017+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM017+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 : art04.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:59 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP21645/COM017+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21645/COM017+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21645/COM017+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 21741
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aElement0(X1)&aRewritingSystem0(X2))=>![X3]:(aReductOfIn0(X3,X1,X2)=>aElement0(X3))),file('/tmp/SRASS.s.p', mReduct)).
% fof(5, axiom,![X1]:(aRewritingSystem0(X1)=>(isLocallyConfluent0(X1)<=>![X2]:![X3]:![X4]:(((((aElement0(X2)&aElement0(X3))&aElement0(X4))&aReductOfIn0(X3,X2,X1))&aReductOfIn0(X4,X2,X1))=>?[X5]:((aElement0(X5)&sdtmndtasgtdt0(X3,X1,X5))&sdtmndtasgtdt0(X4,X1,X5))))),file('/tmp/SRASS.s.p', mWCRDef)).
% fof(7, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(8, axiom,(isLocallyConfluent0(xR)&isTerminating0(xR)),file('/tmp/SRASS.s.p', m__656_01)).
% fof(9, axiom,((aElement0(xa)&aElement0(xb))&aElement0(xc)),file('/tmp/SRASS.s.p', m__731)).
% fof(12, axiom,((aElement0(xu)&aReductOfIn0(xu,xa,xR))&sdtmndtasgtdt0(xu,xR,xb)),file('/tmp/SRASS.s.p', m__755)).
% fof(13, axiom,((aElement0(xv)&aReductOfIn0(xv,xa,xR))&sdtmndtasgtdt0(xv,xR,xc)),file('/tmp/SRASS.s.p', m__779)).
% fof(22, conjecture,?[X1]:((aElement0(X1)&sdtmndtasgtdt0(xu,xR,X1))&sdtmndtasgtdt0(xv,xR,X1)),file('/tmp/SRASS.s.p', m__)).
% fof(23, negated_conjecture,~(?[X1]:((aElement0(X1)&sdtmndtasgtdt0(xu,xR,X1))&sdtmndtasgtdt0(xv,xR,X1))),inference(assume_negation,[status(cth)],[22])).
% fof(28, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:(~(aReductOfIn0(X3,X1,X2))|aElement0(X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(29, plain,![X4]:![X5]:((~(aElement0(X4))|~(aRewritingSystem0(X5)))|![X6]:(~(aReductOfIn0(X6,X4,X5))|aElement0(X6))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:((~(aReductOfIn0(X6,X4,X5))|aElement0(X6))|(~(aElement0(X4))|~(aRewritingSystem0(X5)))),inference(shift_quantors,[status(thm)],[29])).
% cnf(31,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aReductOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(48, plain,![X1]:(~(aRewritingSystem0(X1))|((~(isLocallyConfluent0(X1))|![X2]:![X3]:![X4]:(((((~(aElement0(X2))|~(aElement0(X3)))|~(aElement0(X4)))|~(aReductOfIn0(X3,X2,X1)))|~(aReductOfIn0(X4,X2,X1)))|?[X5]:((aElement0(X5)&sdtmndtasgtdt0(X3,X1,X5))&sdtmndtasgtdt0(X4,X1,X5))))&(?[X2]:?[X3]:?[X4]:(((((aElement0(X2)&aElement0(X3))&aElement0(X4))&aReductOfIn0(X3,X2,X1))&aReductOfIn0(X4,X2,X1))&![X5]:((~(aElement0(X5))|~(sdtmndtasgtdt0(X3,X1,X5)))|~(sdtmndtasgtdt0(X4,X1,X5))))|isLocallyConfluent0(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(49, plain,![X6]:(~(aRewritingSystem0(X6))|((~(isLocallyConfluent0(X6))|![X7]:![X8]:![X9]:(((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(aReductOfIn0(X8,X7,X6)))|~(aReductOfIn0(X9,X7,X6)))|?[X10]:((aElement0(X10)&sdtmndtasgtdt0(X8,X6,X10))&sdtmndtasgtdt0(X9,X6,X10))))&(?[X11]:?[X12]:?[X13]:(((((aElement0(X11)&aElement0(X12))&aElement0(X13))&aReductOfIn0(X12,X11,X6))&aReductOfIn0(X13,X11,X6))&![X14]:((~(aElement0(X14))|~(sdtmndtasgtdt0(X12,X6,X14)))|~(sdtmndtasgtdt0(X13,X6,X14))))|isLocallyConfluent0(X6)))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X6]:(~(aRewritingSystem0(X6))|((~(isLocallyConfluent0(X6))|![X7]:![X8]:![X9]:(((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(aReductOfIn0(X8,X7,X6)))|~(aReductOfIn0(X9,X7,X6)))|((aElement0(esk2_4(X6,X7,X8,X9))&sdtmndtasgtdt0(X8,X6,esk2_4(X6,X7,X8,X9)))&sdtmndtasgtdt0(X9,X6,esk2_4(X6,X7,X8,X9)))))&((((((aElement0(esk3_1(X6))&aElement0(esk4_1(X6)))&aElement0(esk5_1(X6)))&aReductOfIn0(esk4_1(X6),esk3_1(X6),X6))&aReductOfIn0(esk5_1(X6),esk3_1(X6),X6))&![X14]:((~(aElement0(X14))|~(sdtmndtasgtdt0(esk4_1(X6),X6,X14)))|~(sdtmndtasgtdt0(esk5_1(X6),X6,X14))))|isLocallyConfluent0(X6)))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X6]:![X7]:![X8]:![X9]:![X14]:((((((~(aElement0(X14))|~(sdtmndtasgtdt0(esk4_1(X6),X6,X14)))|~(sdtmndtasgtdt0(esk5_1(X6),X6,X14)))&((((aElement0(esk3_1(X6))&aElement0(esk4_1(X6)))&aElement0(esk5_1(X6)))&aReductOfIn0(esk4_1(X6),esk3_1(X6),X6))&aReductOfIn0(esk5_1(X6),esk3_1(X6),X6)))|isLocallyConfluent0(X6))&((((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(aReductOfIn0(X8,X7,X6)))|~(aReductOfIn0(X9,X7,X6)))|((aElement0(esk2_4(X6,X7,X8,X9))&sdtmndtasgtdt0(X8,X6,esk2_4(X6,X7,X8,X9)))&sdtmndtasgtdt0(X9,X6,esk2_4(X6,X7,X8,X9))))|~(isLocallyConfluent0(X6))))|~(aRewritingSystem0(X6))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X6]:![X7]:![X8]:![X9]:![X14]:((((((~(aElement0(X14))|~(sdtmndtasgtdt0(esk4_1(X6),X6,X14)))|~(sdtmndtasgtdt0(esk5_1(X6),X6,X14)))|isLocallyConfluent0(X6))|~(aRewritingSystem0(X6)))&((((((aElement0(esk3_1(X6))|isLocallyConfluent0(X6))|~(aRewritingSystem0(X6)))&((aElement0(esk4_1(X6))|isLocallyConfluent0(X6))|~(aRewritingSystem0(X6))))&((aElement0(esk5_1(X6))|isLocallyConfluent0(X6))|~(aRewritingSystem0(X6))))&((aReductOfIn0(esk4_1(X6),esk3_1(X6),X6)|isLocallyConfluent0(X6))|~(aRewritingSystem0(X6))))&((aReductOfIn0(esk5_1(X6),esk3_1(X6),X6)|isLocallyConfluent0(X6))|~(aRewritingSystem0(X6)))))&(((((aElement0(esk2_4(X6,X7,X8,X9))|((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(aReductOfIn0(X8,X7,X6)))|~(aReductOfIn0(X9,X7,X6))))|~(isLocallyConfluent0(X6)))|~(aRewritingSystem0(X6)))&(((sdtmndtasgtdt0(X8,X6,esk2_4(X6,X7,X8,X9))|((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(aReductOfIn0(X8,X7,X6)))|~(aReductOfIn0(X9,X7,X6))))|~(isLocallyConfluent0(X6)))|~(aRewritingSystem0(X6))))&(((sdtmndtasgtdt0(X9,X6,esk2_4(X6,X7,X8,X9))|((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(aReductOfIn0(X8,X7,X6)))|~(aReductOfIn0(X9,X7,X6))))|~(isLocallyConfluent0(X6)))|~(aRewritingSystem0(X6))))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(sdtmndtasgtdt0(X2,X1,esk2_4(X1,X3,X4,X2))|~aRewritingSystem0(X1)|~isLocallyConfluent0(X1)|~aReductOfIn0(X2,X3,X1)|~aReductOfIn0(X4,X3,X1)|~aElement0(X2)|~aElement0(X4)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(sdtmndtasgtdt0(X4,X1,esk2_4(X1,X3,X4,X2))|~aRewritingSystem0(X1)|~isLocallyConfluent0(X1)|~aReductOfIn0(X2,X3,X1)|~aReductOfIn0(X4,X3,X1)|~aElement0(X2)|~aElement0(X4)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,plain,(aElement0(esk2_4(X1,X3,X4,X2))|~aRewritingSystem0(X1)|~isLocallyConfluent0(X1)|~aReductOfIn0(X2,X3,X1)|~aReductOfIn0(X4,X3,X1)|~aElement0(X2)|~aElement0(X4)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[52])).
% cnf(72,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[7])).
% cnf(74,plain,(isLocallyConfluent0(xR)),inference(split_conjunct,[status(thm)],[8])).
% cnf(77,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[9])).
% cnf(88,plain,(aReductOfIn0(xu,xa,xR)),inference(split_conjunct,[status(thm)],[12])).
% cnf(91,plain,(aReductOfIn0(xv,xa,xR)),inference(split_conjunct,[status(thm)],[13])).
% fof(135, negated_conjecture,![X1]:((~(aElement0(X1))|~(sdtmndtasgtdt0(xu,xR,X1)))|~(sdtmndtasgtdt0(xv,xR,X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(136, negated_conjecture,![X2]:((~(aElement0(X2))|~(sdtmndtasgtdt0(xu,xR,X2)))|~(sdtmndtasgtdt0(xv,xR,X2))),inference(variable_rename,[status(thm)],[135])).
% cnf(137,negated_conjecture,(~sdtmndtasgtdt0(xv,xR,X1)|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[136])).
% cnf(283,plain,(aElement0(esk2_4(X1,X3,X4,X2))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X3,X1)|~aReductOfIn0(X2,X3,X1)|~aRewritingSystem0(X1)|~aElement0(X4)|~aElement0(X3)),inference(csr,[status(thm)],[55,31])).
% cnf(284,plain,(aElement0(esk2_4(X1,X3,X4,X2))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X3,X1)|~aReductOfIn0(X2,X3,X1)|~aRewritingSystem0(X1)|~aElement0(X3)),inference(csr,[status(thm)],[283,31])).
% cnf(287,plain,(aElement0(esk2_4(xR,xa,xv,X1))|~isLocallyConfluent0(xR)|~aReductOfIn0(X1,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(spm,[status(thm)],[284,91,theory(equality)])).
% cnf(289,plain,(aElement0(esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(rw,[status(thm)],[287,74,theory(equality)])).
% cnf(290,plain,(aElement0(esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|$false|~aElement0(xa)),inference(rw,[status(thm)],[289,72,theory(equality)])).
% cnf(291,plain,(aElement0(esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|$false|$false),inference(rw,[status(thm)],[290,77,theory(equality)])).
% cnf(292,plain,(aElement0(esk2_4(xR,xa,xv,X1))|~aReductOfIn0(X1,xa,xR)),inference(cn,[status(thm)],[291,theory(equality)])).
% cnf(309,plain,(sdtmndtasgtdt0(X4,X1,esk2_4(X1,X3,X4,X2))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X3,X1)|~aReductOfIn0(X2,X3,X1)|~aRewritingSystem0(X1)|~aElement0(X4)|~aElement0(X3)),inference(csr,[status(thm)],[54,31])).
% cnf(310,plain,(sdtmndtasgtdt0(X4,X1,esk2_4(X1,X3,X4,X2))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X3,X1)|~aReductOfIn0(X2,X3,X1)|~aRewritingSystem0(X1)|~aElement0(X3)),inference(csr,[status(thm)],[309,31])).
% cnf(313,plain,(sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,X1))|~isLocallyConfluent0(xR)|~aReductOfIn0(X1,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(spm,[status(thm)],[310,91,theory(equality)])).
% cnf(315,plain,(sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(rw,[status(thm)],[313,74,theory(equality)])).
% cnf(316,plain,(sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|$false|~aElement0(xa)),inference(rw,[status(thm)],[315,72,theory(equality)])).
% cnf(317,plain,(sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|$false|$false),inference(rw,[status(thm)],[316,77,theory(equality)])).
% cnf(318,plain,(sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,X1))|~aReductOfIn0(X1,xa,xR)),inference(cn,[status(thm)],[317,theory(equality)])).
% cnf(347,plain,(sdtmndtasgtdt0(X2,X1,esk2_4(X1,X3,X4,X2))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X3,X1)|~aReductOfIn0(X2,X3,X1)|~aRewritingSystem0(X1)|~aElement0(X4)|~aElement0(X3)),inference(csr,[status(thm)],[53,31])).
% cnf(348,plain,(sdtmndtasgtdt0(X2,X1,esk2_4(X1,X3,X4,X2))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X3,X1)|~aReductOfIn0(X2,X3,X1)|~aRewritingSystem0(X1)|~aElement0(X3)),inference(csr,[status(thm)],[347,31])).
% cnf(351,plain,(sdtmndtasgtdt0(X1,xR,esk2_4(xR,xa,xv,X1))|~isLocallyConfluent0(xR)|~aReductOfIn0(X1,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(spm,[status(thm)],[348,91,theory(equality)])).
% cnf(353,plain,(sdtmndtasgtdt0(X1,xR,esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(rw,[status(thm)],[351,74,theory(equality)])).
% cnf(354,plain,(sdtmndtasgtdt0(X1,xR,esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|$false|~aElement0(xa)),inference(rw,[status(thm)],[353,72,theory(equality)])).
% cnf(355,plain,(sdtmndtasgtdt0(X1,xR,esk2_4(xR,xa,xv,X1))|$false|~aReductOfIn0(X1,xa,xR)|$false|$false),inference(rw,[status(thm)],[354,77,theory(equality)])).
% cnf(356,plain,(sdtmndtasgtdt0(X1,xR,esk2_4(xR,xa,xv,X1))|~aReductOfIn0(X1,xa,xR)),inference(cn,[status(thm)],[355,theory(equality)])).
% cnf(723,plain,(aElement0(esk2_4(xR,xa,xv,xu))),inference(spm,[status(thm)],[292,88,theory(equality)])).
% cnf(1329,plain,(sdtmndtasgtdt0(xu,xR,esk2_4(xR,xa,xv,xu))),inference(spm,[status(thm)],[356,88,theory(equality)])).
% cnf(1427,negated_conjecture,(~sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,xu))|~aElement0(esk2_4(xR,xa,xv,xu))),inference(spm,[status(thm)],[137,1329,theory(equality)])).
% cnf(1463,negated_conjecture,(~sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,xu))|$false),inference(rw,[status(thm)],[1427,723,theory(equality)])).
% cnf(1464,negated_conjecture,(~sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,xu))),inference(cn,[status(thm)],[1463,theory(equality)])).
% cnf(2389,plain,(sdtmndtasgtdt0(xv,xR,esk2_4(xR,xa,xv,xu))),inference(spm,[status(thm)],[318,88,theory(equality)])).
% cnf(2391,plain,($false),inference(sr,[status(thm)],[2389,1464,theory(equality)])).
% cnf(2392,plain,($false),2391,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 279
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 271
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 10
% # Generated clauses : 614
% # ...of the previous two non-trivial : 557
% # Contextual simplify-reflections : 50
% # Paramodulations : 613
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 248
% # Positive orientable unit clauses: 66
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 175
% # Current number of unprocessed clauses: 335
% # ...number of literals in the above : 1405
% # Clause-clause subsumption calls (NU) : 350
% # Rec. Clause-clause subsumption calls : 168
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 209
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 175 leaves, 2.38+/-2.921 terms/leaf
% # Paramod-from index: 71 leaves, 1.83+/-1.583 terms/leaf
% # Paramod-into index: 131 leaves, 1.96+/-1.924 terms/leaf
% # -------------------------------------------------
% # User time : 0.052 s
% # System time : 0.009 s
% # Total time : 0.061 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP21645/COM017+1.tptp
%
%------------------------------------------------------------------------------