0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.03	% Command    : run_vampire %s %d THM
0.08/0.35	% Computer   : n008.cluster.edu
0.08/0.35	% Model      : x86_64 x86_64
0.08/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.35	% Memory     : 8046.5625MB
0.08/0.35	% OS         : Linux 6.8.0-71-generic
0.08/0.35	% CPULimit   : 1440
0.08/0.35	% WCLimit    : 180
0.08/0.35	% DateTime   : Mon Jul 27 09:54:27 UTC 2026
0.08/0.36	% CPUTime    : 
0.08/0.39	This is a FOF_ problem
0.08/0.39	Running first-order theorem proving
0.08/0.39	Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 180 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.17/0.45	% (967381)Running in auto input_syntax mode. Trying TPTP
0.17/0.45	% (967386)lrs+1011_32_sil=2000:tgt=full:alpa=true:random_seed=467061546:st=5:i=107:sd=1:ss=included:er=filter_1799 on theBenchmark for (1799ds/107Mi)
0.17/0.49	% (967381)Running in auto input_syntax mode. Trying TPTP
0.17/0.49	% (967383)lrs+1011_1_sp=occurrence:random_seed=4007875269:st=6:sd=4:ss=included_1799 on theBenchmark for (1799ds/0Mi)
0.17/0.49	% (967381)Running in auto input_syntax mode. Trying TPTP
0.17/0.49	% (967384)dis+1010_16_tgt=full:drc=ordering:sp=reverse_frequency:nwc=1:random_seed=4204287127:i=261632:kws=inv_arity_squared:ins=1:av=off:fsd=on_1799 on theBenchmark for (1799ds/261632Mi)
0.17/0.49	% (967381)Running in auto input_syntax mode. Trying TPTP
0.17/0.49	% (967385)lrs+10_1_sp=unary_first:urr=on:s2agt=32:random_seed=3320287737:s2a=on:i=272356:sd=1:bd=all:ss=included_1799 on theBenchmark for (1799ds/272356Mi)
0.17/0.49	% (967381)Running in auto input_syntax mode. Trying TPTP
0.17/0.49	% (967388)ott+1011_2_sil=4000:lsd=20:rnwc=on:rp=on:sac=on:newcnf=on:random_seed=2789059099:i=132:kws=arity:er=filter_1799 on theBenchmark for (1799ds/132Mi)
0.17/0.49	% (967381)Running in auto input_syntax mode. Trying TPTP
0.17/0.49	% (967389)dis+1011_1_slsqr=8,1:sil=2000:spb=units:fd=off:kmz=on:flr=on:sac=on:slsq=on:random_seed=1534454362:st=2:i=121:sd=30:afp=100000:aac=none:ep=RS:ss=axioms:sgt=10_1799 on theBenchmark for (1799ds/121Mi)
0.17/0.49	% (967386)Instruction limit reached! 
0.17/0.49	% (967386)------------------------------
0.17/0.49	% (967386)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200)
0.17/0.49	% (967386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.17/0.49	% (967386)Termination reason: Instruction limit
0.17/0.49	% (967386)Termination phase: Saturation
0.17/0.49	
0.17/0.49	% (967386)Time elapsed: 0.036 s
0.17/0.49	% (967386)Peak memory usage: 12 MB
0.17/0.49	% (967386)Instructions burned: 111 (million)
0.75/0.51	% (967385)First to succeed.
0.75/0.51	% (967381)Running in auto input_syntax mode. Trying TPTP
0.75/0.51	% (967387)lrs+10_2:3_to=lpo:sil=16000:sp=arity:random_seed=1972594104:i=114:bd=all:ss=axioms:sgt=4_1799 on theBenchmark for (1799ds/114Mi)
0.75/0.52	% (967385)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-967381"
0.75/0.52	% (967383)Also succeeded, but the first one will report.
0.75/0.52	% (967381)Running in auto input_syntax mode. Trying TPTP
0.75/0.52	% (967385)Refutation found. Thanks to Tanya!
0.75/0.52	% SZS status Theorem for theBenchmark
0.75/0.52	% SZS output start Proof for theBenchmark
0.75/0.52	fof(f659,plain,(
0.75/0.52	  $false),
0.75/0.52	  inference(avatar_sat_refutation,[],[f233,f244,f657])).
0.75/0.52	fof(f657,plain,(
0.75/0.52	  ~spl8_9),
0.75/0.52	  inference(avatar_contradiction_clause,[],[f656])).
0.75/0.52	fof(f656,plain,(
0.75/0.52	  $false | ~spl8_9),
0.75/0.52	  inference(subsumption_resolution,[],[f655,f572])).
0.75/0.52	fof(f572,plain,(
0.75/0.52	  ~elem(m_Down(sK7),queue(host(sK2))) | ~spl8_9),
0.75/0.52	  inference(unit_resulting_resolution,[],[f124,f232,f135,f224,f144,f139,f119])).
0.75/0.52	fof(f119,plain,(
0.75/0.52	  ( ! [X21,X18,X19,X20] : (host(X20) != host(X21) | ~elem(m_Down(X19),queue(host(X20))) | ~setIn(X18,alive) | ~setIn(X20,alive) | host(X18) != host(X19) | ~elem(m_Down(X21),queue(host(X18))) | host(X18) = host(X20)) )),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f103,plain,(
0.75/0.52	  (((elem(m_Down(sK5),queue(host(sK6))) & elem(m_Down(sK7),sK0) & ((sK2 != sK6 & setIn(sK6,alive)) | sK1 = sK6) & host(sK4) = host(sK5) & host(sK6) = host(sK7) & host(sK4) != host(sK6) & (sK1 = sK4 | (setIn(sK4,alive) & sK2 != sK4))) & host(sK2) != host(sK6)) & host(sK2) = host(sK4)) & s(zero) != host(sK1) & host(sK2) = host(sK1) & ~setIn(sK1,pids) & ! [X8] : (leq(X8,sK1) | host(X8) != host(sK2)) & ((wait = index(status,host(sK2)) & host(sK3) = host(index(elid,host(sK2)))) | (norm = index(status,host(sK2)) & host(sK3) = index(ldr,host(sK2)))) & ~leq(host(sK2),host(sK3)) & setIn(sK2,alive) & ! [X9,X10] : (~elem(m_Down(X10),queue(host(X9))) | ~setIn(X10,alive)) & ! [X11,X12] : (~setIn(X12,alive) | ~elem(m_Down(X12),queue(host(X11)))) & ! [X13,X14] : (host(X14) != host(X13) | ~elem(m_Down(X14),queue(host(X13)))) & ! [X15,X16,X17] : (~leq(host(X15),host(X17)) | ~elem(m_Ack(X17,X15),queue(host(X16)))) & ! [X18,X19,X20,X21] : (~elem(m_Down(X21),queue(host(X18))) | ~elem(m_Down(X19),queue(host(X20))) | ~setIn(X18,alive) | ~setIn(X20,alive) | host(X18) != host(X19) | host(X20) != host(X21) | host(X18) = host(X20)) & queue(host(sK2)) = cons(m_Down(sK3),sK0) & ! [X22,X23] : (~setIn(X22,alive) | ~setIn(X23,alive) | X22 = X23 | host(X22) != host(X23)) & ! [X24,X25] : (~setIn(X25,alive) | ~leq(X25,X24) | host(X24) != host(X25) | setIn(X24,alive)) & ! [X26,X27] : (~leq(host(X26),host(X27)) | ~elem(m_Halt(X27),queue(host(X26))))),
0.75/0.52	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f98,f102,f101,f100,f99])).
0.75/0.52	fof(f99,plain,(
0.75/0.52	  ? [X0,X1,X2,X3] : (? [X4] : (? [X5,X6] : (? [X7] : (elem(m_Down(X5),queue(host(X6))) & elem(m_Down(X7),X0) & ((X2 != X6 & setIn(X6,alive)) | X1 = X6) & host(X5) = host(X4) & host(X6) = host(X7) & host(X6) != host(X4) & (X1 = X4 | (setIn(X4,alive) & X2 != X4))) & host(X6) != host(X2)) & host(X2) = host(X4)) & s(zero) != host(X1) & host(X1) = host(X2) & ~setIn(X1,pids) & ! [X8] : (leq(X8,X1) | host(X2) != host(X8)) & ((wait = index(status,host(X2)) & host(X3) = host(index(elid,host(X2)))) | (norm = index(status,host(X2)) & host(X3) = index(ldr,host(X2)))) & ~leq(host(X2),host(X3)) & setIn(X2,alive) & ! [X9,X10] : (~elem(m_Down(X10),queue(host(X9))) | ~setIn(X10,alive)) & ! [X11,X12] : (~setIn(X12,alive) | ~elem(m_Down(X12),queue(host(X11)))) & ! [X13,X14] : (host(X14) != host(X13) | ~elem(m_Down(X14),queue(host(X13)))) & ! [X15,X16,X17] : (~leq(host(X15),host(X17)) | ~elem(m_Ack(X17,X15),queue(host(X16)))) & ! [X18,X19,X20,X21] : (~elem(m_Down(X21),queue(host(X18))) | ~elem(m_Down(X19),queue(host(X20))) | ~setIn(X18,alive) | ~setIn(X20,alive) | host(X18) != host(X19) | host(X20) != host(X21) | host(X18) = host(X20)) & queue(host(X2)) = cons(m_Down(X3),X0) & ! [X22,X23] : (~setIn(X22,alive) | ~setIn(X23,alive) | X22 = X23 | host(X22) != host(X23)) & ! [X24,X25] : (~setIn(X25,alive) | ~leq(X25,X24) | host(X24) != host(X25) | setIn(X24,alive)) & ! [X26,X27] : (~leq(host(X26),host(X27)) | ~elem(m_Halt(X27),queue(host(X26))))) => (? [X4] : (? [X6,X5] : (? [X7] : (elem(m_Down(X5),queue(host(X6))) & elem(m_Down(X7),sK0) & ((sK2 != X6 & setIn(X6,alive)) | sK1 = X6) & host(X5) = host(X4) & host(X6) = host(X7) & host(X6) != host(X4) & (sK1 = X4 | (setIn(X4,alive) & sK2 != X4))) & host(X6) != host(sK2)) & host(X4) = host(sK2)) & s(zero) != host(sK1) & host(sK2) = host(sK1) & ~setIn(sK1,pids) & ! [X8] : (leq(X8,sK1) | host(X8) != host(sK2)) & ((wait = index(status,host(sK2)) & host(sK3) = host(index(elid,host(sK2)))) | (norm = index(status,host(sK2)) & host(sK3) = index(ldr,host(sK2)))) & ~leq(host(sK2),host(sK3)) & setIn(sK2,alive) & ! [X9,X10] : (~elem(m_Down(X10),queue(host(X9))) | ~setIn(X10,alive)) & ! [X11,X12] : (~setIn(X12,alive) | ~elem(m_Down(X12),queue(host(X11)))) & ! [X13,X14] : (host(X14) != host(X13) | ~elem(m_Down(X14),queue(host(X13)))) & ! [X15,X16,X17] : (~leq(host(X15),host(X17)) | ~elem(m_Ack(X17,X15),queue(host(X16)))) & ! [X18,X19,X20,X21] : (~elem(m_Down(X21),queue(host(X18))) | ~elem(m_Down(X19),queue(host(X20))) | ~setIn(X18,alive) | ~setIn(X20,alive) | host(X18) != host(X19) | host(X20) != host(X21) | host(X18) = host(X20)) & queue(host(sK2)) = cons(m_Down(sK3),sK0) & ! [X22,X23] : (~setIn(X22,alive) | ~setIn(X23,alive) | X22 = X23 | host(X22) != host(X23)) & ! [X24,X25] : (~setIn(X25,alive) | ~leq(X25,X24) | host(X24) != host(X25) | setIn(X24,alive)) & ! [X26,X27] : (~leq(host(X26),host(X27)) | ~elem(m_Halt(X27),queue(host(X26)))))),
0.75/0.52	  introduced(definition,[],[choice_axiom])).
0.75/0.52	fof(f100,plain,(
0.75/0.52	  ? [X4] : (? [X6,X5] : (? [X7] : (elem(m_Down(X5),queue(host(X6))) & elem(m_Down(X7),sK0) & ((sK2 != X6 & setIn(X6,alive)) | sK1 = X6) & host(X5) = host(X4) & host(X6) = host(X7) & host(X6) != host(X4) & (sK1 = X4 | (setIn(X4,alive) & sK2 != X4))) & host(X6) != host(sK2)) & host(X4) = host(sK2)) => (? [X6,X5] : (? [X7] : (elem(m_Down(X5),queue(host(X6))) & elem(m_Down(X7),sK0) & ((sK2 != X6 & setIn(X6,alive)) | sK1 = X6) & host(X5) = host(sK4) & host(X6) = host(X7) & host(X6) != host(sK4) & (sK1 = sK4 | (setIn(sK4,alive) & sK2 != sK4))) & host(X6) != host(sK2)) & host(sK2) = host(sK4))),
0.75/0.52	  introduced(definition,[],[choice_axiom])).
0.75/0.52	fof(f101,plain,(
0.75/0.52	  ? [X6,X5] : (? [X7] : (elem(m_Down(X5),queue(host(X6))) & elem(m_Down(X7),sK0) & ((sK2 != X6 & setIn(X6,alive)) | sK1 = X6) & host(X5) = host(sK4) & host(X6) = host(X7) & host(X6) != host(sK4) & (sK1 = sK4 | (setIn(sK4,alive) & sK2 != sK4))) & host(X6) != host(sK2)) => (? [X7] : (elem(m_Down(sK5),queue(host(sK6))) & elem(m_Down(X7),sK0) & ((sK2 != sK6 & setIn(sK6,alive)) | sK1 = sK6) & host(sK4) = host(sK5) & host(X7) = host(sK6) & host(sK4) != host(sK6) & (sK1 = sK4 | (setIn(sK4,alive) & sK2 != sK4))) & host(sK2) != host(sK6))),
0.75/0.52	  introduced(definition,[],[choice_axiom])).
0.75/0.52	fof(f102,plain,(
0.75/0.52	  ? [X7] : (elem(m_Down(sK5),queue(host(sK6))) & elem(m_Down(X7),sK0) & ((sK2 != sK6 & setIn(sK6,alive)) | sK1 = sK6) & host(sK4) = host(sK5) & host(X7) = host(sK6) & host(sK4) != host(sK6) & (sK1 = sK4 | (setIn(sK4,alive) & sK2 != sK4))) => (elem(m_Down(sK5),queue(host(sK6))) & elem(m_Down(sK7),sK0) & ((sK2 != sK6 & setIn(sK6,alive)) | sK1 = sK6) & host(sK4) = host(sK5) & host(sK6) = host(sK7) & host(sK4) != host(sK6) & (sK1 = sK4 | (setIn(sK4,alive) & sK2 != sK4)))),
0.75/0.52	  introduced(definition,[],[choice_axiom])).
0.75/0.52	fof(f98,plain,(
0.75/0.52	  ? [X0,X1,X2,X3] : (? [X4] : (? [X5,X6] : (? [X7] : (elem(m_Down(X5),queue(host(X6))) & elem(m_Down(X7),X0) & ((X2 != X6 & setIn(X6,alive)) | X1 = X6) & host(X5) = host(X4) & host(X6) = host(X7) & host(X6) != host(X4) & (X1 = X4 | (setIn(X4,alive) & X2 != X4))) & host(X6) != host(X2)) & host(X2) = host(X4)) & s(zero) != host(X1) & host(X1) = host(X2) & ~setIn(X1,pids) & ! [X8] : (leq(X8,X1) | host(X2) != host(X8)) & ((wait = index(status,host(X2)) & host(X3) = host(index(elid,host(X2)))) | (norm = index(status,host(X2)) & host(X3) = index(ldr,host(X2)))) & ~leq(host(X2),host(X3)) & setIn(X2,alive) & ! [X9,X10] : (~elem(m_Down(X10),queue(host(X9))) | ~setIn(X10,alive)) & ! [X11,X12] : (~setIn(X12,alive) | ~elem(m_Down(X12),queue(host(X11)))) & ! [X13,X14] : (host(X14) != host(X13) | ~elem(m_Down(X14),queue(host(X13)))) & ! [X15,X16,X17] : (~leq(host(X15),host(X17)) | ~elem(m_Ack(X17,X15),queue(host(X16)))) & ! [X18,X19,X20,X21] : (~elem(m_Down(X21),queue(host(X18))) | ~elem(m_Down(X19),queue(host(X20))) | ~setIn(X18,alive) | ~setIn(X20,alive) | host(X18) != host(X19) | host(X20) != host(X21) | host(X18) = host(X20)) & queue(host(X2)) = cons(m_Down(X3),X0) & ! [X22,X23] : (~setIn(X22,alive) | ~setIn(X23,alive) | X22 = X23 | host(X22) != host(X23)) & ! [X24,X25] : (~setIn(X25,alive) | ~leq(X25,X24) | host(X24) != host(X25) | setIn(X24,alive)) & ! [X26,X27] : (~leq(host(X26),host(X27)) | ~elem(m_Halt(X27),queue(host(X26)))))),
0.75/0.52	  inference(rectify,[],[f90])).
0.75/0.52	fof(f90,plain,(
0.75/0.52	  ? [X0,X1,X2,X3] : (? [X24] : (? [X25,X26] : (? [X27] : (elem(m_Down(X25),queue(host(X26))) & elem(m_Down(X27),X0) & ((X2 != X26 & setIn(X26,alive)) | X1 = X26) & host(X24) = host(X25) & host(X26) = host(X27) & host(X24) != host(X26) & (X1 = X24 | (setIn(X24,alive) & X2 != X24))) & host(X2) != host(X26)) & host(X2) = host(X24)) & s(zero) != host(X1) & host(X1) = host(X2) & ~setIn(X1,pids) & ! [X23] : (leq(X23,X1) | host(X2) != host(X23)) & ((wait = index(status,host(X2)) & host(X3) = host(index(elid,host(X2)))) | (norm = index(status,host(X2)) & host(X3) = index(ldr,host(X2)))) & ~leq(host(X2),host(X3)) & setIn(X2,alive) & ! [X4,X5] : (~elem(m_Down(X5),queue(host(X4))) | ~setIn(X5,alive)) & ! [X6,X7] : (~setIn(X7,alive) | ~elem(m_Down(X7),queue(host(X6)))) & ! [X8,X9] : (host(X8) != host(X9) | ~elem(m_Down(X9),queue(host(X8)))) & ! [X10,X11,X12] : (~leq(host(X10),host(X12)) | ~elem(m_Ack(X12,X10),queue(host(X11)))) & ! [X13,X14,X15,X16] : (~elem(m_Down(X16),queue(host(X13))) | ~elem(m_Down(X14),queue(host(X15))) | ~setIn(X13,alive) | ~setIn(X15,alive) | host(X14) != host(X13) | host(X15) != host(X16) | host(X15) = host(X13)) & queue(host(X2)) = cons(m_Down(X3),X0) & ! [X17,X18] : (~setIn(X17,alive) | ~setIn(X18,alive) | X17 = X18 | host(X18) != host(X17)) & ! [X19,X20] : (~setIn(X20,alive) | ~leq(X20,X19) | host(X19) != host(X20) | setIn(X19,alive)) & ! [X21,X22] : (~leq(host(X21),host(X22)) | ~elem(m_Halt(X22),queue(host(X21)))))),
0.75/0.52	  inference(flattening,[],[f89])).
0.75/0.52	fof(f89,plain,(
0.75/0.52	  ? [X0,X1,X2,X3] : ((((((? [X24] : (? [X25,X26] : (? [X27] : ((elem(m_Down(X25),queue(host(X26))) & elem(m_Down(X27),X0)) & (((X2 != X26 & setIn(X26,alive)) | X1 = X26) & host(X24) = host(X25) & host(X26) = host(X27) & host(X24) != host(X26) & (X1 = X24 | (setIn(X24,alive) & X2 != X24)))) & host(X2) != host(X26)) & host(X2) = host(X24)) & s(zero) != host(X1)) & (host(X1) = host(X2) & ~setIn(X1,pids) & ! [X23] : (leq(X23,X1) | host(X2) != host(X23)))) & ((wait = index(status,host(X2)) & host(X3) = host(index(elid,host(X2)))) | (norm = index(status,host(X2)) & host(X3) = index(ldr,host(X2))))) & ~leq(host(X2),host(X3))) & setIn(X2,alive)) & (! [X4,X5] : (~elem(m_Down(X5),queue(host(X4))) | ~setIn(X5,alive)) & ! [X6,X7] : (~setIn(X7,alive) | ~elem(m_Down(X7),queue(host(X6)))) & ! [X8,X9] : (host(X8) != host(X9) | ~elem(m_Down(X9),queue(host(X8)))) & ! [X10,X11,X12] : (~leq(host(X10),host(X12)) | ~elem(m_Ack(X12,X10),queue(host(X11)))) & ! [X13,X14,X15,X16] : ((~elem(m_Down(X16),queue(host(X13))) | ~elem(m_Down(X14),queue(host(X15)))) | (~setIn(X13,alive) | ~setIn(X15,alive) | host(X14) != host(X13) | host(X15) != host(X16) | host(X15) = host(X13))) & queue(host(X2)) = cons(m_Down(X3),X0) & ! [X17,X18] : ((~setIn(X17,alive) | ~setIn(X18,alive)) | (X17 = X18 | host(X18) != host(X17))) & ! [X19,X20] : (~setIn(X20,alive) | (~leq(X20,X19) | host(X19) != host(X20) | setIn(X19,alive))) & ! [X21,X22] : (~leq(host(X21),host(X22)) | ~elem(m_Halt(X22),queue(host(X21))))))),
0.75/0.52	  inference(ennf_transformation,[],[f69])).
0.75/0.52	fof(f69,plain,(
0.75/0.52	  ~! [X0,X1,X2,X3] : ((! [X4,X5] : (setIn(X5,alive) => ~elem(m_Down(X5),queue(host(X4)))) & ! [X6,X7] : (elem(m_Down(X7),queue(host(X6))) => ~setIn(X7,alive)) & ! [X8,X9] : (elem(m_Down(X9),queue(host(X8))) => host(X8) != host(X9)) & ! [X10,X11,X12] : (elem(m_Ack(X12,X10),queue(host(X11))) => ~leq(host(X10),host(X12))) & ! [X13,X14,X15,X16] : ((setIn(X13,alive) & setIn(X15,alive) & host(X14) = host(X13) & host(X15) = host(X16) & host(X15) != host(X13)) => ~(elem(m_Down(X16),queue(host(X13))) & elem(m_Down(X14),queue(host(X15))))) & queue(host(X2)) = cons(m_Down(X3),X0) & ! [X17,X18] : ((X17 != X18 & host(X18) = host(X17)) => (~setIn(X17,alive) | ~setIn(X18,alive))) & ! [X19,X20] : ((leq(X20,X19) & host(X19) = host(X20) & ~setIn(X19,alive)) => ~setIn(X20,alive)) & ! [X21,X22] : (elem(m_Halt(X22),queue(host(X21))) => ~leq(host(X21),host(X22)))) => (setIn(X2,alive) => (~leq(host(X2),host(X3)) => (((wait = index(status,host(X2)) & host(X3) = host(index(elid,host(X2)))) | (norm = index(status,host(X2)) & host(X3) = index(ldr,host(X2)))) => ((host(X1) = host(X2) & ~setIn(X1,pids) & ! [X23] : (host(X2) = host(X23) => leq(X23,X1))) => (s(zero) != host(X1) => ! [X24] : (host(X2) = host(X24) => ! [X25,X26] : (host(X2) != host(X26) => ! [X27] : ((((X2 != X26 & setIn(X26,alive)) | X1 = X26) & host(X24) = host(X25) & host(X26) = host(X27) & host(X24) != host(X26) & (X1 = X24 | (setIn(X24,alive) & X2 != X24))) => ~(elem(m_Down(X25),queue(host(X26))) & elem(m_Down(X27),X0)))))))))))),
0.75/0.52	  inference(rectify,[],[f68])).
0.75/0.52	fof(f68,negated_conjecture,(
0.75/0.52	  ~! [X11,X12,X0,X2] : ((! [X4,X16] : (setIn(X16,alive) => ~elem(m_Down(X16),queue(host(X4)))) & ! [X4,X16] : (elem(m_Down(X16),queue(host(X4))) => ~setIn(X16,alive)) & ! [X4,X16] : (elem(m_Down(X16),queue(host(X4))) => host(X4) != host(X16)) & ! [X4,X18,X16] : (elem(m_Ack(X16,X4),queue(host(X18))) => ~leq(host(X4),host(X16))) & ! [X4,X17,X18,X16] : ((setIn(X4,alive) & setIn(X18,alive) & host(X4) = host(X17) & host(X16) = host(X18) & host(X4) != host(X18)) => ~(elem(m_Down(X16),queue(host(X4))) & elem(m_Down(X17),queue(host(X18))))) & queue(host(X0)) = cons(m_Down(X2),X11) & ! [X4,X16] : ((X4 != X16 & host(X4) = host(X16)) => (~setIn(X4,alive) | ~setIn(X16,alive))) & ! [X4,X16] : ((leq(X16,X4) & host(X4) = host(X16) & ~setIn(X4,alive)) => ~setIn(X16,alive)) & ! [X4,X16] : (elem(m_Halt(X16),queue(host(X4))) => ~leq(host(X4),host(X16)))) => (setIn(X0,alive) => (~leq(host(X0),host(X2)) => (((wait = index(status,host(X0)) & host(X2) = host(index(elid,host(X0)))) | (norm = index(status,host(X0)) & host(X2) = index(ldr,host(X0)))) => ((host(X0) = host(X12) & ~setIn(X12,pids) & ! [X4] : (host(X0) = host(X4) => leq(X4,X12))) => (s(zero) != host(X12) => ! [X4] : (host(X0) = host(X4) => ! [X13,X14] : (host(X0) != host(X14) => ! [X15] : ((((X0 != X14 & setIn(X14,alive)) | X12 = X14) & host(X4) = host(X13) & host(X14) = host(X15) & host(X4) != host(X14) & (X4 = X12 | (setIn(X4,alive) & X0 != X4))) => ~(elem(m_Down(X13),queue(host(X14))) & elem(m_Down(X15),X11)))))))))))),
0.75/0.52	  inference(negated_conjecture,[status(cth)],[f67])).
0.75/0.52	fof(f67,conjecture,(
0.75/0.52	  ! [X11,X12,X0,X2] : ((! [X4,X16] : (setIn(X16,alive) => ~elem(m_Down(X16),queue(host(X4)))) & ! [X4,X16] : (elem(m_Down(X16),queue(host(X4))) => ~setIn(X16,alive)) & ! [X4,X16] : (elem(m_Down(X16),queue(host(X4))) => host(X4) != host(X16)) & ! [X4,X18,X16] : (elem(m_Ack(X16,X4),queue(host(X18))) => ~leq(host(X4),host(X16))) & ! [X4,X17,X18,X16] : ((setIn(X4,alive) & setIn(X18,alive) & host(X4) = host(X17) & host(X16) = host(X18) & host(X4) != host(X18)) => ~(elem(m_Down(X16),queue(host(X4))) & elem(m_Down(X17),queue(host(X18))))) & queue(host(X0)) = cons(m_Down(X2),X11) & ! [X4,X16] : ((X4 != X16 & host(X4) = host(X16)) => (~setIn(X4,alive) | ~setIn(X16,alive))) & ! [X4,X16] : ((leq(X16,X4) & host(X4) = host(X16) & ~setIn(X4,alive)) => ~setIn(X16,alive)) & ! [X4,X16] : (elem(m_Halt(X16),queue(host(X4))) => ~leq(host(X4),host(X16)))) => (setIn(X0,alive) => (~leq(host(X0),host(X2)) => (((wait = index(status,host(X0)) & host(X2) = host(index(elid,host(X0)))) | (norm = index(status,host(X0)) & host(X2) = index(ldr,host(X0)))) => ((host(X0) = host(X12) & ~setIn(X12,pids) & ! [X4] : (host(X0) = host(X4) => leq(X4,X12))) => (s(zero) != host(X12) => ! [X4] : (host(X0) = host(X4) => ! [X13,X14] : (host(X0) != host(X14) => ! [X15] : ((((X0 != X14 & setIn(X14,alive)) | X12 = X14) & host(X4) = host(X13) & host(X14) = host(X15) & host(X4) != host(X14) & (X4 = X12 | (setIn(X4,alive) & X0 != X4))) => ~(elem(m_Down(X13),queue(host(X14))) & elem(m_Down(X15),X11)))))))))))),
0.75/0.52	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.75/0.52	fof(f139,plain,(
0.75/0.52	  host(sK6) = host(sK7)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f144,plain,(
0.75/0.52	  elem(m_Down(sK5),queue(host(sK6)))),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f224,plain,(
0.75/0.52	  host(sK2) = host(sK5)),
0.75/0.52	  inference(forward_demodulation,[],[f140,f134])).
0.75/0.52	fof(f134,plain,(
0.75/0.52	  host(sK2) = host(sK4)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f140,plain,(
0.75/0.52	  host(sK4) = host(sK5)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f135,plain,(
0.75/0.52	  host(sK2) != host(sK6)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f232,plain,(
0.75/0.52	  setIn(sK6,alive) | ~spl8_9),
0.75/0.52	  inference(avatar_component_clause,[],[f230])).
0.75/0.52	fof(f230,definition,(
0.75/0.52	  spl8_9 <=> setIn(sK6,alive)),
0.75/0.52	  introduced(definition,[new_symbols(naming,[spl8_9])],[avatar_definition])).
0.75/0.52	fof(f124,plain,(
0.75/0.52	  setIn(sK2,alive)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f655,plain,(
0.75/0.52	  elem(m_Down(sK7),queue(host(sK2)))),
0.75/0.52	  inference(superposition,[],[f569,f118])).
0.75/0.52	fof(f118,plain,(
0.75/0.52	  queue(host(sK2)) = cons(m_Down(sK3),sK0)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f569,plain,(
0.75/0.52	  ( ! [X0] : (elem(m_Down(sK7),cons(X0,sK0))) )),
0.75/0.52	  inference(unit_resulting_resolution,[],[f143,f145])).
0.75/0.52	fof(f145,plain,(
0.75/0.52	  ( ! [X2,X0,X1] : (elem(X0,cons(X1,X2)) | ~elem(X0,X2)) )),
0.75/0.52	  inference(cnf_transformation,[],[f105])).
0.75/0.52	fof(f105,plain,(
0.75/0.52	  ! [X0,X1,X2] : ((X0 = X1 | elem(X0,X2) | ~elem(X0,cons(X1,X2))) & (elem(X0,cons(X1,X2)) | (X0 != X1 & ~elem(X0,X2))))),
0.75/0.52	  inference(flattening,[],[f104])).
0.75/0.52	fof(f104,plain,(
0.75/0.52	  ! [X0,X1,X2] : (((X0 = X1 | elem(X0,X2)) | ~elem(X0,cons(X1,X2))) & (elem(X0,cons(X1,X2)) | (X0 != X1 & ~elem(X0,X2))))),
0.75/0.52	  inference(nnf_transformation,[],[f70])).
0.75/0.52	fof(f70,plain,(
0.75/0.52	  ! [X0,X1,X2] : ((X0 = X1 | elem(X0,X2)) <=> elem(X0,cons(X1,X2)))),
0.75/0.52	  inference(rectify,[],[f41])).
0.75/0.52	fof(f41,axiom,(
0.75/0.52	  ! [X0,X2,X1] : ((X0 = X2 | elem(X0,X1)) <=> elem(X0,cons(X2,X1)))),
0.75/0.52	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.75/0.52	fof(f143,plain,(
0.75/0.52	  elem(m_Down(sK7),sK0)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f244,plain,(
0.75/0.52	  ~spl8_8),
0.75/0.52	  inference(avatar_contradiction_clause,[],[f243])).
0.75/0.52	fof(f243,plain,(
0.75/0.52	  $false | ~spl8_8),
0.75/0.52	  inference(subsumption_resolution,[],[f242,f132])).
0.75/0.52	fof(f132,plain,(
0.75/0.52	  host(sK2) = host(sK1)),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	fof(f242,plain,(
0.75/0.52	  host(sK2) != host(sK1) | ~spl8_8),
0.75/0.52	  inference(backward_demodulation,[],[f135,f228])).
0.75/0.52	fof(f228,plain,(
0.75/0.52	  sK1 = sK6 | ~spl8_8),
0.75/0.52	  inference(avatar_component_clause,[],[f226])).
0.75/0.52	fof(f226,definition,(
0.75/0.52	  spl8_8 <=> sK1 = sK6),
0.75/0.52	  introduced(definition,[new_symbols(naming,[spl8_8])],[avatar_definition])).
0.75/0.52	fof(f233,plain,(
0.75/0.52	  spl8_8 | spl8_9),
0.75/0.52	  inference(avatar_split_clause,[],[f141,f230,f226])).
0.75/0.52	fof(f141,plain,(
0.75/0.52	  setIn(sK6,alive) | sK1 = sK6),
0.75/0.52	  inference(cnf_transformation,[],[f103])).
0.75/0.52	% SZS output end Proof for theBenchmark
0.75/0.52	% (967385)------------------------------
0.75/0.52	% (967385)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200)
0.75/0.52	% (967385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.75/0.52	% (967385)Termination reason: Refutation
0.75/0.52	
0.75/0.52	% (967385)Time elapsed: 0.033 s
0.75/0.52	% (967385)Peak memory usage: 12 MB
0.75/0.52	% (967385)Instructions burned: 36 (million)
0.75/0.52	% (967385)------------------------------
0.75/0.52	% (967385)------------------------------
0.75/0.52	% (967381)Success in time 0.123 s
0.75/0.53	EOF
