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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWV366+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 08:48:00 EST 2010

% Result   : Theorem 1.06s
% Output   : Solution 1.06s
% 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/SystemOnTPTP22269/SWV366+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22269/SWV366+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22269/SWV366+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 22365
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:i(triple(X1,insert_slb(X2,pair(X4,X5)),X3))=insert_pq(i(triple(X1,X2,X3)),X4),file('/tmp/SRASS.s.p', ax55)).
% fof(63, conjecture,![X1]:(![X2]:![X3]:![X4]:![X5]:i(triple(X2,X1,X4))=i(triple(X3,X1,X5))=>![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:i(triple(X6,insert_slb(X1,pair(X10,X11)),X8))=i(triple(X7,insert_slb(X1,pair(X10,X11)),X9))),file('/tmp/SRASS.s.p', l2_co)).
% fof(64, negated_conjecture,~(![X1]:(![X2]:![X3]:![X4]:![X5]:i(triple(X2,X1,X4))=i(triple(X3,X1,X5))=>![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:i(triple(X6,insert_slb(X1,pair(X10,X11)),X8))=i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)))),inference(assume_negation,[status(cth)],[63])).
% fof(76, plain,![X6]:![X7]:![X8]:![X9]:![X10]:i(triple(X6,insert_slb(X7,pair(X9,X10)),X8))=insert_pq(i(triple(X6,X7,X8)),X9),inference(variable_rename,[status(thm)],[1])).
% cnf(77,plain,(i(triple(X1,insert_slb(X2,pair(X3,X4)),X5))=insert_pq(i(triple(X1,X2,X5)),X3)),inference(split_conjunct,[status(thm)],[76])).
% fof(276, negated_conjecture,?[X1]:(![X2]:![X3]:![X4]:![X5]:i(triple(X2,X1,X4))=i(triple(X3,X1,X5))&?[X6]:?[X7]:?[X8]:?[X9]:?[X10]:?[X11]:~(i(triple(X6,insert_slb(X1,pair(X10,X11)),X8))=i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)))),inference(fof_nnf,[status(thm)],[64])).
% fof(277, negated_conjecture,?[X12]:(![X13]:![X14]:![X15]:![X16]:i(triple(X13,X12,X15))=i(triple(X14,X12,X16))&?[X17]:?[X18]:?[X19]:?[X20]:?[X21]:?[X22]:~(i(triple(X17,insert_slb(X12,pair(X21,X22)),X19))=i(triple(X18,insert_slb(X12,pair(X21,X22)),X20)))),inference(variable_rename,[status(thm)],[276])).
% fof(278, negated_conjecture,(![X13]:![X14]:![X15]:![X16]:i(triple(X13,esk5_0,X15))=i(triple(X14,esk5_0,X16))&~(i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0))=i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0)))),inference(skolemize,[status(esa)],[277])).
% fof(279, negated_conjecture,![X13]:![X14]:![X15]:![X16]:(i(triple(X13,esk5_0,X15))=i(triple(X14,esk5_0,X16))&~(i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0))=i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0)))),inference(shift_quantors,[status(thm)],[278])).
% cnf(280,negated_conjecture,(i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0))!=i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0))),inference(split_conjunct,[status(thm)],[279])).
% cnf(281,negated_conjecture,(i(triple(X1,esk5_0,X2))=i(triple(X3,esk5_0,X4))),inference(split_conjunct,[status(thm)],[279])).
% cnf(363,negated_conjecture,(i(triple(X1,insert_slb(esk5_0,pair(X2,X3)),X4))=insert_pq(i(triple(X5,esk5_0,X6)),X2)),inference(spm,[status(thm)],[77,281,theory(equality)])).
% cnf(908,negated_conjecture,(i(triple(X1,insert_slb(esk5_0,pair(X2,X3)),X4))=i(triple(X5,insert_slb(esk5_0,pair(X2,X6)),X7))),inference(spm,[status(thm)],[77,363,theory(equality)])).
% cnf(997,negated_conjecture,($false),inference(sr,[status(thm)],[280,908,theory(equality)])).
% cnf(998,negated_conjecture,($false),997,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 313
% # ...of these trivial                : 3
% # ...subsumed                        : 51
% # ...remaining for further processing: 259
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 612
% # ...of the previous two non-trivial : 490
% # Contextual simplify-reflections    : 15
% # Paramodulations                    : 600
% # Factorizations                     : 8
% # Equation resolutions               : 4
% # Current number of processed clauses: 169
% #    Positive orientable unit clauses: 29
% #    Positive unorientable unit clauses: 5
% #    Negative unit clauses           : 17
% #    Non-unit-clauses                : 118
% # Current number of unprocessed clauses: 349
% # ...number of literals in the above : 1127
% # Clause-clause subsumption calls (NU) : 1192
% # Rec. Clause-clause subsumption calls : 842
% # Unit Clause-clause subsumption calls : 72
% # Rewrite failures with RHS unbound  : 30
% # Indexed BW rewrite attempts        : 26
% # Indexed BW rewrite successes       : 8
% # Backwards rewriting index:   171 leaves,   2.08+/-2.358 terms/leaf
% # Paramod-from index:           72 leaves,   1.26+/-0.667 terms/leaf
% # Paramod-into index:          152 leaves,   1.91+/-2.391 terms/leaf
% # -------------------------------------------------
% # User time              : 0.053 s
% # System time            : 0.004 s
% # Total time             : 0.057 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP22269/SWV366+1.tptp
% 
%------------------------------------------------------------------------------