TSTP Solution File: KRS129+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KRS129+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:35:50 EST 2010

% Result   : Theorem 1.09s
% Output   : Solution 1.09s
% 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/SystemOnTPTP29553/KRS129+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP29553/KRS129+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29553/KRS129+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 29649
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(3, axiom,![X1]:(cEuroMP(X1)<=>?[X2]:(risEuroMPFrom(X1,X2)&cowlThing(X2))),file('/tmp/SRASS.s.p', axiom_3)).
% fof(10, axiom,rhasEuroMP(iUK,iKinnock),file('/tmp/SRASS.s.p', axiom_13)).
% fof(15, axiom,![X1]:![X2]:(risEuroMPFrom(X1,X2)<=>rhasEuroMP(X2,X1)),file('/tmp/SRASS.s.p', axiom_5)).
% fof(27, conjecture,((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cEuroMP(iKinnock)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(28, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cEuroMP(iKinnock))),inference(assume_negation,[status(cth)],[27])).
% fof(29, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(30, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(31, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cEuroMP(iKinnock))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(32, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[29])).
% cnf(33,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(35, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[30])).
% fof(36, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(39, plain,![X1]:((~(cEuroMP(X1))|?[X2]:(risEuroMPFrom(X1,X2)&cowlThing(X2)))&(![X2]:(~(risEuroMPFrom(X1,X2))|~(cowlThing(X2)))|cEuroMP(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(40, plain,![X3]:((~(cEuroMP(X3))|?[X4]:(risEuroMPFrom(X3,X4)&cowlThing(X4)))&(![X5]:(~(risEuroMPFrom(X3,X5))|~(cowlThing(X5)))|cEuroMP(X3))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X3]:((~(cEuroMP(X3))|(risEuroMPFrom(X3,esk1_1(X3))&cowlThing(esk1_1(X3))))&(![X5]:(~(risEuroMPFrom(X3,X5))|~(cowlThing(X5)))|cEuroMP(X3))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X3]:![X5]:(((~(risEuroMPFrom(X3,X5))|~(cowlThing(X5)))|cEuroMP(X3))&(~(cEuroMP(X3))|(risEuroMPFrom(X3,esk1_1(X3))&cowlThing(esk1_1(X3))))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X3]:![X5]:(((~(risEuroMPFrom(X3,X5))|~(cowlThing(X5)))|cEuroMP(X3))&((risEuroMPFrom(X3,esk1_1(X3))|~(cEuroMP(X3)))&(cowlThing(esk1_1(X3))|~(cEuroMP(X3))))),inference(distribute,[status(thm)],[42])).
% cnf(46,plain,(cEuroMP(X1)|~cowlThing(X2)|~risEuroMPFrom(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% cnf(63,plain,(rhasEuroMP(iUK,iKinnock)),inference(split_conjunct,[status(thm)],[10])).
% fof(74, plain,![X1]:![X2]:((~(risEuroMPFrom(X1,X2))|rhasEuroMP(X2,X1))&(~(rhasEuroMP(X2,X1))|risEuroMPFrom(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(75, plain,![X3]:![X4]:((~(risEuroMPFrom(X3,X4))|rhasEuroMP(X4,X3))&(~(rhasEuroMP(X4,X3))|risEuroMPFrom(X3,X4))),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(risEuroMPFrom(X1,X2)|~rhasEuroMP(X2,X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(108, negated_conjecture,((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cEuroMP(iKinnock))),inference(fof_nnf,[status(thm)],[31])).
% fof(109, negated_conjecture,((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cEuroMP(iKinnock))),inference(variable_rename,[status(thm)],[108])).
% fof(110, negated_conjecture,(((~(cowlThing(esk2_0))|cowlNothing(esk2_0))|((~(xsd_string(esk3_0))|xsd_integer(esk3_0))&(xsd_string(esk3_0)|~(xsd_integer(esk3_0)))))|~(cEuroMP(iKinnock))),inference(skolemize,[status(esa)],[109])).
% fof(111, negated_conjecture,((((~(xsd_string(esk3_0))|xsd_integer(esk3_0))|(~(cowlThing(esk2_0))|cowlNothing(esk2_0)))|~(cEuroMP(iKinnock)))&(((xsd_string(esk3_0)|~(xsd_integer(esk3_0)))|(~(cowlThing(esk2_0))|cowlNothing(esk2_0)))|~(cEuroMP(iKinnock)))),inference(distribute,[status(thm)],[110])).
% cnf(112,negated_conjecture,(cowlNothing(esk2_0)|xsd_string(esk3_0)|~cEuroMP(iKinnock)|~cowlThing(esk2_0)|~xsd_integer(esk3_0)),inference(split_conjunct,[status(thm)],[111])).
% cnf(113,negated_conjecture,(cowlNothing(esk2_0)|xsd_integer(esk3_0)|~cEuroMP(iKinnock)|~cowlThing(esk2_0)|~xsd_string(esk3_0)),inference(split_conjunct,[status(thm)],[111])).
% cnf(115,plain,(cEuroMP(X1)|$false|~risEuroMPFrom(X1,X2)),inference(rw,[status(thm)],[46,34,theory(equality)]),['unfolding']).
% cnf(116,negated_conjecture,(cowlNothing(esk2_0)|xsd_string(esk3_0)|$false|~xsd_integer(esk3_0)|~cEuroMP(iKinnock)),inference(rw,[status(thm)],[112,34,theory(equality)]),['unfolding']).
% cnf(117,negated_conjecture,(cowlNothing(esk2_0)|xsd_integer(esk3_0)|$false|~xsd_string(esk3_0)|~cEuroMP(iKinnock)),inference(rw,[status(thm)],[113,34,theory(equality)]),['unfolding']).
% cnf(118,negated_conjecture,(xsd_string(esk3_0)|~xsd_integer(esk3_0)|~cEuroMP(iKinnock)),inference(sr,[status(thm)],[116,33,theory(equality)])).
% cnf(119,negated_conjecture,(xsd_string(esk3_0)|~cEuroMP(iKinnock)),inference(csr,[status(thm)],[118,37])).
% cnf(120,negated_conjecture,(xsd_integer(esk3_0)|~xsd_string(esk3_0)|~cEuroMP(iKinnock)),inference(sr,[status(thm)],[117,33,theory(equality)])).
% cnf(121,negated_conjecture,(xsd_integer(esk3_0)|~cEuroMP(iKinnock)),inference(csr,[status(thm)],[120,37])).
% cnf(123,plain,(cEuroMP(X1)|~rhasEuroMP(X2,X1)),inference(spm,[status(thm)],[115,76,theory(equality)])).
% cnf(134,plain,(cEuroMP(iKinnock)),inference(spm,[status(thm)],[123,63,theory(equality)])).
% cnf(135,negated_conjecture,(xsd_integer(esk3_0)|$false),inference(rw,[status(thm)],[121,134,theory(equality)])).
% cnf(136,negated_conjecture,(xsd_integer(esk3_0)),inference(cn,[status(thm)],[135,theory(equality)])).
% cnf(137,negated_conjecture,(xsd_string(esk3_0)|$false),inference(rw,[status(thm)],[119,134,theory(equality)])).
% cnf(138,negated_conjecture,(xsd_string(esk3_0)),inference(cn,[status(thm)],[137,theory(equality)])).
% cnf(139,negated_conjecture,(~xsd_string(esk3_0)),inference(spm,[status(thm)],[38,136,theory(equality)])).
% cnf(140,negated_conjecture,($false),inference(rw,[status(thm)],[139,138,theory(equality)])).
% cnf(141,negated_conjecture,($false),inference(cn,[status(thm)],[140,theory(equality)])).
% cnf(142,negated_conjecture,($false),141,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 56
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 56
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 2
% # Generated clauses                  : 14
% # ...of the previous two non-trivial : 7
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 14
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 28
% #    Positive orientable unit clauses: 12
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 15
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # 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:    30 leaves,   1.07+/-0.249 terms/leaf
% # Paramod-from index:           16 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           27 leaves,   1.07+/-0.262 terms/leaf
% # -------------------------------------------------
% # User time              : 0.011 s
% # System time            : 0.006 s
% # Total time             : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP29553/KRS129+1.tptp
% 
%------------------------------------------------------------------------------