%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV380+1 : TPTP v5.0.0. Released v3.3.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 08:50:15 EST 2010
% Result : Theorem 3.98s
% Output : Solution 3.98s
% 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/SystemOnTPTP19022/SWV380+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19022/SWV380+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19022/SWV380+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 19118
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4)))),file('/tmp/SRASS.s.p', l16_l14)).
% fof(2, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(5, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(7, axiom,![X1]:![X2]:findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad),file('/tmp/SRASS.s.p', ax46)).
% fof(11, axiom,![X1]:removemin_cpq_eff(X1)=remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),file('/tmp/SRASS.s.p', ax52)).
% fof(13, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(18, axiom,![X1]:![X2]:![X3]:![X4]:((~(X2=create_slb)&~(contains_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),file('/tmp/SRASS.s.p', ax47)).
% fof(19, axiom,![X1]:![X2]:![X3]:![X4]:(((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)),file('/tmp/SRASS.s.p', ax49)).
% fof(22, axiom,![X1]:![X2]:findmin_cpq_res(triple(X1,create_slb,X2))=bottom,file('/tmp/SRASS.s.p', ax50)).
% fof(23, axiom,![X1]:![X2]:![X3]:![X4]:(~(X2=create_slb)=>findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),file('/tmp/SRASS.s.p', ax51)).
% fof(32, axiom,![X1]:![X2]:![X3]:![X4]:(((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),file('/tmp/SRASS.s.p', ax48)).
% fof(36, axiom,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),file('/tmp/SRASS.s.p', stricly_smaller_definition)).
% fof(43, conjecture,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(removemin_cpq_eff(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l16_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(removemin_cpq_eff(triple(X1,X2,X3)))))),inference(assume_negation,[status(cth)],[43])).
% fof(45, plain,![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(47, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(49, plain,![X1]:![X2]:![X3]:![X4]:((~(X2=create_slb)&~(contains_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(54, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[36,theory(equality)])).
% fof(55, negated_conjecture,~(![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(removemin_cpq_eff(triple(X1,X2,X3)))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(56, plain,![X1]:![X2]:![X3]:![X4]:(ok(triple(X1,X2,X3))|~(ok(remove_cpq(triple(X1,X2,X3),X4)))),inference(fof_nnf,[status(thm)],[45])).
% fof(57, plain,![X5]:![X6]:![X7]:![X8]:(ok(triple(X5,X6,X7))|~(ok(remove_cpq(triple(X5,X6,X7),X8)))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(ok(triple(X1,X2,X3))|~ok(remove_cpq(triple(X1,X2,X3),X4))),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[46])).
% fof(60, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[60])).
% fof(67, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[47])).
% cnf(68,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[67])).
% fof(72, plain,![X3]:![X4]:findmin_cpq_eff(triple(X3,create_slb,X4))=triple(X3,create_slb,bad),inference(variable_rename,[status(thm)],[7])).
% cnf(73,plain,(findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad)),inference(split_conjunct,[status(thm)],[72])).
% fof(83, plain,![X2]:removemin_cpq_eff(X2)=remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(84,plain,(removemin_cpq_eff(X1)=remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1))),inference(split_conjunct,[status(thm)],[83])).
% fof(88, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[13])).
% cnf(89,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(100, plain,![X1]:![X2]:![X3]:![X4]:((X2=create_slb|contains_slb(X2,findmin_pqp_res(X1)))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_nnf,[status(thm)],[49])).
% fof(101, plain,![X5]:![X6]:![X7]:![X8]:((X6=create_slb|contains_slb(X6,findmin_pqp_res(X5)))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad)),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|contains_slb(X2,findmin_pqp_res(X1))|X2=create_slb),inference(split_conjunct,[status(thm)],[101])).
% fof(103, plain,![X1]:![X2]:![X3]:![X4]:(((X2=create_slb|~(contains_slb(X2,findmin_pqp_res(X1))))|~(less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)),inference(fof_nnf,[status(thm)],[19])).
% fof(104, plain,![X5]:![X6]:![X7]:![X8]:(((X6=create_slb|~(contains_slb(X6,findmin_pqp_res(X5))))|~(less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7)),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)|X2=create_slb|~less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))|~contains_slb(X2,findmin_pqp_res(X1))),inference(split_conjunct,[status(thm)],[104])).
% fof(115, plain,![X3]:![X4]:findmin_cpq_res(triple(X3,create_slb,X4))=bottom,inference(variable_rename,[status(thm)],[22])).
% cnf(116,plain,(findmin_cpq_res(triple(X1,create_slb,X2))=bottom),inference(split_conjunct,[status(thm)],[115])).
% fof(117, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[23])).
% fof(118, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[117])).
% cnf(119,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[118])).
% fof(143, plain,![X1]:![X2]:![X3]:![X4]:(((X2=create_slb|~(contains_slb(X2,findmin_pqp_res(X1))))|~(strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_nnf,[status(thm)],[32])).
% fof(144, plain,![X5]:![X6]:![X7]:![X8]:(((X6=create_slb|~(contains_slb(X6,findmin_pqp_res(X5))))|~(strictly_less_than(findmin_pqp_res(X5),lookup_slb(X6,findmin_pqp_res(X5)))))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad)),inference(variable_rename,[status(thm)],[143])).
% cnf(145,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|X2=create_slb|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))|~contains_slb(X2,findmin_pqp_res(X1))),inference(split_conjunct,[status(thm)],[144])).
% fof(153, plain,![X1]:![X2]:((~(strictly_less_than(X1,X2))|(less_than(X1,X2)&~(less_than(X2,X1))))&((~(less_than(X1,X2))|less_than(X2,X1))|strictly_less_than(X1,X2))),inference(fof_nnf,[status(thm)],[54])).
% fof(154, plain,![X3]:![X4]:((~(strictly_less_than(X3,X4))|(less_than(X3,X4)&~(less_than(X4,X3))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(variable_rename,[status(thm)],[153])).
% fof(155, plain,![X3]:![X4]:(((less_than(X3,X4)|~(strictly_less_than(X3,X4)))&(~(less_than(X4,X3))|~(strictly_less_than(X3,X4))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(distribute,[status(thm)],[154])).
% cnf(156,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[155])).
% fof(176, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(ok(triple(X1,X2,X3)))&ok(removemin_cpq_eff(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[55])).
% fof(177, negated_conjecture,?[X4]:?[X5]:?[X6]:(~(ok(triple(X4,X5,X6)))&ok(removemin_cpq_eff(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[176])).
% fof(178, negated_conjecture,(~(ok(triple(esk1_0,esk2_0,esk3_0)))&ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[177])).
% cnf(179,negated_conjecture,(ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[178])).
% cnf(180,negated_conjecture,(~ok(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[178])).
% cnf(181,negated_conjecture,(ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(rw,[status(thm)],[179,84,theory(equality)]),['unfolding']).
% cnf(183,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[156,89])).
% cnf(187,plain,(triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))),inference(csr,[status(thm)],[145,102])).
% cnf(188,negated_conjecture,(bad=esk3_0),inference(spm,[status(thm)],[180,61,theory(equality)])).
% cnf(229,plain,(findmin_cpq_eff(triple(X1,X2,X4))=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|contains_slb(X2,findmin_pqp_res(X1))),inference(spm,[status(thm)],[102,102,theory(equality)])).
% cnf(302,plain,(triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))),inference(spm,[status(thm)],[187,183,theory(equality)])).
% cnf(303,negated_conjecture,(ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),findmin_cpq_res(triple(esk1_0,esk2_0,bad))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[181,188,theory(equality)]),188,theory(equality)])).
% cnf(305,negated_conjecture,(ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),findmin_pqp_res(esk1_0)))|create_slb=esk2_0),inference(spm,[status(thm)],[303,119,theory(equality)])).
% cnf(452,negated_conjecture,(esk2_0=create_slb|ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0)))|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[305,229,theory(equality)])).
% cnf(499,negated_conjecture,(esk2_0=create_slb|contains_slb(esk2_0,findmin_pqp_res(esk1_0))|ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0)))),inference(spm,[status(thm)],[452,102,theory(equality)])).
% cnf(577,negated_conjecture,(ok(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))|esk2_0=create_slb|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[58,499,theory(equality)])).
% cnf(582,negated_conjecture,(esk2_0=create_slb|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(sr,[status(thm)],[577,68,theory(equality)])).
% cnf(1283,plain,(findmin_cpq_eff(triple(X1,X2,X4))=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))),inference(spm,[status(thm)],[302,302,theory(equality)])).
% cnf(50893,negated_conjecture,(esk2_0=create_slb|ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0)))|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[305,1283,theory(equality)])).
% cnf(51205,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0)))),inference(spm,[status(thm)],[50893,302,theory(equality)])).
% cnf(51402,negated_conjecture,(ok(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))|esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[58,51205,theory(equality)])).
% cnf(51431,negated_conjecture,(esk2_0=create_slb|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(sr,[status(thm)],[51402,68,theory(equality)])).
% cnf(51469,negated_conjecture,(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1)=findmin_cpq_eff(triple(esk1_0,esk2_0,X1))|create_slb=esk2_0|~contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[105,51431,theory(equality)])).
% cnf(52164,negated_conjecture,(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1)=findmin_cpq_eff(triple(esk1_0,esk2_0,X1))|esk2_0=create_slb),inference(csr,[status(thm)],[51469,582])).
% cnf(52200,negated_conjecture,(ok(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))|esk2_0=create_slb|~ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))),inference(spm,[status(thm)],[58,52164,theory(equality)])).
% cnf(52230,negated_conjecture,(esk2_0=create_slb|~ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))),inference(spm,[status(thm)],[68,52164,theory(equality)])).
% cnf(52690,negated_conjecture,(esk2_0=create_slb|ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))),inference(spm,[status(thm)],[52200,305,theory(equality)])).
% cnf(52694,negated_conjecture,(esk2_0=create_slb),inference(csr,[status(thm)],[52690,52230])).
% cnf(52855,negated_conjecture,(ok(remove_cpq(triple(esk1_0,create_slb,bad),bottom))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[303,52694,theory(equality)]),73,theory(equality)]),52694,theory(equality)]),116,theory(equality)])).
% cnf(52856,negated_conjecture,(ok(triple(esk1_0,create_slb,bad))),inference(spm,[status(thm)],[58,52855,theory(equality)])).
% cnf(52868,negated_conjecture,($false),inference(sr,[status(thm)],[52856,68,theory(equality)])).
% cnf(52869,negated_conjecture,($false),52868,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1978
% # ...of these trivial : 8
% # ...subsumed : 1238
% # ...remaining for further processing: 732
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 62
% # Backward-rewritten : 68
% # Generated clauses : 48962
% # ...of the previous two non-trivial : 48007
% # Contextual simplify-reflections : 746
% # Paramodulations : 48848
% # Factorizations : 112
% # Equation resolutions : 3
% # Current number of processed clauses: 549
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 59
% # Non-unit-clauses : 456
% # Current number of unprocessed clauses: 23884
% # ...number of literals in the above : 111620
% # Clause-clause subsumption calls (NU) : 18673
% # Rec. Clause-clause subsumption calls : 12306
% # Unit Clause-clause subsumption calls : 976
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 61
% # Indexed BW rewrite successes : 16
% # Backwards rewriting index: 291 leaves, 4.77+/-8.174 terms/leaf
% # Paramod-from index: 120 leaves, 2.06+/-2.237 terms/leaf
% # Paramod-into index: 244 leaves, 4.70+/-8.332 terms/leaf
% # -------------------------------------------------
% # User time : 2.077 s
% # System time : 0.070 s
% # Total time : 2.147 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.14 CPU 3.39 WC
% FINAL PrfWatch: 3.14 CPU 3.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP19022/SWV380+1.tptp
%
%------------------------------------------------------------------------------