TSTP Solution File: COM012+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM012+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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:39:02 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP25395/COM012+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP25395/COM012+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25395/COM012+3.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 25491
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:((((aElement0(X1)&aRewritingSystem0(X2))&aElement0(X3))&aElement0(X4))=>((sdtmndtplgtdt0(X1,X2,X3)&sdtmndtplgtdt0(X3,X2,X4))=>sdtmndtplgtdt0(X1,X2,X4))),file('/tmp/SRASS.s.p', mTCTrans)).
% fof(5, axiom,(((aElement0(xx)&aRewritingSystem0(xR))&aElement0(xy))&aElement0(xz)),file('/tmp/SRASS.s.p', m__349)).
% fof(10, conjecture,(((((xx=xy|((aReductOfIn0(xy,xx,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xx,xR))&sdtmndtplgtdt0(X1,xR,xy)))&sdtmndtplgtdt0(xx,xR,xy)))&sdtmndtasgtdt0(xx,xR,xy))&(xy=xz|((aReductOfIn0(xz,xy,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xy,xR))&sdtmndtplgtdt0(X1,xR,xz)))&sdtmndtplgtdt0(xy,xR,xz))))&sdtmndtasgtdt0(xy,xR,xz))=>((((xx=xz|aReductOfIn0(xz,xx,xR))|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xx,xR))&sdtmndtplgtdt0(X1,xR,xz)))|sdtmndtplgtdt0(xx,xR,xz))|sdtmndtasgtdt0(xx,xR,xz))),file('/tmp/SRASS.s.p', m__)).
% fof(11, negated_conjecture,~((((((xx=xy|((aReductOfIn0(xy,xx,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xx,xR))&sdtmndtplgtdt0(X1,xR,xy)))&sdtmndtplgtdt0(xx,xR,xy)))&sdtmndtasgtdt0(xx,xR,xy))&(xy=xz|((aReductOfIn0(xz,xy,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xy,xR))&sdtmndtplgtdt0(X1,xR,xz)))&sdtmndtplgtdt0(xy,xR,xz))))&sdtmndtasgtdt0(xy,xR,xz))=>((((xx=xz|aReductOfIn0(xz,xx,xR))|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xx,xR))&sdtmndtplgtdt0(X1,xR,xz)))|sdtmndtplgtdt0(xx,xR,xz))|sdtmndtasgtdt0(xx,xR,xz)))),inference(assume_negation,[status(cth)],[10])).
% fof(30, plain,![X1]:![X2]:![X3]:![X4]:((((~(aElement0(X1))|~(aRewritingSystem0(X2)))|~(aElement0(X3)))|~(aElement0(X4)))|((~(sdtmndtplgtdt0(X1,X2,X3))|~(sdtmndtplgtdt0(X3,X2,X4)))|sdtmndtplgtdt0(X1,X2,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(31, plain,![X5]:![X6]:![X7]:![X8]:((((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|~(aElement0(X8)))|((~(sdtmndtplgtdt0(X5,X6,X7))|~(sdtmndtplgtdt0(X7,X6,X8)))|sdtmndtplgtdt0(X5,X6,X8))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~sdtmndtplgtdt0(X1,X2,X4)|~aElement0(X3)|~aElement0(X4)|~aRewritingSystem0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(39,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[5])).
% cnf(40,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[5])).
% cnf(41,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[5])).
% cnf(42,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[5])).
% fof(51, negated_conjecture,(((((xx=xy|((aReductOfIn0(xy,xx,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xx,xR))&sdtmndtplgtdt0(X1,xR,xy)))&sdtmndtplgtdt0(xx,xR,xy)))&sdtmndtasgtdt0(xx,xR,xy))&(xy=xz|((aReductOfIn0(xz,xy,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xy,xR))&sdtmndtplgtdt0(X1,xR,xz)))&sdtmndtplgtdt0(xy,xR,xz))))&sdtmndtasgtdt0(xy,xR,xz))&((((~(xx=xz)&~(aReductOfIn0(xz,xx,xR)))&![X1]:((~(aElement0(X1))|~(aReductOfIn0(X1,xx,xR)))|~(sdtmndtplgtdt0(X1,xR,xz))))&~(sdtmndtplgtdt0(xx,xR,xz)))&~(sdtmndtasgtdt0(xx,xR,xz)))),inference(fof_nnf,[status(thm)],[11])).
% fof(52, negated_conjecture,(((((xx=xy|((aReductOfIn0(xy,xx,xR)|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xx,xR))&sdtmndtplgtdt0(X2,xR,xy)))&sdtmndtplgtdt0(xx,xR,xy)))&sdtmndtasgtdt0(xx,xR,xy))&(xy=xz|((aReductOfIn0(xz,xy,xR)|?[X3]:((aElement0(X3)&aReductOfIn0(X3,xy,xR))&sdtmndtplgtdt0(X3,xR,xz)))&sdtmndtplgtdt0(xy,xR,xz))))&sdtmndtasgtdt0(xy,xR,xz))&((((~(xx=xz)&~(aReductOfIn0(xz,xx,xR)))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,xx,xR)))|~(sdtmndtplgtdt0(X4,xR,xz))))&~(sdtmndtplgtdt0(xx,xR,xz)))&~(sdtmndtasgtdt0(xx,xR,xz)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(((((xx=xy|((aReductOfIn0(xy,xx,xR)|((aElement0(esk2_0)&aReductOfIn0(esk2_0,xx,xR))&sdtmndtplgtdt0(esk2_0,xR,xy)))&sdtmndtplgtdt0(xx,xR,xy)))&sdtmndtasgtdt0(xx,xR,xy))&(xy=xz|((aReductOfIn0(xz,xy,xR)|((aElement0(esk3_0)&aReductOfIn0(esk3_0,xy,xR))&sdtmndtplgtdt0(esk3_0,xR,xz)))&sdtmndtplgtdt0(xy,xR,xz))))&sdtmndtasgtdt0(xy,xR,xz))&((((~(xx=xz)&~(aReductOfIn0(xz,xx,xR)))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,xx,xR)))|~(sdtmndtplgtdt0(X4,xR,xz))))&~(sdtmndtplgtdt0(xx,xR,xz)))&~(sdtmndtasgtdt0(xx,xR,xz)))),inference(skolemize,[status(esa)],[52])).
% fof(54, negated_conjecture,![X4]:((((((~(aElement0(X4))|~(aReductOfIn0(X4,xx,xR)))|~(sdtmndtplgtdt0(X4,xR,xz)))&(~(xx=xz)&~(aReductOfIn0(xz,xx,xR))))&~(sdtmndtplgtdt0(xx,xR,xz)))&~(sdtmndtasgtdt0(xx,xR,xz)))&((((xx=xy|((aReductOfIn0(xy,xx,xR)|((aElement0(esk2_0)&aReductOfIn0(esk2_0,xx,xR))&sdtmndtplgtdt0(esk2_0,xR,xy)))&sdtmndtplgtdt0(xx,xR,xy)))&sdtmndtasgtdt0(xx,xR,xy))&(xy=xz|((aReductOfIn0(xz,xy,xR)|((aElement0(esk3_0)&aReductOfIn0(esk3_0,xy,xR))&sdtmndtplgtdt0(esk3_0,xR,xz)))&sdtmndtplgtdt0(xy,xR,xz))))&sdtmndtasgtdt0(xy,xR,xz))),inference(shift_quantors,[status(thm)],[53])).
% fof(55, negated_conjecture,![X4]:((((((~(aElement0(X4))|~(aReductOfIn0(X4,xx,xR)))|~(sdtmndtplgtdt0(X4,xR,xz)))&(~(xx=xz)&~(aReductOfIn0(xz,xx,xR))))&~(sdtmndtplgtdt0(xx,xR,xz)))&~(sdtmndtasgtdt0(xx,xR,xz)))&((((((((aElement0(esk2_0)|aReductOfIn0(xy,xx,xR))|xx=xy)&((aReductOfIn0(esk2_0,xx,xR)|aReductOfIn0(xy,xx,xR))|xx=xy))&((sdtmndtplgtdt0(esk2_0,xR,xy)|aReductOfIn0(xy,xx,xR))|xx=xy))&(sdtmndtplgtdt0(xx,xR,xy)|xx=xy))&sdtmndtasgtdt0(xx,xR,xy))&(((((aElement0(esk3_0)|aReductOfIn0(xz,xy,xR))|xy=xz)&((aReductOfIn0(esk3_0,xy,xR)|aReductOfIn0(xz,xy,xR))|xy=xz))&((sdtmndtplgtdt0(esk3_0,xR,xz)|aReductOfIn0(xz,xy,xR))|xy=xz))&(sdtmndtplgtdt0(xy,xR,xz)|xy=xz)))&sdtmndtasgtdt0(xy,xR,xz))),inference(distribute,[status(thm)],[54])).
% cnf(56,negated_conjecture,(sdtmndtasgtdt0(xy,xR,xz)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,(xy=xz|sdtmndtplgtdt0(xy,xR,xz)),inference(split_conjunct,[status(thm)],[55])).
% cnf(61,negated_conjecture,(sdtmndtasgtdt0(xx,xR,xy)),inference(split_conjunct,[status(thm)],[55])).
% cnf(62,negated_conjecture,(xx=xy|sdtmndtplgtdt0(xx,xR,xy)),inference(split_conjunct,[status(thm)],[55])).
% cnf(66,negated_conjecture,(~sdtmndtasgtdt0(xx,xR,xz)),inference(split_conjunct,[status(thm)],[55])).
% cnf(67,negated_conjecture,(~sdtmndtplgtdt0(xx,xR,xz)),inference(split_conjunct,[status(thm)],[55])).
% cnf(181,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|~aRewritingSystem0(xR)|~aElement0(xy)|~aElement0(xz)|~aElement0(X1)),inference(spm,[status(thm)],[32,57,theory(equality)])).
% cnf(183,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|$false|~aElement0(xy)|~aElement0(xz)|~aElement0(X1)),inference(rw,[status(thm)],[181,41,theory(equality)])).
% cnf(184,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|$false|$false|~aElement0(xz)|~aElement0(X1)),inference(rw,[status(thm)],[183,40,theory(equality)])).
% cnf(185,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|$false|$false|$false|~aElement0(X1)),inference(rw,[status(thm)],[184,39,theory(equality)])).
% cnf(186,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|~aElement0(X1)),inference(cn,[status(thm)],[185,theory(equality)])).
% cnf(197,negated_conjecture,(xz=xy|~sdtmndtplgtdt0(xx,xR,xy)|~aElement0(xx)),inference(spm,[status(thm)],[67,186,theory(equality)])).
% cnf(201,negated_conjecture,(xz=xy|~sdtmndtplgtdt0(xx,xR,xy)|$false),inference(rw,[status(thm)],[197,42,theory(equality)])).
% cnf(202,negated_conjecture,(xz=xy|~sdtmndtplgtdt0(xx,xR,xy)),inference(cn,[status(thm)],[201,theory(equality)])).
% cnf(206,negated_conjecture,(xz=xy|xx=xy),inference(spm,[status(thm)],[202,62,theory(equality)])).
% cnf(212,negated_conjecture,(xz=xy|~sdtmndtasgtdt0(xy,xR,xz)),inference(spm,[status(thm)],[66,206,theory(equality)])).
% cnf(216,negated_conjecture,(xz=xy|$false),inference(rw,[status(thm)],[212,56,theory(equality)])).
% cnf(217,negated_conjecture,(xz=xy),inference(cn,[status(thm)],[216,theory(equality)])).
% cnf(229,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[66,217,theory(equality)]),61,theory(equality)])).
% cnf(230,negated_conjecture,($false),inference(cn,[status(thm)],[229,theory(equality)])).
% cnf(231,negated_conjecture,($false),230,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 40
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 15
% # Generated clauses : 47
% # ...of the previous two non-trivial : 42
% # Contextual simplify-reflections : 2
% # Paramodulations : 46
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 14
% # ...number of literals in the above : 68
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 14
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 25 leaves, 1.52+/-0.943 terms/leaf
% # Paramod-from index: 12 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index: 20 leaves, 1.25+/-0.622 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.004 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP25395/COM012+3.tptp
%
%------------------------------------------------------------------------------