TSTP Solution File: NUM621+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM621+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:40:17 EST 2010
% Result : Theorem 14.27s
% Output : Solution 14.27s
% 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/SystemOnTPTP14461/NUM621+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14461/NUM621+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14461/NUM621+3.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 14557
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.97 CPU 2.02 WC
% PrfWatch: 3.95 CPU 4.02 WC
% PrfWatch: 5.95 CPU 6.03 WC
% PrfWatch: 7.94 CPU 8.03 WC
% PrfWatch: 9.93 CPU 10.04 WC
% # Preprocessing time : 0.621 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.91 CPU 12.04 WC
% # SZS output start CNFRefutation.
% fof(30, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mLessASymm)).
% fof(66, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(((aSet0(sdtlpdtrp0(xN,X1))&![X2]:(aElementOf0(X2,sdtlpdtrp0(xN,X1))=>aElementOf0(X2,szNzAzT0)))&aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,X1)))),file('/tmp/SRASS.s.p', m__3671)).
% fof(75, axiom,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(aElementOf0(X1,szNzAzT0)=>((aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))&![X2]:(aElementOf0(X2,sdtlpdtrp0(xN,X1))=>sdtlseqdt0(sdtlpdtrp0(xe,X1),X2)))&sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1))))),file('/tmp/SRASS.s.p', m__4660)).
% fof(87, axiom,((aElementOf0(xp,xQ)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),file('/tmp/SRASS.s.p', m__5147)).
% fof(95, axiom,((((aElementOf0(xn,szDzozmdt0(xd))&sdtlpdtrp0(xd,xn)=szDzizrdt0(xd))&aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd))))&aElementOf0(xn,szNzAzT0))&sdtlpdtrp0(xe,xn)=xp),file('/tmp/SRASS.s.p', m__5309)).
% fof(97, axiom,(((aElement0(xx)&aElementOf0(xx,xQ))&~(xx=szmzizndt0(xQ)))&aElementOf0(xx,xP)),file('/tmp/SRASS.s.p', m__5348)).
% fof(98, axiom,(aElementOf0(xx,szNzAzT0)&?[X1]:(aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,X1)=xx)),file('/tmp/SRASS.s.p', m__5365)).
% fof(99, axiom,(aElementOf0(xm,szNzAzT0)&xx=sdtlpdtrp0(xe,xm)),file('/tmp/SRASS.s.p', m__5389)).
% fof(100, axiom,![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xm))=>sdtlseqdt0(xx,X1)),file('/tmp/SRASS.s.p', m__5401)).
% fof(118, conjecture,((![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xn))=>aElementOf0(X1,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)))=>aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))),file('/tmp/SRASS.s.p', m__)).
% fof(119, negated_conjecture,~(((![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xn))=>aElementOf0(X1,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)))=>aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(assume_negation,[status(cth)],[118])).
% fof(269, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[30])).
% fof(270, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[269])).
% cnf(271,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[270])).
% fof(4461, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(((aSet0(sdtlpdtrp0(xN,X1))&![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,X1)))|aElementOf0(X2,szNzAzT0)))&aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[66])).
% fof(4462, plain,![X3]:(~(aElementOf0(X3,szNzAzT0))|(((aSet0(sdtlpdtrp0(xN,X3))&![X4]:(~(aElementOf0(X4,sdtlpdtrp0(xN,X3)))|aElementOf0(X4,szNzAzT0)))&aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,X3)))),inference(variable_rename,[status(thm)],[4461])).
% fof(4463, plain,![X3]:![X4]:(((((~(aElementOf0(X4,sdtlpdtrp0(xN,X3)))|aElementOf0(X4,szNzAzT0))&aSet0(sdtlpdtrp0(xN,X3)))&aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,X3)))|~(aElementOf0(X3,szNzAzT0))),inference(shift_quantors,[status(thm)],[4462])).
% fof(4464, plain,![X3]:![X4]:(((((~(aElementOf0(X4,sdtlpdtrp0(xN,X3)))|aElementOf0(X4,szNzAzT0))|~(aElementOf0(X3,szNzAzT0)))&(aSet0(sdtlpdtrp0(xN,X3))|~(aElementOf0(X3,szNzAzT0))))&(aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)|~(aElementOf0(X3,szNzAzT0))))&(isCountable0(sdtlpdtrp0(xN,X3))|~(aElementOf0(X3,szNzAzT0)))),inference(distribute,[status(thm)],[4463])).
% cnf(4468,plain,(aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)|~aElementOf0(X2,sdtlpdtrp0(xN,X1))),inference(split_conjunct,[status(thm)],[4464])).
% fof(4521, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|((aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))&![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,X1)))|sdtlseqdt0(sdtlpdtrp0(xe,X1),X2)))&sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1))))),inference(fof_nnf,[status(thm)],[75])).
% fof(4522, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X3]:(~(aElementOf0(X3,szNzAzT0))|((aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))&![X4]:(~(aElementOf0(X4,sdtlpdtrp0(xN,X3)))|sdtlseqdt0(sdtlpdtrp0(xe,X3),X4)))&sdtlpdtrp0(xe,X3)=szmzizndt0(sdtlpdtrp0(xN,X3))))),inference(variable_rename,[status(thm)],[4521])).
% fof(4523, plain,![X3]:![X4]:(((((~(aElementOf0(X4,sdtlpdtrp0(xN,X3)))|sdtlseqdt0(sdtlpdtrp0(xe,X3),X4))&aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3)))&sdtlpdtrp0(xe,X3)=szmzizndt0(sdtlpdtrp0(xN,X3)))|~(aElementOf0(X3,szNzAzT0)))&(aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)),inference(shift_quantors,[status(thm)],[4522])).
% fof(4524, plain,![X3]:![X4]:(((((~(aElementOf0(X4,sdtlpdtrp0(xN,X3)))|sdtlseqdt0(sdtlpdtrp0(xe,X3),X4))|~(aElementOf0(X3,szNzAzT0)))&(aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))|~(aElementOf0(X3,szNzAzT0))))&(sdtlpdtrp0(xe,X3)=szmzizndt0(sdtlpdtrp0(xN,X3))|~(aElementOf0(X3,szNzAzT0))))&(aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)),inference(distribute,[status(thm)],[4523])).
% cnf(4528,plain,(aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[4524])).
% fof(4623, plain,((aElementOf0(xp,xQ)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),inference(fof_nnf,[status(thm)],[87])).
% fof(4624, plain,((aElementOf0(xp,xQ)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2)))&xp=szmzizndt0(xQ)),inference(variable_rename,[status(thm)],[4623])).
% fof(4625, plain,![X2]:(((~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2))&aElementOf0(xp,xQ))&xp=szmzizndt0(xQ)),inference(shift_quantors,[status(thm)],[4624])).
% cnf(4626,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[4625])).
% cnf(4628,plain,(sdtlseqdt0(xp,X1)|~aElementOf0(X1,xQ)),inference(split_conjunct,[status(thm)],[4625])).
% cnf(4657,plain,(sdtlpdtrp0(xe,xn)=xp),inference(split_conjunct,[status(thm)],[95])).
% cnf(4658,plain,(aElementOf0(xn,szNzAzT0)),inference(split_conjunct,[status(thm)],[95])).
% cnf(4664,plain,(xx!=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[97])).
% cnf(4665,plain,(aElementOf0(xx,xQ)),inference(split_conjunct,[status(thm)],[97])).
% fof(4667, plain,(aElementOf0(xx,szNzAzT0)&?[X2]:(aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,X2)=xx)),inference(variable_rename,[status(thm)],[98])).
% fof(4668, plain,(aElementOf0(xx,szNzAzT0)&(aElementOf0(esk37_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,esk37_0)=xx)),inference(skolemize,[status(esa)],[4667])).
% cnf(4671,plain,(aElementOf0(xx,szNzAzT0)),inference(split_conjunct,[status(thm)],[4668])).
% cnf(4673,plain,(aElementOf0(xm,szNzAzT0)),inference(split_conjunct,[status(thm)],[99])).
% fof(4674, plain,![X1]:(~(aElementOf0(X1,sdtlpdtrp0(xN,xm)))|sdtlseqdt0(xx,X1)),inference(fof_nnf,[status(thm)],[100])).
% fof(4675, plain,![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,xm)))|sdtlseqdt0(xx,X2)),inference(variable_rename,[status(thm)],[4674])).
% cnf(4676,plain,(sdtlseqdt0(xx,X1)|~aElementOf0(X1,sdtlpdtrp0(xN,xm))),inference(split_conjunct,[status(thm)],[4675])).
% fof(4752, negated_conjecture,((![X1]:(~(aElementOf0(X1,sdtlpdtrp0(xN,xn)))|aElementOf0(X1,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(fof_nnf,[status(thm)],[119])).
% fof(4753, negated_conjecture,((![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,xn)))|aElementOf0(X2,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(variable_rename,[status(thm)],[4752])).
% fof(4754, negated_conjecture,![X2]:(((~(aElementOf0(X2,sdtlpdtrp0(xN,xn)))|aElementOf0(X2,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(shift_quantors,[status(thm)],[4753])).
% cnf(4757,negated_conjecture,(aElementOf0(X1,sdtlpdtrp0(xN,xm))|~aElementOf0(X1,sdtlpdtrp0(xN,xn))),inference(split_conjunct,[status(thm)],[4754])).
% cnf(5411,plain,(xp!=xx),inference(rw,[status(thm)],[4664,4626,theory(equality)])).
% cnf(8715,negated_conjecture,(aElementOf0(sdtlpdtrp0(xe,xn),sdtlpdtrp0(xN,xm))|~aElementOf0(xn,szNzAzT0)),inference(spm,[status(thm)],[4757,4528,theory(equality)])).
% cnf(8725,negated_conjecture,(aElementOf0(xp,sdtlpdtrp0(xN,xm))|~aElementOf0(xn,szNzAzT0)),inference(rw,[status(thm)],[8715,4657,theory(equality)])).
% cnf(8726,negated_conjecture,(aElementOf0(xp,sdtlpdtrp0(xN,xm))|$false),inference(rw,[status(thm)],[8725,4658,theory(equality)])).
% cnf(8727,negated_conjecture,(aElementOf0(xp,sdtlpdtrp0(xN,xm))),inference(cn,[status(thm)],[8726,theory(equality)])).
% cnf(82858,negated_conjecture,(aElementOf0(xp,szNzAzT0)|~aElementOf0(xm,szNzAzT0)),inference(spm,[status(thm)],[4468,8727,theory(equality)])).
% cnf(82860,negated_conjecture,(sdtlseqdt0(xx,xp)),inference(spm,[status(thm)],[4676,8727,theory(equality)])).
% cnf(82861,negated_conjecture,(aElementOf0(xp,szNzAzT0)|$false),inference(rw,[status(thm)],[82858,4673,theory(equality)])).
% cnf(82862,negated_conjecture,(aElementOf0(xp,szNzAzT0)),inference(cn,[status(thm)],[82861,theory(equality)])).
% cnf(83375,negated_conjecture,(xp=xx|~sdtlseqdt0(xp,xx)|~aElementOf0(xx,szNzAzT0)|~aElementOf0(xp,szNzAzT0)),inference(spm,[status(thm)],[271,82860,theory(equality)])).
% cnf(83379,negated_conjecture,(xp=xx|~sdtlseqdt0(xp,xx)|$false|~aElementOf0(xp,szNzAzT0)),inference(rw,[status(thm)],[83375,4671,theory(equality)])).
% cnf(83380,negated_conjecture,(xp=xx|~sdtlseqdt0(xp,xx)|$false|$false),inference(rw,[status(thm)],[83379,82862,theory(equality)])).
% cnf(83381,negated_conjecture,(xp=xx|~sdtlseqdt0(xp,xx)),inference(cn,[status(thm)],[83380,theory(equality)])).
% cnf(83382,negated_conjecture,(~sdtlseqdt0(xp,xx)),inference(sr,[status(thm)],[83381,5411,theory(equality)])).
% cnf(83450,negated_conjecture,(~aElementOf0(xx,xQ)),inference(spm,[status(thm)],[83382,4628,theory(equality)])).
% cnf(83451,negated_conjecture,($false),inference(rw,[status(thm)],[83450,4665,theory(equality)])).
% cnf(83452,negated_conjecture,($false),inference(cn,[status(thm)],[83451,theory(equality)])).
% cnf(83453,negated_conjecture,($false),83452,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6762
% # ...of these trivial : 15
% # ...subsumed : 561
% # ...remaining for further processing: 6186
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 23
% # Generated clauses : 57693
% # ...of the previous two non-trivial : 49002
% # Contextual simplify-reflections : 3069
% # Paramodulations : 57643
% # Factorizations : 0
% # Equation resolutions : 45
% # Current number of processed clauses: 3090
% # Positive orientable unit clauses: 91
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 2980
% # Current number of unprocessed clauses: 48538
% # ...number of literals in the above : 720105
% # Clause-clause subsumption calls (NU) : 1914283
% # Rec. Clause-clause subsumption calls : 45642
% # Unit Clause-clause subsumption calls : 44199
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 417 leaves, 2.11+/-2.769 terms/leaf
% # Paramod-from index: 201 leaves, 1.01+/-0.099 terms/leaf
% # Paramod-into index: 374 leaves, 1.53+/-1.469 terms/leaf
% # -------------------------------------------------
% # User time : 10.123 s
% # System time : 0.174 s
% # Total time : 10.297 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.18 CPU 13.37 WC
% FINAL PrfWatch: 13.18 CPU 13.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP14461/NUM621+3.tptp
%
%------------------------------------------------------------------------------