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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM594+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 : art03.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:27:48 EST 2010

% Result   : Theorem 1.25s
% Output   : Solution 1.25s
% 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/SystemOnTPTP9531/NUM594+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP9531/NUM594+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9531/NUM594+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 9627
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(8, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(27, 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(49, axiom,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X1]:(aElementOf0(X1,szNzAzT0)=>![X2]:((aSet0(X2)&aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)))=>sdtlpdtrp0(xd,X1)=sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)))),file('/tmp/SRASS.s.p', m__4730)).
% fof(51, axiom,aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),file('/tmp/SRASS.s.p', m__4781)).
% fof(95, conjecture,?[X1]:(aElementOf0(X1,szNzAzT0)&sdtlpdtrp0(xd,X1)=xx),file('/tmp/SRASS.s.p', m__)).
% fof(96, negated_conjecture,~(?[X1]:(aElementOf0(X1,szNzAzT0)&sdtlpdtrp0(xd,X1)=xx)),inference(assume_negation,[status(cth)],[95])).
% fof(125, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(126, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[125])).
% cnf(127,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[126])).
% cnf(139,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[8])).
% fof(206, 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)],[27])).
% fof(207, 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)],[206])).
% fof(208, plain,![X6]:(~(aFunction0(X6))|![X7]:(~(aSubsetOf0(X7,szDzozmdt0(X6)))|![X8]:((~(X8=sdtlcdtrc0(X6,X7))|(aSet0(X8)&![X9]:((~(aElementOf0(X9,X8))|(aElementOf0(esk4_4(X6,X7,X8,X9),X7)&sdtlpdtrp0(X6,esk4_4(X6,X7,X8,X9))=X9))&(![X11]:(~(aElementOf0(X11,X7))|~(sdtlpdtrp0(X6,X11)=X9))|aElementOf0(X9,X8)))))&((~(aSet0(X8))|((~(aElementOf0(esk5_3(X6,X7,X8),X8))|![X13]:(~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=esk5_3(X6,X7,X8))))&(aElementOf0(esk5_3(X6,X7,X8),X8)|(aElementOf0(esk6_3(X6,X7,X8),X7)&sdtlpdtrp0(X6,esk6_3(X6,X7,X8))=esk5_3(X6,X7,X8)))))|X8=sdtlcdtrc0(X6,X7))))),inference(skolemize,[status(esa)],[207])).
% fof(209, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X13]:((((((((~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=esk5_3(X6,X7,X8)))|~(aElementOf0(esk5_3(X6,X7,X8),X8)))&(aElementOf0(esk5_3(X6,X7,X8),X8)|(aElementOf0(esk6_3(X6,X7,X8),X7)&sdtlpdtrp0(X6,esk6_3(X6,X7,X8))=esk5_3(X6,X7,X8))))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))&(((((~(aElementOf0(X11,X7))|~(sdtlpdtrp0(X6,X11)=X9))|aElementOf0(X9,X8))&(~(aElementOf0(X9,X8))|(aElementOf0(esk4_4(X6,X7,X8,X9),X7)&sdtlpdtrp0(X6,esk4_4(X6,X7,X8,X9))=X9)))&aSet0(X8))|~(X8=sdtlcdtrc0(X6,X7))))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6))),inference(shift_quantors,[status(thm)],[208])).
% fof(210, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X13]:((((((((~(aElementOf0(X13,X7))|~(sdtlpdtrp0(X6,X13)=esk5_3(X6,X7,X8)))|~(aElementOf0(esk5_3(X6,X7,X8),X8)))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&((((((aElementOf0(esk6_3(X6,X7,X8),X7)|aElementOf0(esk5_3(X6,X7,X8),X8))|~(aSet0(X8)))|X8=sdtlcdtrc0(X6,X7))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&(((((sdtlpdtrp0(X6,esk6_3(X6,X7,X8))=esk5_3(X6,X7,X8)|aElementOf0(esk5_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(esk4_4(X6,X7,X8,X9),X7)|~(aElementOf0(X9,X8)))|~(X8=sdtlcdtrc0(X6,X7)))|~(aSubsetOf0(X7,szDzozmdt0(X6))))|~(aFunction0(X6)))&((((sdtlpdtrp0(X6,esk4_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)],[209])).
% cnf(212,plain,(sdtlpdtrp0(X1,esk4_4(X1,X2,X3,X4))=X4|~aFunction0(X1)|~aSubsetOf0(X2,szDzozmdt0(X1))|X3!=sdtlcdtrc0(X1,X2)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[210])).
% cnf(213,plain,(aElementOf0(esk4_4(X1,X2,X3,X4),X2)|~aFunction0(X1)|~aSubsetOf0(X2,szDzozmdt0(X1))|X3!=sdtlcdtrc0(X1,X2)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[210])).
% fof(314, plain,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|![X2]:((~(aSet0(X2))|~(aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))))|sdtlpdtrp0(xd,X1)=sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)))),inference(fof_nnf,[status(thm)],[49])).
% fof(315, plain,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X3]:(~(aElementOf0(X3,szNzAzT0))|![X4]:((~(aSet0(X4))|~(aElementOf0(X4,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),xk))))|sdtlpdtrp0(xd,X3)=sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4)))),inference(variable_rename,[status(thm)],[314])).
% fof(316, plain,![X3]:![X4]:((((~(aSet0(X4))|~(aElementOf0(X4,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),xk))))|sdtlpdtrp0(xd,X3)=sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4))|~(aElementOf0(X3,szNzAzT0)))&(aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)),inference(shift_quantors,[status(thm)],[315])).
% cnf(317,plain,(szDzozmdt0(xd)=szNzAzT0),inference(split_conjunct,[status(thm)],[316])).
% cnf(318,plain,(aFunction0(xd)),inference(split_conjunct,[status(thm)],[316])).
% cnf(321,plain,(aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))),inference(split_conjunct,[status(thm)],[51])).
% fof(541, negated_conjecture,![X1]:(~(aElementOf0(X1,szNzAzT0))|~(sdtlpdtrp0(xd,X1)=xx)),inference(fof_nnf,[status(thm)],[96])).
% fof(542, negated_conjecture,![X2]:(~(aElementOf0(X2,szNzAzT0))|~(sdtlpdtrp0(xd,X2)=xx)),inference(variable_rename,[status(thm)],[541])).
% cnf(543,negated_conjecture,(sdtlpdtrp0(xd,X1)!=xx|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[542])).
% cnf(545,plain,(aElementOf0(xx,sdtlcdtrc0(xd,szNzAzT0))),inference(rw,[status(thm)],[321,317,theory(equality)])).
% cnf(1210,negated_conjecture,(X3!=xx|~aElementOf0(esk4_4(xd,X1,X2,X3),szNzAzT0)|sdtlcdtrc0(xd,X1)!=X2|~aFunction0(xd)|~aElementOf0(X3,X2)|~aSubsetOf0(X1,szDzozmdt0(xd))),inference(spm,[status(thm)],[543,212,theory(equality)])).
% cnf(1224,negated_conjecture,(X3!=xx|~aElementOf0(esk4_4(xd,X1,X2,X3),szNzAzT0)|sdtlcdtrc0(xd,X1)!=X2|$false|~aElementOf0(X3,X2)|~aSubsetOf0(X1,szDzozmdt0(xd))),inference(rw,[status(thm)],[1210,318,theory(equality)])).
% cnf(1225,negated_conjecture,(X3!=xx|~aElementOf0(esk4_4(xd,X1,X2,X3),szNzAzT0)|sdtlcdtrc0(xd,X1)!=X2|$false|~aElementOf0(X3,X2)|~aSubsetOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[1224,317,theory(equality)])).
% cnf(1226,negated_conjecture,(X3!=xx|~aElementOf0(esk4_4(xd,X1,X2,X3),szNzAzT0)|sdtlcdtrc0(xd,X1)!=X2|~aElementOf0(X3,X2)|~aSubsetOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[1225,theory(equality)])).
% cnf(2163,negated_conjecture,(sdtlcdtrc0(xd,szNzAzT0)!=X1|X2!=xx|~aElementOf0(X2,X1)|~aSubsetOf0(szNzAzT0,szNzAzT0)|~aFunction0(xd)|~aSubsetOf0(szNzAzT0,szDzozmdt0(xd))),inference(spm,[status(thm)],[1226,213,theory(equality)])).
% cnf(2164,negated_conjecture,(sdtlcdtrc0(xd,szNzAzT0)!=X1|X2!=xx|~aElementOf0(X2,X1)|~aSubsetOf0(szNzAzT0,szNzAzT0)|$false|~aSubsetOf0(szNzAzT0,szDzozmdt0(xd))),inference(rw,[status(thm)],[2163,318,theory(equality)])).
% cnf(2165,negated_conjecture,(sdtlcdtrc0(xd,szNzAzT0)!=X1|X2!=xx|~aElementOf0(X2,X1)|~aSubsetOf0(szNzAzT0,szNzAzT0)|$false|~aSubsetOf0(szNzAzT0,szNzAzT0)),inference(rw,[status(thm)],[2164,317,theory(equality)])).
% cnf(2166,negated_conjecture,(sdtlcdtrc0(xd,szNzAzT0)!=X1|X2!=xx|~aElementOf0(X2,X1)|~aSubsetOf0(szNzAzT0,szNzAzT0)),inference(cn,[status(thm)],[2165,theory(equality)])).
% cnf(2201,negated_conjecture,(X1!=xx|~aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0))|~aSubsetOf0(szNzAzT0,szNzAzT0)),inference(er,[status(thm)],[2166,theory(equality)])).
% cnf(2209,negated_conjecture,(~aSubsetOf0(szNzAzT0,szNzAzT0)),inference(spm,[status(thm)],[2201,545,theory(equality)])).
% cnf(2218,negated_conjecture,(~aSet0(szNzAzT0)),inference(spm,[status(thm)],[2209,127,theory(equality)])).
% cnf(2219,negated_conjecture,($false),inference(rw,[status(thm)],[2218,139,theory(equality)])).
% cnf(2220,negated_conjecture,($false),inference(cn,[status(thm)],[2219,theory(equality)])).
% cnf(2221,negated_conjecture,($false),2220,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 516
% # ...of these trivial                : 1
% # ...subsumed                        : 56
% # ...remaining for further processing: 459
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 1
% # Generated clauses                  : 961
% # ...of the previous two non-trivial : 896
% # Contextual simplify-reflections    : 42
% # Paramodulations                    : 917
% # Factorizations                     : 0
% # Equation resolutions               : 43
% # Current number of processed clauses: 268
% #    Positive orientable unit clauses: 46
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 17
% #    Non-unit-clauses                : 205
% # Current number of unprocessed clauses: 735
% # ...number of literals in the above : 4096
% # Clause-clause subsumption calls (NU) : 2923
% # Rec. Clause-clause subsumption calls : 1010
% # Unit Clause-clause subsumption calls : 894
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:   286 leaves,   1.33+/-0.984 terms/leaf
% # Paramod-from index:          132 leaves,   1.01+/-0.087 terms/leaf
% # Paramod-into index:          249 leaves,   1.18+/-0.591 terms/leaf
% # -------------------------------------------------
% # User time              : 0.113 s
% # System time            : 0.006 s
% # Total time             : 0.119 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.34 WC
% FINAL PrfWatch: 0.25 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP9531/NUM594+1.tptp
% 
%------------------------------------------------------------------------------