TSTP Solution File: SEU131+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU131+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 : art04.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:12:34 EST 2010
% Result : Theorem 10.49s
% Output : Solution 10.49s
% 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/SystemOnTPTP15448/SEU131+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15448/SEU131+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15448/SEU131+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 15544
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.89 CPU 8.02 WC
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(8, 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(9, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(12, axiom,![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(13, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(14, axiom,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(20, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(22, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(26, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(30, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(32, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(39, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t4_xboole_0)).
% fof(44, conjecture,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(45, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(47, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(53, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[39,theory(equality)])).
% fof(65, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[4])).
% cnf(66,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(74, 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)],[46])).
% fof(75, 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)],[74])).
% fof(76, 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(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&~(in(esk1_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[75])).
% fof(77, 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(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&~(in(esk1_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, 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(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk1_3(X5,X6,X7),X6))|in(esk1_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[77])).
% cnf(82,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[78])).
% cnf(83,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[78])).
% cnf(84,plain,(in(X4,X2)|X1!=set_difference(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(85, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[47])).
% fof(86, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk2_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[86])).
% fof(88, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk2_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[87])).
% cnf(89,plain,(X1=empty_set|in(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(95, plain,![X1]:![X2]:(~(subset(X1,X2))|set_intersection2(X1,X2)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(96, plain,![X3]:![X4]:(~(subset(X3,X4))|set_intersection2(X3,X4)=X3),inference(variable_rename,[status(thm)],[95])).
% cnf(97,plain,(set_intersection2(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% fof(98, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[13])).
% fof(99, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(101, plain,![X1]:![X2]:(~(subset(X1,X2))|set_union2(X1,X2)=X2),inference(fof_nnf,[status(thm)],[14])).
% fof(102, plain,![X3]:![X4]:(~(subset(X3,X4))|set_union2(X3,X4)=X4),inference(variable_rename,[status(thm)],[101])).
% cnf(103,plain,(set_union2(X1,X2)=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[102])).
% fof(115, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[20])).
% fof(116, plain,empty(esk3_0),inference(skolemize,[status(esa)],[115])).
% cnf(117,plain,(empty(esk3_0)),inference(split_conjunct,[status(thm)],[116])).
% fof(121, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[22])).
% fof(122, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[121])).
% cnf(123,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[122])).
% fof(134, 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)],[26])).
% fof(135, 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)],[134])).
% fof(136, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[135])).
% fof(137, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[136])).
% fof(138, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk6_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[137])).
% cnf(139,plain,(subset(X1,X2)|~in(esk6_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[138])).
% cnf(140,plain,(subset(X1,X2)|in(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[138])).
% cnf(141,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[138])).
% fof(150, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[30])).
% cnf(151,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[150])).
% fof(155, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[32])).
% fof(156, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[155])).
% cnf(157,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[156])).
% cnf(158,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[156])).
% fof(198, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:in(X3,set_intersection2(X1,X2)))&(![X3]:~(in(X3,set_intersection2(X1,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[53])).
% fof(199, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:in(X6,set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[198])).
% fof(200, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk10_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[199])).
% fof(201, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk10_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[200])).
% cnf(203,plain,(~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[201])).
% fof(208, negated_conjecture,?[X1]:?[X2]:((~(set_difference(X1,X2)=empty_set)|~(subset(X1,X2)))&(set_difference(X1,X2)=empty_set|subset(X1,X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(209, negated_conjecture,?[X3]:?[X4]:((~(set_difference(X3,X4)=empty_set)|~(subset(X3,X4)))&(set_difference(X3,X4)=empty_set|subset(X3,X4))),inference(variable_rename,[status(thm)],[208])).
% fof(210, negated_conjecture,((~(set_difference(esk11_0,esk12_0)=empty_set)|~(subset(esk11_0,esk12_0)))&(set_difference(esk11_0,esk12_0)=empty_set|subset(esk11_0,esk12_0))),inference(skolemize,[status(esa)],[209])).
% cnf(211,negated_conjecture,(subset(esk11_0,esk12_0)|set_difference(esk11_0,esk12_0)=empty_set),inference(split_conjunct,[status(thm)],[210])).
% cnf(212,negated_conjecture,(~subset(esk11_0,esk12_0)|set_difference(esk11_0,esk12_0)!=empty_set),inference(split_conjunct,[status(thm)],[210])).
% cnf(217,plain,(empty_set=esk3_0),inference(spm,[status(thm)],[100,117,theory(equality)])).
% cnf(286,plain,(set_union2(X1,X2)=X2|in(esk6_2(X1,X2),X1)),inference(spm,[status(thm)],[103,140,theory(equality)])).
% cnf(291,plain,(set_union2(X1,X2)=X2|~in(esk6_2(X1,X2),X2)),inference(spm,[status(thm)],[103,139,theory(equality)])).
% cnf(376,plain,(in(X1,set_union2(X2,X3))|~in(X1,X2)),inference(spm,[status(thm)],[141,151,theory(equality)])).
% cnf(381,plain,(in(X1,X2)|~in(X1,set_difference(X2,X3))),inference(er,[status(thm)],[84,theory(equality)])).
% cnf(386,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[83,theory(equality)])).
% cnf(443,plain,(in(X1,X2)|in(X1,set_difference(X3,X2))|~in(X1,X3)),inference(er,[status(thm)],[82,theory(equality)])).
% cnf(612,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=esk3_0),inference(rw,[status(thm)],[157,217,theory(equality)])).
% cnf(613,plain,(set_intersection2(X1,X2)=esk3_0|~disjoint(X1,X2)),inference(rw,[status(thm)],[158,217,theory(equality)])).
% cnf(614,negated_conjecture,(set_difference(esk11_0,esk12_0)!=esk3_0|~subset(esk11_0,esk12_0)),inference(rw,[status(thm)],[212,217,theory(equality)])).
% cnf(616,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk3_0|subset(esk11_0,esk12_0)),inference(rw,[status(thm)],[211,217,theory(equality)])).
% cnf(617,plain,(esk3_0=X1|in(esk2_1(X1),X1)),inference(rw,[status(thm)],[89,217,theory(equality)])).
% cnf(622,plain,(subset(esk3_0,X1)),inference(rw,[status(thm)],[66,217,theory(equality)])).
% cnf(630,plain,(set_intersection2(esk3_0,X1)=esk3_0),inference(spm,[status(thm)],[97,622,theory(equality)])).
% cnf(670,plain,(disjoint(esk3_0,X1)),inference(spm,[status(thm)],[612,630,theory(equality)])).
% cnf(686,plain,(disjoint(X1,esk3_0)),inference(spm,[status(thm)],[123,670,theory(equality)])).
% cnf(698,plain,(set_intersection2(X1,esk3_0)=esk3_0),inference(spm,[status(thm)],[613,686,theory(equality)])).
% cnf(730,plain,(~disjoint(X1,esk3_0)|~in(X2,esk3_0)),inference(spm,[status(thm)],[203,698,theory(equality)])).
% cnf(742,plain,($false|~in(X2,esk3_0)),inference(rw,[status(thm)],[730,686,theory(equality)])).
% cnf(743,plain,(~in(X2,esk3_0)),inference(cn,[status(thm)],[742,theory(equality)])).
% cnf(879,plain,(esk3_0=set_difference(X1,X2)|~in(esk2_1(set_difference(X1,X2)),X2)),inference(spm,[status(thm)],[386,617,theory(equality)])).
% cnf(2942,plain,(set_difference(X1,set_union2(X2,X3))=esk3_0|~in(esk2_1(set_difference(X1,set_union2(X2,X3))),X2)),inference(spm,[status(thm)],[879,376,theory(equality)])).
% cnf(3222,plain,(in(esk2_1(set_difference(X1,X2)),X1)|esk3_0=set_difference(X1,X2)),inference(spm,[status(thm)],[381,617,theory(equality)])).
% cnf(4726,negated_conjecture,(in(X1,esk3_0)|in(X1,esk12_0)|subset(esk11_0,esk12_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[443,616,theory(equality)])).
% cnf(4734,negated_conjecture,(in(X1,esk12_0)|subset(esk11_0,esk12_0)|~in(X1,esk11_0)),inference(sr,[status(thm)],[4726,743,theory(equality)])).
% cnf(4738,negated_conjecture,(in(X1,esk12_0)|~in(X1,esk11_0)),inference(csr,[status(thm)],[4734,141])).
% cnf(4743,negated_conjecture,(set_union2(X1,esk12_0)=esk12_0|~in(esk6_2(X1,esk12_0),esk11_0)),inference(spm,[status(thm)],[291,4738,theory(equality)])).
% cnf(4810,negated_conjecture,(set_union2(esk11_0,esk12_0)=esk12_0),inference(spm,[status(thm)],[4743,286,theory(equality)])).
% cnf(4811,negated_conjecture,(subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[151,4810,theory(equality)])).
% cnf(4893,negated_conjecture,(set_difference(esk11_0,esk12_0)!=esk3_0|$false),inference(rw,[status(thm)],[614,4811,theory(equality)])).
% cnf(4894,negated_conjecture,(set_difference(esk11_0,esk12_0)!=esk3_0),inference(cn,[status(thm)],[4893,theory(equality)])).
% cnf(262548,plain,(set_difference(X1,set_union2(X1,X2))=esk3_0),inference(spm,[status(thm)],[2942,3222,theory(equality)])).
% cnf(262719,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk3_0),inference(spm,[status(thm)],[262548,4810,theory(equality)])).
% cnf(262897,negated_conjecture,($false),inference(sr,[status(thm)],[262719,4894,theory(equality)])).
% cnf(262898,negated_conjecture,($false),262897,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10396
% # ...of these trivial : 480
% # ...subsumed : 8272
% # ...remaining for further processing: 1644
% # Other redundant clauses eliminated : 239
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 32
% # Backward-rewritten : 26
% # Generated clauses : 215259
% # ...of the previous two non-trivial : 185154
% # Contextual simplify-reflections : 405
% # Paramodulations : 214895
% # Factorizations : 90
% # Equation resolutions : 274
% # Current number of processed clauses: 1520
% # Positive orientable unit clauses: 320
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 54
% # Non-unit-clauses : 1144
% # Current number of unprocessed clauses: 170940
% # ...number of literals in the above : 529388
% # Clause-clause subsumption calls (NU) : 101943
% # Rec. Clause-clause subsumption calls : 87726
% # Unit Clause-clause subsumption calls : 814
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 628
% # Indexed BW rewrite successes : 39
% # Backwards rewriting index: 599 leaves, 2.59+/-3.853 terms/leaf
% # Paramod-from index: 294 leaves, 2.02+/-2.576 terms/leaf
% # Paramod-into index: 531 leaves, 2.35+/-3.134 terms/leaf
% # -------------------------------------------------
% # User time : 6.061 s
% # System time : 0.209 s
% # Total time : 6.270 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.62 CPU 9.76 WC
% FINAL PrfWatch: 9.62 CPU 9.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP15448/SEU131+2.tptp
%
%------------------------------------------------------------------------------