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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWB001+1 : TPTP v5.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art06.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 Feb 16 02:54:27 EST 2011

% Result   : Theorem 16.94s
% Output   : Solution 16.94s
% 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/SystemOnTPTP25352/SWB001+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% WARNING: TreeLimitedRun lost 0.68s, total lost is 0.68s
% found
% SZS status THM for /tmp/SystemOnTPTP25352/SWB001+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25352/SWB001+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 25476
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.140 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,(((iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_r)&iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction))&iext(uri_owl_onProperty,uri_ex_r,uri_ex_p))&iext(uri_owl_someValuesFrom,uri_ex_r,uri_ex_d)),file('/tmp/SRASS.s.p', testcase_premise_fullish_001_Subgraph_Entailment)).
% fof(560, conjecture,(iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)&iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_001_Subgraph_Entailment)).
% fof(561, negated_conjecture,~((iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)&iext(uri_owl_onProperty,uri_ex_r,uri_ex_p))),inference(assume_negation,[status(cth)],[560])).
% cnf(600,plain,(iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)),inference(split_conjunct,[status(thm)],[5])).
% cnf(601,plain,(iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)),inference(split_conjunct,[status(thm)],[5])).
% fof(2831, negated_conjecture,(~(iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction))|~(iext(uri_owl_onProperty,uri_ex_r,uri_ex_p))),inference(fof_nnf,[status(thm)],[561])).
% cnf(2832,negated_conjecture,(~iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)|~iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)),inference(split_conjunct,[status(thm)],[2831])).
% cnf(3009,negated_conjecture,($false|~iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)),inference(rw,[status(thm)],[2832,601,theory(equality)])).
% cnf(3010,negated_conjecture,($false|$false),inference(rw,[status(thm)],[3009,600,theory(equality)])).
% cnf(3011,negated_conjecture,($false),inference(cn,[status(thm)],[3010,theory(equality)])).
% cnf(3012,negated_conjecture,($false),3011,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 227
% # ...of these trivial                : 3
% # ...subsumed                        : 2
% # ...remaining for further processing: 222
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 2
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 2
% # Current number of processed clauses: 219
% #    Positive orientable unit clauses: 205
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 11
% # Current number of unprocessed clauses: 935
% # ...number of literals in the above : 4954
% # Clause-clause subsumption calls (NU) : 11
% # Rec. Clause-clause subsumption calls : 11
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 19
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   378 leaves,   1.01+/-0.089 terms/leaf
% # Paramod-from index:          203 leaves,   1.01+/-0.121 terms/leaf
% # Paramod-into index:          372 leaves,   1.01+/-0.089 terms/leaf
% # -------------------------------------------------
% # User time              : 0.140 s
% # System time            : 0.007 s
% # Total time             : 0.147 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.50 WC
% FINAL PrfWatch: 0.38 CPU 0.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP25352/SWB001+1.tptp
% 
%------------------------------------------------------------------------------