TSTP Solution File: MGT018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT018+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 : art01.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:04:23 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP27126/MGT018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27126/MGT018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27126/MGT018+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 27222
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 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]:![X10]:![X3]:![X6]:![X7]:![X11]:![X12]:![X13]:((((((((((((organization(X1,X11)&organization(X2,X11))&~(organization(X2,X13)))&class(X1,X3,X11))&class(X2,X3,X11))&reorganization(X1,X11,X12))&reorganization(X2,X11,X13))&reorganization_type(X1,X10,X11))&reorganization_type(X2,X10,X11))&inertia(X1,X6,X11))&inertia(X2,X7,X11))&greater(X7,X6))=>greater(X12,X13)),file('/tmp/SRASS.s.p', a14_FOL)).
% fof(3, axiom,![X1]:![X14]:(organization(X1,X14)=>?[X15]:inertia(X1,X15,X14)),file('/tmp/SRASS.s.p', mp5)).
% fof(4, conjecture,![X1]:![X2]:![X10]:![X3]:![X4]:![X5]:![X11]:![X12]:![X13]:((((((((((((organization(X1,X11)&organization(X2,X11))&~(organization(X2,X13)))&class(X1,X3,X11))&class(X2,X3,X11))&reorganization(X1,X11,X12))&reorganization(X2,X11,X13))&reorganization_type(X1,X10,X11))&reorganization_type(X2,X10,X11))&size(X1,X4,X11))&size(X2,X5,X11))&greater(X5,X4))=>greater(X12,X13)),file('/tmp/SRASS.s.p', t18_FOL)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X10]:![X3]:![X4]:![X5]:![X11]:![X12]:![X13]:((((((((((((organization(X1,X11)&organization(X2,X11))&~(organization(X2,X13)))&class(X1,X3,X11))&class(X2,X3,X11))&reorganization(X1,X11,X12))&reorganization(X2,X11,X13))&reorganization_type(X1,X10,X11))&reorganization_type(X2,X10,X11))&size(X1,X4,X11))&size(X2,X5,X11))&greater(X5,X4))=>greater(X12,X13))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X10]:![X3]:![X6]:![X7]:![X11]:![X12]:![X13]:((((((((((((organization(X1,X11)&organization(X2,X11))&~(organization(X2,X13)))&class(X1,X3,X11))&class(X2,X3,X11))&reorganization(X1,X11,X12))&reorganization(X2,X11,X13))&reorganization_type(X1,X10,X11))&reorganization_type(X2,X10,X11))&inertia(X1,X6,X11))&inertia(X2,X7,X11))&greater(X7,X6))=>greater(X12,X13)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X10]:![X3]:![X4]:![X5]:![X11]:![X12]:![X13]:((((((((((((organization(X1,X11)&organization(X2,X11))&~(organization(X2,X13)))&class(X1,X3,X11))&class(X2,X3,X11))&reorganization(X1,X11,X12))&reorganization(X2,X11,X13))&reorganization_type(X1,X10,X11))&reorganization_type(X2,X10,X11))&size(X1,X4,X11))&size(X2,X5,X11))&greater(X5,X4))=>greater(X12,X13))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(8, 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(9, 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)],[8])).
% cnf(10,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)],[9])).
% fof(11, plain,![X1]:![X2]:![X10]:![X3]:![X6]:![X7]:![X11]:![X12]:![X13]:((((((((((((~(organization(X1,X11))|~(organization(X2,X11)))|organization(X2,X13))|~(class(X1,X3,X11)))|~(class(X2,X3,X11)))|~(reorganization(X1,X11,X12)))|~(reorganization(X2,X11,X13)))|~(reorganization_type(X1,X10,X11)))|~(reorganization_type(X2,X10,X11)))|~(inertia(X1,X6,X11)))|~(inertia(X2,X7,X11)))|~(greater(X7,X6)))|greater(X12,X13)),inference(fof_nnf,[status(thm)],[6])).
% fof(12, plain,![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:![X21]:![X22]:((((((((((((~(organization(X14,X20))|~(organization(X15,X20)))|organization(X15,X22))|~(class(X14,X17,X20)))|~(class(X15,X17,X20)))|~(reorganization(X14,X20,X21)))|~(reorganization(X15,X20,X22)))|~(reorganization_type(X14,X16,X20)))|~(reorganization_type(X15,X16,X20)))|~(inertia(X14,X18,X20)))|~(inertia(X15,X19,X20)))|~(greater(X19,X18)))|greater(X21,X22)),inference(variable_rename,[status(thm)],[11])).
% cnf(13,plain,(greater(X1,X2)|organization(X5,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X6)|~reorganization_type(X5,X8,X6)|~reorganization_type(X7,X8,X6)|~reorganization(X5,X6,X2)|~reorganization(X7,X6,X1)|~class(X5,X9,X6)|~class(X7,X9,X6)|~organization(X5,X6)|~organization(X7,X6)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X1]:![X14]:(~(organization(X1,X14))|?[X15]:inertia(X1,X15,X14)),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X16]:![X17]:(~(organization(X16,X17))|?[X18]:inertia(X16,X18,X17)),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X16]:![X17]:(~(organization(X16,X17))|inertia(X16,esk1_2(X16,X17),X17)),inference(skolemize,[status(esa)],[15])).
% cnf(17,plain,(inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,?[X1]:?[X2]:?[X10]:?[X3]:?[X4]:?[X5]:?[X11]:?[X12]:?[X13]:((((((((((((organization(X1,X11)&organization(X2,X11))&~(organization(X2,X13)))&class(X1,X3,X11))&class(X2,X3,X11))&reorganization(X1,X11,X12))&reorganization(X2,X11,X13))&reorganization_type(X1,X10,X11))&reorganization_type(X2,X10,X11))&size(X1,X4,X11))&size(X2,X5,X11))&greater(X5,X4))&~(greater(X12,X13))),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,?[X14]:?[X15]:?[X16]:?[X17]:?[X18]:?[X19]:?[X20]:?[X21]:?[X22]:((((((((((((organization(X14,X20)&organization(X15,X20))&~(organization(X15,X22)))&class(X14,X17,X20))&class(X15,X17,X20))&reorganization(X14,X20,X21))&reorganization(X15,X20,X22))&reorganization_type(X14,X16,X20))&reorganization_type(X15,X16,X20))&size(X14,X18,X20))&size(X15,X19,X20))&greater(X19,X18))&~(greater(X21,X22))),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,((((((((((((organization(esk2_0,esk8_0)&organization(esk3_0,esk8_0))&~(organization(esk3_0,esk10_0)))&class(esk2_0,esk5_0,esk8_0))&class(esk3_0,esk5_0,esk8_0))&reorganization(esk2_0,esk8_0,esk9_0))&reorganization(esk3_0,esk8_0,esk10_0))&reorganization_type(esk2_0,esk4_0,esk8_0))&reorganization_type(esk3_0,esk4_0,esk8_0))&size(esk2_0,esk6_0,esk8_0))&size(esk3_0,esk7_0,esk8_0))&greater(esk7_0,esk6_0))&~(greater(esk9_0,esk10_0))),inference(skolemize,[status(esa)],[19])).
% cnf(21,negated_conjecture,(~greater(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,negated_conjecture,(greater(esk7_0,esk6_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,negated_conjecture,(size(esk3_0,esk7_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(24,negated_conjecture,(size(esk2_0,esk6_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(25,negated_conjecture,(reorganization_type(esk3_0,esk4_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(26,negated_conjecture,(reorganization_type(esk2_0,esk4_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(27,negated_conjecture,(reorganization(esk3_0,esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(28,negated_conjecture,(reorganization(esk2_0,esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(29,negated_conjecture,(class(esk3_0,esk5_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(30,negated_conjecture,(class(esk2_0,esk5_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(31,negated_conjecture,(~organization(esk3_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(32,negated_conjecture,(organization(esk3_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(33,negated_conjecture,(organization(esk2_0,esk8_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(34,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)],[10,17,theory(equality)])).
% cnf(36,negated_conjecture,(greater(X1,X2)|organization(X3,X2)|~reorganization_type(X3,esk4_0,esk8_0)|~reorganization(esk2_0,esk8_0,X1)|~reorganization(X3,esk8_0,X2)|~greater(X4,X5)|~inertia(esk2_0,X5,esk8_0)|~inertia(X3,X4,esk8_0)|~class(esk2_0,X6,esk8_0)|~class(X3,X6,esk8_0)|~organization(esk2_0,esk8_0)|~organization(X3,esk8_0)),inference(spm,[status(thm)],[13,26,theory(equality)])).
% cnf(39,negated_conjecture,(greater(X1,X2)|organization(X3,X2)|~reorganization_type(X3,esk4_0,esk8_0)|~reorganization(esk2_0,esk8_0,X1)|~reorganization(X3,esk8_0,X2)|~greater(X4,X5)|~inertia(esk2_0,X5,esk8_0)|~inertia(X3,X4,esk8_0)|~class(esk2_0,X6,esk8_0)|~class(X3,X6,esk8_0)|$false|~organization(X3,esk8_0)),inference(rw,[status(thm)],[36,33,theory(equality)])).
% cnf(40,negated_conjecture,(greater(X1,X2)|organization(X3,X2)|~reorganization_type(X3,esk4_0,esk8_0)|~reorganization(esk2_0,esk8_0,X1)|~reorganization(X3,esk8_0,X2)|~greater(X4,X5)|~inertia(esk2_0,X5,esk8_0)|~inertia(X3,X4,esk8_0)|~class(esk2_0,X6,esk8_0)|~class(X3,X6,esk8_0)|~organization(X3,esk8_0)),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(50,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)],[34,17,theory(equality)])).
% cnf(60,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk8_0))|~greater(X3,esk6_0)|~size(X1,X3,X2)|~class(esk2_0,X4,esk8_0)|~class(X1,X4,X2)|~organization(esk2_0,esk8_0)|~organization(X1,X2)),inference(spm,[status(thm)],[50,24,theory(equality)])).
% cnf(63,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk8_0))|~greater(X3,esk6_0)|~size(X1,X3,X2)|~class(esk2_0,X4,esk8_0)|~class(X1,X4,X2)|$false|~organization(X1,X2)),inference(rw,[status(thm)],[60,33,theory(equality)])).
% cnf(64,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk8_0))|~greater(X3,esk6_0)|~size(X1,X3,X2)|~class(esk2_0,X4,esk8_0)|~class(X1,X4,X2)|~organization(X1,X2)),inference(cn,[status(thm)],[63,theory(equality)])).
% cnf(66,negated_conjecture,(greater(X1,X2)|organization(esk3_0,X2)|~reorganization(esk2_0,esk8_0,X1)|~reorganization(esk3_0,esk8_0,X2)|~greater(X3,X4)|~inertia(esk2_0,X4,esk8_0)|~inertia(esk3_0,X3,esk8_0)|~class(esk2_0,X5,esk8_0)|~class(esk3_0,X5,esk8_0)|~organization(esk3_0,esk8_0)),inference(spm,[status(thm)],[40,25,theory(equality)])).
% cnf(68,negated_conjecture,(greater(X1,X2)|organization(esk3_0,X2)|~reorganization(esk2_0,esk8_0,X1)|~reorganization(esk3_0,esk8_0,X2)|~greater(X3,X4)|~inertia(esk2_0,X4,esk8_0)|~inertia(esk3_0,X3,esk8_0)|~class(esk2_0,X5,esk8_0)|~class(esk3_0,X5,esk8_0)|$false),inference(rw,[status(thm)],[66,32,theory(equality)])).
% cnf(69,negated_conjecture,(greater(X1,X2)|organization(esk3_0,X2)|~reorganization(esk2_0,esk8_0,X1)|~reorganization(esk3_0,esk8_0,X2)|~greater(X3,X4)|~inertia(esk2_0,X4,esk8_0)|~inertia(esk3_0,X3,esk8_0)|~class(esk2_0,X5,esk8_0)|~class(esk3_0,X5,esk8_0)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(88,negated_conjecture,(greater(esk1_2(X1,X2),esk1_2(esk2_0,esk8_0))|~greater(X3,esk6_0)|~size(X1,X3,X2)|~class(X1,esk5_0,X2)|~organization(X1,X2)),inference(spm,[status(thm)],[64,30,theory(equality)])).
% cnf(95,negated_conjecture,(greater(esk1_2(esk3_0,esk8_0),esk1_2(esk2_0,esk8_0))|~greater(esk7_0,esk6_0)|~class(esk3_0,esk5_0,esk8_0)|~organization(esk3_0,esk8_0)),inference(spm,[status(thm)],[88,23,theory(equality)])).
% cnf(97,negated_conjecture,(greater(esk1_2(esk3_0,esk8_0),esk1_2(esk2_0,esk8_0))|$false|~class(esk3_0,esk5_0,esk8_0)|~organization(esk3_0,esk8_0)),inference(rw,[status(thm)],[95,22,theory(equality)])).
% cnf(98,negated_conjecture,(greater(esk1_2(esk3_0,esk8_0),esk1_2(esk2_0,esk8_0))|$false|$false|~organization(esk3_0,esk8_0)),inference(rw,[status(thm)],[97,29,theory(equality)])).
% cnf(99,negated_conjecture,(greater(esk1_2(esk3_0,esk8_0),esk1_2(esk2_0,esk8_0))|$false|$false|$false),inference(rw,[status(thm)],[98,32,theory(equality)])).
% cnf(100,negated_conjecture,(greater(esk1_2(esk3_0,esk8_0),esk1_2(esk2_0,esk8_0))),inference(cn,[status(thm)],[99,theory(equality)])).
% cnf(106,negated_conjecture,(greater(esk9_0,X1)|organization(esk3_0,X1)|~reorganization(esk3_0,esk8_0,X1)|~greater(X2,X3)|~inertia(esk2_0,X3,esk8_0)|~inertia(esk3_0,X2,esk8_0)|~class(esk2_0,X4,esk8_0)|~class(esk3_0,X4,esk8_0)),inference(spm,[status(thm)],[69,28,theory(equality)])).
% cnf(116,negated_conjecture,(greater(esk9_0,esk10_0)|organization(esk3_0,esk10_0)|~greater(X1,X2)|~inertia(esk2_0,X2,esk8_0)|~inertia(esk3_0,X1,esk8_0)|~class(esk2_0,X3,esk8_0)|~class(esk3_0,X3,esk8_0)),inference(spm,[status(thm)],[106,27,theory(equality)])).
% cnf(117,negated_conjecture,(organization(esk3_0,esk10_0)|~greater(X1,X2)|~inertia(esk2_0,X2,esk8_0)|~inertia(esk3_0,X1,esk8_0)|~class(esk2_0,X3,esk8_0)|~class(esk3_0,X3,esk8_0)),inference(sr,[status(thm)],[116,21,theory(equality)])).
% cnf(118,negated_conjecture,(~greater(X1,X2)|~inertia(esk2_0,X2,esk8_0)|~inertia(esk3_0,X1,esk8_0)|~class(esk2_0,X3,esk8_0)|~class(esk3_0,X3,esk8_0)),inference(sr,[status(thm)],[117,31,theory(equality)])).
% fof(119, plain,(~(epred1_0)<=>![X1]:![X2]:((~(greater(X1,X2))|~(inertia(esk3_0,X1,esk8_0)))|~(inertia(esk2_0,X2,esk8_0)))),introduced(definition),['split']).
% cnf(120,plain,(epred1_0|~inertia(esk3_0,X1,esk8_0)|~inertia(esk2_0,X2,esk8_0)|~greater(X1,X2)),inference(split_equiv,[status(thm)],[119])).
% fof(121, plain,(~(epred2_0)<=>![X3]:(~(class(esk3_0,X3,esk8_0))|~(class(esk2_0,X3,esk8_0)))),introduced(definition),['split']).
% cnf(122,plain,(epred2_0|~class(esk3_0,X3,esk8_0)|~class(esk2_0,X3,esk8_0)),inference(split_equiv,[status(thm)],[121])).
% cnf(123,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[118,119,theory(equality)]),121,theory(equality)]),['split']).
% cnf(124,negated_conjecture,(epred1_0|~greater(esk1_2(esk3_0,esk8_0),X1)|~inertia(esk2_0,X1,esk8_0)|~organization(esk3_0,esk8_0)),inference(spm,[status(thm)],[120,17,theory(equality)])).
% cnf(125,negated_conjecture,(epred1_0|~greater(esk1_2(esk3_0,esk8_0),X1)|~inertia(esk2_0,X1,esk8_0)|$false),inference(rw,[status(thm)],[124,32,theory(equality)])).
% cnf(126,negated_conjecture,(epred1_0|~greater(esk1_2(esk3_0,esk8_0),X1)|~inertia(esk2_0,X1,esk8_0)),inference(cn,[status(thm)],[125,theory(equality)])).
% cnf(127,negated_conjecture,(epred2_0|~class(esk3_0,esk5_0,esk8_0)),inference(spm,[status(thm)],[122,30,theory(equality)])).
% cnf(128,negated_conjecture,(epred2_0|$false),inference(rw,[status(thm)],[127,29,theory(equality)])).
% cnf(129,negated_conjecture,(epred2_0),inference(cn,[status(thm)],[128,theory(equality)])).
% cnf(130,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[123,129,theory(equality)])).
% cnf(131,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[130,theory(equality)])).
% cnf(133,negated_conjecture,(~greater(esk1_2(esk3_0,esk8_0),X1)|~inertia(esk2_0,X1,esk8_0)),inference(sr,[status(thm)],[126,131,theory(equality)])).
% cnf(135,negated_conjecture,(~inertia(esk2_0,esk1_2(esk2_0,esk8_0),esk8_0)),inference(spm,[status(thm)],[133,100,theory(equality)])).
% cnf(136,negated_conjecture,(~organization(esk2_0,esk8_0)),inference(spm,[status(thm)],[135,17,theory(equality)])).
% cnf(137,negated_conjecture,($false),inference(rw,[status(thm)],[136,33,theory(equality)])).
% cnf(138,negated_conjecture,($false),inference(cn,[status(thm)],[137,theory(equality)])).
% cnf(139,negated_conjecture,($false),138,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 78
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 2
% # Generated clauses : 47
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 0
% # Paramodulations : 44
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 53
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 36
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 75
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 71 leaves, 1.86+/-1.974 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 49 leaves, 1.10+/-0.303 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.004 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.22 WC
% FINAL PrfWatch: 0.12 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP27126/MGT018+1.tptp
%
%------------------------------------------------------------------------------