%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS136+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 Dec 29 08:36:33 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP9270/KRS136+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9270/KRS136+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9270/KRS136+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 9366
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:(cowlThing(X1)&~(cowlNothing(X1))),file('/tmp/SRASS.s.p', axiom_0)).
% fof(2, axiom,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),file('/tmp/SRASS.s.p', axiom_1)).
% fof(3, conjecture,(![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1)))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(4, negated_conjecture,~((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(6, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(7, negated_conjecture,~((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(8, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[5])).
% cnf(9,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(10,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(11, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(12, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[11])).
% cnf(13,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(15, negated_conjecture,(?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1))))),inference(fof_nnf,[status(thm)],[7])).
% fof(16, negated_conjecture,(?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3))))),inference(variable_rename,[status(thm)],[15])).
% fof(17, negated_conjecture,((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0))))),inference(skolemize,[status(esa)],[16])).
% fof(18, negated_conjecture,(((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))&((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))),inference(distribute,[status(thm)],[17])).
% cnf(19,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[19,10,theory(equality)]),['unfolding']).
% cnf(22,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[20,10,theory(equality)]),['unfolding']).
% cnf(23,negated_conjecture,(xsd_string(esk2_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[21,9,theory(equality)])).
% cnf(24,negated_conjecture,(xsd_string(esk2_0)),inference(csr,[status(thm)],[23,13])).
% cnf(25,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false),inference(rw,[status(thm)],[22,24,theory(equality)])).
% cnf(26,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)),inference(cn,[status(thm)],[25,theory(equality)])).
% cnf(27,negated_conjecture,(xsd_integer(esk2_0)),inference(sr,[status(thm)],[26,9,theory(equality)])).
% cnf(28,negated_conjecture,(~xsd_integer(esk2_0)),inference(spm,[status(thm)],[14,24,theory(equality)])).
% cnf(30,negated_conjecture,($false),inference(rw,[status(thm)],[28,27,theory(equality)])).
% cnf(31,negated_conjecture,($false),inference(cn,[status(thm)],[30,theory(equality)])).
% cnf(32,negated_conjecture,($false),31,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 1
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 5
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 5 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 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/SystemOnTPTP9270/KRS136+1.tptp
%
%------------------------------------------------------------------------------