↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU408+1 : TPTP v5.0.0. Released v3.4.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 : Thu Dec 30 05:02:29 EST 2010

% Result   : Theorem 1.01s
% Output   : Solution 1.01s
% 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/SystemOnTPTP14627/SEU408+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14627/SEU408+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14627/SEU408+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 14723
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:(r2_hidden(X1,X2)=>m1_subset_1(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(8, axiom,![X1]:![X2]:((l1_orders_2(X1)&l1_orders_2(X2))=>(v1_orders_2(k1_latsum_1(X1,X2))&l1_orders_2(k1_latsum_1(X1,X2)))),file('/tmp/SRASS.s.p', dt_k1_latsum_1)).
% fof(14, axiom,![X1]:![X2]:k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(23, axiom,![X1]:(l1_orders_2(X1)=>![X2]:(l1_orders_2(X2)=>![X3]:((v1_orders_2(X3)&l1_orders_2(X3))=>(X3=k1_latsum_1(X1,X2)<=>(u1_struct_0(X3)=k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))&u1_orders_2(X3)=k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))))))),file('/tmp/SRASS.s.p', d2_latsum_1)).
% fof(24, axiom,![X1]:![X2]:![X3]:(X3=k2_xboole_0(X1,X2)<=>![X4]:(r2_hidden(X4,X3)<=>(r2_hidden(X4,X1)|r2_hidden(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(51, conjecture,![X1]:((((((~(v3_struct_0(X1))&v2_orders_2(X1))&v3_orders_2(X1))&v4_orders_2(X1))&v1_lattice3(X1))&l1_orders_2(X1))=>![X2]:((((((~(v3_struct_0(X2))&v2_orders_2(X2))&v3_orders_2(X2))&v4_orders_2(X2))&v1_lattice3(X2))&l1_orders_2(X2))=>![X3]:(r2_hidden(X3,u1_struct_0(X2))=>m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))))),file('/tmp/SRASS.s.p', t11_latsum_1)).
% fof(52, negated_conjecture,~(![X1]:((((((~(v3_struct_0(X1))&v2_orders_2(X1))&v3_orders_2(X1))&v4_orders_2(X1))&v1_lattice3(X1))&l1_orders_2(X1))=>![X2]:((((((~(v3_struct_0(X2))&v2_orders_2(X2))&v3_orders_2(X2))&v4_orders_2(X2))&v1_lattice3(X2))&l1_orders_2(X2))=>![X3]:(r2_hidden(X3,u1_struct_0(X2))=>m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))))))),inference(assume_negation,[status(cth)],[51])).
% fof(62, negated_conjecture,~(![X1]:((((((~(v3_struct_0(X1))&v2_orders_2(X1))&v3_orders_2(X1))&v4_orders_2(X1))&v1_lattice3(X1))&l1_orders_2(X1))=>![X2]:((((((~(v3_struct_0(X2))&v2_orders_2(X2))&v3_orders_2(X2))&v4_orders_2(X2))&v1_lattice3(X2))&l1_orders_2(X2))=>![X3]:(r2_hidden(X3,u1_struct_0(X2))=>m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))))))),inference(fof_simplification,[status(thm)],[52,theory(equality)])).
% fof(72, plain,![X1]:![X2]:(~(r2_hidden(X1,X2))|m1_subset_1(X1,X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(73, plain,![X3]:![X4]:(~(r2_hidden(X3,X4))|m1_subset_1(X3,X4)),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(m1_subset_1(X1,X2)|~r2_hidden(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(88, plain,![X1]:![X2]:((~(l1_orders_2(X1))|~(l1_orders_2(X2)))|(v1_orders_2(k1_latsum_1(X1,X2))&l1_orders_2(k1_latsum_1(X1,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(89, plain,![X3]:![X4]:((~(l1_orders_2(X3))|~(l1_orders_2(X4)))|(v1_orders_2(k1_latsum_1(X3,X4))&l1_orders_2(k1_latsum_1(X3,X4)))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X3]:![X4]:((v1_orders_2(k1_latsum_1(X3,X4))|(~(l1_orders_2(X3))|~(l1_orders_2(X4))))&(l1_orders_2(k1_latsum_1(X3,X4))|(~(l1_orders_2(X3))|~(l1_orders_2(X4))))),inference(distribute,[status(thm)],[89])).
% cnf(91,plain,(l1_orders_2(k1_latsum_1(X2,X1))|~l1_orders_2(X1)|~l1_orders_2(X2)),inference(split_conjunct,[status(thm)],[90])).
% cnf(92,plain,(v1_orders_2(k1_latsum_1(X2,X1))|~l1_orders_2(X1)|~l1_orders_2(X2)),inference(split_conjunct,[status(thm)],[90])).
% fof(111, plain,![X3]:![X4]:k2_xboole_0(X3,X4)=k2_xboole_0(X4,X3),inference(variable_rename,[status(thm)],[14])).
% cnf(112,plain,(k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(137, plain,![X1]:(~(l1_orders_2(X1))|![X2]:(~(l1_orders_2(X2))|![X3]:((~(v1_orders_2(X3))|~(l1_orders_2(X3)))|((~(X3=k1_latsum_1(X1,X2))|(u1_struct_0(X3)=k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))&u1_orders_2(X3)=k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))))&((~(u1_struct_0(X3)=k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)))|~(u1_orders_2(X3)=k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))))|X3=k1_latsum_1(X1,X2)))))),inference(fof_nnf,[status(thm)],[23])).
% fof(138, plain,![X4]:(~(l1_orders_2(X4))|![X5]:(~(l1_orders_2(X5))|![X6]:((~(v1_orders_2(X6))|~(l1_orders_2(X6)))|((~(X6=k1_latsum_1(X4,X5))|(u1_struct_0(X6)=k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))&u1_orders_2(X6)=k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))))&((~(u1_struct_0(X6)=k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5)))|~(u1_orders_2(X6)=k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))))|X6=k1_latsum_1(X4,X5)))))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X4]:![X5]:![X6]:((((~(v1_orders_2(X6))|~(l1_orders_2(X6)))|((~(X6=k1_latsum_1(X4,X5))|(u1_struct_0(X6)=k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))&u1_orders_2(X6)=k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))))&((~(u1_struct_0(X6)=k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5)))|~(u1_orders_2(X6)=k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))))|X6=k1_latsum_1(X4,X5))))|~(l1_orders_2(X5)))|~(l1_orders_2(X4))),inference(shift_quantors,[status(thm)],[138])).
% fof(140, plain,![X4]:![X5]:![X6]:((((((u1_struct_0(X6)=k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))|~(X6=k1_latsum_1(X4,X5)))|(~(v1_orders_2(X6))|~(l1_orders_2(X6))))|~(l1_orders_2(X5)))|~(l1_orders_2(X4)))&((((u1_orders_2(X6)=k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))|~(X6=k1_latsum_1(X4,X5)))|(~(v1_orders_2(X6))|~(l1_orders_2(X6))))|~(l1_orders_2(X5)))|~(l1_orders_2(X4))))&(((((~(u1_struct_0(X6)=k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5)))|~(u1_orders_2(X6)=k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))))|X6=k1_latsum_1(X4,X5))|(~(v1_orders_2(X6))|~(l1_orders_2(X6))))|~(l1_orders_2(X5)))|~(l1_orders_2(X4)))),inference(distribute,[status(thm)],[139])).
% cnf(143,plain,(u1_struct_0(X3)=k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))|~l1_orders_2(X1)|~l1_orders_2(X2)|~l1_orders_2(X3)|~v1_orders_2(X3)|X3!=k1_latsum_1(X1,X2)),inference(split_conjunct,[status(thm)],[140])).
% fof(144, plain,![X1]:![X2]:![X3]:((~(X3=k2_xboole_0(X1,X2))|![X4]:((~(r2_hidden(X4,X3))|(r2_hidden(X4,X1)|r2_hidden(X4,X2)))&((~(r2_hidden(X4,X1))&~(r2_hidden(X4,X2)))|r2_hidden(X4,X3))))&(?[X4]:((~(r2_hidden(X4,X3))|(~(r2_hidden(X4,X1))&~(r2_hidden(X4,X2))))&(r2_hidden(X4,X3)|(r2_hidden(X4,X1)|r2_hidden(X4,X2))))|X3=k2_xboole_0(X1,X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(145, plain,![X5]:![X6]:![X7]:((~(X7=k2_xboole_0(X5,X6))|![X8]:((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))&((~(r2_hidden(X8,X5))&~(r2_hidden(X8,X6)))|r2_hidden(X8,X7))))&(?[X9]:((~(r2_hidden(X9,X7))|(~(r2_hidden(X9,X5))&~(r2_hidden(X9,X6))))&(r2_hidden(X9,X7)|(r2_hidden(X9,X5)|r2_hidden(X9,X6))))|X7=k2_xboole_0(X5,X6))),inference(variable_rename,[status(thm)],[144])).
% fof(146, plain,![X5]:![X6]:![X7]:((~(X7=k2_xboole_0(X5,X6))|![X8]:((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))&((~(r2_hidden(X8,X5))&~(r2_hidden(X8,X6)))|r2_hidden(X8,X7))))&(((~(r2_hidden(esk9_3(X5,X6,X7),X7))|(~(r2_hidden(esk9_3(X5,X6,X7),X5))&~(r2_hidden(esk9_3(X5,X6,X7),X6))))&(r2_hidden(esk9_3(X5,X6,X7),X7)|(r2_hidden(esk9_3(X5,X6,X7),X5)|r2_hidden(esk9_3(X5,X6,X7),X6))))|X7=k2_xboole_0(X5,X6))),inference(skolemize,[status(esa)],[145])).
% fof(147, plain,![X5]:![X6]:![X7]:![X8]:((((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))&((~(r2_hidden(X8,X5))&~(r2_hidden(X8,X6)))|r2_hidden(X8,X7)))|~(X7=k2_xboole_0(X5,X6)))&(((~(r2_hidden(esk9_3(X5,X6,X7),X7))|(~(r2_hidden(esk9_3(X5,X6,X7),X5))&~(r2_hidden(esk9_3(X5,X6,X7),X6))))&(r2_hidden(esk9_3(X5,X6,X7),X7)|(r2_hidden(esk9_3(X5,X6,X7),X5)|r2_hidden(esk9_3(X5,X6,X7),X6))))|X7=k2_xboole_0(X5,X6))),inference(shift_quantors,[status(thm)],[146])).
% fof(148, plain,![X5]:![X6]:![X7]:![X8]:((((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))|~(X7=k2_xboole_0(X5,X6)))&(((~(r2_hidden(X8,X5))|r2_hidden(X8,X7))|~(X7=k2_xboole_0(X5,X6)))&((~(r2_hidden(X8,X6))|r2_hidden(X8,X7))|~(X7=k2_xboole_0(X5,X6)))))&((((~(r2_hidden(esk9_3(X5,X6,X7),X5))|~(r2_hidden(esk9_3(X5,X6,X7),X7)))|X7=k2_xboole_0(X5,X6))&((~(r2_hidden(esk9_3(X5,X6,X7),X6))|~(r2_hidden(esk9_3(X5,X6,X7),X7)))|X7=k2_xboole_0(X5,X6)))&((r2_hidden(esk9_3(X5,X6,X7),X7)|(r2_hidden(esk9_3(X5,X6,X7),X5)|r2_hidden(esk9_3(X5,X6,X7),X6)))|X7=k2_xboole_0(X5,X6)))),inference(distribute,[status(thm)],[147])).
% cnf(153,plain,(r2_hidden(X4,X1)|X1!=k2_xboole_0(X2,X3)|~r2_hidden(X4,X2)),inference(split_conjunct,[status(thm)],[148])).
% fof(220, negated_conjecture,?[X1]:((((((~(v3_struct_0(X1))&v2_orders_2(X1))&v3_orders_2(X1))&v4_orders_2(X1))&v1_lattice3(X1))&l1_orders_2(X1))&?[X2]:((((((~(v3_struct_0(X2))&v2_orders_2(X2))&v3_orders_2(X2))&v4_orders_2(X2))&v1_lattice3(X2))&l1_orders_2(X2))&?[X3]:(r2_hidden(X3,u1_struct_0(X2))&~(m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))))))),inference(fof_nnf,[status(thm)],[62])).
% fof(221, negated_conjecture,?[X4]:((((((~(v3_struct_0(X4))&v2_orders_2(X4))&v3_orders_2(X4))&v4_orders_2(X4))&v1_lattice3(X4))&l1_orders_2(X4))&?[X5]:((((((~(v3_struct_0(X5))&v2_orders_2(X5))&v3_orders_2(X5))&v4_orders_2(X5))&v1_lattice3(X5))&l1_orders_2(X5))&?[X6]:(r2_hidden(X6,u1_struct_0(X5))&~(m1_subset_1(X6,u1_struct_0(k1_latsum_1(X4,X5))))))),inference(variable_rename,[status(thm)],[220])).
% fof(222, negated_conjecture,((((((~(v3_struct_0(esk11_0))&v2_orders_2(esk11_0))&v3_orders_2(esk11_0))&v4_orders_2(esk11_0))&v1_lattice3(esk11_0))&l1_orders_2(esk11_0))&((((((~(v3_struct_0(esk12_0))&v2_orders_2(esk12_0))&v3_orders_2(esk12_0))&v4_orders_2(esk12_0))&v1_lattice3(esk12_0))&l1_orders_2(esk12_0))&(r2_hidden(esk13_0,u1_struct_0(esk12_0))&~(m1_subset_1(esk13_0,u1_struct_0(k1_latsum_1(esk11_0,esk12_0))))))),inference(skolemize,[status(esa)],[221])).
% cnf(223,negated_conjecture,(~m1_subset_1(esk13_0,u1_struct_0(k1_latsum_1(esk11_0,esk12_0)))),inference(split_conjunct,[status(thm)],[222])).
% cnf(224,negated_conjecture,(r2_hidden(esk13_0,u1_struct_0(esk12_0))),inference(split_conjunct,[status(thm)],[222])).
% cnf(225,negated_conjecture,(l1_orders_2(esk12_0)),inference(split_conjunct,[status(thm)],[222])).
% cnf(231,negated_conjecture,(l1_orders_2(esk11_0)),inference(split_conjunct,[status(thm)],[222])).
% cnf(240,negated_conjecture,(~r2_hidden(esk13_0,u1_struct_0(k1_latsum_1(esk11_0,esk12_0)))),inference(spm,[status(thm)],[223,74,theory(equality)])).
% cnf(291,plain,(r2_hidden(X1,k2_xboole_0(X2,X3))|~r2_hidden(X1,X2)),inference(er,[status(thm)],[153,theory(equality)])).
% cnf(316,plain,(k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))=u1_struct_0(k1_latsum_1(X1,X2))|~v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1)),inference(er,[status(thm)],[143,theory(equality)])).
% cnf(865,plain,(u1_struct_0(k1_latsum_1(X1,X2))=k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))|~v1_orders_2(k1_latsum_1(X1,X2))|~l1_orders_2(X2)|~l1_orders_2(X1)),inference(csr,[status(thm)],[316,91])).
% cnf(866,plain,(u1_struct_0(k1_latsum_1(X1,X2))=k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))|~l1_orders_2(X2)|~l1_orders_2(X1)),inference(csr,[status(thm)],[865,92])).
% cnf(882,negated_conjecture,(~r2_hidden(esk13_0,k2_xboole_0(u1_struct_0(esk11_0),u1_struct_0(esk12_0)))|~l1_orders_2(esk12_0)|~l1_orders_2(esk11_0)),inference(spm,[status(thm)],[240,866,theory(equality)])).
% cnf(886,negated_conjecture,(~r2_hidden(esk13_0,k2_xboole_0(u1_struct_0(esk11_0),u1_struct_0(esk12_0)))|$false|~l1_orders_2(esk11_0)),inference(rw,[status(thm)],[882,225,theory(equality)])).
% cnf(887,negated_conjecture,(~r2_hidden(esk13_0,k2_xboole_0(u1_struct_0(esk11_0),u1_struct_0(esk12_0)))|$false|$false),inference(rw,[status(thm)],[886,231,theory(equality)])).
% cnf(888,negated_conjecture,(~r2_hidden(esk13_0,k2_xboole_0(u1_struct_0(esk11_0),u1_struct_0(esk12_0)))),inference(cn,[status(thm)],[887,theory(equality)])).
% cnf(891,negated_conjecture,(~r2_hidden(esk13_0,k2_xboole_0(u1_struct_0(esk12_0),u1_struct_0(esk11_0)))),inference(rw,[status(thm)],[888,112,theory(equality)])).
% cnf(893,negated_conjecture,(~r2_hidden(esk13_0,u1_struct_0(esk12_0))),inference(spm,[status(thm)],[891,291,theory(equality)])).
% cnf(894,negated_conjecture,($false),inference(rw,[status(thm)],[893,224,theory(equality)])).
% cnf(895,negated_conjecture,($false),inference(cn,[status(thm)],[894,theory(equality)])).
% cnf(896,negated_conjecture,($false),895,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 324
% # ...of these trivial                : 4
% # ...subsumed                        : 142
% # ...remaining for further processing: 178
% # Other redundant clauses eliminated : 10
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 3
% # Generated clauses                  : 524
% # ...of the previous two non-trivial : 460
% # Contextual simplify-reflections    : 13
% # Paramodulations                    : 495
% # Factorizations                     : 6
% # Equation resolutions               : 20
% # Current number of processed clauses: 174
% #    Positive orientable unit clauses: 46
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 13
% #    Non-unit-clauses                : 114
% # Current number of unprocessed clauses: 206
% # ...number of literals in the above : 653
% # Clause-clause subsumption calls (NU) : 1311
% # Rec. Clause-clause subsumption calls : 1210
% # Unit Clause-clause subsumption calls : 49
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 16
% # Indexed BW rewrite successes       : 8
% # Backwards rewriting index:   169 leaves,   1.46+/-1.254 terms/leaf
% # Paramod-from index:           78 leaves,   1.12+/-0.392 terms/leaf
% # Paramod-into index:          154 leaves,   1.29+/-0.702 terms/leaf
% # -------------------------------------------------
% # User time              : 0.041 s
% # System time            : 0.005 s
% # Total time             : 0.046 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP14627/SEU408+1.tptp
% 
%------------------------------------------------------------------------------