%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS175+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 : art04.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:40: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/SystemOnTPTP12083/KRS175+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12083/KRS175+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12083/KRS175+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 12179
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X3]:(cowlThing(X3)&~(cowlNothing(X3))),file('/tmp/SRASS.s.p', axiom_0)).
% fof(7, axiom,![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))),file('/tmp/SRASS.s.p', axiom_1)).
% fof(10, axiom,![X3]:(cA(X3)<=>X3=ia),file('/tmp/SRASS.s.p', axiom_2)).
% fof(11, axiom,![X3]:(cB(X3)<=>X3=ib),file('/tmp/SRASS.s.p', axiom_4)).
% fof(14, axiom,![X3]:(cA_and_B(X3)<=>(cA(X3)|cB(X3))),file('/tmp/SRASS.s.p', axiom_3)).
% fof(15, conjecture,((((![X3]:(cowlThing(X3)&~(cowlNothing(X3)))&![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))))&![X3]:(cA_and_B(X3)<=>(X3=ib|X3=ia)))&cowlThing(ia))&cowlThing(ib)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(16, negated_conjecture,~(((((![X3]:(cowlThing(X3)&~(cowlNothing(X3)))&![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))))&![X3]:(cA_and_B(X3)<=>(X3=ib|X3=ia)))&cowlThing(ia))&cowlThing(ib))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X3]:(cowlThing(X3)&~(cowlNothing(X3))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(18, plain,![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(19, negated_conjecture,~(((((![X3]:(cowlThing(X3)&~(cowlNothing(X3)))&![X3]:(xsd_string(X3)<=>~(xsd_integer(X3))))&![X3]:(cA_and_B(X3)<=>(X3=ib|X3=ia)))&cowlThing(ia))&cowlThing(ib))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(35, plain,![X4]:(cowlThing(X4)&~(cowlNothing(X4))),inference(variable_rename,[status(thm)],[17])).
% cnf(36,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(38, plain,![X3]:((~(xsd_string(X3))|~(xsd_integer(X3)))&(xsd_integer(X3)|xsd_string(X3))),inference(fof_nnf,[status(thm)],[18])).
% fof(39, plain,![X4]:((~(xsd_string(X4))|~(xsd_integer(X4)))&(xsd_integer(X4)|xsd_string(X4))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(44, plain,![X3]:((~(cA(X3))|X3=ia)&(~(X3=ia)|cA(X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X4]:((~(cA(X4))|X4=ia)&(~(X4=ia)|cA(X4))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(cA(X1)|X1!=ia),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(X1=ia|~cA(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(48, plain,![X3]:((~(cB(X3))|X3=ib)&(~(X3=ib)|cB(X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(49, plain,![X4]:((~(cB(X4))|X4=ib)&(~(X4=ib)|cB(X4))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(cB(X1)|X1!=ib),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(X1=ib|~cB(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(58, plain,![X3]:((~(cA_and_B(X3))|(cA(X3)|cB(X3)))&((~(cA(X3))&~(cB(X3)))|cA_and_B(X3))),inference(fof_nnf,[status(thm)],[14])).
% fof(59, plain,![X4]:((~(cA_and_B(X4))|(cA(X4)|cB(X4)))&((~(cA(X4))&~(cB(X4)))|cA_and_B(X4))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X4]:((~(cA_and_B(X4))|(cA(X4)|cB(X4)))&((~(cA(X4))|cA_and_B(X4))&(~(cB(X4))|cA_and_B(X4)))),inference(distribute,[status(thm)],[59])).
% cnf(61,plain,(cA_and_B(X1)|~cB(X1)),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(cA_and_B(X1)|~cA(X1)),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,plain,(cB(X1)|cA(X1)|~cA_and_B(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(64, negated_conjecture,((((?[X3]:(~(cowlThing(X3))|cowlNothing(X3))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|?[X3]:((~(cA_and_B(X3))|(~(X3=ib)&~(X3=ia)))&(cA_and_B(X3)|(X3=ib|X3=ia))))|~(cowlThing(ia)))|~(cowlThing(ib))),inference(fof_nnf,[status(thm)],[19])).
% fof(65, negated_conjecture,((((?[X4]:(~(cowlThing(X4))|cowlNothing(X4))|?[X5]:((~(xsd_string(X5))|xsd_integer(X5))&(xsd_string(X5)|~(xsd_integer(X5)))))|?[X6]:((~(cA_and_B(X6))|(~(X6=ib)&~(X6=ia)))&(cA_and_B(X6)|(X6=ib|X6=ia))))|~(cowlThing(ia)))|~(cowlThing(ib))),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,(((((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|((~(cA_and_B(esk3_0))|(~(esk3_0=ib)&~(esk3_0=ia)))&(cA_and_B(esk3_0)|(esk3_0=ib|esk3_0=ia))))|~(cowlThing(ia)))|~(cowlThing(ib))),inference(skolemize,[status(esa)],[65])).
% fof(67, negated_conjecture,(((((((~(esk3_0=ib)|~(cA_and_B(esk3_0)))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|~(cowlThing(ia)))|~(cowlThing(ib)))&((((~(esk3_0=ia)|~(cA_and_B(esk3_0)))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|~(cowlThing(ia)))|~(cowlThing(ib))))&((((cA_and_B(esk3_0)|(esk3_0=ib|esk3_0=ia))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|~(cowlThing(ia)))|~(cowlThing(ib))))&((((((~(esk3_0=ib)|~(cA_and_B(esk3_0)))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|~(cowlThing(ia)))|~(cowlThing(ib)))&((((~(esk3_0=ia)|~(cA_and_B(esk3_0)))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|~(cowlThing(ia)))|~(cowlThing(ib))))&((((cA_and_B(esk3_0)|(esk3_0=ib|esk3_0=ia))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|~(cowlThing(ia)))|~(cowlThing(ib))))),inference(distribute,[status(thm)],[66])).
% cnf(68,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|esk3_0=ia|esk3_0=ib|cA_and_B(esk3_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|esk3_0!=ia),inference(split_conjunct,[status(thm)],[67])).
% cnf(70,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|esk3_0!=ib),inference(split_conjunct,[status(thm)],[67])).
% cnf(71,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|esk3_0=ia|esk3_0=ib|cA_and_B(esk3_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(72,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|esk3_0!=ia),inference(split_conjunct,[status(thm)],[67])).
% cnf(73,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(ib)|~cowlThing(ia)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|esk3_0!=ib),inference(split_conjunct,[status(thm)],[67])).
% cnf(76,negated_conjecture,(esk3_0=ia|esk3_0=ib|cA_and_B(esk3_0)|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)],[71,37,theory(equality)]),37,theory(equality)]),37,theory(equality)]),['unfolding']).
% cnf(77,negated_conjecture,(esk3_0=ia|esk3_0=ib|cA_and_B(esk3_0)|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)],[68,37,theory(equality)]),37,theory(equality)]),37,theory(equality)]),['unfolding']).
% cnf(78,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|esk3_0!=ia|~cA_and_B(esk3_0)|$false|$false|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[72,37,theory(equality)]),37,theory(equality)]),37,theory(equality)]),['unfolding']).
% cnf(79,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|esk3_0!=ib|~cA_and_B(esk3_0)|$false|$false|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[73,37,theory(equality)]),37,theory(equality)]),37,theory(equality)]),['unfolding']).
% cnf(80,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|esk3_0!=ia|~cA_and_B(esk3_0)|$false|$false|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[69,37,theory(equality)]),37,theory(equality)]),37,theory(equality)]),['unfolding']).
% cnf(81,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|esk3_0!=ib|~cA_and_B(esk3_0)|$false|$false|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[70,37,theory(equality)]),37,theory(equality)]),37,theory(equality)]),['unfolding']).
% cnf(82,negated_conjecture,(xsd_integer(esk2_0)|ia!=esk3_0|~cA_and_B(esk3_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[78,36,theory(equality)])).
% cnf(83,negated_conjecture,(xsd_integer(esk2_0)|ia!=esk3_0|~cA_and_B(esk3_0)),inference(csr,[status(thm)],[82,40])).
% cnf(84,negated_conjecture,(xsd_integer(esk2_0)|ib!=esk3_0|~cA_and_B(esk3_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[79,36,theory(equality)])).
% cnf(85,negated_conjecture,(xsd_integer(esk2_0)|ib!=esk3_0|~cA_and_B(esk3_0)),inference(csr,[status(thm)],[84,40])).
% cnf(86,negated_conjecture,(xsd_string(esk2_0)|ia!=esk3_0|~cA_and_B(esk3_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[80,36,theory(equality)])).
% cnf(87,negated_conjecture,(xsd_string(esk2_0)|ia!=esk3_0|~cA_and_B(esk3_0)),inference(csr,[status(thm)],[86,40])).
% cnf(88,negated_conjecture,(xsd_string(esk2_0)|ib!=esk3_0|~cA_and_B(esk3_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[81,36,theory(equality)])).
% cnf(89,negated_conjecture,(xsd_string(esk2_0)|ib!=esk3_0|~cA_and_B(esk3_0)),inference(csr,[status(thm)],[88,40])).
% cnf(90,negated_conjecture,(ia=esk3_0|ib=esk3_0|cA_and_B(esk3_0)|xsd_integer(esk2_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[76,36,theory(equality)])).
% cnf(91,negated_conjecture,(ia=esk3_0|ib=esk3_0|xsd_integer(esk2_0)|cA_and_B(esk3_0)),inference(csr,[status(thm)],[90,40])).
% cnf(92,negated_conjecture,(ia=esk3_0|ib=esk3_0|cA_and_B(esk3_0)|xsd_string(esk2_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[77,36,theory(equality)])).
% cnf(93,negated_conjecture,(ia=esk3_0|ib=esk3_0|xsd_string(esk2_0)|cA_and_B(esk3_0)),inference(csr,[status(thm)],[92,40])).
% cnf(95,negated_conjecture,(~xsd_string(esk2_0)|ia!=esk3_0|~cA_and_B(esk3_0)),inference(spm,[status(thm)],[41,83,theory(equality)])).
% cnf(97,negated_conjecture,(ia=esk3_0|ib=esk3_0|cA_and_B(esk3_0)|~xsd_string(esk2_0)),inference(spm,[status(thm)],[41,91,theory(equality)])).
% cnf(98,plain,(cA_and_B(X1)|ia!=X1),inference(spm,[status(thm)],[62,46,theory(equality)])).
% cnf(101,plain,(cA_and_B(X1)|ib!=X1),inference(spm,[status(thm)],[61,50,theory(equality)])).
% cnf(103,plain,(ib=X1|cA(X1)|~cA_and_B(X1)),inference(spm,[status(thm)],[51,63,theory(equality)])).
% cnf(104,negated_conjecture,(ia=esk3_0|ib=esk3_0|cA_and_B(esk3_0)),inference(csr,[status(thm)],[97,93])).
% cnf(105,negated_conjecture,(ia!=esk3_0|~xsd_string(esk2_0)),inference(csr,[status(thm)],[95,98])).
% cnf(106,negated_conjecture,(ia!=esk3_0|~cA_and_B(esk3_0)),inference(spm,[status(thm)],[105,87,theory(equality)])).
% cnf(108,negated_conjecture,(ia!=esk3_0),inference(csr,[status(thm)],[106,98])).
% cnf(109,negated_conjecture,(ib=esk3_0|cA_and_B(esk3_0)),inference(sr,[status(thm)],[104,108,theory(equality)])).
% cnf(110,negated_conjecture,(cA_and_B(esk3_0)),inference(csr,[status(thm)],[109,101])).
% cnf(111,negated_conjecture,(xsd_string(esk2_0)|ib!=esk3_0|$false),inference(rw,[status(thm)],[89,110,theory(equality)])).
% cnf(112,negated_conjecture,(xsd_string(esk2_0)|ib!=esk3_0),inference(cn,[status(thm)],[111,theory(equality)])).
% cnf(115,negated_conjecture,(xsd_integer(esk2_0)|ib!=esk3_0|$false),inference(rw,[status(thm)],[85,110,theory(equality)])).
% cnf(116,negated_conjecture,(xsd_integer(esk2_0)|ib!=esk3_0),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(121,negated_conjecture,(~xsd_string(esk2_0)|ib!=esk3_0),inference(spm,[status(thm)],[41,116,theory(equality)])).
% cnf(122,negated_conjecture,(ib!=esk3_0),inference(csr,[status(thm)],[121,112])).
% cnf(124,plain,(ia=X1|ib=X1|~cA_and_B(X1)),inference(spm,[status(thm)],[47,103,theory(equality)])).
% cnf(125,negated_conjecture,(ib=esk3_0|ia=esk3_0),inference(spm,[status(thm)],[124,110,theory(equality)])).
% cnf(128,negated_conjecture,(ia=esk3_0),inference(sr,[status(thm)],[125,122,theory(equality)])).
% cnf(129,negated_conjecture,($false),inference(sr,[status(thm)],[128,108,theory(equality)])).
% cnf(130,negated_conjecture,($false),129,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 43
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 4
% # Generated clauses : 20
% # ...of the previous two non-trivial : 16
% # Contextual simplify-reflections : 12
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 14
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 12 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.005 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP12083/KRS175+1.tptp
%
%------------------------------------------------------------------------------