TSTP Solution File: NUM625+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM625+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 : art01.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 : Wed Dec 29 20:41:03 EST 2010
% Result : Theorem 1.45s
% Output : Solution 1.45s
% 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/SystemOnTPTP16650/NUM625+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16650/NUM625+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16650/NUM625+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 16746
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(65, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(70, axiom,(aSubsetOf0(xQ,xO)&~(xQ=slcrc0)),file('/tmp/SRASS.s.p', m__5093)).
% fof(73, axiom,xp=szmzizndt0(xQ),file('/tmp/SRASS.s.p', m__5147)).
% fof(74, axiom,(aSet0(xP)&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(83, axiom,aElementOf0(xx,xP),file('/tmp/SRASS.s.p', m__5348)).
% fof(90, axiom,xp=xx,file('/tmp/SRASS.s.p', m__5496)).
% fof(101, axiom,![X1]:![X2]:((aSet0(X1)&aElement0(X2))=>![X3]:(X3=sdtmndt0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(117, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(152, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(153, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[153])).
% fof(155, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[154])).
% fof(156, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk2_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk2_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[155])).
% cnf(159,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[156])).
% cnf(420,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[65])).
% cnf(433,plain,(aSubsetOf0(xQ,xO)),inference(split_conjunct,[status(thm)],[70])).
% cnf(436,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[73])).
% cnf(437,plain,(xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(split_conjunct,[status(thm)],[74])).
% cnf(438,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[74])).
% cnf(449,plain,(aElementOf0(xx,xP)),inference(split_conjunct,[status(thm)],[83])).
% cnf(459,plain,(xp=xx),inference(split_conjunct,[status(thm)],[90])).
% fof(536, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElement0(X2)))|![X3]:((~(X3=sdtmndt0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))&(((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2)|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2))&(aElementOf0(X4,X3)|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))|X3=sdtmndt0(X1,X2)))),inference(fof_nnf,[status(thm)],[101])).
% fof(537, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|((~(aElement0(X9))|~(aElementOf0(X9,X5)))|X9=X6))&(aElementOf0(X9,X7)|((aElement0(X9)&aElementOf0(X9,X5))&~(X9=X6)))))|X7=sdtmndt0(X5,X6)))),inference(variable_rename,[status(thm)],[536])).
% fof(538, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk24_3(X5,X6,X7),X7))|((~(aElement0(esk24_3(X5,X6,X7)))|~(aElementOf0(esk24_3(X5,X6,X7),X5)))|esk24_3(X5,X6,X7)=X6))&(aElementOf0(esk24_3(X5,X6,X7),X7)|((aElement0(esk24_3(X5,X6,X7))&aElementOf0(esk24_3(X5,X6,X7),X5))&~(esk24_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))),inference(skolemize,[status(esa)],[537])).
% fof(539, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=sdtmndt0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk24_3(X5,X6,X7),X7))|((~(aElement0(esk24_3(X5,X6,X7)))|~(aElementOf0(esk24_3(X5,X6,X7),X5)))|esk24_3(X5,X6,X7)=X6))&(aElementOf0(esk24_3(X5,X6,X7),X7)|((aElement0(esk24_3(X5,X6,X7))&aElementOf0(esk24_3(X5,X6,X7),X5))&~(esk24_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[538])).
% fof(540, plain,![X5]:![X6]:![X7]:![X8]:((((((((aElement0(X8)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))&(((aElementOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((~(X8=X6)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&((aSet0(X7)|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElementOf0(esk24_3(X5,X6,X7),X7))|((~(aElement0(esk24_3(X5,X6,X7)))|~(aElementOf0(esk24_3(X5,X6,X7),X5)))|esk24_3(X5,X6,X7)=X6))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((((aElement0(esk24_3(X5,X6,X7))|aElementOf0(esk24_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((aElementOf0(esk24_3(X5,X6,X7),X5)|aElementOf0(esk24_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6)))))&((((~(esk24_3(X5,X6,X7)=X6)|aElementOf0(esk24_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))))),inference(distribute,[status(thm)],[539])).
% cnf(547,plain,(~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)|~aElementOf0(X4,X3)|X4!=X1),inference(split_conjunct,[status(thm)],[540])).
% fof(601, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[117])).
% fof(602, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[601])).
% fof(603, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[602])).
% cnf(604,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[603])).
% cnf(613,plain,(sdtmndt0(X1,X2)!=X3|~aElement0(X2)|~aElementOf0(X2,X3)|~aSet0(X1)),inference(er,[status(thm)],[547,theory(equality)])).
% cnf(614,plain,(szmzizndt0(xQ)=xx),inference(rw,[status(thm)],[436,459,theory(equality)])).
% cnf(623,plain,(sdtmndt0(xQ,xx)=xP),inference(rw,[status(thm)],[437,614,theory(equality)])).
% cnf(664,plain,(~aElement0(X1)|~aElementOf0(X1,sdtmndt0(X2,X1))|~aSet0(X2)),inference(er,[status(thm)],[613,theory(equality)])).
% cnf(701,plain,(aSet0(xQ)|~aSet0(xO)),inference(spm,[status(thm)],[159,433,theory(equality)])).
% cnf(710,plain,(aSet0(xQ)|$false),inference(rw,[status(thm)],[701,420,theory(equality)])).
% cnf(711,plain,(aSet0(xQ)),inference(cn,[status(thm)],[710,theory(equality)])).
% cnf(746,plain,(aElement0(xx)|~aSet0(xP)),inference(spm,[status(thm)],[604,449,theory(equality)])).
% cnf(759,plain,(aElement0(xx)|$false),inference(rw,[status(thm)],[746,438,theory(equality)])).
% cnf(760,plain,(aElement0(xx)),inference(cn,[status(thm)],[759,theory(equality)])).
% cnf(2211,plain,(~aElement0(xx)|~aElementOf0(xx,xP)|~aSet0(xQ)),inference(spm,[status(thm)],[664,623,theory(equality)])).
% cnf(2213,plain,($false|~aElementOf0(xx,xP)|~aSet0(xQ)),inference(rw,[status(thm)],[2211,760,theory(equality)])).
% cnf(2214,plain,($false|$false|~aSet0(xQ)),inference(rw,[status(thm)],[2213,449,theory(equality)])).
% cnf(2215,plain,($false|$false|$false),inference(rw,[status(thm)],[2214,711,theory(equality)])).
% cnf(2216,plain,($false),inference(cn,[status(thm)],[2215,theory(equality)])).
% cnf(2217,plain,($false),2216,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 486
% # ...of these trivial : 9
% # ...subsumed : 14
% # ...remaining for further processing: 463
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 911
% # ...of the previous two non-trivial : 847
% # Contextual simplify-reflections : 23
% # Paramodulations : 870
% # Factorizations : 0
% # Equation resolutions : 41
% # Current number of processed clauses: 241
% # Positive orientable unit clauses: 67
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 13
% # Non-unit-clauses : 161
% # Current number of unprocessed clauses: 801
% # ...number of literals in the above : 4015
% # Clause-clause subsumption calls (NU) : 2775
% # Rec. Clause-clause subsumption calls : 725
% # Unit Clause-clause subsumption calls : 1093
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 284 leaves, 1.32+/-0.933 terms/leaf
% # Paramod-from index: 137 leaves, 1.01+/-0.085 terms/leaf
% # Paramod-into index: 249 leaves, 1.16+/-0.561 terms/leaf
% # -------------------------------------------------
% # User time : 0.112 s
% # System time : 0.004 s
% # Total time : 0.116 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.32 WC
% FINAL PrfWatch: 0.26 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP16650/NUM625+1.tptp
%
%------------------------------------------------------------------------------