%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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 4.47s 1.49s
% Output : CNFRefutation 4.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 262 ( 119 equ)
% Maximal formula atoms : 49 ( 8 avg)
% Number of connectives : 384 ( 153 ~; 88 |; 102 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 132 ( 5 sgn 99 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_46,axiom,
! [X,Y,Q] :
( elem(X,cons(Y,Q))
<=> ( elem(X,Q)
| X = Y ) ),
file('theBenchmark.p',axiom_46) ).
fof(conj,conjecture,
! [V,W,X,Y] :
( ( queue(host(X)) = cons(m_Down(Y),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(X,alive)
=> ( ~ leq(host(X),host(Y))
=> ( ~ ( ( host(Y) = host(index(elid,host(X)))
& index(status,host(X)) = wait )
| ( index(status,host(X)) = norm
& index(ldr,host(X)) = host(Y) ) )
=> ( ( index(status,host(X)) = elec_1
& ! [Z] :
( ( leq(s(zero),Z)
& ~ leq(host(X),Z) )
=> ( Z = host(Y)
| setIn(Z,index(down,host(X))) ) ) )
=> ( ~ leq(nbr_proc,host(X))
=> ! [Z] :
( s(host(X)) != host(Z)
=> ( host(X) = host(Z)
=> ! [W0,X0] :
( s(host(X)) != host(X0)
=> ( host(X) != host(X0)
=> ! [Y0] :
( ( host(Y0) = host(X0)
& host(W0) = host(Z)
& setIn(X0,alive)
& setIn(Z,alive)
& host(X0) != host(Z) )
=> ~ ( elem(m_Down(W0),queue(host(X0)))
& elem(m_Down(Y0),V) ) ) ) ) ) ) ) ) ) ) ) ),
file('theBenchmark.p',conj) ).
fof(conj_neg,negated_conjecture,
~ ! [V,W,X,Y] :
( ( queue(host(X)) = cons(m_Down(Y),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(X,alive)
=> ( ~ leq(host(X),host(Y))
=> ( ~ ( ( host(Y) = host(index(elid,host(X)))
& index(status,host(X)) = wait )
| ( index(status,host(X)) = norm
& index(ldr,host(X)) = host(Y) ) )
=> ( ( index(status,host(X)) = elec_1
& ! [Z] :
( ( leq(s(zero),Z)
& ~ leq(host(X),Z) )
=> ( Z = host(Y)
| setIn(Z,index(down,host(X))) ) ) )
=> ( ~ leq(nbr_proc,host(X))
=> ! [Z] :
( s(host(X)) != host(Z)
=> ( host(X) = host(Z)
=> ! [W0,X0] :
( s(host(X)) != host(X0)
=> ( host(X) != host(X0)
=> ! [Y0] :
( ( host(Y0) = host(X0)
& host(W0) = host(Z)
& setIn(X0,alive)
& setIn(Z,alive)
& host(X0) != host(Z) )
=> ~ ( elem(m_Down(W0),queue(host(X0)))
& elem(m_Down(Y0),V) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
cnf(c_119,plain,
( ~ elem(A,C)
| elem(A,cons(B,C)) ),
inference(clausify,[status(thm)],[axiom_46]) ).
fof(nnf_58,plain,
? [V,W,X,Y] :
( ? [Z] :
( ? [W0,X0] :
( ? [Y0] :
( elem(m_Down(W0),queue(host(X0)))
& elem(m_Down(Y0),V)
& host(Y0) = host(X0)
& host(W0) = host(Z)
& setIn(X0,alive)
& setIn(Z,alive)
& host(X0) != host(Z) )
& host(X0) != host(X)
& s(host(X)) != host(X0) )
& host(Z) = host(X)
& s(host(X)) != host(Z) )
& ~ leq(nbr_proc,host(X))
& index(status,host(X)) = elec_1
& ! [X19] :
( host(Y) = X19
| setIn(X19,index(down,host(X)))
| ~ leq(s(zero),X19)
| leq(host(X),X19) )
& ( host(index(elid,host(X))) != host(Y)
| index(status,host(X)) != wait )
& ( index(status,host(X)) != norm
| index(ldr,host(X)) != host(Y) )
& ~ leq(host(X),host(Y))
& setIn(X,alive)
& cons(m_Down(Y),V) = queue(host(X))
& ! [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,plain,
( elem(m_Down(sK5),queue(host(sK4)))
& elem(m_Down(sK6),sK1)
& host(sK6) = host(sK4)
& host(sK5) = host(sK3)
& setIn(sK4,alive)
& setIn(sK3,alive)
& host(sK4) != host(sK3)
& host(sK4) != host(sK2)
& s(host(sK2)) != host(sK4)
& host(sK3) = host(sK2)
& s(host(sK2)) != host(sK3)
& ~ leq(nbr_proc,host(sK2))
& index(status,host(sK2)) = elec_1
& ! [X19] :
( host(sK0) = X19
| setIn(X19,index(down,host(sK2)))
| ~ leq(s(zero),X19)
| leq(host(sK2),X19) )
& ( host(index(elid,host(sK2))) != host(sK0)
| index(status,host(sK2)) != wait )
& ( index(status,host(sK2)) != norm
| index(ldr,host(sK2)) != host(sK0) )
& ~ leq(host(sK2),host(sK0))
& setIn(sK2,alive)
& cons(m_Down(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]),skolemize(V,sK1),skolemize(W,sK7),skolemize(X,sK2),skolemize(Y,sK0),skolemize(Z,sK3),skolemize(W0,sK5),skolemize(X0,sK4),skolemize(Y0,sK6)],[nnf_58]) ).
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_Down(sK0),sK1) = queue(host(sK2)),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_168,negated_conjecture,
queue(host(sK2)) = cons(m_Down(sK0),sK1),
inference(copy,[status(thm)],[c_167]) ).
cnf(c_169,negated_conjecture,
setIn(sK2,alive),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_179,negated_conjecture,
host(sK3) = host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_181,negated_conjecture,
host(sK4) != host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_184,negated_conjecture,
setIn(sK4,alive),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_185,negated_conjecture,
host(sK5) = host(sK3),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_186,negated_conjecture,
host(sK5) = host(sK2),
inference(paramod,[status(thm)],[c_179,c_185]) ).
cnf(c_187,negated_conjecture,
host(sK6) = host(sK4),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_188,negated_conjecture,
elem(m_Down(sK6),sK1),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_189,negated_conjecture,
elem(m_Down(sK5),queue(host(sK4))),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_2088,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_169,c_166]) ).
cnf(c_284,negated_conjecture,
( ~ elem(m_Down(B),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(C),queue(host(A)))
| host(sK2) != host(C)
| host(B) != host(A)
| ~ setIn(A,alive)
| host(sK2) = host(A) ),
inference(paramod,[status(thm)],[c_168,c_2088]) ).
cnf(c_314,plain,
elem(m_Down(sK6),cons(A,sK1)),
inference(resolve,[status(thm)],[c_188,c_119]) ).
cnf(c_2089,negated_conjecture,
( ~ elem(m_Down(A),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(B),queue(host(sK4)))
| host(sK2) != host(B)
| host(A) != host(sK4)
| host(sK2) = host(sK4) ),
inference(resolve,[status(thm)],[c_284,c_184]) ).
cnf(c_2090,negated_conjecture,
( ~ elem(m_Down(A),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(B),queue(host(sK4)))
| host(sK2) != host(B)
| host(A) != host(sK4)
| host(sK4) = host(sK2) ),
inference(copy,[status(thm)],[c_2089]) ).
cnf(c_2091,negated_conjecture,
( ~ elem(m_Down(A),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(B),queue(host(sK4)))
| host(sK2) != host(B)
| host(sK4) != host(A)
| host(sK4) = host(sK2) ),
inference(copy,[status(thm)],[c_2090]) ).
cnf(c_2084,negated_conjecture,
( ~ elem(m_Down(A),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(B),queue(host(sK4)))
| host(sK2) != host(B)
| host(sK4) != host(A) ),
inference(resolve,[status(thm)],[c_181,c_2091]) ).
cnf(c_2092,plain,
( ~ elem(m_Down(A),queue(host(sK4)))
| host(sK2) != host(A)
| host(sK4) != host(sK6) ),
inference(resolve,[status(thm)],[c_2084,c_314]) ).
cnf(c_2093,plain,
( ~ elem(m_Down(A),queue(host(sK4)))
| host(sK2) != host(A)
| host(sK4) != host(sK4) ),
inference(paramod,[status(thm)],[c_187,c_2092]) ).
cnf(c_2086,plain,
( ~ elem(m_Down(A),queue(host(sK4)))
| host(sK2) != host(A) ),
inference(copy,[status(thm)],[c_2093]) ).
cnf(c_2094,negated_conjecture,
host(sK2) != host(sK5),
inference(resolve,[status(thm)],[c_2086,c_189]) ).
cnf(c_2095,negated_conjecture,
host(sK2) != host(sK2),
inference(paramod,[status(thm)],[c_186,c_2094]) ).
cnf(c_2087,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_2095]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.78 % Computer : n002.cluster.edu
% 0.11/0.78 % Model : x86_64 x86_64
% 0.11/0.78 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.78 % Memory : 8046.5625MB
% 0.11/0.78 % OS : Linux 6.8.0-71-generic
% 0.11/0.78 % CPULimit : 300
% 0.11/0.78 % WCLimit : 300
% 0.11/0.78 % DateTime : Sat Sep 26 13:57:07 UTC 2026
% 0.11/0.79 % CPUTime :
% 0.11/0.79 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.79 % Process 1905592 was started by sandbox2 on n002,
% 0.11/0.79 % Sat Sep 26 13:57:07 2026
% 0.11/0.79 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/0.80
% 0.15/0.80 % From the command line: assign(max_seconds, 300).
% 4.47/1.49
% 4.47/1.49 % SZS status Theorem for theBenchmark
% 4.47/1.49
% 4.47/1.49 % Proof 1 at 0.42 (+ 0.12) seconds.
% 4.47/1.49 % Length of proof is 20.
% 4.47/1.49 % Level of proof is 6.
% 4.47/1.49 % Maximum clause weight is 33.000.
% 4.47/1.49 % Given clauses 399.
% 4.47/1.49
% 4.47/1.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------