%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV451+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : Sun Sep 27 09:07:59 AM UTC 2026
% Result : Theorem 5.11s 1.13s
% Output : CNFRefutation 5.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 55 ( 27 unt; 0 def)
% Number of atoms : 366 ( 174 equ)
% Maximal formula atoms : 53 ( 6 avg)
% Number of connectives : 502 ( 191 ~; 125 |; 144 &)
% ( 2 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-2 aty)
% Number of variables : 166 ( 4 sgn 124 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_17,axiom,
! [X,Y] : m_Down(X) != m_Halt(Y),
file('theBenchmark.p',axiom_17) ).
fof(axiom_46,axiom,
! [X,Y,Q] :
( elem(X,cons(Y,Q))
<=> ( elem(X,Q)
| X = Y ) ),
file('theBenchmark.p',axiom_46) ).
fof(axiom_47,axiom,
! [X,Y,Q] :
( elem(X,snoc(Q,Y))
<=> ( elem(X,Q)
| X = Y ) ),
file('theBenchmark.p',axiom_47) ).
fof(conj,conjecture,
! [V,W,X,Y] :
( ( queue(host(Y)) = cons(m_NotNorm(X),V)
& ! [Z,Pid30,Pid20,Pid0] :
( ( host(Pid0) = host(Pid20)
& host(Pid30) = host(Z)
& setIn(Pid20,alive)
& setIn(Z,alive)
& host(Pid20) != host(Z) )
=> ~ ( elem(m_Down(Pid30),queue(host(Pid20)))
& elem(m_Down(Pid0),queue(host(Z))) ) )
& ! [Z,Pid0] :
( ( host(Pid0) = host(Z)
& Pid0 != Z )
=> ( ~ setIn(Pid0,alive)
| ~ setIn(Z,alive) ) )
& ! [Z,Pid0] :
( ( host(Pid0) = host(Z)
& leq(Pid0,Z)
& ~ setIn(Z,alive) )
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid20,Pid0] :
( elem(m_Ack(Pid0,Z),queue(host(Pid20)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( elem(m_Halt(Pid0),queue(host(Z)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> host(Pid0) != host(Z) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid0] :
( setIn(Pid0,alive)
=> ~ elem(m_Down(Pid0),queue(host(Z))) ) )
=> ( setIn(Y,alive)
=> ( ( index(elid,host(Y)) = X
& index(status,host(Y)) = norm
& index(ldr,host(Y)) = host(Y) )
=> ( ( host(Y) = host(W)
& ~ setIn(W,pids)
& ! [Z] :
( host(Y) = host(Z)
=> leq(Z,W) ) )
=> ( host(W) = s(zero)
=> ( ~ leq(nbr_proc,host(W))
=> ! [Z] :
( s(host(W)) = host(Z)
=> ( host(Y) != host(Z)
=> ! [X0,Y0] :
( s(host(W)) != host(Y0)
=> ( host(Y) = host(Y0)
=> ! [Z0] :
( ( host(Z0) = host(Y0)
& host(X0) = host(Z)
& host(Y0) != host(Z)
& ( Y0 = W
| ( setIn(Y0,alive)
& Y0 != Y ) )
& ( Z = W
| ( setIn(Z,alive)
& Z != Y ) ) )
=> ~ ( elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W)))
& elem(m_Down(X0),V) ) ) ) ) ) ) ) ) ) ) ) ),
file('theBenchmark.p',conj) ).
fof(conj_neg,negated_conjecture,
~ ! [V,W,X,Y] :
( ( queue(host(Y)) = cons(m_NotNorm(X),V)
& ! [Z,Pid30,Pid20,Pid0] :
( ( host(Pid0) = host(Pid20)
& host(Pid30) = host(Z)
& setIn(Pid20,alive)
& setIn(Z,alive)
& host(Pid20) != host(Z) )
=> ~ ( elem(m_Down(Pid30),queue(host(Pid20)))
& elem(m_Down(Pid0),queue(host(Z))) ) )
& ! [Z,Pid0] :
( ( host(Pid0) = host(Z)
& Pid0 != Z )
=> ( ~ setIn(Pid0,alive)
| ~ setIn(Z,alive) ) )
& ! [Z,Pid0] :
( ( host(Pid0) = host(Z)
& leq(Pid0,Z)
& ~ setIn(Z,alive) )
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid20,Pid0] :
( elem(m_Ack(Pid0,Z),queue(host(Pid20)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( elem(m_Halt(Pid0),queue(host(Z)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> host(Pid0) != host(Z) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid0] :
( setIn(Pid0,alive)
=> ~ elem(m_Down(Pid0),queue(host(Z))) ) )
=> ( setIn(Y,alive)
=> ( ( index(elid,host(Y)) = X
& index(status,host(Y)) = norm
& index(ldr,host(Y)) = host(Y) )
=> ( ( host(Y) = host(W)
& ~ setIn(W,pids)
& ! [Z] :
( host(Y) = host(Z)
=> leq(Z,W) ) )
=> ( host(W) = s(zero)
=> ( ~ leq(nbr_proc,host(W))
=> ! [Z] :
( s(host(W)) = host(Z)
=> ( host(Y) != host(Z)
=> ! [X0,Y0] :
( s(host(W)) != host(Y0)
=> ( host(Y) = host(Y0)
=> ! [Z0] :
( ( host(Z0) = host(Y0)
& host(X0) = host(Z)
& host(Y0) != host(Z)
& ( Y0 = W
| ( setIn(Y0,alive)
& Y0 != Y ) )
& ( Z = W
| ( setIn(Z,alive)
& Z != Y ) ) )
=> ~ ( elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W)))
& elem(m_Down(X0),V) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
cnf(c_81,plain,
m_Down(A) != m_Halt(B),
inference(clausify,[status(thm)],[axiom_17]) ).
cnf(c_119,plain,
( ~ elem(A,C)
| elem(A,cons(B,C)) ),
inference(clausify,[status(thm)],[axiom_46]) ).
cnf(c_120,plain,
( elem(A,B)
| C = A
| ~ elem(A,snoc(B,C)) ),
inference(clausify,[status(thm)],[axiom_47]) ).
fof(nnf_58,plain,
? [V,W,X,Y] :
( ? [Z] :
( ? [X0,Y0] :
( ? [Z0] :
( elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W)))
& elem(m_Down(X0),V)
& host(Z0) = host(Y0)
& host(X0) = host(Z)
& host(Y0) != host(Z)
& ( Y0 = W
| ( setIn(Y0,alive)
& Y0 != Y ) )
& ( W = Z
| ( setIn(Z,alive)
& Z != Y ) ) )
& host(Y0) = host(Y)
& s(host(W)) != host(Y0) )
& host(Z) != host(Y)
& s(host(W)) = host(Z) )
& ~ leq(nbr_proc,host(W))
& s(zero) = host(W)
& host(W) = host(Y)
& ~ setIn(W,pids)
& ! [X19] :
( leq(X19,W)
| host(X19) != host(Y) )
& index(elid,host(Y)) = X
& index(status,host(Y)) = norm
& index(ldr,host(Y)) = host(Y)
& setIn(Y,alive)
& cons(m_NotNorm(X),V) = queue(host(Y))
& ! [X18,Pid30,Pid20,Pid0] :
( ~ elem(m_Down(Pid30),queue(host(Pid20)))
| ~ elem(m_Down(Pid0),queue(host(X18)))
| host(Pid20) != host(Pid0)
| host(Pid30) != host(X18)
| ~ setIn(Pid20,alive)
| ~ setIn(X18,alive)
| host(Pid20) = host(X18) )
& ! [X16,X17] :
( ~ setIn(X17,alive)
| ~ setIn(X16,alive)
| host(X17) != host(X16)
| X17 = X16 )
& ! [X14,X15] :
( ~ setIn(X15,alive)
| host(X15) != host(X14)
| ~ leq(X15,X14)
| setIn(X14,alive) )
& ! [X11,X12,X13] :
( ~ leq(host(X11),host(X13))
| ~ elem(m_Ack(X13,X11),queue(host(X12))) )
& ! [X9,X10] :
( ~ leq(host(X9),host(X10))
| ~ elem(m_Halt(X10),queue(host(X9))) )
& ! [X7,X8] :
( host(X8) != host(X7)
| ~ elem(m_Down(X8),queue(host(X7))) )
& ! [X5,X6] :
( ~ setIn(X6,alive)
| ~ elem(m_Down(X6),queue(host(X5))) )
& ! [X3,X4] :
( ~ elem(m_Down(X4),queue(host(X3)))
| ~ setIn(X4,alive) ) ),
inference(fof_nnf,[status(thm)],[conj_neg]) ).
fof(sk_conj_neg_sk,plain,
( elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK3)))
& elem(m_Down(sK6),sK1)
& host(sK7) = host(sK5)
& host(sK6) = host(sK4)
& host(sK5) != host(sK4)
& ( sK5 = sK3
| ( setIn(sK5,alive)
& sK5 != sK2 ) )
& ( sK3 = sK4
| ( setIn(sK4,alive)
& sK4 != sK2 ) )
& host(sK5) = host(sK2)
& s(host(sK3)) != host(sK5)
& host(sK4) != host(sK2)
& s(host(sK3)) = host(sK4)
& ~ leq(nbr_proc,host(sK3))
& s(zero) = host(sK3)
& host(sK3) = host(sK2)
& ~ setIn(sK3,pids)
& ! [X19] :
( leq(X19,sK3)
| host(X19) != host(sK2) )
& index(elid,host(sK2)) = sK0
& index(status,host(sK2)) = norm
& index(ldr,host(sK2)) = host(sK2)
& setIn(sK2,alive)
& cons(m_NotNorm(sK0),sK1) = queue(host(sK2))
& ! [X18,Pid30,Pid20,Pid0] :
( ~ elem(m_Down(Pid30),queue(host(Pid20)))
| ~ elem(m_Down(Pid0),queue(host(X18)))
| host(Pid20) != host(Pid0)
| host(Pid30) != host(X18)
| ~ setIn(Pid20,alive)
| ~ setIn(X18,alive)
| host(Pid20) = host(X18) )
& ! [X16,X17] :
( ~ setIn(X17,alive)
| ~ setIn(X16,alive)
| host(X17) != host(X16)
| X17 = X16 )
& ! [X14,X15] :
( ~ setIn(X15,alive)
| host(X15) != host(X14)
| ~ leq(X15,X14)
| setIn(X14,alive) )
& ! [X11,X12,X13] :
( ~ leq(host(X11),host(X13))
| ~ elem(m_Ack(X13,X11),queue(host(X12))) )
& ! [X9,X10] :
( ~ leq(host(X9),host(X10))
| ~ elem(m_Halt(X10),queue(host(X9))) )
& ! [X7,X8] :
( host(X8) != host(X7)
| ~ elem(m_Down(X8),queue(host(X7))) )
& ! [X5,X6] :
( ~ setIn(X6,alive)
| ~ elem(m_Down(X6),queue(host(X5))) )
& ! [X3,X4] :
( ~ elem(m_Down(X4),queue(host(X3)))
| ~ setIn(X4,alive) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(V,sK1),skolemize(W,sK3),skolemize(X,sK0),skolemize(Y,sK2),skolemize(Z,sK4),skolemize(X0,sK6),skolemize(Y0,sK5),skolemize(Z0,sK7)],[nnf_58]) ).
fof(sk_conj_neg,plain,
( elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK3)))
& elem(m_Down(sK6),sK1)
& host(sK7) = host(sK5)
& host(sK6) = host(sK4)
& host(sK5) != host(sK4)
& ( sK5 = sK3
| setIn(sK5,alive) )
& ( sK5 = sK3
| sK5 != sK2 )
& ( sK3 = sK4
| setIn(sK4,alive) )
& ( sK3 = sK4
| sK4 != sK2 )
& host(sK5) = host(sK2)
& s(host(sK3)) != host(sK5)
& host(sK4) != host(sK2)
& s(host(sK3)) = host(sK4)
& ~ leq(nbr_proc,host(sK3))
& s(zero) = host(sK3)
& host(sK3) = host(sK2)
& ~ setIn(sK3,pids)
& ! [VAR_0] :
( leq(VAR_0,sK3)
| host(VAR_0) != host(sK2) )
& index(elid,host(sK2)) = sK0
& index(status,host(sK2)) = norm
& index(ldr,host(sK2)) = host(sK2)
& setIn(sK2,alive)
& cons(m_NotNorm(sK0),sK1) = queue(host(sK2))
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ elem(m_Down(VAR_2),queue(host(VAR_0)))
| ~ elem(m_Down(VAR_3),queue(host(VAR_1)))
| host(VAR_0) != host(VAR_3)
| host(VAR_2) != host(VAR_1)
| ~ setIn(VAR_0,alive)
| ~ setIn(VAR_1,alive)
| host(VAR_0) = host(VAR_1) )
& ! [VAR_0,VAR_1] :
( ~ setIn(VAR_0,alive)
| ~ setIn(VAR_1,alive)
| host(VAR_0) != host(VAR_1)
| VAR_0 = VAR_1 )
& ! [VAR_0,VAR_1] :
( ~ setIn(VAR_1,alive)
| host(VAR_1) != host(VAR_0)
| ~ leq(VAR_1,VAR_0)
| setIn(VAR_0,alive) )
& ! [VAR_0,VAR_1,VAR_2] :
( ~ leq(host(VAR_1),host(VAR_0))
| ~ elem(m_Ack(VAR_0,VAR_1),queue(host(VAR_2))) )
& ! [VAR_0,VAR_1] :
( ~ leq(host(VAR_1),host(VAR_0))
| ~ elem(m_Halt(VAR_0),queue(host(VAR_1))) )
& ! [VAR_0,VAR_1] :
( host(VAR_0) != host(VAR_1)
| ~ elem(m_Down(VAR_0),queue(host(VAR_1))) )
& ! [VAR_0,VAR_1] :
( ~ setIn(VAR_0,alive)
| ~ elem(m_Down(VAR_0),queue(host(VAR_1))) )
& ! [VAR_0,VAR_1] :
( ~ elem(m_Down(VAR_0),queue(host(VAR_1)))
| ~ setIn(VAR_0,alive) ) ),
inference(cnf_transformation,[status(thm)],[sk_conj_neg_sk]) ).
cnf(c_164,negated_conjecture,
( ~ setIn(B,alive)
| host(B) != host(A)
| ~ leq(B,A)
| setIn(A,alive) ),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_166,negated_conjecture,
( ~ elem(m_Down(C),queue(host(A)))
| ~ elem(m_Down(D),queue(host(B)))
| host(A) != host(D)
| host(C) != host(B)
| ~ setIn(A,alive)
| ~ setIn(B,alive)
| host(A) = host(B) ),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_167,negated_conjecture,
cons(m_NotNorm(sK0),sK1) = queue(host(sK2)),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_168,negated_conjecture,
setIn(sK2,alive),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_173,negated_conjecture,
( leq(A,sK3)
| host(A) != host(sK2) ),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_174,negated_conjecture,
( leq(A,sK3)
| host(sK2) != host(A) ),
inference(copy,[status(thm)],[c_173]) ).
cnf(c_176,negated_conjecture,
host(sK3) = host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_177,negated_conjecture,
host(sK2) = host(sK3),
inference(copy,[status(thm)],[c_176]) ).
cnf(c_181,negated_conjecture,
host(sK4) != host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_182,negated_conjecture,
host(sK4) != host(sK3),
inference(paramod,[status(thm)],[c_177,c_181]) ).
cnf(c_185,negated_conjecture,
host(sK5) = host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_186,negated_conjecture,
host(sK5) = host(sK3),
inference(paramod,[status(thm)],[c_177,c_185]) ).
cnf(c_189,negated_conjecture,
( sK3 = sK4
| setIn(sK4,alive) ),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_190,negated_conjecture,
( sK4 = sK3
| setIn(sK4,alive) ),
inference(copy,[status(thm)],[c_189]) ).
cnf(c_194,negated_conjecture,
host(sK6) = host(sK4),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_195,negated_conjecture,
host(sK7) = host(sK5),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_196,negated_conjecture,
host(sK7) = host(sK3),
inference(paramod,[status(thm)],[c_186,c_195]) ).
cnf(c_197,negated_conjecture,
elem(m_Down(sK6),sK1),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_198,negated_conjecture,
elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK3))),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_202,negated_conjecture,
( leq(A,sK3)
| host(sK3) != host(A) ),
inference(paramod,[status(thm)],[c_177,c_174]) ).
cnf(c_206,negated_conjecture,
cons(m_NotNorm(sK0),sK1) = queue(host(sK3)),
inference(paramod,[status(thm)],[c_177,c_167]) ).
cnf(c_2888,negated_conjecture,
( ~ elem(m_Down(B),queue(host(sK2)))
| ~ elem(m_Down(C),queue(host(A)))
| host(sK2) != host(C)
| host(B) != host(A)
| ~ setIn(A,alive)
| host(sK2) = host(A) ),
inference(resolve,[status(thm)],[c_168,c_166]) ).
cnf(c_2889,negated_conjecture,
( ~ elem(m_Down(B),queue(host(sK2)))
| ~ elem(m_Down(C),queue(host(A)))
| host(sK2) != host(C)
| host(B) != host(A)
| ~ setIn(A,alive)
| host(sK3) = host(A) ),
inference(paramod,[status(thm)],[c_177,c_2888]) ).
cnf(c_2890,negated_conjecture,
( ~ elem(m_Down(B),queue(host(sK2)))
| ~ elem(m_Down(C),queue(host(A)))
| host(sK3) != host(C)
| host(B) != host(A)
| ~ setIn(A,alive)
| host(sK3) = host(A) ),
inference(paramod,[status(thm)],[c_177,c_2889]) ).
cnf(c_305,negated_conjecture,
( ~ elem(m_Down(B),queue(host(sK3)))
| ~ elem(m_Down(C),queue(host(A)))
| host(sK3) != host(C)
| host(B) != host(A)
| ~ setIn(A,alive)
| host(sK3) = host(A) ),
inference(paramod,[status(thm)],[c_177,c_2890]) ).
cnf(c_2891,negated_conjecture,
( ~ setIn(sK2,alive)
| ~ leq(sK2,sK3)
| setIn(sK3,alive) ),
inference(resolve,[status(thm)],[c_177,c_164]) ).
cnf(c_312,negated_conjecture,
( ~ leq(sK2,sK3)
| setIn(sK3,alive) ),
inference(resolve,[status(thm)],[c_168,c_2891]) ).
cnf(c_416,plain,
elem(m_Down(sK6),cons(A,sK1)),
inference(resolve,[status(thm)],[c_197,c_119]) ).
cnf(c_2892,negated_conjecture,
( elem(m_Down(sK7),queue(host(sK4)))
| m_Halt(sK3) = m_Down(sK7) ),
inference(resolve,[status(thm)],[c_198,c_120]) ).
cnf(c_421,negated_conjecture,
elem(m_Down(sK7),queue(host(sK4))),
inference(resolve,[status(thm)],[c_81,c_2892]) ).
cnf(c_2893,negated_conjecture,
host(sK3) = host(sK2),
inference(copy,[status(thm)],[c_177]) ).
cnf(c_425,negated_conjecture,
leq(sK2,sK3),
inference(resolve,[status(thm)],[c_202,c_2893]) ).
cnf(c_428,negated_conjecture,
setIn(sK3,alive),
inference(resolve,[status(thm)],[c_425,c_312]) ).
cnf(c_971,plain,
elem(m_Down(sK6),queue(host(sK3))),
inference(paramod,[status(thm)],[c_206,c_416]) ).
cnf(c_2894,negated_conjecture,
( ~ elem(m_Down(sK6),queue(host(sK3)))
| ~ elem(m_Down(A),queue(host(sK4)))
| host(sK3) != host(A)
| ~ setIn(sK4,alive)
| host(sK3) = host(sK4) ),
inference(resolve,[status(thm)],[c_305,c_194]) ).
cnf(c_2895,negated_conjecture,
( ~ elem(m_Down(sK6),queue(host(sK3)))
| ~ elem(m_Down(A),queue(host(sK4)))
| host(sK3) != host(A)
| ~ setIn(sK4,alive)
| host(sK4) = host(sK3) ),
inference(copy,[status(thm)],[c_2894]) ).
cnf(c_2896,negated_conjecture,
( ~ elem(m_Down(sK6),queue(host(sK3)))
| ~ elem(m_Down(A),queue(host(sK4)))
| host(sK3) != host(A)
| ~ setIn(sK4,alive) ),
inference(resolve,[status(thm)],[c_182,c_2895]) ).
cnf(c_2814,negated_conjecture,
( ~ elem(m_Down(A),queue(host(sK4)))
| host(sK3) != host(A)
| ~ setIn(sK4,alive) ),
inference(resolve,[status(thm)],[c_971,c_2896]) ).
cnf(c_2897,negated_conjecture,
host(sK3) = host(sK7),
inference(copy,[status(thm)],[c_196]) ).
cnf(c_2898,negated_conjecture,
( ~ elem(m_Down(sK7),queue(host(sK4)))
| ~ setIn(sK4,alive) ),
inference(resolve,[status(thm)],[c_2814,c_2897]) ).
cnf(c_2860,negated_conjecture,
~ setIn(sK4,alive),
inference(resolve,[status(thm)],[c_421,c_2898]) ).
cnf(c_2876,negated_conjecture,
sK4 = sK3,
inference(resolve,[status(thm)],[c_2860,c_190]) ).
cnf(c_2899,negated_conjecture,
~ setIn(sK3,alive),
inference(paramod,[status(thm)],[c_2876,c_2860]) ).
cnf(c_2887,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_428,c_2899]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV451+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 13:55:38 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 3063161 was started by sandbox on n003,
% 0.11/0.38 % Sat Sep 26 13:55:38 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.39
% 0.11/0.39 % From the command line: assign(max_seconds, 300).
% 5.11/1.13
% 5.11/1.13 % SZS status Theorem for theBenchmark
% 5.11/1.13
% 5.11/1.13 % Proof 1 at 0.54 (+ 0.15) seconds.
% 5.11/1.13 % Length of proof is 39.
% 5.11/1.13 % Level of proof is 8.
% 5.11/1.13 % Maximum clause weight is 48.000.
% 5.11/1.13 % Given clauses 389.
% 5.11/1.13
% 5.11/1.13 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------