TSTP Solution File: SWV466+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV466+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:32 EDT 2022
% Result : Theorem 11.47s 2.85s
% Output : CNFRefutation 11.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 74 ( 47 unt; 10 nHn; 69 RR)
% Number of literals : 151 ( 57 equ; 82 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-2 aty)
% Number of variables : 99 ( 50 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_110,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk6_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_110) ).
cnf(i_0_111,negated_conjecture,
index(pendack,host(esk6_0)) = host(esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_111) ).
cnf(i_0_87,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_87) ).
cnf(i_0_4,plain,
leq(host(X1),nbr_proc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_4) ).
cnf(i_0_123,plain,
( leq(host(X1),host(X2))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5)
| ~ leq(index(pendack,host(X1)),index(pendack,host(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_123) ).
cnf(i_0_100,negated_conjecture,
index(pendack,host(esk12_0)) = host(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_100) ).
cnf(i_0_101,negated_conjecture,
index(status,host(esk12_0)) = elec_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_101) ).
cnf(i_0_105,negated_conjecture,
setIn(esk12_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_105) ).
cnf(i_0_125,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_3(X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_125) ).
cnf(i_0_115,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_115) ).
cnf(i_0_112,negated_conjecture,
index(status,host(esk6_0)) = elec_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_112) ).
cnf(i_0_114,negated_conjecture,
setIn(esk6_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_114) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_56) ).
cnf(i_0_102,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_102) ).
cnf(i_0_14,plain,
m_Ack(X1,X2) != m_Ldr(X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_14) ).
cnf(i_0_104,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk12_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_104) ).
cnf(i_0_99,negated_conjecture,
s(index(pendack,host(esk12_0))) = host(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_99) ).
cnf(i_0_124,plain,
( host(X1) != host(X2)
| index(status,host(X1)) != elec_2
| index(status,host(X3)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X3,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Ack(X3,X2),queue(host(X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_124) ).
cnf(i_0_52,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_52) ).
cnf(i_0_116,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_116) ).
cnf(i_0_106,negated_conjecture,
host(esk12_0) != host(esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_106) ).
cnf(i_0_134,plain,
( host(X1) != host(X2)
| ~ epred1_3(X3,X4,X5)
| ~ elem(m_Down(X1),queue(host(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_134) ).
cnf(i_0_93,plain,
( X1 = s(X2)
| leq(X1,X2)
| ~ leq(X1,s(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jnlgko1r/lgb.p',i_0_93) ).
cnf(c_0_158,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk6_0))),
i_0_110 ).
cnf(c_0_159,negated_conjecture,
index(pendack,host(esk6_0)) = host(esk7_0),
i_0_111 ).
cnf(c_0_160,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_87 ).
cnf(c_0_161,negated_conjecture,
leq(nbr_proc,host(esk7_0)),
inference(rw,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_162,plain,
leq(host(X1),nbr_proc),
i_0_4 ).
cnf(c_0_163,plain,
( leq(host(X1),host(X2))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5)
| ~ leq(index(pendack,host(X1)),index(pendack,host(X2))) ),
i_0_123 ).
cnf(c_0_164,negated_conjecture,
index(pendack,host(esk12_0)) = host(esk10_0),
i_0_100 ).
cnf(c_0_165,negated_conjecture,
index(status,host(esk12_0)) = elec_2,
i_0_101 ).
cnf(c_0_166,negated_conjecture,
setIn(esk12_0,alive),
i_0_105 ).
cnf(c_0_167,negated_conjecture,
host(esk7_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_162])]) ).
cnf(c_0_168,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_3(X3,X4,X5) ),
i_0_125 ).
cnf(c_0_169,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
i_0_115 ).
cnf(c_0_170,negated_conjecture,
( leq(host(esk12_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ leq(host(esk10_0),index(pendack,host(X1)))
| ~ epred1_3(X2,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_165]),c_0_166])]) ).
cnf(c_0_171,negated_conjecture,
index(pendack,host(esk6_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_159,c_0_167]) ).
cnf(c_0_172,negated_conjecture,
index(status,host(esk6_0)) = elec_2,
i_0_112 ).
cnf(c_0_173,negated_conjecture,
setIn(esk6_0,alive),
i_0_114 ).
cnf(c_0_174,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_175,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0))),
i_0_102 ).
cnf(c_0_176,plain,
m_Ack(X1,X2) != m_Ldr(X3),
i_0_14 ).
cnf(c_0_177,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk12_0)))),
i_0_104 ).
cnf(c_0_178,negated_conjecture,
s(index(pendack,host(esk12_0))) = host(esk11_0),
i_0_99 ).
cnf(c_0_179,negated_conjecture,
( leq(index(pendack,host(X1)),host(X2))
| leq(host(X2),host(X1))
| index(status,host(X1)) != elec_2
| index(status,host(X2)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive) ),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_180,negated_conjecture,
( leq(host(esk12_0),host(esk6_0))
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172]),c_0_173]),c_0_162])]) ).
cnf(c_0_181,plain,
( host(X1) != host(X2)
| index(status,host(X1)) != elec_2
| index(status,host(X3)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X3,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Ack(X3,X2),queue(host(X3))) ),
i_0_124 ).
cnf(c_0_182,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_176]) ).
cnf(c_0_183,negated_conjecture,
leq(nbr_proc,s(host(esk10_0))),
inference(rw,[status(thm)],[c_0_177,c_0_164]) ).
cnf(c_0_184,negated_conjecture,
s(host(esk10_0)) = host(esk11_0),
inference(rw,[status(thm)],[c_0_178,c_0_164]) ).
cnf(c_0_185,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
i_0_52 ).
cnf(c_0_186,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_116 ).
cnf(c_0_187,negated_conjecture,
( leq(host(X1),host(esk12_0))
| leq(host(esk10_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_164]),c_0_165]),c_0_166])]) ).
cnf(c_0_188,negated_conjecture,
leq(host(esk12_0),host(esk6_0)),
inference(spm,[status(thm)],[c_0_180,c_0_169]) ).
cnf(c_0_189,negated_conjecture,
host(esk12_0) != host(esk6_0),
i_0_106 ).
cnf(c_0_190,plain,
( index(status,host(X1)) != elec_2
| host(X1) != host(esk10_0)
| ~ setIn(X1,alive)
| ~ epred1_3(X2,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_165]),c_0_166])]) ).
cnf(c_0_191,negated_conjecture,
leq(nbr_proc,host(esk11_0)),
inference(rw,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_192,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_185]) ).
cnf(c_0_193,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_186,c_0_169]) ).
cnf(c_0_194,negated_conjecture,
( leq(host(esk10_0),host(esk6_0))
| leq(host(esk6_0),host(esk12_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_172]),c_0_173])]) ).
cnf(c_0_195,plain,
~ leq(host(esk6_0),host(esk12_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_188]),c_0_189]) ).
cnf(c_0_196,negated_conjecture,
( host(esk10_0) != host(esk6_0)
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_173]),c_0_172])]) ).
cnf(c_0_197,plain,
host(esk11_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_191]),c_0_162])]) ).
cnf(c_0_198,plain,
( host(X1) != host(X2)
| ~ epred1_3(X3,X4,X5)
| ~ elem(m_Down(X1),queue(host(X2))) ),
i_0_134 ).
cnf(c_0_199,plain,
elem(m_Down(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_192,c_0_193]) ).
cnf(c_0_200,negated_conjecture,
leq(host(esk10_0),host(esk6_0)),
inference(sr,[status(thm)],[c_0_194,c_0_195]) ).
cnf(c_0_201,negated_conjecture,
host(esk10_0) != host(esk6_0),
inference(spm,[status(thm)],[c_0_196,c_0_169]) ).
cnf(c_0_202,plain,
( X1 = s(X2)
| leq(X1,X2)
| ~ leq(X1,s(X2)) ),
i_0_93 ).
cnf(c_0_203,negated_conjecture,
s(host(esk10_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_184,c_0_197]) ).
cnf(c_0_204,plain,
( host(esk6_0) != nbr_proc
| ~ epred1_3(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_198,c_0_199]),c_0_167]) ).
cnf(c_0_205,plain,
~ leq(host(esk6_0),host(esk10_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_200]),c_0_201]) ).
cnf(c_0_206,plain,
( X1 = nbr_proc
| leq(X1,host(esk10_0))
| ~ leq(X1,nbr_proc) ),
inference(spm,[status(thm)],[c_0_202,c_0_203]) ).
cnf(c_0_207,negated_conjecture,
host(esk6_0) != nbr_proc,
inference(spm,[status(thm)],[c_0_204,c_0_169]) ).
cnf(c_0_208,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_206]),c_0_162])]),c_0_207]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV466+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 20:16:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.47/2.85 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.47/2.85 # No SInE strategy applied
% 11.47/2.85 # Trying AutoSched0 for 150 seconds
% 11.47/2.85 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 11.47/2.85 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.47/2.85 #
% 11.47/2.85 # Preprocessing time : 0.027 s
% 11.47/2.85
% 11.47/2.85 # Proof found!
% 11.47/2.85 # SZS status Theorem
% 11.47/2.85 # SZS output start CNFRefutation
% See solution above
% 11.47/2.85 # Training examples: 0 positive, 0 negative
% 11.47/2.85
% 11.47/2.85 # -------------------------------------------------
% 11.47/2.85 # User time : 0.316 s
% 11.47/2.85 # System time : 0.016 s
% 11.47/2.85 # Total time : 0.332 s
% 11.47/2.85 # Maximum resident set size: 7128 pages
% 11.47/2.85
%------------------------------------------------------------------------------