TSTP Solution File: MGT008+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT008+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 16:03:05 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP556/MGT008+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP556/MGT008+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP556/MGT008+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 652
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((((((((organization(X1,X8)&organization(X2,X9))&class(X1,X3,X8))&class(X2,X3,X9))&size(X1,X4,X8))&size(X2,X5,X9))&inertia(X1,X6,X8))&inertia(X2,X7,X9))&greater(X5,X4))=>greater(X7,X6)),file('/tmp/SRASS.s.p', a5_FOL)).
% fof(2, axiom,![X1]:![X2]:![X8]:![X9]:![X6]:![X7]:![X10]:![X11]:(((((((((organization(X1,X8)&organization(X2,X9))&reorganization_free(X1,X8,X8))&reorganization_free(X2,X9,X9))&inertia(X1,X6,X8))&inertia(X2,X7,X9))&survival_chance(X1,X10,X8))&survival_chance(X2,X11,X9))&greater(X7,X6))=>greater(X11,X10)),file('/tmp/SRASS.s.p', t1_FOL)).
% fof(3, axiom,![X1]:![X12]:(organization(X1,X12)=>?[X13]:inertia(X1,X13,X12)),file('/tmp/SRASS.s.p', mp5)).
% fof(4, conjecture,![X1]:![X2]:![X3]:![X10]:![X11]:![X4]:![X5]:![X8]:![X9]:(((((((((((organization(X1,X8)&organization(X2,X9))&reorganization_free(X1,X8,X8))&reorganization_free(X2,X9,X9))&class(X1,X3,X8))&class(X2,X3,X9))&survival_chance(X1,X10,X8))&survival_chance(X2,X11,X9))&size(X1,X4,X8))&size(X2,X5,X9))&greater(X5,X4))=>greater(X11,X10)),file('/tmp/SRASS.s.p', t8_FOL)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X3]:![X10]:![X11]:![X4]:![X5]:![X8]:![X9]:(((((((((((organization(X1,X8)&organization(X2,X9))&reorganization_free(X1,X8,X8))&reorganization_free(X2,X9,X9))&class(X1,X3,X8))&class(X2,X3,X9))&survival_chance(X1,X10,X8))&survival_chance(X2,X11,X9))&size(X1,X4,X8))&size(X2,X5,X9))&greater(X5,X4))=>greater(X11,X10))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((((((((~(organization(X1,X8))|~(organization(X2,X9)))|~(class(X1,X3,X8)))|~(class(X2,X3,X9)))|~(size(X1,X4,X8)))|~(size(X2,X5,X9)))|~(inertia(X1,X6,X8)))|~(inertia(X2,X7,X9)))|~(greater(X5,X4)))|greater(X7,X6)),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:(((((((((~(organization(X10,X17))|~(organization(X11,X18)))|~(class(X10,X12,X17)))|~(class(X11,X12,X18)))|~(size(X10,X13,X17)))|~(size(X11,X14,X18)))|~(inertia(X10,X15,X17)))|~(inertia(X11,X16,X18)))|~(greater(X14,X13)))|greater(X16,X15)),inference(variable_rename,[status(thm)],[6])).
% cnf(8,plain,(greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~size(X5,X3,X6)|~size(X7,X4,X8)|~class(X5,X9,X6)|~class(X7,X9,X8)|~organization(X5,X6)|~organization(X7,X8)),inference(split_conjunct,[status(thm)],[7])).
% fof(9, plain,![X1]:![X2]:![X8]:![X9]:![X6]:![X7]:![X10]:![X11]:(((((((((~(organization(X1,X8))|~(organization(X2,X9)))|~(reorganization_free(X1,X8,X8)))|~(reorganization_free(X2,X9,X9)))|~(inertia(X1,X6,X8)))|~(inertia(X2,X7,X9)))|~(survival_chance(X1,X10,X8)))|~(survival_chance(X2,X11,X9)))|~(greater(X7,X6)))|greater(X11,X10)),inference(fof_nnf,[status(thm)],[2])).
% fof(10, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:(((((((((~(organization(X12,X14))|~(organization(X13,X15)))|~(reorganization_free(X12,X14,X14)))|~(reorganization_free(X13,X15,X15)))|~(inertia(X12,X16,X14)))|~(inertia(X13,X17,X15)))|~(survival_chance(X12,X18,X14)))|~(survival_chance(X13,X19,X15)))|~(greater(X17,X16)))|greater(X19,X18)),inference(variable_rename,[status(thm)],[9])).
% cnf(11,plain,(greater(X1,X2)|~greater(X3,X4)|~survival_chance(X5,X1,X6)|~survival_chance(X7,X2,X8)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~organization(X5,X6)|~organization(X7,X8)),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X1]:![X12]:(~(organization(X1,X12))|?[X13]:inertia(X1,X13,X12)),inference(fof_nnf,[status(thm)],[3])).
% fof(13, plain,![X14]:![X15]:(~(organization(X14,X15))|?[X16]:inertia(X14,X16,X15)),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X14]:![X15]:(~(organization(X14,X15))|inertia(X14,esk1_2(X14,X15),X15)),inference(skolemize,[status(esa)],[13])).
% cnf(15,plain,(inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X10]:?[X11]:?[X4]:?[X5]:?[X8]:?[X9]:(((((((((((organization(X1,X8)&organization(X2,X9))&reorganization_free(X1,X8,X8))&reorganization_free(X2,X9,X9))&class(X1,X3,X8))&class(X2,X3,X9))&survival_chance(X1,X10,X8))&survival_chance(X2,X11,X9))&size(X1,X4,X8))&size(X2,X5,X9))&greater(X5,X4))&~(greater(X11,X10))),inference(fof_nnf,[status(thm)],[5])).
% fof(17, negated_conjecture,?[X12]:?[X13]:?[X14]:?[X15]:?[X16]:?[X17]:?[X18]:?[X19]:?[X20]:(((((((((((organization(X12,X19)&organization(X13,X20))&reorganization_free(X12,X19,X19))&reorganization_free(X13,X20,X20))&class(X12,X14,X19))&class(X13,X14,X20))&survival_chance(X12,X15,X19))&survival_chance(X13,X16,X20))&size(X12,X17,X19))&size(X13,X18,X20))&greater(X18,X17))&~(greater(X16,X15))),inference(variable_rename,[status(thm)],[16])).
% fof(18, negated_conjecture,(((((((((((organization(esk2_0,esk9_0)&organization(esk3_0,esk10_0))&reorganization_free(esk2_0,esk9_0,esk9_0))&reorganization_free(esk3_0,esk10_0,esk10_0))&class(esk2_0,esk4_0,esk9_0))&class(esk3_0,esk4_0,esk10_0))&survival_chance(esk2_0,esk5_0,esk9_0))&survival_chance(esk3_0,esk6_0,esk10_0))&size(esk2_0,esk7_0,esk9_0))&size(esk3_0,esk8_0,esk10_0))&greater(esk8_0,esk7_0))&~(greater(esk6_0,esk5_0))),inference(skolemize,[status(esa)],[17])).
% cnf(19,negated_conjecture,(~greater(esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,negated_conjecture,(greater(esk8_0,esk7_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,negated_conjecture,(size(esk3_0,esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(22,negated_conjecture,(size(esk2_0,esk7_0,esk9_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(23,negated_conjecture,(survival_chance(esk3_0,esk6_0,esk10_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(24,negated_conjecture,(survival_chance(esk2_0,esk5_0,esk9_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(25,negated_conjecture,(class(esk3_0,esk4_0,esk10_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(26,negated_conjecture,(class(esk2_0,esk4_0,esk9_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(27,negated_conjecture,(reorganization_free(esk3_0,esk10_0,esk10_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(28,negated_conjecture,(reorganization_free(esk2_0,esk9_0,esk9_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(29,negated_conjecture,(organization(esk3_0,esk10_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(30,negated_conjecture,(organization(esk2_0,esk9_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(31,plain,(greater(X1,esk1_2(X2,X3))|~greater(X4,X5)|~inertia(X6,X1,X7)|~size(X2,X5,X3)|~size(X6,X4,X7)|~class(X2,X8,X3)|~class(X6,X8,X7)|~organization(X2,X3)|~organization(X6,X7)),inference(spm,[status(thm)],[8,15,theory(equality)])).
% cnf(33,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|~reorganization_free(esk2_0,esk9_0,esk9_0)|~reorganization_free(X2,X3,X3)|~greater(X4,X5)|~inertia(esk2_0,X5,esk9_0)|~inertia(X2,X4,X3)|~organization(esk2_0,esk9_0)|~organization(X2,X3)),inference(spm,[status(thm)],[11,24,theory(equality)])).
% cnf(37,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|$false|~reorganization_free(X2,X3,X3)|~greater(X4,X5)|~inertia(esk2_0,X5,esk9_0)|~inertia(X2,X4,X3)|~organization(esk2_0,esk9_0)|~organization(X2,X3)),inference(rw,[status(thm)],[33,28,theory(equality)])).
% cnf(38,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|$false|~reorganization_free(X2,X3,X3)|~greater(X4,X5)|~inertia(esk2_0,X5,esk9_0)|~inertia(X2,X4,X3)|$false|~organization(X2,X3)),inference(rw,[status(thm)],[37,30,theory(equality)])).
% cnf(39,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~greater(X4,X5)|~inertia(esk2_0,X5,esk9_0)|~inertia(X2,X4,X3)|~organization(X2,X3)),inference(cn,[status(thm)],[38,theory(equality)])).
% cnf(43,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~greater(X4,esk1_2(esk2_0,esk9_0))|~inertia(X2,X4,X3)|~organization(X2,X3)|~organization(esk2_0,esk9_0)),inference(spm,[status(thm)],[39,15,theory(equality)])).
% cnf(44,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~greater(X4,esk1_2(esk2_0,esk9_0))|~inertia(X2,X4,X3)|~organization(X2,X3)|$false),inference(rw,[status(thm)],[43,30,theory(equality)])).
% cnf(45,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~greater(X4,esk1_2(esk2_0,esk9_0))|~inertia(X2,X4,X3)|~organization(X2,X3)),inference(cn,[status(thm)],[44,theory(equality)])).
% cnf(46,plain,(greater(esk1_2(X1,X2),esk1_2(X3,X4))|~greater(X5,X6)|~size(X3,X6,X4)|~size(X1,X5,X2)|~class(X3,X7,X4)|~class(X1,X7,X2)|~organization(X3,X4)|~organization(X1,X2)),inference(spm,[status(thm)],[31,15,theory(equality)])).
% cnf(48,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk9_0))|~greater(X3,esk7_0)|~size(X1,X3,X2)|~class(esk2_0,X4,esk9_0)|~class(X1,X4,X2)|~organization(esk2_0,esk9_0)|~organization(X1,X2)),inference(spm,[status(thm)],[46,22,theory(equality)])).
% cnf(51,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk9_0))|~greater(X3,esk7_0)|~size(X1,X3,X2)|~class(esk2_0,X4,esk9_0)|~class(X1,X4,X2)|$false|~organization(X1,X2)),inference(rw,[status(thm)],[48,30,theory(equality)])).
% cnf(52,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk9_0))|~greater(X3,esk7_0)|~size(X1,X3,X2)|~class(esk2_0,X4,esk9_0)|~class(X1,X4,X2)|~organization(X1,X2)),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(73,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk9_0))|~greater(X3,esk7_0)|~size(X1,X3,X2)|~class(X1,esk4_0,X2)|~organization(X1,X2)),inference(spm,[status(thm)],[52,26,theory(equality)])).
% cnf(75,negated_conjecture,(greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))|~greater(esk8_0,esk7_0)|~class(esk3_0,esk4_0,esk10_0)|~organization(esk3_0,esk10_0)),inference(spm,[status(thm)],[73,21,theory(equality)])).
% cnf(77,negated_conjecture,(greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))|$false|~class(esk3_0,esk4_0,esk10_0)|~organization(esk3_0,esk10_0)),inference(rw,[status(thm)],[75,20,theory(equality)])).
% cnf(78,negated_conjecture,(greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))|$false|$false|~organization(esk3_0,esk10_0)),inference(rw,[status(thm)],[77,25,theory(equality)])).
% cnf(79,negated_conjecture,(greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))|$false|$false|$false),inference(rw,[status(thm)],[78,29,theory(equality)])).
% cnf(80,negated_conjecture,(greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(84,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~inertia(X2,esk1_2(esk3_0,esk10_0),X3)|~organization(X2,X3)),inference(spm,[status(thm)],[45,80,theory(equality)])).
% cnf(86,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(esk3_0,X1,esk10_0)|~reorganization_free(esk3_0,esk10_0,esk10_0)|~organization(esk3_0,esk10_0)),inference(spm,[status(thm)],[84,15,theory(equality)])).
% cnf(87,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(esk3_0,X1,esk10_0)|$false|~organization(esk3_0,esk10_0)),inference(rw,[status(thm)],[86,27,theory(equality)])).
% cnf(88,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(esk3_0,X1,esk10_0)|$false|$false),inference(rw,[status(thm)],[87,29,theory(equality)])).
% cnf(89,negated_conjecture,(greater(X1,esk5_0)|~survival_chance(esk3_0,X1,esk10_0)),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(90,negated_conjecture,(greater(esk6_0,esk5_0)),inference(spm,[status(thm)],[89,23,theory(equality)])).
% cnf(91,negated_conjecture,($false),inference(sr,[status(thm)],[90,19,theory(equality)])).
% cnf(92,negated_conjecture,($false),91,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 52
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 52
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 24
% # ...of the previous two non-trivial : 23
% # Contextual simplify-reflections : 0
% # Paramodulations : 24
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 37
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 11
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 61 leaves, 1.52+/-1.478 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 44 leaves, 1.05+/-0.208 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP556/MGT008+1.tptp
%
%------------------------------------------------------------------------------