%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS160+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:06 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP30342/KRS160+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30342/KRS160+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30342/KRS160+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 30438
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 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(8, axiom,cC4(iV21081),file('/tmp/SRASS.s.p', axiom_18)).
% fof(10, axiom,cC2(iV21081),file('/tmp/SRASS.s.p', axiom_20)).
% fof(11, axiom,cTEST(iV21080),file('/tmp/SRASS.s.p', axiom_13)).
% fof(12, axiom,![X1]:(cC10(X1)<=>(cC4(X1)&cC2(X1))),file('/tmp/SRASS.s.p', axiom_2)).
% fof(13, axiom,![X1]:(cTEST(X1)<=>(cC8xcomp(X1)&cC12(X1))),file('/tmp/SRASS.s.p', axiom_12)).
% fof(23, conjecture,(((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cowlThing(iV21080))&cC12(iV21080))&cC10(iV21081))&cowlThing(iV21081)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(24, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cowlThing(iV21080))&cC12(iV21080))&cC10(iV21081))&cowlThing(iV21081))),inference(assume_negation,[status(cth)],[23])).
% fof(25, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(26, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(27, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cowlThing(iV21080))&cC12(iV21080))&cC10(iV21081))&cowlThing(iV21081))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(28, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[25])).
% cnf(29,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(31, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[26])).
% fof(32, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(47,plain,(cC4(iV21081)),inference(split_conjunct,[status(thm)],[8])).
% cnf(49,plain,(cC2(iV21081)),inference(split_conjunct,[status(thm)],[10])).
% cnf(50,plain,(cTEST(iV21080)),inference(split_conjunct,[status(thm)],[11])).
% fof(51, plain,![X1]:((~(cC10(X1))|(cC4(X1)&cC2(X1)))&((~(cC4(X1))|~(cC2(X1)))|cC10(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(52, plain,![X2]:((~(cC10(X2))|(cC4(X2)&cC2(X2)))&((~(cC4(X2))|~(cC2(X2)))|cC10(X2))),inference(variable_rename,[status(thm)],[51])).
% fof(53, plain,![X2]:(((cC4(X2)|~(cC10(X2)))&(cC2(X2)|~(cC10(X2))))&((~(cC4(X2))|~(cC2(X2)))|cC10(X2))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(cC10(X1)|~cC2(X1)|~cC4(X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(57, plain,![X1]:((~(cTEST(X1))|(cC8xcomp(X1)&cC12(X1)))&((~(cC8xcomp(X1))|~(cC12(X1)))|cTEST(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(58, plain,![X2]:((~(cTEST(X2))|(cC8xcomp(X2)&cC12(X2)))&((~(cC8xcomp(X2))|~(cC12(X2)))|cTEST(X2))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X2]:(((cC8xcomp(X2)|~(cTEST(X2)))&(cC12(X2)|~(cTEST(X2))))&((~(cC8xcomp(X2))|~(cC12(X2)))|cTEST(X2))),inference(distribute,[status(thm)],[58])).
% cnf(61,plain,(cC12(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(116, negated_conjecture,(((((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081))),inference(fof_nnf,[status(thm)],[27])).
% fof(117, negated_conjecture,(((((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081))),inference(variable_rename,[status(thm)],[116])).
% fof(118, negated_conjecture,((((((~(cowlThing(esk9_0))|cowlNothing(esk9_0))|((~(xsd_string(esk10_0))|xsd_integer(esk10_0))&(xsd_string(esk10_0)|~(xsd_integer(esk10_0)))))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081))),inference(skolemize,[status(esa)],[117])).
% fof(119, negated_conjecture,(((((((~(xsd_string(esk10_0))|xsd_integer(esk10_0))|(~(cowlThing(esk9_0))|cowlNothing(esk9_0)))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081)))&((((((xsd_string(esk10_0)|~(xsd_integer(esk10_0)))|(~(cowlThing(esk9_0))|cowlNothing(esk9_0)))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081)))),inference(distribute,[status(thm)],[118])).
% cnf(120,negated_conjecture,(cowlNothing(esk9_0)|xsd_string(esk10_0)|~cowlThing(iV21081)|~cC10(iV21081)|~cC12(iV21080)|~cowlThing(iV21080)|~cowlThing(esk9_0)|~xsd_integer(esk10_0)),inference(split_conjunct,[status(thm)],[119])).
% cnf(121,negated_conjecture,(cowlNothing(esk9_0)|xsd_integer(esk10_0)|~cowlThing(iV21081)|~cC10(iV21081)|~cC12(iV21080)|~cowlThing(iV21080)|~cowlThing(esk9_0)|~xsd_string(esk10_0)),inference(split_conjunct,[status(thm)],[119])).
% cnf(124,negated_conjecture,(cowlNothing(esk9_0)|xsd_string(esk10_0)|$false|$false|$false|~xsd_integer(esk10_0)|~cC12(iV21080)|~cC10(iV21081)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[120,30,theory(equality)]),30,theory(equality)]),30,theory(equality)]),['unfolding']).
% cnf(125,negated_conjecture,(cowlNothing(esk9_0)|xsd_integer(esk10_0)|$false|$false|$false|~xsd_string(esk10_0)|~cC12(iV21080)|~cC10(iV21081)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[121,30,theory(equality)]),30,theory(equality)]),30,theory(equality)]),['unfolding']).
% cnf(126,negated_conjecture,(xsd_string(esk10_0)|~xsd_integer(esk10_0)|~cC12(iV21080)|~cC10(iV21081)),inference(sr,[status(thm)],[124,29,theory(equality)])).
% cnf(127,negated_conjecture,(xsd_string(esk10_0)|~cC10(iV21081)|~cC12(iV21080)),inference(csr,[status(thm)],[126,33])).
% cnf(128,negated_conjecture,(xsd_integer(esk10_0)|~xsd_string(esk10_0)|~cC12(iV21080)|~cC10(iV21081)),inference(sr,[status(thm)],[125,29,theory(equality)])).
% cnf(129,negated_conjecture,(xsd_integer(esk10_0)|~cC10(iV21081)|~cC12(iV21080)),inference(csr,[status(thm)],[128,33])).
% cnf(132,plain,(cC12(iV21080)),inference(spm,[status(thm)],[61,50,theory(equality)])).
% cnf(135,plain,(cC10(iV21081)|~cC4(iV21081)),inference(spm,[status(thm)],[54,49,theory(equality)])).
% cnf(137,plain,(cC10(iV21081)|$false),inference(rw,[status(thm)],[135,47,theory(equality)])).
% cnf(138,plain,(cC10(iV21081)),inference(cn,[status(thm)],[137,theory(equality)])).
% cnf(160,negated_conjecture,(xsd_integer(esk10_0)|~cC10(iV21081)|$false),inference(rw,[status(thm)],[129,132,theory(equality)])).
% cnf(161,negated_conjecture,(xsd_integer(esk10_0)|~cC10(iV21081)),inference(cn,[status(thm)],[160,theory(equality)])).
% cnf(162,negated_conjecture,(xsd_string(esk10_0)|~cC10(iV21081)|$false),inference(rw,[status(thm)],[127,132,theory(equality)])).
% cnf(163,negated_conjecture,(xsd_string(esk10_0)|~cC10(iV21081)),inference(cn,[status(thm)],[162,theory(equality)])).
% cnf(164,negated_conjecture,(~xsd_string(esk10_0)|~cC10(iV21081)),inference(spm,[status(thm)],[34,161,theory(equality)])).
% cnf(165,negated_conjecture,(~cC10(iV21081)),inference(csr,[status(thm)],[164,163])).
% cnf(169,plain,($false),inference(sr,[status(thm)],[138,165,theory(equality)])).
% cnf(170,plain,($false),169,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 86
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 86
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 31
% # ...of the previous two non-trivial : 19
% # Contextual simplify-reflections : 3
% # Paramodulations : 31
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 22
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 51 leaves, 1.04+/-0.194 terms/leaf
% # Paramod-from index: 25 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 43 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.22 WC
% FINAL PrfWatch: 0.11 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP30342/KRS160+1.tptp
%
%------------------------------------------------------------------------------