TSTP Solution File: SWV486+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV486+1 : TPTP v5.0.0. Released v4.0.0.
% 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 : Thu Dec 30 09:12:22 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP8081/SWV486+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8081/SWV486+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8081/SWV486+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 8177
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(int_leq(X1,X2)<=>(int_less(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', int_leq)).
% fof(2, axiom,![X1]:![X2]:![X3]:((int_less(X1,X2)&int_less(X2,X3))=>int_less(X1,X3)),file('/tmp/SRASS.s.p', int_less_transitive)).
% fof(3, axiom,![X1]:![X2]:(int_less(X1,X2)=>~(X1=X2)),file('/tmp/SRASS.s.p', int_less_irreflexive)).
% fof(4, axiom,![X1]:![X2]:(int_less(X1,X2)|int_leq(X2,X1)),file('/tmp/SRASS.s.p', int_less_total)).
% fof(6, axiom,![X1]:![X2]:plus(X1,X2)=plus(X2,X1),file('/tmp/SRASS.s.p', plus_commutative)).
% fof(7, axiom,![X1]:plus(X1,int_zero)=X1,file('/tmp/SRASS.s.p', plus_zero)).
% fof(8, axiom,![X4]:![X5]:![X6]:![X7]:((int_less(X4,X5)&int_leq(X6,X7))=>int_leq(plus(X4,X6),plus(X5,X7))),file('/tmp/SRASS.s.p', plus_and_order1)).
% fof(9, axiom,![X1]:![X2]:(int_less(X1,X2)<=>?[X3]:(plus(X1,X3)=X2&int_less(int_zero,X3))),file('/tmp/SRASS.s.p', plus_and_inverse)).
% fof(11, axiom,![X1]:![X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))=>(![X8]:((int_less(int_zero,X8)&X1=plus(X2,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(plus(X3,X8),X3)=qr(plus(X3,X8),X3)))&![X8]:((int_less(int_zero,X8)&X2=plus(X1,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X1))=>a(X3,plus(X3,X8))=real_zero)))),file('/tmp/SRASS.s.p', qih)).
% fof(13, conjecture,![X1]:![X2]:(((int_leq(int_one,X1)&int_less(X1,X2))&int_leq(X2,n))=>a(X1,X2)=real_zero),file('/tmp/SRASS.s.p', lt)).
% fof(14, negated_conjecture,~(![X1]:![X2]:(((int_leq(int_one,X1)&int_less(X1,X2))&int_leq(X2,n))=>a(X1,X2)=real_zero)),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X2]:![X1]:(epred1_2(X1,X2)=>(![X8]:((int_less(int_zero,X8)&X1=plus(X2,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(plus(X3,X8),X3)=qr(plus(X3,X8),X3)))&![X8]:((int_less(int_zero,X8)&X2=plus(X1,X8))=>![X3]:((int_leq(int_one,X3)&int_leq(X3,X1))=>a(X3,plus(X3,X8))=real_zero)))),introduced(definition)).
% fof(16, plain,![X1]:![X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))=>epred1_2(X1,X2)),inference(apply_def,[status(esa)],[11,15,theory(equality)])).
% fof(17, plain,![X1]:![X2]:((~(int_leq(X1,X2))|(int_less(X1,X2)|X1=X2))&((~(int_less(X1,X2))&~(X1=X2))|int_leq(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(18, plain,![X3]:![X4]:((~(int_leq(X3,X4))|(int_less(X3,X4)|X3=X4))&((~(int_less(X3,X4))&~(X3=X4))|int_leq(X3,X4))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:((~(int_leq(X3,X4))|(int_less(X3,X4)|X3=X4))&((~(int_less(X3,X4))|int_leq(X3,X4))&(~(X3=X4)|int_leq(X3,X4)))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(int_leq(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(int_leq(X1,X2)|~int_less(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(X1=X2|int_less(X1,X2)|~int_leq(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(23, plain,![X1]:![X2]:![X3]:((~(int_less(X1,X2))|~(int_less(X2,X3)))|int_less(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(24, plain,![X4]:![X5]:![X6]:((~(int_less(X4,X5))|~(int_less(X5,X6)))|int_less(X4,X6)),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X1]:![X2]:(~(int_less(X1,X2))|~(X1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(27, plain,![X3]:![X4]:(~(int_less(X3,X4))|~(X3=X4)),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(X1!=X2|~int_less(X1,X2)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:(int_less(X3,X4)|int_leq(X4,X3)),inference(variable_rename,[status(thm)],[4])).
% cnf(30,plain,(int_leq(X1,X2)|int_less(X2,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(32, plain,![X3]:![X4]:plus(X3,X4)=plus(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(plus(X1,X2)=plus(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X2]:plus(X2,int_zero)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(plus(X1,int_zero)=X1),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:![X7]:((~(int_less(X4,X5))|~(int_leq(X6,X7)))|int_leq(plus(X4,X6),plus(X5,X7))),inference(fof_nnf,[status(thm)],[8])).
% fof(37, plain,![X8]:![X9]:![X10]:![X11]:((~(int_less(X8,X9))|~(int_leq(X10,X11)))|int_leq(plus(X8,X10),plus(X9,X11))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(int_leq(plus(X1,X2),plus(X3,X4))|~int_leq(X2,X4)|~int_less(X1,X3)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:![X2]:((~(int_less(X1,X2))|?[X3]:(plus(X1,X3)=X2&int_less(int_zero,X3)))&(![X3]:(~(plus(X1,X3)=X2)|~(int_less(int_zero,X3)))|int_less(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(40, plain,![X4]:![X5]:((~(int_less(X4,X5))|?[X6]:(plus(X4,X6)=X5&int_less(int_zero,X6)))&(![X7]:(~(plus(X4,X7)=X5)|~(int_less(int_zero,X7)))|int_less(X4,X5))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:((~(int_less(X4,X5))|(plus(X4,esk1_2(X4,X5))=X5&int_less(int_zero,esk1_2(X4,X5))))&(![X7]:(~(plus(X4,X7)=X5)|~(int_less(int_zero,X7)))|int_less(X4,X5))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X4]:![X5]:![X7]:(((~(plus(X4,X7)=X5)|~(int_less(int_zero,X7)))|int_less(X4,X5))&(~(int_less(X4,X5))|(plus(X4,esk1_2(X4,X5))=X5&int_less(int_zero,esk1_2(X4,X5))))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X7]:(((~(plus(X4,X7)=X5)|~(int_less(int_zero,X7)))|int_less(X4,X5))&((plus(X4,esk1_2(X4,X5))=X5|~(int_less(X4,X5)))&(int_less(int_zero,esk1_2(X4,X5))|~(int_less(X4,X5))))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(51, plain,![X1]:![X2]:((((~(int_leq(int_one,X1))|~(int_leq(X1,n)))|~(int_leq(int_one,X2)))|~(int_leq(X2,n)))|epred1_2(X1,X2)),inference(fof_nnf,[status(thm)],[16])).
% fof(52, plain,![X3]:![X4]:((((~(int_leq(int_one,X3))|~(int_leq(X3,n)))|~(int_leq(int_one,X4)))|~(int_leq(X4,n)))|epred1_2(X3,X4)),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(epred1_2(X1,X2)|~int_leq(X2,n)|~int_leq(int_one,X2)|~int_leq(X1,n)|~int_leq(int_one,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, negated_conjecture,?[X1]:?[X2]:(((int_leq(int_one,X1)&int_less(X1,X2))&int_leq(X2,n))&~(a(X1,X2)=real_zero)),inference(fof_nnf,[status(thm)],[14])).
% fof(56, negated_conjecture,?[X3]:?[X4]:(((int_leq(int_one,X3)&int_less(X3,X4))&int_leq(X4,n))&~(a(X3,X4)=real_zero)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(((int_leq(int_one,esk2_0)&int_less(esk2_0,esk3_0))&int_leq(esk3_0,n))&~(a(esk2_0,esk3_0)=real_zero)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(a(esk2_0,esk3_0)!=real_zero),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(int_leq(esk3_0,n)),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(int_less(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(61,negated_conjecture,(int_leq(int_one,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% fof(62, plain,![X2]:![X1]:(~(epred1_2(X1,X2))|(![X8]:((~(int_less(int_zero,X8))|~(X1=plus(X2,X8)))|![X3]:((~(int_leq(int_one,X3))|~(int_leq(X3,X2)))|a(plus(X3,X8),X3)=qr(plus(X3,X8),X3)))&![X8]:((~(int_less(int_zero,X8))|~(X2=plus(X1,X8)))|![X3]:((~(int_leq(int_one,X3))|~(int_leq(X3,X1)))|a(X3,plus(X3,X8))=real_zero)))),inference(fof_nnf,[status(thm)],[15])).
% fof(63, plain,![X9]:![X10]:(~(epred1_2(X10,X9))|(![X11]:((~(int_less(int_zero,X11))|~(X10=plus(X9,X11)))|![X12]:((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=qr(plus(X12,X11),X12)))&![X13]:((~(int_less(int_zero,X13))|~(X9=plus(X10,X13)))|![X14]:((~(int_leq(int_one,X14))|~(int_leq(X14,X10)))|a(X14,plus(X14,X13))=real_zero)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:(((((~(int_leq(int_one,X14))|~(int_leq(X14,X10)))|a(X14,plus(X14,X13))=real_zero)|(~(int_less(int_zero,X13))|~(X9=plus(X10,X13))))&(((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=qr(plus(X12,X11),X12))|(~(int_less(int_zero,X11))|~(X10=plus(X9,X11)))))|~(epred1_2(X10,X9))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:(((((~(int_leq(int_one,X14))|~(int_leq(X14,X10)))|a(X14,plus(X14,X13))=real_zero)|(~(int_less(int_zero,X13))|~(X9=plus(X10,X13))))|~(epred1_2(X10,X9)))&((((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=qr(plus(X12,X11),X12))|(~(int_less(int_zero,X11))|~(X10=plus(X9,X11))))|~(epred1_2(X10,X9)))),inference(distribute,[status(thm)],[64])).
% cnf(67,plain,(a(X4,plus(X4,X3))=real_zero|~epred1_2(X1,X2)|X2!=plus(X1,X3)|~int_less(int_zero,X3)|~int_leq(X4,X1)|~int_leq(int_one,X4)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(int_leq(X1,X1)),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(69,plain,(~int_less(X1,X1)),inference(er,[status(thm)],[28,theory(equality)])).
% cnf(70,plain,(plus(int_zero,X1)=X1),inference(spm,[status(thm)],[35,33,theory(equality)])).
% cnf(78,negated_conjecture,(esk3_0=n|int_less(esk3_0,n)),inference(spm,[status(thm)],[22,59,theory(equality)])).
% cnf(82,plain,(X1=X2|int_less(X1,X2)|int_less(X2,X1)),inference(spm,[status(thm)],[22,30,theory(equality)])).
% cnf(97,plain,(int_leq(plus(X1,X2),plus(X4,X3))|~int_less(X1,X3)|~int_leq(X2,X4)),inference(spm,[status(thm)],[38,33,theory(equality)])).
% cnf(104,plain,(a(X1,plus(X1,esk1_2(X2,X3)))=real_zero|X3!=X4|~epred1_2(X2,X4)|~int_less(int_zero,esk1_2(X2,X3))|~int_leq(int_one,X1)|~int_leq(X1,X2)|~int_less(X2,X3)),inference(spm,[status(thm)],[67,45,theory(equality)])).
% cnf(108,plain,(a(X1,plus(X1,esk1_2(X2,X3)))=real_zero|~epred1_2(X2,X3)|~int_less(int_zero,esk1_2(X2,X3))|~int_leq(int_one,X1)|~int_leq(X1,X2)|~int_less(X2,X3)),inference(er,[status(thm)],[104,theory(equality)])).
% cnf(121,negated_conjecture,(int_less(X1,n)|n=esk3_0|~int_less(X1,esk3_0)),inference(spm,[status(thm)],[25,78,theory(equality)])).
% cnf(146,plain,(int_less(X1,X2)|X3=X2|int_less(X2,X3)|~int_less(X1,X3)),inference(spm,[status(thm)],[25,82,theory(equality)])).
% cnf(182,negated_conjecture,(n=esk3_0|~int_less(n,esk3_0)),inference(spm,[status(thm)],[69,121,theory(equality)])).
% cnf(335,plain,(int_leq(plus(X1,X2),X4)|~int_less(X1,esk1_2(X3,X4))|~int_leq(X2,X3)|~int_less(X3,X4)),inference(spm,[status(thm)],[97,45,theory(equality)])).
% cnf(573,plain,(a(X1,plus(X1,esk1_2(X2,X3)))=real_zero|~epred1_2(X2,X3)|~int_less(X2,X3)|~int_leq(int_one,X1)|~int_leq(X1,X2)),inference(csr,[status(thm)],[108,44])).
% cnf(578,plain,(a(X1,X2)=real_zero|~epred1_2(X1,X2)|~int_less(X1,X2)|~int_leq(int_one,X1)|~int_leq(X1,X1)),inference(spm,[status(thm)],[573,45,theory(equality)])).
% cnf(579,plain,(a(X1,X2)=real_zero|~epred1_2(X1,X2)|~int_less(X1,X2)|~int_leq(int_one,X1)|$false),inference(rw,[status(thm)],[578,68,theory(equality)])).
% cnf(580,plain,(a(X1,X2)=real_zero|~epred1_2(X1,X2)|~int_less(X1,X2)|~int_leq(int_one,X1)),inference(cn,[status(thm)],[579,theory(equality)])).
% cnf(1043,negated_conjecture,(esk3_0=X1|int_less(X1,esk3_0)|int_less(esk2_0,X1)),inference(spm,[status(thm)],[146,60,theory(equality)])).
% cnf(1155,negated_conjecture,(n=esk3_0|int_less(esk2_0,n)),inference(spm,[status(thm)],[182,1043,theory(equality)])).
% cnf(3465,plain,(int_leq(plus(int_zero,X1),X2)|~int_less(X3,X2)|~int_leq(X1,X3)),inference(spm,[status(thm)],[335,44,theory(equality)])).
% cnf(3470,plain,(int_leq(X1,X2)|~int_less(X3,X2)|~int_leq(X1,X3)),inference(rw,[status(thm)],[3465,70,theory(equality)])).
% cnf(5021,negated_conjecture,(int_leq(X1,esk3_0)|~int_leq(X1,esk2_0)),inference(spm,[status(thm)],[3470,60,theory(equality)])).
% cnf(5022,negated_conjecture,(int_leq(X1,n)|n=esk3_0|~int_leq(X1,esk2_0)),inference(spm,[status(thm)],[3470,1155,theory(equality)])).
% cnf(8420,negated_conjecture,(~epred1_2(esk2_0,esk3_0)|~int_less(esk2_0,esk3_0)|~int_leq(int_one,esk2_0)),inference(spm,[status(thm)],[58,580,theory(equality)])).
% cnf(8421,negated_conjecture,(~epred1_2(esk2_0,esk3_0)|$false|~int_leq(int_one,esk2_0)),inference(rw,[status(thm)],[8420,60,theory(equality)])).
% cnf(8422,negated_conjecture,(~epred1_2(esk2_0,esk3_0)|$false|$false),inference(rw,[status(thm)],[8421,61,theory(equality)])).
% cnf(8423,negated_conjecture,(~epred1_2(esk2_0,esk3_0)),inference(cn,[status(thm)],[8422,theory(equality)])).
% cnf(8424,negated_conjecture,(~int_leq(esk3_0,n)|~int_leq(esk2_0,n)|~int_leq(int_one,esk3_0)|~int_leq(int_one,esk2_0)),inference(spm,[status(thm)],[8423,53,theory(equality)])).
% cnf(8425,negated_conjecture,($false|~int_leq(esk2_0,n)|~int_leq(int_one,esk3_0)|~int_leq(int_one,esk2_0)),inference(rw,[status(thm)],[8424,59,theory(equality)])).
% cnf(8426,negated_conjecture,($false|~int_leq(esk2_0,n)|~int_leq(int_one,esk3_0)|$false),inference(rw,[status(thm)],[8425,61,theory(equality)])).
% cnf(8427,negated_conjecture,(~int_leq(esk2_0,n)|~int_leq(int_one,esk3_0)),inference(cn,[status(thm)],[8426,theory(equality)])).
% cnf(8438,negated_conjecture,(n=esk3_0|~int_leq(int_one,esk3_0)|~int_leq(esk2_0,esk2_0)),inference(spm,[status(thm)],[8427,5022,theory(equality)])).
% cnf(8451,negated_conjecture,(n=esk3_0|~int_leq(int_one,esk3_0)|$false),inference(rw,[status(thm)],[8438,68,theory(equality)])).
% cnf(8452,negated_conjecture,(n=esk3_0|~int_leq(int_one,esk3_0)),inference(cn,[status(thm)],[8451,theory(equality)])).
% cnf(8462,negated_conjecture,(n=esk3_0|~int_leq(int_one,esk2_0)),inference(spm,[status(thm)],[8452,5021,theory(equality)])).
% cnf(8488,negated_conjecture,(n=esk3_0|$false),inference(rw,[status(thm)],[8462,61,theory(equality)])).
% cnf(8489,negated_conjecture,(n=esk3_0),inference(cn,[status(thm)],[8488,theory(equality)])).
% cnf(8500,negated_conjecture,(~int_leq(esk2_0,esk3_0)|~int_leq(int_one,esk3_0)),inference(rw,[status(thm)],[8427,8489,theory(equality)])).
% cnf(8739,negated_conjecture,(~int_leq(int_one,esk3_0)|~int_less(esk2_0,esk3_0)),inference(spm,[status(thm)],[8500,21,theory(equality)])).
% cnf(8755,negated_conjecture,(~int_leq(int_one,esk3_0)|$false),inference(rw,[status(thm)],[8739,60,theory(equality)])).
% cnf(8756,negated_conjecture,(~int_leq(int_one,esk3_0)),inference(cn,[status(thm)],[8755,theory(equality)])).
% cnf(8777,negated_conjecture,(~int_leq(int_one,esk2_0)),inference(spm,[status(thm)],[8756,5021,theory(equality)])).
% cnf(8798,negated_conjecture,($false),inference(rw,[status(thm)],[8777,61,theory(equality)])).
% cnf(8799,negated_conjecture,($false),inference(cn,[status(thm)],[8798,theory(equality)])).
% cnf(8800,negated_conjecture,($false),8799,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1360
% # ...of these trivial : 6
% # ...subsumed : 942
% # ...remaining for further processing: 412
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 59
% # Backward-rewritten : 112
% # Generated clauses : 6029
% # ...of the previous two non-trivial : 5126
% # Contextual simplify-reflections : 1144
% # Paramodulations : 5996
% # Factorizations : 4
% # Equation resolutions : 26
% # Current number of processed clauses: 213
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 194
% # Current number of unprocessed clauses: 1551
% # ...number of literals in the above : 6873
% # Clause-clause subsumption calls (NU) : 12910
% # Rec. Clause-clause subsumption calls : 7351
% # Unit Clause-clause subsumption calls : 32
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 115 leaves, 1.70+/-1.915 terms/leaf
% # Paramod-from index: 57 leaves, 1.11+/-0.405 terms/leaf
% # Paramod-into index: 103 leaves, 1.44+/-1.220 terms/leaf
% # -------------------------------------------------
% # User time : 0.289 s
% # System time : 0.016 s
% # Total time : 0.305 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.51 CPU 0.59 WC
% FINAL PrfWatch: 0.51 CPU 0.59 WC
% SZS output end Solution for /tmp/SystemOnTPTP8081/SWV486+1.tptp
%
%------------------------------------------------------------------------------