TSTP Solution File: MGT011+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT011+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:03:31 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP26346/MGT011+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26346/MGT011+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26346/MGT011+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 26442
% 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]:(organization(X1,X2)=>?[X3]:inertia(X1,X3,X2)),file('/tmp/SRASS.s.p', mp5)).
% fof(2, axiom,![X1]:![X4]:~((greater(X1,X4)&greater(X4,X1))),file('/tmp/SRASS.s.p', mp6_2)).
% fof(3, axiom,![X1]:![X2]:(organization(X1,X2)=>?[X5]:class(X1,X5,X2)),file('/tmp/SRASS.s.p', mp9)).
% fof(4, axiom,![X1]:![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((((((((organization(X1,X10)&organization(X4,X11))&class(X1,X5,X10))&class(X4,X5,X11))&size(X1,X6,X10))&size(X4,X7,X11))&inertia(X1,X8,X10))&inertia(X4,X9,X11))&greater(X7,X6))=>greater(X9,X8)),file('/tmp/SRASS.s.p', a5_FOL)).
% fof(5, axiom,![X1]:![X8]:![X9]:![X10]:![X11]:((((((organization(X1,X10)&organization(X1,X11))&reorganization_free(X1,X10,X11))&inertia(X1,X8,X10))&inertia(X1,X9,X11))&greater(X11,X10))=>greater(X9,X8)),file('/tmp/SRASS.s.p', t2_FOL)).
% fof(6, axiom,![X1]:![X10]:![X11]:![X12]:![X13]:(((((organization(X1,X10)&organization(X1,X11))&reorganization_free(X1,X10,X11))&class(X1,X12,X10))&class(X1,X13,X11))=>X12=X13),file('/tmp/SRASS.s.p', mp10)).
% fof(8, conjecture,![X1]:![X6]:![X7]:![X10]:![X11]:((((((organization(X1,X10)&organization(X1,X11))&reorganization_free(X1,X10,X11))&size(X1,X6,X10))&size(X1,X7,X11))&greater(X11,X10))=>~(greater(X6,X7))),file('/tmp/SRASS.s.p', t11_FOL)).
% fof(9, negated_conjecture,~(![X1]:![X6]:![X7]:![X10]:![X11]:((((((organization(X1,X10)&organization(X1,X11))&reorganization_free(X1,X10,X11))&size(X1,X6,X10))&size(X1,X7,X11))&greater(X11,X10))=>~(greater(X6,X7)))),inference(assume_negation,[status(cth)],[8])).
% fof(10, negated_conjecture,~(![X1]:![X6]:![X7]:![X10]:![X11]:((((((organization(X1,X10)&organization(X1,X11))&reorganization_free(X1,X10,X11))&size(X1,X6,X10))&size(X1,X7,X11))&greater(X11,X10))=>~(greater(X6,X7)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(11, plain,![X1]:![X2]:(~(organization(X1,X2))|?[X3]:inertia(X1,X3,X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(12, plain,![X4]:![X5]:(~(organization(X4,X5))|?[X6]:inertia(X4,X6,X5)),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X4]:![X5]:(~(organization(X4,X5))|inertia(X4,esk1_2(X4,X5),X5)),inference(skolemize,[status(esa)],[12])).
% cnf(14,plain,(inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X1]:![X4]:(~(greater(X1,X4))|~(greater(X4,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X5]:![X6]:(~(greater(X5,X6))|~(greater(X6,X5))),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(~greater(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X1]:![X2]:(~(organization(X1,X2))|?[X5]:class(X1,X5,X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(19, plain,![X6]:![X7]:(~(organization(X6,X7))|?[X8]:class(X6,X8,X7)),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X6]:![X7]:(~(organization(X6,X7))|class(X6,esk2_2(X6,X7),X7)),inference(skolemize,[status(esa)],[19])).
% cnf(21,plain,(class(X1,esk2_2(X1,X2),X2)|~organization(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X1]:![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((((((((~(organization(X1,X10))|~(organization(X4,X11)))|~(class(X1,X5,X10)))|~(class(X4,X5,X11)))|~(size(X1,X6,X10)))|~(size(X4,X7,X11)))|~(inertia(X1,X8,X10)))|~(inertia(X4,X9,X11)))|~(greater(X7,X6)))|greater(X9,X8)),inference(fof_nnf,[status(thm)],[4])).
% fof(23, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:(((((((((~(organization(X12,X19))|~(organization(X13,X20)))|~(class(X12,X14,X19)))|~(class(X13,X14,X20)))|~(size(X12,X15,X19)))|~(size(X13,X16,X20)))|~(inertia(X12,X17,X19)))|~(inertia(X13,X18,X20)))|~(greater(X16,X15)))|greater(X18,X17)),inference(variable_rename,[status(thm)],[22])).
% cnf(24,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)],[23])).
% fof(25, plain,![X1]:![X8]:![X9]:![X10]:![X11]:((((((~(organization(X1,X10))|~(organization(X1,X11)))|~(reorganization_free(X1,X10,X11)))|~(inertia(X1,X8,X10)))|~(inertia(X1,X9,X11)))|~(greater(X11,X10)))|greater(X9,X8)),inference(fof_nnf,[status(thm)],[5])).
% fof(26, plain,![X12]:![X13]:![X14]:![X15]:![X16]:((((((~(organization(X12,X15))|~(organization(X12,X16)))|~(reorganization_free(X12,X15,X16)))|~(inertia(X12,X13,X15)))|~(inertia(X12,X14,X16)))|~(greater(X16,X15)))|greater(X14,X13)),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X3)|~inertia(X5,X2,X4)|~reorganization_free(X5,X4,X3)|~organization(X5,X3)|~organization(X5,X4)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:![X10]:![X11]:![X12]:![X13]:(((((~(organization(X1,X10))|~(organization(X1,X11)))|~(reorganization_free(X1,X10,X11)))|~(class(X1,X12,X10)))|~(class(X1,X13,X11)))|X12=X13),inference(fof_nnf,[status(thm)],[6])).
% fof(29, plain,![X14]:![X15]:![X16]:![X17]:![X18]:(((((~(organization(X14,X15))|~(organization(X14,X16)))|~(reorganization_free(X14,X15,X16)))|~(class(X14,X17,X15)))|~(class(X14,X18,X16)))|X17=X18),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(X1=X2|~class(X3,X2,X4)|~class(X3,X1,X5)|~reorganization_free(X3,X5,X4)|~organization(X3,X4)|~organization(X3,X5)),inference(split_conjunct,[status(thm)],[29])).
% fof(34, negated_conjecture,?[X1]:?[X6]:?[X7]:?[X10]:?[X11]:((((((organization(X1,X10)&organization(X1,X11))&reorganization_free(X1,X10,X11))&size(X1,X6,X10))&size(X1,X7,X11))&greater(X11,X10))&greater(X6,X7)),inference(fof_nnf,[status(thm)],[10])).
% fof(35, negated_conjecture,?[X12]:?[X13]:?[X14]:?[X15]:?[X16]:((((((organization(X12,X15)&organization(X12,X16))&reorganization_free(X12,X15,X16))&size(X12,X13,X15))&size(X12,X14,X16))&greater(X16,X15))&greater(X13,X14)),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,((((((organization(esk3_0,esk6_0)&organization(esk3_0,esk7_0))&reorganization_free(esk3_0,esk6_0,esk7_0))&size(esk3_0,esk4_0,esk6_0))&size(esk3_0,esk5_0,esk7_0))&greater(esk7_0,esk6_0))&greater(esk4_0,esk5_0)),inference(skolemize,[status(esa)],[35])).
% cnf(37,negated_conjecture,(greater(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,negated_conjecture,(greater(esk7_0,esk6_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(39,negated_conjecture,(size(esk3_0,esk5_0,esk7_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(40,negated_conjecture,(size(esk3_0,esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(41,negated_conjecture,(reorganization_free(esk3_0,esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(42,negated_conjecture,(organization(esk3_0,esk7_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(43,negated_conjecture,(organization(esk3_0,esk6_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(47,negated_conjecture,(X1=X2|~class(esk3_0,X2,esk7_0)|~class(esk3_0,X1,esk6_0)|~organization(esk3_0,esk6_0)|~organization(esk3_0,esk7_0)),inference(spm,[status(thm)],[30,41,theory(equality)])).
% cnf(48,negated_conjecture,(X1=X2|~class(esk3_0,X2,esk7_0)|~class(esk3_0,X1,esk6_0)|$false|~organization(esk3_0,esk7_0)),inference(rw,[status(thm)],[47,43,theory(equality)])).
% cnf(49,negated_conjecture,(X1=X2|~class(esk3_0,X2,esk7_0)|~class(esk3_0,X1,esk6_0)|$false|$false),inference(rw,[status(thm)],[48,42,theory(equality)])).
% cnf(50,negated_conjecture,(X1=X2|~class(esk3_0,X2,esk7_0)|~class(esk3_0,X1,esk6_0)),inference(cn,[status(thm)],[49,theory(equality)])).
% cnf(51,negated_conjecture,(greater(X1,X2)|~greater(esk7_0,esk6_0)|~inertia(esk3_0,X2,esk6_0)|~inertia(esk3_0,X1,esk7_0)|~organization(esk3_0,esk6_0)|~organization(esk3_0,esk7_0)),inference(spm,[status(thm)],[27,41,theory(equality)])).
% cnf(52,negated_conjecture,(greater(X1,X2)|$false|~inertia(esk3_0,X2,esk6_0)|~inertia(esk3_0,X1,esk7_0)|~organization(esk3_0,esk6_0)|~organization(esk3_0,esk7_0)),inference(rw,[status(thm)],[51,38,theory(equality)])).
% cnf(53,negated_conjecture,(greater(X1,X2)|$false|~inertia(esk3_0,X2,esk6_0)|~inertia(esk3_0,X1,esk7_0)|$false|~organization(esk3_0,esk7_0)),inference(rw,[status(thm)],[52,43,theory(equality)])).
% cnf(54,negated_conjecture,(greater(X1,X2)|$false|~inertia(esk3_0,X2,esk6_0)|~inertia(esk3_0,X1,esk7_0)|$false|$false),inference(rw,[status(thm)],[53,42,theory(equality)])).
% cnf(55,negated_conjecture,(greater(X1,X2)|~inertia(esk3_0,X2,esk6_0)|~inertia(esk3_0,X1,esk7_0)),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(56,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(esk3_0,X6,esk7_0)|~class(X3,X6,X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|~organization(esk3_0,esk7_0)|~organization(X3,X5)),inference(spm,[status(thm)],[24,39,theory(equality)])).
% cnf(58,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(esk3_0,X6,esk7_0)|~class(X3,X6,X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|$false|~organization(X3,X5)),inference(rw,[status(thm)],[56,42,theory(equality)])).
% cnf(59,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(esk3_0,X6,esk7_0)|~class(X3,X6,X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|~organization(X3,X5)),inference(cn,[status(thm)],[58,theory(equality)])).
% cnf(62,negated_conjecture,(X1=esk2_2(esk3_0,esk7_0)|~class(esk3_0,X1,esk6_0)|~organization(esk3_0,esk7_0)),inference(spm,[status(thm)],[50,21,theory(equality)])).
% cnf(63,negated_conjecture,(X1=esk2_2(esk3_0,esk7_0)|~class(esk3_0,X1,esk6_0)|$false),inference(rw,[status(thm)],[62,42,theory(equality)])).
% cnf(64,negated_conjecture,(X1=esk2_2(esk3_0,esk7_0)|~class(esk3_0,X1,esk6_0)),inference(cn,[status(thm)],[63,theory(equality)])).
% cnf(65,negated_conjecture,(esk2_2(esk3_0,esk6_0)=esk2_2(esk3_0,esk7_0)|~organization(esk3_0,esk6_0)),inference(spm,[status(thm)],[64,21,theory(equality)])).
% cnf(66,negated_conjecture,(esk2_2(esk3_0,esk6_0)=esk2_2(esk3_0,esk7_0)|$false),inference(rw,[status(thm)],[65,43,theory(equality)])).
% cnf(67,negated_conjecture,(esk2_2(esk3_0,esk6_0)=esk2_2(esk3_0,esk7_0)),inference(cn,[status(thm)],[66,theory(equality)])).
% cnf(72,negated_conjecture,(greater(X1,esk1_2(esk3_0,esk6_0))|~inertia(esk3_0,X1,esk7_0)|~organization(esk3_0,esk6_0)),inference(spm,[status(thm)],[55,14,theory(equality)])).
% cnf(73,negated_conjecture,(greater(X1,esk1_2(esk3_0,esk6_0))|~inertia(esk3_0,X1,esk7_0)|$false),inference(rw,[status(thm)],[72,43,theory(equality)])).
% cnf(74,negated_conjecture,(greater(X1,esk1_2(esk3_0,esk6_0))|~inertia(esk3_0,X1,esk7_0)),inference(cn,[status(thm)],[73,theory(equality)])).
% cnf(76,negated_conjecture,(~greater(esk1_2(esk3_0,esk6_0),X1)|~inertia(esk3_0,X1,esk7_0)),inference(spm,[status(thm)],[17,74,theory(equality)])).
% cnf(79,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(X3,esk2_2(esk3_0,esk7_0),X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|~organization(X3,X5)|~organization(esk3_0,esk7_0)),inference(spm,[status(thm)],[59,21,theory(equality)])).
% cnf(81,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(X3,esk2_2(esk3_0,esk6_0),X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|~organization(X3,X5)|~organization(esk3_0,esk7_0)),inference(rw,[status(thm)],[79,67,theory(equality)])).
% cnf(82,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(X3,esk2_2(esk3_0,esk6_0),X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|~organization(X3,X5)|$false),inference(rw,[status(thm)],[81,42,theory(equality)])).
% cnf(83,negated_conjecture,(greater(X1,X2)|~size(X3,X4,X5)|~class(X3,esk2_2(esk3_0,esk6_0),X5)|~greater(X4,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(X3,X1,X5)|~organization(X3,X5)),inference(cn,[status(thm)],[82,theory(equality)])).
% cnf(85,negated_conjecture,(greater(X1,X2)|~size(esk3_0,X3,esk6_0)|~greater(X3,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(esk3_0,X1,esk6_0)|~organization(esk3_0,esk6_0)),inference(spm,[status(thm)],[83,21,theory(equality)])).
% cnf(88,negated_conjecture,(greater(X1,X2)|~size(esk3_0,X3,esk6_0)|~greater(X3,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(esk3_0,X1,esk6_0)|$false),inference(rw,[status(thm)],[85,43,theory(equality)])).
% cnf(89,negated_conjecture,(greater(X1,X2)|~size(esk3_0,X3,esk6_0)|~greater(X3,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(esk3_0,X1,esk6_0)),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(94,negated_conjecture,(greater(X1,X2)|~greater(esk4_0,esk5_0)|~inertia(esk3_0,X2,esk7_0)|~inertia(esk3_0,X1,esk6_0)),inference(spm,[status(thm)],[89,40,theory(equality)])).
% cnf(95,negated_conjecture,(greater(X1,X2)|$false|~inertia(esk3_0,X2,esk7_0)|~inertia(esk3_0,X1,esk6_0)),inference(rw,[status(thm)],[94,37,theory(equality)])).
% cnf(96,negated_conjecture,(greater(X1,X2)|~inertia(esk3_0,X2,esk7_0)|~inertia(esk3_0,X1,esk6_0)),inference(cn,[status(thm)],[95,theory(equality)])).
% cnf(97,negated_conjecture,(greater(X1,esk1_2(esk3_0,esk7_0))|~inertia(esk3_0,X1,esk6_0)|~organization(esk3_0,esk7_0)),inference(spm,[status(thm)],[96,14,theory(equality)])).
% cnf(98,negated_conjecture,(greater(X1,esk1_2(esk3_0,esk7_0))|~inertia(esk3_0,X1,esk6_0)|$false),inference(rw,[status(thm)],[97,42,theory(equality)])).
% cnf(99,negated_conjecture,(greater(X1,esk1_2(esk3_0,esk7_0))|~inertia(esk3_0,X1,esk6_0)),inference(cn,[status(thm)],[98,theory(equality)])).
% cnf(100,negated_conjecture,(~inertia(esk3_0,esk1_2(esk3_0,esk7_0),esk7_0)|~inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[76,99,theory(equality)])).
% cnf(109,negated_conjecture,(~inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)|~organization(esk3_0,esk7_0)),inference(spm,[status(thm)],[100,14,theory(equality)])).
% cnf(110,negated_conjecture,(~inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)|$false),inference(rw,[status(thm)],[109,42,theory(equality)])).
% cnf(111,negated_conjecture,(~inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)),inference(cn,[status(thm)],[110,theory(equality)])).
% cnf(112,negated_conjecture,(~organization(esk3_0,esk6_0)),inference(spm,[status(thm)],[111,14,theory(equality)])).
% cnf(113,negated_conjecture,($false),inference(rw,[status(thm)],[112,43,theory(equality)])).
% cnf(114,negated_conjecture,($false),inference(cn,[status(thm)],[113,theory(equality)])).
% cnf(115,negated_conjecture,($false),114,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 55
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 51
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 30
% # ...of the previous two non-trivial : 30
% # Contextual simplify-reflections : 0
% # Paramodulations : 29
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 12
% # Clause-clause subsumption calls (NU) : 38
% # Rec. Clause-clause subsumption calls : 22
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 41 leaves, 1.59+/-1.189 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 35 leaves, 1.20+/-0.576 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 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/SystemOnTPTP26346/MGT011+1.tptp
%
%------------------------------------------------------------------------------