TSTP Solution File: NUM609+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM609+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 : art02.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:36:41 EST 2010
% Result : Theorem 2.26s
% Output : Solution 2.26s
% 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/SystemOnTPTP11125/NUM609+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11125/NUM609+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11125/NUM609+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 11221
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 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(59, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(64, axiom,(aSubsetOf0(xQ,xO)&~(xQ=slcrc0)),file('/tmp/SRASS.s.p', m__5093)).
% fof(67, axiom,xp=szmzizndt0(xQ),file('/tmp/SRASS.s.p', m__5147)).
% fof(68, axiom,(aSet0(xP)&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(70, axiom,aElementOf0(xp,xO),file('/tmp/SRASS.s.p', m__5182)).
% fof(85, 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(101, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(107, conjecture,aSubsetOf0(xP,xQ),file('/tmp/SRASS.s.p', m__)).
% fof(108, negated_conjecture,~(aSubsetOf0(xP,xQ)),inference(assume_negation,[status(cth)],[107])).
% fof(121, negated_conjecture,~(aSubsetOf0(xP,xQ)),inference(fof_simplification,[status(thm)],[108,theory(equality)])).
% fof(137, 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(138, 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)],[137])).
% fof(139, 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)],[138])).
% fof(140, 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)],[139])).
% fof(141, 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)],[140])).
% cnf(142,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[141])).
% cnf(143,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk2_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[141])).
% cnf(144,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[141])).
% cnf(369,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[59])).
% cnf(382,plain,(aSubsetOf0(xQ,xO)),inference(split_conjunct,[status(thm)],[64])).
% cnf(385,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[67])).
% cnf(386,plain,(xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(split_conjunct,[status(thm)],[68])).
% cnf(387,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[68])).
% cnf(389,plain,(aElementOf0(xp,xO)),inference(split_conjunct,[status(thm)],[70])).
% fof(493, 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)],[85])).
% fof(494, 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)],[493])).
% fof(495, 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)],[494])).
% fof(496, 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)],[495])).
% fof(497, 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)],[496])).
% cnf(505,plain,(aElementOf0(X4,X2)|~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[497])).
% fof(561, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[101])).
% fof(562, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[561])).
% fof(563, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[562])).
% cnf(564,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[563])).
% cnf(577,negated_conjecture,(~aSubsetOf0(xP,xQ)),inference(split_conjunct,[status(thm)],[121])).
% cnf(580,plain,(sdtmndt0(xQ,xp)=xP),inference(rw,[status(thm)],[386,385,theory(equality)])).
% cnf(647,plain,(aSet0(xQ)|~aSet0(xO)),inference(spm,[status(thm)],[144,382,theory(equality)])).
% cnf(652,plain,(aSet0(xQ)|$false),inference(rw,[status(thm)],[647,369,theory(equality)])).
% cnf(653,plain,(aSet0(xQ)),inference(cn,[status(thm)],[652,theory(equality)])).
% cnf(710,plain,(aElement0(xp)|~aSet0(xO)),inference(spm,[status(thm)],[564,389,theory(equality)])).
% cnf(718,plain,(aElement0(xp)|$false),inference(rw,[status(thm)],[710,369,theory(equality)])).
% cnf(719,plain,(aElement0(xp)),inference(cn,[status(thm)],[718,theory(equality)])).
% cnf(1133,plain,(aElementOf0(X1,X2)|~aElement0(X3)|~aElementOf0(X1,sdtmndt0(X2,X3))|~aSet0(X2)),inference(er,[status(thm)],[505,theory(equality)])).
% cnf(9876,plain,(aElementOf0(X1,xQ)|~aElement0(xp)|~aElementOf0(X1,xP)|~aSet0(xQ)),inference(spm,[status(thm)],[1133,580,theory(equality)])).
% cnf(9893,plain,(aElementOf0(X1,xQ)|$false|~aElementOf0(X1,xP)|~aSet0(xQ)),inference(rw,[status(thm)],[9876,719,theory(equality)])).
% cnf(9894,plain,(aElementOf0(X1,xQ)|$false|~aElementOf0(X1,xP)|$false),inference(rw,[status(thm)],[9893,653,theory(equality)])).
% cnf(9895,plain,(aElementOf0(X1,xQ)|~aElementOf0(X1,xP)),inference(cn,[status(thm)],[9894,theory(equality)])).
% cnf(9905,plain,(aElementOf0(esk2_2(X1,xP),xQ)|aSubsetOf0(xP,X1)|~aSet0(xP)|~aSet0(X1)),inference(spm,[status(thm)],[9895,143,theory(equality)])).
% cnf(9926,plain,(aElementOf0(esk2_2(X1,xP),xQ)|aSubsetOf0(xP,X1)|$false|~aSet0(X1)),inference(rw,[status(thm)],[9905,387,theory(equality)])).
% cnf(9927,plain,(aElementOf0(esk2_2(X1,xP),xQ)|aSubsetOf0(xP,X1)|~aSet0(X1)),inference(cn,[status(thm)],[9926,theory(equality)])).
% cnf(19176,plain,(aSubsetOf0(xP,xQ)|~aSet0(xP)|~aSet0(xQ)),inference(spm,[status(thm)],[142,9927,theory(equality)])).
% cnf(19191,plain,(aSubsetOf0(xP,xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[19176,387,theory(equality)])).
% cnf(19192,plain,(aSubsetOf0(xP,xQ)|$false|$false),inference(rw,[status(thm)],[19191,653,theory(equality)])).
% cnf(19193,plain,(aSubsetOf0(xP,xQ)),inference(cn,[status(thm)],[19192,theory(equality)])).
% cnf(19194,plain,($false),inference(sr,[status(thm)],[19193,577,theory(equality)])).
% cnf(19195,plain,($false),19194,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3499
% # ...of these trivial : 58
% # ...subsumed : 1936
% # ...remaining for further processing: 1505
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 114
% # Backward-rewritten : 67
% # Generated clauses : 9551
% # ...of the previous two non-trivial : 8790
% # Contextual simplify-reflections : 1401
% # Paramodulations : 9465
% # Factorizations : 0
% # Equation resolutions : 86
% # Current number of processed clauses: 1119
% # Positive orientable unit clauses: 114
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 68
% # Non-unit-clauses : 937
% # Current number of unprocessed clauses: 4871
% # ...number of literals in the above : 28222
% # Clause-clause subsumption calls (NU) : 115426
% # Rec. Clause-clause subsumption calls : 35909
% # Unit Clause-clause subsumption calls : 4907
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 890 leaves, 1.25+/-0.831 terms/leaf
% # Paramod-from index: 419 leaves, 1.02+/-0.128 terms/leaf
% # Paramod-into index: 746 leaves, 1.17+/-0.624 terms/leaf
% # -------------------------------------------------
% # User time : 0.870 s
% # System time : 0.022 s
% # Total time : 0.892 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.26 CPU 1.33 WC
% FINAL PrfWatch: 1.26 CPU 1.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP11125/NUM609+1.tptp
%
%------------------------------------------------------------------------------