%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 89 ( 26 unt; 7 def)
% Number of atoms : 435 ( 177 equ)
% Maximal formula atoms : 50 ( 4 avg)
% Number of connectives : 567 ( 221 ~; 147 |; 137 &)
% ( 8 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 174 ( 0 sgn 158 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/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] :
( host(X2) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X4] :
( host(X2) = host(X4)
=> ! [X8,X9] :
( host(X2) != host(X9)
=> ! [X10] :
( ( ( ( X4 != X2
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X2
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X10),X0)
& elem(m_Down(X8),queue(host(X9))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/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] :
( host(X2) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X4] :
( host(X2) = host(X4)
=> ! [X8,X9] :
( host(X2) != host(X9)
=> ! [X10] :
( ( ( ( X4 != X2
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X2
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X10),X0)
& elem(m_Down(X8),queue(host(X9))) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [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(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] :
( host(X2) = host(X23)
=> leq(X23,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X24] :
( host(X2) = host(X24)
=> ! [X25,X26] :
( host(X2) != host(X26)
=> ! [X27] :
( ( ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26))) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26)))
& ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) != host(X26) )
& host(X2) = host(X24) )
& host(X1) != s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& 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,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26)))
& ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) != host(X26) )
& host(X2) = host(X24) )
& host(X1) != s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& 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,
( sK4 = sK7
| setIn(sK7,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f185,plain,
( sK4 = sK9
| setIn(sK9,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f187,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f86]) ).
fof(f188,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f86]) ).
fof(f190,plain,
elem(m_Down(sK8),queue(host(sK9))),
inference(cnf_transformation,[],[f86]) ).
fof(f191,plain,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f192,plain,
host(sK9) != host(sK5),
inference(cnf_transformation,[],[f86]) ).
fof(f193,plain,
host(sK7) = host(sK5),
inference(cnf_transformation,[],[f86]) ).
fof(f194,plain,
! [X23] :
( host(X23) != host(sK5)
| leq(X23,sK4) ),
inference(cnf_transformation,[],[f86]) ).
fof(f201,plain,
! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f204,plain,
! [X16,X15] :
( host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive)
| ~ setIn(X16,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f205,plain,
! [X18,X17] :
( ~ setIn(X17,alive)
| X17 = X18
| ~ setIn(X18,alive)
| host(X17) != host(X18) ),
inference(cnf_transformation,[],[f86]) ).
fof(f206,plain,
! [X21,X19,X22,X20] :
( ~ setIn(X19,alive)
| host(X19) != host(X20)
| ~ setIn(X21,alive)
| host(X21) != host(X22)
| host(X19) = host(X21)
| ~ elem(m_Down(X20),queue(host(X21)))
| ~ elem(m_Down(X22),queue(host(X19))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f207,plain,
queue(host(sK5)) = cons(m_Down(sK6),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f208,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f210,plain,
host(sK5) = host(sK4),
inference(cnf_transformation,[],[f86]) ).
fof(f247,plain,
! [X16,X15] :
( ~ setIn(X16,alive)
| leq(X16,X15)
| setIn(X15,alive)
| host(X15) != host(X16) ),
inference(consistent_polarity_flipping,[],[f204]) ).
fof(f250,plain,
! [X23] :
( host(X23) != host(sK5)
| ~ leq(X23,sK4) ),
inference(consistent_polarity_flipping,[],[f194]) ).
fof(f252,definition,
( spl11_1
<=> setIn(sK7,alive) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f254,plain,
( setIn(sK7,alive)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f256,definition,
( spl11_2
<=> sK4 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f257,plain,
( sK4 != sK7
| spl11_2 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f258,plain,
( sK4 = sK7
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f183,f256,f252]) ).
fof(f261,definition,
( spl11_3
<=> sK5 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f266,definition,
( spl11_4
<=> setIn(sK9,alive) ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
fof(f268,plain,
( setIn(sK9,alive)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f270,definition,
( spl11_5
<=> sK4 = sK9 ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f272,plain,
( sK4 = sK9
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f273,plain,
( spl11_4
| spl11_5 ),
inference(avatar_split_clause,[],[f185,f270,f266]) ).
fof(f275,definition,
( spl11_6
<=> sK5 = sK9 ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f276,plain,
( sK5 = sK9
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f299,plain,
( host(sK8) = host(sK4)
| ~ spl11_2 ),
inference(forward_demodulation,[],[f188,f258]) ).
fof(f303,plain,
( host(sK8) = host(sK5)
| ~ spl11_2 ),
inference(forward_demodulation,[],[f299,f210]) ).
fof(f308,plain,
~ leq(sK5,sK4),
inference(equality_resolution,[],[f250]) ).
fof(f321,plain,
! [X0] : ~ elem(m_Down(X0),queue(host(X0))),
inference(equality_resolution,[],[f201]) ).
fof(f328,plain,
! [X0] :
( ~ setIn(X0,alive)
| sK5 = X0
| host(X0) != host(sK5) ),
inference(resolution,[],[f205,f208]) ).
fof(f330,plain,
! [X0] :
( host(X0) != host(sK5)
| setIn(X0,alive)
| leq(sK5,X0) ),
inference(resolution,[],[f247,f208]) ).
fof(f332,plain,
~ elem(m_Down(sK10),queue(host(sK9))),
inference(superposition,[],[f321,f187]) ).
fof(f355,plain,
( host(sK5) != host(sK5)
| setIn(sK4,alive)
| leq(sK5,sK4) ),
inference(superposition,[],[f330,f210]) ).
fof(f359,plain,
( setIn(sK4,alive)
| leq(sK5,sK4) ),
inference(trivial_inequality_removal,[],[f355]) ).
fof(f361,plain,
setIn(sK4,alive),
inference(forward_subsumption_resolution,[],[f359,f308]) ).
fof(f363,plain,
( ! [X2,X0,X1] :
( ~ elem(m_Down(X2),queue(host(sK9)))
| ~ setIn(X1,alive)
| host(X1) != host(X2)
| host(X1) = host(sK9)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X0) != host(sK9) )
| ~ spl11_4 ),
inference(resolution,[],[f206,f268]) ).
fof(f366,plain,
( sK4 = sK5
| host(sK5) != host(sK4) ),
inference(resolution,[],[f361,f328]) ).
fof(f371,plain,
sK4 = sK5,
inference(forward_subsumption_resolution,[],[f366,f210]) ).
fof(f399,plain,
( sK5 = sK9
| ~ spl11_5 ),
inference(forward_demodulation,[],[f272,f371]) ).
fof(f471,plain,
( ! [X0,X1] :
( ~ setIn(X0,alive)
| host(X0) != host(sK8)
| host(X0) = host(sK9)
| ~ elem(m_Down(X1),queue(host(X0)))
| host(X1) != host(sK9) )
| ~ spl11_4 ),
inference(resolution,[],[f363,f190]) ).
fof(f472,plain,
( ! [X0,X1] :
( ~ setIn(X0,alive)
| host(X0) != host(sK5)
| host(X0) = host(sK9)
| ~ elem(m_Down(X1),queue(host(X0)))
| host(X1) != host(sK9) )
| ~ spl11_2
| ~ spl11_4 ),
inference(forward_demodulation,[],[f471,f303]) ).
fof(f474,plain,
( ! [X0] :
( host(sK5) != host(sK5)
| host(sK9) = host(sK5)
| ~ elem(m_Down(X0),queue(host(sK5)))
| host(X0) != host(sK9) )
| ~ spl11_2
| ~ spl11_4 ),
inference(resolution,[],[f472,f208]) ).
fof(f477,plain,
( ! [X0] :
( host(sK9) = host(sK5)
| ~ elem(m_Down(X0),queue(host(sK5)))
| host(X0) != host(sK9) )
| ~ spl11_2
| ~ spl11_4 ),
inference(trivial_inequality_removal,[],[f474]) ).
fof(f479,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(host(sK5)))
| host(X0) != host(sK9) )
| ~ spl11_2
| ~ spl11_4 ),
inference(forward_subsumption_resolution,[],[f477,f192]) ).
fof(f485,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK5))) ),
inference(superposition,[],[f140,f207]) ).
fof(f491,plain,
elem(m_Down(sK10),queue(host(sK5))),
inference(resolution,[],[f485,f191]) ).
fof(f495,plain,
( host(sK9) != host(sK10)
| ~ spl11_2
| ~ spl11_4 ),
inference(resolution,[],[f491,f479]) ).
fof(f501,plain,
( $false
| ~ spl11_2
| ~ spl11_4 ),
inference(forward_subsumption_resolution,[],[f495,f187]) ).
fof(f502,plain,
( ~ spl11_2
| ~ spl11_4 ),
inference(avatar_contradiction_clause,[],[f501]) ).
fof(f504,plain,
( spl11_6
| ~ spl11_5 ),
inference(avatar_split_clause,[],[f399,f270,f275]) ).
fof(f508,plain,
( ~ elem(m_Down(sK10),queue(host(sK5)))
| ~ spl11_6 ),
inference(superposition,[],[f332,f276]) ).
fof(f513,plain,
( $false
| ~ spl11_6 ),
inference(forward_subsumption_resolution,[],[f508,f491]) ).
fof(f514,plain,
~ spl11_6,
inference(avatar_contradiction_clause,[],[f513]) ).
fof(f521,plain,
( sK5 != sK7
| spl11_2 ),
inference(forward_demodulation,[],[f257,f371]) ).
fof(f525,plain,
( ~ spl11_3
| spl11_2 ),
inference(avatar_split_clause,[],[f521,f256,f261]) ).
fof(f529,plain,
( sK5 = sK7
| host(sK7) != host(sK5)
| ~ spl11_1 ),
inference(resolution,[],[f254,f328]) ).
fof(f535,definition,
( spl11_18
<=> host(sK7) = host(sK5) ),
introduced(definition,[new_symbols(definition,[spl11_18])],[avatar_definition]) ).
fof(f543,plain,
( ~ spl11_18
| spl11_3
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f529,f252,f261,f535]) ).
fof(f573,plain,
spl11_18,
inference(avatar_split_clause,[],[f193,f535]) ).
cnf(s1,plain,
( spl11_1
| spl11_2 ),
inference(sat_conversion,[],[f259]) ).
cnf(s3,plain,
( spl11_4
| spl11_5 ),
inference(sat_conversion,[],[f273]) ).
cnf(s16,plain,
( ~ spl11_2
| ~ spl11_4 ),
inference(sat_conversion,[],[f502]) ).
cnf(s17,plain,
( ~ spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f504]) ).
cnf(s20,plain,
~ spl11_6,
inference(sat_conversion,[],[f514]) ).
cnf(s24,plain,
( spl11_2
| ~ spl11_3 ),
inference(sat_conversion,[],[f525]) ).
cnf(s27,plain,
( ~ spl11_1
| spl11_3
| ~ spl11_18 ),
inference(sat_conversion,[],[f543]) ).
cnf(s30,plain,
spl11_18,
inference(sat_conversion,[],[f573]) ).
cnf(s33,plain,
( ~ spl11_1
| spl11_3 ),
inference(rat,[],[s27,s30]) ).
cnf(s34,plain,
~ spl11_5,
inference(rat,[],[s17,s20]) ).
cnf(s38,plain,
spl11_4,
inference(rat,[],[s3,s34]) ).
cnf(s39,plain,
~ spl11_2,
inference(rat,[],[s16,s38]) ).
cnf(s41,plain,
~ spl11_3,
inference(rat,[],[s24,s39]) ).
cnf(s42,plain,
~ spl11_1,
inference(rat,[],[s33,s41]) ).
cnf(s43,plain,
$false,
inference(rat,[],[s1,s39,s42]) ).
fof(f574,plain,
$false,
inference(avatar_sat_refutation,[],[s43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n003.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 11:10:57 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.27 % (1517523)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (1517529)% WARNING: option uhcvi not known.
% 0.19/0.27 % (1517529)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2194992121:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (1517528)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2029209877_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % (1517530)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2918399662:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (1517531)dis+10_1_sil=32000:sp=arity:random_seed=4218102583:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (1517532)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=255405081:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (1517533)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2405249807:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (1517529) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1517523-1517529"...
% 0.19/0.27 % (1517534)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1784596583:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.27 % (1517529)...printing done.
% 0.19/0.27 % (1517529)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (1517529)------------------------------
% 0.19/0.27 % (1517529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (1517529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (1517529)CaDiCaL version: 2.1.3
% 0.19/0.27 % (1517529)Termination reason: Refutation
% 0.19/0.27 % (1517529)Time elapsed: 0.009 s
% 0.19/0.27 % (1517529)Peak memory usage: 13 MB
% 0.19/0.27 % (1517529)Instructions burned: 22 (million)
% 0.19/0.27 % (1517523)Success in time 0.043 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------