TSTP Solution File: KRS179+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS179+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 : nashville.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:43 EDT 2012
% Result : Theorem 0.40s
% Output : Solution 0.40s
% 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/SystemOnTPTP18655/KRS179+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18655/KRS179+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18655/KRS179+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 18753
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNFNFFMM21MS
% # 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 GHNFNFFMM21MS
% # 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 : 14
% # Removed by relevancy pruning : 0
% # Initial clauses : 38
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 38
% # Processed clauses : 1200
% # ...of these trivial : 0
% # ...subsumed : 795
% # ...remaining for further processing: 405
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 0
% # Generated clauses : 4951
% # ...of the previous two non-trivial : 4890
% # Contextual simplify-reflections : 587
% # Paramodulations : 4917
% # Factorizations : 34
% # Equation resolutions : 0
% # Current number of processed clauses: 398
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 380
% # Current number of unprocessed clauses: 3680
% # ...number of literals in the above : 15502
% # Clause-clause subsumption calls (NU) : 55387
% # Rec. Clause-clause subsumption calls : 44499
% # Non-unit clause-clause subsumptions: 1389
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 5
% # BW rewrite match successes : 0
% # Backwards rewriting index : 739 nodes, 125 leaves, 2.12+/-2.613 terms/leaf
% # Paramod-from index : 272 nodes, 50 leaves, 2.00+/-2.514 terms/leaf
% # Paramod-into index : 588 nodes, 98 leaves, 1.80+/-2.060 terms/leaf
% # Paramod-neg-atom index : 233 nodes, 42 leaves, 1.98+/-2.262 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(14, conjecture,![X1]:![X2]:![X11]:((isa(X1,X2)&isa(X2,X11))=>isa(X1,X11)),file('/tmp/SRASS.s.p', isa_transitive)).
% fof(15, negated_conjecture,~(![X1]:![X2]:![X11]:((isa(X1,X2)&isa(X2,X11))=>isa(X1,X11))),inference(assume_negation,[status(cth)],[14])).
% 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])).
% cnf(33,plain,(isa(X1,X2)|~status(esk1_2(X1,X2),esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,plain,(isa(X1,X2)|status(esk1_2(X1,X2),esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(114, negated_conjecture,?[X1]:?[X2]:?[X11]:((isa(X1,X2)&isa(X2,X11))&~(isa(X1,X11))),inference(fof_nnf,[status(thm)],[15])).
% fof(115, negated_conjecture,?[X12]:?[X13]:?[X14]:((isa(X12,X13)&isa(X13,X14))&~(isa(X12,X14))),inference(variable_rename,[status(thm)],[114])).
% fof(116, negated_conjecture,((isa(esk30_0,esk31_0)&isa(esk31_0,esk32_0))&~(isa(esk30_0,esk32_0))),inference(skolemize,[status(esa)],[115])).
% cnf(117,negated_conjecture,(~isa(esk30_0,esk32_0)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,negated_conjecture,(isa(esk31_0,esk32_0)),inference(split_conjunct,[status(thm)],[116])).
% cnf(119,negated_conjecture,(isa(esk30_0,esk31_0)),inference(split_conjunct,[status(thm)],[116])).
% cnf(125,plain,(status(esk1_2(X1,X2),esk2_2(X1,X2),X3)|isa(X1,X2)|~isa(X1,X3)),inference(spm,[status(thm)],[32,34,theory(equality)])).
% cnf(144,negated_conjecture,(isa(esk30_0,X1)|status(esk1_2(esk30_0,X1),esk2_2(esk30_0,X1),esk31_0)),inference(spm,[status(thm)],[125,119,theory(equality)])).
% cnf(370,negated_conjecture,(status(esk1_2(esk30_0,X1),esk2_2(esk30_0,X1),X2)|isa(esk30_0,X1)|~isa(esk31_0,X2)),inference(spm,[status(thm)],[32,144,theory(equality)])).
% cnf(390,negated_conjecture,(isa(esk30_0,X1)|status(esk1_2(esk30_0,X1),esk2_2(esk30_0,X1),esk32_0)),inference(spm,[status(thm)],[370,118,theory(equality)])).
% cnf(5655,negated_conjecture,(isa(esk30_0,esk32_0)),inference(spm,[status(thm)],[33,390,theory(equality)])).
% cnf(5663,negated_conjecture,($false),inference(sr,[status(thm)],[5655,117,theory(equality)])).
% cnf(5664,negated_conjecture,($false),5663,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.14 CPU 0.15 WC
% FINAL PrfWatch: 0.14 CPU 0.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP18655/KRS179+1.tptp
%
%------------------------------------------------------------------------------