%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:24:19 PM UTC 2026
% Result : Theorem 0.06s 0.26s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 295 ( 125 equ)
% Maximal formula atoms : 46 ( 9 avg)
% Number of connectives : 423 ( 159 ~; 87 |; 125 &)
% ( 1 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 163 ( 147 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ~ ( ! [X4] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),queue(host(X4))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ~ ( ! [X4] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),queue(host(X4))) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,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(X9) != host(X8) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( ( ~ setIn(X15,alive)
& leq(X16,X15)
& host(X15) = host(X16) )
=> ~ setIn(X16,alive) )
& ! [X17,X18] :
( ( X17 != X18
& host(X17) = host(X18) )
=> ( ~ setIn(X17,alive)
| ~ setIn(X18,alive) ) )
& ! [X19,X20,X21,X22] :
( ( host(X19) != host(X21)
& setIn(X19,alive)
& setIn(X21,alive)
& host(X19) = host(X20)
& host(X21) = host(X22) )
=> ~ ( elem(m_Down(X22),queue(host(X19)))
& elem(m_Down(X20),queue(host(X21))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ~ ( ! [X23] :
( ( ~ leq(host(X2),X23)
& leq(s(zero),X23) )
=> ( setIn(X23,index(down,host(X2)))
| host(X3) = X23 ) )
& index(status,host(X2)) = elec_1 )
=> ! [X24] :
( host(X2) != host(X24)
=> ! [X25,X26] :
( host(X2) = host(X26)
=> ! [X27] :
( ( host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24))) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24)))
& host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& ( ? [X23] :
( ~ setIn(X23,index(down,host(X2)))
& host(X3) != X23
& ~ leq(host(X2),X23)
& leq(s(zero),X23) )
| elec_1 != index(status,host(X2)) )
& ( host(X3) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& ( wait != index(status,host(X2))
| host(X3) != host(index(elid,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(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24)))
& host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& ( ? [X23] :
( ~ setIn(X23,index(down,host(X2)))
& host(X3) != X23
& ~ leq(host(X2),X23)
& leq(s(zero),X23) )
| elec_1 != index(status,host(X2)) )
& ( host(X3) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& ( wait != index(status,host(X2))
| host(X3) != host(index(elid,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(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f140,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f183,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f86]) ).
fof(f184,plain,
host(sK6) = host(sK8),
inference(cnf_transformation,[],[f86]) ).
fof(f186,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f188,plain,
elem(m_Down(sK10),queue(host(sK6))),
inference(cnf_transformation,[],[f86]) ).
fof(f189,plain,
elem(m_Down(sK8),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f190,plain,
host(sK9) = host(sK4),
inference(cnf_transformation,[],[f86]) ).
fof(f195,plain,
host(sK6) != host(sK4),
inference(cnf_transformation,[],[f86]) ).
fof(f203,plain,
! [X21,X19,X22,X20] :
( host(X21) != host(X22)
| host(X19) != host(X20)
| ~ setIn(X21,alive)
| ~ setIn(X19,alive)
| host(X19) = host(X21)
| ~ elem(m_Down(X20),queue(host(X21)))
| ~ elem(m_Down(X22),queue(host(X19))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f206,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f207,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f254,plain,
~ setIn(sK4,alive),
inference(consistent_polarity_flipping,[],[f207]) ).
fof(f255,plain,
! [X21,X19,X22,X20] :
( ~ elem(m_Down(X22),queue(host(X19)))
| host(X19) != host(X20)
| setIn(X21,alive)
| setIn(X19,alive)
| host(X19) = host(X21)
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X21) != host(X22) ),
inference(consistent_polarity_flipping,[],[f203]) ).
fof(f265,plain,
~ setIn(sK6,alive),
inference(consistent_polarity_flipping,[],[f186]) ).
fof(f378,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| setIn(X1,alive)
| setIn(sK6,alive)
| host(X1) = host(sK6)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X1) != host(sK10) ),
inference(resolution,[],[f255,f188]) ).
fof(f383,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| setIn(X1,alive)
| host(X1) = host(sK6)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X1) != host(sK10) ),
inference(forward_subsumption_resolution,[],[f378,f265]) ).
fof(f384,plain,
! [X0,X1] :
( host(X1) != host(sK9)
| host(X0) != host(sK6)
| setIn(X1,alive)
| host(X1) = host(sK6)
| ~ elem(m_Down(X0),queue(host(X1))) ),
inference(forward_demodulation,[],[f383,f183]) ).
fof(f385,plain,
! [X0,X1] :
( host(X1) != host(sK4)
| host(X0) != host(sK6)
| setIn(X1,alive)
| host(X1) = host(sK6)
| ~ elem(m_Down(X0),queue(host(X1))) ),
inference(forward_demodulation,[],[f384,f190]) ).
fof(f407,plain,
! [X0] :
( host(X0) != host(sK6)
| setIn(sK4,alive)
| host(sK6) = host(sK4)
| ~ elem(m_Down(X0),queue(host(sK4))) ),
inference(equality_resolution,[],[f385]) ).
fof(f409,plain,
! [X0] :
( host(X0) != host(sK6)
| host(sK6) = host(sK4)
| ~ elem(m_Down(X0),queue(host(sK4))) ),
inference(forward_subsumption_resolution,[],[f407,f254]) ).
fof(f411,plain,
! [X0] :
( ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(sK6) ),
inference(forward_subsumption_resolution,[],[f409,f195]) ).
fof(f455,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK4))) ),
inference(superposition,[],[f140,f206]) ).
fof(f456,plain,
elem(m_Down(sK8),queue(host(sK4))),
inference(resolution,[],[f455,f189]) ).
fof(f459,plain,
host(sK6) != host(sK8),
inference(resolution,[],[f456,f411]) ).
fof(f463,plain,
$false,
inference(forward_subsumption_resolution,[],[f459,f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.17 % Computer : n014.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Mon Sep 28 11:08:46 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20 Running first-order model finding
% 0.06/0.20 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.26 % (1715082)Will run a generic schedule for satisfiability detection.
% 0.06/0.26 % (1715087)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1294684572_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.26 % (1715088)% WARNING: option uhcvi not known.
% 0.06/0.26 % Detected minimum model sizes of [4]
% 0.06/0.26 % Detected maximum model sizes of [max]
% 0.06/0.26 % TRYING [4]
% 0.06/0.26 % (1715088)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2774765694:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.26 % (1715089)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1779931445:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.26 % (1715090)dis+10_1_sil=32000:sp=arity:random_seed=3373885046:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.06/0.26 % (1715092)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2331795504:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.26 % (1715093)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=141716391:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.26 % (1715091)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1769946508:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.26 % TRYING [5]
% 0.06/0.26 % (1715088) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1715082-1715088"...
% 0.06/0.26 % (1715090) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1715082-1715090"...
% 0.06/0.26 % (1715088)...printing done.
% 0.06/0.26 % (1715090)...printing done.
% 0.06/0.26 % (1715088)Refutation found. Thanks to Tanya!
% 0.06/0.26 % SZS status Theorem for theBenchmark
% 0.06/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.26 % (1715088)------------------------------
% 0.06/0.26 % (1715088)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.26 % (1715088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.26 % (1715088)CaDiCaL version: 2.1.3
% 0.06/0.26 % (1715088)Termination reason: Refutation
% 0.06/0.26 % (1715088)Time elapsed: 0.012 s
% 0.06/0.26 % (1715088)Peak memory usage: 12 MB
% 0.06/0.26 % (1715088)Instructions burned: 17 (million)
% 0.06/0.26 % (1715082)Success in time 0.052 s
% 0.06/0.26 % Vampire exiting
%------------------------------------------------------------------------------