%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET889+1 : TPTP v5.0.0. Bugfixed v4.0.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 : Thu Dec 30 00:15:50 EST 2010
% Result : Theorem 4.12s
% Output : Solution 4.12s
% 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/SystemOnTPTP31391/SET889+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31391/SET889+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31391/SET889+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 31487
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 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]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(2, axiom,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(5, axiom,![X1]:![X2]:(X2=powerset(X1)<=>![X3]:(in(X3,X2)<=>subset(X3,X1))),file('/tmp/SRASS.s.p', d1_zfmisc_1)).
% fof(9, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(11, conjecture,![X1]:powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1)),file('/tmp/SRASS.s.p', t30_zfmisc_1)).
% fof(12, negated_conjecture,~(![X1]:powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))),inference(assume_negation,[status(cth)],[11])).
% fof(15, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X2]:((~(subset(X1,singleton(X2)))|(X1=empty_set|X1=singleton(X2)))&((~(X1=empty_set)&~(X1=singleton(X2)))|subset(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)&~(X3=singleton(X4)))|subset(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)|subset(X3,singleton(X4)))&(~(X3=singleton(X4))|subset(X3,singleton(X4))))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(subset(X1,singleton(X2))|X1!=singleton(X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,singleton(X2))|X1!=empty_set),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[19])).
% fof(23, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk1_3(X5,X6,X7)=X5)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk1_3(X5,X6,X7)=X6)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[26])).
% cnf(31,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[27])).
% cnf(32,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[27])).
% cnf(33,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(35, plain,![X1]:![X2]:((~(X2=powerset(X1))|![X3]:((~(in(X3,X2))|subset(X3,X1))&(~(subset(X3,X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(subset(X3,X1)))&(in(X3,X2)|subset(X3,X1)))|X2=powerset(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(subset(X7,X4)))&(in(X7,X5)|subset(X7,X4)))|X5=powerset(X4))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(subset(esk2_2(X4,X5),X4)))&(in(esk2_2(X4,X5),X5)|subset(esk2_2(X4,X5),X4)))|X5=powerset(X4))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5)))|~(X5=powerset(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(subset(esk2_2(X4,X5),X4)))&(in(esk2_2(X4,X5),X5)|subset(esk2_2(X4,X5),X4)))|X5=powerset(X4))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))|~(X5=powerset(X4)))&((~(subset(X6,X4))|in(X6,X5))|~(X5=powerset(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(subset(esk2_2(X4,X5),X4)))|X5=powerset(X4))&((in(esk2_2(X4,X5),X5)|subset(esk2_2(X4,X5),X4))|X5=powerset(X4)))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(X1=powerset(X2)|subset(esk2_2(X2,X1),X2)|in(esk2_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,plain,(X1=powerset(X2)|~subset(esk2_2(X2,X1),X2)|~in(esk2_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(53, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(54,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(61, negated_conjecture,?[X1]:~(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(62, negated_conjecture,?[X2]:~(powerset(singleton(X2))=unordered_pair(empty_set,singleton(X2))),inference(variable_rename,[status(thm)],[61])).
% fof(63, negated_conjecture,~(powerset(singleton(esk6_0))=unordered_pair(empty_set,singleton(esk6_0))),inference(skolemize,[status(esa)],[62])).
% cnf(64,negated_conjecture,(powerset(singleton(esk6_0))!=unordered_pair(empty_set,singleton(esk6_0))),inference(split_conjunct,[status(thm)],[63])).
% cnf(65,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(66,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[32,theory(equality)])).
% cnf(69,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[65,theory(equality)])).
% cnf(72,plain,(in(X1,X2)|powerset(singleton(X3))!=X2|empty_set!=X1),inference(spm,[status(thm)],[42,21,theory(equality)])).
% cnf(75,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(78,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[66,theory(equality)])).
% cnf(88,plain,(singleton(X1)=esk2_2(singleton(X1),X2)|empty_set=esk2_2(singleton(X1),X2)|powerset(singleton(X1))=X2|in(esk2_2(singleton(X1),X2),X2)),inference(spm,[status(thm)],[22,40,theory(equality)])).
% cnf(118,plain,(in(X1,powerset(singleton(X2)))|empty_set!=X1),inference(er,[status(thm)],[72,theory(equality)])).
% cnf(150,plain,(X1=esk2_2(X2,unordered_pair(X1,X3))|X3=esk2_2(X2,unordered_pair(X1,X3))|powerset(X2)=unordered_pair(X1,X3)|subset(esk2_2(X2,unordered_pair(X1,X3)),X2)),inference(spm,[status(thm)],[75,40,theory(equality)])).
% cnf(191,plain,(X1=esk2_2(singleton(X2),unordered_pair(X1,X3))|X3=esk2_2(singleton(X2),unordered_pair(X1,X3))|esk2_2(singleton(X2),unordered_pair(X1,X3))=singleton(X2)|esk2_2(singleton(X2),unordered_pair(X1,X3))=empty_set|powerset(singleton(X2))=unordered_pair(X1,X3)),inference(spm,[status(thm)],[75,88,theory(equality)])).
% cnf(580,plain,(esk2_2(singleton(X16),unordered_pair(X17,X18))=singleton(X16)|esk2_2(singleton(X16),unordered_pair(X17,X18))=empty_set|esk2_2(singleton(X16),unordered_pair(X17,X18))=X17|powerset(singleton(X16))=unordered_pair(X17,X18)|X18!=empty_set),inference(ef,[status(thm)],[191,theory(equality)])).
% cnf(581,plain,(esk2_2(singleton(X19),unordered_pair(X20,X21))=singleton(X19)|esk2_2(singleton(X19),unordered_pair(X20,X21))=empty_set|esk2_2(singleton(X19),unordered_pair(X20,X21))=X20|powerset(singleton(X19))=unordered_pair(X20,X21)|X21!=X20),inference(ef,[status(thm)],[191,theory(equality)])).
% cnf(623,plain,(esk2_2(singleton(X1),unordered_pair(X2,X2))=singleton(X1)|esk2_2(singleton(X1),unordered_pair(X2,X2))=empty_set|esk2_2(singleton(X1),unordered_pair(X2,X2))=X2|powerset(singleton(X1))=unordered_pair(X2,X2)),inference(er,[status(thm)],[581,theory(equality)])).
% cnf(1345,plain,(esk2_2(singleton(X5),unordered_pair(X6,X6))=empty_set|esk2_2(singleton(X5),unordered_pair(X6,X6))=X6|powerset(singleton(X5))=unordered_pair(X6,X6)|singleton(X5)!=X6),inference(ef,[status(thm)],[623,theory(equality)])).
% cnf(2724,plain,(esk2_2(singleton(X1),unordered_pair(X2,empty_set))=singleton(X1)|esk2_2(singleton(X1),unordered_pair(X2,empty_set))=empty_set|esk2_2(singleton(X1),unordered_pair(X2,empty_set))=X2|powerset(singleton(X1))=unordered_pair(X2,empty_set)),inference(er,[status(thm)],[580,theory(equality)])).
% cnf(2757,plain,(esk2_2(singleton(X5),unordered_pair(X6,empty_set))=empty_set|esk2_2(singleton(X5),unordered_pair(X6,empty_set))=X6|powerset(singleton(X5))=unordered_pair(X6,empty_set)|singleton(X5)!=X6),inference(ef,[status(thm)],[2724,theory(equality)])).
% cnf(7090,plain,(esk2_2(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))=empty_set|esk2_2(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))=singleton(X1)|powerset(singleton(X1))=unordered_pair(singleton(X1),singleton(X1))),inference(er,[status(thm)],[1345,theory(equality)])).
% cnf(7412,plain,(powerset(singleton(X1))=unordered_pair(singleton(X1),singleton(X1))|esk2_2(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))=empty_set|~in(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))|~subset(singleton(X1),singleton(X1))),inference(spm,[status(thm)],[41,7090,theory(equality)])).
% cnf(7432,plain,(powerset(singleton(X1))=unordered_pair(singleton(X1),singleton(X1))|esk2_2(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))=empty_set|$false|~subset(singleton(X1),singleton(X1))),inference(rw,[status(thm)],[7412,78,theory(equality)])).
% cnf(7433,plain,(powerset(singleton(X1))=unordered_pair(singleton(X1),singleton(X1))|esk2_2(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))=empty_set|$false|$false),inference(rw,[status(thm)],[7432,54,theory(equality)])).
% cnf(7434,plain,(powerset(singleton(X1))=unordered_pair(singleton(X1),singleton(X1))|esk2_2(singleton(X1),unordered_pair(singleton(X1),singleton(X1)))=empty_set),inference(cn,[status(thm)],[7433,theory(equality)])).
% cnf(7463,plain,(empty_set=singleton(X1)|powerset(singleton(X1))=unordered_pair(singleton(X1),singleton(X1))|subset(empty_set,singleton(X1))),inference(spm,[status(thm)],[150,7434,theory(equality)])).
% cnf(7473,plain,(unordered_pair(singleton(X1),singleton(X1))=powerset(singleton(X1))|subset(empty_set,singleton(X1))),inference(csr,[status(thm)],[7463,20])).
% cnf(7528,plain,(singleton(X1)=X2|subset(empty_set,singleton(X1))|~in(X2,powerset(singleton(X1)))),inference(spm,[status(thm)],[75,7473,theory(equality)])).
% cnf(7828,plain,(singleton(X1)=X2|subset(empty_set,singleton(X1))|empty_set!=X2),inference(spm,[status(thm)],[7528,118,theory(equality)])).
% cnf(7831,plain,(singleton(X1)=empty_set|subset(empty_set,singleton(X1))),inference(er,[status(thm)],[7828,theory(equality)])).
% cnf(7835,plain,(subset(empty_set,singleton(X1))),inference(csr,[status(thm)],[7831,20])).
% cnf(26878,plain,(esk2_2(singleton(X1),unordered_pair(singleton(X1),empty_set))=empty_set|esk2_2(singleton(X1),unordered_pair(singleton(X1),empty_set))=singleton(X1)|powerset(singleton(X1))=unordered_pair(singleton(X1),empty_set)),inference(er,[status(thm)],[2757,theory(equality)])).
% cnf(26879,plain,(esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set|esk2_2(singleton(X1),unordered_pair(singleton(X1),empty_set))=singleton(X1)|powerset(singleton(X1))=unordered_pair(singleton(X1),empty_set)),inference(rw,[status(thm)],[26878,16,theory(equality)])).
% cnf(26880,plain,(esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set|esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=singleton(X1)|powerset(singleton(X1))=unordered_pair(singleton(X1),empty_set)),inference(rw,[status(thm)],[26879,16,theory(equality)])).
% cnf(26881,plain,(esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set|esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=singleton(X1)|powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))),inference(rw,[status(thm)],[26880,16,theory(equality)])).
% cnf(27996,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set|~in(singleton(X1),unordered_pair(empty_set,singleton(X1)))|~subset(singleton(X1),singleton(X1))),inference(spm,[status(thm)],[41,26881,theory(equality)])).
% cnf(28023,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set|$false|~subset(singleton(X1),singleton(X1))),inference(rw,[status(thm)],[27996,69,theory(equality)])).
% cnf(28024,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set|$false|$false),inference(rw,[status(thm)],[28023,54,theory(equality)])).
% cnf(28025,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|esk2_2(singleton(X1),unordered_pair(empty_set,singleton(X1)))=empty_set),inference(cn,[status(thm)],[28024,theory(equality)])).
% cnf(28051,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|~in(empty_set,unordered_pair(empty_set,singleton(X1)))|~subset(empty_set,singleton(X1))),inference(spm,[status(thm)],[41,28025,theory(equality)])).
% cnf(28079,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|$false|~subset(empty_set,singleton(X1))),inference(rw,[status(thm)],[28051,78,theory(equality)])).
% cnf(28080,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))|$false|$false),inference(rw,[status(thm)],[28079,7835,theory(equality)])).
% cnf(28081,plain,(powerset(singleton(X1))=unordered_pair(empty_set,singleton(X1))),inference(cn,[status(thm)],[28080,theory(equality)])).
% cnf(29247,negated_conjecture,($false),inference(rw,[status(thm)],[64,28081,theory(equality)])).
% cnf(29248,negated_conjecture,($false),inference(cn,[status(thm)],[29247,theory(equality)])).
% cnf(29249,negated_conjecture,($false),29248,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6883
% # ...of these trivial : 300
% # ...subsumed : 4607
% # ...remaining for further processing: 1976
% # Other redundant clauses eliminated : 380
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 86
% # Backward-rewritten : 483
% # Generated clauses : 21576
% # ...of the previous two non-trivial : 19993
% # Contextual simplify-reflections : 3927
% # Paramodulations : 20338
% # Factorizations : 353
% # Equation resolutions : 537
% # Current number of processed clauses: 1229
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 14
% # Non-unit-clauses : 1198
% # Current number of unprocessed clauses: 3838
% # ...number of literals in the above : 25579
% # Clause-clause subsumption calls (NU) : 1629885
% # Rec. Clause-clause subsumption calls : 391052
% # Unit Clause-clause subsumption calls : 7614
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 22
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 506 leaves, 1.42+/-1.513 terms/leaf
% # Paramod-from index: 100 leaves, 1.45+/-1.291 terms/leaf
% # Paramod-into index: 336 leaves, 1.46+/-1.727 terms/leaf
% # -------------------------------------------------
% # User time : 2.441 s
% # System time : 0.044 s
% # Total time : 2.485 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.17 CPU 3.26 WC
% FINAL PrfWatch: 3.17 CPU 3.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP31391/SET889+1.tptp
%
%------------------------------------------------------------------------------