TSTP Solution File: SET812+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET812+4 : TPTP v5.0.0. Released v3.2.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 00:10:54 EST 2010
% Result : Theorem 124.21s
% Output : Solution 127.66s
% 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/SystemOnTPTP29805/SET812+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thV10:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... intersection:
% CSA axiom intersection found
% Looking for CSA axiom ... power_set:
% CSA axiom power_set found
% Looking for CSA axiom ... equal_set:
% CSA axiom equal_set found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... subset:
% CSA axiom subset found
% Looking for CSA axiom ... set_member:
% CSA axiom set_member found
% Looking for CSA axiom ... rel_member:
% CSA axiom rel_member found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ordinal_number: CSA axiom ordinal_number found
% Looking for CSA axiom ... strict_order:
% CSA axiom strict_order found
% Looking for CSA axiom ... union:
% CSA axiom union found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :union:strict_order:ordinal_number:rel_member:set_member:subset:equal_set:power_set:intersection (9)
% Unselected axioms are ... :initial_segment:singleton:unordered_pair:least:strict_well_order:successor:empty_set:difference:sum:product (10)
% SZS status THM for /tmp/SystemOnTPTP29805/SET812+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP29805/SET812+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 31655
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X1,union(X2,X3))<=>(member(X1,X2)|member(X1,X3))),file('/tmp/SRASS.s.p', union)).
% fof(3, axiom,![X2]:(member(X2,on)<=>((set(X2)&strict_well_order(member_predicate,X2))&![X1]:(member(X1,X2)=>subset(X1,X2)))),file('/tmp/SRASS.s.p', ordinal_number)).
% fof(4, axiom,![X1]:![X6]:(apply(member_predicate,X1,X6)<=>member(X1,X6)),file('/tmp/SRASS.s.p', rel_member)).
% fof(6, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(7, axiom,![X2]:![X3]:(equal_set(X2,X3)<=>(subset(X2,X3)&subset(X3,X2))),file('/tmp/SRASS.s.p', equal_set)).
% fof(8, axiom,![X1]:![X2]:(member(X1,power_set(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', power_set)).
% fof(9, axiom,![X1]:![X2]:![X3]:(member(X1,intersection(X2,X3))<=>(member(X1,X2)&member(X1,X3))),file('/tmp/SRASS.s.p', intersection)).
% fof(10, conjecture,![X2]:(member(X2,on)=>equal_set(X2,intersection(X2,power_set(X2)))),file('/tmp/SRASS.s.p', thV10)).
% fof(11, negated_conjecture,~(![X2]:(member(X2,on)=>equal_set(X2,intersection(X2,power_set(X2))))),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,![X1]:![X2]:![X3]:((~(member(X1,union(X2,X3)))|(member(X1,X2)|member(X1,X3)))&((~(member(X1,X2))&~(member(X1,X3)))|member(X1,union(X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(13, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))&~(member(X4,X6)))|member(X4,union(X5,X6)))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))|member(X4,union(X5,X6)))&(~(member(X4,X6))|member(X4,union(X5,X6))))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[14])).
% fof(49, plain,![X2]:((~(member(X2,on))|((set(X2)&strict_well_order(member_predicate,X2))&![X1]:(~(member(X1,X2))|subset(X1,X2))))&(((~(set(X2))|~(strict_well_order(member_predicate,X2)))|?[X1]:(member(X1,X2)&~(subset(X1,X2))))|member(X2,on))),inference(fof_nnf,[status(thm)],[3])).
% fof(50, plain,![X3]:((~(member(X3,on))|((set(X3)&strict_well_order(member_predicate,X3))&![X4]:(~(member(X4,X3))|subset(X4,X3))))&(((~(set(X3))|~(strict_well_order(member_predicate,X3)))|?[X5]:(member(X5,X3)&~(subset(X5,X3))))|member(X3,on))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X3]:((~(member(X3,on))|((set(X3)&strict_well_order(member_predicate,X3))&![X4]:(~(member(X4,X3))|subset(X4,X3))))&(((~(set(X3))|~(strict_well_order(member_predicate,X3)))|(member(esk6_1(X3),X3)&~(subset(esk6_1(X3),X3))))|member(X3,on))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X3]:![X4]:((((~(member(X4,X3))|subset(X4,X3))&(set(X3)&strict_well_order(member_predicate,X3)))|~(member(X3,on)))&(((~(set(X3))|~(strict_well_order(member_predicate,X3)))|(member(esk6_1(X3),X3)&~(subset(esk6_1(X3),X3))))|member(X3,on))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X3]:![X4]:((((~(member(X4,X3))|subset(X4,X3))|~(member(X3,on)))&((set(X3)|~(member(X3,on)))&(strict_well_order(member_predicate,X3)|~(member(X3,on)))))&(((member(esk6_1(X3),X3)|(~(set(X3))|~(strict_well_order(member_predicate,X3))))|member(X3,on))&((~(subset(esk6_1(X3),X3))|(~(set(X3))|~(strict_well_order(member_predicate,X3))))|member(X3,on)))),inference(distribute,[status(thm)],[52])).
% cnf(58,plain,(subset(X2,X1)|~member(X1,on)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(59, plain,![X1]:![X6]:((~(apply(member_predicate,X1,X6))|member(X1,X6))&(~(member(X1,X6))|apply(member_predicate,X1,X6))),inference(fof_nnf,[status(thm)],[4])).
% fof(60, plain,![X7]:![X8]:((~(apply(member_predicate,X7,X8))|member(X7,X8))&(~(member(X7,X8))|apply(member_predicate,X7,X8))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(apply(member_predicate,X1,X2)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(member(X1,X2)|~apply(member_predicate,X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% fof(67, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(68, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk7_2(X4,X5),X4)&~(member(esk7_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk7_2(X4,X5),X4)&~(member(esk7_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk7_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk7_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[70])).
% cnf(72,plain,(subset(X1,X2)|~member(esk7_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,plain,(subset(X1,X2)|member(esk7_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[71])).
% cnf(74,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(75, plain,![X2]:![X3]:((~(equal_set(X2,X3))|(subset(X2,X3)&subset(X3,X2)))&((~(subset(X2,X3))|~(subset(X3,X2)))|equal_set(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(76, plain,![X4]:![X5]:((~(equal_set(X4,X5))|(subset(X4,X5)&subset(X5,X4)))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X4]:![X5]:(((subset(X4,X5)|~(equal_set(X4,X5)))&(subset(X5,X4)|~(equal_set(X4,X5))))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(distribute,[status(thm)],[76])).
% cnf(78,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[77])).
% fof(81, plain,![X1]:![X2]:((~(member(X1,power_set(X2)))|subset(X1,X2))&(~(subset(X1,X2))|member(X1,power_set(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(82, plain,![X3]:![X4]:((~(member(X3,power_set(X4)))|subset(X3,X4))&(~(subset(X3,X4))|member(X3,power_set(X4)))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(member(X1,power_set(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(85, plain,![X1]:![X2]:![X3]:((~(member(X1,intersection(X2,X3)))|(member(X1,X2)&member(X1,X3)))&((~(member(X1,X2))|~(member(X1,X3)))|member(X1,intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[9])).
% fof(86, plain,![X4]:![X5]:![X6]:((~(member(X4,intersection(X5,X6)))|(member(X4,X5)&member(X4,X6)))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,![X4]:![X5]:![X6]:(((member(X4,X5)|~(member(X4,intersection(X5,X6))))&(member(X4,X6)|~(member(X4,intersection(X5,X6)))))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(distribute,[status(thm)],[86])).
% cnf(88,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[87])).
% cnf(89,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[87])).
% cnf(90,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[87])).
% fof(91, negated_conjecture,?[X2]:(member(X2,on)&~(equal_set(X2,intersection(X2,power_set(X2))))),inference(fof_nnf,[status(thm)],[11])).
% fof(92, negated_conjecture,?[X3]:(member(X3,on)&~(equal_set(X3,intersection(X3,power_set(X3))))),inference(variable_rename,[status(thm)],[91])).
% fof(93, negated_conjecture,(member(esk8_0,on)&~(equal_set(esk8_0,intersection(esk8_0,power_set(esk8_0))))),inference(skolemize,[status(esa)],[92])).
% cnf(94,negated_conjecture,(~equal_set(esk8_0,intersection(esk8_0,power_set(esk8_0)))),inference(split_conjunct,[status(thm)],[93])).
% cnf(95,negated_conjecture,(member(esk8_0,on)),inference(split_conjunct,[status(thm)],[93])).
% cnf(104,plain,(apply(member_predicate,X1,union(X2,X3))|~member(X1,X3)),inference(spm,[status(thm)],[61,15,theory(equality)])).
% cnf(114,negated_conjecture,(subset(X1,esk8_0)|~member(X1,esk8_0)),inference(spm,[status(thm)],[58,95,theory(equality)])).
% cnf(116,plain,(member(esk7_2(intersection(X1,X2),X3),X1)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[90,73,theory(equality)])).
% cnf(117,plain,(member(esk7_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[89,73,theory(equality)])).
% cnf(128,negated_conjecture,(~subset(intersection(esk8_0,power_set(esk8_0)),esk8_0)|~subset(esk8_0,intersection(esk8_0,power_set(esk8_0)))),inference(spm,[status(thm)],[94,78,theory(equality)])).
% cnf(131,plain,(subset(X1,intersection(X2,X3))|~member(esk7_2(X1,intersection(X2,X3)),X3)|~member(esk7_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[72,88,theory(equality)])).
% cnf(132,plain,(subset(X1,power_set(X2))|~subset(esk7_2(X1,power_set(X2)),X2)),inference(spm,[status(thm)],[72,83,theory(equality)])).
% cnf(133,plain,(subset(X1,union(X2,X3))|~member(esk7_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[72,15,theory(equality)])).
% cnf(137,plain,(member(esk7_2(union(X1,X2),X3),X1)|member(esk7_2(union(X1,X2),X3),X2)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[17,73,theory(equality)])).
% cnf(340,negated_conjecture,(subset(esk7_2(esk8_0,X1),esk8_0)|subset(esk8_0,X1)),inference(spm,[status(thm)],[114,73,theory(equality)])).
% cnf(418,plain,(apply(member_predicate,esk7_2(X1,X2),union(X3,X1))|subset(X1,X2)),inference(spm,[status(thm)],[104,73,theory(equality)])).
% cnf(691,plain,(subset(intersection(X1,X2),X1)),inference(spm,[status(thm)],[72,116,theory(equality)])).
% cnf(693,negated_conjecture,($false|~subset(esk8_0,intersection(esk8_0,power_set(esk8_0)))),inference(rw,[status(thm)],[128,691,theory(equality)])).
% cnf(694,negated_conjecture,(~subset(esk8_0,intersection(esk8_0,power_set(esk8_0)))),inference(cn,[status(thm)],[693,theory(equality)])).
% cnf(800,plain,(subset(intersection(X1,X2),intersection(X3,X1))|~member(esk7_2(intersection(X1,X2),intersection(X3,X1)),X3)),inference(spm,[status(thm)],[131,116,theory(equality)])).
% cnf(802,plain,(subset(X1,intersection(X2,X1))|~member(esk7_2(X1,intersection(X2,X1)),X2)),inference(spm,[status(thm)],[131,73,theory(equality)])).
% cnf(824,negated_conjecture,(subset(esk8_0,power_set(esk8_0))),inference(spm,[status(thm)],[132,340,theory(equality)])).
% cnf(841,negated_conjecture,(member(X1,power_set(esk8_0))|~member(X1,esk8_0)),inference(spm,[status(thm)],[74,824,theory(equality)])).
% cnf(846,negated_conjecture,(subset(X1,power_set(esk8_0))|~member(esk7_2(X1,power_set(esk8_0)),esk8_0)),inference(spm,[status(thm)],[72,841,theory(equality)])).
% cnf(897,plain,(subset(union(X4,X4),X5)|member(esk7_2(union(X4,X4),X5),X4)),inference(ef,[status(thm)],[137,theory(equality)])).
% cnf(922,plain,(subset(union(X1,X2),X1)|member(esk7_2(union(X1,X2),X1),X2)),inference(spm,[status(thm)],[72,137,theory(equality)])).
% cnf(11613,plain,(subset(union(X1,X1),union(X2,X1))),inference(spm,[status(thm)],[133,897,theory(equality)])).
% cnf(11695,plain,(member(X1,union(X2,X3))|~member(X1,union(X3,X3))),inference(spm,[status(thm)],[74,11613,theory(equality)])).
% cnf(12610,plain,(member(X1,union(X2,X3))|~apply(member_predicate,X1,union(X3,X3))),inference(spm,[status(thm)],[11695,62,theory(equality)])).
% cnf(12983,plain,(member(esk7_2(X1,X2),union(X3,X1))|subset(X1,X2)),inference(spm,[status(thm)],[12610,418,theory(equality)])).
% cnf(19761,negated_conjecture,(subset(union(power_set(esk8_0),esk8_0),power_set(esk8_0))),inference(spm,[status(thm)],[846,922,theory(equality)])).
% cnf(19797,negated_conjecture,(member(X1,power_set(esk8_0))|~member(X1,union(power_set(esk8_0),esk8_0))),inference(spm,[status(thm)],[74,19761,theory(equality)])).
% cnf(19817,negated_conjecture,(member(esk7_2(esk8_0,X1),power_set(esk8_0))|subset(esk8_0,X1)),inference(spm,[status(thm)],[19797,12983,theory(equality)])).
% cnf(20092,negated_conjecture,(subset(esk8_0,intersection(power_set(esk8_0),esk8_0))),inference(spm,[status(thm)],[802,19817,theory(equality)])).
% cnf(20097,negated_conjecture,(member(X1,intersection(power_set(esk8_0),esk8_0))|~member(X1,esk8_0)),inference(spm,[status(thm)],[74,20092,theory(equality)])).
% cnf(20107,negated_conjecture,(subset(X1,intersection(power_set(esk8_0),esk8_0))|~member(esk7_2(X1,intersection(power_set(esk8_0),esk8_0)),esk8_0)),inference(spm,[status(thm)],[72,20097,theory(equality)])).
% cnf(20794,negated_conjecture,(subset(union(intersection(power_set(esk8_0),esk8_0),esk8_0),intersection(power_set(esk8_0),esk8_0))),inference(spm,[status(thm)],[20107,922,theory(equality)])).
% cnf(20845,negated_conjecture,(member(X1,intersection(power_set(esk8_0),esk8_0))|~member(X1,union(intersection(power_set(esk8_0),esk8_0),esk8_0))),inference(spm,[status(thm)],[74,20794,theory(equality)])).
% cnf(21229,negated_conjecture,(member(esk7_2(esk8_0,X1),intersection(power_set(esk8_0),esk8_0))|subset(esk8_0,X1)),inference(spm,[status(thm)],[20845,12983,theory(equality)])).
% cnf(30134,plain,(subset(intersection(X1,X2),intersection(X2,X1))),inference(spm,[status(thm)],[800,117,theory(equality)])).
% cnf(30153,plain,(member(X1,intersection(X2,X3))|~member(X1,intersection(X3,X2))),inference(spm,[status(thm)],[74,30134,theory(equality)])).
% cnf(40364,negated_conjecture,(member(esk7_2(esk8_0,X1),intersection(esk8_0,power_set(esk8_0)))|subset(esk8_0,X1)),inference(spm,[status(thm)],[30153,21229,theory(equality)])).
% cnf(45647,negated_conjecture,(subset(esk8_0,intersection(esk8_0,power_set(esk8_0)))),inference(spm,[status(thm)],[72,40364,theory(equality)])).
% cnf(45648,negated_conjecture,($false),inference(sr,[status(thm)],[45647,694,theory(equality)])).
% cnf(45649,negated_conjecture,($false),45648,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4938
% # ...of these trivial : 5
% # ...subsumed : 2216
% # ...remaining for further processing: 2717
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 150
% # Backward-rewritten : 1
% # Generated clauses : 43106
% # ...of the previous two non-trivial : 42212
% # Contextual simplify-reflections : 1006
% # Paramodulations : 42998
% # Factorizations : 70
% # Equation resolutions : 0
% # Current number of processed clauses: 2500
% # Positive orientable unit clauses: 258
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2240
% # Current number of unprocessed clauses: 36691
% # ...number of literals in the above : 144541
% # Clause-clause subsumption calls (NU) : 217051
% # Rec. Clause-clause subsumption calls : 133589
% # Unit Clause-clause subsumption calls : 1325
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1070
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 1203 leaves, 2.34+/-4.053 terms/leaf
% # Paramod-from index: 353 leaves, 1.94+/-2.718 terms/leaf
% # Paramod-into index: 1008 leaves, 2.33+/-3.932 terms/leaf
% # -------------------------------------------------
% # User time : 2.299 s
% # System time : 0.054 s
% # Total time : 2.353 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.08 CPU 3.18 WC
% FINAL PrfWatch: 3.08 CPU 3.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29805/SET812+4.tptp
%
%------------------------------------------------------------------------------