TSTP Solution File: KRS167+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS167+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 : art06.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:42 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP18352/KRS167+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18352/KRS167+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18352/KRS167+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 18448
% 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(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(11, axiom,![X1]:(cc1(X1)<=>(?[X5]:rp(X1,X5)&![X5]:![X6]:((rp(X1,X5)&rp(X1,X6))=>X5=X6))),file('/tmp/SRASS.s.p', axiom_2)).
% fof(12, axiom,![X1]:(cc2(X1)<=>(?[X5]:rp(X1,X5)&![X5]:![X6]:((rp(X1,X5)&rp(X1,X6))=>X5=X6))),file('/tmp/SRASS.s.p', axiom_3)).
% fof(13, conjecture,((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cc1(X1)<=>cc2(X1))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(14, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cc1(X1)<=>cc2(X1)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(17, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cc1(X1)<=>cc2(X1)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(18, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[15])).
% cnf(19,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[16])).
% fof(22, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(49, plain,![X1]:((~(cc1(X1))|(?[X5]:rp(X1,X5)&![X5]:![X6]:((~(rp(X1,X5))|~(rp(X1,X6)))|X5=X6)))&((![X5]:~(rp(X1,X5))|?[X5]:?[X6]:((rp(X1,X5)&rp(X1,X6))&~(X5=X6)))|cc1(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(50, plain,![X7]:((~(cc1(X7))|(?[X8]:rp(X7,X8)&![X9]:![X10]:((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)))&((![X11]:~(rp(X7,X11))|?[X12]:?[X13]:((rp(X7,X12)&rp(X7,X13))&~(X12=X13)))|cc1(X7))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X7]:((~(cc1(X7))|(rp(X7,esk1_1(X7))&![X9]:![X10]:((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)))&((![X11]:~(rp(X7,X11))|((rp(X7,esk2_1(X7))&rp(X7,esk3_1(X7)))&~(esk2_1(X7)=esk3_1(X7))))|cc1(X7))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X7]:![X9]:![X10]:![X11]:(((~(rp(X7,X11))|((rp(X7,esk2_1(X7))&rp(X7,esk3_1(X7)))&~(esk2_1(X7)=esk3_1(X7))))|cc1(X7))&((((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)&rp(X7,esk1_1(X7)))|~(cc1(X7)))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X7]:![X9]:![X10]:![X11]:(((((rp(X7,esk2_1(X7))|~(rp(X7,X11)))|cc1(X7))&((rp(X7,esk3_1(X7))|~(rp(X7,X11)))|cc1(X7)))&((~(esk2_1(X7)=esk3_1(X7))|~(rp(X7,X11)))|cc1(X7)))&((((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)|~(cc1(X7)))&(rp(X7,esk1_1(X7))|~(cc1(X7))))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(rp(X1,esk1_1(X1))|~cc1(X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(X2=X3|~cc1(X1)|~rp(X1,X3)|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(cc1(X1)|~rp(X1,X2)|esk2_1(X1)!=esk3_1(X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(57,plain,(cc1(X1)|rp(X1,esk3_1(X1))|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(58,plain,(cc1(X1)|rp(X1,esk2_1(X1))|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[53])).
% fof(59, plain,![X1]:((~(cc2(X1))|(?[X5]:rp(X1,X5)&![X5]:![X6]:((~(rp(X1,X5))|~(rp(X1,X6)))|X5=X6)))&((![X5]:~(rp(X1,X5))|?[X5]:?[X6]:((rp(X1,X5)&rp(X1,X6))&~(X5=X6)))|cc2(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(60, plain,![X7]:((~(cc2(X7))|(?[X8]:rp(X7,X8)&![X9]:![X10]:((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)))&((![X11]:~(rp(X7,X11))|?[X12]:?[X13]:((rp(X7,X12)&rp(X7,X13))&~(X12=X13)))|cc2(X7))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X7]:((~(cc2(X7))|(rp(X7,esk4_1(X7))&![X9]:![X10]:((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)))&((![X11]:~(rp(X7,X11))|((rp(X7,esk5_1(X7))&rp(X7,esk6_1(X7)))&~(esk5_1(X7)=esk6_1(X7))))|cc2(X7))),inference(skolemize,[status(esa)],[60])).
% fof(62, plain,![X7]:![X9]:![X10]:![X11]:(((~(rp(X7,X11))|((rp(X7,esk5_1(X7))&rp(X7,esk6_1(X7)))&~(esk5_1(X7)=esk6_1(X7))))|cc2(X7))&((((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)&rp(X7,esk4_1(X7)))|~(cc2(X7)))),inference(shift_quantors,[status(thm)],[61])).
% fof(63, plain,![X7]:![X9]:![X10]:![X11]:(((((rp(X7,esk5_1(X7))|~(rp(X7,X11)))|cc2(X7))&((rp(X7,esk6_1(X7))|~(rp(X7,X11)))|cc2(X7)))&((~(esk5_1(X7)=esk6_1(X7))|~(rp(X7,X11)))|cc2(X7)))&((((~(rp(X7,X9))|~(rp(X7,X10)))|X9=X10)|~(cc2(X7)))&(rp(X7,esk4_1(X7))|~(cc2(X7))))),inference(distribute,[status(thm)],[62])).
% cnf(64,plain,(rp(X1,esk4_1(X1))|~cc2(X1)),inference(split_conjunct,[status(thm)],[63])).
% cnf(65,plain,(X2=X3|~cc2(X1)|~rp(X1,X3)|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[63])).
% cnf(66,plain,(cc2(X1)|~rp(X1,X2)|esk5_1(X1)!=esk6_1(X1)),inference(split_conjunct,[status(thm)],[63])).
% cnf(67,plain,(cc2(X1)|rp(X1,esk6_1(X1))|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[63])).
% cnf(68,plain,(cc2(X1)|rp(X1,esk5_1(X1))|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[63])).
% fof(69, negated_conjecture,((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:((~(cc1(X1))|~(cc2(X1)))&(cc1(X1)|cc2(X1)))),inference(fof_nnf,[status(thm)],[17])).
% fof(70, negated_conjecture,((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|?[X4]:((~(cc1(X4))|~(cc2(X4)))&(cc1(X4)|cc2(X4)))),inference(variable_rename,[status(thm)],[69])).
% fof(71, negated_conjecture,(((~(cowlThing(esk7_0))|cowlNothing(esk7_0))|((~(xsd_string(esk8_0))|xsd_integer(esk8_0))&(xsd_string(esk8_0)|~(xsd_integer(esk8_0)))))|((~(cc1(esk9_0))|~(cc2(esk9_0)))&(cc1(esk9_0)|cc2(esk9_0)))),inference(skolemize,[status(esa)],[70])).
% fof(72, negated_conjecture,((((~(cc1(esk9_0))|~(cc2(esk9_0)))|((~(xsd_string(esk8_0))|xsd_integer(esk8_0))|(~(cowlThing(esk7_0))|cowlNothing(esk7_0))))&((cc1(esk9_0)|cc2(esk9_0))|((~(xsd_string(esk8_0))|xsd_integer(esk8_0))|(~(cowlThing(esk7_0))|cowlNothing(esk7_0)))))&(((~(cc1(esk9_0))|~(cc2(esk9_0)))|((xsd_string(esk8_0)|~(xsd_integer(esk8_0)))|(~(cowlThing(esk7_0))|cowlNothing(esk7_0))))&((cc1(esk9_0)|cc2(esk9_0))|((xsd_string(esk8_0)|~(xsd_integer(esk8_0)))|(~(cowlThing(esk7_0))|cowlNothing(esk7_0)))))),inference(distribute,[status(thm)],[71])).
% cnf(73,negated_conjecture,(cowlNothing(esk7_0)|xsd_string(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~cowlThing(esk7_0)|~xsd_integer(esk8_0)),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,negated_conjecture,(cowlNothing(esk7_0)|xsd_string(esk8_0)|~cowlThing(esk7_0)|~xsd_integer(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0)),inference(split_conjunct,[status(thm)],[72])).
% cnf(75,negated_conjecture,(cowlNothing(esk7_0)|xsd_integer(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~cowlThing(esk7_0)|~xsd_string(esk8_0)),inference(split_conjunct,[status(thm)],[72])).
% cnf(76,negated_conjecture,(cowlNothing(esk7_0)|xsd_integer(esk8_0)|~cowlThing(esk7_0)|~xsd_string(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0)),inference(split_conjunct,[status(thm)],[72])).
% cnf(77,negated_conjecture,(cowlNothing(esk7_0)|xsd_string(esk8_0)|cc1(esk9_0)|cc2(esk9_0)|$false|~xsd_integer(esk8_0)),inference(rw,[status(thm)],[73,20,theory(equality)]),['unfolding']).
% cnf(78,negated_conjecture,(cowlNothing(esk7_0)|xsd_integer(esk8_0)|cc1(esk9_0)|cc2(esk9_0)|$false|~xsd_string(esk8_0)),inference(rw,[status(thm)],[75,20,theory(equality)]),['unfolding']).
% cnf(79,negated_conjecture,(cowlNothing(esk7_0)|xsd_string(esk8_0)|$false|~xsd_integer(esk8_0)|~cc1(esk9_0)|~cc2(esk9_0)),inference(rw,[status(thm)],[74,20,theory(equality)]),['unfolding']).
% cnf(80,negated_conjecture,(cowlNothing(esk7_0)|xsd_integer(esk8_0)|$false|~xsd_string(esk8_0)|~cc1(esk9_0)|~cc2(esk9_0)),inference(rw,[status(thm)],[76,20,theory(equality)]),['unfolding']).
% cnf(81,negated_conjecture,(xsd_string(esk8_0)|cc1(esk9_0)|cc2(esk9_0)|~xsd_integer(esk8_0)),inference(sr,[status(thm)],[77,19,theory(equality)])).
% cnf(82,negated_conjecture,(cc2(esk9_0)|cc1(esk9_0)|xsd_string(esk8_0)),inference(csr,[status(thm)],[81,23])).
% cnf(83,negated_conjecture,(xsd_integer(esk8_0)|cc1(esk9_0)|cc2(esk9_0)|~xsd_string(esk8_0)),inference(sr,[status(thm)],[78,19,theory(equality)])).
% cnf(84,negated_conjecture,(cc2(esk9_0)|cc1(esk9_0)|xsd_integer(esk8_0)),inference(csr,[status(thm)],[83,82])).
% cnf(85,negated_conjecture,(xsd_string(esk8_0)|~xsd_integer(esk8_0)|~cc1(esk9_0)|~cc2(esk9_0)),inference(sr,[status(thm)],[79,19,theory(equality)])).
% cnf(86,negated_conjecture,(xsd_string(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0)),inference(csr,[status(thm)],[85,23])).
% cnf(87,negated_conjecture,(xsd_integer(esk8_0)|~xsd_string(esk8_0)|~cc1(esk9_0)|~cc2(esk9_0)),inference(sr,[status(thm)],[80,19,theory(equality)])).
% cnf(88,negated_conjecture,(xsd_integer(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0)),inference(csr,[status(thm)],[87,86])).
% cnf(90,negated_conjecture,(cc2(esk9_0)|cc1(esk9_0)|~xsd_integer(esk8_0)),inference(spm,[status(thm)],[24,82,theory(equality)])).
% cnf(91,plain,(rp(X1,esk2_1(X1))|cc1(X1)|~cc2(X1)),inference(spm,[status(thm)],[58,64,theory(equality)])).
% cnf(93,plain,(rp(X1,esk3_1(X1))|cc1(X1)|~cc2(X1)),inference(spm,[status(thm)],[57,64,theory(equality)])).
% cnf(96,plain,(rp(X1,esk5_1(X1))|cc2(X1)|~cc1(X1)),inference(spm,[status(thm)],[68,54,theory(equality)])).
% cnf(98,plain,(rp(X1,esk6_1(X1))|cc2(X1)|~cc1(X1)),inference(spm,[status(thm)],[67,54,theory(equality)])).
% cnf(100,plain,(X1=esk1_1(X2)|~rp(X2,X1)|~cc1(X2)),inference(spm,[status(thm)],[55,54,theory(equality)])).
% cnf(101,plain,(X1=esk4_1(X2)|~rp(X2,X1)|~cc2(X2)),inference(spm,[status(thm)],[65,64,theory(equality)])).
% cnf(103,negated_conjecture,(cc2(esk9_0)|cc1(esk9_0)),inference(csr,[status(thm)],[90,84])).
% cnf(137,plain,(esk6_1(X1)=esk1_1(X1)|cc2(X1)|~cc1(X1)),inference(spm,[status(thm)],[100,98,theory(equality)])).
% cnf(138,plain,(esk5_1(X1)=esk1_1(X1)|cc2(X1)|~cc1(X1)),inference(spm,[status(thm)],[100,96,theory(equality)])).
% cnf(145,plain,(esk3_1(X1)=esk4_1(X1)|cc1(X1)|~cc2(X1)),inference(spm,[status(thm)],[101,93,theory(equality)])).
% cnf(146,plain,(esk2_1(X1)=esk4_1(X1)|cc1(X1)|~cc2(X1)),inference(spm,[status(thm)],[101,91,theory(equality)])).
% cnf(149,plain,(esk5_1(X1)=esk6_1(X1)|cc2(X1)|~cc1(X1)),inference(spm,[status(thm)],[137,138,theory(equality)])).
% cnf(153,plain,(esk2_1(X1)=esk3_1(X1)|cc1(X1)|~cc2(X1)),inference(spm,[status(thm)],[145,146,theory(equality)])).
% cnf(155,plain,(cc2(X1)|~rp(X1,X2)|~cc1(X1)),inference(spm,[status(thm)],[66,149,theory(equality)])).
% cnf(157,plain,(cc2(X1)|~cc1(X1)),inference(spm,[status(thm)],[155,98,theory(equality)])).
% cnf(163,negated_conjecture,(xsd_integer(esk8_0)|~cc1(esk9_0)),inference(spm,[status(thm)],[88,157,theory(equality)])).
% cnf(164,negated_conjecture,(xsd_string(esk8_0)|~cc1(esk9_0)),inference(spm,[status(thm)],[86,157,theory(equality)])).
% cnf(166,plain,(cc1(X1)|~rp(X1,X2)|~cc2(X1)),inference(spm,[status(thm)],[56,153,theory(equality)])).
% cnf(168,plain,(cc1(X1)|~cc2(X1)),inference(spm,[status(thm)],[166,64,theory(equality)])).
% cnf(172,negated_conjecture,(cc1(esk9_0)),inference(spm,[status(thm)],[168,103,theory(equality)])).
% cnf(174,negated_conjecture,(xsd_integer(esk8_0)|$false),inference(rw,[status(thm)],[163,172,theory(equality)])).
% cnf(175,negated_conjecture,(xsd_integer(esk8_0)),inference(cn,[status(thm)],[174,theory(equality)])).
% cnf(176,negated_conjecture,(xsd_string(esk8_0)|$false),inference(rw,[status(thm)],[164,172,theory(equality)])).
% cnf(177,negated_conjecture,(xsd_string(esk8_0)),inference(cn,[status(thm)],[176,theory(equality)])).
% cnf(179,negated_conjecture,(~xsd_integer(esk8_0)),inference(spm,[status(thm)],[24,177,theory(equality)])).
% cnf(180,negated_conjecture,($false),inference(rw,[status(thm)],[179,175,theory(equality)])).
% cnf(181,negated_conjecture,($false),inference(cn,[status(thm)],[180,theory(equality)])).
% cnf(182,negated_conjecture,($false),181,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 71
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 58
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 17
% # Backward-rewritten : 3
% # Generated clauses : 83
% # ...of the previous two non-trivial : 50
% # Contextual simplify-reflections : 7
% # Paramodulations : 83
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 41
% # Rec. Clause-clause subsumption calls : 41
% # 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: 24 leaves, 1.38+/-0.807 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 15 leaves, 1.13+/-0.499 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.002 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.18 WC
% FINAL PrfWatch: 0.08 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18352/KRS167+1.tptp
%
%------------------------------------------------------------------------------