TSTP Solution File: REL050+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL050+2 : TPTP v5.0.0. Released 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 : Wed Dec 29 22:04:17 EST 2010
% Result : Theorem 1.99s
% Output : Solution 1.99s
% 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/SystemOnTPTP2560/REL050+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2560/REL050+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2560/REL050+2.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 2656
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 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(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, 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(15, 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)],[14])).
% fof(16, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, 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)],[15])).
% fof(43, 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)],[42])).
% fof(44, 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)],[43])).
% cnf(45,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)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,31,theory(equality)]),['unfolding']).
% cnf(47,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)],[45,17,theory(equality)])).
% cnf(51,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[35,33,theory(equality)])).
% cnf(54,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[37,33,theory(equality)])).
% cnf(55,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[37,33,theory(equality)])).
% cnf(79,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[51,27,theory(equality)])).
% cnf(92,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[27,19,theory(equality)])).
% cnf(128,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[54,39,theory(equality)])).
% cnf(136,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[128,33,theory(equality)])).
% cnf(140,plain,(one=converse(one)),inference(spm,[status(thm)],[39,136,theory(equality)])).
% cnf(154,plain,(join(converse(X1),one)=converse(join(X1,one))),inference(spm,[status(thm)],[35,140,theory(equality)])).
% cnf(157,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[136,140,theory(equality)])).
% cnf(188,plain,(converse(join(X1,one))=join(one,converse(X1))),inference(rw,[status(thm)],[154,17,theory(equality)])).
% cnf(219,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,27,theory(equality)])).
% cnf(364,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[25,157,theory(equality)])).
% cnf(419,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[364,17,theory(equality)])).
% cnf(422,plain,(converse(composition(join(X2,one),converse(X1)))=join(X1,converse(composition(X2,converse(X1))))),inference(spm,[status(thm)],[51,419,theory(equality)])).
% cnf(427,plain,(join(X1,X1)=composition(join(one,one),X1)),inference(spm,[status(thm)],[419,157,theory(equality)])).
% cnf(433,plain,(composition(X1,join(one,converse(X2)))=join(X1,converse(composition(X2,converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[422,55,theory(equality)]),188,theory(equality)])).
% cnf(434,plain,(composition(X1,join(one,converse(X2)))=join(X1,composition(X1,converse(X2)))),inference(rw,[status(thm)],[433,55,theory(equality)])).
% cnf(499,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[92,17,theory(equality)])).
% cnf(680,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[29,17,theory(equality)])).
% cnf(686,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[680,157,theory(equality)])).
% cnf(704,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[686,140,theory(equality)]),157,theory(equality)])).
% cnf(710,plain,(composition(join(one,one),complement(X1))=complement(X1)),inference(rw,[status(thm)],[704,427,theory(equality)])).
% cnf(716,plain,(composition(join(one,one),zero)=zero),inference(spm,[status(thm)],[710,219,theory(equality)])).
% cnf(726,plain,(join(zero,zero)=zero),inference(rw,[status(thm)],[716,427,theory(equality)])).
% cnf(728,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,726,theory(equality)])).
% cnf(952,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,17,theory(equality)])).
% cnf(966,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[952,27,theory(equality)])).
% cnf(989,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[966,427,theory(equality)]),710,theory(equality)]),219,theory(equality)])).
% cnf(997,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[989,17,theory(equality)])).
% cnf(1004,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[728,997,theory(equality)])).
% cnf(1025,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[17,1004,theory(equality)])).
% cnf(1038,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[997,1004,theory(equality)])).
% cnf(1086,plain,(composition(join(one,one),X1)=X1),inference(spm,[status(thm)],[710,1038,theory(equality)])).
% cnf(1216,plain,(join(X1,X1)=X1),inference(rw,[status(thm)],[427,1086,theory(equality)])).
% cnf(1240,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,1216,theory(equality)])).
% cnf(1241,plain,(join(X1,join(X1,complement(X1)))=top),inference(spm,[status(thm)],[92,1216,theory(equality)])).
% cnf(1264,plain,(join(X1,top)=top),inference(rw,[status(thm)],[1241,27,theory(equality)])).
% cnf(1272,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,1264,theory(equality)])).
% cnf(1285,plain,(top=converse(top)),inference(spm,[status(thm)],[79,1272,theory(equality)])).
% cnf(1287,plain,(top=composition(join(X1,one),top)),inference(spm,[status(thm)],[419,1272,theory(equality)])).
% cnf(1309,plain,(converse(composition(top,X1))=composition(converse(X1),top)),inference(spm,[status(thm)],[54,1285,theory(equality)])).
% cnf(1316,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[79,1285,theory(equality)])).
% cnf(1456,plain,(composition(top,top)=top),inference(spm,[status(thm)],[1287,1272,theory(equality)])).
% cnf(1470,plain,(composition(top,X1)=composition(top,composition(top,X1))),inference(spm,[status(thm)],[23,1456,theory(equality)])).
% cnf(1601,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1240,952,theory(equality)])).
% cnf(1609,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[1240,17,theory(equality)])).
% cnf(2173,plain,(join(complement(composition(top,X1)),composition(converse(top),complement(composition(top,X1))))=complement(composition(top,X1))),inference(spm,[status(thm)],[680,1470,theory(equality)])).
% cnf(2185,plain,(composition(top,complement(composition(top,X1)))=complement(composition(top,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2173,1285,theory(equality)]),419,theory(equality)]),1272,theory(equality)])).
% cnf(2195,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1601,17,theory(equality)])).
% cnf(2228,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[2195,1609,theory(equality)])).
% cnf(2279,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[19,2228,theory(equality)])).
% cnf(2291,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[2228,1038,theory(equality)])).
% cnf(2983,plain,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),top)),inference(spm,[status(thm)],[1309,2185,theory(equality)])).
% cnf(8550,plain,(join(X1,composition(X1,top))=composition(X1,join(one,top))),inference(spm,[status(thm)],[434,1285,theory(equality)])).
% cnf(8606,plain,(join(X1,composition(X1,top))=composition(X1,top)),inference(rw,[status(thm)],[8550,1264,theory(equality)])).
% cnf(8669,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)],[47,8606,theory(equality)])).
% cnf(8670,negated_conjecture,($false|composition(complement(composition(esk1_0,top)),top)!=complement(composition(esk1_0,top))),inference(rw,[status(thm)],[8669,8606,theory(equality)])).
% cnf(8671,negated_conjecture,(composition(complement(composition(esk1_0,top)),top)!=complement(composition(esk1_0,top))),inference(cn,[status(thm)],[8670,theory(equality)])).
% cnf(38274,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[2279,952,theory(equality)])).
% cnf(38545,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[38274,1038,theory(equality)])).
% cnf(38657,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[38545,1038,theory(equality)])).
% cnf(39958,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[38657,499,theory(equality)])).
% cnf(40166,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)],[39958,219,theory(equality)]),19,theory(equality)]),1025,theory(equality)])).
% cnf(40167,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[40166,19,theory(equality)]),17,theory(equality)]),2291,theory(equality)])).
% cnf(40363,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[40167,1316,theory(equality)])).
% cnf(40580,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[40363,219,theory(equality)]),1025,theory(equality)])).
% cnf(40687,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[51,40580,theory(equality)])).
% cnf(40830,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[40687,33,theory(equality)])).
% cnf(40831,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[40830,33,theory(equality)])).
% cnf(41021,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[40831,1038,theory(equality)])).
% cnf(41288,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2291,41021,theory(equality)])).
% cnf(41379,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[41288,1038,theory(equality)]),17,theory(equality)]),40580,theory(equality)])).
% cnf(41439,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1038,41379,theory(equality)])).
% cnf(41576,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[33,41439,theory(equality)])).
% cnf(41785,plain,(composition(complement(composition(converse(X1),top)),top)=converse(complement(composition(top,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2983,41576,theory(equality)]),1309,theory(equality)])).
% cnf(41786,plain,(composition(complement(composition(converse(X1),top)),top)=complement(composition(converse(X1),top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[41785,41576,theory(equality)]),1309,theory(equality)])).
% cnf(42334,plain,(composition(complement(composition(X1,top)),top)=complement(composition(X1,top))),inference(spm,[status(thm)],[41786,33,theory(equality)])).
% cnf(42870,negated_conjecture,($false),inference(rw,[status(thm)],[8671,42334,theory(equality)])).
% cnf(42871,negated_conjecture,($false),inference(cn,[status(thm)],[42870,theory(equality)])).
% cnf(42872,negated_conjecture,($false),42871,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1145
% # ...of these trivial : 702
% # ...subsumed : 112
% # ...remaining for further processing: 331
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 122
% # Generated clauses : 21653
% # ...of the previous two non-trivial : 9943
% # Contextual simplify-reflections : 0
% # Paramodulations : 21653
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 209
% # Positive orientable unit clauses: 205
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 5721
% # ...number of literals in the above : 5721
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 25
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 905
% # Indexed BW rewrite successes : 273
% # Backwards rewriting index: 257 leaves, 1.72+/-1.412 terms/leaf
% # Paramod-from index: 136 leaves, 1.55+/-1.265 terms/leaf
% # Paramod-into index: 221 leaves, 1.72+/-1.389 terms/leaf
% # -------------------------------------------------
% # User time : 0.444 s
% # System time : 0.019 s
% # Total time : 0.463 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.05 CPU 1.12 WC
% FINAL PrfWatch: 1.05 CPU 1.12 WC
% SZS output end Solution for /tmp/SystemOnTPTP2560/REL050+2.tptp
%
%------------------------------------------------------------------------------