TSTP Solution File: SET754+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET754+4 : TPTP v5.0.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 23:56:59 EST 2010
% Result : Theorem 95.62s
% Output : Solution 96.18s
% 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/SystemOnTPTP18534/SET754+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thIIa04:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... subset:
% CSA axiom subset found
% Looking for CSA axiom ... image2:
% CSA axiom image2 found
% Looking for CSA axiom ... inverse_image2:
% CSA axiom inverse_image2 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... equal_set:
% CSA axiom equal_set found
% Looking for CSA axiom ... power_set:
% CSA axiom power_set found
% Looking for CSA axiom ... maps:
% CSA axiom maps found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :maps:power_set:equal_set:inverse_image2:image2:subset (6)
% Unselected axioms are ... :equal_maps:injective:isomorphism:singleton:unordered_pair:compose_predicate:compose_function:identity:surjective:one_to_one:inverse_predicate:inverse_function:image3:inverse_image3:increasing_function:decreasing_function:intersection:union:empty_set:difference:sum:product (22)
% SZS status THM for /tmp/SystemOnTPTP18534/SET754+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP18534/SET754+4.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 19870
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(maps(X1,X2,X3)<=>(![X4]:(member(X4,X2)=>?[X5]:(member(X5,X3)&apply(X1,X4,X5)))&![X4]:![X6]:![X7]:(((member(X4,X2)&member(X6,X3))&member(X7,X3))=>((apply(X1,X4,X6)&apply(X1,X4,X7))=>X6=X7)))),file('/tmp/SRASS.s.p', maps)).
% fof(4, axiom,![X1]:![X3]:![X4]:(member(X4,inverse_image2(X1,X3))<=>?[X5]:(member(X5,X3)&apply(X1,X4,X5))),file('/tmp/SRASS.s.p', inverse_image2)).
% fof(5, axiom,![X1]:![X2]:![X5]:(member(X5,image2(X1,X2))<=>?[X4]:(member(X4,X2)&apply(X1,X4,X5))),file('/tmp/SRASS.s.p', image2)).
% fof(6, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X4]:(member(X4,X2)=>member(X4,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(7, conjecture,![X1]:![X2]:![X3]:![X8]:((maps(X1,X2,X3)&subset(X8,X2))=>subset(X8,inverse_image2(X1,image2(X1,X8)))),file('/tmp/SRASS.s.p', thIIa04)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:![X8]:((maps(X1,X2,X3)&subset(X8,X2))=>subset(X8,inverse_image2(X1,image2(X1,X8))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:![X3]:((~(maps(X1,X2,X3))|(![X4]:(~(member(X4,X2))|?[X5]:(member(X5,X3)&apply(X1,X4,X5)))&![X4]:![X6]:![X7]:(((~(member(X4,X2))|~(member(X6,X3)))|~(member(X7,X3)))|((~(apply(X1,X4,X6))|~(apply(X1,X4,X7)))|X6=X7))))&((?[X4]:(member(X4,X2)&![X5]:(~(member(X5,X3))|~(apply(X1,X4,X5))))|?[X4]:?[X6]:?[X7]:(((member(X4,X2)&member(X6,X3))&member(X7,X3))&((apply(X1,X4,X6)&apply(X1,X4,X7))&~(X6=X7))))|maps(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,![X8]:![X9]:![X10]:((~(maps(X8,X9,X10))|(![X11]:(~(member(X11,X9))|?[X12]:(member(X12,X10)&apply(X8,X11,X12)))&![X13]:![X14]:![X15]:(((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))))&((?[X16]:(member(X16,X9)&![X17]:(~(member(X17,X10))|~(apply(X8,X16,X17))))|?[X18]:?[X19]:?[X20]:(((member(X18,X9)&member(X19,X10))&member(X20,X10))&((apply(X8,X18,X19)&apply(X8,X18,X20))&~(X19=X20))))|maps(X8,X9,X10))),inference(variable_rename,[status(thm)],[9])).
% fof(11, plain,![X8]:![X9]:![X10]:((~(maps(X8,X9,X10))|(![X11]:(~(member(X11,X9))|(member(esk1_4(X8,X9,X10,X11),X10)&apply(X8,X11,esk1_4(X8,X9,X10,X11))))&![X13]:![X14]:![X15]:(((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))))&(((member(esk2_3(X8,X9,X10),X9)&![X17]:(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|(((member(esk3_3(X8,X9,X10),X9)&member(esk4_3(X8,X9,X10),X10))&member(esk5_3(X8,X9,X10),X10))&((apply(X8,esk3_3(X8,X9,X10),esk4_3(X8,X9,X10))&apply(X8,esk3_3(X8,X9,X10),esk5_3(X8,X9,X10)))&~(esk4_3(X8,X9,X10)=esk5_3(X8,X9,X10)))))|maps(X8,X9,X10))),inference(skolemize,[status(esa)],[10])).
% fof(12, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:![X15]:![X17]:(((((~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17)))&member(esk2_3(X8,X9,X10),X9))|(((member(esk3_3(X8,X9,X10),X9)&member(esk4_3(X8,X9,X10),X10))&member(esk5_3(X8,X9,X10),X10))&((apply(X8,esk3_3(X8,X9,X10),esk4_3(X8,X9,X10))&apply(X8,esk3_3(X8,X9,X10),esk5_3(X8,X9,X10)))&~(esk4_3(X8,X9,X10)=esk5_3(X8,X9,X10)))))|maps(X8,X9,X10))&(((((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))&(~(member(X11,X9))|(member(esk1_4(X8,X9,X10,X11),X10)&apply(X8,X11,esk1_4(X8,X9,X10,X11)))))|~(maps(X8,X9,X10)))),inference(shift_quantors,[status(thm)],[11])).
% fof(13, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:![X15]:![X17]:(((((((member(esk3_3(X8,X9,X10),X9)|(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|maps(X8,X9,X10))&((member(esk4_3(X8,X9,X10),X10)|(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|maps(X8,X9,X10)))&((member(esk5_3(X8,X9,X10),X10)|(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|maps(X8,X9,X10)))&((((apply(X8,esk3_3(X8,X9,X10),esk4_3(X8,X9,X10))|(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|maps(X8,X9,X10))&((apply(X8,esk3_3(X8,X9,X10),esk5_3(X8,X9,X10))|(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|maps(X8,X9,X10)))&((~(esk4_3(X8,X9,X10)=esk5_3(X8,X9,X10))|(~(member(X17,X10))|~(apply(X8,esk2_3(X8,X9,X10),X17))))|maps(X8,X9,X10))))&(((((member(esk3_3(X8,X9,X10),X9)|member(esk2_3(X8,X9,X10),X9))|maps(X8,X9,X10))&((member(esk4_3(X8,X9,X10),X10)|member(esk2_3(X8,X9,X10),X9))|maps(X8,X9,X10)))&((member(esk5_3(X8,X9,X10),X10)|member(esk2_3(X8,X9,X10),X9))|maps(X8,X9,X10)))&((((apply(X8,esk3_3(X8,X9,X10),esk4_3(X8,X9,X10))|member(esk2_3(X8,X9,X10),X9))|maps(X8,X9,X10))&((apply(X8,esk3_3(X8,X9,X10),esk5_3(X8,X9,X10))|member(esk2_3(X8,X9,X10),X9))|maps(X8,X9,X10)))&((~(esk4_3(X8,X9,X10)=esk5_3(X8,X9,X10))|member(esk2_3(X8,X9,X10),X9))|maps(X8,X9,X10)))))&(((((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))|~(maps(X8,X9,X10)))&(((member(esk1_4(X8,X9,X10,X11),X10)|~(member(X11,X9)))|~(maps(X8,X9,X10)))&((apply(X8,X11,esk1_4(X8,X9,X10,X11))|~(member(X11,X9)))|~(maps(X8,X9,X10)))))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(apply(X1,X4,esk1_4(X1,X2,X3,X4))|~maps(X1,X2,X3)|~member(X4,X2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(member(esk1_4(X1,X2,X3,X4),X3)|~maps(X1,X2,X3)|~member(X4,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(39, plain,![X1]:![X3]:![X4]:((~(member(X4,inverse_image2(X1,X3)))|?[X5]:(member(X5,X3)&apply(X1,X4,X5)))&(![X5]:(~(member(X5,X3))|~(apply(X1,X4,X5)))|member(X4,inverse_image2(X1,X3)))),inference(fof_nnf,[status(thm)],[4])).
% fof(40, plain,![X6]:![X7]:![X8]:((~(member(X8,inverse_image2(X6,X7)))|?[X9]:(member(X9,X7)&apply(X6,X8,X9)))&(![X10]:(~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:![X8]:((~(member(X8,inverse_image2(X6,X7)))|(member(esk6_3(X6,X7,X8),X7)&apply(X6,X8,esk6_3(X6,X7,X8))))&(![X10]:(~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))&(~(member(X8,inverse_image2(X6,X7)))|(member(esk6_3(X6,X7,X8),X7)&apply(X6,X8,esk6_3(X6,X7,X8))))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))&((member(esk6_3(X6,X7,X8),X7)|~(member(X8,inverse_image2(X6,X7))))&(apply(X6,X8,esk6_3(X6,X7,X8))|~(member(X8,inverse_image2(X6,X7)))))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(apply(X2,X1,esk6_3(X2,X3,X1))|~member(X1,inverse_image2(X2,X3))),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(member(X1,inverse_image2(X2,X3))|~apply(X2,X1,X4)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(47, plain,![X1]:![X2]:![X5]:((~(member(X5,image2(X1,X2)))|?[X4]:(member(X4,X2)&apply(X1,X4,X5)))&(![X4]:(~(member(X4,X2))|~(apply(X1,X4,X5)))|member(X5,image2(X1,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(48, plain,![X6]:![X7]:![X8]:((~(member(X8,image2(X6,X7)))|?[X9]:(member(X9,X7)&apply(X6,X9,X8)))&(![X10]:(~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X6]:![X7]:![X8]:((~(member(X8,image2(X6,X7)))|(member(esk7_3(X6,X7,X8),X7)&apply(X6,esk7_3(X6,X7,X8),X8)))&(![X10]:(~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))),inference(skolemize,[status(esa)],[48])).
% fof(50, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))&(~(member(X8,image2(X6,X7)))|(member(esk7_3(X6,X7,X8),X7)&apply(X6,esk7_3(X6,X7,X8),X8)))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))&((member(esk7_3(X6,X7,X8),X7)|~(member(X8,image2(X6,X7))))&(apply(X6,esk7_3(X6,X7,X8),X8)|~(member(X8,image2(X6,X7)))))),inference(distribute,[status(thm)],[50])).
% cnf(54,plain,(member(X1,image2(X2,X3))|~apply(X2,X4,X1)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[51])).
% fof(55, plain,![X2]:![X3]:((~(subset(X2,X3))|![X4]:(~(member(X4,X2))|member(X4,X3)))&(?[X4]:(member(X4,X2)&~(member(X4,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(56, plain,![X5]:![X6]:((~(subset(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&(?[X8]:(member(X8,X5)&~(member(X8,X6)))|subset(X5,X6))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X5]:![X6]:((~(subset(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&((member(esk8_2(X5,X6),X5)&~(member(esk8_2(X5,X6),X6)))|subset(X5,X6))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X5]:![X6]:![X7]:(((~(member(X7,X5))|member(X7,X6))|~(subset(X5,X6)))&((member(esk8_2(X5,X6),X5)&~(member(esk8_2(X5,X6),X6)))|subset(X5,X6))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,![X5]:![X6]:![X7]:(((~(member(X7,X5))|member(X7,X6))|~(subset(X5,X6)))&((member(esk8_2(X5,X6),X5)|subset(X5,X6))&(~(member(esk8_2(X5,X6),X6))|subset(X5,X6)))),inference(distribute,[status(thm)],[58])).
% cnf(60,plain,(subset(X1,X2)|~member(esk8_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(subset(X1,X2)|member(esk8_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[59])).
% cnf(62,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(63, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X8]:((maps(X1,X2,X3)&subset(X8,X2))&~(subset(X8,inverse_image2(X1,image2(X1,X8))))),inference(fof_nnf,[status(thm)],[8])).
% fof(64, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:((maps(X9,X10,X11)&subset(X12,X10))&~(subset(X12,inverse_image2(X9,image2(X9,X12))))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,((maps(esk9_0,esk10_0,esk11_0)&subset(esk12_0,esk10_0))&~(subset(esk12_0,inverse_image2(esk9_0,image2(esk9_0,esk12_0))))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~subset(esk12_0,inverse_image2(esk9_0,image2(esk9_0,esk12_0)))),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(subset(esk12_0,esk10_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(maps(esk9_0,esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(75,negated_conjecture,(member(X1,esk10_0)|~member(X1,esk12_0)),inference(spm,[status(thm)],[62,67,theory(equality)])).
% cnf(80,plain,(member(X1,inverse_image2(X2,X3))|~member(esk6_3(X2,X4,X1),X3)|~member(X1,inverse_image2(X2,X4))),inference(spm,[status(thm)],[46,44,theory(equality)])).
% cnf(82,plain,(member(esk6_3(X1,X2,X3),image2(X1,X4))|~member(X3,X4)|~member(X3,inverse_image2(X1,X2))),inference(spm,[status(thm)],[54,44,theory(equality)])).
% cnf(83,plain,(member(X1,inverse_image2(X2,X3))|~member(esk1_4(X2,X4,X5,X1),X3)|~member(X1,X4)|~maps(X2,X4,X5)),inference(spm,[status(thm)],[46,14,theory(equality)])).
% cnf(160,plain,(member(X1,inverse_image2(X2,image2(X2,X3)))|~member(X1,inverse_image2(X2,X4))|~member(X1,X3)),inference(spm,[status(thm)],[80,82,theory(equality)])).
% cnf(165,plain,(member(X1,inverse_image2(X2,X3))|~member(X1,X4)|~maps(X2,X4,X3)),inference(spm,[status(thm)],[83,15,theory(equality)])).
% cnf(166,negated_conjecture,(member(X1,inverse_image2(esk9_0,esk11_0))|~member(X1,esk10_0)),inference(spm,[status(thm)],[165,68,theory(equality)])).
% cnf(167,negated_conjecture,(subset(X1,inverse_image2(esk9_0,esk11_0))|~member(esk8_2(X1,inverse_image2(esk9_0,esk11_0)),esk10_0)),inference(spm,[status(thm)],[60,166,theory(equality)])).
% cnf(171,negated_conjecture,(subset(X1,inverse_image2(esk9_0,esk11_0))|~member(esk8_2(X1,inverse_image2(esk9_0,esk11_0)),esk12_0)),inference(spm,[status(thm)],[167,75,theory(equality)])).
% cnf(174,negated_conjecture,(subset(esk12_0,inverse_image2(esk9_0,esk11_0))),inference(spm,[status(thm)],[171,61,theory(equality)])).
% cnf(175,negated_conjecture,(member(X1,inverse_image2(esk9_0,esk11_0))|~member(X1,esk12_0)),inference(spm,[status(thm)],[62,174,theory(equality)])).
% cnf(193,negated_conjecture,(member(X1,inverse_image2(esk9_0,image2(esk9_0,X2)))|~member(X1,X2)|~member(X1,esk12_0)),inference(spm,[status(thm)],[160,175,theory(equality)])).
% cnf(200,negated_conjecture,(subset(X1,inverse_image2(esk9_0,image2(esk9_0,X2)))|~member(esk8_2(X1,inverse_image2(esk9_0,image2(esk9_0,X2))),esk12_0)|~member(esk8_2(X1,inverse_image2(esk9_0,image2(esk9_0,X2))),X2)),inference(spm,[status(thm)],[60,193,theory(equality)])).
% cnf(6145,negated_conjecture,(subset(esk12_0,inverse_image2(esk9_0,image2(esk9_0,X1)))|~member(esk8_2(esk12_0,inverse_image2(esk9_0,image2(esk9_0,X1))),X1)),inference(spm,[status(thm)],[200,61,theory(equality)])).
% cnf(6204,negated_conjecture,(subset(esk12_0,inverse_image2(esk9_0,image2(esk9_0,esk12_0)))),inference(spm,[status(thm)],[6145,61,theory(equality)])).
% cnf(6208,negated_conjecture,($false),inference(sr,[status(thm)],[6204,66,theory(equality)])).
% cnf(6209,negated_conjecture,($false),6208,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 741
% # ...of these trivial : 2
% # ...subsumed : 198
% # ...remaining for further processing: 541
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 6091
% # ...of the previous two non-trivial : 6051
% # Contextual simplify-reflections : 15
% # Paramodulations : 6091
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 509
% # Positive orientable unit clauses: 53
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 455
% # Current number of unprocessed clauses: 5374
% # ...number of literals in the above : 21611
% # Clause-clause subsumption calls (NU) : 4284
% # Rec. Clause-clause subsumption calls : 3722
% # Unit Clause-clause subsumption calls : 76
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 95
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 457 leaves, 2.37+/-2.653 terms/leaf
% # Paramod-from index: 162 leaves, 1.63+/-1.431 terms/leaf
% # Paramod-into index: 401 leaves, 2.01+/-1.886 terms/leaf
% # -------------------------------------------------
% # User time : 0.309 s
% # System time : 0.012 s
% # Total time : 0.321 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.51 CPU 0.60 WC
% FINAL PrfWatch: 0.51 CPU 0.60 WC
% SZS output end Solution for /tmp/SystemOnTPTP18534/SET754+4.tptp
%
%------------------------------------------------------------------------------