TSTP Solution File: SWB007+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWB007+2 : 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:59:39 EST 2011
% Result : Theorem 0.49s
% Output : Solution 0.49s
% 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/SystemOnTPTP26715/SWB007+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26715/SWB007+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26715/SWB007+2.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 26803
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(((iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2)&iext(uri_rdf_type,uri_ex_w,uri_ex_c1))&iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1))&iext(uri_rdfs_range,uri_ex_p,uri_ex_c1)),file('/tmp/SRASS.s.p', testcase_premise_fullish_007_Equal_Classes)).
% fof(2, axiom,![X1]:![X2]:(iext(uri_owl_sameAs,X1,X2)<=>X1=X2),file('/tmp/SRASS.s.p', owl_eqdis_sameas)).
% fof(3, conjecture,((iext(uri_rdf_type,uri_ex_w,uri_ex_c2)&iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2))&iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_007_Equal_Classes)).
% fof(4, negated_conjecture,~(((iext(uri_rdf_type,uri_ex_w,uri_ex_c2)&iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2))&iext(uri_rdfs_range,uri_ex_p,uri_ex_c2))),inference(assume_negation,[status(cth)],[3])).
% cnf(5,plain,(iext(uri_rdfs_range,uri_ex_p,uri_ex_c1)),inference(split_conjunct,[status(thm)],[1])).
% cnf(6,plain,(iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)),inference(split_conjunct,[status(thm)],[1])).
% cnf(7,plain,(iext(uri_rdf_type,uri_ex_w,uri_ex_c1)),inference(split_conjunct,[status(thm)],[1])).
% cnf(8,plain,(iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2)),inference(split_conjunct,[status(thm)],[1])).
% fof(9, plain,![X1]:![X2]:((~(iext(uri_owl_sameAs,X1,X2))|X1=X2)&(~(X1=X2)|iext(uri_owl_sameAs,X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(10, plain,![X3]:![X4]:((~(iext(uri_owl_sameAs,X3,X4))|X3=X4)&(~(X3=X4)|iext(uri_owl_sameAs,X3,X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(12,plain,(X1=X2|~iext(uri_owl_sameAs,X1,X2)),inference(split_conjunct,[status(thm)],[10])).
% fof(13, negated_conjecture,((~(iext(uri_rdf_type,uri_ex_w,uri_ex_c2))|~(iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)))|~(iext(uri_rdfs_range,uri_ex_p,uri_ex_c2))),inference(fof_nnf,[status(thm)],[4])).
% cnf(14,negated_conjecture,(~iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)|~iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)|~iext(uri_rdf_type,uri_ex_w,uri_ex_c2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(16,plain,(uri_ex_c1=uri_ex_c2),inference(spm,[status(thm)],[12,8,theory(equality)])).
% cnf(17,negated_conjecture,($false|~iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)|~iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14,16,theory(equality)]),7,theory(equality)])).
% cnf(18,negated_conjecture,($false|$false|~iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17,16,theory(equality)]),6,theory(equality)])).
% cnf(19,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18,16,theory(equality)]),5,theory(equality)])).
% cnf(20,negated_conjecture,($false),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(21,negated_conjecture,($false),20,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 2
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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 : 5
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 14 leaves, 1.07+/-0.258 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.08+/-0.266 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.004 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.15 WC
% FINAL PrfWatch: 0.10 CPU 0.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP26715/SWB007+2.tptp
%
%------------------------------------------------------------------------------