TSTP Solution File: NUM561+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM561+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 : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:11:30 EST 2010

% Result   : Theorem 1.83s
% Output   : Solution 1.83s
% 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/SystemOnTPTP16448/NUM561+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP16448/NUM561+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16448/NUM561+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 16580
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aFunction0(xF),file('/tmp/SRASS.s.p', m__2911)).
% fof(2, axiom,aElementOf0(xx,szDzozmdt0(xF)),file('/tmp/SRASS.s.p', m__2911_02)).
% fof(3, axiom,![X1]:(aFunction0(X1)=>aSet0(szDzozmdt0(X1))),file('/tmp/SRASS.s.p', mDomSet)).
% fof(5, axiom,![X1]:(aFunction0(X1)=>![X2]:(aSubsetOf0(X2,szDzozmdt0(X1))=>![X3]:(X3=sdtlcdtrc0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>?[X5]:(aElementOf0(X5,X2)&sdtlpdtrp0(X1,X5)=X4)))))),file('/tmp/SRASS.s.p', mDefSImg)).
% fof(8, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(71, conjecture,aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),file('/tmp/SRASS.s.p', m__)).
% fof(72, negated_conjecture,~(aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF)))),inference(assume_negation,[status(cth)],[71])).
% fof(85, negated_conjecture,~(aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF)))),inference(fof_simplification,[status(thm)],[72,theory(equality)])).
% cnf(86,plain,(aFunction0(xF)),inference(split_conjunct,[status(thm)],[1])).
% cnf(87,plain,(aElementOf0(xx,szDzozmdt0(xF))),inference(split_conjunct,[status(thm)],[2])).
% fof(88, plain,![X1]:(~(aFunction0(X1))|aSet0(szDzozmdt0(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(89, plain,![X2]:(~(aFunction0(X2))|aSet0(szDzozmdt0(X2))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(aSet0(szDzozmdt0(X1))|~aFunction0(X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(95, plain,![X1]:(~(aFunction0(X1))|![X2]:(~(aSubsetOf0(X2,szDzozmdt0(X1)))|![X3]:((~(X3=sdtlcdtrc0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|?[X5]:(aElementOf0(X5,X2)&sdtlpdtrp0(X1,X5)=X4))&(![X5]:(~(aElementOf0(X5,X2))|~(sdtlpdtrp0(X1,X5)=X4))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|![X5]:(~(aElementOf0(X5,X2))|~(sdtlpdtrp0(X1,X5)=X4)))&(aElementOf0(X4,X3)|?[X5]:(aElementOf0(X5,X2)&sdtlpdtrp0(X1,X5)=X4))))|X3=sdtlcdtrc0(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(96, plain,![X6]:(~(aFunction0(X6))|![X7]:(~(aSubsetOf0(X7,szDzozmdt0(X6)))|![X8]:((~(X8=sdtlcdtrc0(X6,X7))|(aSet0(X8)&![X9]:((~(aElementOf0(X9,X8))|?[X10]:(aElementOf0(X10,X7)&sdtlpdtrp0(X6,X10)=X9))&(![X11]:(~(aElementOf0(X11,X7))|~(sdtlpdtrp0(X6,X11)=X9))|aElementOf0(X9,X8)))))&((~(aSet0(X8))|?[X12]:((~(aElementOf0(X12,X8))|![X13]:(~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=X12)))&(aElementOf0(X12,X8)|?[X14]:(aElementOf0(X14,X7)&sdtlpdtrp0(X6,X14)=X12))))|X8=sdtlcdtrc0(X6,X7))))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X6]:(~(aFunction0(X6))|![X7]:(~(aSubsetOf0(X7,szDzozmdt0(X6)))|![X8]:((~(X8=sdtlcdtrc0(X6,X7))|(aSet0(X8)&![X9]:((~(aElementOf0(X9,X8))|(aElementOf0(esk1_4(X6,X7,X8,X9),X7)&sdtlpdtrp0(X6,esk1_4(X6,X7,X8,X9))=X9))&(![X11]:(~(aElementOf0(X11,X7))|~(sdtlpdtrp0(X6,X11)=X9))|aElementOf0(X9,X8)))))&((~(aSet0(X8))|((~(aElementOf0(esk2_3(X6,X7,X8),X8))|![X13]:(~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=esk2_3(X6,X7,X8))))&(aElementOf0(esk2_3(X6,X7,X8),X8)|(aElementOf0(esk3_3(X6,X7,X8),X7)&sdtlpdtrp0(X6,esk3_3(X6,X7,X8))=esk2_3(X6,X7,X8)))))|X8=sdtlcdtrc0(X6,X7))))),inference(skolemize,[status(esa)],[96])).
% fof(98, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X13]:((((((((~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=esk2_3(X6,X7,X8)))|~(aElementOf0(esk2_3(X6,X7,X8),X8)))&(aElementOf0(esk2_3(X6,X7,X8),X8)|(aElementOf0(esk3_3(X6,X7,X8),X7)&sdtlpdtrp0(X6,esk3_3(X6,X7,X8))=esk2_3(X6,X7,X8))))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))&(((((~(aElementOf0(X11,X7))|~(sdtlpdtrp0(X6,X11)=X9))|aElementOf0(X9,X8))&(~(aElementOf0(X9,X8))|(aElementOf0(esk1_4(X6,X7,X8,X9),X7)&sdtlpdtrp0(X6,esk1_4(X6,X7,X8,X9))=X9)))&aSet0(X8))|~(X8=sdtlcdtrc0(X6,X7))))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6))),inference(shift_quantors,[status(thm)],[97])).
% fof(99, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X13]:((((((((~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=esk2_3(X6,X7,X8)))|~(aElementOf0(esk2_3(X6,X7,X8),X8)))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&((((((aElementOf0(esk3_3(X6,X7,X8),X7)|aElementOf0(esk2_3(X6,X7,X8),X8))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&(((((sdtlpdtrp0(X6,esk3_3(X6,X7,X8))=esk2_3(X6,X7,X8)|aElementOf0(esk2_3(X6,X7,X8),X8))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))))&(((((((~(aElementOf0(X11,X7))|~(sdtlpdtrp0(X6,X11)=X9))|aElementOf0(X9,X8))|~(X8=sdtlcdtrc0(X6,X7)))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&(((((aElementOf0(esk1_4(X6,X7,X8,X9),X7)|~(aElementOf0(X9,X8)))|~(X8=sdtlcdtrc0(X6,X7)))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&((((sdtlpdtrp0(X6,esk1_4(X6,X7,X8,X9))=X9|~(aElementOf0(X9,X8)))|~(X8=sdtlcdtrc0(X6,X7)))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))))&(((aSet0(X8)|~(X8=sdtlcdtrc0(X6,X7)))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6))))),inference(distribute,[status(thm)],[98])).
% cnf(103,plain,(aElementOf0(X4,X3)|~aFunction0(X1)|~aSubsetOf0(X2,szDzozmdt0(X1))|X3!=sdtlcdtrc0(X1,X2)|sdtlpdtrp0(X1,X5)!=X4|~aElementOf0(X5,X2)),inference(split_conjunct,[status(thm)],[99])).
% fof(128, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(129, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[128])).
% cnf(130,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[129])).
% cnf(401,negated_conjecture,(~aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF)))),inference(split_conjunct,[status(thm)],[85])).
% cnf(715,plain,(aElementOf0(sdtlpdtrp0(X1,X2),X3)|sdtlcdtrc0(X1,X4)!=X3|~aSubsetOf0(X4,szDzozmdt0(X1))|~aElementOf0(X2,X4)|~aFunction0(X1)),inference(er,[status(thm)],[103,theory(equality)])).
% cnf(8908,plain,(aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,X3))|~aSubsetOf0(X3,szDzozmdt0(X1))|~aElementOf0(X2,X3)|~aFunction0(X1)),inference(er,[status(thm)],[715,theory(equality)])).
% cnf(10055,negated_conjecture,(~aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF))|~aElementOf0(xx,szDzozmdt0(xF))|~aFunction0(xF)),inference(spm,[status(thm)],[401,8908,theory(equality)])).
% cnf(10060,negated_conjecture,(~aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF))|$false|~aFunction0(xF)),inference(rw,[status(thm)],[10055,87,theory(equality)])).
% cnf(10061,negated_conjecture,(~aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF))|$false|$false),inference(rw,[status(thm)],[10060,86,theory(equality)])).
% cnf(10062,negated_conjecture,(~aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF))),inference(cn,[status(thm)],[10061,theory(equality)])).
% cnf(10082,negated_conjecture,(~aSet0(szDzozmdt0(xF))),inference(spm,[status(thm)],[10062,130,theory(equality)])).
% cnf(10088,negated_conjecture,(~aFunction0(xF)),inference(spm,[status(thm)],[10082,90,theory(equality)])).
% cnf(10089,negated_conjecture,($false),inference(rw,[status(thm)],[10088,86,theory(equality)])).
% cnf(10090,negated_conjecture,($false),inference(cn,[status(thm)],[10089,theory(equality)])).
% cnf(10091,negated_conjecture,($false),10090,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1749
% # ...of these trivial                : 26
% # ...subsumed                        : 857
% # ...remaining for further processing: 866
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 112
% # Backward-rewritten                 : 31
% # Generated clauses                  : 5808
% # ...of the previous two non-trivial : 5291
% # Contextual simplify-reflections    : 1010
% # Paramodulations                    : 5675
% # Factorizations                     : 0
% # Equation resolutions               : 104
% # Current number of processed clauses: 580
% #    Positive orientable unit clauses: 33
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 17
% #    Non-unit-clauses                : 530
% # Current number of unprocessed clauses: 2834
% # ...number of literals in the above : 19501
% # Clause-clause subsumption calls (NU) : 21134
% # Rec. Clause-clause subsumption calls : 9491
% # Unit Clause-clause subsumption calls : 585
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 17
% # Indexed BW rewrite successes       : 16
% # Backwards rewriting index:   421 leaves,   1.43+/-1.157 terms/leaf
% # Paramod-from index:          202 leaves,   1.05+/-0.248 terms/leaf
% # Paramod-into index:          325 leaves,   1.36+/-0.929 terms/leaf
% # -------------------------------------------------
% # User time              : 0.422 s
% # System time            : 0.020 s
% # Total time             : 0.442 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.69 CPU 0.75 WC
% FINAL PrfWatch: 0.69 CPU 0.75 WC
% SZS output end Solution for /tmp/SystemOnTPTP16448/NUM561+1.tptp
% 
%------------------------------------------------------------------------------