TSTP Solution File: SWV491+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV491+4 : 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:14:16 EST 2010
% Result : Theorem 1.78s
% Output : Solution 1.78s
% 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/SystemOnTPTP9894/SWV491+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9894/SWV491+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9894/SWV491+4.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 9990
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:(int_leq(X1,X2)<=>(int_less(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', int_leq)).
% fof(4, axiom,![X1]:![X2]:(int_less(X1,X2)|int_leq(X2,X1)),file('/tmp/SRASS.s.p', int_less_total)).
% 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(12, 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)=real_zero))&![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(X3,X3)=real_one))&![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', qii)).
% fof(13, conjecture,![X1]:![X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))=>((~(X1=X2)=>a(X1,X2)=real_zero)&(X1=X2=>a(X1,X2)=real_one))),file('/tmp/SRASS.s.p', id)).
% fof(14, negated_conjecture,~(![X1]:![X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))=>((~(X1=X2)=>a(X1,X2)=real_zero)&(X1=X2=>a(X1,X2)=real_one)))),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)=real_zero))&![X3]:((int_leq(int_one,X3)&int_leq(X3,X2))=>a(X3,X3)=real_one))&![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)],[12,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(22,plain,(X1=X2|int_less(X1,X2)|~int_leq(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% 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(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(52, 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(53, 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)],[52])).
% cnf(54,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)],[53])).
% fof(55, negated_conjecture,?[X1]:?[X2]:((((int_leq(int_one,X1)&int_leq(X1,n))&int_leq(int_one,X2))&int_leq(X2,n))&((~(X1=X2)&~(a(X1,X2)=real_zero))|(X1=X2&~(a(X1,X2)=real_one)))),inference(fof_nnf,[status(thm)],[14])).
% fof(56, negated_conjecture,?[X3]:?[X4]:((((int_leq(int_one,X3)&int_leq(X3,n))&int_leq(int_one,X4))&int_leq(X4,n))&((~(X3=X4)&~(a(X3,X4)=real_zero))|(X3=X4&~(a(X3,X4)=real_one)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,((((int_leq(int_one,esk2_0)&int_leq(esk2_0,n))&int_leq(int_one,esk3_0))&int_leq(esk3_0,n))&((~(esk2_0=esk3_0)&~(a(esk2_0,esk3_0)=real_zero))|(esk2_0=esk3_0&~(a(esk2_0,esk3_0)=real_one)))),inference(skolemize,[status(esa)],[56])).
% fof(58, negated_conjecture,((((int_leq(int_one,esk2_0)&int_leq(esk2_0,n))&int_leq(int_one,esk3_0))&int_leq(esk3_0,n))&(((esk2_0=esk3_0|~(esk2_0=esk3_0))&(~(a(esk2_0,esk3_0)=real_one)|~(esk2_0=esk3_0)))&((esk2_0=esk3_0|~(a(esk2_0,esk3_0)=real_zero))&(~(a(esk2_0,esk3_0)=real_one)|~(a(esk2_0,esk3_0)=real_zero))))),inference(distribute,[status(thm)],[57])).
% cnf(60,negated_conjecture,(esk2_0=esk3_0|a(esk2_0,esk3_0)!=real_zero),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(esk2_0!=esk3_0|a(esk2_0,esk3_0)!=real_one),inference(split_conjunct,[status(thm)],[58])).
% cnf(63,negated_conjecture,(int_leq(esk3_0,n)),inference(split_conjunct,[status(thm)],[58])).
% cnf(64,negated_conjecture,(int_leq(int_one,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(65,negated_conjecture,(int_leq(esk2_0,n)),inference(split_conjunct,[status(thm)],[58])).
% cnf(66,negated_conjecture,(int_leq(int_one,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% fof(67, 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)=real_zero))&![X3]:((~(int_leq(int_one,X3))|~(int_leq(X3,X2)))|a(X3,X3)=real_one))&![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(68, 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)=real_zero))&![X13]:((~(int_leq(int_one,X13))|~(int_leq(X13,X9)))|a(X13,X13)=real_one))&![X14]:((~(int_less(int_zero,X14))|~(X9=plus(X10,X14)))|![X15]:((~(int_leq(int_one,X15))|~(int_leq(X15,X10)))|a(X15,plus(X15,X14))=real_zero)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((((~(int_leq(int_one,X15))|~(int_leq(X15,X10)))|a(X15,plus(X15,X14))=real_zero)|(~(int_less(int_zero,X14))|~(X9=plus(X10,X14))))&(((~(int_leq(int_one,X13))|~(int_leq(X13,X9)))|a(X13,X13)=real_one)&(((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=real_zero)|(~(int_less(int_zero,X11))|~(X10=plus(X9,X11))))))|~(epred1_2(X10,X9))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((((~(int_leq(int_one,X15))|~(int_leq(X15,X10)))|a(X15,plus(X15,X14))=real_zero)|(~(int_less(int_zero,X14))|~(X9=plus(X10,X14))))|~(epred1_2(X10,X9)))&((((~(int_leq(int_one,X13))|~(int_leq(X13,X9)))|a(X13,X13)=real_one)|~(epred1_2(X10,X9)))&((((~(int_leq(int_one,X12))|~(int_leq(X12,X9)))|a(plus(X12,X11),X12)=real_zero)|(~(int_less(int_zero,X11))|~(X10=plus(X9,X11))))|~(epred1_2(X10,X9))))),inference(distribute,[status(thm)],[69])).
% cnf(71,plain,(a(plus(X4,X3),X4)=real_zero|~epred1_2(X1,X2)|X1!=plus(X2,X3)|~int_less(int_zero,X3)|~int_leq(X4,X2)|~int_leq(int_one,X4)),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,plain,(a(X3,X3)=real_one|~epred1_2(X1,X2)|~int_leq(X3,X2)|~int_leq(int_one,X3)),inference(split_conjunct,[status(thm)],[70])).
% cnf(73,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)],[70])).
% cnf(74,plain,(int_leq(X1,X1)),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(91,plain,(X1=X2|int_less(X1,X2)|int_less(X2,X1)),inference(spm,[status(thm)],[22,30,theory(equality)])).
% cnf(92,negated_conjecture,(epred1_2(X1,esk3_0)|~int_leq(X1,n)|~int_leq(int_one,esk3_0)|~int_leq(int_one,X1)),inference(spm,[status(thm)],[54,63,theory(equality)])).
% cnf(93,negated_conjecture,(epred1_2(X1,esk2_0)|~int_leq(X1,n)|~int_leq(int_one,esk2_0)|~int_leq(int_one,X1)),inference(spm,[status(thm)],[54,65,theory(equality)])).
% cnf(98,negated_conjecture,(epred1_2(X1,esk3_0)|~int_leq(X1,n)|$false|~int_leq(int_one,X1)),inference(rw,[status(thm)],[92,64,theory(equality)])).
% cnf(99,negated_conjecture,(epred1_2(X1,esk3_0)|~int_leq(X1,n)|~int_leq(int_one,X1)),inference(cn,[status(thm)],[98,theory(equality)])).
% cnf(100,negated_conjecture,(epred1_2(X1,esk2_0)|~int_leq(X1,n)|$false|~int_leq(int_one,X1)),inference(rw,[status(thm)],[93,66,theory(equality)])).
% cnf(101,negated_conjecture,(epred1_2(X1,esk2_0)|~int_leq(X1,n)|~int_leq(int_one,X1)),inference(cn,[status(thm)],[100,theory(equality)])).
% cnf(124,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)],[73,45,theory(equality)])).
% cnf(128,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)],[124,theory(equality)])).
% cnf(132,plain,(a(plus(X1,esk1_2(X2,X3)),X1)=real_zero|X3!=X4|~epred1_2(X4,X2)|~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)],[71,45,theory(equality)])).
% cnf(136,plain,(a(plus(X1,esk1_2(X2,X3)),X1)=real_zero|~epred1_2(X3,X2)|~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)],[132,theory(equality)])).
% cnf(168,negated_conjecture,(epred1_2(esk2_0,esk3_0)|~int_leq(int_one,esk2_0)),inference(spm,[status(thm)],[99,65,theory(equality)])).
% cnf(175,negated_conjecture,(epred1_2(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[168,66,theory(equality)])).
% cnf(176,negated_conjecture,(epred1_2(esk2_0,esk3_0)),inference(cn,[status(thm)],[175,theory(equality)])).
% cnf(202,negated_conjecture,(epred1_2(esk3_0,esk2_0)|~int_leq(int_one,esk3_0)),inference(spm,[status(thm)],[101,63,theory(equality)])).
% cnf(208,negated_conjecture,(epred1_2(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[202,64,theory(equality)])).
% cnf(209,negated_conjecture,(epred1_2(esk3_0,esk2_0)),inference(cn,[status(thm)],[208,theory(equality)])).
% cnf(219,plain,(a(X1,X1)=real_one|~int_leq(int_one,X1)|~int_leq(X1,esk2_0)),inference(spm,[status(thm)],[72,209,theory(equality)])).
% cnf(891,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)],[128,44])).
% cnf(896,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)],[891,45,theory(equality)])).
% cnf(897,plain,(a(X1,X2)=real_zero|~epred1_2(X1,X2)|~int_less(X1,X2)|~int_leq(int_one,X1)|$false),inference(rw,[status(thm)],[896,74,theory(equality)])).
% cnf(898,plain,(a(X1,X2)=real_zero|~epred1_2(X1,X2)|~int_less(X1,X2)|~int_leq(int_one,X1)),inference(cn,[status(thm)],[897,theory(equality)])).
% cnf(1107,plain,(a(plus(X1,esk1_2(X2,X3)),X1)=real_zero|~epred1_2(X3,X2)|~int_less(X2,X3)|~int_leq(int_one,X1)|~int_leq(X1,X2)),inference(csr,[status(thm)],[136,44])).
% cnf(1112,plain,(a(X2,X1)=real_zero|~epred1_2(X2,X1)|~int_less(X1,X2)|~int_leq(int_one,X1)|~int_leq(X1,X1)),inference(spm,[status(thm)],[1107,45,theory(equality)])).
% cnf(1113,plain,(a(X2,X1)=real_zero|~epred1_2(X2,X1)|~int_less(X1,X2)|~int_leq(int_one,X1)|$false),inference(rw,[status(thm)],[1112,74,theory(equality)])).
% cnf(1114,plain,(a(X2,X1)=real_zero|~epred1_2(X2,X1)|~int_less(X1,X2)|~int_leq(int_one,X1)),inference(cn,[status(thm)],[1113,theory(equality)])).
% cnf(14571,negated_conjecture,(esk3_0=esk2_0|~epred1_2(esk2_0,esk3_0)|~int_less(esk2_0,esk3_0)|~int_leq(int_one,esk2_0)),inference(spm,[status(thm)],[60,898,theory(equality)])).
% cnf(14586,negated_conjecture,(esk3_0=esk2_0|$false|~int_less(esk2_0,esk3_0)|~int_leq(int_one,esk2_0)),inference(rw,[status(thm)],[14571,176,theory(equality)])).
% cnf(14587,negated_conjecture,(esk3_0=esk2_0|$false|~int_less(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[14586,66,theory(equality)])).
% cnf(14588,negated_conjecture,(esk3_0=esk2_0|~int_less(esk2_0,esk3_0)),inference(cn,[status(thm)],[14587,theory(equality)])).
% cnf(18535,negated_conjecture,(esk3_0=esk2_0|~epred1_2(esk2_0,esk3_0)|~int_less(esk3_0,esk2_0)|~int_leq(int_one,esk3_0)),inference(spm,[status(thm)],[60,1114,theory(equality)])).
% cnf(18550,negated_conjecture,(esk3_0=esk2_0|$false|~int_less(esk3_0,esk2_0)|~int_leq(int_one,esk3_0)),inference(rw,[status(thm)],[18535,176,theory(equality)])).
% cnf(18551,negated_conjecture,(esk3_0=esk2_0|$false|~int_less(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[18550,64,theory(equality)])).
% cnf(18552,negated_conjecture,(esk3_0=esk2_0|~int_less(esk3_0,esk2_0)),inference(cn,[status(thm)],[18551,theory(equality)])).
% cnf(18575,negated_conjecture,(esk3_0=esk2_0|int_less(esk2_0,esk3_0)),inference(spm,[status(thm)],[18552,91,theory(equality)])).
% cnf(18593,negated_conjecture,(esk3_0=esk2_0),inference(csr,[status(thm)],[18575,14588])).
% cnf(18896,negated_conjecture,(a(esk2_0,esk2_0)!=real_one|esk3_0!=esk2_0),inference(rw,[status(thm)],[61,18593,theory(equality)])).
% cnf(18897,negated_conjecture,(a(esk2_0,esk2_0)!=real_one|$false),inference(rw,[status(thm)],[18896,18593,theory(equality)])).
% cnf(18898,negated_conjecture,(a(esk2_0,esk2_0)!=real_one),inference(cn,[status(thm)],[18897,theory(equality)])).
% cnf(18906,plain,(~int_leq(int_one,esk2_0)|~int_leq(esk2_0,esk2_0)),inference(spm,[status(thm)],[18898,219,theory(equality)])).
% cnf(18917,plain,($false|~int_leq(esk2_0,esk2_0)),inference(rw,[status(thm)],[18906,66,theory(equality)])).
% cnf(18918,plain,($false|$false),inference(rw,[status(thm)],[18917,74,theory(equality)])).
% cnf(18919,plain,($false),inference(cn,[status(thm)],[18918,theory(equality)])).
% cnf(18920,plain,($false),18919,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2305
% # ...of these trivial : 1
% # ...subsumed : 1613
% # ...remaining for further processing: 691
% # Other redundant clauses eliminated : 44
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 75
% # Backward-rewritten : 222
% # Generated clauses : 12605
% # ...of the previous two non-trivial : 11012
% # Contextual simplify-reflections : 1976
% # Paramodulations : 12531
% # Factorizations : 24
% # Equation resolutions : 50
% # Current number of processed clauses: 365
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 349
% # Current number of unprocessed clauses: 4130
% # ...number of literals in the above : 23109
% # Clause-clause subsumption calls (NU) : 24049
% # Rec. Clause-clause subsumption calls : 12786
% # Unit Clause-clause subsumption calls : 54
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 22
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 137 leaves, 1.69+/-1.839 terms/leaf
% # Paramod-from index: 75 leaves, 1.15+/-0.422 terms/leaf
% # Paramod-into index: 117 leaves, 1.47+/-1.188 terms/leaf
% # -------------------------------------------------
% # User time : 0.609 s
% # System time : 0.018 s
% # Total time : 0.627 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.97 CPU 1.07 WC
% FINAL PrfWatch: 0.97 CPU 1.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP9894/SWV491+4.tptp
%
%------------------------------------------------------------------------------