TSTP Solution File: SET774+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET774+4 : TPTP v5.0.0. Released v2.2.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 : Thu Dec 30 00:05:35 EST 2010
% Result : Theorem 80.60s
% Output : Solution 81.23s
% 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/SystemOnTPTP23712/SET774+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thIII10:
% ---- 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 ... pre_order:
% CSA axiom pre_order found
% Looking for CSA axiom ... equal_set:
% CSA axiom equal_set found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :equal_set:pre_order:subset (3)
% Unselected axioms are ... :power_set:partition:singleton:unordered_pair:equivalence:equivalence_class:intersection:union:empty_set:difference:sum:product:disjoint (13)
% SZS status THM for /tmp/SystemOnTPTP23712/SET774+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP23712/SET774+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 24694
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X3]:![X4]:(pre_order(X3,X4)<=>(![X5]:(member(X5,X4)=>apply(X3,X5,X5))&![X5]:![X6]:![X7]:(((member(X5,X4)&member(X6,X4))&member(X7,X4))=>((apply(X3,X5,X6)&apply(X3,X6,X7))=>apply(X3,X5,X7))))),file('/tmp/SRASS.s.p', pre_order)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X5]:(member(X5,X1)=>member(X5,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(4, conjecture,![X4]:![X5]:![X3]:((pre_order(X3,X4)&subset(X5,X4))=>pre_order(X3,X5)),file('/tmp/SRASS.s.p', thIII10)).
% fof(5, negated_conjecture,~(![X4]:![X5]:![X3]:((pre_order(X3,X4)&subset(X5,X4))=>pre_order(X3,X5))),inference(assume_negation,[status(cth)],[4])).
% fof(12, plain,![X3]:![X4]:((~(pre_order(X3,X4))|(![X5]:(~(member(X5,X4))|apply(X3,X5,X5))&![X5]:![X6]:![X7]:(((~(member(X5,X4))|~(member(X6,X4)))|~(member(X7,X4)))|((~(apply(X3,X5,X6))|~(apply(X3,X6,X7)))|apply(X3,X5,X7)))))&((?[X5]:(member(X5,X4)&~(apply(X3,X5,X5)))|?[X5]:?[X6]:?[X7]:(((member(X5,X4)&member(X6,X4))&member(X7,X4))&((apply(X3,X5,X6)&apply(X3,X6,X7))&~(apply(X3,X5,X7)))))|pre_order(X3,X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X8]:![X9]:((~(pre_order(X8,X9))|(![X10]:(~(member(X10,X9))|apply(X8,X10,X10))&![X11]:![X12]:![X13]:(((~(member(X11,X9))|~(member(X12,X9)))|~(member(X13,X9)))|((~(apply(X8,X11,X12))|~(apply(X8,X12,X13)))|apply(X8,X11,X13)))))&((?[X14]:(member(X14,X9)&~(apply(X8,X14,X14)))|?[X15]:?[X16]:?[X17]:(((member(X15,X9)&member(X16,X9))&member(X17,X9))&((apply(X8,X15,X16)&apply(X8,X16,X17))&~(apply(X8,X15,X17)))))|pre_order(X8,X9))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X8]:![X9]:((~(pre_order(X8,X9))|(![X10]:(~(member(X10,X9))|apply(X8,X10,X10))&![X11]:![X12]:![X13]:(((~(member(X11,X9))|~(member(X12,X9)))|~(member(X13,X9)))|((~(apply(X8,X11,X12))|~(apply(X8,X12,X13)))|apply(X8,X11,X13)))))&(((member(esk1_2(X8,X9),X9)&~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|(((member(esk2_2(X8,X9),X9)&member(esk3_2(X8,X9),X9))&member(esk4_2(X8,X9),X9))&((apply(X8,esk2_2(X8,X9),esk3_2(X8,X9))&apply(X8,esk3_2(X8,X9),esk4_2(X8,X9)))&~(apply(X8,esk2_2(X8,X9),esk4_2(X8,X9))))))|pre_order(X8,X9))),inference(skolemize,[status(esa)],[13])).
% fof(15, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:((((((~(member(X11,X9))|~(member(X12,X9)))|~(member(X13,X9)))|((~(apply(X8,X11,X12))|~(apply(X8,X12,X13)))|apply(X8,X11,X13)))&(~(member(X10,X9))|apply(X8,X10,X10)))|~(pre_order(X8,X9)))&(((member(esk1_2(X8,X9),X9)&~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|(((member(esk2_2(X8,X9),X9)&member(esk3_2(X8,X9),X9))&member(esk4_2(X8,X9),X9))&((apply(X8,esk2_2(X8,X9),esk3_2(X8,X9))&apply(X8,esk3_2(X8,X9),esk4_2(X8,X9)))&~(apply(X8,esk2_2(X8,X9),esk4_2(X8,X9))))))|pre_order(X8,X9))),inference(shift_quantors,[status(thm)],[14])).
% fof(16, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:((((((~(member(X11,X9))|~(member(X12,X9)))|~(member(X13,X9)))|((~(apply(X8,X11,X12))|~(apply(X8,X12,X13)))|apply(X8,X11,X13)))|~(pre_order(X8,X9)))&((~(member(X10,X9))|apply(X8,X10,X10))|~(pre_order(X8,X9))))&((((((member(esk2_2(X8,X9),X9)|member(esk1_2(X8,X9),X9))|pre_order(X8,X9))&((member(esk3_2(X8,X9),X9)|member(esk1_2(X8,X9),X9))|pre_order(X8,X9)))&((member(esk4_2(X8,X9),X9)|member(esk1_2(X8,X9),X9))|pre_order(X8,X9)))&((((apply(X8,esk2_2(X8,X9),esk3_2(X8,X9))|member(esk1_2(X8,X9),X9))|pre_order(X8,X9))&((apply(X8,esk3_2(X8,X9),esk4_2(X8,X9))|member(esk1_2(X8,X9),X9))|pre_order(X8,X9)))&((~(apply(X8,esk2_2(X8,X9),esk4_2(X8,X9)))|member(esk1_2(X8,X9),X9))|pre_order(X8,X9))))&(((((member(esk2_2(X8,X9),X9)|~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|pre_order(X8,X9))&((member(esk3_2(X8,X9),X9)|~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|pre_order(X8,X9)))&((member(esk4_2(X8,X9),X9)|~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|pre_order(X8,X9)))&((((apply(X8,esk2_2(X8,X9),esk3_2(X8,X9))|~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|pre_order(X8,X9))&((apply(X8,esk3_2(X8,X9),esk4_2(X8,X9))|~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|pre_order(X8,X9)))&((~(apply(X8,esk2_2(X8,X9),esk4_2(X8,X9)))|~(apply(X8,esk1_2(X8,X9),esk1_2(X8,X9))))|pre_order(X8,X9)))))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(pre_order(X1,X2)|~apply(X1,esk1_2(X1,X2),esk1_2(X1,X2))|~apply(X1,esk2_2(X1,X2),esk4_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(pre_order(X1,X2)|apply(X1,esk3_2(X1,X2),esk4_2(X1,X2))|~apply(X1,esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(pre_order(X1,X2)|apply(X1,esk2_2(X1,X2),esk3_2(X1,X2))|~apply(X1,esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(20,plain,(pre_order(X1,X2)|member(esk4_2(X1,X2),X2)|~apply(X1,esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(21,plain,(pre_order(X1,X2)|member(esk3_2(X1,X2),X2)|~apply(X1,esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(22,plain,(pre_order(X1,X2)|member(esk2_2(X1,X2),X2)|~apply(X1,esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(23,plain,(pre_order(X1,X2)|member(esk1_2(X1,X2),X2)|~apply(X1,esk2_2(X1,X2),esk4_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(24,plain,(pre_order(X1,X2)|member(esk1_2(X1,X2),X2)|apply(X1,esk3_2(X1,X2),esk4_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(25,plain,(pre_order(X1,X2)|member(esk1_2(X1,X2),X2)|apply(X1,esk2_2(X1,X2),esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% cnf(26,plain,(pre_order(X1,X2)|member(esk1_2(X1,X2),X2)|member(esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(27,plain,(pre_order(X1,X2)|member(esk1_2(X1,X2),X2)|member(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(28,plain,(pre_order(X1,X2)|member(esk1_2(X1,X2),X2)|member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(29,plain,(apply(X1,X3,X3)|~pre_order(X1,X2)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(30,plain,(apply(X1,X3,X4)|~pre_order(X1,X2)|~apply(X1,X5,X4)|~apply(X1,X3,X5)|~member(X4,X2)|~member(X5,X2)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(31, plain,![X1]:![X2]:((~(subset(X1,X2))|![X5]:(~(member(X5,X1))|member(X5,X2)))&(?[X5]:(member(X5,X1)&~(member(X5,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,![X6]:![X7]:((~(subset(X6,X7))|![X8]:(~(member(X8,X6))|member(X8,X7)))&(?[X9]:(member(X9,X6)&~(member(X9,X7)))|subset(X6,X7))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X6]:![X7]:((~(subset(X6,X7))|![X8]:(~(member(X8,X6))|member(X8,X7)))&((member(esk5_2(X6,X7),X6)&~(member(esk5_2(X6,X7),X7)))|subset(X6,X7))),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,![X6]:![X7]:![X8]:(((~(member(X8,X6))|member(X8,X7))|~(subset(X6,X7)))&((member(esk5_2(X6,X7),X6)&~(member(esk5_2(X6,X7),X7)))|subset(X6,X7))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, plain,![X6]:![X7]:![X8]:(((~(member(X8,X6))|member(X8,X7))|~(subset(X6,X7)))&((member(esk5_2(X6,X7),X6)|subset(X6,X7))&(~(member(esk5_2(X6,X7),X7))|subset(X6,X7)))),inference(distribute,[status(thm)],[34])).
% cnf(38,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(39, negated_conjecture,?[X4]:?[X5]:?[X3]:((pre_order(X3,X4)&subset(X5,X4))&~(pre_order(X3,X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(40, negated_conjecture,?[X6]:?[X7]:?[X8]:((pre_order(X8,X6)&subset(X7,X6))&~(pre_order(X8,X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, negated_conjecture,((pre_order(esk8_0,esk6_0)&subset(esk7_0,esk6_0))&~(pre_order(esk8_0,esk7_0))),inference(skolemize,[status(esa)],[40])).
% cnf(42,negated_conjecture,(~pre_order(esk8_0,esk7_0)),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,negated_conjecture,(subset(esk7_0,esk6_0)),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,negated_conjecture,(pre_order(esk8_0,esk6_0)),inference(split_conjunct,[status(thm)],[41])).
% cnf(48,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk7_0)),inference(spm,[status(thm)],[38,43,theory(equality)])).
% cnf(53,plain,(apply(X1,X2,esk4_2(X1,X3))|member(esk1_2(X1,X3),X3)|pre_order(X1,X3)|~apply(X1,X2,esk3_2(X1,X3))|~member(esk3_2(X1,X3),X4)|~member(esk4_2(X1,X3),X4)|~member(X2,X4)|~pre_order(X1,X4)),inference(spm,[status(thm)],[30,24,theory(equality)])).
% cnf(54,plain,(apply(X1,X2,esk4_2(X1,X3))|pre_order(X1,X3)|~apply(X1,X2,esk3_2(X1,X3))|~member(esk3_2(X1,X3),X4)|~member(esk4_2(X1,X3),X4)|~member(X2,X4)|~pre_order(X1,X4)|~apply(X1,esk1_2(X1,X3),esk1_2(X1,X3))),inference(spm,[status(thm)],[30,18,theory(equality)])).
% cnf(59,negated_conjecture,(member(esk4_2(X1,esk7_0),esk6_0)|member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)),inference(spm,[status(thm)],[48,26,theory(equality)])).
% cnf(60,negated_conjecture,(member(esk3_2(X1,esk7_0),esk6_0)|member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)),inference(spm,[status(thm)],[48,27,theory(equality)])).
% cnf(61,negated_conjecture,(member(esk2_2(X1,esk7_0),esk6_0)|member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)),inference(spm,[status(thm)],[48,28,theory(equality)])).
% cnf(76,negated_conjecture,(apply(X1,X2,esk4_2(X1,esk7_0))|member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~apply(X1,X2,esk3_2(X1,esk7_0))|~member(esk3_2(X1,esk7_0),esk6_0)|~member(X2,esk6_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[53,59,theory(equality)])).
% cnf(78,negated_conjecture,(apply(X1,X2,esk4_2(X1,esk7_0))|member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~apply(X1,X2,esk3_2(X1,esk7_0))|~member(X2,esk6_0)|~pre_order(X1,esk6_0)),inference(csr,[status(thm)],[76,60])).
% cnf(79,negated_conjecture,(member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~apply(X1,esk2_2(X1,esk7_0),esk3_2(X1,esk7_0))|~member(esk2_2(X1,esk7_0),esk6_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[23,78,theory(equality)])).
% cnf(82,negated_conjecture,(member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~apply(X1,esk2_2(X1,esk7_0),esk3_2(X1,esk7_0))|~pre_order(X1,esk6_0)),inference(csr,[status(thm)],[79,61])).
% cnf(83,negated_conjecture,(member(esk1_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(csr,[status(thm)],[82,25])).
% cnf(85,negated_conjecture,(member(esk1_2(X1,esk7_0),esk6_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[48,83,theory(equality)])).
% cnf(86,negated_conjecture,(apply(X1,esk1_2(X2,esk7_0),esk1_2(X2,esk7_0))|pre_order(X2,esk7_0)|~pre_order(X1,esk6_0)|~pre_order(X2,esk6_0)),inference(spm,[status(thm)],[29,85,theory(equality)])).
% cnf(92,negated_conjecture,(member(esk2_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[22,86,theory(equality)])).
% cnf(93,negated_conjecture,(member(esk3_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[21,86,theory(equality)])).
% cnf(94,negated_conjecture,(member(esk4_2(X1,esk7_0),esk7_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[20,86,theory(equality)])).
% cnf(96,negated_conjecture,(member(esk2_2(X1,esk7_0),esk6_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[48,92,theory(equality)])).
% cnf(97,negated_conjecture,(apply(X1,X2,esk4_2(X1,esk7_0))|pre_order(X1,esk7_0)|~apply(X1,X2,esk3_2(X1,esk7_0))|~member(esk3_2(X1,esk7_0),X3)|~member(esk4_2(X1,esk7_0),X3)|~member(X2,X3)|~pre_order(X1,X3)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[54,86,theory(equality)])).
% cnf(100,negated_conjecture,(member(esk3_2(X1,esk7_0),esk6_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[48,93,theory(equality)])).
% cnf(102,negated_conjecture,(member(esk4_2(X1,esk7_0),esk6_0)|pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[48,94,theory(equality)])).
% cnf(132,negated_conjecture,(apply(X1,X2,esk4_2(X1,esk7_0))|pre_order(X1,esk7_0)|~apply(X1,X2,esk3_2(X1,esk7_0))|~member(esk3_2(X1,esk7_0),esk6_0)|~member(X2,esk6_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[97,102,theory(equality)])).
% cnf(134,negated_conjecture,(apply(X1,X2,esk4_2(X1,esk7_0))|pre_order(X1,esk7_0)|~apply(X1,X2,esk3_2(X1,esk7_0))|~member(X2,esk6_0)|~pre_order(X1,esk6_0)),inference(csr,[status(thm)],[132,100])).
% cnf(136,negated_conjecture,(pre_order(X1,esk7_0)|~apply(X1,esk1_2(X1,esk7_0),esk1_2(X1,esk7_0))|~apply(X1,esk2_2(X1,esk7_0),esk3_2(X1,esk7_0))|~member(esk2_2(X1,esk7_0),esk6_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[17,134,theory(equality)])).
% cnf(142,negated_conjecture,(pre_order(X1,esk7_0)|~apply(X1,esk1_2(X1,esk7_0),esk1_2(X1,esk7_0))|~apply(X1,esk2_2(X1,esk7_0),esk3_2(X1,esk7_0))|~pre_order(X1,esk6_0)),inference(csr,[status(thm)],[136,96])).
% cnf(143,negated_conjecture,(pre_order(X1,esk7_0)|~apply(X1,esk1_2(X1,esk7_0),esk1_2(X1,esk7_0))|~pre_order(X1,esk6_0)),inference(csr,[status(thm)],[142,19])).
% cnf(144,negated_conjecture,(pre_order(X1,esk7_0)|~pre_order(X1,esk6_0)),inference(spm,[status(thm)],[143,86,theory(equality)])).
% cnf(146,negated_conjecture,(~pre_order(esk8_0,esk6_0)),inference(spm,[status(thm)],[42,144,theory(equality)])).
% cnf(147,negated_conjecture,($false),inference(rw,[status(thm)],[146,44,theory(equality)])).
% cnf(148,negated_conjecture,($false),inference(cn,[status(thm)],[147,theory(equality)])).
% cnf(149,negated_conjecture,($false),148,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 66
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 62
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 0
% # Generated clauses : 81
% # ...of the previous two non-trivial : 48
% # Contextual simplify-reflections : 20
% # Paramodulations : 81
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 42
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 216
% # Rec. Clause-clause subsumption calls : 77
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 46 leaves, 2.04+/-1.429 terms/leaf
% # Paramod-from index: 21 leaves, 1.10+/-0.294 terms/leaf
% # Paramod-into index: 38 leaves, 1.53+/-0.638 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP23712/SET774+4.tptp
%
%------------------------------------------------------------------------------