TSTP Solution File: SEU171+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU171+2 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:25:17 EST 2010
% Result : Theorem 2.29s
% Output : Solution 2.29s
% 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/SystemOnTPTP24114/SEU171+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24114/SEU171+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24114/SEU171+2.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 24210
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(6, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>![X3]:(in(X3,X2)=>in(X3,X1))),file('/tmp/SRASS.s.p', l3_subset_1)).
% fof(8, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(14, axiom,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),file('/tmp/SRASS.s.p', d2_subset_1)).
% fof(25, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(30, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(49, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(50, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~((in(X3,X1)&in(X3,X2)))))&~((?[X3]:(in(X3,X1)&in(X3,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t3_xboole_0)).
% fof(76, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(87, axiom,![X1]:![X2]:subset(set_difference(X1,X2),X1),file('/tmp/SRASS.s.p', t36_xboole_1)).
% fof(111, conjecture,![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2)))))),file('/tmp/SRASS.s.p', t50_subset_1)).
% fof(112, negated_conjecture,~(![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2))))))),inference(assume_negation,[status(cth)],[111])).
% fof(114, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(116, plain,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(117, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[25,theory(equality)])).
% fof(121, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~((in(X3,X1)&in(X3,X2)))))&~((?[X3]:(in(X3,X1)&in(X3,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[50,theory(equality)])).
% fof(131, negated_conjecture,~(![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2))))))),inference(fof_simplification,[status(thm)],[112,theory(equality)])).
% fof(135, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[114])).
% fof(136, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[135])).
% fof(137, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[136])).
% fof(138, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[137])).
% cnf(139,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[138])).
% cnf(140,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[138])).
% fof(150, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|![X3]:(~(in(X3,X2))|in(X3,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(151, plain,![X4]:![X5]:(~(element(X5,powerset(X4)))|![X6]:(~(in(X6,X5))|in(X6,X4))),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X4]:![X5]:![X6]:((~(in(X6,X5))|in(X6,X4))|~(element(X5,powerset(X4)))),inference(shift_quantors,[status(thm)],[151])).
% cnf(153,plain,(in(X3,X2)|~element(X1,powerset(X2))|~in(X3,X1)),inference(split_conjunct,[status(thm)],[152])).
% fof(160, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(161, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[160])).
% cnf(162,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[161])).
% fof(186, plain,![X1]:![X2]:((empty(X1)|((~(element(X2,X1))|in(X2,X1))&(~(in(X2,X1))|element(X2,X1))))&(~(empty(X1))|((~(element(X2,X1))|empty(X2))&(~(empty(X2))|element(X2,X1))))),inference(fof_nnf,[status(thm)],[116])).
% fof(187, plain,![X3]:![X4]:((empty(X3)|((~(element(X4,X3))|in(X4,X3))&(~(in(X4,X3))|element(X4,X3))))&(~(empty(X3))|((~(element(X4,X3))|empty(X4))&(~(empty(X4))|element(X4,X3))))),inference(variable_rename,[status(thm)],[186])).
% fof(188, plain,![X3]:![X4]:((((~(element(X4,X3))|in(X4,X3))|empty(X3))&((~(in(X4,X3))|element(X4,X3))|empty(X3)))&(((~(element(X4,X3))|empty(X4))|~(empty(X3)))&((~(empty(X4))|element(X4,X3))|~(empty(X3))))),inference(distribute,[status(thm)],[187])).
% cnf(192,plain,(empty(X1)|in(X2,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[188])).
% fof(234, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&~(in(X4,X2))))&((~(in(X4,X1))|in(X4,X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|in(X4,X2)))&(in(X4,X3)|(in(X4,X1)&~(in(X4,X2)))))|X3=set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[117])).
% fof(235, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|in(X9,X6)))&(in(X9,X7)|(in(X9,X5)&~(in(X9,X6)))))|X7=set_difference(X5,X6))),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk9_3(X5,X6,X7),X7))|(~(in(esk9_3(X5,X6,X7),X5))|in(esk9_3(X5,X6,X7),X6)))&(in(esk9_3(X5,X6,X7),X7)|(in(esk9_3(X5,X6,X7),X5)&~(in(esk9_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[235])).
% fof(237, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7)))|~(X7=set_difference(X5,X6)))&(((~(in(esk9_3(X5,X6,X7),X7))|(~(in(esk9_3(X5,X6,X7),X5))|in(esk9_3(X5,X6,X7),X6)))&(in(esk9_3(X5,X6,X7),X7)|(in(esk9_3(X5,X6,X7),X5)&~(in(esk9_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[236])).
% fof(238, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk9_3(X5,X6,X7),X7))|(~(in(esk9_3(X5,X6,X7),X5))|in(esk9_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk9_3(X5,X6,X7),X5)|in(esk9_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk9_3(X5,X6,X7),X6))|in(esk9_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[237])).
% cnf(242,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[238])).
% fof(280, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[30])).
% fof(281, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[280])).
% fof(282, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk15_2(X4,X5),X4)&~(in(esk15_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[281])).
% fof(283, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk15_2(X4,X5),X4)&~(in(esk15_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[282])).
% fof(284, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk15_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk15_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[283])).
% cnf(287,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[284])).
% fof(343, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[49])).
% fof(344, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[343])).
% cnf(345,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[344])).
% fof(346, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:(in(X3,X1)&in(X3,X2)))&(![X3]:(~(in(X3,X1))|~(in(X3,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[121])).
% fof(347, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:(in(X6,X4)&in(X6,X5)))&(![X7]:(~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[346])).
% fof(348, plain,![X4]:![X5]:((disjoint(X4,X5)|(in(esk19_2(X4,X5),X4)&in(esk19_2(X4,X5),X5)))&(![X7]:(~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[347])).
% fof(349, plain,![X4]:![X5]:![X7]:(((~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|(in(esk19_2(X4,X5),X4)&in(esk19_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[348])).
% fof(350, plain,![X4]:![X5]:![X7]:(((~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))&((in(esk19_2(X4,X5),X4)|disjoint(X4,X5))&(in(esk19_2(X4,X5),X5)|disjoint(X4,X5)))),inference(distribute,[status(thm)],[349])).
% cnf(351,plain,(disjoint(X1,X2)|in(esk19_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[350])).
% fof(452, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[76])).
% fof(453, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[452])).
% cnf(455,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[453])).
% fof(495, plain,![X3]:![X4]:subset(set_difference(X3,X4),X3),inference(variable_rename,[status(thm)],[87])).
% cnf(496,plain,(subset(set_difference(X1,X2),X1)),inference(split_conjunct,[status(thm)],[495])).
% fof(549, negated_conjecture,?[X1]:(~(X1=empty_set)&?[X2]:(element(X2,powerset(X1))&?[X3]:(element(X3,X1)&(~(in(X3,X2))&~(in(X3,subset_complement(X1,X2))))))),inference(fof_nnf,[status(thm)],[131])).
% fof(550, negated_conjecture,?[X4]:(~(X4=empty_set)&?[X5]:(element(X5,powerset(X4))&?[X6]:(element(X6,X4)&(~(in(X6,X5))&~(in(X6,subset_complement(X4,X5))))))),inference(variable_rename,[status(thm)],[549])).
% fof(551, negated_conjecture,(~(esk28_0=empty_set)&(element(esk29_0,powerset(esk28_0))&(element(esk30_0,esk28_0)&(~(in(esk30_0,esk29_0))&~(in(esk30_0,subset_complement(esk28_0,esk29_0))))))),inference(skolemize,[status(esa)],[550])).
% cnf(552,negated_conjecture,(~in(esk30_0,subset_complement(esk28_0,esk29_0))),inference(split_conjunct,[status(thm)],[551])).
% cnf(553,negated_conjecture,(~in(esk30_0,esk29_0)),inference(split_conjunct,[status(thm)],[551])).
% cnf(554,negated_conjecture,(element(esk30_0,esk28_0)),inference(split_conjunct,[status(thm)],[551])).
% cnf(555,negated_conjecture,(element(esk29_0,powerset(esk28_0))),inference(split_conjunct,[status(thm)],[551])).
% cnf(556,negated_conjecture,(esk28_0!=empty_set),inference(split_conjunct,[status(thm)],[551])).
% cnf(653,negated_conjecture,(empty(esk28_0)|in(esk30_0,esk28_0)),inference(spm,[status(thm)],[192,554,theory(equality)])).
% cnf(688,negated_conjecture,(set_difference(esk28_0,esk29_0)=subset_complement(esk28_0,esk29_0)),inference(spm,[status(thm)],[162,555,theory(equality)])).
% cnf(731,negated_conjecture,(in(X1,esk28_0)|~in(X1,esk29_0)),inference(spm,[status(thm)],[153,555,theory(equality)])).
% cnf(806,plain,(disjoint(X2,X1)|empty_set!=X1),inference(spm,[status(thm)],[140,351,theory(equality)])).
% cnf(1238,plain,(in(X1,X2)|in(X1,set_difference(X3,X2))|~in(X1,X3)),inference(er,[status(thm)],[242,theory(equality)])).
% cnf(2589,negated_conjecture,(in(esk1_1(esk29_0),esk28_0)|empty_set=esk29_0),inference(spm,[status(thm)],[731,139,theory(equality)])).
% cnf(2591,negated_conjecture,(esk29_0=empty_set|~empty(esk28_0)),inference(spm,[status(thm)],[345,2589,theory(equality)])).
% cnf(2616,negated_conjecture,(subset(subset_complement(esk28_0,esk29_0),esk28_0)),inference(spm,[status(thm)],[496,688,theory(equality)])).
% cnf(2863,negated_conjecture,(in(X1,esk28_0)|~in(X1,subset_complement(esk28_0,esk29_0))),inference(spm,[status(thm)],[287,2616,theory(equality)])).
% cnf(2903,negated_conjecture,(in(esk1_1(subset_complement(esk28_0,esk29_0)),esk28_0)|empty_set=subset_complement(esk28_0,esk29_0)),inference(spm,[status(thm)],[2863,139,theory(equality)])).
% cnf(2929,negated_conjecture,(subset_complement(esk28_0,esk29_0)=empty_set|~empty(esk28_0)),inference(spm,[status(thm)],[345,2903,theory(equality)])).
% cnf(4513,plain,(set_difference(X1,X2)=X1|empty_set!=X2),inference(spm,[status(thm)],[455,806,theory(equality)])).
% cnf(4912,negated_conjecture,(esk28_0=subset_complement(esk28_0,esk29_0)|empty_set!=esk29_0),inference(spm,[status(thm)],[688,4513,theory(equality)])).
% cnf(5018,negated_conjecture,(esk28_0=empty_set|~empty(esk28_0)|esk29_0!=empty_set),inference(spm,[status(thm)],[2929,4912,theory(equality)])).
% cnf(5051,negated_conjecture,(~empty(esk28_0)|esk29_0!=empty_set),inference(sr,[status(thm)],[5018,556,theory(equality)])).
% cnf(5057,negated_conjecture,(~empty(esk28_0)),inference(csr,[status(thm)],[5051,2591])).
% cnf(5061,negated_conjecture,(in(esk30_0,esk28_0)),inference(sr,[status(thm)],[653,5057,theory(equality)])).
% cnf(22328,negated_conjecture,(in(X1,subset_complement(esk28_0,esk29_0))|in(X1,esk29_0)|~in(X1,esk28_0)),inference(spm,[status(thm)],[1238,688,theory(equality)])).
% cnf(22373,negated_conjecture,(in(esk30_0,esk29_0)|~in(esk30_0,esk28_0)),inference(spm,[status(thm)],[552,22328,theory(equality)])).
% cnf(22428,negated_conjecture,(in(esk30_0,esk29_0)|$false),inference(rw,[status(thm)],[22373,5061,theory(equality)])).
% cnf(22429,negated_conjecture,(in(esk30_0,esk29_0)),inference(cn,[status(thm)],[22428,theory(equality)])).
% cnf(22430,negated_conjecture,($false),inference(sr,[status(thm)],[22429,553,theory(equality)])).
% cnf(22431,negated_conjecture,($false),22430,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3317
% # ...of these trivial : 29
% # ...subsumed : 2207
% # ...remaining for further processing: 1081
% # Other redundant clauses eliminated : 143
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 33
% # Backward-rewritten : 7
% # Generated clauses : 17272
% # ...of the previous two non-trivial : 15498
% # Contextual simplify-reflections : 536
% # Paramodulations : 17040
% # Factorizations : 16
% # Equation resolutions : 204
% # Current number of processed clauses: 867
% # Positive orientable unit clauses: 80
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 130
% # Non-unit-clauses : 653
% # Current number of unprocessed clauses: 12236
% # ...number of literals in the above : 40450
% # Clause-clause subsumption calls (NU) : 42358
% # Rec. Clause-clause subsumption calls : 36288
% # Unit Clause-clause subsumption calls : 1098
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 71
% # Indexed BW rewrite successes : 30
% # Backwards rewriting index: 466 leaves, 1.47+/-1.557 terms/leaf
% # Paramod-from index: 230 leaves, 1.17+/-0.474 terms/leaf
% # Paramod-into index: 450 leaves, 1.39+/-1.212 terms/leaf
% # -------------------------------------------------
% # User time : 0.743 s
% # System time : 0.021 s
% # Total time : 0.764 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.13 CPU 1.22 WC
% FINAL PrfWatch: 1.13 CPU 1.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP24114/SEU171+2.tptp
%
%------------------------------------------------------------------------------