TSTP Solution File: NUM571+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM571+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 : art05.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:10:43 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP31949/NUM571+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31949/NUM571+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31949/NUM571+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 32045
% 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(23, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(29, 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(32, axiom,(~(xi=sz00)=>((?[X1]:(aElementOf0(X1,szNzAzT0)&szszuzczcdt0(X1)=xi)&aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,xi)))),file('/tmp/SRASS.s.p', m__3702_02)).
% fof(85, conjecture,(aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,xi))),file('/tmp/SRASS.s.p', m__)).
% fof(86, negated_conjecture,~((aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,xi)))),inference(assume_negation,[status(cth)],[85])).
% cnf(194,plain,(isCountable0(xS)),inference(split_conjunct,[status(thm)],[23])).
% cnf(195,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[23])).
% fof(212, 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)],[29])).
% fof(213, 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)],[212])).
% fof(214, 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)],[213])).
% fof(215, 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)],[214])).
% cnf(216,plain,(sdtlpdtrp0(xN,sz00)=xS),inference(split_conjunct,[status(thm)],[215])).
% fof(227, plain,(xi=sz00|((?[X1]:(aElementOf0(X1,szNzAzT0)&szszuzczcdt0(X1)=xi)&aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,xi)))),inference(fof_nnf,[status(thm)],[32])).
% fof(228, plain,(xi=sz00|((?[X2]:(aElementOf0(X2,szNzAzT0)&szszuzczcdt0(X2)=xi)&aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,xi)))),inference(variable_rename,[status(thm)],[227])).
% fof(229, plain,(xi=sz00|(((aElementOf0(esk11_0,szNzAzT0)&szszuzczcdt0(esk11_0)=xi)&aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0))&isCountable0(sdtlpdtrp0(xN,xi)))),inference(skolemize,[status(esa)],[228])).
% fof(230, plain,((((aElementOf0(esk11_0,szNzAzT0)|xi=sz00)&(szszuzczcdt0(esk11_0)=xi|xi=sz00))&(aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)|xi=sz00))&(isCountable0(sdtlpdtrp0(xN,xi))|xi=sz00)),inference(distribute,[status(thm)],[229])).
% cnf(231,plain,(xi=sz00|isCountable0(sdtlpdtrp0(xN,xi))),inference(split_conjunct,[status(thm)],[230])).
% cnf(232,plain,(xi=sz00|aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)),inference(split_conjunct,[status(thm)],[230])).
% fof(484, negated_conjecture,(~(aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,xi)))),inference(fof_nnf,[status(thm)],[86])).
% cnf(485,negated_conjecture,(~isCountable0(sdtlpdtrp0(xN,xi))|~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)),inference(split_conjunct,[status(thm)],[484])).
% cnf(516,negated_conjecture,(xi=sz00|~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)),inference(spm,[status(thm)],[485,231,theory(equality)])).
% cnf(1294,negated_conjecture,(xi=sz00),inference(csr,[status(thm)],[516,232])).
% cnf(1298,negated_conjecture,($false|~isCountable0(sdtlpdtrp0(xN,xi))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[485,1294,theory(equality)]),216,theory(equality)]),195,theory(equality)])).
% cnf(1299,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1298,1294,theory(equality)]),216,theory(equality)]),194,theory(equality)])).
% cnf(1300,negated_conjecture,($false),inference(cn,[status(thm)],[1299,theory(equality)])).
% cnf(1301,negated_conjecture,($false),1300,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 352
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 345
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 566
% # ...of the previous two non-trivial : 520
% # Contextual simplify-reflections : 21
% # Paramodulations : 524
% # Factorizations : 0
% # Equation resolutions : 42
% # Current number of processed clauses: 167
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 138
% # Current number of unprocessed clauses: 457
% # ...number of literals in the above : 2532
% # Clause-clause subsumption calls (NU) : 2448
% # Rec. Clause-clause subsumption calls : 566
% # Unit Clause-clause subsumption calls : 268
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 184 leaves, 1.45+/-1.107 terms/leaf
% # Paramod-from index: 80 leaves, 1.01+/-0.111 terms/leaf
% # Paramod-into index: 156 leaves, 1.24+/-0.664 terms/leaf
% # -------------------------------------------------
% # User time : 0.082 s
% # System time : 0.007 s
% # Total time : 0.089 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.27 WC
% FINAL PrfWatch: 0.20 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP31949/NUM571+1.tptp
%
%------------------------------------------------------------------------------