TSTP Solution File: SYN415+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN415+1 : TPTP v5.0.0. Released v2.0.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 09:30:38 EST 2010
% Result : Theorem 1.21s
% Output : Solution 1.21s
% 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/SystemOnTPTP7209/SYN415+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7209/SYN415+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7209/SYN415+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 7305
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,((?[X1]:f(X1)&![X2]:![X3]:((f(X2)&f(X3))=>X2=X3))<=>?[X4]:(f(X4)&![X5]:(f(X5)=>X4=X5))),file('/tmp/SRASS.s.p', kalish317)).
% fof(2, negated_conjecture,~(((?[X1]:f(X1)&![X2]:![X3]:((f(X2)&f(X3))=>X2=X3))<=>?[X4]:(f(X4)&![X5]:(f(X5)=>X4=X5)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(((![X1]:~(f(X1))|?[X2]:?[X3]:((f(X2)&f(X3))&~(X2=X3)))|![X4]:(~(f(X4))|?[X5]:(f(X5)&~(X4=X5))))&((?[X1]:f(X1)&![X2]:![X3]:((~(f(X2))|~(f(X3)))|X2=X3))|?[X4]:(f(X4)&![X5]:(~(f(X5))|X4=X5)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(((![X6]:~(f(X6))|?[X7]:?[X8]:((f(X7)&f(X8))&~(X7=X8)))|![X9]:(~(f(X9))|?[X10]:(f(X10)&~(X9=X10))))&((?[X11]:f(X11)&![X12]:![X13]:((~(f(X12))|~(f(X13)))|X12=X13))|?[X14]:(f(X14)&![X15]:(~(f(X15))|X14=X15)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(((![X6]:~(f(X6))|((f(esk1_0)&f(esk2_0))&~(esk1_0=esk2_0)))|![X9]:(~(f(X9))|(f(esk3_1(X9))&~(X9=esk3_1(X9)))))&((f(esk4_0)&![X12]:![X13]:((~(f(X12))|~(f(X13)))|X12=X13))|(f(esk5_0)&![X15]:(~(f(X15))|esk5_0=X15)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X6]:![X9]:![X12]:![X13]:![X15]:((((~(f(X15))|esk5_0=X15)&f(esk5_0))|(((~(f(X12))|~(f(X13)))|X12=X13)&f(esk4_0)))&((~(f(X9))|(f(esk3_1(X9))&~(X9=esk3_1(X9))))|(~(f(X6))|((f(esk1_0)&f(esk2_0))&~(esk1_0=esk2_0))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X6]:![X9]:![X12]:![X13]:![X15]:((((((~(f(X12))|~(f(X13)))|X12=X13)|(~(f(X15))|esk5_0=X15))&(f(esk4_0)|(~(f(X15))|esk5_0=X15)))&((((~(f(X12))|~(f(X13)))|X12=X13)|f(esk5_0))&(f(esk4_0)|f(esk5_0))))&(((((f(esk1_0)|~(f(X6)))|(f(esk3_1(X9))|~(f(X9))))&((f(esk2_0)|~(f(X6)))|(f(esk3_1(X9))|~(f(X9)))))&((~(esk1_0=esk2_0)|~(f(X6)))|(f(esk3_1(X9))|~(f(X9)))))&((((f(esk1_0)|~(f(X6)))|(~(X9=esk3_1(X9))|~(f(X9))))&((f(esk2_0)|~(f(X6)))|(~(X9=esk3_1(X9))|~(f(X9)))))&((~(esk1_0=esk2_0)|~(f(X6)))|(~(X9=esk3_1(X9))|~(f(X9))))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~f(X1)|X1!=esk3_1(X1)|~f(X2)|esk1_0!=esk2_0),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(f(esk2_0)|~f(X1)|X1!=esk3_1(X1)|~f(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(f(esk1_0)|~f(X1)|X1!=esk3_1(X1)|~f(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(f(esk3_1(X1))|~f(X1)|~f(X2)|esk1_0!=esk2_0),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(f(esk3_1(X1))|f(esk2_0)|~f(X1)|~f(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,(f(esk3_1(X1))|f(esk1_0)|~f(X1)|~f(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(14,negated_conjecture,(f(esk5_0)|f(esk4_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(15,negated_conjecture,(f(esk5_0)|X1=X2|~f(X2)|~f(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(16,negated_conjecture,(esk5_0=X1|f(esk4_0)|~f(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(17,negated_conjecture,(esk5_0=X1|X2=X3|~f(X1)|~f(X3)|~f(X2)),inference(split_conjunct,[status(thm)],[7])).
% fof(18, plain,(~(epred1_0)<=>![X1]:((~(esk3_1(X1)=X1)|~(esk2_0=esk1_0))|~(f(X1)))),introduced(definition),['split']).
% cnf(19,plain,(epred1_0|~f(X1)|esk3_1(X1)!=X1|esk2_0!=esk1_0),inference(split_equiv,[status(thm)],[18])).
% fof(20, plain,(~(epred2_0)<=>![X2]:~(f(X2))),introduced(definition),['split']).
% cnf(21,plain,(epred2_0|~f(X2)),inference(split_equiv,[status(thm)],[20])).
% cnf(22,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[8,18,theory(equality)]),20,theory(equality)]),['split']).
% cnf(23,negated_conjecture,(epred2_0|f(esk5_0)),inference(spm,[status(thm)],[21,14,theory(equality)])).
% cnf(30,negated_conjecture,(esk4_0=X1|f(esk5_0)|~f(X1)),inference(spm,[status(thm)],[15,14,theory(equality)])).
% cnf(34,negated_conjecture,(f(esk1_0)|f(esk5_0)|X3!=X1|~f(X2)|~f(X1)|~f(esk3_1(X1))|~f(X3)),inference(spm,[status(thm)],[10,15,theory(equality)])).
% cnf(36,negated_conjecture,(f(esk1_0)|f(esk5_0)|~f(X1)|~f(X2)|~f(esk3_1(X2))),inference(er,[status(thm)],[34,theory(equality)])).
% cnf(38,negated_conjecture,(f(esk2_0)|f(esk5_0)|X3!=X1|~f(X2)|~f(X1)|~f(esk3_1(X1))|~f(X3)),inference(spm,[status(thm)],[9,15,theory(equality)])).
% cnf(40,negated_conjecture,(f(esk2_0)|f(esk5_0)|~f(X1)|~f(X2)|~f(esk3_1(X2))),inference(er,[status(thm)],[38,theory(equality)])).
% cnf(42,negated_conjecture,(esk5_0=esk3_1(X1)|f(esk4_0)|f(esk1_0)|~f(X2)|~f(X1)),inference(spm,[status(thm)],[16,13,theory(equality)])).
% cnf(58,negated_conjecture,(esk5_0=X4|X5!=esk5_0|~f(X5)|~f(X4)),inference(ef,[status(thm)],[17,theory(equality)])).
% cnf(60,negated_conjecture,(f(esk1_0)|esk5_0=X3|X4!=X1|~f(X2)|~f(X1)|~f(esk3_1(X1))|~f(X4)|~f(X3)),inference(spm,[status(thm)],[10,17,theory(equality)])).
% cnf(82,negated_conjecture,(f(esk1_0)|esk5_0=X1|~f(X2)|~f(X3)|~f(esk3_1(X3))|~f(X1)),inference(er,[status(thm)],[60,theory(equality)])).
% cnf(86,negated_conjecture,(epred2_0),inference(csr,[status(thm)],[23,21])).
% cnf(87,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[22,86,theory(equality)])).
% cnf(88,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[87,theory(equality)])).
% cnf(101,negated_conjecture,(f(esk1_0)|f(esk5_0)|~f(X1)|~f(X2)),inference(csr,[status(thm)],[36,13])).
% cnf(110,negated_conjecture,(f(esk5_0)|f(esk1_0)|~f(X1)),inference(spm,[status(thm)],[101,14,theory(equality)])).
% cnf(125,negated_conjecture,(f(esk1_0)|f(esk5_0)),inference(spm,[status(thm)],[110,14,theory(equality)])).
% cnf(129,negated_conjecture,(esk1_0=X1|f(esk5_0)|~f(X1)),inference(spm,[status(thm)],[15,125,theory(equality)])).
% cnf(131,negated_conjecture,(esk4_0=esk1_0|f(esk5_0)),inference(spm,[status(thm)],[30,125,theory(equality)])).
% cnf(159,negated_conjecture,(esk5_0=X1|~f(esk5_0)|~f(X1)),inference(er,[status(thm)],[58,theory(equality)])).
% cnf(164,negated_conjecture,(esk5_0=X1|esk4_0=esk1_0|~f(X1)),inference(spm,[status(thm)],[159,131,theory(equality)])).
% cnf(165,negated_conjecture,(esk5_0=X1|esk1_0=X2|~f(X1)|~f(X2)),inference(spm,[status(thm)],[159,129,theory(equality)])).
% cnf(168,negated_conjecture,(esk4_0=esk1_0|esk5_0=esk3_1(X1)|f(esk1_0)|~f(X2)|~f(X1)),inference(spm,[status(thm)],[164,13,theory(equality)])).
% cnf(223,negated_conjecture,(f(esk2_0)|f(esk5_0)|~f(X1)|~f(X2)),inference(csr,[status(thm)],[40,12])).
% cnf(238,negated_conjecture,(f(esk5_0)|f(esk2_0)|~f(X1)),inference(spm,[status(thm)],[223,14,theory(equality)])).
% cnf(259,negated_conjecture,(f(esk2_0)|f(esk5_0)),inference(spm,[status(thm)],[238,14,theory(equality)])).
% cnf(267,negated_conjecture,(esk4_0=esk2_0|f(esk5_0)),inference(spm,[status(thm)],[30,259,theory(equality)])).
% cnf(285,negated_conjecture,(esk5_0=X1|esk4_0=esk2_0|~f(X1)),inference(spm,[status(thm)],[159,267,theory(equality)])).
% cnf(320,negated_conjecture,(f(esk1_0)|f(esk4_0)|esk5_0!=X1|~f(X2)|~f(X1)|~f(X3)),inference(spm,[status(thm)],[10,42,theory(equality)])).
% cnf(467,negated_conjecture,(f(esk1_0)|esk4_0=esk1_0|esk5_0!=X1|~f(X2)|~f(X1)|~f(X3)),inference(spm,[status(thm)],[10,168,theory(equality)])).
% cnf(698,negated_conjecture,(f(esk1_0)|f(esk4_0)|~f(X2)|~f(X1)|~f(X3)),inference(csr,[status(thm)],[320,16])).
% cnf(705,negated_conjecture,(esk4_0=esk2_0|esk5_0=esk4_0|f(esk1_0)|~f(X1)|~f(X2)|~f(X3)),inference(spm,[status(thm)],[285,698,theory(equality)])).
% cnf(1099,negated_conjecture,(esk5_0=X1|f(esk1_0)|~f(X1)|~f(X2)|~f(X3)),inference(csr,[status(thm)],[82,13])).
% cnf(1815,negated_conjecture,(esk4_0=esk2_0|esk5_0=esk1_0|esk4_0=esk5_0|~f(X1)|~f(X2)|~f(X3)),inference(spm,[status(thm)],[285,705,theory(equality)])).
% cnf(1890,negated_conjecture,(esk4_0=esk5_0|esk1_0=esk5_0|esk4_0=esk2_0|~f(X1)|~f(X2)),inference(spm,[status(thm)],[1815,267,theory(equality)])).
% cnf(1959,negated_conjecture,(esk4_0=esk2_0|esk1_0=esk5_0|esk4_0=esk5_0|~f(X1)),inference(spm,[status(thm)],[1890,267,theory(equality)])).
% cnf(2005,negated_conjecture,(esk4_0=esk5_0|esk1_0=esk5_0|esk4_0=esk2_0),inference(spm,[status(thm)],[1959,267,theory(equality)])).
% cnf(2531,negated_conjecture,(esk4_0=esk1_0|f(esk1_0)|~f(X2)|~f(X1)|~f(X3)),inference(csr,[status(thm)],[467,1099])).
% cnf(2539,negated_conjecture,(esk4_0=esk1_0|esk5_0=esk1_0|~f(X1)|~f(X2)|~f(X3)),inference(spm,[status(thm)],[164,2531,theory(equality)])).
% cnf(2621,negated_conjecture,(esk1_0=esk5_0|esk4_0=esk1_0|~f(X1)|~f(X2)),inference(spm,[status(thm)],[2539,131,theory(equality)])).
% cnf(2699,negated_conjecture,(esk4_0=esk1_0|esk1_0=esk5_0|~f(X1)),inference(spm,[status(thm)],[2621,131,theory(equality)])).
% cnf(2751,negated_conjecture,(esk1_0=esk5_0|esk4_0=esk1_0),inference(spm,[status(thm)],[2699,131,theory(equality)])).
% cnf(2781,negated_conjecture,(esk1_0=esk2_0|esk1_0=esk5_0),inference(spm,[status(thm)],[2005,2751,theory(equality)])).
% cnf(2783,negated_conjecture,(f(esk3_1(X1))|esk1_0=esk5_0|~f(X2)|~f(X1)),inference(spm,[status(thm)],[11,2781,theory(equality)])).
% cnf(2784,negated_conjecture,(epred1_0|esk1_0=esk5_0|esk3_1(X1)!=X1|~f(X1)),inference(spm,[status(thm)],[19,2781,theory(equality)])).
% cnf(2791,negated_conjecture,(esk1_0=esk5_0|esk3_1(X1)!=X1|~f(X1)),inference(sr,[status(thm)],[2784,88,theory(equality)])).
% cnf(2806,negated_conjecture,(esk1_0=esk5_0|f(esk5_0)|X2!=X1|~f(X1)|~f(esk3_1(X1))|~f(X2)),inference(spm,[status(thm)],[2791,15,theory(equality)])).
% cnf(2833,negated_conjecture,(esk1_0=esk5_0|f(esk5_0)|~f(X1)|~f(esk3_1(X1))),inference(er,[status(thm)],[2806,theory(equality)])).
% cnf(3002,negated_conjecture,(esk1_0=esk5_0|f(esk5_0)|~f(X1)|~f(X2)),inference(spm,[status(thm)],[2833,2783,theory(equality)])).
% cnf(3065,negated_conjecture,(esk1_0=esk5_0|f(esk5_0)|~f(X1)),inference(spm,[status(thm)],[3002,14,theory(equality)])).
% cnf(3131,negated_conjecture,(esk1_0=esk5_0|f(esk5_0)),inference(spm,[status(thm)],[3065,14,theory(equality)])).
% cnf(3153,negated_conjecture,(esk1_0=esk5_0|esk5_0=X1|~f(X1)),inference(spm,[status(thm)],[165,3131,theory(equality)])).
% cnf(3172,negated_conjecture,(esk1_0=esk5_0|esk5_0=esk3_1(X1)|~f(X2)|~f(X1)),inference(spm,[status(thm)],[3153,2783,theory(equality)])).
% cnf(3222,negated_conjecture,(esk1_0=esk5_0|esk5_0!=X1|~f(X1)|~f(X2)),inference(spm,[status(thm)],[2791,3172,theory(equality)])).
% cnf(3226,negated_conjecture,(esk1_0=esk5_0|~f(X1)|~f(X2)),inference(csr,[status(thm)],[3222,3153])).
% cnf(3234,negated_conjecture,(esk1_0=esk5_0|~f(X1)),inference(spm,[status(thm)],[3226,3131,theory(equality)])).
% cnf(3282,negated_conjecture,(esk1_0=esk5_0),inference(spm,[status(thm)],[3234,3131,theory(equality)])).
% cnf(3342,negated_conjecture,(f(esk5_0)|f(esk5_0)),inference(rw,[status(thm)],[125,3282,theory(equality)])).
% cnf(3343,negated_conjecture,(f(esk5_0)),inference(cn,[status(thm)],[3342,theory(equality)])).
% cnf(3344,negated_conjecture,(epred1_0|esk3_1(X1)!=X1|esk2_0!=esk5_0|~f(X1)),inference(rw,[status(thm)],[19,3282,theory(equality)])).
% cnf(3345,negated_conjecture,(esk3_1(X1)!=X1|esk2_0!=esk5_0|~f(X1)),inference(sr,[status(thm)],[3344,88,theory(equality)])).
% cnf(3347,negated_conjecture,(f(esk3_1(X1))|esk2_0!=esk5_0|~f(X2)|~f(X1)),inference(rw,[status(thm)],[11,3282,theory(equality)])).
% cnf(3354,negated_conjecture,(esk5_0=X1|$false|~f(X1)),inference(rw,[status(thm)],[159,3343,theory(equality)])).
% cnf(3355,negated_conjecture,(esk5_0=X1|~f(X1)),inference(cn,[status(thm)],[3354,theory(equality)])).
% cnf(3366,negated_conjecture,(esk5_0=esk3_1(X1)|f(esk2_0)|~f(X2)|~f(X1)),inference(spm,[status(thm)],[3355,12,theory(equality)])).
% cnf(3378,negated_conjecture,(f(esk2_0)|esk5_0!=X1|~f(X2)|~f(X1)|~f(X3)),inference(spm,[status(thm)],[9,3366,theory(equality)])).
% cnf(3399,negated_conjecture,(f(esk2_0)|~f(X2)|~f(X1)|~f(X3)),inference(csr,[status(thm)],[3378,3355])).
% cnf(3400,negated_conjecture,(esk5_0=esk2_0|~f(X1)|~f(X2)|~f(X3)),inference(spm,[status(thm)],[3355,3399,theory(equality)])).
% cnf(3409,negated_conjecture,(esk2_0=esk5_0|~f(X1)|~f(X2)),inference(spm,[status(thm)],[3400,3343,theory(equality)])).
% cnf(3424,negated_conjecture,(esk2_0=esk5_0|~f(X1)),inference(spm,[status(thm)],[3409,3343,theory(equality)])).
% cnf(3434,negated_conjecture,(esk2_0=esk5_0),inference(spm,[status(thm)],[3424,3343,theory(equality)])).
% cnf(3444,negated_conjecture,(esk3_1(X1)!=X1|$false|~f(X1)),inference(rw,[status(thm)],[3345,3434,theory(equality)])).
% cnf(3445,negated_conjecture,(esk3_1(X1)!=X1|~f(X1)),inference(cn,[status(thm)],[3444,theory(equality)])).
% cnf(3447,negated_conjecture,(f(esk3_1(X1))|$false|~f(X2)|~f(X1)),inference(rw,[status(thm)],[3347,3434,theory(equality)])).
% cnf(3448,negated_conjecture,(f(esk3_1(X1))|~f(X2)|~f(X1)),inference(cn,[status(thm)],[3447,theory(equality)])).
% cnf(3450,negated_conjecture,(esk5_0=esk3_1(X1)|~f(X2)|~f(X1)),inference(spm,[status(thm)],[3355,3448,theory(equality)])).
% cnf(3456,negated_conjecture,(esk5_0!=X1|~f(X1)|~f(X2)),inference(spm,[status(thm)],[3445,3450,theory(equality)])).
% cnf(3458,negated_conjecture,(~f(X1)|~f(X2)),inference(csr,[status(thm)],[3456,3355])).
% fof(3459, plain,(~(epred3_0)<=>![X1]:~(f(X1))),introduced(definition),['split']).
% cnf(3460,plain,(epred3_0|~f(X1)),inference(split_equiv,[status(thm)],[3459])).
% fof(3461, plain,(~(epred4_0)<=>![X2]:~(f(X2))),introduced(definition),['split']).
% cnf(3462,plain,(epred4_0|~f(X2)),inference(split_equiv,[status(thm)],[3461])).
% cnf(3463,negated_conjecture,(~epred4_0|~epred3_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[3458,3459,theory(equality)]),3461,theory(equality)]),['split']).
% cnf(3464,negated_conjecture,(epred3_0),inference(spm,[status(thm)],[3460,3343,theory(equality)])).
% cnf(3467,negated_conjecture,(~epred4_0|$false),inference(rw,[status(thm)],[3463,3464,theory(equality)])).
% cnf(3468,negated_conjecture,(~epred4_0),inference(cn,[status(thm)],[3467,theory(equality)])).
% cnf(3470,negated_conjecture,(epred4_0),inference(spm,[status(thm)],[3462,3343,theory(equality)])).
% cnf(3475,negated_conjecture,($false),inference(rw,[status(thm)],[3468,3470,theory(equality)])).
% cnf(3476,negated_conjecture,($false),inference(cn,[status(thm)],[3475,theory(equality)])).
% cnf(3477,negated_conjecture,($false),3476,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 557
% # ...of these trivial : 14
% # ...subsumed : 399
% # ...remaining for further processing: 144
% # Other redundant clauses eliminated : 28
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 62
% # Backward-rewritten : 55
% # Generated clauses : 2495
% # ...of the previous two non-trivial : 2449
% # Contextual simplify-reflections : 867
% # Paramodulations : 2446
% # Factorizations : 14
% # Equation resolutions : 29
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 25
% # Clause-clause subsumption calls (NU) : 8112
% # Rec. Clause-clause subsumption calls : 3171
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 13 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.09+/-0.287 terms/leaf
% # -------------------------------------------------
% # User time : 0.114 s
% # System time : 0.009 s
% # Total time : 0.123 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.34 WC
% FINAL PrfWatch: 0.27 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP7209/SYN415+1.tptp
%
%------------------------------------------------------------------------------