TSTP Solution File: COM018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM018+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 : art05.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:14 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP15213/COM018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP15213/COM018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15213/COM018+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 15309
% 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(8, axiom,![X1]:((aRewritingSystem0(X1)&isTerminating0(X1))=>![X2]:(aElement0(X2)=>?[X3]:aNormalFormOfIn0(X3,X2,X1))),file('/tmp/SRASS.s.p', mTermNF)).
% fof(9, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(10, axiom,(isLocallyConfluent0(xR)&isTerminating0(xR)),file('/tmp/SRASS.s.p', m__656_01)).
% fof(16, axiom,((aElement0(xw)&sdtmndtasgtdt0(xu,xR,xw))&sdtmndtasgtdt0(xv,xR,xw)),file('/tmp/SRASS.s.p', m__799)).
% fof(23, conjecture,?[X1]:aNormalFormOfIn0(X1,xw,xR),file('/tmp/SRASS.s.p', m__)).
% fof(24, negated_conjecture,~(?[X1]:aNormalFormOfIn0(X1,xw,xR)),inference(assume_negation,[status(cth)],[23])).
% fof(82, plain,![X1]:((~(aRewritingSystem0(X1))|~(isTerminating0(X1)))|![X2]:(~(aElement0(X2))|?[X3]:aNormalFormOfIn0(X3,X2,X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(83, plain,![X4]:((~(aRewritingSystem0(X4))|~(isTerminating0(X4)))|![X5]:(~(aElement0(X5))|?[X6]:aNormalFormOfIn0(X6,X5,X4))),inference(variable_rename,[status(thm)],[82])).
% fof(84, plain,![X4]:((~(aRewritingSystem0(X4))|~(isTerminating0(X4)))|![X5]:(~(aElement0(X5))|aNormalFormOfIn0(esk9_2(X4,X5),X5,X4))),inference(skolemize,[status(esa)],[83])).
% fof(85, plain,![X4]:![X5]:((~(aElement0(X5))|aNormalFormOfIn0(esk9_2(X4,X5),X5,X4))|(~(aRewritingSystem0(X4))|~(isTerminating0(X4)))),inference(shift_quantors,[status(thm)],[84])).
% cnf(86,plain,(aNormalFormOfIn0(esk9_2(X1,X2),X2,X1)|~isTerminating0(X1)|~aRewritingSystem0(X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[9])).
% cnf(88,plain,(isTerminating0(xR)),inference(split_conjunct,[status(thm)],[10])).
% cnf(110,plain,(aElement0(xw)),inference(split_conjunct,[status(thm)],[16])).
% fof(139, negated_conjecture,![X1]:~(aNormalFormOfIn0(X1,xw,xR)),inference(fof_nnf,[status(thm)],[24])).
% fof(140, negated_conjecture,![X2]:~(aNormalFormOfIn0(X2,xw,xR)),inference(variable_rename,[status(thm)],[139])).
% cnf(141,negated_conjecture,(~aNormalFormOfIn0(X1,xw,xR)),inference(split_conjunct,[status(thm)],[140])).
% cnf(207,negated_conjecture,(~isTerminating0(xR)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[141,86,theory(equality)])).
% cnf(211,negated_conjecture,($false|~aRewritingSystem0(xR)|~aElement0(xw)),inference(rw,[status(thm)],[207,88,theory(equality)])).
% cnf(212,negated_conjecture,($false|$false|~aElement0(xw)),inference(rw,[status(thm)],[211,87,theory(equality)])).
% cnf(213,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[212,110,theory(equality)])).
% cnf(214,negated_conjecture,($false),inference(cn,[status(thm)],[213,theory(equality)])).
% cnf(215,negated_conjecture,($false),214,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 20
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 1
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number
% of processed clauses: 40
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 151
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 58 leaves, 1.22+/-0.527 terms/leaf
% # Paramod-from index: 25 leaves, 1.12+/-0.325 terms/leaf
% # Paramod-into index: 49 leaves, 1.12+/-0.328 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.002 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP15213/COM018+1.tptp
%
%------------------------------------------------------------------------------