TSTP Solution File: SET955+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET955+1 : TPTP v5.0.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 : Thu Dec 30 00:23:13 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP10286/SET955+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10286/SET955+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10286/SET955+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 10382
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(X3=cartesian_product2(X1,X2)<=>![X4]:(in(X4,X3)<=>?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))),file('/tmp/SRASS.s.p', d2_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(7, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(9, conjecture,![X1]:![X2]:![X3]:![X4]:(![X5]:![X6]:(in(ordered_pair(X5,X6),cartesian_product2(X1,X2))<=>in(ordered_pair(X5,X6),cartesian_product2(X3,X4)))=>cartesian_product2(X1,X2)=cartesian_product2(X3,X4)),file('/tmp/SRASS.s.p', t108_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(![X5]:![X6]:(in(ordered_pair(X5,X6),cartesian_product2(X1,X2))<=>in(ordered_pair(X5,X6),cartesian_product2(X3,X4)))=>cartesian_product2(X1,X2)=cartesian_product2(X3,X4))),inference(assume_negation,[status(cth)],[9])).
% fof(17, plain,![X1]:![X2]:![X3]:((~(X3=cartesian_product2(X1,X2))|![X4]:((~(in(X4,X3))|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))&(![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6))))&(in(X4,X3)|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6))))|X3=cartesian_product2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|?[X11]:?[X12]:((in(X11,X7)&in(X12,X8))&X10=ordered_pair(X11,X12)))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(?[X15]:((~(in(X15,X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(X15=ordered_pair(X16,X17))))&(in(X15,X9)|?[X18]:?[X19]:((in(X18,X7)&in(X19,X8))&X15=ordered_pair(X18,X19))))|X9=cartesian_product2(X7,X8))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(((~(in(esk3_3(X7,X8,X9),X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17))))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))&(~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10)))))|~(X9=cartesian_product2(X7,X8)))),inference(shift_quantors,[status(thm)],[19])).
% fof(21, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))|X9=cartesian_product2(X7,X8))&((((in(esk4_3(X7,X8,X9),X7)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))&((in(esk5_3(X7,X8,X9),X8)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8)))&((esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))|~(X9=cartesian_product2(X7,X8)))&((((in(esk1_4(X7,X8,X9,X10),X7)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))&((in(esk2_4(X7,X8,X9,X10),X8)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8))))&((X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))))),inference(distribute,[status(thm)],[20])).
% cnf(22,plain,(X4=ordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4))|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(in(esk2_4(X2,X3,X1,X4),X3)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,plain,(in(esk1_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[21])).
% cnf(25,plain,(in(X4,X1)|X1!=cartesian_product2(X2,X3)|X4!=ordered_pair(X5,X6)|~in(X6,X3)|~in(X5,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(30, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(31, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:(((~(in(esk6_2(X4,X5),X4))|~(in(esk6_2(X4,X5),X5)))&(in(esk6_2(X4,X5),X4)|in(esk6_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X4]:![X5]:(((~(in(esk6_2(X4,X5),X4))|~(in(esk6_2(X4,X5),X5)))|X4=X5)&((in(esk6_2(X4,X5),X4)|in(esk6_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(X1=X2|in(esk6_2(X1,X2),X2)|in(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(X1=X2|~in(esk6_2(X1,X2),X2)|~in(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(44, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(45,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(47,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(![X5]:![X6]:((~(in(ordered_pair(X5,X6),cartesian_product2(X1,X2)))|in(ordered_pair(X5,X6),cartesian_product2(X3,X4)))&(~(in(ordered_pair(X5,X6),cartesian_product2(X3,X4)))|in(ordered_pair(X5,X6),cartesian_product2(X1,X2))))&~(cartesian_product2(X1,X2)=cartesian_product2(X3,X4))),inference(fof_nnf,[status(thm)],[10])).
% fof(49, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:(![X11]:![X12]:((~(in(ordered_pair(X11,X12),cartesian_product2(X7,X8)))|in(ordered_pair(X11,X12),cartesian_product2(X9,X10)))&(~(in(ordered_pair(X11,X12),cartesian_product2(X9,X10)))|in(ordered_pair(X11,X12),cartesian_product2(X7,X8))))&~(cartesian_product2(X7,X8)=cartesian_product2(X9,X10))),inference(variable_rename,[status(thm)],[48])).
% fof(50, negated_conjecture,(![X11]:![X12]:((~(in(ordered_pair(X11,X12),cartesian_product2(esk9_0,esk10_0)))|in(ordered_pair(X11,X12),cartesian_product2(esk11_0,esk12_0)))&(~(in(ordered_pair(X11,X12),cartesian_product2(esk11_0,esk12_0)))|in(ordered_pair(X11,X12),cartesian_product2(esk9_0,esk10_0))))&~(cartesian_product2(esk9_0,esk10_0)=cartesian_product2(esk11_0,esk12_0))),inference(skolemize,[status(esa)],[49])).
% fof(51, negated_conjecture,![X11]:![X12]:(((~(in(ordered_pair(X11,X12),cartesian_product2(esk9_0,esk10_0)))|in(ordered_pair(X11,X12),cartesian_product2(esk11_0,esk12_0)))&(~(in(ordered_pair(X11,X12),cartesian_product2(esk11_0,esk12_0)))|in(ordered_pair(X11,X12),cartesian_product2(esk9_0,esk10_0))))&~(cartesian_product2(esk9_0,esk10_0)=cartesian_product2(esk11_0,esk12_0))),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,negated_conjecture,(cartesian_product2(esk9_0,esk10_0)!=cartesian_product2(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,negated_conjecture,(in(ordered_pair(X1,X2),cartesian_product2(esk9_0,esk10_0))|~in(ordered_pair(X1,X2),cartesian_product2(esk11_0,esk12_0))),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,negated_conjecture,(in(ordered_pair(X1,X2),cartesian_product2(esk11_0,esk12_0))|~in(ordered_pair(X1,X2),cartesian_product2(esk9_0,esk10_0))),inference(split_conjunct,[status(thm)],[51])).
% cnf(56,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk9_0,esk10_0))|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk11_0,esk12_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[53,45,theory(equality)]),45,theory(equality)]),['unfolding']).
% cnf(57,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk11_0,esk12_0))|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk9_0,esk10_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,45,theory(equality)]),45,theory(equality)]),['unfolding']).
% cnf(58,plain,(unordered_pair(unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)),singleton(esk1_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[22,45,theory(equality)]),['unfolding']).
% cnf(59,plain,(in(X4,X1)|cartesian_product2(X2,X3)!=X1|unordered_pair(unordered_pair(X5,X6),singleton(X5))!=X4|~in(X6,X3)|~in(X5,X2)),inference(rw,[status(thm)],[25,45,theory(equality)]),['unfolding']).
% cnf(62,plain,(unordered_pair(singleton(esk1_4(X2,X3,X1,X4)),unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[58,47,theory(equality)])).
% cnf(71,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(esk11_0,esk12_0))|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(esk9_0,esk10_0))),inference(spm,[status(thm)],[57,47,theory(equality)])).
% cnf(89,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|cartesian_product2(X4,X5)!=X3|~in(X2,X5)|~in(X1,X4)),inference(er,[status(thm)],[59,theory(equality)])).
% cnf(168,negated_conjecture,(in(X4,cartesian_product2(esk11_0,esk12_0))|~in(X4,cartesian_product2(esk9_0,esk10_0))|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[71,62,theory(equality)])).
% cnf(169,negated_conjecture,(in(X1,cartesian_product2(esk11_0,esk12_0))|~in(X1,cartesian_product2(esk9_0,esk10_0))|~in(X1,cartesian_product2(X2,X3))),inference(er,[status(thm)],[168,theory(equality)])).
% cnf(232,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(er,[status(thm)],[89,theory(equality)])).
% cnf(243,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk9_0,esk10_0))|~in(X2,esk12_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[56,232,theory(equality)])).
% cnf(262,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(esk9_0,esk10_0))|~in(X2,esk12_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[243,47,theory(equality)])).
% cnf(306,negated_conjecture,(in(X4,cartesian_product2(esk9_0,esk10_0))|~in(esk2_4(X1,X2,X3,X4),esk12_0)|~in(esk1_4(X1,X2,X3,X4),esk11_0)|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[262,62,theory(equality)])).
% cnf(537,negated_conjecture,(in(X1,cartesian_product2(esk9_0,esk10_0))|cartesian_product2(X2,esk12_0)!=X3|~in(esk1_4(X2,esk12_0,X3,X1),esk11_0)|~in(X1,X3)),inference(spm,[status(thm)],[306,23,theory(equality)])).
% cnf(538,negated_conjecture,(in(X1,cartesian_product2(esk9_0,esk10_0))|cartesian_product2(esk11_0,esk12_0)!=X2|~in(X1,X2)),inference(spm,[status(thm)],[537,24,theory(equality)])).
% cnf(543,negated_conjecture,(in(X1,cartesian_product2(esk9_0,esk10_0))|~in(X1,cartesian_product2(esk11_0,esk12_0))),inference(er,[status(thm)],[538,theory(equality)])).
% cnf(544,negated_conjecture,(in(esk6_2(X1,cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk9_0,esk10_0))|X1=cartesian_product2(esk11_0,esk12_0)|in(esk6_2(X1,cartesian_product2(esk11_0,esk12_0)),X1)),inference(spm,[status(thm)],[543,34,theory(equality)])).
% cnf(569,negated_conjecture,(cartesian_product2(esk9_0,esk10_0)=cartesian_product2(esk11_0,esk12_0)|in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk9_0,esk10_0))),inference(ef,[status(thm)],[544,theory(equality)])).
% cnf(577,negated_conjecture,(in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk9_0,esk10_0))),inference(sr,[status(thm)],[569,52,theory(equality)])).
% cnf(580,negated_conjecture,(in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk11_0,esk12_0))|~in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk9_0,esk10_0))),inference(spm,[status(thm)],[169,577,theory(equality)])).
% cnf(582,negated_conjecture,(in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk11_0,esk12_0))|$false),inference(rw,[status(thm)],[580,577,theory(equality)])).
% cnf(583,negated_conjecture,(in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk11_0,esk12_0))),inference(cn,[status(thm)],[582,theory(equality)])).
% cnf(592,negated_conjecture,(cartesian_product2(esk9_0,esk10_0)=cartesian_product2(esk11_0,esk12_0)|~in(esk6_2(cartesian_product2(esk9_0,esk10_0),cartesian_product2(esk11_0,esk12_0)),cartesian_product2(esk9_0,esk10_0))),inference(spm,[status(thm)],[35,583,theory(equality)])).
% cnf(597,negated_conjecture,(cartesian_product2(esk9_0,esk10_0)=cartesian_product2(esk11_0,esk12_0)|$false),inference(rw,[status(thm)],[592,577,theory(equality)])).
% cnf(598,negated_conjecture,(cartesian_product2(esk9_0,esk10_0)=cartesian_product2(esk11_0,esk12_0)),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(599,negated_conjecture,($false),inference(sr,[status(thm)],[598,52,theory(equality)])).
% cnf(600,negated_conjecture,($false),599,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 352
% # ...of these trivial : 0
% # ...subsumed : 208
% # ...remaining for further processing: 144
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 0
% # Generated clauses : 492
% # ...of the previous two non-trivial : 460
% # Contextual simplify-reflections : 21
% # Paramodulations : 475
% # Factorizations : 4
% # Equation resolutions : 13
% # Current number of processed clauses: 111
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 101
% # Current number of unprocessed clauses: 108
% # ...number of literals in the above : 495
% # Clause-clause subsumption calls (NU) : 3469
% # Rec. Clause-clause subsumption calls : 2130
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 134 leaves, 1.82+/-1.824 terms/leaf
% # Paramod-from index: 22 leaves, 1.45+/-0.498 terms/leaf
% # Paramod-into index: 105 leaves, 1.53+/-0.840 terms/leaf
% # -------------------------------------------------
% # User time : 0.047 s
% # System time : 0.004 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP10286/SET955+1.tptp
%
%------------------------------------------------------------------------------