TSTP Solution File: SWV365+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV365+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:47:51 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP22010/SWV365+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22010/SWV365+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22010/SWV365+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 22106
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:i(triple(X1,create_slb,X2))=create_pq,file('/tmp/SRASS.s.p', ax54)).
% fof(63, conjecture,![X1]:![X2]:![X4]:![X5]:i(triple(X1,create_slb,X4))=i(triple(X2,create_slb,X5)),file('/tmp/SRASS.s.p', l1_co)).
% fof(64, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:i(triple(X1,create_slb,X4))=i(triple(X2,create_slb,X5))),inference(assume_negation,[status(cth)],[63])).
% fof(76, plain,![X3]:![X4]:i(triple(X3,create_slb,X4))=create_pq,inference(variable_rename,[status(thm)],[1])).
% cnf(77,plain,(i(triple(X1,create_slb,X2))=create_pq),inference(split_conjunct,[status(thm)],[76])).
% fof(276, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:~(i(triple(X1,create_slb,X4))=i(triple(X2,create_slb,X5))),inference(fof_nnf,[status(thm)],[64])).
% fof(277, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:~(i(triple(X6,create_slb,X8))=i(triple(X7,create_slb,X9))),inference(variable_rename,[status(thm)],[276])).
% fof(278, negated_conjecture,~(i(triple(esk5_0,create_slb,esk7_0))=i(triple(esk6_0,create_slb,esk8_0))),inference(skolemize,[status(esa)],[277])).
% cnf(279,negated_conjecture,(i(triple(esk5_0,create_slb,esk7_0))!=i(triple(esk6_0,create_slb,esk8_0))),inference(split_conjunct,[status(thm)],[278])).
% cnf(281,negated_conjecture,(create_pq!=i(triple(esk5_0,create_slb,esk7_0))),inference(rw,[status(thm)],[279,77,theory(equality)])).
% cnf(282,negated_conjecture,($false),inference(rw,[status(thm)],[281,77,theory(equality)])).
% cnf(283,negated_conjecture,($false),inference(cn,[status(thm)],[282,theory(equality)])).
% cnf(284,negated_conjecture,($false),283,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 21
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 64
% # ...number of literals in the above : 151
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 32 leaves, 1.03+/-0.174 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 30 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP22010/SWV365+1.tptp
%
%------------------------------------------------------------------------------