TSTP Solution File: SET595+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET595+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Wed Dec 29 23:13:39 EST 2010
% Result : Theorem 12.59s
% Output : Solution 12.59s
% 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/SystemOnTPTP24522/SET595+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24522/SET595+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24522/SET595+3.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 24618
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.04 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.91 CPU 8.04 WC
% PrfWatch: 9.90 CPU 10.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(2, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(4, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(5, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(9, conjecture,![X1]:![X2]:(subset(X1,X2)=>X2=union(X1,difference(X2,X1))),file('/tmp/SRASS.s.p', prove_th54)).
% fof(10, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>X2=union(X1,difference(X2,X1)))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(12, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(13, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[12])).
% fof(14, 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)],[13])).
% cnf(15,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(18, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X1]:![X2]:![X3]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(29, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))&~(member(X6,X5)))|member(X6,union(X4,X5)))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))|member(X6,union(X4,X5)))&(~(member(X6,X5))|member(X6,union(X4,X5))))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[30])).
% fof(34, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(35, 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)],[34])).
% fof(36, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[35])).
% fof(37, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[37])).
% cnf(39,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[38])).
% cnf(41,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(57, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(X2=union(X1,difference(X2,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(58, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(X4=union(X3,difference(X4,X3)))),inference(variable_rename,[status(thm)],[57])).
% fof(59, negated_conjecture,(subset(esk4_0,esk5_0)&~(esk5_0=union(esk4_0,difference(esk5_0,esk4_0)))),inference(skolemize,[status(esa)],[58])).
% cnf(60,negated_conjecture,(esk5_0!=union(esk4_0,difference(esk5_0,esk4_0))),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(67,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[41,61,theory(equality)])).
% cnf(73,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[27,40,theory(equality)])).
% cnf(74,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[39,31,theory(equality)])).
% cnf(75,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[39,32,theory(equality)])).
% cnf(78,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[26,40,theory(equality)])).
% cnf(79,plain,(subset(X1,difference(X2,X3))|member(esk1_2(X1,difference(X2,X3)),X3)|~member(esk1_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[39,25,theory(equality)])).
% cnf(84,plain,(member(esk1_2(union(X1,X2),X3),X2)|member(esk1_2(union(X1,X2),X3),X1)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[33,40,theory(equality)])).
% cnf(113,negated_conjecture,(subset(X1,esk5_0)|~member(esk1_2(X1,esk5_0),esk4_0)),inference(spm,[status(thm)],[39,67,theory(equality)])).
% cnf(116,plain,(member(esk1_2(difference(difference(X1,X2),X3),X4),X1)|subset(difference(difference(X1,X2),X3),X4)),inference(spm,[status(thm)],[27,73,theory(equality)])).
% cnf(118,plain,(member(esk1_2(difference(union(X1,X2),X3),X4),X2)|member(esk1_2(difference(union(X1,X2),X3),X4),X1)|subset(difference(union(X1,X2),X3),X4)),inference(spm,[status(thm)],[33,73,theory(equality)])).
% cnf(119,negated_conjecture,(subset(difference(esk4_0,X1),esk5_0)),inference(spm,[status(thm)],[113,73,theory(equality)])).
% cnf(120,plain,(subset(difference(X1,X2),X1)),inference(spm,[status(thm)],[39,73,theory(equality)])).
% cnf(122,negated_conjecture,(member(X1,esk5_0)|~member(X1,difference(esk4_0,X2))),inference(spm,[status(thm)],[41,119,theory(equality)])).
% cnf(123,plain,(X1=difference(X1,X2)|~subset(X1,difference(X1,X2))),inference(spm,[status(thm)],[15,120,theory(equality)])).
% cnf(130,negated_conjecture,(member(esk1_2(difference(esk4_0,X1),X2),esk5_0)|subset(difference(esk4_0,X1),X2)),inference(spm,[status(thm)],[122,40,theory(equality)])).
% cnf(137,plain,(subset(X1,union(X2,difference(X3,X4)))|member(esk1_2(X1,union(X2,difference(X3,X4))),X4)|~member(esk1_2(X1,union(X2,difference(X3,X4))),X3)),inference(spm,[status(thm)],[74,25,theory(equality)])).
% cnf(142,plain,(subset(X1,union(X2,X1))),inference(spm,[status(thm)],[74,40,theory(equality)])).
% cnf(192,negated_conjecture,(subset(difference(X1,esk5_0),X2)|~member(esk1_2(difference(X1,esk5_0),X2),esk4_0)),inference(spm,[status(thm)],[78,67,theory(equality)])).
% cnf(196,negated_conjecture,(subset(difference(esk4_0,esk5_0),X1)),inference(spm,[status(thm)],[78,130,theory(equality)])).
% cnf(198,negated_conjecture,(difference(difference(esk4_0,esk5_0),X1)=difference(esk4_0,esk5_0)),inference(spm,[status(thm)],[123,196,theory(equality)])).
% cnf(199,negated_conjecture,(X1=difference(esk4_0,esk5_0)|~subset(X1,difference(esk4_0,esk5_0))),inference(spm,[status(thm)],[15,196,theory(equality)])).
% cnf(200,negated_conjecture,(member(X1,X2)|~member(X1,difference(esk4_0,esk5_0))),inference(spm,[status(thm)],[41,196,theory(equality)])).
% cnf(203,negated_conjecture,(~member(X1,difference(esk4_0,esk5_0))|~member(X1,X2)),inference(spm,[status(thm)],[26,198,theory(equality)])).
% cnf(368,plain,(member(esk1_2(X1,difference(X1,X2)),X2)|subset(X1,difference(X1,X2))),inference(spm,[status(thm)],[79,40,theory(equality)])).
% cnf(401,plain,(subset(union(X1,X2),X2)|member(esk1_2(union(X1,X2),X2),X1)),inference(spm,[status(thm)],[39,84,theory(equality)])).
% cnf(425,negated_conjecture,(~member(X1,difference(esk4_0,esk5_0))),inference(csr,[status(thm)],[203,200])).
% cnf(591,negated_conjecture,(subset(X1,difference(X1,difference(esk4_0,esk5_0)))),inference(spm,[status(thm)],[425,368,theory(equality)])).
% cnf(593,plain,(member(esk1_2(X1,difference(X1,difference(X2,X3))),X2)|subset(X1,difference(X1,difference(X2,X3)))),inference(spm,[status(thm)],[27,368,theory(equality)])).
% cnf(594,plain,(subset(X1,difference(X1,difference(X2,X3)))|~member(esk1_2(X1,difference(X1,difference(X2,X3))),X3)),inference(spm,[status(thm)],[26,368,theory(equality)])).
% cnf(607,negated_conjecture,(difference(X1,difference(esk4_0,esk5_0))=X1|~subset(difference(X1,difference(esk4_0,esk5_0)),X1)),inference(spm,[status(thm)],[15,591,theory(equality)])).
% cnf(617,negated_conjecture,(difference(X1,difference(esk4_0,esk5_0))=X1|$false),inference(rw,[status(thm)],[607,120,theory(equality)])).
% cnf(618,negated_conjecture,(difference(X1,difference(esk4_0,esk5_0))=X1),inference(cn,[status(thm)],[617,theory(equality)])).
% cnf(1523,plain,(subset(difference(difference(X1,X2),X1),X3)),inference(spm,[status(thm)],[78,116,theory(equality)])).
% cnf(1644,negated_conjecture,(difference(difference(X1,X2),X1)=difference(esk4_0,esk5_0)),inference(spm,[status(thm)],[199,1523,theory(equality)])).
% cnf(2731,plain,(member(esk1_2(difference(X1,X2),union(X3,difference(X1,X4))),X4)|subset(difference(X1,X2),union(X3,difference(X1,X4)))),inference(spm,[status(thm)],[137,73,theory(equality)])).
% cnf(3898,negated_conjecture,(subset(difference(union(X1,esk4_0),esk5_0),X2)|member(esk1_2(difference(union(X1,esk4_0),esk5_0),X2),X1)),inference(spm,[status(thm)],[192,118,theory(equality)])).
% cnf(8554,negated_conjecture,(subset(union(difference(esk4_0,esk5_0),X1),X1)),inference(spm,[status(thm)],[425,401,theory(equality)])).
% cnf(8595,negated_conjecture,(X1=union(difference(esk4_0,esk5_0),X1)|~subset(X1,union(difference(esk4_0,esk5_0),X1))),inference(spm,[status(thm)],[15,8554,theory(equality)])).
% cnf(8605,negated_conjecture,(X1=union(difference(esk4_0,esk5_0),X1)|$false),inference(rw,[status(thm)],[8595,142,theory(equality)])).
% cnf(8606,negated_conjecture,(X1=union(difference(esk4_0,esk5_0),X1)),inference(cn,[status(thm)],[8605,theory(equality)])).
% cnf(8673,negated_conjecture,(X1=union(X1,difference(esk4_0,esk5_0))),inference(spm,[status(thm)],[19,8606,theory(equality)])).
% cnf(33124,plain,(subset(difference(X1,X2),difference(difference(X1,X2),difference(X2,X3)))),inference(spm,[status(thm)],[78,593,theory(equality)])).
% cnf(33282,plain,(difference(difference(X1,X2),difference(X2,X3))=difference(X1,X2)|~subset(difference(difference(X1,X2),difference(X2,X3)),difference(X1,X2))),inference(spm,[status(thm)],[15,33124,theory(equality)])).
% cnf(33436,plain,(difference(difference(X1,X2),difference(X2,X3))=difference(X1,X2)|$false),inference(rw,[status(thm)],[33282,120,theory(equality)])).
% cnf(33437,plain,(difference(difference(X1,X2),difference(X2,X3))=difference(X1,X2)),inference(cn,[status(thm)],[33436,theory(equality)])).
% cnf(34043,plain,(subset(X1,difference(X1,difference(X2,X1)))),inference(spm,[status(thm)],[594,40,theory(equality)])).
% cnf(34948,plain,(difference(X1,difference(X2,X1))=X1|~subset(difference(X1,difference(X2,X1)),X1)),inference(spm,[status(thm)],[15,34043,theory(equality)])).
% cnf(35007,plain,(difference(X1,difference(X2,X1))=X1|$false),inference(rw,[status(thm)],[34948,120,theory(equality)])).
% cnf(35008,plain,(difference(X1,difference(X2,X1))=X1),inference(cn,[status(thm)],[35007,theory(equality)])).
% cnf(203884,plain,(subset(difference(X1,X2),union(X3,difference(X1,X3)))),inference(spm,[status(thm)],[75,2731,theory(equality)])).
% cnf(206232,negated_conjecture,(subset(X1,union(X2,difference(X1,X2)))),inference(spm,[status(thm)],[203884,618,theory(equality)])).
% cnf(424180,negated_conjecture,(subset(difference(union(X1,esk4_0),esk5_0),difference(difference(union(X1,esk4_0),esk5_0),difference(X2,X1)))),inference(spm,[status(thm)],[594,3898,theory(equality)])).
% cnf(426276,negated_conjecture,(difference(difference(union(X1,esk4_0),esk5_0),difference(X2,X1))=difference(union(X1,esk4_0),esk5_0)|~subset(difference(difference(union(X1,esk4_0),esk5_0),difference(X2,X1)),difference(union(X1,esk4_0),esk5_0))),inference(spm,[status(thm)],[15,424180,theory(equality)])).
% cnf(426416,negated_conjecture,(difference(difference(union(X1,esk4_0),esk5_0),difference(X2,X1))=difference(union(X1,esk4_0),esk5_0)|$false),inference(rw,[status(thm)],[426276,120,theory(equality)])).
% cnf(426417,negated_conjecture,(difference(difference(union(X1,esk4_0),esk5_0),difference(X2,X1))=difference(union(X1,esk4_0),esk5_0)),inference(cn,[status(thm)],[426416,theory(equality)])).
% cnf(427039,negated_conjecture,(difference(difference(X1,X2),difference(union(X2,esk4_0),esk5_0))=difference(X1,X2)),inference(spm,[status(thm)],[35008,426417,theory(equality)])).
% cnf(430337,negated_conjecture,(difference(difference(union(X1,esk4_0),esk5_0),X1)=difference(esk4_0,esk5_0)),inference(spm,[status(thm)],[1644,427039,theory(equality)])).
% cnf(431865,negated_conjecture,(difference(esk4_0,esk5_0)=difference(union(difference(esk5_0,X1),esk4_0),esk5_0)),inference(spm,[status(thm)],[33437,430337,theory(equality)])).
% cnf(433006,negated_conjecture,(difference(union(esk4_0,difference(esk5_0,X1)),esk5_0)=difference(esk4_0,esk5_0)),inference(rw,[status(thm)],[431865,19,theory(equality)])).
% cnf(433287,negated_conjecture,(subset(union(esk4_0,difference(esk5_0,X1)),union(esk5_0,difference(esk4_0,esk5_0)))),inference(spm,[status(thm)],[206232,433006,theory(equality)])).
% cnf(434106,negated_conjecture,(subset(union(esk4_0,difference(esk5_0,X1)),esk5_0)),inference(rw,[status(thm)],[433287,8673,theory(equality)])).
% cnf(434579,negated_conjecture,(esk5_0=union(esk4_0,difference(esk5_0,X1))|~subset(esk5_0,union(esk4_0,difference(esk5_0,X1)))),inference(spm,[status(thm)],[15,434106,theory(equality)])).
% cnf(439106,negated_conjecture,(union(esk4_0,difference(esk5_0,esk4_0))=esk5_0),inference(spm,[status(thm)],[434579,206232,theory(equality)])).
% cnf(439164,negated_conjecture,($false),inference(sr,[status(thm)],[439106,60,theory(equality)])).
% cnf(439165,negated_conjecture,($false),439164,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11434
% # ...of these trivial : 1089
% # ...subsumed : 8170
% # ...remaining for further processing: 2175
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 28
% # Backward-rewritten : 91
% # Generated clauses : 262057
% # ...of the previous two non-trivial : 150773
% # Contextual simplify-reflections : 770
% # Paramodulations : 261133
% # Factorizations : 922
% # Equation resolutions : 2
% # Current number of processed clauses: 2054
% # Positive orientable unit clauses: 1220
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 828
% # Current number of unprocessed clauses: 137474
% # ...number of literals in the above : 395808
% # Clause-clause subsumption calls (NU) : 109168
% # Rec. Clause-clause subsumption calls : 78947
% # Unit Clause-clause subsumption calls : 23634
% # Rewrite failures with RHS unbound : 16
% # Indexed BW rewrite attempts : 28041
% # Indexed BW rewrite successes : 92
% # Backwards rewriting index: 845 leaves, 4.46+/-8.231 terms/leaf
% # Paramod-from index: 355 leaves, 5.31+/-8.395 terms/leaf
% # Paramod-into index: 807 leaves, 4.37+/-8.057 terms/leaf
% # -------------------------------------------------
% # User time : 6.545 s
% # System time : 0.248 s
% # Total time : 6.793 s
% # Maximum resident set size: 0 pages
% PrfWatch: 11.61 CPU 11.78 WC
% FINAL PrfWatch: 11.61 CPU 11.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP24522/SET595+3.tptp
%
%------------------------------------------------------------------------------