%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KRS264+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 : glasgow.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:58:17 EDT 2012

% Result   : Theorem 74.63s
% Output   : Solution 74.69s
% 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/SystemOnTPTP28639/KRS264+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% WARNING: TreeLimitedRun lost 57.93s, total lost is 57.93s
% not found
% Adding ~C to TBU       ... ~mighta_wth_thm:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... mighta:
%  CSA axiom mighta found
% Looking for CSA axiom ... thm:
%  CSA axiom thm found
% Looking for CSA axiom ... wth: CSA axiom wth found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... tautology:
%  CSA axiom tautology found
% Looking for CSA axiom ... satisfiable: CSA axiom satisfiable found
% Looking for CSA axiom ... contradiction:
%  CSA axiom contradiction found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... sat_non_taut_pair:
% mixed_pair:
%  CSA axiom mixed_pair found
% Looking for CSA axiom ... non_thm_spt:
% unp:
%  CSA axiom unp found
% Looking for CSA axiom ... sap:
%  CSA axiom sap found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :sap:unp:mixed_pair:contradiction:satisfiable:tautology:wth:thm:mighta (9)
% Unselected axioms are ... :sat_non_taut_pair:non_thm_spt:esa:sat:eqv:tac:wec:eth:tau:wtc:cax:sca:tca:wca:isa:nota:nevera:xora:csa:uns:noc:completeness:not (23)
% SZS status THM for /tmp/SystemOnTPTP28639/KRS264+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP28639/KRS264+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=600 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 30547
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNFNFFMS22MS
% # 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 GHNFNFFMS22MS
% # 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                      : 10
% # Removed by relevancy pruning       : 0
% # Initial clauses                    : 29
% # Removed in clause preprocessing    : 0
% # Initial clauses in saturation      : 29
% # Processed clauses                  : 446
% # ...of these trivial                : 25
% # ...subsumed                        : 173
% # ...remaining for further processing: 248
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 12
% # Backward-rewritten                 : 4
% # Generated clauses                  : 2780
% # ...of the previous two non-trivial : 985
% # Contextual simplify-reflections    : 30
% # Paramodulations                    : 2774
% # Factorizations                     : 6
% # Equation resolutions               : 0
% # Current number of processed clauses: 232
% #    Positive orientable unit clauses: 29
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 20
% #    Non-unit-clauses                : 183
% # Current number of unprocessed clauses: 397
% # ...number of literals in the above : 1623
% # Clause-clause subsumption calls (NU) : 3470
% # Rec. Clause-clause subsumption calls : 2237
% # Non-unit clause-clause subsumptions: 187
% # Unit Clause-clause subsumption calls : 668
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 155
% # BW rewrite match successes         : 6
% # Backwards rewriting index :   887 nodes,   178 leaves,   1.78+/-2.584 terms/leaf
% # Paramod-from index      :   310 nodes,    64 leaves,   1.23+/-1.142 terms/leaf
% # Paramod-into index      :   632 nodes,   119 leaves,   1.24+/-0.968 terms/leaf
% # Paramod-neg-atom index  :   280 nodes,    58 leaves,   1.79+/-2.490 terms/leaf
% # SZS output start CNFRefutation.
% fof(3, axiom,?[X1]:?[X2]:(((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)=>model(X4,X2)))&?[X5]:(~(model(X5,X1))&model(X5,X2)))&?[X6]:~(model(X6,X2))),file('/tmp/SRASS.s.p', mixed_pair)).
% fof(7, axiom,![X1]:![X2]:((((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)=>model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1))))&?[X6]:~(model(X6,X2)))<=>status(X1,X2,wth)),file('/tmp/SRASS.s.p', wth)).
% fof(8, axiom,![X1]:![X2]:(![X3]:(model(X3,X1)=>model(X3,X2))<=>status(X1,X2,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(9, axiom,![X9]:![X10]:(?[X1]:?[X2]:(status(X1,X2,X9)&status(X1,X2,X10))<=>mighta(X9,X10)),file('/tmp/SRASS.s.p', mighta)).
% fof(10, conjecture,mighta(wth,thm),file('/tmp/SRASS.s.p', mighta_wth_thm)).
% fof(11, negated_conjecture,~(mighta(wth,thm)),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,?[X1]:?[X2]:(((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)=>model(X4,X2)))&?[X5]:(~(model(X5,X1))&model(X5,X2)))&?[X6]:~(model(X6,X2))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(15, plain,![X1]:![X2]:((((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)=>model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1))))&?[X6]:~(model(X6,X2)))<=>status(X1,X2,wth)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(16, negated_conjecture,~(mighta(wth,thm)),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(35, plain,?[X1]:?[X2]:(((?[X3]:model(X3,X1)&![X4]:(~(model(X4,X1))|model(X4,X2)))&?[X5]:(~(model(X5,X1))&model(X5,X2)))&?[X6]:~(model(X6,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(36, plain,?[X7]:?[X8]:(((?[X9]:model(X9,X7)&![X10]:(~(model(X10,X7))|model(X10,X8)))&?[X11]:(~(model(X11,X7))&model(X11,X8)))&?[X12]:~(model(X12,X8))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,(((model(esk7_0,esk5_0)&![X10]:(~(model(X10,esk5_0))|model(X10,esk6_0)))&(~(model(esk8_0,esk5_0))&model(esk8_0,esk6_0)))&~(model(esk9_0,esk6_0))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X10]:(((model(esk7_0,esk5_0)&(~(model(X10,esk5_0))|model(X10,esk6_0)))&(~(model(esk8_0,esk5_0))&model(esk8_0,esk6_0)))&~(model(esk9_0,esk6_0))),inference(shift_quantors,[status(thm)],[37])).
% cnf(39,plain,(~model(esk9_0,esk6_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(model(esk8_0,esk6_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(41,plain,(~model(esk8_0,esk5_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(42,plain,(model(X1,esk6_0)|~model(X1,esk5_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(43,plain,(model(esk7_0,esk5_0)),inference(split_conjunct,[status(thm)],[38])).
% fof(54, plain,![X1]:![X2]:(((((![X3]:~(model(X3,X1))|?[X4]:(model(X4,X1)&~(model(X4,X2))))|![X5]:(~(model(X5,X2))|model(X5,X1)))|![X6]:model(X6,X2))|status(X1,X2,wth))&(~(status(X1,X2,wth))|(((?[X3]:model(X3,X1)&![X4]:(~(model(X4,X1))|model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1))))&?[X6]:~(model(X6,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(55, plain,(![X1]:![X2]:((((![X3]:~(model(X3,X1))|?[X4]:(model(X4,X1)&~(model(X4,X2))))|![X5]:(~(model(X5,X2))|model(X5,X1)))|![X6]:model(X6,X2))|status(X1,X2,wth))&![X1]:![X2]:(~(status(X1,X2,wth))|(((?[X3]:model(X3,X1)&![X4]:(~(model(X4,X1))|model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1))))&?[X6]:~(model(X6,X2))))),inference(shift_quantors,[status(thm)],[54])).
% fof(56, plain,(![X7]:![X8]:((((![X9]:~(model(X9,X7))|?[X10]:(model(X10,X7)&~(model(X10,X8))))|![X11]:(~(model(X11,X8))|model(X11,X7)))|![X12]:model(X12,X8))|status(X7,X8,wth))&![X13]:![X14]:(~(status(X13,X14,wth))|(((?[X15]:model(X15,X13)&![X16]:(~(model(X16,X13))|model(X16,X14)))&?[X17]:(model(X17,X14)&~(model(X17,X13))))&?[X18]:~(model(X18,X14))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,(![X7]:![X8]:((((![X9]:~(model(X9,X7))|(model(esk15_2(X7,X8),X7)&~(model(esk15_2(X7,X8),X8))))|![X11]:(~(model(X11,X8))|model(X11,X7)))|![X12]:model(X12,X8))|status(X7,X8,wth))&![X13]:![X14]:(~(status(X13,X14,wth))|(((model(esk16_2(X13,X14),X13)&![X16]:(~(model(X16,X13))|model(X16,X14)))&(model(esk17_2(X13,X14),X14)&~(model(esk17_2(X13,X14),X13))))&~(model(esk18_2(X13,X14),X14))))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X7]:![X8]:![X9]:![X11]:![X12]:![X13]:![X14]:![X16]:(((((~(model(X9,X7))|(model(esk15_2(X7,X8),X7)&~(model(esk15_2(X7,X8),X8))))|(~(model(X11,X8))|model(X11,X7)))|model(X12,X8))|status(X7,X8,wth))&(~(status(X13,X14,wth))|(((model(esk16_2(X13,X14),X13)&(~(model(X16,X13))|model(X16,X14)))&(model(esk17_2(X13,X14),X14)&~(model(esk17_2(X13,X14),X13))))&~(model(esk18_2(X13,X14),X14))))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,![X7]:![X8]:![X9]:![X11]:![X12]:![X13]:![X14]:![X16]:((((((model(esk15_2(X7,X8),X7)|~(model(X9,X7)))|(~(model(X11,X8))|model(X11,X7)))|model(X12,X8))|status(X7,X8,wth))&((((~(model(esk15_2(X7,X8),X8))|~(model(X9,X7)))|(~(model(X11,X8))|model(X11,X7)))|model(X12,X8))|status(X7,X8,wth)))&((((model(esk16_2(X13,X14),X13)|~(status(X13,X14,wth)))&((~(model(X16,X13))|model(X16,X14))|~(status(X13,X14,wth))))&((model(esk17_2(X13,X14),X14)|~(status(X13,X14,wth)))&(~(model(esk17_2(X13,X14),X13))|~(status(X13,X14,wth)))))&(~(model(esk18_2(X13,X14),X14))|~(status(X13,X14,wth))))),inference(distribute,[status(thm)],[58])).
% cnf(65,plain,(status(X1,X2,wth)|model(X3,X2)|model(X4,X1)|~model(X4,X2)|~model(X5,X1)|~model(esk15_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[59])).
% cnf(66,plain,(status(X1,X2,wth)|model(X3,X2)|model(X4,X1)|model(esk15_2(X1,X2),X1)|~model(X4,X2)|~model(X5,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(67, plain,![X1]:![X2]:((?[X3]:(model(X3,X1)&~(model(X3,X2)))|status(X1,X2,thm))&(~(status(X1,X2,thm))|![X3]:(~(model(X3,X1))|model(X3,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(68, plain,(![X1]:![X2]:(?[X3]:(model(X3,X1)&~(model(X3,X2)))|status(X1,X2,thm))&![X1]:![X2]:(~(status(X1,X2,thm))|![X3]:(~(model(X3,X1))|model(X3,X2)))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,(![X4]:![X5]:(?[X6]:(model(X6,X4)&~(model(X6,X5)))|status(X4,X5,thm))&![X7]:![X8]:(~(status(X7,X8,thm))|![X9]:(~(model(X9,X7))|model(X9,X8)))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,(![X4]:![X5]:((model(esk19_2(X4,X5),X4)&~(model(esk19_2(X4,X5),X5)))|status(X4,X5,thm))&![X7]:![X8]:(~(status(X7,X8,thm))|![X9]:(~(model(X9,X7))|model(X9,X8)))),inference(skolemize,[status(esa)],[69])).
% fof(71, plain,![X4]:![X5]:![X7]:![X8]:![X9]:(((model(esk19_2(X4,X5),X4)&~(model(esk19_2(X4,X5),X5)))|status(X4,X5,thm))&(~(status(X7,X8,thm))|(~(model(X9,X7))|model(X9,X8)))),inference(shift_quantors,[status(thm)],[70])).
% fof(72, plain,![X4]:![X5]:![X7]:![X8]:![X9]:(((model(esk19_2(X4,X5),X4)|status(X4,X5,thm))&(~(model(esk19_2(X4,X5),X5))|status(X4,X5,thm)))&(~(status(X7,X8,thm))|(~(model(X9,X7))|model(X9,X8)))),inference(distribute,[status(thm)],[71])).
% cnf(74,plain,(status(X1,X2,thm)|~model(esk19_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[72])).
% cnf(75,plain,(status(X1,X2,thm)|model(esk19_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(76, plain,![X9]:![X10]:((![X1]:![X2]:(~(status(X1,X2,X9))|~(status(X1,X2,X10)))|mighta(X9,X10))&(~(mighta(X9,X10))|?[X1]:?[X2]:(status(X1,X2,X9)&status(X1,X2,X10)))),inference(fof_nnf,[status(thm)],[9])).
% fof(77, plain,(![X9]:![X10]:(![X1]:![X2]:(~(status(X1,X2,X9))|~(status(X1,X2,X10)))|mighta(X9,X10))&![X9]:![X10]:(~(mighta(X9,X10))|?[X1]:?[X2]:(status(X1,X2,X9)&status(X1,X2,X10)))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, plain,(![X11]:![X12]:(![X13]:![X14]:(~(status(X13,X14,X11))|~(status(X13,X14,X12)))|mighta(X11,X12))&![X15]:![X16]:(~(mighta(X15,X16))|?[X17]:?[X18]:(status(X17,X18,X15)&status(X17,X18,X16)))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,(![X11]:![X12]:(![X13]:![X14]:(~(status(X13,X14,X11))|~(status(X13,X14,X12)))|mighta(X11,X12))&![X15]:![X16]:(~(mighta(X15,X16))|(status(esk20_2(X15,X16),esk21_2(X15,X16),X15)&status(esk20_2(X15,X16),esk21_2(X15,X16),X16)))),inference(skolemize,[status(esa)],[78])).
% fof(80, plain,![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:(((~(status(X13,X14,X11))|~(status(X13,X14,X12)))|mighta(X11,X12))&(~(mighta(X15,X16))|(status(esk20_2(X15,X16),esk21_2(X15,X16),X15)&status(esk20_2(X15,X16),esk21_2(X15,X16),X16)))),inference(shift_quantors,[status(thm)],[79])).
% fof(81, plain,![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:(((~(status(X13,X14,X11))|~(status(X13,X14,X12)))|mighta(X11,X12))&((status(esk20_2(X15,X16),esk21_2(X15,X16),X15)|~(mighta(X15,X16)))&(status(esk20_2(X15,X16),esk21_2(X15,X16),X16)|~(mighta(X15,X16))))),inference(distribute,[status(thm)],[80])).
% cnf(84,plain,(mighta(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1)),inference(split_conjunct,[status(thm)],[81])).
% cnf(85,negated_conjecture,(~mighta(wth,thm)),inference(split_conjunct,[status(thm)],[16])).
% cnf(89,plain,(status(X1,esk6_0,thm)|~model(esk19_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[74,42,theory(equality)])).
% cnf(151,plain,(status(esk5_0,X1,wth)|model(esk15_2(esk5_0,X1),esk5_0)|model(X2,X1)|model(X3,esk5_0)|~model(X3,X1)),inference(spm,[status(thm)],[66,43,theory(equality)])).
% cnf(160,plain,(status(X1,esk6_0,wth)|model(X2,esk6_0)|model(X3,X1)|~model(X4,X1)|~model(X3,esk6_0)|~model(esk15_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[65,42,theory(equality)])).
% cnf(172,plain,(status(esk5_0,esk6_0,thm)),inference(spm,[status(thm)],[89,75,theory(equality)])).
% cnf(174,plain,(mighta(X1,thm)|~status(esk5_0,esk6_0,X1)),inference(spm,[status(thm)],[84,172,theory(equality)])).
% cnf(175,negated_conjecture,(~status(esk5_0,esk6_0,wth)),inference(spm,[status(thm)],[85,174,theory(equality)])).
% cnf(4459,plain,(status(esk5_0,esk6_0,wth)|model(esk15_2(esk5_0,esk6_0),esk5_0)|model(esk8_0,esk5_0)|model(X1,esk6_0)),inference(spm,[status(thm)],[151,40,theory(equality)])).
% cnf(4485,plain,(model(esk15_2(esk5_0,esk6_0),esk5_0)|model(esk8_0,esk5_0)|model(X1,esk6_0)),inference(sr,[status(thm)],[4459,175,theory(equality)])).
% cnf(4486,plain,(model(esk15_2(esk5_0,esk6_0),esk5_0)|model(X1,esk6_0)),inference(sr,[status(thm)],[4485,41,theory(equality)])).
% cnf(4944,plain,(status(esk5_0,esk6_0,wth)|model(X1,esk6_0)|model(X2,esk5_0)|model(X4,esk6_0)|~model(X2,esk6_0)|~model(X3,esk5_0)),inference(spm,[status(thm)],[160,4486,theory(equality)])).
% cnf(4946,plain,(model(X1,esk6_0)|model(X2,esk5_0)|model(X4,esk6_0)|~model(X2,esk6_0)|~model(X3,esk5_0)),inference(sr,[status(thm)],[4944,175,theory(equality)])).
% cnf(4953,plain,(model(X1,esk6_0)|model(esk8_0,esk5_0)|model(X2,esk6_0)|~model(X3,esk5_0)),inference(spm,[status(thm)],[4946,40,theory(equality)])).
% cnf(4968,plain,(model(X1,esk6_0)|model(X2,esk6_0)|~model(X3,esk5_0)),inference(sr,[status(thm)],[4953,41,theory(equality)])).
% cnf(4990,plain,(model(X1,esk6_0)|model(X2,esk6_0)),inference(spm,[status(thm)],[4968,43,theory(equality)])).
% cnf(5020,plain,(model(X3,esk6_0)),inference(ef,[status(thm)],[4990,theory(equality)])).
% cnf(5080,plain,($false),inference(rw,[status(thm)],[39,5020,theory(equality)])).
% cnf(5081,plain,($false),inference(cn,[status(thm)],[5080,theory(equality)])).
% cnf(5082,plain,($false),5081,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.07 CPU 0.09 WC
% FINAL PrfWatch: 0.07 CPU 0.09 WC
% SZS output end Solution for /tmp/SystemOnTPTP28639/KRS264+1.tptp
% 
%------------------------------------------------------------------------------