TSTP Solution File: MGT058+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT058+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:10:30 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.89s
% 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/SystemOnTPTP6056/MGT058+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6056/MGT058+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6056/MGT058+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 6152
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(greater_or_equal(X1,X2)<=>(greater(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', definition_greater_or_equal)).
% fof(2, axiom,![X1]:(fragile_position(X1)<=>![X3]:((smaller_or_equal(age(X1,X3),sigma)=>positional_advantage(X1,X3))&(greater(age(X1,X3),sigma)=>~(positional_advantage(X1,X3))))),file('/tmp/SRASS.s.p', definition_3)).
% fof(3, axiom,![X1]:(robust_position(X1)<=>![X3]:((smaller_or_equal(age(X1,X3),tau)=>~(positional_advantage(X1,X3)))&(greater(age(X1,X3),tau)=>positional_advantage(X1,X3)))),file('/tmp/SRASS.s.p', definition_4)).
% fof(4, axiom,![X1]:![X2]:(smaller(X1,X2)<=>greater(X2,X1)),file('/tmp/SRASS.s.p', definition_smaller)).
% fof(5, axiom,![X1]:![X2]:~((greater(X1,X2)&greater(X2,X1))),file('/tmp/SRASS.s.p', meaning_postulate_greater_strict)).
% fof(7, axiom,![X1]:![X2]:((smaller(X1,X2)|X1=X2)|greater(X1,X2)),file('/tmp/SRASS.s.p', meaning_postulate_greater_comparable)).
% fof(8, axiom,![X1]:![X2]:(smaller_or_equal(X1,X2)<=>(smaller(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', definition_smaller_or_equal)).
% fof(9, conjecture,![X1]:((((organization(X1)&?[X5]:age(X1,X5)=zero)&greater_or_equal(sigma,zero))&greater_or_equal(tau,zero))=>~((fragile_position(X1)&robust_position(X1)))),file('/tmp/SRASS.s.p', lemma_10)).
% fof(10, negated_conjecture,~(![X1]:((((organization(X1)&?[X5]:age(X1,X5)=zero)&greater_or_equal(sigma,zero))&greater_or_equal(tau,zero))=>~((fragile_position(X1)&robust_position(X1))))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:(fragile_position(X1)<=>![X3]:((smaller_or_equal(age(X1,X3),sigma)=>positional_advantage(X1,X3))&(greater(age(X1,X3),sigma)=>~(positional_advantage(X1,X3))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, plain,![X1]:(robust_position(X1)<=>![X3]:((smaller_or_equal(age(X1,X3),tau)=>~(positional_advantage(X1,X3)))&(greater(age(X1,X3),tau)=>positional_advantage(X1,X3)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(13, plain,![X1]:![X2]:((~(greater_or_equal(X1,X2))|(greater(X1,X2)|X1=X2))&((~(greater(X1,X2))&~(X1=X2))|greater_or_equal(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(14, plain,![X3]:![X4]:((~(greater_or_equal(X3,X4))|(greater(X3,X4)|X3=X4))&((~(greater(X3,X4))&~(X3=X4))|greater_or_equal(X3,X4))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X3]:![X4]:((~(greater_or_equal(X3,X4))|(greater(X3,X4)|X3=X4))&((~(greater(X3,X4))|greater_or_equal(X3,X4))&(~(X3=X4)|greater_or_equal(X3,X4)))),inference(distribute,[status(thm)],[14])).
% cnf(18,plain,(X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% fof(19, plain,![X1]:((~(fragile_position(X1))|![X3]:((~(smaller_or_equal(age(X1,X3),sigma))|positional_advantage(X1,X3))&(~(greater(age(X1,X3),sigma))|~(positional_advantage(X1,X3)))))&(?[X3]:((smaller_or_equal(age(X1,X3),sigma)&~(positional_advantage(X1,X3)))|(greater(age(X1,X3),sigma)&positional_advantage(X1,X3)))|fragile_position(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(20, plain,![X4]:((~(fragile_position(X4))|![X5]:((~(smaller_or_equal(age(X4,X5),sigma))|positional_advantage(X4,X5))&(~(greater(age(X4,X5),sigma))|~(positional_advantage(X4,X5)))))&(?[X6]:((smaller_or_equal(age(X4,X6),sigma)&~(positional_advantage(X4,X6)))|(greater(age(X4,X6),sigma)&positional_advantage(X4,X6)))|fragile_position(X4))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X4]:((~(fragile_position(X4))|![X5]:((~(smaller_or_equal(age(X4,X5),sigma))|positional_advantage(X4,X5))&(~(greater(age(X4,X5),sigma))|~(positional_advantage(X4,X5)))))&(((smaller_or_equal(age(X4,esk1_1(X4)),sigma)&~(positional_advantage(X4,esk1_1(X4))))|(greater(age(X4,esk1_1(X4)),sigma)&positional_advantage(X4,esk1_1(X4))))|fragile_position(X4))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X4]:![X5]:((((~(smaller_or_equal(age(X4,X5),sigma))|positional_advantage(X4,X5))&(~(greater(age(X4,X5),sigma))|~(positional_advantage(X4,X5))))|~(fragile_position(X4)))&(((smaller_or_equal(age(X4,esk1_1(X4)),sigma)&~(positional_advantage(X4,esk1_1(X4))))|(greater(age(X4,esk1_1(X4)),sigma)&positional_advantage(X4,esk1_1(X4))))|fragile_position(X4))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:((((~(smaller_or_equal(age(X4,X5),sigma))|positional_advantage(X4,X5))|~(fragile_position(X4)))&((~(greater(age(X4,X5),sigma))|~(positional_advantage(X4,X5)))|~(fragile_position(X4))))&((((greater(age(X4,esk1_1(X4)),sigma)|smaller_or_equal(age(X4,esk1_1(X4)),sigma))|fragile_position(X4))&((positional_advantage(X4,esk1_1(X4))|smaller_or_equal(age(X4,esk1_1(X4)),sigma))|fragile_position(X4)))&(((greater(age(X4,esk1_1(X4)),sigma)|~(positional_advantage(X4,esk1_1(X4))))|fragile_position(X4))&((positional_advantage(X4,esk1_1(X4))|~(positional_advantage(X4,esk1_1(X4))))|fragile_position(X4))))),inference(distribute,[status(thm)],[22])).
% cnf(29,plain,(positional_advantage(X1,X2)|~fragile_position(X1)|~smaller_or_equal(age(X1,X2),sigma)),inference(split_conjunct,[status(thm)],[23])).
% fof(30, plain,![X1]:((~(robust_position(X1))|![X3]:((~(smaller_or_equal(age(X1,X3),tau))|~(positional_advantage(X1,X3)))&(~(greater(age(X1,X3),tau))|positional_advantage(X1,X3))))&(?[X3]:((smaller_or_equal(age(X1,X3),tau)&positional_advantage(X1,X3))|(greater(age(X1,X3),tau)&~(positional_advantage(X1,X3))))|robust_position(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(31, plain,![X4]:((~(robust_position(X4))|![X5]:((~(smaller_or_equal(age(X4,X5),tau))|~(positional_advantage(X4,X5)))&(~(greater(age(X4,X5),tau))|positional_advantage(X4,X5))))&(?[X6]:((smaller_or_equal(age(X4,X6),tau)&positional_advantage(X4,X6))|(greater(age(X4,X6),tau)&~(positional_advantage(X4,X6))))|robust_position(X4))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X4]:((~(robust_position(X4))|![X5]:((~(smaller_or_equal(age(X4,X5),tau))|~(positional_advantage(X4,X5)))&(~(greater(age(X4,X5),tau))|positional_advantage(X4,X5))))&(((smaller_or_equal(age(X4,esk2_1(X4)),tau)&positional_advantage(X4,esk2_1(X4)))|(greater(age(X4,esk2_1(X4)),tau)&~(positional_advantage(X4,esk2_1(X4)))))|robust_position(X4))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X4]:![X5]:((((~(smaller_or_equal(age(X4,X5),tau))|~(positional_advantage(X4,X5)))&(~(greater(age(X4,X5),tau))|positional_advantage(X4,X5)))|~(robust_position(X4)))&(((smaller_or_equal(age(X4,esk2_1(X4)),tau)&positional_advantage(X4,esk2_1(X4)))|(greater(age(X4,esk2_1(X4)),tau)&~(positional_advantage(X4,esk2_1(X4)))))|robust_position(X4))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:((((~(smaller_or_equal(age(X4,X5),tau))|~(positional_advantage(X4,X5)))|~(robust_position(X4)))&((~(greater(age(X4,X5),tau))|positional_advantage(X4,X5))|~(robust_position(X4))))&((((greater(age(X4,esk2_1(X4)),tau)|smaller_or_equal(age(X4,esk2_1(X4)),tau))|robust_position(X4))&((~(positional_advantage(X4,esk2_1(X4)))|smaller_or_equal(age(X4,esk2_1(X4)),tau))|robust_position(X4)))&(((greater(age(X4,esk2_1(X4)),tau)|positional_advantage(X4,esk2_1(X4)))|robust_position(X4))&((~(positional_advantage(X4,esk2_1(X4)))|positional_advantage(X4,esk2_1(X4)))|robust_position(X4))))),inference(distribute,[status(thm)],[33])).
% cnf(40,plain,(~robust_position(X1)|~positional_advantage(X1,X2)|~smaller_or_equal(age(X1,X2),tau)),inference(split_conjunct,[status(thm)],[34])).
% fof(41, plain,![X1]:![X2]:((~(smaller(X1,X2))|gr
% eater(X2,X1))&(~(greater(X2,X1))|smaller(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(42, plain,![X3]:![X4]:((~(smaller(X3,X4))|greater(X4,X3))&(~(greater(X4,X3))|smaller(X3,X4))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(smaller(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(45, plain,![X1]:![X2]:(~(greater(X1,X2))|~(greater(X2,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(46, plain,![X3]:![X4]:(~(greater(X3,X4))|~(greater(X4,X3))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(~greater(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(51, plain,![X3]:![X4]:((smaller(X3,X4)|X3=X4)|greater(X3,X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(52,plain,(greater(X1,X2)|X1=X2|smaller(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(53, plain,![X1]:![X2]:((~(smaller_or_equal(X1,X2))|(smaller(X1,X2)|X1=X2))&((~(smaller(X1,X2))&~(X1=X2))|smaller_or_equal(X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(54, plain,![X3]:![X4]:((~(smaller_or_equal(X3,X4))|(smaller(X3,X4)|X3=X4))&((~(smaller(X3,X4))&~(X3=X4))|smaller_or_equal(X3,X4))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X3]:![X4]:((~(smaller_or_equal(X3,X4))|(smaller(X3,X4)|X3=X4))&((~(smaller(X3,X4))|smaller_or_equal(X3,X4))&(~(X3=X4)|smaller_or_equal(X3,X4)))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(smaller_or_equal(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(smaller_or_equal(X1,X2)|~smaller(X1,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(59, negated_conjecture,?[X1]:((((organization(X1)&?[X5]:age(X1,X5)=zero)&greater_or_equal(sigma,zero))&greater_or_equal(tau,zero))&(fragile_position(X1)&robust_position(X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(60, negated_conjecture,?[X6]:((((organization(X6)&?[X7]:age(X6,X7)=zero)&greater_or_equal(sigma,zero))&greater_or_equal(tau,zero))&(fragile_position(X6)&robust_position(X6))),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,((((organization(esk3_0)&age(esk3_0,esk4_0)=zero)&greater_or_equal(sigma,zero))&greater_or_equal(tau,zero))&(fragile_position(esk3_0)&robust_position(esk3_0))),inference(skolemize,[status(esa)],[60])).
% cnf(62,negated_conjecture,(robust_position(esk3_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,negated_conjecture,(fragile_position(esk3_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(64,negated_conjecture,(greater_or_equal(tau,zero)),inference(split_conjunct,[status(thm)],[61])).
% cnf(65,negated_conjecture,(greater_or_equal(sigma,zero)),inference(split_conjunct,[status(thm)],[61])).
% cnf(66,negated_conjecture,(age(esk3_0,esk4_0)=zero),inference(split_conjunct,[status(thm)],[61])).
% cnf(69,plain,(smaller_or_equal(X1,X1)),inference(er,[status(thm)],[56,theory(equality)])).
% cnf(70,negated_conjecture,(tau=zero|greater(tau,zero)),inference(spm,[status(thm)],[18,64,theory(equality)])).
% cnf(71,negated_conjecture,(sigma=zero|greater(sigma,zero)),inference(spm,[status(thm)],[18,65,theory(equality)])).
% cnf(72,plain,(smaller_or_equal(X1,X2)|X1=X2|greater(X1,X2)),inference(spm,[status(thm)],[57,52,theory(equality)])).
% cnf(74,negated_conjecture,(positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(zero,sigma)|~fragile_position(esk3_0)),inference(spm,[status(thm)],[29,66,theory(equality)])).
% cnf(75,negated_conjecture,(positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(zero,sigma)|$false),inference(rw,[status(thm)],[74,63,theory(equality)])).
% cnf(76,negated_conjecture,(positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(zero,sigma)),inference(cn,[status(thm)],[75,theory(equality)])).
% cnf(77,negated_conjecture,(~robust_position(esk3_0)|~positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(zero,tau)),inference(spm,[status(thm)],[40,66,theory(equality)])).
% cnf(78,negated_conjecture,($false|~positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(zero,tau)),inference(rw,[status(thm)],[77,62,theory(equality)])).
% cnf(79,negated_conjecture,(~positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(zero,tau)),inference(cn,[status(thm)],[78,theory(equality)])).
% cnf(94,negated_conjecture,(zero=tau|~greater(zero,tau)),inference(spm,[status(thm)],[47,70,theory(equality)])).
% cnf(100,negated_conjecture,(smaller(zero,sigma)|zero=sigma),inference(spm,[status(thm)],[43,71,theory(equality)])).
% cnf(106,plain,(age(X1,X2)=tau|greater(age(X1,X2),tau)|~robust_position(X1)|~positional_advantage(X1,X2)),inference(spm,[status(thm)],[40,72,theory(equality)])).
% cnf(111,negated_conjecture,(smaller_or_equal(zero,sigma)|zero=sigma),inference(spm,[status(thm)],[57,100,theory(equality)])).
% cnf(134,negated_conjecture,(positional_advantage(esk3_0,esk4_0)|zero=sigma),inference(spm,[status(thm)],[76,111,theory(equality)])).
% cnf(135,negated_conjecture,(age(esk3_0,esk4_0)=tau|greater(age(esk3_0,esk4_0),tau)|zero=sigma|~robust_position(esk3_0)),inference(spm,[status(thm)],[106,134,theory(equality)])).
% cnf(136,negated_conjecture,(zero=sigma|~smaller_or_equal(zero,tau)),inference(spm,[status(thm)],[79,134,theory(equality)])).
% cnf(138,negated_conjecture,(zero=tau|greater(age(esk3_0,esk4_0),tau)|zero=sigma|~robust_position(esk3_0)),inference(rw,[status(thm)],[135,66,theory(equality)])).
% cnf(139,negated_conjecture,(zero=tau|greater(zero,tau)|zero=sigma|~robust_position(esk3_0)),inference(rw,[status(thm)],[138,66,theory(equality)])).
% cnf(140,negated_conjecture,(zero=tau|greater(zero,tau)|zero=sigma|$false),inference(rw,[status(thm)],[139,62,theory(equality)])).
% cnf(141,negated_conjecture,(zero=tau|greater(zero,tau)|zero=sigma),inference(cn,[status(thm)],[140,theory(equality)])).
% cnf(144,negated_conjecture,(zero=tau|zero=sigma),inference(csr,[status(thm)],[141,94])).
% cnf(145,negated_conjecture,(zero=sigma|tau!=sigma),inference(ef,[status(thm)],[144,theory(equality)])).
% cnf(164,negated_conjecture,(tau=sigma|zero=sigma|~smaller_or_equal(tau,tau)),inference(spm,[status(thm)],[136,144,theory(equality)])).
% cnf(167,negated_conjecture,(tau=sigma|zero=sigma|$false),inference(rw,[status(thm)],[164,69,theory(equality)])).
% cnf(168,negated_conjecture,(tau=sigma|zero=sigma),inference(cn,[status(thm)],[167,theory(equality)])).
% cnf(169,negated_conjecture,(zero=sigma),inference(csr,[status(thm)],[168,145])).
% cnf(186,negated_conjecture,(sigma=tau|~greater(zero,tau)),inference(rw,[status(thm)],[94,169,theory(equality)])).
% cnf(187,negated_conjecture,(sigma=tau|~greater(sigma,tau)),inference(rw,[status(thm)],[186,169,theory(equality)])).
% cnf(193,negated_conjecture,(~positional_advantage(esk3_0,esk4_0)|~smaller_or_equal(sigma,tau)),inference(rw,[status(thm)],[79,169,theory(equality)])).
% cnf(194,negated_conjecture,(positional_advantage(esk3_0,esk4_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,169,theory(equality)]),69,theory(equality)])).
% cnf(195,negated_conjecture,(positional_advantage(esk3_0,esk4_0)),inference(cn,[status(thm)],[194,theory(equality)])).
% cnf(203,negated_conjecture,(age(esk3_0,esk4_0)=tau|greater(age(esk3_0,esk4_0),tau)|~robust_position(esk3_0)),inference(spm,[status(thm)],[106,195,theory(equality)])).
% cnf(204,negated_conjecture,(sigma=tau|greater(age(esk3_0,esk4_0),tau)|~robust_position(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[203,66,theory(equality)]),169,theory(equality)])).
% cnf(205,negated_conjecture,(sigma=tau|greater(sigma,tau)|~robust_position(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[204,66,theory(equality)]),169,theory(equality)])).
% cnf(206,negated_conjecture,(sigma=tau|greater(sigma,tau)|$false),inference(rw,[status(thm)],[205,62,theory(equality)])).
% cnf(207,negated_conjecture,(sigma=tau|greater(sigma,tau)),inference(cn,[status(thm)],[206,theory(equality)])).
% cnf(238,negated_conjecture,(tau=sigma),inference(csr,[status(thm)],[187,207])).
% cnf(264,negated_conjecture,($false|~smaller_or_equal(sigma,tau)),inference(rw,[status(thm)],[193,195,theory(equality)])).
% cnf(265,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[264,238,theory(equality)]),69,theory(equality)])).
% cnf(266,negated_conjecture,($false),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(267,negated_conjecture,($false),266,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 107
% # ...of these trivial : 2
% # ...subsumed : 13
% # ...remaining for further processing: 92
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 34
% # Generated clauses : 100
% # ...of the previous two non-trivial : 102
% # Contextual simplify-reflections : 4
% # Paramodulations : 95
% # Factorizations : 3
% # Equation resolutions : 2
% # Current number of processed clauses: 28
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 63
% # Clause-clause subsumption calls (NU) : 46
% # Rec. Clause-clause subsumption calls : 43
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 27 leaves, 1.26+/-0.699 terms/leaf
% # Paramod-from index: 13 leaves, 1.23+/-0.421 terms/leaf
% # Paramod-into index: 23 leaves, 1.26+/-0.606 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.001 s
% # Total time : 0.019 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/SystemOnTPTP6056/MGT058+1.tptp
%
%------------------------------------------------------------------------------