%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL010+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 21:36:30 EST 2010
% Result : Theorem 128.06s
% Output : Solution 195.15s
% 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/SystemOnTPTP30110/REL010+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~goals:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... composition_associativity:
% CSA axiom composition_associativity found
% Looking for CSA axiom ... converse_idempotence:
% CSA axiom converse_idempotence found
% Looking for CSA axiom ... converse_multiplicativity:
% CSA axiom converse_multiplicativity found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... def_zero:
% CSA axiom def_zero found
% Looking for CSA axiom ... converse_additivity:
% CSA axiom converse_additivity found
% Looking for CSA axiom ... composition_distributivity:
% CSA axiom composition_distributivity found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... converse_cancellativity:
% CSA axiom converse_cancellativity found
% Looking for CSA axiom ... maddux1_join_commutativity:
% CSA axiom maddux1_join_commutativity found
% Looking for CSA axiom ... maddux2_join_associativity:
% CSA axiom maddux2_join_associativity found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... maddux4_definiton_of_meet:
% CSA axiom maddux4_definiton_of_meet found
% Looking for CSA axiom ... composition_identity: CSA axiom composition_identity found
% Looking for CSA axiom ... maddux3_a_kind_of_de_Morgan:
% CSA axiom maddux3_a_kind_of_de_Morgan found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :maddux3_a_kind_of_de_Morgan:composition_identity:maddux4_definiton_of_meet:maddux2_join_associativity:maddux1_join_commutativity:converse_cancellativity:composition_distributivity:converse_additivity:def_zero:converse_multiplicativity:converse_idempotence:composition_associativity (12)
% Unselected axioms are ... :def_top (1)
% SZS status THM for /tmp/SystemOnTPTP30110/REL010+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP30110/REL010+1.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 32432
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% PrfWatch: 7.88 CPU 8.02 WC
% PrfWatch: 9.86 CPU 10.03 WC
% PrfWatch: 11.85 CPU 12.03 WC
% PrfWatch: 13.82 CPU 14.04 WC
% PrfWatch: 15.81 CPU 16.04 WC
% PrfWatch: 17.80 CPU 18.05 WC
% PrfWatch: 19.78 CPU 20.05 WC
% PrfWatch: 21.77 CPU 22.06 WC
% PrfWatch: 23.75 CPU 24.06 WC
% PrfWatch: 25.74 CPU 26.07 WC
% PrfWatch: 27.73 CPU 28.07 WC
% PrfWatch: 29.71 CPU 30.08 WC
% PrfWatch: 31.70 CPU 32.08 WC
% PrfWatch: 33.66 CPU 34.08 WC
% PrfWatch: 35.66 CPU 36.09 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 37.64 CPU 38.09 WC
% PrfWatch: 39.63 CPU 40.10 WC
% PrfWatch: 41.63 CPU 42.10 WC
% PrfWatch: 43.38 CPU 44.17 WC
% PrfWatch: 44.99 CPU 46.17 WC
% PrfWatch: 46.95 CPU 48.18 WC
% PrfWatch: 48.94 CPU 50.18 WC
% PrfWatch: 50.94 CPU 52.19 WC
% PrfWatch: 52.93 CPU 54.19 WC
% PrfWatch: 54.93 CPU 56.20 WC
% PrfWatch: 56.92 CPU 58.20 WC
% PrfWatch: 58.91 CPU 60.20 WC
% PrfWatch: 60.91 CPU 62.21 WC
% PrfWatch: 62.90 CPU 64.21 WC
% PrfWatch: 64.90 CPU 66.22 WC
% # SZS output start CNFRefutation.
% fof(1, 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(2, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(3, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(4, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(5, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(6, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(7, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(8, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(9, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(10, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(11, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(13, conjecture,![X1]:![X2]:![X3]:(meet(composition(X1,X2),X3)=zero=>meet(X2,composition(converse(X1),X3))=zero),file('/tmp/SRASS.s.p', goals)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(meet(composition(X1,X2),X3)=zero=>meet(X2,composition(converse(X1),X3))=zero)),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(18,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),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)],[4])).
% cnf(22,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(24,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[6])).
% cnf(26,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),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)],[7])).
% cnf(28,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[8])).
% cnf(30,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(32,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(34,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(36,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[35])).
% fof(39, negated_conjecture,?[X1]:?[X2]:?[X3]:(meet(composition(X1,X2),X3)=zero&~(meet(X2,composition(converse(X1),X3))=zero)),inference(fof_nnf,[status(thm)],[14])).
% fof(40, negated_conjecture,?[X4]:?[X5]:?[X6]:(meet(composition(X4,X5),X6)=zero&~(meet(X5,composition(converse(X4),X6))=zero)),inference(variable_rename,[status(thm)],[39])).
% fof(41, negated_conjecture,(meet(composition(esk1_0,esk2_0),esk3_0)=zero&~(meet(esk2_0,composition(converse(esk1_0),esk3_0))=zero)),inference(skolemize,[status(esa)],[40])).
% cnf(42,negated_conjecture,(meet(esk2_0,composition(converse(esk1_0),esk3_0))!=zero),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,negated_conjecture,(meet(composition(esk1_0,esk2_0),esk3_0)=zero),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[32,20,theory(equality)]),['unfolding']).
% cnf(45,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),complement(esk3_0)))=zero),inference(rw,[status(thm)],[43,20,theory(equality)]),['unfolding']).
% cnf(46,negated_conjecture,(complement(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0))))!=zero),inference(rw,[status(thm)],[42,20,theory(equality)]),['unfolding']).
% cnf(53,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[34,36,theory(equality)])).
% cnf(90,plain,(join(composition(converse(X2),X1),converse(X3))=converse(join(composition(converse(X1),X2),X3))),inference(spm,[status(thm)],[30,53,theory(equality)])).
% cnf(100,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[53,18,theory(equality)])).
% cnf(104,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[100,36,theory(equality)])).
% cnf(107,plain,(one=converse(one)),inference(spm,[status(thm)],[18,104,theory(equality)])).
% cnf(120,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[104,107,theory(equality)])).
% cnf(129,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[24,22,theory(equality)])).
% cnf(133,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,24,theory(equality)])).
% cnf(137,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[133,22,theory(equality)])).
% cnf(230,plain,(complement(join(zero,complement(zero)))=zero),inference(spm,[status(thm)],[44,44,theory(equality)])).
% cnf(235,negated_conjecture,(complement(join(complement(esk3_0),complement(composition(esk1_0,esk2_0))))=zero),inference(rw,[status(thm)],[45,24,theory(equality)])).
% cnf(241,plain,(join(composition(X1,converse(X2)),converse(composition(X2,X3)))=composition(join(X1,converse(X3)),converse(X2))),inference(spm,[status(thm)],[28,34,theory(equality)])).
% cnf(431,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[26,24,theory(equality)])).
% cnf(435,plain,(join(X1,complement(X2))=join(complement(X2),join(X1,composition(converse(X3),complement(composition(X3,X2)))))),inference(spm,[status(thm)],[137,431,theory(equality)])).
% cnf(439,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[431,120,theory(equality)])).
% cnf(455,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[439,107,theory(equality)]),120,theory(equality)])).
% cnf(466,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[455,230,theory(equality)])).
% cnf(475,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,466,theory(equality)])).
% cnf(671,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[16,24,theory(equality)])).
% cnf(690,plain,(join(complement(join(complement(X1),complement(X1))),zero)=X1),inference(spm,[status(thm)],[671,44,theory(equality)])).
% cnf(707,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[690,455,theory(equality)])).
% cnf(709,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[707,24,theory(equality)])).
% cnf(717,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[475,709,theory(equality)])).
% cnf(740,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[709,717,theory(equality)])).
% cnf(765,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[455,740,theory(equality)])).
% cnf(767,negated_conjecture,(complement(zero)=join(complement(esk3_0),complement(composition(esk1_0,esk2_0)))),inference(spm,[status(thm)],[740,235,theory(equality)])).
% cnf(768,plain,(complement(join(X1,complement(X1)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44,740,theory(equality)]),24,theory(equality)])).
% cnf(815,plain,(join(X1,X2)=join(X1,join(join(X1,X2),X2))),inference(spm,[status(thm)],[137,765,theory(equality)])).
% cnf(825,plain,(join(X1,X2)=join(X2,join(X1,X2))),inference(spm,[status(thm)],[129,765,theory(equality)])).
% cnf(851,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[815,22,theory(equality)]),765,theory(equality)])).
% cnf(1073,plain,(complement(zero)=join(X1,complement(X1))),inference(spm,[status(thm)],[740,768,theory(equality)])).
% cnf(1097,plain,(join(complement(zero),X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,1073,theory(equality)])).
% cnf(1143,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[851,671,theory(equality)])).
% cnf(1151,plain,(join(X1,complement(zero))=complement(zero)),inference(spm,[status(thm)],[851,1073,theory(equality)])).
% cnf(1197,plain,(complement(zero)=join(complement(zero),X1)),inference(spm,[status(thm)],[24,1151,theory(equality)])).
% cnf(1594,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1143,24,theory(equality)])).
% cnf(1623,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1594,825,theory(equality)])).
% cnf(1673,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1623,740,theory(equality)])).
% cnf(1983,negated_conjecture,(join(complement(complement(zero)),complement(join(complement(esk3_0),complement(complement(composition(esk1_0,esk2_0))))))=esk3_0),inference(spm,[status(thm)],[671,767,theory(equality)])).
% cnf(1997,negated_conjecture,(complement(join(complement(esk3_0),composition(esk1_0,esk2_0)))=esk3_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1983,740,theory(equality)]),740,theory(equality)]),717,theory(equality)])).
% cnf(2002,negated_conjecture,(complement(esk3_0)=join(complement(esk3_0),composition(esk1_0,esk2_0))),inference(spm,[status(thm)],[740,1997,theory(equality)])).
% cnf(2016,plain,(join(X1,join(complement(X1),X2))=complement(zero)),inference(rw,[status(thm)],[1097,1197,theory(equality)])).
% cnf(2052,plain,(join(X1,join(X2,complement(X1)))=complement(zero)),inference(spm,[status(thm)],[2016,825,theory(equality)])).
% cnf(2408,negated_conjecture,(join(complement(composition(esk1_0,esk2_0)),complement(complement(esk3_0)))=complement(composition(esk1_0,esk2_0))),inference(spm,[status(thm)],[1673,2002,theory(equality)])).
% cnf(2447,negated_conjecture,(join(complement(composition(esk1_0,esk2_0)),esk3_0)=complement(composition(esk1_0,esk2_0))),inference(rw,[status(thm)],[2408,740,theory(equality)])).
% cnf(2477,negated_conjecture,(join(esk3_0,complement(composition(esk1_0,esk2_0)))=complement(composition(esk1_0,esk2_0))),inference(rw,[status(thm)],[2447,24,theory(equality)])).
% cnf(22796,plain,(converse(composition(join(converse(X1),converse(X3)),converse(X2)))=join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3))))),inference(spm,[status(thm)],[90,241,theory(equality)])).
% cnf(22894,plain,(composition(X2,join(X1,X3))=join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[22796,30,theory(equality)]),34,theory(equality)]),36,theory(equality)])).
% cnf(22895,plain,(composition(X2,join(X1,X3))=join(composition(X2,X1),composition(X2,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[22894,36,theory(equality)]),36,theory(equality)])).
% cnf(23004,plain,(join(composition(X1,join(X2,X3)),X4)=join(composition(X1,X2),join(composition(X1,X3),X4))),inference(spm,[status(thm)],[22,22895,theory(equality)])).
% cnf(143288,plain,(join(composition(X1,join(X2,X3)),complement(composition(X1,X2)))=complement(zero)),inference(spm,[status(thm)],[2052,23004,theory(equality)])).
% cnf(144196,plain,(join(complement(composition(X1,X2)),composition(X1,join(X2,X3)))=complement(zero)),inference(rw,[status(thm)],[143288,24,theory(equality)])).
% cnf(144286,negated_conjecture,(join(complement(composition(X1,esk3_0)),composition(X1,complement(composition(esk1_0,esk2_0))))=complement(zero)),inference(spm,[status(thm)],[144196,2477,theory(equality)])).
% cnf(1942469,negated_conjecture,(join(complement(esk2_0),complement(zero))=join(complement(composition(converse(esk1_0),esk3_0)),complement(esk2_0))),inference(spm,[status(thm)],[435,144286,theory(equality)])).
% cnf(1942942,negated_conjecture,(complement(zero)=join(complement(composition(converse(esk1_0),esk3_0)),complement(esk2_0))),inference(rw,[status(thm)],[1942469,1151,theory(equality)])).
% cnf(1943124,negated_conjecture,(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0)))=complement(zero)),inference(rw,[status(thm)],[1942942,24,theory(equality)])).
% cnf(1943459,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,1943124,theory(equality)]),740,theory(equality)])).
% cnf(1943460,negated_conjecture,($false),inference(cn,[status(thm)],[1943459,theory(equality)])).
% cnf(1943461,negated_conjecture,($false),1943460,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18544
% # ...of these trivial : 11637
% # ...subsumed : 5013
% # ...remaining for further processing: 1894
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 184
% # Generated clauses : 986069
% # ...of the previous two non-trivial : 552054
% # Contextual simplify-reflections : 0
% # Paramodulations : 986069
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1709
% # Positive orientable unit clauses: 1681
% # Positive unorientable unit clauses: 28
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 511970
% # ...number of literals in the above : 511970
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1330
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31996
% # Indexed BW rewrite successes : 543
% # Backwards rewriting index: 1049 leaves, 4.04+/-6.632 terms/leaf
% # Paramod-from index: 515 leaves, 3.34+/-4.835 terms/leaf
% # Paramod-into index: 929 leaves, 3.73+/-5.967 terms/leaf
% # -------------------------------------------------
% # User time : 34.251 s
% # System time : 1.401 s
% # Total time : 35.652 s
% # Maximum resident set size: 0 pages
% PrfWatch: 66.56 CPU 67.89 WC
% FINAL PrfWatch: 66.56 CPU 67.89 WC
% SZS output end Solution for /tmp/SystemOnTPTP30110/REL010+1.tptp
%
%------------------------------------------------------------------------------