TSTP Solution File: NUM604+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM604+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 : 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:35:28 EST 2010
% Result : Theorem 5.24s
% Output : Solution 5.24s
% 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/SystemOnTPTP21784/NUM604+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21784/NUM604+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21784/NUM604+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 21880
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.55 CPU 2.02 WC
% PrfWatch: 3.20 CPU 4.03 WC
% # Preprocessing time : 0.617 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(67, 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(75, axiom,(aElementOf0(xi,szNzAzT0)&sdtlpdtrp0(xe,xi)=xx),file('/tmp/SRASS.s.p', m__5034)).
% fof(76, axiom,(![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xi))=>aElementOf0(X1,xS))&aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),file('/tmp/SRASS.s.p', m__5045)).
% fof(101, conjecture,aElementOf0(xx,xS),file('/tmp/SRASS.s.p', m__)).
% fof(102, negated_conjecture,~(aElementOf0(xx,xS)),inference(assume_negation,[status(cth)],[101])).
% fof(115, negated_conjecture,~(aElementOf0(xx,xS)),inference(fof_simplification,[status(thm)],[102,theory(equality)])).
% fof(4468, 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)],[67])).
% fof(4469, 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)],[4468])).
% fof(4470, 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)],[4469])).
% fof(4471, 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)],[4470])).
% cnf(4475,plain,(aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[4471])).
% cnf(4542,plain,(sdtlpdtrp0(xe,xi)=xx),inference(split_conjunct,[status(thm)],[75])).
% cnf(4543,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[75])).
% fof(4544, plain,(![X1]:(~(aElementOf0(X1,sdtlpdtrp0(xN,xi)))|aElementOf0(X1,xS))&aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(fof_nnf,[status(thm)],[76])).
% fof(4545, plain,(![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,xi)))|aElementOf0(X2,xS))&aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(variable_rename,[status(thm)],[4544])).
% fof(4546, plain,![X2]:((~(aElementOf0(X2,sdtlpdtrp0(xN,xi)))|aElementOf0(X2,xS))&aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(shift_quantors,[status(thm)],[4545])).
% cnf(4548,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,xi))),inference(split_conjunct,[status(thm)],[4546])).
% cnf(4655,negated_conjecture,(~aElementOf0(xx,xS)),inference(split_conjunct,[status(thm)],[115])).
% cnf(8615,plain,(aElementOf0(sdtlpdtrp0(xe,xi),xS)|~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[4548,4475,theory(equality)])).
% cnf(8622,plain,(aElementOf0(xx,xS)|~aElementOf0(xi,szNzAzT0)),inference(rw,[status(thm)],[8615,4542,theory(equality)])).
% cnf(8623,plain,(aElementOf0(xx,xS)|$false),inference(rw,[status(thm)],[8622,4543,theory(equality)])).
% cnf(8624,plain,(aElementOf0(xx,xS)),inference(cn,[status(thm)],[8623,theory(equality)])).
% cnf(8625,plain,($false),inference(sr,[status(thm)],[8624,4655,theory(equality)])).
% cnf(8626,plain,($false),8625,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3663
% # ...of these trivial : 2
% # ...subsumed : 527
% # ...remaining for further processing: 3134
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 119
% # ...of the previous two non-trivial : 92
% # Contextual simplify-reflections : 3069
% # Paramodulations : 110
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 103
% # Positive orientable unit clauses: 39
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 62
% # Current number of unprocessed clauses: 3003
% # ...number of literals in the above : 33666
% # Clause-clause subsumption calls (NU) : 809475
% # Rec. Clause-clause subsumption calls : 24842
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 140 leaves, 1.05+/-0.218 terms/leaf
% # Paramod-from index: 79 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 129 leaves, 1.04+/-0.193 terms/leaf
% # -------------------------------------------------
% # User time : 3.194 s
% # System time : 0.035 s
% # Total time : 3.229 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.18 CPU 5.01 WC
% FINAL PrfWatch: 4.18 CPU 5.01 WC
% SZS output end Solution for /tmp/SystemOnTPTP21784/NUM604+3.tptp
%
%------------------------------------------------------------------------------