TSTP Solution File: KRS131+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS131+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 : art03.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:36:02 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/SystemOnTPTP6316/KRS131+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6316/KRS131+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6316/KRS131+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 6412
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 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]:(cA(X1)<=>?[X2]:(rq(X1,X2)&cowlThing(X2))),file('/tmp/SRASS.s.p', axiom_2)).
% fof(4, axiom,![X1]:(cnotA(X1)<=>![X2]:(rq(X1,X2)=>cNothing(X2))),file('/tmp/SRASS.s.p', axiom_5)).
% fof(5, axiom,![X1]:(cNothing(X1)=>~(?[X2]:rp(X1,X2))),file('/tmp/SRASS.s.p', axiom_3)).
% fof(6, axiom,![X1]:(cNothing(X1)=>?[X3]:rp(X1,X3)),file('/tmp/SRASS.s.p', axiom_4)).
% fof(7, conjecture,((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cnotA(X1)<=>~(cA(X1)))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(8, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cnotA(X1)<=>~(cA(X1))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(10, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(11, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cnotA(X1)<=>~(cA(X1))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(12, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[9])).
% cnf(13,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(15, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(16, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(19, plain,![X1]:((~(cA(X1))|?[X2]:(rq(X1,X2)&cowlThing(X2)))&(![X2]:(~(rq(X1,X2))|~(cowlThing(X2)))|cA(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(20, plain,![X3]:((~(cA(X3))|?[X4]:(rq(X3,X4)&cowlThing(X4)))&(![X5]:(~(rq(X3,X5))|~(cowlThing(X5)))|cA(X3))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X3]:((~(cA(X3))|(rq(X3,esk1_1(X3))&cowlThing(esk1_1(X3))))&(![X5]:(~(rq(X3,X5))|~(cowlThing(X5)))|cA(X3))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X3]:![X5]:(((~(rq(X3,X5))|~(cowlThing(X5)))|cA(X3))&(~(cA(X3))|(rq(X3,esk1_1(X3))&cowlThing(esk1_1(X3))))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X3]:![X5]:(((~(rq(X3,X5))|~(cowlThing(X5)))|cA(X3))&((rq(X3,esk1_1(X3))|~(cA(X3)))&(cowlThing(esk1_1(X3))|~(cA(X3))))),inference(distribute,[status(thm)],[22])).
% cnf(25,plain,(rq(X1,esk1_1(X1))|~cA(X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(cA(X1)|~cowlThing(X2)|~rq(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X1]:((~(cnotA(X1))|![X2]:(~(rq(X1,X2))|cNothing(X2)))&(?[X2]:(rq(X1,X2)&~(cNothing(X2)))|cnotA(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(28, plain,![X3]:((~(cnotA(X3))|![X4]:(~(rq(X3,X4))|cNothing(X4)))&(?[X5]:(rq(X3,X5)&~(cNothing(X5)))|cnotA(X3))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X3]:((~(cnotA(X3))|![X4]:(~(rq(X3,X4))|cNothing(X4)))&((rq(X3,esk2_1(X3))&~(cNothing(esk2_1(X3))))|cnotA(X3))),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X3]:![X4]:(((~(rq(X3,X4))|cNothing(X4))|~(cnotA(X3)))&((rq(X3,esk2_1(X3))&~(cNothing(esk2_1(X3))))|cnotA(X3))),inference(shift_quantors,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:(((~(rq(X3,X4))|cNothing(X4))|~(cnotA(X3)))&((rq(X3,esk2_1(X3))|cnotA(X3))&(~(cNothing(esk2_1(X3)))|cnotA(X3)))),inference(distribute,[status(thm)],[30])).
% cnf(33,plain,(cnotA(X1)|rq(X1,esk2_1(X1))),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,plain,(cNothing(X2)|~cnotA(X1)|~rq(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X1]:(~(cNothing(X1))|![X2]:~(rp(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X3]:(~(cNothing(X3))|![X4]:~(rp(X3,X4))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:(~(rp(X3,X4))|~(cNothing(X3))),inference(shift_quantors,[status(thm)],[36])).
% cnf(38,plain,(~cNothing(X1)|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:(~(cNothing(X1))|?[X3]:rp(X1,X3)),inference(fof_nnf,[status(thm)],[6])).
% fof(40, plain,![X4]:(~(cNothing(X4))|?[X5]:rp(X4,X5)),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X4]:(~(cNothing(X4))|rp(X4,esk3_1(X4))),inference(skolemize,[status(esa)],[40])).
% cnf(42,plain,(rp(X1,esk3_1(X1))|~cNothing(X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, negated_conjecture,((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:((~(cnotA(X1))|cA(X1))&(cnotA(X1)|~(cA(X1))))),inference(fof_nnf,[status(thm)],[11])).
% fof(44, negated_conjecture,((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|?[X4]:((~(cnotA(X4))|cA(X4))&(cnotA(X4)|~(cA(X4))))),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,(((~(cowlThing(esk4_0))|cowlNothing(esk4_0))|((~(xsd_string(esk5_0))|xsd_integer(esk5_0))&(xsd_string(esk5_0)|~(xsd_integer(esk5_0)))))|((~(cnotA(esk6_0))|cA(esk6_0))&(cnotA(esk6_0)|~(cA(esk6_0))))),inference(skolemize,[status(esa)],[44])).
% fof(46, negated_conjecture,((((~(cnotA(esk6_0))|cA(esk6_0))|((~(xsd_string(esk5_0))|xsd_integer(esk5_0))|(~(cowlThing(esk4_0))|cowlNothing(esk4_0))))&((cnotA(esk6_0)|~(cA(esk6_0)))|((~(xsd_string(esk5_0))|xsd_integer(esk5_0))|(~(cowlThing(esk4_0))|cowlNothing(esk4_0)))))&(((~(cnotA(esk6_0))|cA(esk6_0))|((xsd_string(esk5_0)|~(xsd_integer(esk5_0)))|(~(cowlThing(esk4_0))|cowlNothing(esk4_0))))&((cnotA(esk6_0)|~(cA(esk6_0)))|((xsd_string(esk5_0)|~(xsd_integer(esk5_0)))|(~(cowlThing(esk4_0))|cowlNothing(esk4_0)))))),inference(distribute,[status(thm)],[45])).
% cnf(47,negated_conjecture,(cowlNothing(esk4_0)|xsd_string(esk5_0)|cnotA(esk6_0)|~cowlThing(esk4_0)|~xsd_integer(esk5_0)|~cA(esk6_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,negated_conjecture,(cowlNothing(esk4_0)|xsd_string(esk5_0)|cA(esk6_0)|~cowlThing(esk4_0)|~xsd_integer(esk5_0)|~cnotA(esk6_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(49,negated_conjecture,(cowlNothing(esk4_0)|xsd_integer(esk5_0)|cnotA(esk6_0)|~cowlThing(esk4_0)|~xsd_string(esk5_0)|~cA(esk6_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(50,negated_conjecture,(cowlNothing(esk4_0)|xsd_integer(esk5_0)|cA(esk6_0)|~cowlThing(esk4_0)|~xsd_string(esk5_0)|~cnotA(esk6_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(52,plain,(cA(X1)|$false|~rq(X1,X2)),inference(rw,[status(thm)],[26,14,theory(equality)]),['unfolding']).
% cnf(53,negated_conjecture,(cowlNothing(esk4_0)|xsd_string(esk5_0)|cA(esk6_0)|$false|~xsd_integer(esk5_0)|~cnotA(esk6_0)),inference(rw,[status(thm)],[48,14,theory(equality)]),['unfolding']).
% cnf(54,negated_conjecture,(cowlNothing(esk4_0)|xsd_string(esk5_0)|cnotA(esk6_0)|$false|~xsd_integer(esk5_0)|~cA(esk6_0)),inference(rw,[status(thm)],[47,14,theory(equality)]),['unfolding']).
% cnf(55,negated_conjecture,(cowlNothing(esk4_0)|xsd_integer(esk5_0)|cA(esk6_0)|$false|~xsd_string(esk5_0)|~cnotA(esk6_0)),inference(rw,[status(thm)],[50,14,theory(equality)]),['unfolding']).
% cnf(56,negated_conjecture,(cowlNothing(esk4_0)|xsd_integer(esk5_0)|cnotA(esk6_0)|$false|~xsd_string(esk5_0)|~cA(esk6_0)),inference(rw,[status(thm)],[49,14,theory(equality)]),['unfolding']).
% cnf(57,negated_conjecture,(xsd_string(esk5_0)|cA(esk6_0)|~xsd_integer(esk5_0)|~cnotA(esk6_0)),inference(sr,[status(thm)],[53,13,theory(equality)])).
% cnf(58,negated_conjecture,(cA(esk6_0)|xsd_string(esk5_0)|~cnotA(esk6_0)),inference(csr,[status(thm)],[57,17])).
% cnf(59,negated_conjecture,(xsd_string(esk5_0)|cnotA(esk6_0)|~xsd_integer(esk5_0)|~cA(esk6_0)),inference(sr,[status(thm)],[54,13,theory(equality)])).
% cnf(60,negated_conjecture,(cnotA(esk6_0)|xsd_string(esk5_0)|~cA(esk6_0)),inference(csr,[status(thm)],[59,17])).
% cnf(61,negated_conjecture,(xsd_integer(esk5_0)|cA(esk6_0)|~xsd_string(esk5_0)|~cnotA(esk6_0)),inference(sr,[status(thm)],[55,13,theory(equality)])).
% cnf(62,negated_conjecture,(cA(esk6_0)|xsd_integer(esk5_0)|~cnotA(esk6_0)),inference(csr,[status(thm)],[61,17])).
% cnf(63,negated_conjecture,(xsd_integer(esk5_0)|cnotA(esk6_0)|~xsd_string(esk5_0)|~cA(esk6_0)),inference(sr,[status(thm)],[56,13,theory(equality)])).
% cnf(64,negated_conjecture,(cnotA(esk6_0)|xsd_integer(esk5_0)|~cA(esk6_0)),inference(csr,[status(thm)],[63,60])).
% cnf(65,plain,(~cNothing(X1)),inference(csr,[status(thm)],[42,38])).
% cnf(66,negated_conjecture,(cA(esk6_0)|~xsd_integer(esk5_0)|~cnotA(esk6_0)),inference(spm,[status(thm)],[18,58,theory(equality)])).
% cnf(67,negated_conjecture,(cnotA(esk6_0)|~xsd_integer(esk5_0)|~cA(esk6_0)),inference(spm,[status(thm)],[18,60,theory(equality)])).
% cnf(70,plain,(cA(X1)|cnotA(X1)),inference(spm,[status(thm)],[52,33,theory(equality)])).
% cnf(72,plain,(~cnotA(X2)|~rq(X2,X1)),inference(sr,[status(thm)],[34,65,theory(equality)])).
% cnf(74,plain,(~cnotA(X1)|~cA(X1)),inference(spm,[status(thm)],[72,25,theory(equality)])).
% cnf(75,negated_conjecture,(xsd_integer(esk5_0)|~cnotA(esk6_0)),inference(spm,[status(thm)],[74,62,theory(equality)])).
% cnf(76,negated_conjecture,(cA(esk6_0)|~cnotA(esk6_0)),inference(csr,[status(thm)],[66,75])).
% cnf(77,negated_conjecture,(~cnotA(esk6_0)),inference(csr,[status(thm)],[76,74])).
% cnf(78,negated_conjecture,(~xsd_integer(esk5_0)|~cA(esk6_0)),inference(sr,[status(thm)],[67,77,theory(equality)])).
% cnf(79,negated_conjecture,(cnotA(esk6_0)|xsd_integer(esk5_0)),inference(spm,[status(thm)],[64,70,theory(equality)])).
% cnf(82,negated_conjecture,(xsd_integer(esk5_0)),inference(sr,[status(thm)],[79,77,theory(equality)])).
% cnf(84,negated_conjecture,(~cA(esk6_0)|$false),inference(rw,[status(thm)],[78,82,theory(equality)])).
% cnf(85,negated_conjecture,(~cA(esk6_0)),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(87,negated_conjecture,(cnotA(esk6_0)),inference(spm,[status(thm)],[85,70,theory(equality)])).
% cnf(88,negated_conjecture,($false),inference(sr,[status(thm)],[87,77,theory(equality)])).
% cnf(89,negated_conjecture,($false),88,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 35
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 33
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 2
% # Generated clauses : 13
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 7
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 15 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 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/SystemOnTPTP6316/KRS131+1.tptp
%
%------------------------------------------------------------------------------