↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KRS181+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 : monitor.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:53 EDT 2012

% Result   : Theorem 0.28s
% Output   : Solution 0.28s
% 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/SystemOnTPTP24852/KRS181+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP24852/KRS181+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24852/KRS181+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 24950
% 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                  : 209
% # ...of these trivial                : 4
% # ...subsumed                        : 45
% # ...remaining for further processing: 160
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 453
% # ...of the previous two non-trivial : 390
% # Contextual simplify-reflections    : 8
% # Paramodulations                    : 453
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 160
% #    Positive orientable unit clauses: 25
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 6
% #    Non-unit-clauses                : 129
% # Current number of unprocessed clauses: 219
% # ...number of literals in the above : 681
% # Clause-clause subsumption calls (NU) : 2429
% # Rec. Clause-clause subsumption calls : 2068
% # Non-unit clause-clause subsumptions: 53
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 11
% # BW rewrite match successes         : 0
% # Backwards rewriting index :   622 nodes,   103 leaves,   1.53+/-1.268 terms/leaf
% # Paramod-from index      :   175 nodes,    31 leaves,   1.58+/-1.212 terms/leaf
% # Paramod-into index      :   455 nodes,    73 leaves,   1.30+/-0.887 terms/leaf
% # Paramod-neg-atom index  :   210 nodes,    37 leaves,   1.51+/-1.328 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(14, conjecture,![X1]:![X2]:![X11]:((isa(X1,X2)&nota(X1,X11))=>nota(X2,X11)),file('/tmp/SRASS.s.p', nota_isa_nota)).
% fof(15, negated_conjecture,~(![X1]:![X2]:![X11]:((isa(X1,X2)&nota(X1,X11))=>nota(X2,X11))),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(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])).
% cnf(42,plain,(status(esk3_2(X1,X2),esk4_2(X1,X2),X1)|~nota(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,plain,(nota(X1,X2)|status(X3,X4,X2)|~status(X3,X4,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(114, negated_conjecture,?[X1]:?[X2]:?[X11]:((isa(X1,X2)&nota(X1,X11))&~(nota(X2,X11))),inference(fof_nnf,[status(thm)],[15])).
% fof(115, negated_conjecture,?[X12]:?[X13]:?[X14]:((isa(X12,X13)&nota(X12,X14))&~(nota(X13,X14))),inference(variable_rename,[status(thm)],[114])).
% fof(116, negated_conjecture,((isa(esk30_0,esk31_0)&nota(esk30_0,esk32_0))&~(nota(esk31_0,esk32_0))),inference(skolemize,[status(esa)],[115])).
% cnf(117,negated_conjecture,(~nota(esk31_0,esk32_0)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,negated_conjecture,(nota(esk30_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(122,negated_conjecture,(status(esk3_2(esk30_0,esk32_0),esk4_2(esk30_0,esk32_0),esk30_0)),inference(spm,[status(thm)],[42,118,theory(equality)])).
% cnf(143,negated_conjecture,(status(esk3_2(esk30_0,esk32_0),esk4_2(esk30_0,esk32_0),X1)|~isa(esk30_0,X1)),inference(spm,[status(thm)],[32,122,theory(equality)])).
% cnf(149,negated_conjecture,(status(esk3_2(esk30_0,esk32_0),esk4_2(esk30_0,esk32_0),esk31_0)),inference(spm,[status(thm)],[143,119,theory(equality)])).
% cnf(156,negated_conjecture,(nota(esk31_0,X1)|status(esk3_2(esk30_0,esk32_0),esk4_2(esk30_0,esk32_0),X1)),inference(spm,[status(thm)],[43,149,theory(equality)])).
% cnf(638,negated_conjecture,(nota(esk31_0,esk32_0)|~nota(esk30_0,esk32_0)),inference(spm,[status(thm)],[41,156,theory(equality)])).
% cnf(643,negated_conjecture,(nota(esk31_0,esk32_0)|$false),inference(rw,[status(thm)],[638,118,theory(equality)])).
% cnf(644,negated_conjecture,(nota(esk31_0,esk32_0)),inference(cn,[status(thm)],[643,theory(equality)])).
% cnf(645,negated_conjecture,($false),inference(sr,[status(thm)],[644,117,theory(equality)])).
% cnf(646,negated_conjecture,($false),645,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.02 CPU 0.06 WC
% FINAL PrfWatch: 0.02 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP24852/KRS181+1.tptp
% 
%------------------------------------------------------------------------------