%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL050+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 22:04:36 EST 2010
% Result : Theorem 1.93s
% Output : Solution 1.93s
% 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/SystemOnTPTP8786/REL050+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8786/REL050+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8786/REL050+4.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 8882
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(3, axiom,![X1]:![X2]:X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),file('/tmp/SRASS.s.p', maddux3_a_kind_of_de_Morgan)).
% fof(4, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(6, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(7, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(8, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(9, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(10, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(11, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:(join(complement(composition(X1,top)),composition(complement(composition(X1,top)),top))=composition(complement(composition(X1,top)),top)&join(composition(complement(composition(X1,top)),top),complement(composition(X1,top)))=complement(composition(X1,top))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:(join(complement(composition(X1,top)),composition(complement(composition(X1,top)),top))=composition(complement(composition(X1,top)),top)&join(composition(complement(composition(X1,top)),top),complement(composition(X1,top)))=complement(composition(X1,top)))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[41])).
% fof(49, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:(~(join(complement(composition(X1,top)),composition(complement(composition(X1,top)),top))=composition(complement(composition(X1,top)),top))|~(join(composition(complement(composition(X1,top)),top),complement(composition(X1,top)))=complement(composition(X1,top)))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X2]:(~(join(complement(composition(X2,top)),composition(complement(composition(X2,top)),top))=composition(complement(composition(X2,top)),top))|~(join(composition(complement(composition(X2,top)),top),complement(composition(X2,top)))=complement(composition(X2,top)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(~(join(complement(composition(esk1_0,top)),composition(complement(composition(esk1_0,top)),top))=composition(complement(composition(esk1_0,top)),top))|~(join(composition(complement(composition(esk1_0,top)),top),complement(composition(esk1_0,top)))=complement(composition(esk1_0,top)))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(composition(complement(composition(esk1_0,top)),top),complement(composition(esk1_0,top)))!=complement(composition(esk1_0,top))|join(complement(composition(esk1_0,top)),composition(complement(composition(esk1_0,top)),top))!=composition(complement(composition(esk1_0,top)),top)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,34,theory(equality)]),['unfolding']).
% cnf(59,negated_conjecture,(join(complement(composition(esk1_0,top)),composition(complement(composition(esk1_0,top)),top))!=composition(complement(composition(esk1_0,top)),top)|join(complement(composition(esk1_0,top)),composition(complement(composition(esk1_0,top)),top))!=complement(composition(esk1_0,top))),inference(rw,[status(thm)],[54,20,theory(equality)])).
% cnf(61,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[38,30,theory(equality)])).
% cnf(68,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[40,42,theory(equality)])).
% cnf(70,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,30,theory(equality)])).
% cnf(72,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[30,22,theory(equality)])).
% cnf(111,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[32,20,theory(equality)])).
% cnf(123,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,20,theory(equality)])).
% cnf(135,plain,(join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2))))=X1),inference(spm,[status(thm)],[123,20,theory(equality)])).
% cnf(274,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[68,36,theory(equality)])).
% cnf(286,plain,(one=converse(one)),inference(spm,[status(thm)],[42,274,theory(equality)])).
% cnf(319,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[274,286,theory(equality)])).
% cnf(334,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[28,319,theory(equality)])).
% cnf(335,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[111,319,theory(equality)])).
% cnf(347,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[335,286,theory(equality)]),319,theory(equality)])).
% cnf(379,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[123,347,theory(equality)])).
% cnf(388,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[347,70,theory(equality)])).
% cnf(392,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[379,30,theory(equality)]),70,theory(equality)])).
% cnf(404,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,388,theory(equality)])).
% cnf(409,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[392,20,theory(equality)])).
% cnf(431,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[404,409,theory(equality)])).
% cnf(445,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,431,theory(equality)])).
% cnf(454,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[409,431,theory(equality)])).
% cnf(476,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[347,454,theory(equality)])).
% cnf(501,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,476,theory(equality)])).
% cnf(548,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[501,123,theory(equality)])).
% cnf(553,plain,(join(X1,top)=top),inference(spm,[status(thm)],[501,30,theory(equality)])).
% cnf(554,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[501,20,theory(equality)])).
% cnf(576,plain,(top=join(top,X1)),inference(spm,[status(thm)],[20,553,theory(equality)])).
% cnf(577,plain,(converse(top)=join(converse(X1),converse(top))),inference(spm,[status(thm)],[38,553,theory(equality)])).
% cnf(720,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[577,36,theory(equality)])).
% cnf(737,plain,(converse(top)=top),inference(spm,[status(thm)],[576,720,theory(equality)])).
% cnf(761,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[61,737,theory(equality)])).
% cnf(781,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[761,36,theory(equality)])).
% cnf(805,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[334,20,theory(equality)])).
% cnf(819,plain,(composition(join(X1,one),top)=top),inference(spm,[status(thm)],[576,805,theory(equality)])).
% cnf(827,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[805,576,theory(equality)])).
% cnf(908,plain,(composition(top,top)=top),inference(spm,[status(thm)],[819,576,theory(equality)])).
% cnf(930,plain,(composition(top,X1)=composition(top,composition(top,X1))),inference(spm,[status(thm)],[26,908,theory(equality)])).
% cnf(1199,plain,(converse(composition(top,X1))=join(converse(X1),converse(composition(top,X1)))),inference(spm,[status(thm)],[38,827,theory(equality)])).
% cnf(1209,plain,(composition(converse(X1),top)=join(converse(X1),converse(composition(top,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1199,40,theory(equality)]),737,theory(equality)])).
% cnf(1210,plain,(composition(converse(X1),top)=join(converse(X1),composition(converse(X1),top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1209,40,theory(equality)]),737,theory(equality)])).
% cnf(1596,plain,(join(complement(composition(top,X1)),composition(converse(top),complement(composition(top,X1))))=complement(composition(top,X1))),inference(spm,[status(thm)],[111,930,theory(equality)])).
% cnf(1617,plain,(composition(top,complement(composition(top,X1)))=complement(composition(top,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1596,737,theory(equality)]),827,theory(equality)])).
% cnf(1628,plain,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),converse(top))),inference(spm,[status(thm)],[40,1617,theory(equality)])).
% cnf(1646,plain,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),top)),inference(rw,[status(thm)],[1628,737,theory(equality)])).
% cnf(1791,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[548,20,theory(equality)])).
% cnf(1805,plain,(join(X1,X3)=join(X1,join(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[22,1791,theory(equality)])).
% cnf(1824,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1791,554,theory(equality)])).
% cnf(2025,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1824,454,theory(equality)])).
% cnf(2247,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[72,20,theory(equality)])).
% cnf(2815,plain,(join(X1,composition(X1,top))=composition(X1,top)),inference(spm,[status(thm)],[1210,36,theory(equality)])).
% cnf(2909,negated_conjecture,($false|join(complement(composition(esk1_0,top)),composition(complement(composition(esk1_0,top)),top))!=complement(composition(esk1_0,top))),inference(rw,[status(thm)],[59,2815,theory(equality)])).
% cnf(2910,negated_conjecture,($false|composition(complement(composition(esk1_0,top)),top)!=complement(composition(esk1_0,top))),inference(rw,[status(thm)],[2909,2815,theory(equality)])).
% cnf(2911,negated_conjecture,(composition(complement(composition(esk1_0,top)),top)!=complement(composition(esk1_0,top))),inference(cn,[status(thm)],[2910,theory(equality)])).
% cnf(42489,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1805,135,theory(equality)])).
% cnf(42843,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[42489,454,theory(equality)])).
% cnf(42969,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[42843,454,theory(equality)])).
% cnf(43603,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[42969,2247,theory(equality)])).
% cnf(43859,plain,(join(X1,complement(join(X1,X2)))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[43603,70,theory(equality)]),22,theory(equality)]),445,theory(equality)])).
% cnf(43860,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[43859,22,theory(equality)]),20,theory(equality)]),2025,theory(equality)])).
% cnf(44006,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[43860,761,theory(equality)])).
% cnf(44072,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[43860,781,theory(equality)])).
% cnf(44238,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44006,70,theory(equality)]),445,theory(equality)])).
% cnf(44315,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44072,70,theory(equality)]),445,theory(equality)])).
% cnf(44988,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[38,44238,theory(equality)])).
% cnf(45038,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[44988,36,theory(equality)])).
% cnf(45039,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[45038,36,theory(equality)])).
% cnf(45165,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[45039,454,theory(equality)])).
% cnf(45258,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2025,45165,theory(equality)])).
% cnf(45316,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[45258,454,theory(equality)]),20,theory(equality)]),44315,theory(equality)])).
% cnf(45376,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[454,45316,theory(equality)])).
% cnf(45536,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[36,45376,theory(equality)])).
% cnf(45717,plain,(composition(complement(composition(converse(X1),top)),top)=converse(complement(composition(top,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1646,45536,theory(equality)]),40,theory(equality)]),737,theory(equality)])).
% cnf(45718,plain,(composition(complement(composition(converse(X1),top)),top)=complement(composition(converse(X1),top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[45717,45536,theory(equality)]),40,theory(equality)]),737,theory(equality)])).
% cnf(46714,plain,(composition(complement(composition(X1,top)),top)=complement(composition(X1,top))),inference(spm,[status(thm)],[45718,36,theory(equality)])).
% cnf(46879,negated_conjecture,($false),inference(rw,[status(thm)],[2911,46714,theory(equality)])).
% cnf(46880,negated_conjecture,($false),inference(cn,[status(thm)],[46879,theory(equality)])).
% cnf(46881,negated_conjecture,($false),46880,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1063
% # ...of these trivial : 637
% # ...subsumed : 113
% # ...remaining for further processing: 313
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 105
% # Generated clauses : 22904
% # ...of the previous two non-trivial : 9670
% # Contextual simplify-reflections : 0
% # Paramodulations : 22904
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 208
% # Positive orientable unit clauses: 201
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 5963
% # ...number of literals in the above : 5963
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 963
% # Indexed BW rewrite successes : 220
% # Backwards rewriting index: 215 leaves, 1.97+/-1.624 terms/leaf
% # Paramod-from index: 122 leaves, 1.74+/-1.442 terms/leaf
% # Paramod-into index: 210 leaves, 1.96+/-1.599 terms/leaf
% # -------------------------------------------------
% # User time : 0.487 s
% # System time : 0.026 s
% # Total time : 0.513 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.13 CPU 1.23 WC
% FINAL PrfWatch: 1.13 CPU 1.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP8786/REL050+4.tptp
%
%------------------------------------------------------------------------------