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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KRS196+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 : franklin.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:47:34 EDT 2012

% Result   : Theorem 1.93s
% Output   : Solution 1.93s
% 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/SystemOnTPTP14255/KRS196+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14255/KRS196+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14255/KRS196+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 14353
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNFNFFMM21LS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHNFNFFMM21LS
% # Auto-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% # and selection function SelectNewComplexAHP.
% #
% # No equality, disabling AC handling.
% #
% # Initializing proof state
% # Proof found!
% # SZS status Theorem
% # Parsed axioms                      : 33
% # Removed by relevancy pruning       : 0
% # Initial clauses                    : 109
% # Removed in clause preprocessing    : 0
% # Initial clauses in saturation      : 109
% # Processed clauses                  : 4015
% # ...of these trivial                : 518
% # ...subsumed                        : 831
% # ...remaining for further processing: 2666
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 3
% # Backward-rewritten                 : 12
% # Generated clauses                  : 66473
% # ...of the previous two non-trivial : 53730
% # Contextual simplify-reflections    : 34
% # Paramodulations                    : 66307
% # Factorizations                     : 166
% # Equation resolutions               : 0
% # Current number of processed clauses: 2651
% #    Positive orientable unit clauses: 634
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 307
% #    Non-unit-clauses                : 1710
% # Current number of unprocessed clauses: 47987
% # ...number of literals in the above : 193546
% # Clause-clause subsumption calls (NU) : 359493
% # Rec. Clause-clause subsumption calls : 253686
% # Non-unit clause-clause subsumptions: 643
% # Unit Clause-clause subsumption calls : 115119
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 699
% # BW rewrite match successes         : 15
% # Backwards rewriting index :  8099 nodes,  1647 leaves,   1.56+/-3.042 terms/leaf
% # Paramod-from index      :  3662 nodes,   782 leaves,   1.18+/-1.183 terms/leaf
% # Paramod-into index      :  6329 nodes,  1253 leaves,   1.13+/-0.952 terms/leaf
% # Paramod-neg-atom index  :  1522 nodes,   326 leaves,   2.24+/-3.042 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,![X3]:![X4]:(![X5]:(model(X5,X3)=>model(X5,X4))<=>status(X3,X4,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(3, axiom,![X3]:![X4]:(((~(?[X5]:model(X5,X3))&?[X6]:model(X6,X4))&?[X7]:~(model(X7,X4)))<=>status(X3,X4,wca)),file('/tmp/SRASS.s.p', wca)).
% fof(33, conjecture,isa(wca,thm),file('/tmp/SRASS.s.p', isa_wca_thm)).
% fof(34, negated_conjecture,~(isa(wca,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(35, plain,![X3]:![X4]:(((~(?[X5]:model(X5,X3))&?[X6]:model(X6,X4))&?[X7]:~(model(X7,X4)))<=>status(X3,X4,wca)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(50, negated_conjecture,~(isa(wca,thm)),inference(fof_simplification,[status(thm)],[34,theory(equality)])).
% fof(51, 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(52, 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)],[51])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% fof(55, 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)],[54])).
% fof(56, 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)],[55])).
% cnf(58,plain,(isa(X1,X2)|~status(esk1_2(X1,X2),esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[56])).
% cnf(59,plain,(isa(X1,X2)|status(esk1_2(X1,X2),esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(60, plain,![X3]:![X4]:((?[X5]:(model(X5,X3)&~(model(X5,X4)))|status(X3,X4,thm))&(~(status(X3,X4,thm))|![X5]:(~(model(X5,X3))|model(X5,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(61, plain,(![X3]:![X4]:(?[X5]:(model(X5,X3)&~(model(X5,X4)))|status(X3,X4,thm))&![X3]:![X4]:(~(status(X3,X4,thm))|![X5]:(~(model(X5,X3))|model(X5,X4)))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,(![X6]:![X7]:(?[X8]:(model(X8,X6)&~(model(X8,X7)))|status(X6,X7,thm))&![X9]:![X10]:(~(status(X9,X10,thm))|![X11]:(~(model(X11,X9))|model(X11,X10)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,(![X6]:![X7]:((model(esk3_2(X6,X7),X6)&~(model(esk3_2(X6,X7),X7)))|status(X6,X7,thm))&![X9]:![X10]:(~(status(X9,X10,thm))|![X11]:(~(model(X11,X9))|model(X11,X10)))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((model(esk3_2(X6,X7),X6)&~(model(esk3_2(X6,X7),X7)))|status(X6,X7,thm))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((model(esk3_2(X6,X7),X6)|status(X6,X7,thm))&(~(model(esk3_2(X6,X7),X7))|status(X6,X7,thm)))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(distribute,[status(thm)],[64])).
% cnf(68,plain,(status(X1,X2,thm)|model(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, plain,![X3]:![X4]:((((?[X5]:model(X5,X3)|![X6]:~(model(X6,X4)))|![X7]:model(X7,X4))|status(X3,X4,wca))&(~(status(X3,X4,wca))|((![X5]:~(model(X5,X3))&?[X6]:model(X6,X4))&?[X7]:~(model(X7,X4))))),inference(fof_nnf,[status(thm)],[35])).
% fof(70, plain,(![X3]:![X4]:(((?[X5]:model(X5,X3)|![X6]:~(model(X6,X4)))|![X7]:model(X7,X4))|status(X3,X4,wca))&![X3]:![X4]:(~(status(X3,X4,wca))|((![X5]:~(model(X5,X3))&?[X6]:model(X6,X4))&?[X7]:~(model(X7,X4))))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,(![X8]:![X9]:(((?[X10]:model(X10,X8)|![X11]:~(model(X11,X9)))|![X12]:model(X12,X9))|status(X8,X9,wca))&![X13]:![X14]:(~(status(X13,X14,wca))|((![X15]:~(model(X15,X13))&?[X16]:model(X16,X14))&?[X17]:~(model(X17,X14))))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,(![X8]:![X9]:(((model(esk4_2(X8,X9),X8)|![X11]:~(model(X11,X9)))|![X12]:model(X12,X9))|status(X8,X9,wca))&![X13]:![X14]:(~(status(X13,X14,wca))|((![X15]:~(model(X15,X13))&model(esk5_2(X13,X14),X14))&~(model(esk6_2(X13,X14),X14))))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X8]:![X9]:![X11]:![X12]:![X13]:![X14]:![X15]:((((model(esk4_2(X8,X9),X8)|~(model(X11,X9)))|model(X12,X9))|status(X8,X9,wca))&(~(status(X13,X14,wca))|((~(model(X15,X13))&model(esk5_2(X13,X14),X14))&~(model(esk6_2(X13,X14),X14))))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X8]:![X9]:![X11]:![X12]:![X13]:![X14]:![X15]:((((model(esk4_2(X8,X9),X8)|~(model(X11,X9)))|model(X12,X9))|status(X8,X9,wca))&(((~(model(X15,X13))|~(status(X13,X14,wca)))&(model(esk5_2(X13,X14),X14)|~(status(X13,X14,wca))))&(~(model(esk6_2(X13,X14),X14))|~(status(X13,X14,wca))))),inference(distribute,[status(thm)],[73])).
% cnf(77,plain,(~status(X1,X2,wca)|~model(X3,X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(325,negated_conjecture,(~isa(wca,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(436,plain,(isa(wca,X2)|~model(X1,esk1_2(wca,X2))),inference(spm,[status(thm)],[77,59,theory(equality)])).
% cnf(786,plain,(isa(wca,X1)|status(esk1_2(wca,X1),X2,thm)),inference(spm,[status(thm)],[436,68,theory(equality)])).
% cnf(82718,plain,(isa(wca,thm)),inference(spm,[status(thm)],[58,786,theory(equality)])).
% cnf(82741,plain,($false),inference(sr,[status(thm)],[82718,325,theory(equality)])).
% cnf(82742,plain,($false),82741,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 1.65 CPU 1.09 WC
% FINAL PrfWatch: 1.65 CPU 1.09 WC
% SZS output end Solution for /tmp/SystemOnTPTP14255/KRS196+1.tptp
% 
%------------------------------------------------------------------------------