TSTP Solution File: KRS174+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS174+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 : art07.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:27 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/SystemOnTPTP21950/KRS174+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21950/KRS174+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21950/KRS174+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 22046
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(12, axiom,![X1]:(cA(X1)<=>X1=ia),file('/tmp/SRASS.s.p', axiom_2)).
% fof(13, axiom,![X1]:(cB(X1)<=>X1=ib),file('/tmp/SRASS.s.p', axiom_4)).
% fof(14, axiom,![X1]:(cA_and_B(X1)<=>(X1=ib|X1=ia)),file('/tmp/SRASS.s.p', axiom_3)).
% fof(15, conjecture,((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cA_and_B(X1)<=>(cB(X1)|cA(X1)))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(16, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cA_and_B(X1)<=>(cB(X1)|cA(X1))))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(19, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cA_and_B(X1)<=>(cB(X1)|cA(X1))))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(20, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[17])).
% cnf(21,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(23, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(24, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(50, plain,![X1]:((~(cA(X1))|X1=ia)&(~(X1=ia)|cA(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(51, plain,![X2]:((~(cA(X2))|X2=ia)&(~(X2=ia)|cA(X2))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(cA(X1)|X1!=ia),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(X1=ia|~cA(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(54, plain,![X1]:((~(cB(X1))|X1=ib)&(~(X1=ib)|cB(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(55, plain,![X2]:((~(cB(X2))|X2=ib)&(~(X2=ib)|cB(X2))),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(cB(X1)|X1!=ib),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(X1=ib|~cB(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(58, plain,![X1]:((~(cA_and_B(X1))|(X1=ib|X1=ia))&((~(X1=ib)&~(X1=ia))|cA_and_B(X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(59, plain,![X2]:((~(cA_and_B(X2))|(X2=ib|X2=ia))&((~(X2=ib)&~(X2=ia))|cA_and_B(X2))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X2]:((~(cA_and_B(X2))|(X2=ib|X2=ia))&((~(X2=ib)|cA_and_B(X2))&(~(X2=ia)|cA_and_B(X2)))),inference(distribute,[status(thm)],[59])).
% cnf(61,plain,(cA_and_B(X1)|X1!=ia),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(cA_and_B(X1)|X1!=ib),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,plain,(X1=ia|X1=ib|~cA_and_B(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(64, negated_conjecture,((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:((~(cA_and_B(X1))|(~(cB(X1))&~(cA(X1))))&(cA_and_B(X1)|(cB(X1)|cA(X1))))),inference(fof_nnf,[status(thm)],[19])).
% fof(65, negated_conjecture,((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|?[X4]:((~(cA_and_B(X4))|(~(cB(X4))&~(cA(X4))))&(cA_and_B(X4)|(cB(X4)|cA(X4))))),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,(((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|((~(cA_and_B(esk3_0))|(~(cB(esk3_0))&~(cA(esk3_0))))&(cA_and_B(esk3_0)|(cB(esk3_0)|cA(esk3_0))))),inference(skolemize,[status(esa)],[65])).
% fof(67, negated_conjecture,(((((~(cB(esk3_0))|~(cA_and_B(esk3_0)))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))&((~(cA(esk3_0))|~(cA_and_B(esk3_0)))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&((cA_and_B(esk3_0)|(cB(esk3_0)|cA(esk3_0)))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&((((~(cB(esk3_0))|~(cA_and_B(esk3_0)))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))&((~(cA(esk3_0))|~(cA_and_B(esk3_0)))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))&((cA_and_B(esk3_0)|(cB(esk3_0)|cA(esk3_0)))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0)))))),inference(distribute,[status(thm)],[66])).
% cnf(68,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cA(esk3_0)|cB(esk3_0)|cA_and_B(esk3_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(70,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cB(esk3_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(71,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cA(esk3_0)|cB(esk3_0)|cA_and_B(esk3_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(72,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(73,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cB(esk3_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(76,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|cA(esk3_0)|cA_and_B(esk3_0)|cB(esk3_0)|$false|~xsd_integer(esk2_0)),inference(rw,[status(thm)],[68,22,theory(equality)]),['unfolding']).
% cnf(77,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|cA(esk3_0)|cA_and_B(esk3_0)|cB(esk3_0)|$false|~xsd_string(esk2_0)),inference(rw,[status(thm)],[71,22,theory(equality)]),['unfolding']).
% cnf(78,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|~xsd_integer(esk2_0)|~cA(esk3_0)|~cA_and_B(esk3_0)),inference(rw,[status(thm)],[69,22,theory(equality)]),['unfolding']).
% cnf(79,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cB(esk3_0)),inference(rw,[status(thm)],[70,22,theory(equality)]),['unfolding']).
% cnf(80,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|~xsd_string(esk2_0)|~cA(esk3_0)|~cA_and_B(esk3_0)),inference(rw,[status(thm)],[72,22,theory(equality)]),['unfolding']).
% cnf(81,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cB(esk3_0)),inference(rw,[status(thm)],[73,22,theory(equality)]),['unfolding']).
% cnf(82,negated_conjecture,(xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA(esk3_0)|~cA_and_B(esk3_0)),inference(sr,[status(thm)],[78,21,theory(equality)])).
% cnf(83,negated_conjecture,(xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0)),inference(csr,[status(thm)],[82,25])).
% cnf(84,negated_conjecture,(xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cB(esk3_0)),inference(sr,[status(thm)],[79,21,theory(equality)])).
% cnf(85,negated_conjecture,(xsd_string(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0)),inference(csr,[status(thm)],[84,25])).
% cnf(86,negated_conjecture,(xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA(esk3_0)|~cA_and_B(esk3_0)),inference(sr,[status(thm)],[80,21,theory(equality)])).
% cnf(87,negated_conjecture,(xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0)),inference(csr,[status(thm)],[86,25])).
% cnf(88,negated_conjecture,(xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cB(esk3_0)),inference(sr,[status(thm)],[81,21,theory(equality)])).
% cnf(89,negated_conjecture,(xsd_integer(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0)),inference(csr,[status(thm)],[88,25])).
% cnf(90,negated_conjecture,(xsd_string(esk2_0)|cA(esk3_0)|cA_and_B(esk3_0)|cB(esk3_0)|~xsd_integer(esk2_0)),inference(sr,[status(thm)],[76,21,theory(equality)])).
% cnf(91,negated_conjecture,(cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0)|xsd_string(esk2_0)),inference(csr,[status(thm)],[90,25])).
% cnf(92,negated_conjecture,(xsd_integer(esk2_0)|cA(esk3_0)|cA_and_B(esk3_0)|cB(esk3_0)|~xsd_string(esk2_0)),inference(sr,[status(thm)],[77,21,theory(equality)])).
% cnf(93,negated_conjecture,(cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0)|xsd_integer(esk2_0)),inference(csr,[status(thm)],[92,25])).
% cnf(95,negated_conjecture,(xsd_string(esk2_0)|~cA_and_B(esk3_0)|ia!=esk3_0),inference(spm,[status(thm)],[83,52,theory(equality)])).
% cnf(96,negated_conjecture,(xsd_integer(esk2_0)|~cA_and_B(esk3_0)|ia!=esk3_0),inference(spm,[status(thm)],[87,52,theory(equality)])).
% cnf(97,negated_conjecture,(xsd_string(esk2_0)|~cA_and_B(esk3_0)|ib!=esk3_0),inference(spm,[status(thm)],[85,56,theory(equality)])).
% cnf(100,negated_conjecture,(xsd_integer(esk2_0)|~cA_and_B(esk3_0)|ib!=esk3_0),inference(spm,[status(thm)],[89,56,theory(equality)])).
% cnf(101,negated_conjecture,(ib=esk3_0|cA_and_B(esk3_0)|cA(esk3_0)|xsd_string(esk2_0)),inference(spm,[status(thm)],[57,91,theory(equality)])).
% cnf(104,negated_conjecture,(ib=esk3_0|cA_and_B(esk3_0)|cA(esk3_0)|xsd_integer(esk2_0)),inference(spm,[status(thm)],[57,93,theory(equality)])).
% cnf(109,negated_conjecture,(xsd_string(esk2_0)|esk3_0!=ia),inference(csr,[status(thm)],[95,61])).
% cnf(110,negated_conjecture,(~xsd_integer(esk2_0)|esk3_0!=ia),inference(spm,[status(thm)],[26,109,theory(equality)])).
% cnf(111,negated_conjecture,(xsd_integer(esk2_0)|esk3_0!=ia),inference(csr,[status(thm)],[96,61])).
% cnf(112,negated_conjecture,(esk3_0!=ia),inference(csr,[status(thm)],[110,111])).
% cnf(113,negated_conjecture,(xsd_string(esk2_0)|esk3_0!=ib),inference(csr,[status(thm)],[97,62])).
% cnf(114,negated_conjecture,(~xsd_integer(esk2_0)|esk3_0!=ib),inference(spm,[status(thm)],[26,113,theory(equality)])).
% cnf(116,negated_conjecture,(xsd_integer(esk2_0)|esk3_0!=ib),inference(csr,[status(thm)],[100,62])).
% cnf(117,negated_conjecture,(esk3_0!=ib),inference(csr,[status(thm)],[116,114])).
% cnf(118,negated_conjecture,(cA_and_B(esk3_0)|cA(esk3_0)|xsd_string(esk2_0)),inference(sr,[status(thm)],[101,117,theory(equality)])).
% cnf(119,negated_conjecture,(ia=esk3_0|cA_and_B(esk3_0)|xsd_string(esk2_0)),inference(spm,[status(thm)],[53,118,theory(equality)])).
% cnf(122,negated_conjecture,(cA_and_B(esk3_0)|xsd_string(esk2_0)),inference(sr,[status(thm)],[119,112,theory(equality)])).
% cnf(123,negated_conjecture,(cA_and_B(esk3_0)|~xsd_integer(esk2_0)),inference(spm,[status(thm)],[26,122,theory(equality)])).
% cnf(125,negated_conjecture,(cA_and_B(esk3_0)|cA(esk3_0)|xsd_integer(esk2_0)),inference(sr,[status(thm)],[104,117,theory(equality)])).
% cnf(126,negated_conjecture,(cA_and_B(esk3_0)|cA(esk3_0)),inference(csr,[status(thm)],[125,123])).
% cnf(127,negated_conjecture,(ia=esk3_0|cA_and_B(esk3_0)),inference(spm,[status(thm)],[53,126,theory(equality)])).
% cnf(130,negated_conjecture,(cA_and_B(esk3_0)),inference(sr,[status(thm)],[127,112,theory(equality)])).
% cnf(131,negated_conjecture,(ia=esk3_0|ib=esk3_0),inference(spm,[status(thm)],[63,130,theory(equality)])).
% cnf(143,negated_conjecture,(esk3_0=ib),inference(sr,[status(thm)],[131,112,theory(equality)])).
% cnf(144,negated_conjecture,($false),inference(sr,[status(thm)],[143,117,theory(equality)])).
% cnf(145,negated_conjecture,($false),144,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 45
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 43
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 7
% # Generated clauses : 27
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 13
% # Paramodulations : 27
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 8
% # Clause-clause subsumption calls (NU) : 16
% # Rec. Clause-clause subsumption calls : 16
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.004 s
% # Total time : 0.016 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/SystemOnTPTP21950/KRS174+1.tptp
%
%------------------------------------------------------------------------------