TSTP Solution File: SWV463+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV463+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 17:47:31 EDT 2022
% Result : Theorem 15.68s 3.47s
% Output : CNFRefutation 15.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 30
% Syntax : Number of clauses : 101 ( 54 unt; 13 nHn; 91 RR)
% Number of literals : 191 ( 59 equ; 98 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 163 ( 81 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_105,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk13_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_105) ).
cnf(i_0_101,negated_conjecture,
index(pendack,host(esk13_0)) = host(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_101) ).
cnf(i_0_100,negated_conjecture,
s(index(pendack,host(esk13_0))) = host(esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_100) ).
cnf(i_0_87,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_87) ).
cnf(i_0_4,plain,
leq(host(X1),nbr_proc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_4) ).
cnf(i_0_90,plain,
( leq(s(X1),s(X2))
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_90) ).
cnf(i_0_128,plain,
( index(elid,host(X1)) = X1
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ epred1_4(X2,X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_128) ).
cnf(i_0_113,negated_conjecture,
index(status,host(esk7_0)) = elec_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_113) ).
cnf(i_0_114,negated_conjecture,
index(elid,host(esk7_0)) = esk6_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_114) ).
cnf(i_0_115,negated_conjecture,
setIn(esk7_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_115) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_56) ).
cnf(i_0_103,negated_conjecture,
elem(m_Ack(esk13_0,esk11_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_103) ).
cnf(i_0_14,plain,
m_Ack(X1,X2) != m_Ldr(X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_14) ).
cnf(i_0_116,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_116) ).
cnf(i_0_91,plain,
( leq(X1,s(X2))
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_91) ).
cnf(i_0_111,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk7_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_111) ).
cnf(i_0_112,negated_conjecture,
index(pendack,host(esk7_0)) = host(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_112) ).
cnf(i_0_133,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ leq(host(X5),host(X6))
| ~ elem(m_Ack(X6,X5),queue(host(X7))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_133) ).
cnf(i_0_82,plain,
~ leq(s(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_82) ).
cnf(i_0_84,plain,
( leq(X1,X2)
| leq(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_84) ).
cnf(i_0_126,plain,
( leq(host(X1),host(X2))
| leq(index(pendack,host(X2)),host(X1))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_4(X3,X4,X5,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_126) ).
cnf(i_0_102,negated_conjecture,
index(status,host(esk13_0)) = elec_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_102) ).
cnf(i_0_106,negated_conjecture,
setIn(esk13_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_106) ).
cnf(i_0_107,negated_conjecture,
host(esk7_0) != host(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_107) ).
cnf(i_0_125,plain,
( host(X1) != host(X2)
| index(status,host(X1)) != elec_2
| index(status,host(X3)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X3,alive)
| ~ epred1_4(X4,X5,X6,X7)
| ~ elem(m_Ack(X3,X2),queue(host(X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_125) ).
cnf(i_0_52,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_52) ).
cnf(i_0_117,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_117) ).
cnf(i_0_89,plain,
( leq(X1,X2)
| ~ leq(s(X1),s(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_89) ).
cnf(i_0_92,plain,
( leq(X1,s(X2))
| X1 != s(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_92) ).
cnf(i_0_93,plain,
( X1 = s(X2)
| leq(X1,X2)
| ~ leq(X1,s(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4pafj6d/input.p',i_0_93) ).
cnf(c_0_164,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk13_0)))),
i_0_105 ).
cnf(c_0_165,negated_conjecture,
index(pendack,host(esk13_0)) = host(esk11_0),
i_0_101 ).
cnf(c_0_166,negated_conjecture,
s(index(pendack,host(esk13_0))) = host(esk12_0),
i_0_100 ).
cnf(c_0_167,negated_conjecture,
leq(nbr_proc,s(host(esk11_0))),
inference(rw,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_168,negated_conjecture,
s(host(esk11_0)) = host(esk12_0),
inference(rw,[status(thm)],[c_0_166,c_0_165]) ).
cnf(c_0_169,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_87 ).
cnf(c_0_170,negated_conjecture,
leq(nbr_proc,host(esk12_0)),
inference(rw,[status(thm)],[c_0_167,c_0_168]) ).
cnf(c_0_171,plain,
leq(host(X1),nbr_proc),
i_0_4 ).
cnf(c_0_172,plain,
( leq(s(X1),s(X2))
| ~ leq(X1,X2) ),
i_0_90 ).
cnf(c_0_173,plain,
host(esk12_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171])]) ).
cnf(c_0_174,plain,
( index(elid,host(X1)) = X1
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ epred1_4(X2,X3,X4,X5) ),
i_0_128 ).
cnf(c_0_175,negated_conjecture,
index(status,host(esk7_0)) = elec_2,
i_0_113 ).
cnf(c_0_176,negated_conjecture,
index(elid,host(esk7_0)) = esk6_0,
i_0_114 ).
cnf(c_0_177,negated_conjecture,
setIn(esk7_0,alive),
i_0_115 ).
cnf(c_0_178,plain,
( s(X1) = s(X2)
| ~ leq(s(X1),s(X2))
| ~ leq(X2,X1) ),
inference(spm,[status(thm)],[c_0_169,c_0_172]) ).
cnf(c_0_179,negated_conjecture,
s(host(esk11_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_168,c_0_173]) ).
cnf(c_0_180,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_181,negated_conjecture,
elem(m_Ack(esk13_0,esk11_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0))),
i_0_103 ).
cnf(c_0_182,plain,
m_Ack(X1,X2) != m_Ldr(X3),
i_0_14 ).
cnf(c_0_183,negated_conjecture,
( esk6_0 = esk7_0
| ~ epred1_4(X1,X2,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_176]),c_0_177])]) ).
cnf(c_0_184,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
i_0_116 ).
cnf(c_0_185,negated_conjecture,
( s(X1) = nbr_proc
| ~ leq(nbr_proc,s(X1))
| ~ leq(X1,host(esk11_0)) ),
inference(spm,[status(thm)],[c_0_178,c_0_179]) ).
cnf(c_0_186,plain,
( leq(X1,s(X2))
| ~ leq(X1,X2) ),
i_0_91 ).
cnf(c_0_187,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk7_0))),
i_0_111 ).
cnf(c_0_188,negated_conjecture,
index(pendack,host(esk7_0)) = host(esk8_0),
i_0_112 ).
cnf(c_0_189,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ leq(host(X5),host(X6))
| ~ elem(m_Ack(X6,X5),queue(host(X7))) ),
i_0_133 ).
cnf(c_0_190,negated_conjecture,
elem(m_Ack(esk13_0,esk11_0),queue(host(esk13_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_181]),c_0_182]) ).
cnf(c_0_191,negated_conjecture,
esk6_0 = esk7_0,
inference(spm,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_192,plain,
~ leq(s(X1),X1),
i_0_82 ).
cnf(c_0_193,plain,
( s(X1) = nbr_proc
| ~ leq(X1,host(esk11_0))
| ~ leq(nbr_proc,X1) ),
inference(spm,[status(thm)],[c_0_185,c_0_186]) ).
cnf(c_0_194,negated_conjecture,
leq(nbr_proc,host(esk8_0)),
inference(rw,[status(thm)],[c_0_187,c_0_188]) ).
cnf(c_0_195,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ leq(host(esk11_0),host(esk13_0)) ),
inference(spm,[status(thm)],[c_0_189,c_0_190]) ).
cnf(c_0_196,negated_conjecture,
epred1_4(esk5_0,esk7_0,esk8_0,esk7_0),
inference(rw,[status(thm)],[c_0_184,c_0_191]) ).
cnf(c_0_197,plain,
( ~ leq(X1,host(esk11_0))
| ~ leq(nbr_proc,X1) ),
inference(spm,[status(thm)],[c_0_192,c_0_193]) ).
cnf(c_0_198,plain,
( leq(X1,X2)
| leq(X2,X1) ),
i_0_84 ).
cnf(c_0_199,plain,
( leq(host(X1),host(X2))
| leq(index(pendack,host(X2)),host(X1))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_4(X3,X4,X5,X6) ),
i_0_126 ).
cnf(c_0_200,plain,
host(esk8_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_194]),c_0_171])]) ).
cnf(c_0_201,negated_conjecture,
~ leq(host(esk11_0),host(esk13_0)),
inference(spm,[status(thm)],[c_0_195,c_0_196]) ).
cnf(c_0_202,plain,
( leq(host(esk11_0),X1)
| ~ leq(nbr_proc,X1) ),
inference(spm,[status(thm)],[c_0_197,c_0_198]) ).
cnf(c_0_203,negated_conjecture,
( leq(host(X1),host(esk7_0))
| leq(nbr_proc,host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_199,c_0_175]),c_0_188]),c_0_177])]),c_0_200]) ).
cnf(c_0_204,negated_conjecture,
index(status,host(esk13_0)) = elec_2,
i_0_102 ).
cnf(c_0_205,negated_conjecture,
setIn(esk13_0,alive),
i_0_106 ).
cnf(c_0_206,plain,
~ leq(nbr_proc,host(esk13_0)),
inference(spm,[status(thm)],[c_0_201,c_0_202]) ).
cnf(c_0_207,negated_conjecture,
( leq(host(esk13_0),host(esk7_0))
| ~ epred1_4(X1,X2,X3,X4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_203,c_0_204]),c_0_205])]),c_0_206]) ).
cnf(c_0_208,negated_conjecture,
leq(host(esk13_0),host(esk7_0)),
inference(spm,[status(thm)],[c_0_207,c_0_196]) ).
cnf(c_0_209,negated_conjecture,
host(esk7_0) != host(esk13_0),
i_0_107 ).
cnf(c_0_210,plain,
( host(X1) != host(X2)
| index(status,host(X1)) != elec_2
| index(status,host(X3)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X3,alive)
| ~ epred1_4(X4,X5,X6,X7)
| ~ elem(m_Ack(X3,X2),queue(host(X3))) ),
i_0_125 ).
cnf(c_0_211,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
i_0_52 ).
cnf(c_0_212,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X2,X3,X1) ),
i_0_117 ).
cnf(c_0_213,negated_conjecture,
( leq(host(X1),host(esk13_0))
| leq(host(esk11_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_199,c_0_204]),c_0_165]),c_0_205])]) ).
cnf(c_0_214,plain,
~ leq(host(esk7_0),host(esk13_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_208]),c_0_209]) ).
cnf(c_0_215,plain,
( index(status,host(X1)) != elec_2
| host(X1) != host(esk11_0)
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_190]),c_0_204]),c_0_205])]) ).
cnf(c_0_216,plain,
( leq(X1,X2)
| ~ leq(s(X1),s(X2)) ),
i_0_89 ).
cnf(c_0_217,plain,
( leq(X1,s(X2))
| X1 != s(X2) ),
i_0_92 ).
cnf(c_0_218,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_211]) ).
cnf(c_0_219,plain,
cons(m_Ack(esk7_0,esk8_0),esk5_0) = queue(host(esk7_0)),
inference(spm,[status(thm)],[c_0_212,c_0_196]) ).
cnf(c_0_220,negated_conjecture,
( leq(host(esk11_0),host(esk7_0))
| ~ epred1_4(X1,X2,X3,X4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_213,c_0_175]),c_0_177])]),c_0_214]) ).
cnf(c_0_221,negated_conjecture,
( host(esk11_0) != host(esk7_0)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_175]),c_0_177])]) ).
cnf(c_0_222,plain,
( X1 = s(X2)
| leq(X1,X2)
| ~ leq(X1,s(X2)) ),
i_0_93 ).
cnf(c_0_223,plain,
( leq(s(X1),s(X2))
| leq(X2,X1) ),
inference(spm,[status(thm)],[c_0_216,c_0_198]) ).
cnf(c_0_224,plain,
( leq(X1,X2)
| s(X1) != s(X2) ),
inference(spm,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_225,plain,
elem(m_Ack(esk7_0,esk8_0),queue(host(esk7_0))),
inference(spm,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_226,negated_conjecture,
leq(host(esk11_0),host(esk7_0)),
inference(spm,[status(thm)],[c_0_220,c_0_196]) ).
cnf(c_0_227,negated_conjecture,
host(esk11_0) != host(esk7_0),
inference(spm,[status(thm)],[c_0_221,c_0_196]) ).
cnf(c_0_228,plain,
( leq(X1,host(esk11_0))
| ~ leq(s(X1),nbr_proc) ),
inference(spm,[status(thm)],[c_0_216,c_0_179]) ).
cnf(c_0_229,plain,
( leq(s(X1),X2)
| leq(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224]) ).
cnf(c_0_230,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ leq(nbr_proc,host(esk7_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_225]),c_0_200]) ).
cnf(c_0_231,plain,
~ leq(host(esk7_0),host(esk11_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_226]),c_0_227]) ).
cnf(c_0_232,plain,
( leq(X1,host(esk11_0))
| leq(nbr_proc,X1) ),
inference(spm,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_233,negated_conjecture,
~ leq(nbr_proc,host(esk7_0)),
inference(spm,[status(thm)],[c_0_230,c_0_196]) ).
cnf(c_0_234,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV463+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 01:04:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.68/3.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 15.68/3.47 # Version: 2.1pre011
% 15.68/3.47 # Preprocessing time : 0.023 s
% 15.68/3.47
% 15.68/3.47 # Proof found!
% 15.68/3.47 # SZS status Theorem
% 15.68/3.47 # SZS output start CNFRefutation
% See solution above
% 15.68/3.47 # Proof object total steps : 101
% 15.68/3.47 # Proof object clause steps : 71
% 15.68/3.47 # Proof object formula steps : 30
% 15.68/3.47 # Proof object conjectures : 46
% 15.68/3.47 # Proof object clause conjectures : 33
% 15.68/3.47 # Proof object formula conjectures : 13
% 15.68/3.47 # Proof object initial clauses used : 30
% 15.68/3.47 # Proof object initial formulas used : 30
% 15.68/3.47 # Proof object generating inferences : 34
% 15.68/3.47 # Proof object simplifying inferences : 38
% 15.68/3.47 # Training examples: 0 positive, 0 negative
% 15.68/3.47 # Parsed axioms : 130
% 15.68/3.47 # Removed by relevancy pruning/SinE : 0
% 15.68/3.47 # Initial clauses : 130
% 15.68/3.47 # Removed in clause preprocessing : 0
% 15.68/3.47 # Initial clauses in saturation : 130
% 15.68/3.47 # Processed clauses : 4135
% 15.68/3.47 # ...of these trivial : 78
% 15.68/3.47 # ...subsumed : 2824
% 15.68/3.47 # ...remaining for further processing : 1233
% 15.68/3.47 # Other redundant clauses eliminated : 7
% 15.68/3.47 # Clauses deleted for lack of memory : 0
% 15.68/3.47 # Backward-subsumed : 63
% 15.68/3.47 # Backward-rewritten : 31
% 15.68/3.47 # Generated clauses : 54061
% 15.68/3.47 # ...of the previous two non-trivial : 42386
% 15.68/3.47 # Contextual simplify-reflections : 845
% 15.68/3.47 # Paramodulations : 53814
% 15.68/3.47 # Factorizations : 172
% 15.68/3.47 # Equation resolutions : 73
% 15.68/3.47 # Propositional unsat checks : 0
% 15.68/3.47 # Propositional unsat check successes : 0
% 15.68/3.47 # Current number of processed clauses : 1133
% 15.68/3.47 # Positive orientable unit clauses : 91
% 15.68/3.47 # Positive unorientable unit clauses: 0
% 15.68/3.47 # Negative unit clauses : 111
% 15.68/3.47 # Non-unit-clauses : 931
% 15.68/3.47 # Current number of unprocessed clauses: 35507
% 15.68/3.47 # ...number of literals in the above : 135804
% 15.68/3.47 # Current number of archived formulas : 0
% 15.68/3.47 # Current number of archived clauses : 96
% 15.68/3.47 # Clause-clause subsumption calls (NU) : 384184
% 15.68/3.47 # Rec. Clause-clause subsumption calls : 242700
% 15.68/3.47 # Non-unit clause-clause subsumptions : 2362
% 15.68/3.47 # Unit Clause-clause subsumption calls : 6546
% 15.68/3.47 # Rewrite failures with RHS unbound : 0
% 15.68/3.47 # BW rewrite match attempts : 100
% 15.68/3.47 # BW rewrite match successes : 21
% 15.68/3.47 # Condensation attempts : 0
% 15.68/3.47 # Condensation successes : 0
% 15.68/3.47 # Termbank termtop insertions : 745470
% 15.68/3.47
% 15.68/3.47 # -------------------------------------------------
% 15.68/3.47 # User time : 0.782 s
% 15.68/3.47 # System time : 0.029 s
% 15.68/3.47 # Total time : 0.811 s
% 15.68/3.47 # ...preprocessing : 0.023 s
% 15.68/3.47 # ...main loop : 0.788 s
% 15.68/3.47 # Maximum resident set size: 36128 pages
% 15.68/3.47
%------------------------------------------------------------------------------