TSTP Solution File: COM021+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM021+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:54 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/SystemOnTPTP13653/COM021+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13653/COM021+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13653/COM021+4.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 13749
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.040 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(18, axiom,((((aElement0(xd)&(xw=xd|((aReductOfIn0(xd,xw,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xw,xR))&sdtmndtplgtdt0(X1,xR,xd)))&sdtmndtplgtdt0(xw,xR,xd))))&sdtmndtasgtdt0(xw,xR,xd))&~(?[X1]:aReductOfIn0(X1,xd,xR)))&aNormalFormOfIn0(xd,xw,xR)),file('/tmp/SRASS.s.p', m__818)).
% fof(19, axiom,((((aElement0(xx)&(xb=xx|((aReductOfIn0(xx,xb,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xb,xR))&sdtmndtplgtdt0(X1,xR,xx)))&sdtmndtplgtdt0(xb,xR,xx))))&sdtmndtasgtdt0(xb,xR,xx))&(xd=xx|((aReductOfIn0(xx,xd,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xd,xR))&sdtmndtplgtdt0(X1,xR,xx)))&sdtmndtplgtdt0(xd,xR,xx))))&sdtmndtasgtdt0(xd,xR,xx)),file('/tmp/SRASS.s.p', m__850)).
% fof(25, conjecture,((((xb=xd|aReductOfIn0(xd,xb,xR))|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xb,xR))&sdtmndtplgtdt0(X1,xR,xd)))|sdtmndtplgtdt0(xb,xR,xd))|sdtmndtasgtdt0(xb,xR,xd)),file('/tmp/SRASS.s.p', m__)).
% fof(26, negated_conjecture,~(((((xb=xd|aReductOfIn0(xd,xb,xR))|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xb,xR))&sdtmndtplgtdt0(X1,xR,xd)))|sdtmndtplgtdt0(xb,xR,xd))|sdtmndtasgtdt0(xb,xR,xd))),inference(assume_negation,[status(cth)],[25])).
% fof(445, plain,((((aElement0(xd)&(xw=xd|((aReductOfIn0(xd,xw,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xw,xR))&sdtmndtplgtdt0(X1,xR,xd)))&sdtmndtplgtdt0(xw,xR,xd))))&sdtmndtasgtdt0(xw,xR,xd))&![X1]:~(aReductOfIn0(X1,xd,xR)))&aNormalFormOfIn0(xd,xw,xR)),inference(fof_nnf,[status(thm)],[18])).
% fof(446, plain,((((aElement0(xd)&(xw=xd|((aReductOfIn0(xd,xw,xR)|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xw,xR))&sdtmndtplgtdt0(X2,xR,xd)))&sdtmndtplgtdt0(xw,xR,xd))))&sdtmndtasgtdt0(xw,xR,xd))&![X3]:~(aReductOfIn0(X3,xd,xR)))&aNormalFormOfIn0(xd,xw,xR)),inference(variable_rename,[status(thm)],[445])).
% fof(447, plain,((((aElement0(xd)&(xw=xd|((aReductOfIn0(xd,xw,xR)|((aElement0(esk22_0)&aReductOfIn0(esk22_0,xw,xR))&sdtmndtplgtdt0(esk22_0,xR,xd)))&sdtmndtplgtdt0(xw,xR,xd))))&sdtmndtasgtdt0(xw,xR,xd))&![X3]:~(aReductOfIn0(X3,xd,xR)))&aNormalFormOfIn0(xd,xw,xR)),inference(skolemize,[status(esa)],[446])).
% fof(448, plain,![X3]:((~(aReductOfIn0(X3,xd,xR))&((aElement0(xd)&(xw=xd|((aReductOfIn0(xd,xw,xR)|((aElement0(esk22_0)&aReductOfIn0(esk22_0,xw,xR))&sdtmndtplgtdt0(esk22_0,xR,xd)))&sdtmndtplgtdt0(xw,xR,xd))))&sdtmndtasgtdt0(xw,xR,xd)))&aNormalFormOfIn0(xd,xw,xR)),inference(shift_quantors,[status(thm)],[447])).
% fof(449, plain,![X3]:((~(aReductOfIn0(X3,xd,xR))&((aElement0(xd)&(((((aElement0(esk22_0)|aReductOfIn0(xd,xw,xR))|xw=xd)&((aReductOfIn0(esk22_0,xw,xR)|aReductOfIn0(xd,xw,xR))|xw=xd))&((sdtmndtplgtdt0(esk22_0,xR,xd)|aReductOfIn0(xd,xw,xR))|xw=xd))&(sdtmndtplgtdt0(xw,xR,xd)|xw=xd)))&sdtmndtasgtdt0(xw,xR,xd)))&aNormalFormOfIn0(xd,xw,xR)),inference(distribute,[status(thm)],[448])).
% cnf(457,plain,(~aReductOfIn0(X1,xd,xR)),inference(split_conjunct,[status(thm)],[449])).
% fof(458, plain,((((aElement0(xx)&(xb=xx|((aReductOfIn0(xx,xb,xR)|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xb,xR))&sdtmndtplgtdt0(X2,xR,xx)))&sdtmndtplgtdt0(xb,xR,xx))))&sdtmndtasgtdt0(xb,xR,xx))&(xd=xx|((aReductOfIn0(xx,xd,xR)|?[X3]:((aElement0(X3)&aReductOfIn0(X3,xd,xR))&sdtmndtplgtdt0(X3,xR,xx)))&sdtmndtplgtdt0(xd,xR,xx))))&sdtmndtasgtdt0(xd,xR,xx)),inference(variable_rename,[status(thm)],[19])).
% fof(459, plain,((((aElement0(xx)&(xb=xx|((aReductOfIn0(xx,xb,xR)|((aElement0(esk23_0)&aReductOfIn0(esk23_0,xb,xR))&sdtmndtplgtdt0(esk23_0,xR,xx)))&sdtmndtplgtdt0(xb,xR,xx))))&sdtmndtasgtdt0(xb,xR,xx))&(xd=xx|((aReductOfIn0(xx,xd,xR)|((aElement0(esk24_0)&aReductOfIn0(esk24_0,xd,xR))&sdtmndtplgtdt0(esk24_0,xR,xx)))&sdtmndtplgtdt0(xd,xR,xx))))&sdtmndtasgtdt0(xd,xR,xx)),inference(skolemize,[status(esa)],[458])).
% fof(460, plain,((((aElement0(xx)&(((((aElement0(esk23_0)|aReductOfIn0(xx,xb,xR))|xb=xx)&((aReductOfIn0(esk23_0,xb,xR)|aReductOfIn0(xx,xb,xR))|xb=xx))&((sdtmndtplgtdt0(esk23_0,xR,xx)|aReductOfIn0(xx,xb,xR))|xb=xx))&(sdtmndtplgtdt0(xb,xR,xx)|xb=xx)))&sdtmndtasgtdt0(xb,xR,xx))&(((((aElement0(esk24_0)|aReductOfIn0(xx,xd,xR))|xd=xx)&((aReductOfIn0(esk24_0,xd,xR)|aReductOfIn0(xx,xd,xR))|xd=xx))&((sdtmndtplgtdt0(esk24_0,xR,xx)|aReductOfIn0(xx,xd,xR))|xd=xx))&(sdtmndtplgtdt0(xd,xR,xx)|xd=xx)))&sdtmndtasgtdt0(xd,xR,xx)),inference(distribute,[status(thm)],[459])).
% cnf(464,plain,(xd=xx|aReductOfIn0(xx,xd,xR)|aReductOfIn0(esk24_0,xd,xR)),inference(split_conjunct,[status(thm)],[460])).
% cnf(467,plain,(xb=xx|sdtmndtplgtdt0(xb,xR,xx)),inference(split_conjunct,[status(thm)],[460])).
% fof(494, negated_conjecture,((((~(xb=xd)&~(aReductOfIn0(xd,xb,xR)))&![X1]:((~(aElement0(X1))|~(aReductOfIn0(X1,xb,xR)))|~(sdtmndtplgtdt0(X1,xR,xd))))&~(sdtmndtplgtdt0(xb,xR,xd)))&~(sdtmndtasgtdt0(xb,xR,xd))),inference(fof_nnf,[status(thm)],[26])).
% fof(495, negated_conjecture,((((~(xb=xd)&~(aReductOfIn0(xd,xb,xR)))&![X2]:((~(aElement0(X2))|~(aReductOfIn0(X2,xb,xR)))|~(sdtmndtplgtdt0(X2,xR,xd))))&~(sdtmndtplgtdt0(xb,xR,xd)))&~(sdtmndtasgtdt0(xb,xR,xd))),inference(variable_rename,[status(thm)],[494])).
% fof(496, negated_conjecture,![X2]:(((((~(aElement0(X2))|~(aReductOfIn0(X2,xb,xR)))|~(sdtmndtplgtdt0(X2,xR,xd)))&(~(xb=xd)&~(aReductOfIn0(xd,xb,xR))))&~(sdtmndtplgtdt0(xb,xR,xd)))&~(sdtmndtasgtdt0(xb,xR,xd))),inference(shift_quantors,[status(thm)],[495])).
% cnf(498,negated_conjecture,(~sdtmndtplgtdt0(xb,xR,xd)),inference(split_conjunct,[status(thm)],[496])).
% cnf(500,negated_conjecture,(xb!=xd),inference(split_conjunct,[status(thm)],[496])).
% cnf(676,plain,(xx=xd|aReductOfIn0(esk24_0,xd,xR)),inference(sr,[status(thm)],[464,457,theory(equality)])).
% cnf(677,plain,(xx=xd),inference(sr,[status(thm)],[676,457,theory(equality)])).
% cnf(689,plain,(xd=xb|sdtmndtplgtdt0(xb,xR,xx)),inference(rw,[status(thm)],[467,677,theory(equality)])).
% cnf(690,plain,(xd=xb|sdtmndtplgtdt0(xb,xR,xd)),inference(rw,[status(thm)],[689,677,theory(equality)])).
% cnf(691,plain,(sdtmndtplgtdt0(xb,xR,xd)),inference(sr,[status(thm)],[690,500,theory(equality)])).
% cnf(692,plain,($false),inference(sr,[status(thm)],[691,498,theory(equality)])).
% cnf(693,plain,($false),692,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 69
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 44
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 0
% # Paramodulations : 43
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 60
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 351
% # ...number of literals in the above : 2825
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 90 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-from index: 44 leaves, 1.11+/-0.317 terms/leaf
% # Paramod-into index: 72 leaves, 1.10+/-0.296 terms/leaf
% # -------------------------------------------------
% # User time : 0.042 s
% # System time : 0.003 s
% # Total time : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.25 WC
% FINAL PrfWatch: 0.17 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP13653/COM021+4.tptp
%
%------------------------------------------------------------------------------