%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV449+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:23:18 PM UTC 2026
% Result : Theorem 1.75s 1.84s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 235 ( 89 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 311 ( 110 ~; 62 |; 91 &)
% ( 3 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 159 ( 19 sgn 122 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) )
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( setIn(host(X7),index(acks,host(X5)))
| host(X7) = host(X6) )
=> ! [X17] :
( host(X7) = host(X17)
=> ( host(X5) = host(X17)
=> ! [X18,X19] :
( host(X7) != host(X19)
=> ( host(X5) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
fof(c_0_4,plain,
! [X13,X5,X6,X12] :
( epred1_4(X12,X6,X5,X13)
<=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_5,plain,
! [X13,X5,X6,X12] :
( epred1_4(X12,X6,X5,X13)
=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_4(X12,X6,X5,X13)
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( setIn(host(X7),index(acks,host(X5)))
| host(X7) = host(X6) )
=> ! [X17] :
( host(X7) = host(X17)
=> ( host(X5) = host(X17)
=> ! [X18,X19] :
( host(X7) != host(X19)
=> ( host(X5) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_4]) ).
fof(c_0_7,plain,
! [X306,X307,X308,X309,X310,X311,X312,X313,X314,X315,X316,X317,X318,X319,X320,X321,X322,X323,X324,X325,X326,X327,X328] :
( ( ~ setIn(X311,alive)
| ~ elem(m_Down(X311),queue(host(X310)))
| ~ epred1_4(X309,X308,X307,X306) )
& ( ~ elem(m_Down(X313),queue(host(X312)))
| ~ setIn(X313,alive)
| ~ epred1_4(X309,X308,X307,X306) )
& ( ~ elem(m_Down(X315),queue(host(X314)))
| host(X315) != host(X314)
| ~ epred1_4(X309,X308,X307,X306) )
& ( ~ elem(m_Halt(X317),queue(host(X316)))
| ~ leq(host(X316),host(X317))
| ~ epred1_4(X309,X308,X307,X306) )
& ( ~ elem(m_Ack(X320,X318),queue(host(X319)))
| ~ leq(host(X318),host(X320))
| ~ epred1_4(X309,X308,X307,X306) )
& ( setIn(X321,alive)
| ~ leq(X322,X321)
| host(X322) != host(X321)
| ~ setIn(X322,alive)
| ~ epred1_4(X309,X308,X307,X306) )
& ( X324 = X323
| host(X324) != host(X323)
| ~ setIn(X323,alive)
| ~ setIn(X324,alive)
| ~ epred1_4(X309,X308,X307,X306) )
& ( host(X327) = host(X325)
| ~ setIn(X325,alive)
| ~ setIn(X327,alive)
| host(X326) != host(X325)
| host(X328) != host(X327)
| ~ elem(m_Down(X328),queue(host(X325)))
| ~ elem(m_Down(X326),queue(host(X327)))
| ~ epred1_4(X309,X308,X307,X306) )
& ( queue(host(X307)) = cons(m_Ack(X306,X308),X309)
| ~ epred1_4(X309,X308,X307,X306) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,negated_conjecture,
( epred1_4(esk5_0,esk8_0,esk7_0,esk6_0)
& setIn(esk7_0,alive)
& index(elid,host(esk7_0)) = esk6_0
& index(status,host(esk7_0)) = elec_2
& host(esk8_0) = index(pendack,host(esk7_0))
& leq(nbr_proc,index(pendack,host(esk7_0)))
& ( setIn(host(esk9_0),index(acks,host(esk7_0)))
| host(esk9_0) = host(esk8_0) )
& host(esk9_0) = host(esk10_0)
& host(esk7_0) = host(esk10_0)
& host(esk9_0) != host(esk12_0)
& host(esk7_0) != host(esk12_0)
& host(esk12_0) != host(esk10_0)
& setIn(esk10_0,alive)
& setIn(esk12_0,alive)
& host(esk11_0) = host(esk10_0)
& host(esk13_0) = host(esk12_0)
& elem(m_Down(esk11_0),queue(host(esk12_0)))
& elem(m_Down(esk13_0),snoc(esk5_0,m_Ldr(esk7_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X248,X249,X250] :
( ( ~ elem(X248,cons(X249,X250))
| X248 = X249
| elem(X248,X250) )
& ( X248 != X249
| elem(X248,cons(X249,X250)) )
& ( ~ elem(X248,X250)
| elem(X248,cons(X249,X250)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_10,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
epred1_4(esk5_0,esk8_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
cons(m_Ack(esk6_0,esk8_0),esk5_0) = queue(host(esk7_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( host(X1) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| host(X3) != host(X2)
| host(X4) != host(X1)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ epred1_4(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( elem(X1,queue(host(esk7_0)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
host(esk11_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
host(esk7_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_19,plain,
! [X251,X252,X253] :
( ( ~ elem(X251,snoc(X253,X252))
| X251 = X252
| elem(X251,X253) )
& ( X251 != X252
| elem(X251,snoc(X253,X252)) )
& ( ~ elem(X251,X253)
| elem(X251,snoc(X253,X252)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])]) ).
fof(c_0_20,plain,
! [X193,X194] : m_Down(X193) != m_Ldr(X194),
inference(variable_rename,[status(thm)],[axiom_18]) ).
cnf(c_0_21,negated_conjecture,
( host(X1) = host(esk7_0)
| host(esk7_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X3),esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
elem(m_Down(esk11_0),queue(host(esk12_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
host(esk11_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk12_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
host(esk7_0) != host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
elem(m_Down(esk13_0),snoc(esk5_0,m_Ldr(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( host(esk12_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
elem(m_Down(esk13_0),esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
host(esk13_0) = host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV449+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 05:17:01 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.75/1.84 % Version : CSE_E---1.7
% 1.75/1.84 % Problem : theBenchmark.p
% 1.75/1.84 % SZS status Theorem for theBenchmark.p
% 1.75/1.84 % SZS output start CNFRefutation
% See solution above
% 1.75/1.84 % Total time : 1.369s
%------------------------------------------------------------------------------