TSTP Solution File: SWV391+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV391+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 : art05.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:53:01 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP30364/SWV391+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30364/SWV391+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30364/SWV391+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 30460
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(ok(remove_cpq(triple(X1,X2,X3),X4))=>contains_slb(X2,X4)),file('/tmp/SRASS.s.p', l27_l33)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))),file('/tmp/SRASS.s.p', l27_l30)).
% fof(6, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(10, axiom,![X1]:![X2]:![X3]:(check_cpq(triple(X1,X2,X3))<=>![X4]:![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))),file('/tmp/SRASS.s.p', l27_li4142)).
% fof(11, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(13, axiom,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),file('/tmp/SRASS.s.p', ax43)).
% fof(22, 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(34, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&less_than(lookup_slb(X2,X4),X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)),file('/tmp/SRASS.s.p', ax44)).
% fof(40, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&strictly_less_than(X4,lookup_slb(X2,X4)))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)),file('/tmp/SRASS.s.p', ax45)).
% fof(45, axiom,![X1]:![X2]:![X3]:(pair_in_list(X1,X2,X3)=>![X4]:(contains_slb(X1,X4)=>(pair_in_list(remove_slb(X1,X4),X2,X3)|X2=X4))),file('/tmp/SRASS.s.p', l27_li2829)).
% fof(46, conjecture,![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>check_cpq(triple(X1,X2,X3))),file('/tmp/SRASS.s.p', l27_co)).
% fof(47, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>check_cpq(triple(X1,X2,X3)))),inference(assume_negation,[status(cth)],[46])).
% fof(49, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(51, plain,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_simplification,[status(thm)],[13,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)],[22,theory(equality)])).
% fof(57, plain,![X1]:![X2]:![X3]:![X4]:(~(ok(remove_cpq(triple(X1,X2,X3),X4)))|contains_slb(X2,X4)),inference(fof_nnf,[status(thm)],[1])).
% fof(58, plain,![X5]:![X6]:![X7]:![X8]:(~(ok(remove_cpq(triple(X5,X6,X7),X8)))|contains_slb(X6,X8)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(contains_slb(X1,X2)|~ok(remove_cpq(triple(X3,X1,X4),X2))),inference(split_conjunct,[status(thm)],[58])).
% fof(62, plain,![X1]:![X2]:![X3]:![X4]:((~(check_cpq(remove_cpq(triple(X1,X2,X3),X4)))|~(ok(remove_cpq(triple(X1,X2,X3),X4))))|![X5]:(~(pair_in_list(X2,X4,X5))|less_than(X5,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(63, plain,![X6]:![X7]:![X8]:![X9]:((~(check_cpq(remove_cpq(triple(X6,X7,X8),X9)))|~(ok(remove_cpq(triple(X6,X7,X8),X9))))|![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|(~(check_cpq(remove_cpq(triple(X6,X7,X8),X9)))|~(ok(remove_cpq(triple(X6,X7,X8),X9))))),inference(shift_quantors,[status(thm)],[63])).
% cnf(65,plain,(less_than(X5,X4)|~ok(remove_cpq(triple(X1,X2,X3),X4))|~check_cpq(remove_cpq(triple(X1,X2,X3),X4))|~pair_in_list(X2,X4,X5)),inference(split_conjunct,[status(thm)],[64])).
% fof(72, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(73,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(81, plain,![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|![X4]:![X5]:(~(pair_in_list(X2,X4,X5))|less_than(X5,X4)))&(?[X4]:?[X5]:(pair_in_list(X2,X4,X5)&~(less_than(X5,X4)))|check_cpq(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[10])).
% fof(82, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&(?[X11]:?[X12]:(pair_in_list(X7,X11,X12)&~(less_than(X12,X11)))|check_cpq(triple(X6,X7,X8)))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(shift_quantors,[status(thm)],[83])).
% fof(85, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))|check_cpq(triple(X6,X7,X8)))&(~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8)))|check_cpq(triple(X6,X7,X8))))),inference(distribute,[status(thm)],[84])).
% cnf(86,plain,(check_cpq(triple(X1,X2,X3))|~less_than(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,plain,(check_cpq(triple(X1,X2,X3))|pair_in_list(X2,esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))),inference(split_conjunct,[status(thm)],[85])).
% cnf(88,plain,(less_than(X4,X5)|~check_cpq(triple(X1,X2,X3))|~pair_in_list(X2,X5,X4)),inference(split_conjunct,[status(thm)],[85])).
% fof(89, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[49])).
% cnf(90,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[89])).
% fof(94, plain,![X1]:![X2]:![X3]:![X4]:(contains_slb(X2,X4)|remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_nnf,[status(thm)],[51])).
% fof(95, plain,![X5]:![X6]:![X7]:![X8]:(contains_slb(X6,X8)|remove_cpq(triple(X5,X6,X7),X8)=triple(X5,X6,bad)),inference(variable_rename,[status(thm)],[94])).
% cnf(96,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[95])).
% fof(121, 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(122, 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)],[121])).
% fof(123, 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)],[122])).
% cnf(124,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[123])).
% fof(156, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(less_than(lookup_slb(X2,X4),X4)))|remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)),inference(fof_nnf,[status(thm)],[34])).
% fof(157, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X6,X8))|~(less_than(lookup_slb(X6,X8),X8)))|remove_cpq(triple(X5,X6,X7),X8)=triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7)),inference(variable_rename,[status(thm)],[156])).
% cnf(158,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)|~less_than(lookup_slb(X2,X4),X4)|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[157])).
% fof(175, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(strictly_less_than(X4,lookup_slb(X2,X4))))|remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)),inference(fof_nnf,[status(thm)],[40])).
% fof(176, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X6,X8))|~(strictly_less_than(X8,lookup_slb(X6,X8))))|remove_cpq(triple(X5,X6,X7),X8)=triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad)),inference(variable_rename,[status(thm)],[175])).
% cnf(177,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)|~strictly_less_than(X4,lookup_slb(X2,X4))|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[176])).
% fof(189, plain,![X1]:![X2]:![X3]:(~(pair_in_list(X1,X2,X3))|![X4]:(~(contains_slb(X1,X4))|(pair_in_list(remove_slb(X1,X4),X2,X3)|X2=X4))),inference(fof_nnf,[status(thm)],[45])).
% fof(190, plain,![X5]:![X6]:![X7]:(~(pair_in_list(X5,X6,X7))|![X8]:(~(contains_slb(X5,X8))|(pair_in_list(remove_slb(X5,X8),X6,X7)|X6=X8))),inference(variable_rename,[status(thm)],[189])).
% fof(191, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X5,X8))|(pair_in_list(remove_slb(X5,X8),X6,X7)|X6=X8))|~(pair_in_list(X5,X6,X7))),inference(shift_quantors,[status(thm)],[190])).
% cnf(192,plain,(X2=X4|pair_in_list(remove_slb(X1,X4),X2,X3)|~pair_in_list(X1,X2,X3)|~contains_slb(X1,X4)),inference(split_conjunct,[status(thm)],[191])).
% fof(193, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))&~(check_cpq(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[47])).
% fof(194, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((check_cpq(remove_cpq(triple(X5,X6,X7),X8))&ok(remove_cpq(triple(X5,X6,X7),X8)))&~(check_cpq(triple(X5,X6,X7)))),inference(variable_rename,[status(thm)],[193])).
% fof(195, negated_conjecture,((check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))&ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)))&~(check_cpq(triple(esk3_0,esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[194])).
% cnf(196,negated_conjecture,(~check_cpq(triple(esk3_0,esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[195])).
% cnf(197,negated_conjecture,(ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(split_conjunct,[status(thm)],[195])).
% cnf(198,negated_conjecture,(check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(split_conjunct,[status(thm)],[195])).
% cnf(200,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[124,73])).
% cnf(215,negated_conjecture,(ok(triple(esk3_0,esk4_0,bad))|contains_slb(esk4_0,esk6_0)),inference(spm,[status(thm)],[197,96,theory(equality)])).
% cnf(218,negated_conjecture,(contains_slb(esk4_0,esk6_0)),inference(sr,[status(thm)],[215,90,theory(equality)])).
% cnf(283,negated_conjecture,(less_than(X1,esk6_0)|~pair_in_list(esk4_0,esk6_0,X1)|~check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(spm,[status(thm)],[65,197,theory(equality)])).
% cnf(284,negated_conjecture,(less_than(X1,esk6_0)|~pair_in_list(esk4_0,esk6_0,X1)|$false),inference(rw,[status(thm)],[283,198,theory(equality)])).
% cnf(285,negated_conjecture,(less_than(X1,esk6_0)|~pair_in_list(esk4_0,esk6_0,X1)),inference(cn,[status(thm)],[284,theory(equality)])).
% cnf(295,plain,(less_than(X1,X2)|~pair_in_list(remove_slb(X3,X4),X2,X1)|~check_cpq(remove_cpq(triple(X5,X3,X6),X4))|~less_than(lookup_slb(X3,X4),X4)|~contains_slb(X3,X4)),inference(spm,[status(thm)],[88,158,theory(equality)])).
% cnf(324,plain,(~ok(remove_cpq(triple(X1,X3,X4),X2))|~strictly_less_than(X2,lookup_slb(X3,X2))|~contains_slb(X3,X2)),inference(spm,[status(thm)],[90,177,theory(equality)])).
% cnf(404,plain,(~strictly_less_than(X2,lookup_slb(X3,X2))|~ok(remove_cpq(triple(X1,X3,X4),X2))),inference(csr,[status(thm)],[324,59])).
% cnf(411,negated_conjecture,(~strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0))),inference(spm,[status(thm)],[404,197,theory(equality)])).
% cnf(412,negated_conjecture,(less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[411,200,theory(equality)])).
% cnf(2581,negated_conjecture,(less_than(X1,X2)|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)|~pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)|~contains_slb(esk4_0,esk6_0)),inference(spm,[status(thm)],[295,198,theory(equality)])).
% cnf(2582,negated_conjecture,(less_than(X1,X2)|$false|~pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)|~contains_slb(esk4_0,esk6_0)),inference(rw,[status(thm)],[2581,412,theory(equality)])).
% cnf(2583,negated_conjecture,(less_than(X1,X2)|$false|~pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)|$false),inference(rw,[status(thm)],[2582,218,theory(equality)])).
% cnf(2584,negated_conjecture,(less_than(X1,X2)|~pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)),inference(cn,[status(thm)],[2583,theory(equality)])).
% cnf(2588,negated_conjecture,(less_than(X1,X2)|X2=esk6_0|~pair_in_list(esk4_0,X2,X1)|~contains_slb(esk4_0,esk6_0)),inference(spm,[status(thm)],[2584,192,theory(equality)])).
% cnf(2589,negated_conjecture,(less_than(X1,X2)|X2=esk6_0|~pair_in_list(esk4_0,X2,X1)|$false),inference(rw,[status(thm)],[2588,218,theory(equality)])).
% cnf(2590,negated_conjecture,(less_than(X1,X2)|X2=esk6_0|~pair_in_list(esk4_0,X2,X1)),inference(cn,[status(thm)],[2589,theory(equality)])).
% cnf(2593,negated_conjecture,(esk1_3(X1,esk4_0,X2)=esk6_0|less_than(esk2_3(X1,esk4_0,X2),esk1_3(X1,esk4_0,X2))|check_cpq(triple(X1,esk4_0,X2))),inference(spm,[status(thm)],[2590,87,theory(equality)])).
% cnf(2594,negated_conjecture,(esk1_3(X1,esk4_0,X2)=esk6_0|check_cpq(triple(X1,esk4_0,X2))),inference(csr,[status(thm)],[2593,86])).
% cnf(2595,negated_conjecture,(check_cpq(triple(X1,esk4_0,X2))|~less_than(esk2_3(X1,esk4_0,X2),esk6_0)),inference(spm,[status(thm)],[86,2594,theory(equality)])).
% cnf(2602,negated_conjecture,(pair_in_list(esk4_0,esk6_0,esk2_3(X1,esk4_0,X2))|check_cpq(triple(X1,esk4_0,X2))),inference(spm,[status(thm)],[87,2594,theory(equality)])).
% cnf(2654,negated_conjecture,(less_than(esk2_3(X1,esk4_0,X2),esk6_0)|check_cpq(triple(X1,esk4_0,X2))),inference(spm,[status(thm)],[285,2602,theory(equality)])).
% cnf(2655,negated_conjecture,(check_cpq(triple(X1,esk4_0,X2))),inference(csr,[status(thm)],[2654,2595])).
% cnf(2663,negated_conjecture,($false),inference(rw,[status(thm)],[196,2655,theory(equality)])).
% cnf(2664,negated_conjecture,($false),inference(cn,[status(thm)],[2663,theory(equality)])).
% cnf(2665,negated_conjecture,($false),2664,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 489
% # ...of these trivial : 3
% # ...subsumed : 214
% # ...remaining for further processing: 272
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 1978
% # ...of the previous two non-trivial : 1756
% # Contextual simplify-reflections : 121
% # Paramodulations : 1895
% # Factorizations : 76
% # Equation resolutions : 3
% # Current number of processed clauses: 205
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 172
% # Current number of unprocessed clauses: 1346
% # ...number of literals in the above : 6668
% # Clause-clause subsumption calls (NU) : 5538
% # Rec. Clause-clause subsumption calls : 4168
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 187 leaves, 2.79+/-3.436 terms/leaf
% # Paramod-from index: 76 leaves, 1.66+/-1.610 terms/leaf
% # Paramod-into index: 165 leaves, 2.45+/-2.947 terms/leaf
% # -------------------------------------------------
% # User time : 0.126 s
% # System time : 0.011 s
% # Total time : 0.137 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.35 WC
% FINAL PrfWatch: 0.26 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP30364/SWV391+1.tptp
%
%------------------------------------------------------------------------------