TSTP Solution File: NUM613+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM613+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 : art01.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:37:45 EST 2010

% Result   : Theorem 1.45s
% Output   : Solution 1.45s
% 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/SystemOnTPTP16013/NUM613+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP16013/NUM613+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16013/NUM613+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 16109
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(14, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(szszuzczcdt0(X1)=szszuzczcdt0(X2)=>X1=X2)),file('/tmp/SRASS.s.p', mSuccEquSucc)).
% fof(50, axiom,(aElementOf0(xk,szNzAzT0)&szszuzczcdt0(xk)=xK),file('/tmp/SRASS.s.p', m__3533)).
% fof(79, axiom,((sbrdtbr0(xQ)=szszuzczcdt0(xk)&szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ))&aElementOf0(sbrdtbr0(xP),szNzAzT0)),file('/tmp/SRASS.s.p', m__5255)).
% fof(110, conjecture,sbrdtbr0(xP)=xk,file('/tmp/SRASS.s.p', m__)).
% fof(111, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(assume_negation,[status(cth)],[110])).
% fof(124, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(fof_simplification,[status(thm)],[111,theory(equality)])).
% fof(174, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(szszuzczcdt0(X1)=szszuzczcdt0(X2))|X1=X2)),inference(fof_nnf,[status(thm)],[14])).
% fof(175, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(szszuzczcdt0(X3)=szszuzczcdt0(X4))|X3=X4)),inference(variable_rename,[status(thm)],[174])).
% cnf(176,plain,(X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[175])).
% cnf(334,plain,(szszuzczcdt0(xk)=xK),inference(split_conjunct,[status(thm)],[50])).
% cnf(335,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(431,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(split_conjunct,[status(thm)],[79])).
% cnf(432,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)),inference(split_conjunct,[status(thm)],[79])).
% cnf(433,plain,(sbrdtbr0(xQ)=szszuzczcdt0(xk)),inference(split_conjunct,[status(thm)],[79])).
% cnf(585,negated_conjecture,(sbrdtbr0(xP)!=xk),inference(split_conjunct,[status(thm)],[124])).
% cnf(588,plain,(sbrdtbr0(xQ)=xK),inference(rw,[status(thm)],[433,334,theory(equality)])).
% cnf(589,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK),inference(rw,[status(thm)],[432,588,theory(equality)])).
% cnf(916,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(xk,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[176,334,theory(equality)])).
% cnf(921,plain,(X1=xk|szszuzczcdt0(X1)!=xK|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[916,335,theory(equality)])).
% cnf(922,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[921,theory(equality)])).
% cnf(2480,plain,(sbrdtbr0(xP)=xk|~aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(spm,[status(thm)],[922,589,theory(equality)])).
% cnf(2483,plain,(sbrdtbr0(xP)=xk|$false),inference(rw,[status(thm)],[2480,431,theory(equality)])).
% cnf(2484,plain,(sbrdtbr0(xP)=xk),inference(cn,[status(thm)],[2483,theory(equality)])).
% cnf(2485,plain,($false),inference(sr,[status(thm)],[2484,585,theory(equality)])).
% cnf(2486,plain,($false),2485,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 564
% # ...of these trivial                : 11
% # ...subsumed                        : 47
% # ...remaining for further processing: 506
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 2
% # Generated clauses                  : 1040
% # ...of the previous two non-trivial : 965
% # Contextual simplify-reflections    : 28
% # Paramodulations                    : 999
% # Factorizations                     : 0
% # Equation resolutions               : 41
% # Current number of processed clauses: 292
% #    Positive orientable unit clauses: 72
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 28
% #    Non-unit-clauses                : 192
% # Current number of unprocessed clauses: 807
% # ...number of literals in the above : 4216
% # Clause-clause subsumption calls (NU) : 3134
% # Rec. Clause-clause subsumption calls : 891
% # Unit Clause-clause subsumption calls : 1584
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:   314 leaves,   1.29+/-0.893 terms/leaf
% # Paramod-from index:          154 leaves,   1.01+/-0.080 terms/leaf
% # Paramod-into index:          277 leaves,   1.16+/-0.538 terms/leaf
% # -------------------------------------------------
% # User time              : 0.119 s
% # System time            : 0.008 s
% # Total time             : 0.127 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP16013/NUM613+1.tptp
% 
%------------------------------------------------------------------------------