TSTP Solution File: KRS195+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS195+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 : glendale.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:31 EDT 2012
% Result : Theorem 1.90s
% Output : Solution 1.90s
% 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/SystemOnTPTP30690/KRS195+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30690/KRS195+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30690/KRS195+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 30788
% 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 : 497
% # ...subsumed : 823
% # ...remaining for further processing: 2695
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 39
% # Backward-rewritten : 24
% # Generated clauses : 66781
% # ...of the previous two non-trivial : 53977
% # Contextual simplify-reflections : 34
% # Paramodulations : 66615
% # Factorizations : 166
% # Equation resolutions : 0
% # Current number of processed clauses: 2632
% # Positive orientable unit clauses: 647
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 308
% # Non-unit-clauses : 1677
% # Current number of unprocessed clauses: 47840
% # ...number of literals in the above : 193069
% # Clause-clause subsumption calls (NU) : 429212
% # Rec. Clause-clause subsumption calls : 290042
% # Non-unit clause-clause subsumptions: 623
% # Unit Clause-clause subsumption calls : 106134
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 711
% # BW rewrite match successes : 27
% # Backwards rewriting index : 8098 nodes, 1647 leaves, 1.56+/-3.043 terms/leaf
% # Paramod-from index : 3646 nodes, 779 leaves, 1.18+/-1.185 terms/leaf
% # Paramod-into index : 6313 nodes, 1250 leaves, 1.14+/-0.953 terms/leaf
% # Paramod-neg-atom index : 1524 nodes, 327 leaves, 2.24+/-3.037 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))<=>status(X3,X4,tca)),file('/tmp/SRASS.s.p', tca)).
% fof(33, conjecture,isa(tca,thm),file('/tmp/SRASS.s.p', isa_tca_thm)).
% fof(34, negated_conjecture,~(isa(tca,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(50, negated_conjecture,~(isa(tca,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)))|status(X3,X4,tca))&(~(status(X3,X4,tca))|(![X5]:~(model(X5,X3))&![X6]:model(X6,X4)))),inference(fof_nnf,[status(thm)],[3])).
% fof(70, plain,(![X3]:![X4]:((?[X5]:model(X5,X3)|?[X6]:~(model(X6,X4)))|status(X3,X4,tca))&![X3]:![X4]:(~(status(X3,X4,tca))|(![X5]:~(model(X5,X3))&![X6]:model(X6,X4)))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,(![X7]:![X8]:((?[X9]:model(X9,X7)|?[X10]:~(model(X10,X8)))|status(X7,X8,tca))&![X11]:![X12]:(~(status(X11,X12,tca))|(![X13]:~(model(X13,X11))&![X14]:model(X14,X12)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,(![X7]:![X8]:((model(esk4_2(X7,X8),X7)|~(model(esk5_2(X7,X8),X8)))|status(X7,X8,tca))&![X11]:![X12]:(~(status(X11,X12,tca))|(![X13]:~(model(X13,X11))&![X14]:model(X14,X12)))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X7]:![X8]:![X11]:![X12]:![X13]:![X14]:(((model(esk4_2(X7,X8),X7)|~(model(esk5_2(X7,X8),X8)))|status(X7,X8,tca))&(~(status(X11,X12,tca))|(~(model(X13,X11))&model(X14,X12)))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X7]:![X8]:![X11]:![X12]:![X13]:![X14]:(((model(esk4_2(X7,X8),X7)|~(model(esk5_2(X7,X8),X8)))|status(X7,X8,tca))&((~(model(X13,X11))|~(status(X11,X12,tca)))&(model(X14,X12)|~(status(X11,X12,tca))))),inference(distribute,[status(thm)],[73])).
% cnf(76,plain,(~status(X1,X2,tca)|~model(X3,X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(325,negated_conjecture,(~isa(tca,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(436,plain,(isa(tca,X2)|~model(X1,esk1_2(tca,X2))),inference(spm,[status(thm)],[76,59,theory(equality)])).
% cnf(786,plain,(isa(tca,X1)|status(esk1_2(tca,X1),X2,thm)),inference(spm,[status(thm)],[436,68,theory(equality)])).
% cnf(83078,plain,(isa(tca,thm)),inference(spm,[status(thm)],[58,786,theory(equality)])).
% cnf(83101,plain,($false),inference(sr,[status(thm)],[83078,325,theory(equality)])).
% cnf(83102,plain,($false),83101,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 1.62 CPU 1.05 WC
% FINAL PrfWatch: 1.62 CPU 1.05 WC
% SZS output end Solution for /tmp/SystemOnTPTP30690/KRS195+1.tptp
%
%------------------------------------------------------------------------------