TSTP Solution File: NUM582+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM582+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 : art09.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:18:46 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP9950/NUM582+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9950/NUM582+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9950/NUM582+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 10046
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(14, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>sdtlseqdt0(sz00,X1)),file('/tmp/SRASS.s.p', mZeroLess)).
% fof(43, axiom,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X1]:(aElementOf0(X1,szNzAzT0)=>((aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))=>(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))))))),file('/tmp/SRASS.s.p', m__3623)).
% fof(45, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(X2,X1)=>aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)))),file('/tmp/SRASS.s.p', m__3754)).
% fof(47, axiom,aElementOf0(xi,szNzAzT0),file('/tmp/SRASS.s.p', m__3989)).
% fof(88, conjecture,aSubsetOf0(sdtlpdtrp0(xN,xi),xS),file('/tmp/SRASS.s.p', m__)).
% fof(89, negated_conjecture,~(aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(assume_negation,[status(cth)],[88])).
% fof(102, negated_conjecture,~(aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(fof_simplification,[status(thm)],[89,theory(equality)])).
% cnf(134,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[9])).
% fof(152, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|sdtlseqdt0(sz00,X1)),inference(fof_nnf,[status(thm)],[14])).
% fof(153, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|sdtlseqdt0(sz00,X2)),inference(variable_rename,[status(thm)],[152])).
% cnf(154,plain,(sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[153])).
% fof(277, plain,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X1]:(~(aElementOf0(X1,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X1))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))))))),inference(fof_nnf,[status(thm)],[43])).
% fof(278, plain,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X2]:(~(aElementOf0(X2,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))))))),inference(variable_rename,[status(thm)],[277])).
% fof(279, plain,![X2]:((~(aElementOf0(X2,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))))))&((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)),inference(shift_quantors,[status(thm)],[278])).
% fof(280, plain,![X2]:((((aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))|(~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2)))))|~(aElementOf0(X2,szNzAzT0)))&((isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))|(~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2)))))|~(aElementOf0(X2,szNzAzT0))))&((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)),inference(distribute,[status(thm)],[279])).
% cnf(281,plain,(sdtlpdtrp0(xN,sz00)=xS),inference(split_conjunct,[status(thm)],[280])).
% fof(291, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(sdtlseqdt0(X2,X1))|aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)))),inference(fof_nnf,[status(thm)],[45])).
% fof(292, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(sdtlseqdt0(X4,X3))|aSubsetOf0(sdtlpdtrp0(xN,X3),sdtlpdtrp0(xN,X4)))),inference(variable_rename,[status(thm)],[291])).
% cnf(293,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))|~sdtlseqdt0(X2,X1)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[292])).
% cnf(297,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(488,negated_conjecture,(~aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(split_conjunct,[status(thm)],[102])).
% cnf(710,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~sdtlseqdt0(sz00,X1)|~aElementOf0(sz00,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[293,281,theory(equality)])).
% cnf(712,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~sdtlseqdt0(sz00,X1)|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[710,134,theory(equality)])).
% cnf(713,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[712,theory(equality)])).
% cnf(1836,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[713,154])).
% cnf(1847,negated_conjecture,(~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[488,1836,theory(equality)])).
% cnf(1859,negated_conjecture,($false),inference(rw,[status(thm)],[1847,297,theory(equality)])).
% cnf(1860,negated_conjecture,($false),inference(cn,[status(thm)],[1859,theory(equality)])).
% cnf(1861,negated_conjecture,($false),1860,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 475
% # ...of these trivial : 6
% # ...subsumed : 64
% # ...remaining for further processing: 405
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 838
% # ...of the previous two non-trivial : 758
% # Contextual simplify-reflections : 62
% # Paramodulations : 795
% # Factorizations : 0
% # Equation resolutions : 43
% # Current number of processed clauses: 234
% # Positive orientable unit clauses: 40
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 16
% # Non-unit-clauses : 178
% # Current number of unprocessed clauses: 612
% # ...number of literals in the above : 3374
% # Clause-clause subsumption calls (NU) : 2585
% # Rec. Clause-clause subsumption calls : 889
% # Unit Clause-clause subsumption calls : 453
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 244 leaves, 1.35+/-0.982 terms/leaf
% # Paramod-from index: 114 leaves, 1.02+/-0.131 terms/leaf
% # Paramod-into index: 215 leaves, 1.20+/-0.609 terms/leaf
% # -------------------------------------------------
% # User time : 0.098 s
% # System time : 0.007 s
% # Total time : 0.105 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.31 WC
% FINAL PrfWatch: 0.21 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP9950/NUM582+1.tptp
%
%------------------------------------------------------------------------------