%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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 : Fri Sep 25 03:13:22 PM UTC 2026
% Result : Theorem 26.72s 3.89s
% Output : Proof 26.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 17 unt; 0 def)
% Number of atoms : 261 ( 120 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 367 ( 143 ~; 82 |; 106 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 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 : 122 ( 5 sgn 94 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X,Y] :
( X != Y
<=> m_Halt(X) != m_Halt(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_26) ).
fof(f26_nnf,plain,
! [X,Y] :
( ( m_Halt(X) = m_Halt(Y)
| X != Y )
& ( m_Halt(X) != m_Halt(Y)
| X = Y ) ),
inference(nnf_transformation,[status(thm)],[f26]) ).
fof(f26_sk,plain,
! [X,Y] :
( ( m_Halt(X) = m_Halt(Y)
| X != Y )
& ( m_Halt(X) != m_Halt(Y)
| X = Y ) ),
inference(skolemisation,[status(esa)],[f26_nnf]) ).
cnf(c28,plain,
( m_Halt(X0) = m_Halt(X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f26_sk]) ).
fof(f66,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))) ) ) )
=> ! [Z] :
( host(X) != host(Z)
=> ! [W0,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(Y0),queue(host(Z)))
& elem(m_Down(W0),V) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f66_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))) ) ) )
=> ! [Z] :
( host(X) != host(Z)
=> ! [W0,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(Y0),queue(host(Z)))
& elem(m_Down(W0),V) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f66]) ).
fof(f66_nnf,plain,
? [V,W,X,Y] :
( ? [Z] :
( ? [W0,X0] :
( ? [Y0] :
( elem(m_Down(Y0),queue(host(Z)))
& elem(m_Down(W0),V)
& host(Y0) = host(X0)
& host(W0) = host(Z)
& setIn(X0,alive)
& setIn(Z,alive)
& host(X0) != host(Z) )
& host(X) = host(X0) )
& host(X) != host(Z) )
& ( index(status,host(X)) != elec_1
| ? [Z] :
( Z != host(Y)
& ~ setIn(Z,index(down,host(X)))
& leq(s(zero),Z)
& ~ leq(host(X),Z) ) )
& ( host(Y) != host(index(elid,host(X)))
| index(status,host(X)) != wait )
& ( index(status,host(X)) != norm
| index(ldr,host(X)) != host(Y) )
& ~ leq(host(X),host(Y))
& setIn(X,alive)
& queue(host(X)) = cons(m_Down(Y),V)
& ! [Z,Pid30,Pid20,Pid0] :
( ~ elem(m_Down(Pid30),queue(host(Pid20)))
| ~ elem(m_Down(Pid0),queue(host(Z)))
| host(Pid0) != host(Pid20)
| host(Pid30) != host(Z)
| ~ setIn(Pid20,alive)
| ~ setIn(Z,alive)
| host(Pid20) = host(Z) )
& ! [Z,Pid0] :
( ~ setIn(Pid0,alive)
| ~ setIn(Z,alive)
| host(Pid0) != host(Z)
| Pid0 = Z )
& ! [Z,Pid0] :
( ~ setIn(Pid0,alive)
| host(Pid0) != host(Z)
| ~ leq(Pid0,Z)
| setIn(Z,alive) )
& ! [Z,Pid20,Pid0] :
( ~ leq(host(Z),host(Pid0))
| ~ elem(m_Ack(Pid0,Z),queue(host(Pid20))) )
& ! [Z,Pid0] :
( ~ leq(host(Z),host(Pid0))
| ~ elem(m_Halt(Pid0),queue(host(Z))) )
& ! [Z,Pid0] :
( host(Pid0) != host(Z)
| ~ elem(m_Down(Pid0),queue(host(Z))) )
& ! [Z,Pid0] :
( ~ setIn(Pid0,alive)
| ~ elem(m_Down(Pid0),queue(host(Z))) )
& ! [Z,Pid0] :
( ~ elem(m_Down(Pid0),queue(host(Z)))
| ~ setIn(Pid0,alive) ) ),
inference(nnf_transformation,[status(thm)],[f66_neg]) ).
fof(f66_sk,plain,
! [Pid0,Z,Pid20,Pid30] :
( elem(m_Down(sk11),queue(host(sk8)))
& elem(m_Down(sk9),sk3)
& host(sk11) = host(sk10)
& host(sk9) = host(sk8)
& setIn(sk10,alive)
& setIn(sk8,alive)
& host(sk10) != host(sk8)
& host(sk5) = host(sk10)
& host(sk5) != host(sk8)
& ( index(status,host(sk5)) != elec_1
| ( sk7 != host(sk6)
& ~ setIn(sk7,index(down,host(sk5)))
& leq(s(zero),sk7)
& ~ leq(host(sk5),sk7) ) )
& ( host(sk6) != host(index(elid,host(sk5)))
| index(status,host(sk5)) != wait )
& ( index(status,host(sk5)) != norm
| index(ldr,host(sk5)) != host(sk6) )
& ~ leq(host(sk5),host(sk6))
& setIn(sk5,alive)
& queue(host(sk5)) = cons(m_Down(sk6),sk3)
& ( ~ elem(m_Down(Pid30),queue(host(Pid20)))
| ~ elem(m_Down(Pid0),queue(host(Z)))
| host(Pid0) != host(Pid20)
| host(Pid30) != host(Z)
| ~ setIn(Pid20,alive)
| ~ setIn(Z,alive)
| host(Pid20) = host(Z) )
& ( ~ setIn(Pid0,alive)
| ~ setIn(Z,alive)
| host(Pid0) != host(Z)
| Pid0 = Z )
& ( ~ setIn(Pid0,alive)
| host(Pid0) != host(Z)
| ~ leq(Pid0,Z)
| setIn(Z,alive) )
& ( ~ leq(host(Z),host(Pid0))
| ~ elem(m_Ack(Pid0,Z),queue(host(Pid20))) )
& ( ~ leq(host(Z),host(Pid0))
| ~ elem(m_Halt(Pid0),queue(host(Z))) )
& ( host(Pid0) != host(Z)
| ~ elem(m_Down(Pid0),queue(host(Z))) )
& ( ~ setIn(Pid0,alive)
| ~ elem(m_Down(Pid0),queue(host(Z))) )
& ( ~ elem(m_Down(Pid0),queue(host(Z)))
| ~ setIn(Pid0,alive) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk3,sk4,sk5,sk6,sk7,sk8,sk9,sk10,sk11])],[f66_nnf]) ).
cnf(c104,plain,
queue(host(sk5)) = cons(m_Down(sk6),sk3),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p163,plain,
m_Halt(queue(host(sk5))) = m_Halt(cons(m_Down(sk6),sk3)),
inference(resolution,[status(thm)],[c28,c104]) ).
cnf(c27,plain,
( m_Halt(X0) != m_Halt(X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f26_sk]) ).
cnf(p165,plain,
( m_Halt(queue(host(sk5))) != m_Halt(X0)
| cons(m_Down(sk6),sk3) = X0 ),
inference(superposition,[status(thm)],[p163,c27]) ).
cnf(p172,plain,
cons(m_Down(sk6),sk3) = queue(host(sk5)),
inference(equality_resolution,[status(thm)],[p165]) ).
fof(f46,axiom,
! [X,Y,Q] :
( elem(X,cons(Y,Q))
<=> ( elem(X,Q)
| X = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_46) ).
fof(f46_nnf,plain,
! [X,Y,Q] :
( ( ( ~ elem(X,Q)
& X != Y )
| elem(X,cons(Y,Q)) )
& ( elem(X,Q)
| X = Y
| ~ elem(X,cons(Y,Q)) ) ),
inference(nnf_transformation,[status(thm)],[f46]) ).
fof(f46_sk,plain,
! [X,Y,Q] :
( ( ( ~ elem(X,Q)
& X != Y )
| elem(X,cons(Y,Q)) )
& ( elem(X,Q)
| X = Y
| ~ elem(X,cons(Y,Q)) ) ),
inference(skolemisation,[status(esa)],[f46_nnf]) ).
cnf(c54,plain,
( ~ elem(X0,X2)
| elem(X0,cons(X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f46_sk]) ).
cnf(c120,plain,
elem(m_Down(sk9),sk3),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p292,plain,
elem(m_Down(sk9),cons(X0,sk3)),
inference(resolution,[status(thm)],[c54,c120]) ).
cnf(p294,plain,
elem(m_Down(sk9),queue(host(sk5))),
inference(superposition,[status(thm)],[p172,p292]) ).
cnf(c103,plain,
( ~ elem(m_Down(X7),queue(host(X6)))
| ~ elem(m_Down(X5),queue(host(X4)))
| host(X5) != host(X6)
| host(X7) != host(X4)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive)
| host(X6) = host(X4) ),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(c116,plain,
setIn(sk8,alive),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p152,plain,
( ~ elem(m_Down(X1),queue(host(X0)))
| ~ elem(m_Down(X2),queue(host(sk8)))
| host(X2) != host(X0)
| host(X1) != host(sk8)
| ~ setIn(X0,alive)
| host(X0) = host(sk8) ),
inference(resolution,[status(thm)],[c103,c116]) ).
cnf(c105,plain,
setIn(sk5,alive),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p155,plain,
( ~ elem(m_Down(X0),queue(host(sk5)))
| ~ elem(m_Down(X1),queue(host(sk8)))
| host(X1) != host(sk5)
| host(X0) != host(sk8)
| host(sk5) = host(sk8) ),
inference(resolution,[status(thm)],[p152,c105]) ).
cnf(c118,plain,
host(sk9) = host(sk8),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p157,plain,
( ~ elem(m_Down(sk9),queue(host(sk5)))
| ~ elem(m_Down(X0),queue(host(sk8)))
| host(X0) != host(sk5)
| host(sk5) = host(sk8) ),
inference(resolution,[status(thm)],[p155,c118]) ).
cnf(c114,plain,
host(sk5) = host(sk10),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(c119,plain,
host(sk11) = host(sk10),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p127,plain,
host(sk10) = host(sk5),
inference(superposition,[status(thm)],[c114,c119]) ).
cnf(p128,plain,
host(sk11) = host(sk5),
inference(demodulation,[status(thm)],[p127,c119]) ).
cnf(p159,plain,
( ~ elem(m_Down(sk9),queue(host(sk5)))
| ~ elem(m_Down(sk11),queue(host(sk8)))
| host(sk5) = host(sk8) ),
inference(resolution,[status(thm)],[p157,p128]) ).
cnf(c121,plain,
elem(m_Down(sk11),queue(host(sk8))),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p160,plain,
( ~ elem(m_Down(sk9),queue(host(sk5)))
| host(sk5) = host(sk8) ),
inference(resolution,[status(thm)],[p159,c121]) ).
cnf(p299,plain,
host(sk5) = host(sk8),
inference(resolution,[status(thm)],[p294,p160]) ).
cnf(c113,plain,
host(sk5) != host(sk8),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(p303,plain,
$false,
inference(resolution,[status(thm)],[p299,c113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 19:45:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 26.72/3.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.72/3.89 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------