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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM594+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 : 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:59 EST 2010

% Result   : Theorem 5.33s
% Output   : Solution 5.33s
% 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/SystemOnTPTP9790/NUM594+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP9790/NUM594+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9790/NUM594+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 9886
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.03 WC
% # Preprocessing time     : 0.616 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.91 CPU 4.03 WC
% # SZS output start CNFRefutation.
% fof(65, axiom,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X1]:(aElementOf0(X1,szNzAzT0)=>![X2]:((aSet0(X2)&(((![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1))))|aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))))&sbrdtbr0(X2)=xk)|aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))))=>sdtlpdtrp0(xd,X1)=sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)))),file('/tmp/SRASS.s.p', m__4730)).
% fof(67, axiom,(?[X1]:(aElementOf0(X1,szDzozmdt0(xd))&sdtlpdtrp0(xd,X1)=xx)&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(4450, plain,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|![X2]:((~(aSet0(X2))|(((?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1)))))&~(aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))))|~(sbrdtbr0(X2)=xk))&~(aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)))))|sdtlpdtrp0(xd,X1)=sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)))),inference(fof_nnf,[status(thm)],[65])).
% fof(4451, plain,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X4]:(~(aElementOf0(X4,szNzAzT0))|![X5]:((~(aSet0(X5))|(((?[X6]:(aElementOf0(X6,X5)&~(aElementOf0(X6,sdtlpdtrp0(xN,szszuzczcdt0(X4)))))&~(aSubsetOf0(X5,sdtlpdtrp0(xN,szszuzczcdt0(X4)))))|~(sbrdtbr0(X5)=xk))&~(aElementOf0(X5,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X4)),xk)))))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5)))),inference(variable_rename,[status(thm)],[4450])).
% fof(4452, plain,((aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)&![X4]:(~(aElementOf0(X4,szNzAzT0))|![X5]:((~(aSet0(X5))|((((aElementOf0(esk28_2(X4,X5),X5)&~(aElementOf0(esk28_2(X4,X5),sdtlpdtrp0(xN,szszuzczcdt0(X4)))))&~(aSubsetOf0(X5,sdtlpdtrp0(xN,szszuzczcdt0(X4)))))|~(sbrdtbr0(X5)=xk))&~(aElementOf0(X5,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X4)),xk)))))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5)))),inference(skolemize,[status(esa)],[4451])).
% fof(4453, plain,![X4]:![X5]:((((~(aSet0(X5))|((((aElementOf0(esk28_2(X4,X5),X5)&~(aElementOf0(esk28_2(X4,X5),sdtlpdtrp0(xN,szszuzczcdt0(X4)))))&~(aSubsetOf0(X5,sdtlpdtrp0(xN,szszuzczcdt0(X4)))))|~(sbrdtbr0(X5)=xk))&~(aElementOf0(X5,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X4)),xk)))))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5))|~(aElementOf0(X4,szNzAzT0)))&(aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)),inference(shift_quantors,[status(thm)],[4452])).
% fof(4454, plain,![X4]:![X5]:((((((((aElementOf0(esk28_2(X4,X5),X5)|~(sbrdtbr0(X5)=xk))|~(aSet0(X5)))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5))|~(aElementOf0(X4,szNzAzT0)))&((((~(aElementOf0(esk28_2(X4,X5),sdtlpdtrp0(xN,szszuzczcdt0(X4))))|~(sbrdtbr0(X5)=xk))|~(aSet0(X5)))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5))|~(aElementOf0(X4,szNzAzT0))))&((((~(aSubsetOf0(X5,sdtlpdtrp0(xN,szszuzczcdt0(X4))))|~(sbrdtbr0(X5)=xk))|~(aSet0(X5)))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5))|~(aElementOf0(X4,szNzAzT0))))&(((~(aElementOf0(X5,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X4)),xk)))|~(aSet0(X5)))|sdtlpdtrp0(xd,X4)=sdtlpdtrp0(sdtlpdtrp0(xC,X4),X5))|~(aElementOf0(X4,szNzAzT0))))&(aFunction0(xd)&szDzozmdt0(xd)=szNzAzT0)),inference(distribute,[status(thm)],[4453])).
% cnf(4455,plain,(szDzozmdt0(xd)=szNzAzT0),inference(split_conjunct,[status(thm)],[4454])).
% fof(4470, plain,(?[X2]:(aElementOf0(X2,szDzozmdt0(xd))&sdtlpdtrp0(xd,X2)=xx)&aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))),inference(variable_rename,[status(thm)],[67])).
% fof(4471, plain,((aElementOf0(esk30_0,szDzozmdt0(xd))&sdtlpdtrp0(xd,esk30_0)=xx)&aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))),inference(skolemize,[status(esa)],[4470])).
% cnf(4473,plain,(sdtlpdtrp0(xd,esk30_0)=xx),inference(split_conjunct,[status(thm)],[4471])).
% cnf(4474,plain,(aElementOf0(esk30_0,szDzozmdt0(xd))),inference(split_conjunct,[status(thm)],[4471])).
% fof(4601, negated_conjecture,![X1]:(~(aElementOf0(X1,szNzAzT0))|~(sdtlpdtrp0(xd,X1)=xx)),inference(fof_nnf,[status(thm)],[96])).
% fof(4602, negated_conjecture,![X2]:(~(aElementOf0(X2,szNzAzT0))|~(sdtlpdtrp0(xd,X2)=xx)),inference(variable_rename,[status(thm)],[4601])).
% cnf(4603,negated_conjecture,(sdtlpdtrp0(xd,X1)!=xx|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[4602])).
% cnf(5254,plain,(aElementOf0(esk30_0,szNzAzT0)),inference(rw,[status(thm)],[4474,4455,theory(equality)])).
% cnf(8353,negated_conjecture,(~aElementOf0(esk30_0,szNzAzT0)),inference(spm,[status(thm)],[4603,4473,theory(equality)])).
% cnf(8354,negated_conjecture,($false),inference(rw,[status(thm)],[8353,5254,theory(equality)])).
% cnf(8355,negated_conjecture,($false),inference(cn,[status(thm)],[8354,theory(equality)])).
% cnf(8356,negated_conjecture,($false),8355,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 3557
% # ...of these trivial                : 0
% # ...subsumed                        : 524
% # ...remaining for further processing: 3033
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 4
% # Backward-rewritten                 : 0
% # Generated clauses                  : 9
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections    : 3069
% # Paramodulations                    : 1
% # Factorizations                     : 0
% # Equation resolutions               : 3
% # Current number of processed clauses: 27
% #    Positive orientable unit clauses: 22
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 4
% # Current number of unprocessed clauses: 2970
% # ...number of literals in the above : 33589
% # Clause-clause subsumption calls (NU) : 669597
% # Rec. Clause-clause subsumption calls : 24631
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    43 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:           23 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           38 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 2.971 s
% # System time            : 0.036 s
% # Total time             : 3.007 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.28 CPU 4.40 WC
% FINAL PrfWatch: 4.28 CPU 4.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP9790/NUM594+3.tptp
% 
%------------------------------------------------------------------------------