%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV452+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 : n001.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 7.02s 1.38s
% Output : CNFRefutation 7.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 49 ( 24 unt; 0 def)
% Number of atoms : 358 ( 171 equ)
% Maximal formula atoms : 56 ( 7 avg)
% Number of connectives : 502 ( 193 ~; 133 |; 139 &)
% ( 1 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 5 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 : 159 ( 2 sgn 119 !; 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) ) )
=> ( ( host(X) = host(W)
& ~ setIn(W,pids)
& ! [Z] :
( host(X) = host(Z)
=> leq(Z,W) ) )
=> ( host(W) != s(zero)
=> ! [Z] :
( host(X) = host(Z)
=> ! [X0,Y0] :
( host(X) != host(Y0)
=> ! [Z0] :
( ( host(Z0) = host(Y0)
& host(X0) = host(Z)
& host(Y0) != host(Z)
& ( Y0 = W
| ( setIn(Y0,alive)
& Y0 != X ) )
& ( Z = W
| ( setIn(Z,alive)
& Z != X ) ) )
=> ~ ( elem(m_Down(X0),queue(host(Y0)))
& elem(m_Down(Z0),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) ) )
=> ( ( host(X) = host(W)
& ~ setIn(W,pids)
& ! [Z] :
( host(X) = host(Z)
=> leq(Z,W) ) )
=> ( host(W) != s(zero)
=> ! [Z] :
( host(X) = host(Z)
=> ! [X0,Y0] :
( host(X) != host(Y0)
=> ! [Z0] :
( ( host(Z0) = host(Y0)
& host(X0) = host(Z)
& host(Y0) != host(Z)
& ( Y0 = W
| ( setIn(Y0,alive)
& Y0 != X ) )
& ( Z = W
| ( setIn(Z,alive)
& Z != X ) ) )
=> ~ ( elem(m_Down(X0),queue(host(Y0)))
& elem(m_Down(Z0),V) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
cnf(c_115,plain,
( ~ elem(A,C)
| elem(A,cons(B,C)) ),
inference(clausify,[status(thm)],[axiom_46]) ).
fof(nnf_58,plain,
? [V,W,X,Y] :
( ? [Z] :
( ? [X0,Y0] :
( ? [Z0] :
( elem(m_Down(X0),queue(host(Y0)))
& elem(m_Down(Z0),V)
& host(Z0) = host(Y0)
& host(X0) = host(Z)
& host(Y0) != host(Z)
& ( Y0 = W
| ( setIn(Y0,alive)
& Y0 != X ) )
& ( W = Z
| ( setIn(Z,alive)
& Z != X ) ) )
& host(Y0) != host(X) )
& host(Z) = host(X) )
& s(zero) != host(W)
& host(W) = host(X)
& ~ setIn(W,pids)
& ! [X19] :
( leq(X19,W)
| host(X19) != host(X) )
& ( ( 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_sk,plain,
( elem(m_Down(sK6),queue(host(sK5)))
& elem(m_Down(sK7),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)
& host(sK4) = host(sK2)
& s(zero) != host(sK3)
& host(sK3) = host(sK2)
& ~ setIn(sK3,pids)
& ! [X19] :
( leq(X19,sK3)
| host(X19) != host(sK2) )
& ( ( 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,sK7]),skolemize(V,sK1),skolemize(W,sK3),skolemize(X,sK2),skolemize(Y,sK0),skolemize(Z,sK4),skolemize(X0,sK6),skolemize(Y0,sK5),skolemize(Z0,sK7)],[nnf_58]) ).
fof(sk_conj_neg,plain,
( elem(m_Down(sK6),queue(host(sK5)))
& elem(m_Down(sK7),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)
& host(sK4) = host(sK2)
& s(zero) != host(sK3)
& host(sK3) = host(sK2)
& ~ setIn(sK3,pids)
& ! [VAR_0] :
( leq(VAR_0,sK3)
| host(VAR_0) != host(sK2) )
& ( host(index(elid,host(sK2))) = host(sK0)
| index(status,host(sK2)) = norm )
& ( index(status,host(sK2)) = wait
| index(status,host(sK2)) = norm )
& ( host(index(elid,host(sK2))) = host(sK0)
| index(ldr,host(sK2)) = host(sK0) )
& ( index(status,host(sK2)) = wait
| index(ldr,host(sK2)) = host(sK0) )
& ~ leq(host(sK2),host(sK0))
& setIn(sK2,alive)
& cons(m_Down(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_160,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_162,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_163,negated_conjecture,
cons(m_Down(sK0),sK1) = queue(host(sK2)),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_164,negated_conjecture,
queue(host(sK2)) = cons(m_Down(sK0),sK1),
inference(copy,[status(thm)],[c_163]) ).
cnf(c_165,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_179,negated_conjecture,
host(sK4) = host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_180,negated_conjecture,
host(sK4) = host(sK3),
inference(paramod,[status(thm)],[c_177,c_179]) ).
cnf(c_181,negated_conjecture,
host(sK5) != host(sK2),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_182,negated_conjecture,
host(sK5) != host(sK3),
inference(paramod,[status(thm)],[c_177,c_181]) ).
cnf(c_188,negated_conjecture,
( sK5 = sK3
| setIn(sK5,alive) ),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_190,negated_conjecture,
host(sK6) = host(sK4),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_191,negated_conjecture,
host(sK6) = host(sK3),
inference(paramod,[status(thm)],[c_180,c_190]) ).
cnf(c_192,negated_conjecture,
host(sK7) = host(sK5),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_193,negated_conjecture,
elem(m_Down(sK7),sK1),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_194,negated_conjecture,
elem(m_Down(sK6),queue(host(sK5))),
inference(split_conjunct,[status(thm)],[sk_conj_neg]) ).
cnf(c_195,negated_conjecture,
( leq(A,sK3)
| host(sK3) != host(A) ),
inference(paramod,[status(thm)],[c_177,c_174]) ).
cnf(c_201,negated_conjecture,
queue(host(sK3)) = cons(m_Down(sK0),sK1),
inference(paramod,[status(thm)],[c_177,c_164]) ).
cnf(c_3470,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_165,c_162]) ).
cnf(c_3471,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_3470]) ).
cnf(c_3472,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_3471]) ).
cnf(c_3473,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_3472]) ).
cnf(c_310,negated_conjecture,
( ~ elem(m_Down(B),cons(m_Down(sK0),sK1))
| ~ 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_201,c_3473]) ).
cnf(c_3474,negated_conjecture,
( ~ setIn(sK2,alive)
| ~ leq(sK2,sK3)
| setIn(sK3,alive) ),
inference(resolve,[status(thm)],[c_177,c_160]) ).
cnf(c_317,negated_conjecture,
( ~ leq(sK2,sK3)
| setIn(sK3,alive) ),
inference(resolve,[status(thm)],[c_165,c_3474]) ).
cnf(c_417,plain,
elem(m_Down(sK7),cons(A,sK1)),
inference(resolve,[status(thm)],[c_193,c_115]) ).
cnf(c_3475,negated_conjecture,
host(sK3) = host(sK2),
inference(copy,[status(thm)],[c_177]) ).
cnf(c_429,negated_conjecture,
leq(sK2,sK3),
inference(resolve,[status(thm)],[c_195,c_3475]) ).
cnf(c_431,negated_conjecture,
setIn(sK3,alive),
inference(resolve,[status(thm)],[c_429,c_317]) ).
cnf(c_3476,negated_conjecture,
( ~ elem(m_Down(sK7),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(A),queue(host(sK5)))
| host(sK3) != host(A)
| ~ setIn(sK5,alive)
| host(sK3) = host(sK5) ),
inference(resolve,[status(thm)],[c_310,c_192]) ).
cnf(c_3477,negated_conjecture,
( ~ elem(m_Down(sK7),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(A),queue(host(sK5)))
| host(sK3) != host(A)
| ~ setIn(sK5,alive)
| host(sK5) = host(sK3) ),
inference(copy,[status(thm)],[c_3476]) ).
cnf(c_3478,negated_conjecture,
( ~ elem(m_Down(sK7),cons(m_Down(sK0),sK1))
| ~ elem(m_Down(A),queue(host(sK5)))
| host(sK3) != host(A)
| ~ setIn(sK5,alive) ),
inference(resolve,[status(thm)],[c_182,c_3477]) ).
cnf(c_3441,negated_conjecture,
( ~ elem(m_Down(A),queue(host(sK5)))
| host(sK3) != host(A)
| ~ setIn(sK5,alive) ),
inference(resolve,[status(thm)],[c_417,c_3478]) ).
cnf(c_3479,negated_conjecture,
host(sK3) = host(sK6),
inference(copy,[status(thm)],[c_191]) ).
cnf(c_3480,negated_conjecture,
( ~ elem(m_Down(sK6),queue(host(sK5)))
| ~ setIn(sK5,alive) ),
inference(resolve,[status(thm)],[c_3441,c_3479]) ).
cnf(c_3467,negated_conjecture,
~ setIn(sK5,alive),
inference(resolve,[status(thm)],[c_194,c_3480]) ).
cnf(c_3468,negated_conjecture,
sK5 = sK3,
inference(resolve,[status(thm)],[c_3467,c_188]) ).
cnf(c_3481,negated_conjecture,
~ setIn(sK3,alive),
inference(paramod,[status(thm)],[c_3468,c_3467]) ).
cnf(c_3469,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_431,c_3481]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 14:00:15 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1956026 was started by sandbox on n001,
% 0.10/0.37 % Sat Sep 26 14:00:15 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 7.02/1.38
% 7.02/1.38 % SZS status Theorem for theBenchmark
% 7.02/1.38
% 7.02/1.38 % Proof 1 at 0.67 (+ 0.20) seconds.
% 7.02/1.38 % Length of proof is 33.
% 7.02/1.38 % Level of proof is 8.
% 7.02/1.38 % Maximum clause weight is 48.000.
% 7.02/1.38 % Given clauses 451.
% 7.02/1.38
% 7.02/1.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------