TSTP Solution File: KRS172+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS172+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 : art09.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:12 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP1314/KRS172+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1314/KRS172+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1314/KRS172+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 1411
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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]:![X5]:![X6]:((rp(X1,X5)&rp(X1,X6))=>X5=X6),file('/tmp/SRASS.s.p', axiom_4)).
% fof(12, axiom,![X1]:![X5]:![X6]:((rq(X1,X5)&rq(X1,X6))=>X5=X6),file('/tmp/SRASS.s.p', axiom_6)).
% fof(13, axiom,![X1]:![X5]:(rp(X1,X5)=>cd(X1)),file('/tmp/SRASS.s.p', axiom_5)).
% fof(14, axiom,![X1]:![X5]:(rq(X1,X5)=>cd(X1)),file('/tmp/SRASS.s.p', axiom_7)).
% fof(17, axiom,![X1]:(cd(X1)<=>rq(X1,iv)),file('/tmp/SRASS.s.p', axiom_2)).
% fof(18, axiom,![X1]:(cd(X1)<=>rp(X1,iv)),file('/tmp/SRASS.s.p', axiom_3)).
% fof(19, conjecture,((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:![X5]:(rq(X1,X5)<=>rp(X1,X5))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(20, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:![X5]:(rq(X1,X5)<=>rp(X1,X5)))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(22, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(23, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:![X5]:(rq(X1,X5)<=>rp(X1,X5)))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(24, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[21])).
% cnf(25,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(27, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(28, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(55, plain,![X1]:![X5]:![X6]:((~(rp(X1,X5))|~(rp(X1,X6)))|X5=X6),inference(fof_nnf,[status(thm)],[11])).
% fof(56, plain,![X7]:![X8]:![X9]:((~(rp(X7,X8))|~(rp(X7,X9)))|X8=X9),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(X1=X2|~rp(X3,X2)|~rp(X3,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X1]:![X5]:![X6]:((~(rq(X1,X5))|~(rq(X1,X6)))|X5=X6),inference(fof_nnf,[status(thm)],[12])).
% fof(59, plain,![X7]:![X8]:![X9]:((~(rq(X7,X8))|~(rq(X7,X9)))|X8=X9),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(X1=X2|~rq(X3,X2)|~rq(X3,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X5]:(~(rp(X1,X5))|cd(X1)),inference(fof_nnf,[status(thm)],[13])).
% fof(62, plain,![X6]:![X7]:(~(rp(X6,X7))|cd(X6)),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(cd(X1)|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X1]:![X5]:(~(rq(X1,X5))|cd(X1)),inference(fof_nnf,[status(thm)],[14])).
% fof(65, plain,![X6]:![X7]:(~(rq(X6,X7))|cd(X6)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(cd(X1)|~rq(X1,X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(71, plain,![X1]:((~(cd(X1))|rq(X1,iv))&(~(rq(X1,iv))|cd(X1))),inference(fof_nnf,[status(thm)],[17])).
% fof(72, plain,![X2]:((~(cd(X2))|rq(X2,iv))&(~(rq(X2,iv))|cd(X2))),inference(variable_rename,[status(thm)],[71])).
% cnf(74,plain,(rq(X1,iv)|~cd(X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(75, plain,![X1]:((~(cd(X1))|rp(X1,iv))&(~(rp(X1,iv))|cd(X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(76, plain,![X2]:((~(cd(X2))|rp(X2,iv))&(~(rp(X2,iv))|cd(X2))),inference(variable_rename,[status(thm)],[75])).
% cnf(78,plain,(rp(X1,iv)|~cd(X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(79, negated_conjecture,((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:?[X5]:((~(rq(X1,X5))|~(rp(X1,X5)))&(rq(X1,X5)|rp(X1,X5)))),inference(fof_nnf,[status(thm)],[23])).
% fof(80, negated_conjecture,((?[X6]:(~(cowlThing(X6))|cowlNothing(X6))|?[X7]:((~(xsd_string(X7))|xsd_integer(X7))&(xsd_string(X7)|~(xsd_integer(X7)))))|?[X8]:?[X9]:((~(rq(X8,X9))|~(rp(X8,X9)))&(rq(X8,X9)|rp(X8,X9)))),inference(variable_rename,[status(thm)],[79])).
% fof(81, negated_conjecture,(((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|((~(rq(esk3_0,esk4_0))|~(rp(esk3_0,esk4_0)))&(rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0)))),inference(skolemize,[status(esa)],[80])).
% fof(82, negated_conjecture,((((~(rq(esk3_0,esk4_0))|~(rp(esk3_0,esk4_0)))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))&((rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&(((~(rq(esk3_0,esk4_0))|~(rp(esk3_0,esk4_0)))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))&((rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))),inference(distribute,[status(thm)],[81])).
% cnf(83,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|rp(esk3_0,esk4_0)|rq(esk3_0,esk4_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~rp(esk3_0,esk4_0)|~rq(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|rp(esk3_0,esk4_0)|rq(esk3_0,esk4_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(86,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~rp(esk3_0,esk4_0)|~rq(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(88,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|rp(esk3_0,esk4_0)|rq(esk3_0,esk4_0)|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[83,26,theory(equality)]),['unfolding']).
% cnf(89,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|rp(esk3_0,esk4_0)|rq(esk3_0,esk4_0)|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[85,26,theory(equality)]),['unfolding']).
% cnf(90,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|~xsd_integer(esk2_0)|~rp(esk3_0,esk4_0)|~rq(esk3_0,esk4_0)),inference(rw,[status(thm)],[84,26,theory(equality)]),['unfolding']).
% cnf(91,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|~xsd_string(esk2_0)|~rp(esk3_0,esk4_0)|~rq(esk3_0,esk4_0)),inference(rw,[status(thm)],[86,26,theory(equality)]),['unfolding']).
% cnf(92,negated_conjecture,(xsd_string(esk2_0)|rp(esk3_0,esk4_0)|rq(esk3_0,esk4_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[88,25,theory(equality)])).
% cnf(93,negated_conjecture,(rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0)|xsd_string(esk2_0)),inference(csr,[status(thm)],[92,29])).
% cnf(94,negated_conjecture,(xsd_integer(esk2_0)|rp(esk3_0,esk4_0)|rq(esk3_0,esk4_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[89,25,theory(equality)])).
% cnf(95,negated_conjecture,(rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0)|xsd_integer(esk2_0)),inference(csr,[status(thm)],[94,29])).
% cnf(96,negated_conjecture,(xsd_string(esk2_0)|~xsd_integer(esk2_0)|~rp(esk3_0,esk4_0)|~rq(esk3_0,esk4_0)),inference(sr,[status(thm)],[90,25,theory(equality)])).
% cnf(97,negated_conjecture,(xsd_string(esk2_0)|~rq(esk3_0,esk4_0)|~rp(esk3_0,esk4_0)),inference(csr,[status(thm)],[96,29])).
% cnf(98,negated_conjecture,(xsd_integer(esk2_0)|~xsd_string(esk2_0)|~rp(esk3_0,esk4_0)|~rq(esk3_0,esk4_0)),inference(sr,[status(thm)],[91,25,theory(equality)])).
% cnf(99,negated_conjecture,(xsd_integer(esk2_0)|~rq(esk3_0,esk4_0)|~rp(esk3_0,esk4_0)),inference(csr,[status(thm)],[98,97])).
% cnf(101,negated_conjecture,(rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0)|~xsd_integer(esk2_0)),inference(spm,[status(thm)],[30,93,theory(equality)])).
% cnf(102,negated_conjecture,(~xsd_integer(esk2_0)|~rq(esk3_0,esk4_0)|~rp(esk3_0,esk4_0)),inference(spm,[status(thm)],[30,97,theory(equality)])).
% cnf(103,negated_conjecture,(rq(esk3_0,esk4_0)|rp(esk3_0,esk4_0)),inference(csr,[status(thm)],[101,95])).
% cnf(104,negated_conjecture,(cd(esk3_0)|rp(esk3_0,esk4_0)),inference(spm,[status(thm)],[66,103,theory(equality)])).
% cnf(106,negated_conjecture,(cd(esk3_0)),inference(csr,[status(thm)],[104,63])).
% cnf(107,negated_conjecture,(rq(esk3_0,iv)),inference(spm,[status(thm)],[74,106,theory(equality)])).
% cnf(108,negated_conjecture,(rp(esk3_0,iv)),inference(spm,[status(thm)],[78,106,theory(equality)])).
% cnf(110,negated_conjecture,(X1=iv|~rq(esk3_0,X1)),inference(spm,[status(thm)],[60,107,theory(equality)])).
% cnf(113,negated_conjecture,(X1=iv|~rp(esk3_0,X1)),inference(spm,[status(thm)],[57,108,theory(equality)])).
% cnf(115,negated_conjecture,(esk4_0=iv|rp(esk3_0,esk4_0)),inference(spm,[status(thm)],[110,103,theory(equality)])).
% cnf(119,negated_conjecture,(esk4_0=iv),inference(spm,[status(thm)],[113,115,theory(equality)])).
% cnf(120,negated_conjecture,(~rq(esk3_0,esk4_0)|~rp(esk3_0,esk4_0)),inference(csr,[status(thm)],[102,99])).
% cnf(124,negated_conjecture,($false|~rp(esk3_0,esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[120,119,theory(equality)]),107,theory(equality)])).
% cnf(125,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[124,119,theory(equality)]),108,theory(equality)])).
% cnf(126,negated_conjecture,($false),inference(cn,[status(thm)],[125,theory(equality)])).
% cnf(127,negated_conjecture,($false),126,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 37
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 35
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 3
% # Generated clauses : 16
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 7
% # Paramodulations : 16
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 13
% # 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: 17 leaves, 1.24+/-0.644 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.15+/-0.361 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.005 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP1314/KRS172+1.tptp
%
%------------------------------------------------------------------------------