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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KRS165+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:39:30 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/SystemOnTPTP1053/KRS165+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP1053/KRS165+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1053/KRS165+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 1149
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% /home/graph/tptp/Systems/EP---1.2/eproof: line 221: wait: %%: no such job
% # Preprocessing time     : 0.009 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]:(cCar(X1)<=>cAutomobile(X1)),file('/tmp/SRASS.s.p', axiom_2)).
% fof(4, conjecture,(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cAutomobile(X1)=>cCar(X1)))&![X1]:(cCar(X1)=>cAutomobile(X1))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(5, negated_conjecture,~((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cAutomobile(X1)=>cCar(X1)))&![X1]:(cCar(X1)=>cAutomobile(X1)))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(7, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(8, negated_conjecture,~((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cAutomobile(X1)=>cCar(X1)))&![X1]:(cCar(X1)=>cAutomobile(X1)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(9, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[6])).
% cnf(10,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[9])).
% fof(12, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(13, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(16, plain,![X1]:((~(cCar(X1))|cAutomobile(X1))&(~(cAutomobile(X1))|cCar(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X2]:((~(cCar(X2))|cAutomobile(X2))&(~(cAutomobile(X2))|cCar(X2))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(cCar(X1)|~cAutomobile(X1)),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,plain,(cAutomobile(X1)|~cCar(X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(20, negated_conjecture,(((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:(cAutomobile(X1)&~(cCar(X1))))|?[X1]:(cCar(X1)&~(cAutomobile(X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(21, negated_conjecture,(((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|?[X4]:(cAutomobile(X4)&~(cCar(X4))))|?[X5]:(cCar(X5)&~(cAutomobile(X5)))),inference(variable_rename,[status(thm)],[20])).
% fof(22, negated_conjecture,((((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|(cAutomobile(esk3_0)&~(cCar(esk3_0))))|(cCar(esk4_0)&~(cAutomobile(esk4_0)))),inference(skolemize,[status(esa)],[21])).
% fof(23, negated_conjecture,((((cCar(esk4_0)|(cAutomobile(esk3_0)|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&(~(cAutomobile(esk4_0))|(cAutomobile(esk3_0)|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))))&((cCar(esk4_0)|(~(cCar(esk3_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&(~(cAutomobile(esk4_0))|(~(cCar(esk3_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))))&(((cCar(esk4_0)|(cAutomobile(esk3_0)|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&(~(cAutomobile(esk4_0))|(cAutomobile(esk3_0)|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))))&((cCar(esk4_0)|(~(cCar(esk3_0))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&(~(cAutomobile(esk4_0))|(~(cCar(esk3_0))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))))),inference(distribute,[status(thm)],[22])).
% cnf(24,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cCar(esk3_0)|~cAutomobile(esk4_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cCar(esk4_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cCar(esk3_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cAutomobile(esk3_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(27,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cAutomobile(esk3_0)|cCar(esk4_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(28,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cCar(esk3_0)|~cAutomobile(esk4_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(29,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cCar(esk4_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cCar(esk3_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(30,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cAutomobile(esk3_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cAutomobile(esk4_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(31,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cAutomobile(esk3_0)|cCar(esk4_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(32,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cCar(esk4_0)|cAutomobile(esk3_0)|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[27,11,theory(equality)]),['unfolding']).
% cnf(33,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cCar(esk4_0)|cAutomobile(esk3_0)|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[31,11,theory(equality)]),['unfolding']).
% cnf(34,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cCar(esk4_0)|$false|~xsd_integer(esk2_0)|~cCar(esk3_0)),inference(rw,[status(thm)],[25,11,theory(equality)]),['unfolding']).
% cnf(35,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cAutomobile(esk3_0)|$false|~xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(rw,[status(thm)],[26,11,theory(equality)]),['unfolding']).
% cnf(36,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cCar(esk4_0)|$false|~xsd_string(esk2_0)|~cCar(esk3_0)),inference(rw,[status(thm)],[29,11,theory(equality)]),['unfolding']).
% cnf(37,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cAutomobile(esk3_0)|$false|~xsd_string(esk2_0)|~cAutomobile(esk4_0)),inference(rw,[status(thm)],[30,11,theory(equality)]),['unfolding']).
% cnf(38,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|~xsd_integer(esk2_0)|~cCar(esk3_0)|~cAutomobile(esk4_0)),inference(rw,[status(thm)],[24,11,theory(equality)]),['unfolding']).
% cnf(39,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|~xsd_string(esk2_0)|~cCar(esk3_0)|~cAutomobile(esk4_0)),inference(rw,[status(thm)],[28,11,theory(equality)]),['unfolding']).
% cnf(40,negated_conjecture,(xsd_string(esk2_0)|cCar(esk4_0)|cAutomobile(esk3_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[32,10,theory(equality)])).
% cnf(41,negated_conjecture,(cAutomobile(esk3_0)|cCar(esk4_0)|xsd_string(esk2_0)),inference(csr,[status(thm)],[40,14])).
% cnf(42,negated_conjecture,(xsd_integer(esk2_0)|cCar(esk4_0)|cAutomobile(esk3_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[33,10,theory(equality)])).
% cnf(43,negated_conjecture,(cAutomobile(esk3_0)|cCar(esk4_0)|xsd_integer(esk2_0)),inference(csr,[status(thm)],[42,14])).
% cnf(44,negated_conjecture,(xsd_string(esk2_0)|cCar(esk4_0)|~xsd_integer(esk2_0)|~cCar(esk3_0)),inference(sr,[status(thm)],[34,10,theory(equality)])).
% cnf(45,negated_conjecture,(cCar(esk4_0)|xsd_string(esk2_0)|~cCar(esk3_0)),inference(csr,[status(thm)],[44,14])).
% cnf(46,negated_conjecture,(xsd_string(esk2_0)|cAutomobile(esk3_0)|~xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(sr,[status(thm)],[35,10,theory(equality)])).
% cnf(47,negated_conjecture,(cAutomobile(esk3_0)|xsd_string(esk2_0)|~cAutomobile(esk4_0)),inference(csr,[status(thm)],[46,14])).
% cnf(48,negated_conjecture,(xsd_integer(esk2_0)|cCar(esk4_0)|~xsd_string(esk2_0)|~cCar(esk3_0)),inference(sr,[status(thm)],[36,10,theory(equality)])).
% cnf(49,negated_conjecture,(cCar(esk4_0)|xsd_integer(esk2_0)|~cCar(esk3_0)),inference(csr,[status(thm)],[48,14])).
% cnf(50,negated_conjecture,(xsd_integer(esk2_0)|cAutomobile(esk3_0)|~xsd_string(esk2_0)|~cAutomobile(esk4_0)),inference(sr,[status(thm)],[37,10,theory(equality)])).
% cnf(51,negated_conjecture,(cAutomobile(esk3_0)|xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(csr,[status(thm)],[50,14])).
% cnf(52,negated_conjecture,(xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cCar(esk3_0)|~cAutomobile(esk4_0)),inference(sr,[status(thm)],[38,10,theory(equality)])).
% cnf(53,negated_conjecture,(xsd_string(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)),inference(csr,[status(thm)],[52,14])).
% cnf(54,negated_conjecture,(xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cCar(esk3_0)|~cAutomobile(esk4_0)),inference(sr,[status(thm)],[39,10,theory(equality)])).
% cnf(55,negated_conjecture,(xsd_integer(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)),inference(csr,[status(thm)],[54,14])).
% cnf(56,negated_conjecture,(cCar(esk3_0)|cCar(esk4_0)|xsd_integer(esk2_0)),inference(spm,[status(thm)],[18,43,theory(equality)])).
% cnf(58,negated_conjecture,(cAutomobile(esk3_0)|cCar(esk4_0)|~xsd_integer(esk2_0)),inference(spm,[status(thm)],[15,41,theory(equality)])).
% cnf(59,negated_conjecture,(cCar(esk4_0)|~xsd_integer(esk2_0)|~cCar(esk3_0)),inference(spm,[status(thm)],[15,45,theory(equality)])).
% cnf(61,negated_conjecture,(cAutomobile(esk3_0)|~xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(spm,[status(thm)],[15,47,theory(equality)])).
% cnf(65,negated_conjecture,(cCar(esk4_0)|xsd_integer(esk2_0)),inference(csr,[status(thm)],[56,49])).
% cnf(66,negated_conjecture,(cAutomobile(esk3_0)|cCar(esk4_0)),inference(csr,[status(thm)],[58,65])).
% cnf(67,negated_conjecture,(cCar(esk3_0)|cCar(esk4_0)),inference(spm,[status(thm)],[18,66,theory(equality)])).
% cnf(68,negated_conjecture,(cCar(esk4_0)|~xsd_integer(esk2_0)),inference(csr,[status(thm)],[59,67])).
% cnf(69,negated_conjecture,(cCar(esk4_0)),inference(csr,[status(thm)],[68,65])).
% cnf(73,negated_conjecture,(cAutomobile(esk3_0)|~cAutomobile(esk4_0)),inference(csr,[status(thm)],[61,51])).
% cnf(74,negated_conjecture,(cCar(esk3_0)|~cAutomobile(esk4_0)),inference(spm,[status(thm)],[18,73,theory(equality)])).
% cnf(75,negated_conjecture,(cCar(esk3_0)|~cCar(esk4_0)),inference(spm,[status(thm)],[74,19,theory(equality)])).
% cnf(76,negated_conjecture,(cCar(esk3_0)|$false),inference(rw,[status(thm)],[75,69,theory(equality)])).
% cnf(77,negated_conjecture,(cCar(esk3_0)),inference(cn,[status(thm)],[76,theory(equality)])).
% cnf(78,negated_conjecture,(xsd_integer(esk2_0)|~cAutomobile(esk4_0)|$false),inference(rw,[status(thm)],[55,77,theory(equality)])).
% cnf(79,negated_conjecture,(xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(cn,[status(thm)],[78,theory(equality)])).
% cnf(80,negated_conjecture,(xsd_string(esk2_0)|~cAutomobile(esk4_0)|$false),inference(rw,[status(thm)],[53,77,theory(equality)])).
% cnf(81,negated_conjecture,(xsd_string(esk2_0)|~cAutomobile(esk4_0)),inference(cn,[status(thm)],[80,theory(equality)])).
% cnf(83,negated_conjecture,(xsd_integer(esk2_0)|~cCar(esk4_0)),inference(spm,[status(thm)],[79,19,theory(equality)])).
% cnf(84,negated_conjecture,(xsd_integer(esk2_0)|$false),inference(rw,[status(thm)],[83,69,theory(equality)])).
% cnf(85,negated_conjecture,(xsd_integer(esk2_0)),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(86,negated_conjecture,(~xsd_integer(esk2_0)|~cAutomobile(esk4_0)),inference(spm,[status(thm)],[15,81,theory(equality)])).
% cnf(88,negated_conjecture,($false|~cAutomobile(esk4_0)),inference(rw,[status(thm)],[86,85,theory(equality)])).
% cnf(89,negated_conjecture,(~cAutomobile(esk4_0)),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(90,negated_conjecture,(~cCar(esk4_0)),inference(spm,[status(thm)],[89,19,theory(equality)])).
% cnf(91,negated_conjecture,($false),inference(rw,[status(thm)],[90,69,theory(equality)])).
% cnf(92,negated_conjecture,($false),inference(cn,[status(thm)],[91,theory(equality)])).
% cnf(93,negated_conjecture,($false),92,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 37
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 6
% # Backward-rewritten                 : 7
% # Generated clauses                  : 15
% # ...of the previous two non-trivial : 14
% # Contextual simplify-reflections    : 13
% # Paramodulations                    : 15
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 11
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 6
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 33
% # Rec. Clause-clause subsumption calls : 33
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:    15 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.007 s
% # System time            : 0.004 s
% # Total time             : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP1053/KRS165+1.tptp
% 
%------------------------------------------------------------------------------