%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS163+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 : art01.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:39:18 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP30601/KRS163+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30601/KRS163+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30601/KRS163+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 30697
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X3]:(cowlThing(X3)&~(cowlNothing(X3))),file('/tmp/SRASS.s.p', axiom_0)).
% fof(6, axiom,![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))),file('/tmp/SRASS.s.p', axiom_1)).
% fof(9, axiom,cA(ia),file('/tmp/SRASS.s.p', axiom_2)).
% fof(10, axiom,cB(ib),file('/tmp/SRASS.s.p', axiom_4)).
% fof(13, axiom,![X3]:~((cB(X3)&cA(X3))),file('/tmp/SRASS.s.p', axiom_6)).
% fof(14, conjecture,((((![X3]:(cowlThing(X3)&~(cowlNothing(X3)))&![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))))&cowlThing(ia))&cowlThing(ib))&~(ia=ib)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(15, negated_conjecture,~(((((![X3]:(cowlThing(X3)&~(cowlNothing(X3)))&![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))))&cowlThing(ia))&cowlThing(ib))&~(ia=ib))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:(cowlThing(X3)&~(cowlNothing(X3))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(17, plain,![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(18, negated_conjecture,~(((((![X3]:(cowlThing(X3)&~(cowlNothing(X3)))&![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))))&cowlThing(ia))&cowlThing(ib))&~(ia=ib))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(31, plain,![X4]:(cowlThing(X4)&~(cowlNothing(X4))),inference(variable_rename,[status(thm)],[16])).
% cnf(32,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(34, plain,![X3]:((~(xsd_string(X3))|~(xsd_integer(X3)))&(xsd_integer(X3)|xsd_string(X3))),inference(fof_nnf,[status(thm)],[17])).
% fof(35, plain,![X4]:((~(xsd_string(X4))|~(xsd_integer(X4)))&(xsd_integer(X4)|xsd_string(X4))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(40,plain,(cA(ia)),inference(split_conjunct,[status(thm)],[9])).
% cnf(41,plain,(cB(ib)),inference(split_conjunct,[status(thm)],[10])).
% fof(48, plain,![X3]:(~(cB(X3))|~(cA(X3))),inference(fof_nnf,[status(thm)],[13])).
% fof(49, plain,![X4]:(~(cB(X4))|~(cA(X4))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(~cA(X1)|~cB(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,((((?[X3]:(~(cowlThing(X3))|cowlNothing(X3))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cowlThing(ia)))|~(cowlThing(ib)))|ia=ib),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,((((?[X4]:(~(cowlThing(X4))|cowlNothing(X4))|?[X5]:((~(xsd_string(X5))|xsd_integer(X5))&(xsd_string(X5)|~(xsd_integer(X5)))))|~(cowlThing(ia)))|~(cowlThing(ib)))|ia=ib),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(((((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|~(cowlThing(ia)))|~(cowlThing(ib)))|ia=ib),inference(skolemize,[status(esa)],[52])).
% fof(54, negated_conjecture,((((((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))|~(cowlThing(ia)))|~(cowlThing(ib)))|ia=ib)&(((((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))|~(cowlThing(ia)))|~(cowlThing(ib)))|ia=ib)),inference(distribute,[status(thm)],[53])).
% cnf(55,negated_conjecture,(ia=ib|cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,negated_conjecture,(ia=ib|cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(59,negated_conjecture,(ib=ia|cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|$false|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[56,33,theory(equality)]),33,theory(equality)]),33,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(ib=ia|cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|$false|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[55,33,theory(equality)]),33,theory(equality)]),33,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(ia=ib|xsd_integer(esk2_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[59,32,theory(equality)])).
% cnf(62,negated_conjecture,(ia=ib|xsd_integer(esk2_0)),inference(csr,[status(thm)],[61,36])).
% cnf(63,negated_conjecture,(ia=ib|xsd_string(esk2_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[60,32,theory(equality)])).
% cnf(64,negated_conjecture,(ia=ib|xsd_string(esk2_0)),inference(csr,[status(thm)],[63,36])).
% cnf(65,negated_conjecture,(ia=ib|~xsd_integer(esk2_0)),inference(spm,[status(thm)],[37,64,theory(equality)])).
% cnf(67,plain,(~cA(ib)),inference(spm,[status(thm)],[50,41,theory(equality)])).
% cnf(68,negated_conjecture,(ia=ib),inference(csr,[status(thm)],[65,62])).
% cnf(70,plain,(cA(ib)),inference(rw,[status(thm)],[40,68,theory(equality)])).
% cnf(71,plain,($false),inference(sr,[status(thm)],[70,67,theory(equality)])).
% cnf(72,plain,($false),71,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 3
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 3
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 10 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 7 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP30601/KRS163+1.tptp
%
%------------------------------------------------------------------------------