TSTP Solution File: COM021+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM021+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 : art09.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:42:46 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP11265/COM021+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11265/COM021+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11265/COM021+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 11361
% 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,![X1]:![X2]:((aElement0(X1)&aRewritingSystem0(X2))=>![X3]:(aNormalFormOfIn0(X3,X1,X2)<=>((aElement0(X3)&sdtmndtasgtdt0(X1,X2,X3))&~(?[X4]:aReductOfIn0(X4,X3,X2))))),file('/tmp/SRASS.s.p', mNFRDef)).
% fof(9, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(16, axiom,((aElement0(xw)&sdtmndtasgtdt0(xu,xR,xw))&sdtmndtasgtdt0(xv,xR,xw)),file('/tmp/SRASS.s.p', m__799)).
% fof(17, axiom,aNormalFormOfIn0(xd,xw,xR),file('/tmp/SRASS.s.p', m__818)).
% fof(18, axiom,((aElement0(xx)&sdtmndtasgtdt0(xb,xR,xx))&sdtmndtasgtdt0(xd,xR,xx)),file('/tmp/SRASS.s.p', m__850)).
% fof(19, 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(25, conjecture,sdtmndtasgtdt0(xb,xR,xd),file('/tmp/SRASS.s.p', m__)).
% fof(26, negated_conjecture,~(sdtmndtasgtdt0(xb,xR,xd)),inference(assume_negation,[status(cth)],[25])).
% fof(31, negated_conjecture,~(sdtmndtasgtdt0(xb,xR,xd)),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(36, 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(37, 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)],[36])).
% fof(38, 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)],[37])).
% fof(39, 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)],[38])).
% fof(40, 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)],[39])).
% cnf(42,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)],[40])).
% fof(76, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:((~(aNormalFormOfIn0(X3,X1,X2))|((aElement0(X3)&sdtmndtasgtdt0(X1,X2,X3))&![X4]:~(aReductOfIn0(X4,X3,X2))))&(((~(aElement0(X3))|~(sdtmndtasgtdt0(X1,X2,X3)))|?[X4]:aReductOfIn0(X4,X3,X2))|aNormalFormOfIn0(X3,X1,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(77, plain,![X5]:![X6]:((~(aElement0(X5))|~(aRewritingSystem0(X6)))|![X7]:((~(aNormalFormOfIn0(X7,X5,X6))|((aElement0(X7)&sdtmndtasgtdt0(X5,X6,X7))&![X8]:~(aReductOfIn0(X8,X7,X6))))&(((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|?[X9]:aReductOfIn0(X9,X7,X6))|aNormalFormOfIn0(X7,X5,X6)))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X5]:![X6]:((~(aElement0(X5))|~(aRewritingSystem0(X6)))|![X7]:((~(aNormalFormOfIn0(X7,X5,X6))|((aElement0(X7)&sdtmndtasgtdt0(X5,X6,X7))&![X8]:~(aReductOfIn0(X8,X7,X6))))&(((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X5]:![X6]:![X7]:![X8]:((((~(aReductOfIn0(X8,X7,X6))&(aElement0(X7)&sdtmndtasgtdt0(X5,X6,X7)))|~(aNormalFormOfIn0(X7,X5,X6)))&(((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6)))),inference(shift_quantors,[status(thm)],[78])).
% fof(80, plain,![X5]:![X6]:![X7]:![X8]:((((~(aReductOfIn0(X8,X7,X6))|~(aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))&(((aElement0(X7)|~(aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))&((sdtmndtasgtdt0(X5,X6,X7)|~(aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))))&((((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))),inference(distribute,[status(thm)],[79])).
% cnf(83,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[80])).
% cnf(84,plain,(~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)|~aReductOfIn0(X4,X3,X1)),inference(split_conjunct,[status(thm)],[80])).
% cnf(90,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[9])).
% cnf(113,plain,(aElement0(xw)),inference(split_conjunct,[status(thm)],[16])).
% cnf(114,plain,(aNormalFormOfIn0(xd,xw,xR)),inference(split_conjunct,[status(thm)],[17])).
% cnf(115,plain,(sdtmndtasgtdt0(xd,xR,xx)),inference(split_conjunct,[status(thm)],[18])).
% cnf(116,plain,(sdtmndtasgtdt0(xb,xR,xx)),inference(split_conjunct,[status(thm)],[18])).
% cnf(117,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[18])).
% fof(118, 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)],[19])).
% fof(119, 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)],[118])).
% fof(120, 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)],[119])).
% cnf(123,plain,(sdtmndtplgtdt0(X3,X2,X1)|X3=X1|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtasgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[120])).
% cnf(146,negated_conjecture,(~sdtmndtasgtdt0(xb,xR,xd)),inference(split_conjunct,[status(thm)],[31])).
% cnf(167,plain,(aElement0(xd)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[83,114,theory(equality)])).
% cnf(168,plain,(~aReductOfIn0(X1,xd,xR)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[84,114,theory(equality)])).
% cnf(170,plain,(aElement0(xd)|$false|~aElement0(xw)),inference(rw,[status(thm)],[167,90,theory(equality)])).
% cnf(171,plain,(aElement0(xd)|$false|$false),inference(rw,[status(thm)],[170,113,theory(equality)])).
% cnf(172,plain,(aElement0(xd)),inference(cn,[status(thm)],[171,theory(equality)])).
% cnf(173,plain,(~aReductOfIn0(X1,xd,xR)|$false|~aElement0(xw)),inference(rw,[status(thm)],[168,90,theory(equality)])).
% cnf(174,plain,(~aReductOfIn0(X1,xd,xR)|$false|$false),inference(rw,[status(thm)],[173,113,theory(equality)])).
% cnf(175,plain,(~aReductOfIn0(X1,xd,xR)),inference(cn,[status(thm)],[174,theory(equality)])).
% cnf(201,plain,(xx=xd|sdtmndtplgtdt0(xd,xR,xx)|~aRewritingSystem0(xR)|~aElement0(xd)|~aElement0(xx)),inference(spm,[status(thm)],[123,115,theory(equality)])).
% cnf(207,plain,(xx=xd|sdtmndtplgtdt0(xd,xR,xx)|$false|~aElement0(xd)|~aElement0(xx)),inference(rw,[status(thm)],[201,90,theory(equality)])).
% cnf(208,plain,(xx=xd|sdtmndtplgtdt0(xd,xR,xx)|$false|~aElement0(xd)|$false),inference(rw,[status(thm)],[207,117,theory(equality)])).
% cnf(209,plain,(xx=xd|sdtmndtplgtdt0(xd,xR,xx)|~aElement0(xd)),inference(cn,[status(thm)],[208,theory(equality)])).
% cnf(1016,plain,(xd=xx|sdtmndtplgtdt0(xd,xR,xx)|$false),inference(rw,[status(thm)],[209,172,theory(equality)])).
% cnf(1017,plain,(xd=xx|sdtmndtplgtdt0(xd,xR,xx)),inference(cn,[status(thm)],[1016,theory(equality)])).
% cnf(1019,plain,(aReductOfIn0(esk1_3(xd,xR,xx),xd,xR)|aReductOfIn0(xx,xd,xR)|xd=xx|~aRewritingSystem0(xR)|~aElement0(xd)|~aElement0(xx)),inference(spm,[status(thm)],[42,1017,theory(equality)])).
% cnf(1029,plain,(aReductOfIn0(esk1_3(xd,xR,xx),xd,xR)|aReductOfIn0(xx,xd,xR)|xd=xx|$false|~aElement0(xd)|~aElement0(xx)),inference(rw,[status(thm)],[1019,90,theory(equality)])).
% cnf(1030,plain,(aReductOfIn0(esk1_3(xd,xR,xx),xd,xR)|aReductOfIn0(xx,xd,xR)|xd=xx|$false|$false|~aElement0(xx)),inference(rw,[status(thm)],[1029,172,theory(equality)])).
% cnf(1031,plain,(aReductOfIn0(esk1_3(xd,xR,xx),xd,xR)|aReductOfIn0(xx,xd,xR)|xd=xx|$false|$false|$false),inference(rw,[status(thm)],[1030,117,theory(equality)])).
% cnf(1032,plain,(aReductOfIn0(esk1_3(xd,xR,xx),xd,xR)|aReductOfIn0(xx,xd,xR)|xd=xx),inference(cn,[status(thm)],[1031,theory(equality)])).
% cnf(1033,plain,(aReductOfIn0(xx,xd,xR)|xd=xx),inference(sr,[status(thm)],[1032,175,theory(equality)])).
% cnf(1034,plain,(xd=xx),inference(sr,[status(thm)],[1033,175,theory(equality)])).
% cnf(1060,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[146,1034,theory(equality)]),116,theory(equality)])).
% cnf(1061,negated_conjecture,($false),inference(cn,[status(thm)],[1060,theory(equality)])).
% cnf(1062,negated_conjecture,($false),1061,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 105
% # ...of these trivial : 1
% # ...subsumed : 2
% # ...remaining for further processing: 102
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 216
% # ...of the previous two non-trivial : 176
% # Contextual simplify-reflections : 12
% # Paramodulations : 215
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 93
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 122
% # ...number of literals in the above : 450
% # Clause-clause subsumption calls (NU) : 62
% # Rec. Clause-clause subsumption calls : 41
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 23
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 90 leaves, 1.78+/-1.971 terms/leaf
% # Paramod-from index: 42 leaves, 1.29+/-0.825 terms/leaf
% # Paramod-into index: 71 leaves, 1.44+/-1.084 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.004 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP11265/COM021+1.tptp
%
%------------------------------------------------------------------------------