TSTP Solution File: COM012+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM012+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 : 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:38:56 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP25136/COM012+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP25136/COM012+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25136/COM012+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 25232
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(((aElement0(xx)&aRewritingSystem0(xR))&aElement0(xy))&aElement0(xz)),file('/tmp/SRASS.s.p', m__349)).
% fof(2, 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(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(10, conjecture,((sdtmndtasgtdt0(xx,xR,xy)&sdtmndtasgtdt0(xy,xR,xz))=>sdtmndtasgtdt0(xx,xR,xz)),file('/tmp/SRASS.s.p', m__)).
% fof(11, negated_conjecture,~(((sdtmndtasgtdt0(xx,xR,xy)&sdtmndtasgtdt0(xy,xR,xz))=>sdtmndtasgtdt0(xx,xR,xz))),inference(assume_negation,[status(cth)],[10])).
% cnf(16,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[1])).
% cnf(17,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[1])).
% cnf(18,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[1])).
% cnf(19,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[1])).
% fof(20, 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)],[2])).
% fof(21, 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)],[20])).
% fof(22, 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)],[21])).
% cnf(23,plain,(sdtmndtasgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(25,plain,(sdtmndtplgtdt0(X3,X2,X1)|X3=X1|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtasgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(26, 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(27, 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)],[26])).
% cnf(28,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)],[27])).
% fof(51, negated_conjecture,((sdtmndtasgtdt0(xx,xR,xy)&sdtmndtasgtdt0(xy,xR,xz))&~(sdtmndtasgtdt0(xx,xR,xz))),inference(fof_nnf,[status(thm)],[11])).
% cnf(52,negated_conjecture,(~sdtmndtasgtdt0(xx,xR,xz)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,negated_conjecture,(sdtmndtasgtdt0(xy,xR,xz)),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,negated_conjecture,(sdtmndtasgtdt0(xx,xR,xy)),inference(split_conjunct,[status(thm)],[51])).
% cnf(58,negated_conjecture,(~sdtmndtplgtdt0(xx,xR,xz)|~aRewritingSystem0(xR)|~aElement0(xx)|~aElement0(xz)),inference(spm,[status(thm)],[52,23,theory(equality)])).
% cnf(59,negated_conjecture,(~sdtmndtplgtdt0(xx,xR,xz)|$false|~aElement0(xx)|~aElement0(xz)),inference(rw,[status(thm)],[58,18,theory(equality)])).
% cnf(60,negated_conjecture,(~sdtmndtplgtdt0(xx,xR,xz)|$false|$false|~aElement0(xz)),inference(rw,[status(thm)],[59,19,theory(equality)])).
% cnf(61,negated_conjecture,(~sdtmndtplgtdt0(xx,xR,xz)|$false|$false|$false),inference(rw,[status(thm)],[60,16,theory(equality)])).
% cnf(62,negated_conjecture,(~sdtmndtplgtdt0(xx,xR,xz)),inference(cn,[status(thm)],[61,theory(equality)])).
% cnf(63,negated_conjecture,(xz=xy|sdtmndtplgtdt0(xy,xR,xz)|~aRewritingSystem0(xR)|~aElement0(xy)|~aElement0(xz)),inference(spm,[status(thm)],[25,53,theory(equality)])).
% cnf(64,negated_conjecture,(xy=xx|sdtmndtplgtdt0(xx,xR,xy)|~aRewritingSystem0(xR)|~aElement0(xx)|~aElement0(xy)),inference(spm,[status(thm)],[25,54,theory(equality)])).
% cnf(66,negated_conjecture,(xz=xy|sdtmndtplgtdt0(xy,xR,xz)|$false|~aElement0(xy)|~aElement0(xz)),inference(rw,[status(thm)],[63,18,theory(equality)])).
% cnf(67,negated_conjecture,(xz=xy|sdtmndtplgtdt0(xy,xR,xz)|$false|$false|~aElement0(xz)),inference(rw,[status(thm)],[66,17,theory(equality)])).
% cnf(68,negated_conjecture,(xz=xy|sdtmndtplgtdt0(xy,xR,xz)|$false|$false|$false),inference(rw,[status(thm)],[67,16,theory(equality)])).
% cnf(69,negated_conjecture,(xz=xy|sdtmndtplgtdt0(xy,xR,xz)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(70,negated_conjecture,(xy=xx|sdtmndtplgtdt0(xx,xR,xy)|$false|~aElement0(xx)|~aElement0(xy)),inference(rw,[status(thm)],[64,18,theory(equality)])).
% cnf(71,negated_conjecture,(xy=xx|sdtmndtplgtdt0(xx,xR,xy)|$false|$false|~aElement0(xy)),inference(rw,[status(thm)],[70,19,theory(equality)])).
% cnf(72,negated_conjecture,(xy=xx|sdtmndtplgtdt0(xx,xR,xy)|$false|$false|$false),inference(rw,[status(thm)],[71,17,theory(equality)])).
% cnf(73,negated_conjecture,(xy=xx|sdtmndtplgtdt0(xx,xR,xy)),inference(cn,[status(thm)],[72,theory(equality)])).
% cnf(78,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|~aRewritingSystem0(xR)|~aElement0(xy)|~aElement0(xz)|~aElement0(X1)),inference(spm,[status(thm)],[28,69,theory(equality)])).
% cnf(79,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|$false|~aElement0(xy)|~aElement0(xz)|~aElement0(X1)),inference(rw,[status(thm)],[78,18,theory(equality)])).
% cnf(80,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|$false|$false|~aElement0(xz)|~aElement0(X1)),inference(rw,[status(thm)],[79,17,theory(equality)])).
% cnf(81,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|$false|$false|$false|~aElement0(X1)),inference(rw,[status(thm)],[80,16,theory(equality)])).
% cnf(82,negated_conjecture,(sdtmndtplgtdt0(X1,xR,xz)|xz=xy|~sdtmndtplgtdt0(X1,xR,xy)|~aElement0(X1)),inference(cn,[status(thm)],[81,theory(equality)])).
% cnf(88,negated_conjecture,(xz=xy|~sdtmndtplgtdt0(xx,xR,xy)|~aElement0(xx)),inference(spm,[status(thm)],[62,82,theory(equality)])).
% cnf(90,negated_conjecture,(xz=xy|~sdtmndtplgtdt0(xx,xR,xy)|$false),inference(rw,[status(thm)],[88,19,theory(equality)])).
% cnf(91,negated_conjecture,(xz=xy|~sdtmndtplgtdt0(xx,xR,xy)),inference(cn,[status(thm)],[90,theory(equality)])).
% cnf(95,negated_conjecture,(xz=xy|xx=xy),inference(spm,[status(thm)],[91,73,theory(equality)])).
% cnf(98,negated_conjecture,(xz=xy|~sdtmndtasgtdt0(xy,xR,xz)),inference(spm,[status(thm)],[52,95,theory(equality)])).
% cnf(102,negated_conjecture,(xz=xy|$false),inference(rw,[status(thm)],[98,53,theory(equality)])).
% cnf(103,negated_conjecture,(xz=xy),inference(cn,[status(thm)],[102,theory(equality)])).
% cnf(111,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[52,103,theory(equality)]),54,theory(equality)])).
% cnf(112,negated_conjecture,($false),inference(cn,[status(thm)],[111,theory(equality)])).
% cnf(113,negated_conjecture,($false),112,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 42
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 19
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 2
% # Paramodulations : 18
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 34
% # Clause-clause subsumption calls (NU) : 27
% # Rec. Clause-clause subsumption calls : 20
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 19 leaves, 1.63+/-1.037 terms/leaf
% # Paramod-from index: 10 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-into index: 16 leaves, 1.31+/-0.682 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 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/SystemOnTPTP25136/COM012+1.tptp
%
%------------------------------------------------------------------------------