%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWB018+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 : art07.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 03:29: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/SystemOnTPTP2856/SWB018+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2856/SWB018+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2856/SWB018+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 2944
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(iext(uri_rdf_type,X1,X2)<=>icext(X2,X1)),file('/tmp/SRASS.s.p', rdfs_cext_def)).
% fof(2, axiom,(iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person)&iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)),file('/tmp/SRASS.s.p', testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics)).
% fof(3, axiom,![X3]:![X2]:![X1]:![X4]:((iext(uri_rdfs_domain,X3,X2)&iext(X3,X1,X4))=>icext(X2,X1)),file('/tmp/SRASS.s.p', rdfs_domain_main)).
% fof(4, axiom,![X1]:![X4]:(iext(uri_owl_sameAs,X1,X4)<=>X1=X4),file('/tmp/SRASS.s.p', owl_eqdis_sameas)).
% fof(5, conjecture,iext(uri_rdf_type,uri_ex_u,uri_ex_Person),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_018_Modified_Logical_Vocabulary_Semantics)).
% fof(6, negated_conjecture,~(iext(uri_rdf_type,uri_ex_u,uri_ex_Person)),inference(assume_negation,[status(cth)],[5])).
% fof(7, negated_conjecture,~(iext(uri_rdf_type,uri_ex_u,uri_ex_Person)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(8, plain,![X1]:![X2]:((~(iext(uri_rdf_type,X1,X2))|icext(X2,X1))&(~(icext(X2,X1))|iext(uri_rdf_type,X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(9, plain,![X3]:![X4]:((~(iext(uri_rdf_type,X3,X4))|icext(X4,X3))&(~(icext(X4,X3))|iext(uri_rdf_type,X3,X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(10,plain,(iext(uri_rdf_type,X1,X2)|~icext(X2,X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(12,plain,(iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)),inference(split_conjunct,[status(thm)],[2])).
% cnf(13,plain,(iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person)),inference(split_conjunct,[status(thm)],[2])).
% fof(14, plain,![X3]:![X2]:![X1]:![X4]:((~(iext(uri_rdfs_domain,X3,X2))|~(iext(X3,X1,X4)))|icext(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X5]:![X6]:![X7]:![X8]:((~(iext(uri_rdfs_domain,X5,X6))|~(iext(X5,X7,X8)))|icext(X6,X7)),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(icext(X1,X2)|~iext(X3,X2,X4)|~iext(uri_rdfs_domain,X3,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X4]:((~(iext(uri_owl_sameAs,X1,X4))|X1=X4)&(~(X1=X4)|iext(uri_owl_sameAs,X1,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(18, plain,![X5]:![X6]:((~(iext(uri_owl_sameAs,X5,X6))|X5=X6)&(~(X5=X6)|iext(uri_owl_sameAs,X5,X6))),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,(iext(uri_owl_sameAs,X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(X1=X2|~iext(uri_owl_sameAs,X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,negated_conjecture,(~iext(uri_rdf_type,uri_ex_u,uri_ex_Person)),inference(split_conjunct,[status(thm)],[7])).
% cnf(22,plain,(iext(uri_owl_sameAs,X1,X1)),inference(er,[status(thm)],[19,theory(equality)])).
% cnf(23,plain,(uri_ex_w=uri_ex_u),inference(spm,[status(thm)],[20,12,theory(equality)])).
% cnf(25,plain,(icext(uri_ex_Person,X1)|~iext(uri_owl_sameAs,X1,X2)),inference(spm,[status(thm)],[16,13,theory(equality)])).
% cnf(26,negated_conjecture,(~iext(uri_rdf_type,uri_ex_w,uri_ex_Person)),inference(rw,[status(thm)],[21,23,theory(equality)])).
% cnf(28,plain,(icext(uri_ex_Person,X1)),inference(spm,[status(thm)],[25,22,theory(equality)])).
% cnf(29,plain,(iext(uri_rdf_type,X1,uri_ex_Person)),inference(spm,[status(thm)],[10,28,theory(equality)])).
% cnf(31,negated_conjecture,($false),inference(rw,[status(thm)],[26,29,theory(equality)])).
% cnf(32,negated_conjecture,($false),inference(cn,[status(thm)],[31,theory(equality)])).
% cnf(33,negated_conjecture,($false),32,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 22
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 6
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 14 leaves, 1.29+/-0.589 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.18+/-0.386 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP2856/SWB018+2.tptp
%
%------------------------------------------------------------------------------