%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS180+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : yorktown.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 10:45:48 EDT 2012
% Result : Theorem 0.27s
% Output : Solution 0.27s
% 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/SystemOnTPTP20172/KRS180+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20172/KRS180+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20172/KRS180+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 20270
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNSNFFMM21MS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHNSNFFMM21MS
% # Auto-Mode selected heuristic G_E___107_C45_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # No equality, disabling AC handling.
% #
% # Initializing proof state
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 14
% # Removed by relevancy pruning : 0
% # Initial clauses : 38
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 38
% # Processed clauses : 56
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 77
% # ...of the previous two non-trivial : 65
% # Contextual simplify-reflections : 0
% # Paramodulations : 76
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 50
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 27
% # Current number of unprocessed clauses: 47
% # ...number of literals in the above : 131
% # Clause-clause subsumption calls (NU) : 86
% # Rec. Clause-clause subsumption calls : 62
% # Non-unit clause-clause subsumptions: 3
% # Unit Clause-clause subsumption calls : 107
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 22
% # BW rewrite match successes : 2
% # Backwards rewriting index : 476 nodes, 75 leaves, 1.21+/-0.788 terms/leaf
% # Paramod-from index : 121 nodes, 20 leaves, 1.20+/-0.510 terms/leaf
% # Paramod-into index : 338 nodes, 51 leaves, 1.08+/-0.334 terms/leaf
% # Paramod-neg-atom index : 127 nodes, 21 leaves, 1.19+/-0.499 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)=>status(X3,X4,X2))<=>isa(X1,X2)),file('/tmp/SRASS.s.p', isa)).
% fof(2, axiom,![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))<=>nota(X1,X2)),file('/tmp/SRASS.s.p', nota)).
% fof(3, axiom,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)=>~(status(X3,X4,X2)))<=>nevera(X1,X2)),file('/tmp/SRASS.s.p', nevera)).
% fof(4, axiom,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)<~>status(X3,X4,X2))<=>xora(X1,X2)),file('/tmp/SRASS.s.p', xora)).
% fof(14, conjecture,![X1]:![X2]:?[X3]:?[X4]:(status(X3,X4,X1)=>~((isa(X1,X2)&((nota(X1,X2)|nevera(X1,X2))|xora(X1,X2))))),file('/tmp/SRASS.s.p', isa_exclusive)).
% fof(15, negated_conjecture,~(![X1]:![X2]:?[X3]:?[X4]:(status(X3,X4,X1)=>~((isa(X1,X2)&((nota(X1,X2)|nevera(X1,X2))|xora(X1,X2)))))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))<=>nota(X1,X2)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(17, plain,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)=>~(status(X3,X4,X2)))<=>nevera(X1,X2)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(18, plain,![X1]:![X2]:(![X3]:![X4]:~((status(X3,X4,X1)<=>status(X3,X4,X2)))<=>xora(X1,X2)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(26, plain,![X1]:![X2]:((?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))|isa(X1,X2))&(~(isa(X1,X2))|![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(27, plain,(![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))|isa(X1,X2))&![X1]:![X2]:(~(isa(X1,X2))|![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2)))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,(![X5]:![X6]:(?[X7]:?[X8]:(status(X7,X8,X5)&~(status(X7,X8,X6)))|isa(X5,X6))&![X9]:![X10]:(~(isa(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,(![X5]:![X6]:((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)&~(status(esk1_2(X5,X6),esk2_2(X5,X6),X6)))|isa(X5,X6))&![X9]:![X10]:(~(isa(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)&~(status(esk1_2(X5,X6),esk2_2(X5,X6),X6)))|isa(X5,X6))&(~(isa(X9,X10))|(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(shift_quantors,[status(thm)],[29])).
% fof(31, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)|isa(X5,X6))&(~(status(esk1_2(X5,X6),esk2_2(X5,X6),X6))|isa(X5,X6)))&(~(isa(X9,X10))|(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(distribute,[status(thm)],[30])).
% cnf(32,plain,(status(X1,X2,X3)|~status(X1,X2,X4)|~isa(X4,X3)),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X1]:![X2]:((![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2))|nota(X1,X2))&(~(nota(X1,X2))|?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2))))),inference(fof_nnf,[status(thm)],[16])).
% fof(36, plain,(![X1]:![X2]:(![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2))|nota(X1,X2))&![X1]:![X2]:(~(nota(X1,X2))|?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2))))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,(![X5]:![X6]:(![X7]:![X8]:(~(status(X7,X8,X5))|status(X7,X8,X6))|nota(X5,X6))&![X9]:![X10]:(~(nota(X9,X10))|?[X11]:?[X12]:(status(X11,X12,X9)&~(status(X11,X12,X10))))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,(![X5]:![X6]:(![X7]:![X8]:(~(status(X7,X8,X5))|status(X7,X8,X6))|nota(X5,X6))&![X9]:![X10]:(~(nota(X9,X10))|(status(esk3_2(X9,X10),esk4_2(X9,X10),X9)&~(status(esk3_2(X9,X10),esk4_2(X9,X10),X10))))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:(((~(status(X7,X8,X5))|status(X7,X8,X6))|nota(X5,X6))&(~(nota(X9,X10))|(status(esk3_2(X9,X10),esk4_2(X9,X10),X9)&~(status(esk3_2(X9,X10),esk4_2(X9,X10),X10))))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:(((~(status(X7,X8,X5))|status(X7,X8,X6))|nota(X5,X6))&((status(esk3_2(X9,X10),esk4_2(X9,X10),X9)|~(nota(X9,X10)))&(~(status(esk3_2(X9,X10),esk4_2(X9,X10),X10))|~(nota(X9,X10))))),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(~nota(X1,X2)|~status(esk3_2(X1,X2),esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(44, plain,![X1]:![X2]:((?[X3]:?[X4]:(status(X3,X4,X1)&status(X3,X4,X2))|nevera(X1,X2))&(~(nevera(X1,X2))|![X3]:![X4]:(~(status(X3,X4,X1))|~(status(X3,X4,X2))))),inference(fof_nnf,[status(thm)],[17])).
% fof(45, plain,(![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&status(X3,X4,X2))|nevera(X1,X2))&![X1]:![X2]:(~(nevera(X1,X2))|![X3]:![X4]:(~(status(X3,X4,X1))|~(status(X3,X4,X2))))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,(![X5]:![X6]:(?[X7]:?[X8]:(status(X7,X8,X5)&status(X7,X8,X6))|nevera(X5,X6))&![X9]:![X10]:(~(nevera(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,(![X5]:![X6]:((status(esk5_2(X5,X6),esk6_2(X5,X6),X5)&status(esk5_2(X5,X6),esk6_2(X5,X6),X6))|nevera(X5,X6))&![X9]:![X10]:(~(nevera(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk5_2(X5,X6),esk6_2(X5,X6),X5)&status(esk5_2(X5,X6),esk6_2(X5,X6),X6))|nevera(X5,X6))&(~(nevera(X9,X10))|(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(shift_quantors,[status(thm)],[47])).
% fof(49, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk5_2(X5,X6),esk6_2(X5,X6),X5)|nevera(X5,X6))&(status(esk5_2(X5,X6),esk6_2(X5,X6),X6)|nevera(X5,X6)))&(~(nevera(X9,X10))|(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(~status(X1,X2,X3)|~status(X1,X2,X4)|~nevera(X4,X3)),inference(split_conjunct,[status(thm)],[49])).
% fof(53, plain,![X1]:![X2]:((?[X3]:?[X4]:((~(status(X3,X4,X1))|status(X3,X4,X2))&(~(status(X3,X4,X2))|status(X3,X4,X1)))|xora(X1,X2))&(~(xora(X1,X2))|![X3]:![X4]:((~(status(X3,X4,X1))|~(status(X3,X4,X2)))&(status(X3,X4,X1)|status(X3,X4,X2))))),inference(fof_nnf,[status(thm)],[18])).
% fof(54, plain,(![X1]:![X2]:(?[X3]:?[X4]:((~(status(X3,X4,X1))|status(X3,X4,X2))&(~(status(X3,X4,X2))|status(X3,X4,X1)))|xora(X1,X2))&![X1]:![X2]:(~(xora(X1,X2))|(![X3]:![X4]:(~(status(X3,X4,X1))|~(status(X3,X4,X2)))&![X3]:![X4]:(status(X3,X4,X1)|status(X3,X4,X2))))),inference(shift_quantors,[status(thm)],[53])).
% fof(55, plain,(![X5]:![X6]:(?[X7]:?[X8]:((~(status(X7,X8,X5))|status(X7,X8,X6))&(~(status(X7,X8,X6))|status(X7,X8,X5)))|xora(X5,X6))&![X9]:![X10]:(~(xora(X9,X10))|(![X11]:![X12]:(~(status(X11,X12,X9))|~(status(X11,X12,X10)))&![X13]:![X14]:(status(X13,X14,X9)|status(X13,X14,X10))))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,(![X5]:![X6]:(((~(status(esk7_2(X5,X6),esk8_2(X5,X6),X5))|status(esk7_2(X5,X6),esk8_2(X5,X6),X6))&(~(status(esk7_2(X5,X6),esk8_2(X5,X6),X6))|status(esk7_2(X5,X6),esk8_2(X5,X6),X5)))|xora(X5,X6))&![X9]:![X10]:(~(xora(X9,X10))|(![X11]:![X12]:(~(status(X11,X12,X9))|~(status(X11,X12,X10)))&![X13]:![X14]:(status(X13,X14,X9)|status(X13,X14,X10))))),inference(skolemize,[status(esa)],[55])).
% fof(57, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:((((~(status(esk7_2(X5,X6),esk8_2(X5,X6),X5))|status(esk7_2(X5,X6),esk8_2(X5,X6),X6))&(~(status(esk7_2(X5,X6),esk8_2(X5,X6),X6))|status(esk7_2(X5,X6),esk8_2(X5,X6),X5)))|xora(X5,X6))&(~(xora(X9,X10))|((~(status(X11,X12,X9))|~(status(X11,X12,X10)))&(status(X13,X14,X9)|status(X13,X14,X10))))),inference(shift_quantors,[status(thm)],[56])).
% fof(58, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:((((~(status(esk7_2(X5,X6),esk8_2(X5,X6),X5))|status(esk7_2(X5,X6),esk8_2(X5,X6),X6))|xora(X5,X6))&((~(status(esk7_2(X5,X6),esk8_2(X5,X6),X6))|status(esk7_2(X5,X6),esk8_2(X5,X6),X5))|xora(X5,X6)))&(((~(status(X11,X12,X9))|~(status(X11,X12,X10)))|~(xora(X9,X10)))&((status(X13,X14,X9)|status(X13,X14,X10))|~(xora(X9,X10))))),inference(distribute,[status(thm)],[57])).
% cnf(60,plain,(~xora(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(114, negated_conjecture,?[X1]:?[X2]:![X3]:![X4]:(status(X3,X4,X1)&(isa(X1,X2)&((nota(X1,X2)|nevera(X1,X2))|xora(X1,X2)))),inference(fof_nnf,[status(thm)],[15])).
% fof(115, negated_conjecture,?[X1]:(![X3]:![X4]:status(X3,X4,X1)&?[X2]:(isa(X1,X2)&((nota(X1,X2)|nevera(X1,X2))|xora(X1,X2)))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, negated_conjecture,?[X5]:(![X6]:![X7]:status(X6,X7,X5)&?[X8]:(isa(X5,X8)&((nota(X5,X8)|nevera(X5,X8))|xora(X5,X8)))),inference(variable_rename,[status(thm)],[115])).
% fof(117, negated_conjecture,(![X6]:![X7]:status(X6,X7,esk30_0)&(isa(esk30_0,esk31_0)&((nota(esk30_0,esk31_0)|nevera(esk30_0,esk31_0))|xora(esk30_0,esk31_0)))),inference(skolemize,[status(esa)],[116])).
% fof(118, negated_conjecture,![X6]:![X7]:(status(X6,X7,esk30_0)&(isa(esk30_0,esk31_0)&((nota(esk30_0,esk31_0)|nevera(esk30_0,esk31_0))|xora(esk30_0,esk31_0)))),inference(shift_quantors,[status(thm)],[117])).
% cnf(119,negated_conjecture,(xora(esk30_0,esk31_0)|nevera(esk30_0,esk31_0)|nota(esk30_0,esk31_0)),inference(split_conjunct,[status(thm)],[118])).
% cnf(120,negated_conjecture,(isa(esk30_0,esk31_0)),inference(split_conjunct,[status(thm)],[118])).
% cnf(121,negated_conjecture,(status(X1,X2,esk30_0)),inference(split_conjunct,[status(thm)],[118])).
% cnf(123,negated_conjecture,(status(X1,X2,X3)|~isa(esk30_0,X3)),inference(spm,[status(thm)],[32,121,theory(equality)])).
% cnf(124,negated_conjecture,(~nevera(esk30_0,X1)|~status(X2,X3,X1)),inference(spm,[status(thm)],[50,121,theory(equality)])).
% cnf(167,negated_conjecture,(status(X1,X2,esk31_0)),inference(spm,[status(thm)],[123,120,theory(equality)])).
% cnf(187,negated_conjecture,(~nota(X1,esk31_0)),inference(spm,[status(thm)],[41,167,theory(equality)])).
% cnf(190,negated_conjecture,(~xora(X1,esk31_0)|~status(X2,X3,X1)),inference(spm,[status(thm)],[60,167,theory(equality)])).
% cnf(204,negated_conjecture,(xora(esk30_0,esk31_0)|nevera(esk30_0,esk31_0)),inference(sr,[status(thm)],[119,187,theory(equality)])).
% cnf(206,negated_conjecture,(xora(esk30_0,esk31_0)|~status(X1,X2,esk31_0)),inference(spm,[status(thm)],[124,204,theory(equality)])).
% cnf(207,negated_conjecture,(xora(esk30_0,esk31_0)|$false),inference(rw,[status(thm)],[206,167,theory(equality)])).
% cnf(208,negated_conjecture,(xora(esk30_0,esk31_0)),inference(cn,[status(thm)],[207,theory(equality)])).
% cnf(214,negated_conjecture,(~status(X1,X2,esk30_0)),inference(spm,[status(thm)],[190,208,theory(equality)])).
% cnf(215,negated_conjecture,($false),inference(rw,[status(thm)],[214,121,theory(equality)])).
% cnf(216,negated_conjecture,($false),inference(cn,[status(thm)],[215,theory(equality)])).
% cnf(217,negated_conjecture,($false),216,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.01 CPU 0.08 WC
% FINAL PrfWatch: 0.01 CPU 0.08 WC
% SZS output end Solution for /tmp/SystemOnTPTP20172/KRS180+1.tptp
%
%------------------------------------------------------------------------------