TSTP Solution File: NUM620+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM620+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 : art04.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:01 EST 2010
% Result : Theorem 14.64s
% Output : Solution 14.64s
% 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/SystemOnTPTP17868/NUM620+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17868/NUM620+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17868/NUM620+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 17964
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.01 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.02 WC
% PrfWatch: 9.91 CPU 10.03 WC
% # Preprocessing time : 0.618 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.90 CPU 12.03 WC
% # SZS output start CNFRefutation.
% 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(99, axiom,(aElementOf0(xm,szNzAzT0)&xx=sdtlpdtrp0(xe,xm)),file('/tmp/SRASS.s.p', m__5389)).
% fof(117, conjecture,((![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xm))=>aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))))&aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))))=>aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))),file('/tmp/SRASS.s.p', m__)).
% fof(118, negated_conjecture,~(((![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xm))=>aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))))&aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))))=>aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(assume_negation,[status(cth)],[117])).
% fof(4520, 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(4521, 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)],[4520])).
% fof(4522, 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)],[4521])).
% fof(4523, 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)],[4522])).
% cnf(4527,plain,(aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[4523])).
% cnf(4671,plain,(xx=sdtlpdtrp0(xe,xm)),inference(split_conjunct,[status(thm)],[99])).
% cnf(4672,plain,(aElementOf0(xm,szNzAzT0)),inference(split_conjunct,[status(thm)],[99])).
% fof(4745, negated_conjecture,((![X1]:(~(aElementOf0(X1,sdtlpdtrp0(xN,xm)))|aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))))&aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(fof_nnf,[status(thm)],[118])).
% fof(4746, negated_conjecture,((![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,xm)))|aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(xn))))&aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(variable_rename,[status(thm)],[4745])).
% fof(4747, negated_conjecture,![X2]:(((~(aElementOf0(X2,sdtlpdtrp0(xN,xm)))|aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(xn))))&aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(shift_quantors,[status(thm)],[4746])).
% cnf(4748,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))),inference(split_conjunct,[status(thm)],[4747])).
% cnf(4750,negated_conjecture,(aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))|~aElementOf0(X1,sdtlpdtrp0(xN,xm))),inference(split_conjunct,[status(thm)],[4747])).
% cnf(8599,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,xm))),inference(spm,[status(thm)],[4748,4750,theory(equality)])).
% cnf(8725,plain,(aElementOf0(xx,sdtlpdtrp0(xN,xm))|~aElementOf0(xm,szNzAzT0)),inference(spm,[status(thm)],[4527,4671,theory(equality)])).
% cnf(8732,plain,(aElementOf0(xx,sdtlpdtrp0(xN,xm))|$false),inference(rw,[status(thm)],[8725,4672,theory(equality)])).
% cnf(8733,plain,(aElementOf0(xx,sdtlpdtrp0(xN,xm))),inference(cn,[status(thm)],[8732,theory(equality)])).
% cnf(82902,plain,($false),inference(sr,[status(thm)],[8733,8599,theory(equality)])).
% cnf(82903,plain,($false),82902,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6730
% # ...of these trivial : 14
% # ...subsumed : 553
% # ...remaining for further processing: 6163
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 5
% # Generated clauses : 57514
% # ...of the previous two non-trivial : 48813
% # Contextual simplify-reflections : 3069
% # Paramodulations : 57464
% # Factorizations : 0
% # Equation resolutions : 45
% # Current number of processed clauses: 3087
% # Positive orientable unit clauses: 84
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 15
% # Non-unit-clauses : 2988
% # Current number of unprocessed clauses: 48699
% # ...number of literals in the above : 721772
% # Clause-clause subsumption calls (NU) : 1912501
% # Rec. Clause-clause subsumption calls : 45626
% # Unit Clause-clause subsumption calls : 39266
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 409 leaves, 2.14+/-2.790 terms/leaf
% # Paramod-from index: 199 leaves, 1.01+/-0.100 terms/leaf
% # Paramod-into index: 367 leaves, 1.55+/-1.481 terms/leaf
% # -------------------------------------------------
% # User time : 10.139 s
% # System time : 0.166 s
% # Total time : 10.305 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.56 CPU 13.69 WC
% FINAL PrfWatch: 13.56 CPU 13.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP17868/NUM620+3.tptp
%
%------------------------------------------------------------------------------