TSTP Solution File: NUM622+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM622+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:40:34 EST 2010
% Result : Theorem 5.62s
% Output : Solution 5.62s
% 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/SystemOnTPTP20298/NUM622+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20298/NUM622+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20298/NUM622+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 20394
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.618 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.90 CPU 4.01 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(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(102, axiom,(![X1]:(aElementOf0(X1,sdtlpdtrp0(xN,xn))=>aElementOf0(X1,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),file('/tmp/SRASS.s.p', m__5461)).
% fof(119, conjecture,aElementOf0(xp,sdtlpdtrp0(xN,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(120, negated_conjecture,~(aElementOf0(xp,sdtlpdtrp0(xN,xm))),inference(assume_negation,[status(cth)],[119])).
% fof(133, negated_conjecture,~(aElementOf0(xp,sdtlpdtrp0(xN,xm))),inference(fof_simplification,[status(thm)],[120,theory(equality)])).
% fof(4523, 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(4524, 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)],[4523])).
% fof(4525, 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)],[4524])).
% fof(4526, 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)],[4525])).
% cnf(4530,plain,(aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[4526])).
% cnf(4659,plain,(sdtlpdtrp0(xe,xn)=xp),inference(split_conjunct,[status(thm)],[95])).
% cnf(4660,plain,(aElementOf0(xn,szNzAzT0)),inference(split_conjunct,[status(thm)],[95])).
% fof(4685, plain,(![X1]:(~(aElementOf0(X1,sdtlpdtrp0(xN,xn)))|aElementOf0(X1,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),inference(fof_nnf,[status(thm)],[102])).
% fof(4686, plain,(![X2]:(~(aElementOf0(X2,sdtlpdtrp0(xN,xn)))|aElementOf0(X2,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),inference(variable_rename,[status(thm)],[4685])).
% fof(4687, plain,![X2]:((~(aElementOf0(X2,sdtlpdtrp0(xN,xn)))|aElementOf0(X2,sdtlpdtrp0(xN,xm)))&aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),inference(shift_quantors,[status(thm)],[4686])).
% cnf(4689,plain,(aElementOf0(X1,sdtlpdtrp0(xN,xm))|~aElementOf0(X1,sdtlpdtrp0(xN,xn))),inference(split_conjunct,[status(thm)],[4687])).
% cnf(4759,negated_conjecture,(~aElementOf0(xp,sdtlpdtrp0(xN,xm))),inference(split_conjunct,[status(thm)],[133])).
% cnf(8664,plain,(aElementOf0(sdtlpdtrp0(xe,xn),sdtlpdtrp0(xN,xm))|~aElementOf0(xn,szNzAzT0)),inference(spm,[status(thm)],[4689,4530,theory(equality)])).
% cnf(8674,plain,(aElementOf0(xp,sdtlpdtrp0(xN,xm))|~aElementOf0(xn,szNzAzT0)),inference(rw,[status(thm)],[8664,4659,theory(equality)])).
% cnf(8675,plain,(aElementOf0(xp,sdtlpdtrp0(xN,xm))|$false),inference(rw,[status(thm)],[8674,4660,theory(equality)])).
% cnf(8676,plain,(aElementOf0(xp,sdtlpdtrp0(xN,xm))),inference(cn,[status(thm)],[8675,theory(equality)])).
% cnf(8677,plain,($false),inference(sr,[status(thm)],[8676,4759,theory(equality)])).
% cnf(8678,plain,($false),8677,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3723
% # ...of these trivial : 6
% # ...subsumed : 531
% # ...remaining for further processing: 3186
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 1
% # Generated clauses : 82
% # ...of the previous two non-trivial : 66
% # Contextual simplify-reflections : 3069
% # Paramodulations : 74
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 62
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 45
% # Current number of unprocessed clauses: 3009
% # ...number of literals in the above : 33647
% # Clause-clause subsumption calls (NU) : 967492
% # Rec. Clause-clause subsumption calls : 25830
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 151 leaves, 1.01+/-0.114 terms/leaf
% # Paramod-from index: 91 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 146 leaves, 1.01+/-0.082 terms/leaf
% # -------------------------------------------------
% # User time : 3.196 s
% # System time : 0.057 s
% # Total time : 3.253 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.55 CPU 4.65 WC
% FINAL PrfWatch: 4.55 CPU 4.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP20298/NUM622+3.tptp
%
%------------------------------------------------------------------------------