TSTP Solution File: SET973+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET973+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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:27:48 EST 2010
% Result : Theorem 9.91s
% Output : Solution 9.91s
% 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/SystemOnTPTP6385/SET973+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6385/SET973+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6385/SET973+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 6481
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.91 CPU 4.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.91 CPU 6.03 WC
% PrfWatch: 7.72 CPU 8.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(3, axiom,![X1]:![X2]:![X3]:(cartesian_product2(set_difference(X1,X2),X3)=set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&cartesian_product2(X3,set_difference(X1,X2))=set_difference(cartesian_product2(X3,X1),cartesian_product2(X3,X2))),file('/tmp/SRASS.s.p', t125_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:set_difference(X1,set_intersection2(X2,X3))=set_union2(set_difference(X1,X2),set_difference(X1,X3)),file('/tmp/SRASS.s.p', t54_xboole_1)).
% fof(5, 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(7, axiom,![X1]:![X2]:![X3]:![X4]:cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),file('/tmp/SRASS.s.p', t123_zfmisc_1)).
% fof(11, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(19, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(22, axiom,![X1]:![X2]:subset(set_intersection2(X1,X2),X1),file('/tmp/SRASS.s.p', t17_xboole_1)).
% fof(23, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(26, conjecture,![X1]:![X2]:![X3]:![X4]:set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),file('/tmp/SRASS.s.p', t126_zfmisc_1)).
% fof(27, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4)))),inference(assume_negation,[status(cth)],[26])).
% fof(28, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(34, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(35,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(38, plain,![X4]:![X5]:![X6]:(cartesian_product2(set_difference(X4,X5),X6)=set_difference(cartesian_product2(X4,X6),cartesian_product2(X5,X6))&cartesian_product2(X6,set_difference(X4,X5))=set_difference(cartesian_product2(X6,X4),cartesian_product2(X6,X5))),inference(variable_rename,[status(thm)],[3])).
% cnf(39,plain,(cartesian_product2(X1,set_difference(X2,X3))=set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3))),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(cartesian_product2(set_difference(X1,X2),X3)=set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3))),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X4]:![X5]:![X6]:set_difference(X4,set_intersection2(X5,X6))=set_union2(set_difference(X4,X5),set_difference(X4,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(42,plain,(set_difference(X1,set_intersection2(X2,X3))=set_union2(set_difference(X1,X2),set_difference(X1,X3))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, 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)],[28])).
% fof(44, 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)],[43])).
% fof(45, 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)],[44])).
% fof(46, 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)],[45])).
% fof(47, 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)],[46])).
% cnf(48,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X1)|in(esk1_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[47])).
% cnf(50,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X3)|~in(esk1_3(X2,X3,X1),X2)|~in(esk1_3(X2,X3,X1),X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(52,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[47])).
% cnf(53,plain,(in(X4,X2)|X1!=set_difference(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(65, plain,![X5]:![X6]:![X7]:![X8]:cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8))=set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),inference(variable_rename,[status(thm)],[7])).
% cnf(66,plain,(cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(split_conjunct,[status(thm)],[65])).
% fof(76, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(77,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(107, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[19])).
% fof(108, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[108])).
% cnf(110,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[109])).
% fof(121, plain,![X3]:![X4]:subset(set_intersection2(X3,X4),X3),inference(variable_rename,[status(thm)],[22])).
% cnf(122,plain,(subset(set_intersection2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(123, 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)],[23])).
% fof(124, 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)],[123])).
% fof(125, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk10_2(X4,X5),X4)&~(in(esk10_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[124])).
% fof(126, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk10_2(X4,X5),X4)&~(in(esk10_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[125])).
% fof(127, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk10_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk10_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(subset(X1,X2)|~in(esk10_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,plain,(subset(X1,X2)|in(esk10_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[127])).
% fof(135, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:~(set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4)))),inference(fof_nnf,[status(thm)],[27])).
% fof(136, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:~(set_difference(cartesian_product2(X5,X6),cartesian_product2(X7,X8))=set_union2(cartesian_product2(set_difference(X5,X7),X6),cartesian_product2(X5,set_difference(X6,X8)))),inference(variable_rename,[status(thm)],[135])).
% fof(137, negated_conjecture,~(set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0))=set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0)))),inference(skolemize,[status(esa)],[136])).
% cnf(138,negated_conjecture,(set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0))!=set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0)))),inference(split_conjunct,[status(thm)],[137])).
% cnf(151,negated_conjecture,(set_union2(cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0)),cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0))!=set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0))),inference(rw,[status(thm)],[138,35,theory(equality)])).
% cnf(179,plain,(set_union2(set_difference(cartesian_product2(X1,X2),X3),cartesian_product2(set_difference(X1,X4),X2))=set_difference(cartesian_product2(X1,X2),set_intersection2(X3,cartesian_product2(X4,X2)))),inference(spm,[status(thm)],[42,40,theory(equality)])).
% cnf(185,plain,(X1=set_intersection2(X1,X2)|~subset(X1,set_intersection2(X1,X2))),inference(spm,[status(thm)],[110,122,theory(equality)])).
% cnf(203,plain,(cartesian_product2(set_intersection2(X1,X2),set_intersection2(X4,X3))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(spm,[status(thm)],[66,77,theory(equality)])).
% cnf(208,plain,(set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(rw,[status(thm)],[203,66,theory(equality)])).
% cnf(215,plain,(in(X1,X2)|~in(X1,set_difference(X2,X3))),inference(er,[status(thm)],[53,theory(equality)])).
% cnf(230,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[52,theory(equality)])).
% cnf(258,plain,(set_difference(X4,X5)=X4|in(esk1_3(X4,X5,X4),X4)),inference(ef,[status(thm)],[49,theory(equality)])).
% cnf(267,plain,(set_difference(X1,X1)=X2|in(esk1_3(X1,X1,X2),X2)),inference(spm,[status(thm)],[48,49,theory(equality)])).
% cnf(368,plain,(set_difference(X1,X1)=set_difference(X2,X3)|~in(esk1_3(X1,X1,set_difference(X2,X3)),X3)),inference(spm,[status(thm)],[230,267,theory(equality)])).
% cnf(374,plain,(in(esk10_2(set_difference(X1,X2),X3),X1)|subset(set_difference(X1,X2),X3)),inference(spm,[status(thm)],[215,129,theory(equality)])).
% cnf(386,plain,(in(esk1_3(X1,X1,set_difference(X2,X3)),X2)|set_difference(X1,X1)=set_difference(X2,X3)),inference(spm,[status(thm)],[215,267,theory(equality)])).
% cnf(851,plain,(set_union2(cartesian_product2(X1,set_difference(X2,X3)),cartesian_product2(set_difference(X1,X4),X2))=set_difference(cartesian_product2(X1,X2),set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X4,X2)))),inference(spm,[status(thm)],[179,39,theory(equality)])).
% cnf(1033,plain,(subset(set_difference(X1,X2),X1)),inference(spm,[status(thm)],[128,374,theory(equality)])).
% cnf(1333,plain,(set_difference(X1,X2)=X1|in(esk1_3(X1,X2,X1),X2)|~in(esk1_3(X1,X2,X1),X1)),inference(spm,[status(thm)],[50,258,theory(equality)])).
% cnf(1516,plain,(set_difference(X1,X1)=set_difference(X2,X2)),inference(spm,[status(thm)],[368,386,theory(equality)])).
% cnf(1535,plain,(in(X1,X2)|~in(X1,set_difference(X3,X3))),inference(spm,[status(thm)],[215,1516,theory(equality)])).
% cnf(1536,plain,(~in(X1,set_difference(X3,X3))|~in(X1,X2)),inference(spm,[status(thm)],[230,1516,theory(equality)])).
% cnf(1547,plain,(subset(set_difference(X2,X2),X1)),inference(spm,[status(thm)],[1033,1516,theory(equality)])).
% cnf(1633,plain,(set_intersection2(set_difference(X1,X1),X2)=set_difference(X1,X1)),inference(spm,[status(thm)],[185,1547,theory(equality)])).
% cnf(7109,plain,(~in(X1,set_difference(X3,X3))),inference(csr,[status(thm)],[1536,1535])).
% cnf(134208,negated_conjecture,(set_difference(cartesian_product2(esk11_0,esk12_0),set_intersection2(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)))!=set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[151,851,theory(equality)]),208,theory(equality)])).
% cnf(265528,plain,(set_difference(X1,X2)=X1|in(esk1_3(X1,X2,X1),X2)),inference(csr,[status(thm)],[1333,258])).
% cnf(265563,plain,(set_difference(X1,set_difference(X2,X2))=X1),inference(spm,[status(thm)],[7109,265528,theory(equality)])).
% cnf(265783,plain,(set_union2(X1,set_difference(X1,X3))=set_difference(X1,set_intersection2(set_difference(X2,X2),X3))),inference(spm,[status(thm)],[42,265563,theory(equality)])).
% cnf(266327,plain,(set_union2(X1,set_difference(X1,X3))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[265783,1633,theory(equality)]),265563,theory(equality)])).
% cnf(269804,plain,(set_union2(X1,set_difference(X2,X2))=X1),inference(spm,[status(thm)],[266327,1516,theory(equality)])).
% cnf(270805,plain,(X1=set_union2(set_difference(X2,X2),X1)),inference(spm,[status(thm)],[35,269804,theory(equality)])).
% cnf(271917,plain,(set_difference(X1,X2)=set_difference(X1,set_intersection2(X1,X2))),inference(spm,[status(thm)],[42,270805,theory(equality)])).
% cnf(312551,negated_conjecture,($false),inference(rw,[status(thm)],[134208,271917,theory(equality)])).
% cnf(312552,negated_conjecture,($false),inference(cn,[status(thm)],[312551,theory(equality)])).
% cnf(312553,negated_conjecture,($false),312552,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6071
% # ...of these trivial : 356
% # ...subsumed : 4864
% # ...remaining for further processing: 851
% # Other redundant clauses eliminated : 63
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 50
% # Backward-rewritten : 50
% # Generated clauses : 171483
% # ...of the previous two non-trivial : 140963
% # Contextual simplify-reflections : 10
% # Paramodulations : 171280
% # Factorizations : 80
% # Equation resolutions : 96
% # Current number of processed clauses: 677
% # Positive orientable unit clauses: 205
% # Positive unorientable unit clauses: 65
% # Negative unit clauses : 19
% # Non-unit-clauses : 388
% # Current number of unprocessed clauses: 81667
% # ...number of literals in the above : 152253
% # Clause-clause subsumption calls (NU) : 18716
% # Rec. Clause-clause subsumption calls : 15241
% # Unit Clause-clause subsumption calls : 4487
% # Rewrite failures with RHS unbound : 3008
% # Indexed BW rewrite attempts : 3132
% # Indexed BW rewrite successes : 748
% # Backwards rewriting index: 499 leaves, 2.88+/-3.554 terms/leaf
% # Paramod-from index: 205 leaves, 2.05+/-1.880 terms/leaf
% # Paramod-into index: 428 leaves, 2.52+/-2.977 terms/leaf
% # -------------------------------------------------
% # User time : 5.010 s
% # System time : 0.176 s
% # Total time : 5.186 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.07 CPU 9.60 WC
% FINAL PrfWatch: 9.07 CPU 9.60 WC
% SZS output end Solution for /tmp/SystemOnTPTP6385/SET973+1.tptp
%
%------------------------------------------------------------------------------