%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV452+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n004.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 10.78s 7.07s
% Output : CNFRefutation 10.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 251 ( 109 equ)
% Maximal formula atoms : 50 ( 8 avg)
% Number of connectives : 341 ( 120 ~; 73 |; 101 &)
% ( 2 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 141 ( 16 sgn 110 !; 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_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ( ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X5) = host(X13) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( ( ( X7 != X5
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X5
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X19),X12)
& elem(m_Down(X17),queue(host(X18))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(c_0_2,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
<=> ( ! [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_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_3,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
=> ( ! [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_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_2]) ).
fof(c_0_4,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ( ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X5) = host(X13) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( ( ( X7 != X5
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X5
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X19),X12)
& elem(m_Down(X17),queue(host(X18))) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_2]) ).
fof(c_0_5,plain,
! [X305,X306,X307,X308,X309,X310,X311,X312,X313,X314,X315,X316,X317,X318,X319,X320,X321,X322,X323,X324,X325,X326] :
( ( ~ setIn(X309,alive)
| ~ elem(m_Down(X309),queue(host(X308)))
| ~ epred1_3(X307,X306,X305) )
& ( ~ elem(m_Down(X311),queue(host(X310)))
| ~ setIn(X311,alive)
| ~ epred1_3(X307,X306,X305) )
& ( ~ elem(m_Down(X313),queue(host(X312)))
| host(X313) != host(X312)
| ~ epred1_3(X307,X306,X305) )
& ( ~ elem(m_Halt(X315),queue(host(X314)))
| ~ leq(host(X314),host(X315))
| ~ epred1_3(X307,X306,X305) )
& ( ~ elem(m_Ack(X318,X316),queue(host(X317)))
| ~ leq(host(X316),host(X318))
| ~ epred1_3(X307,X306,X305) )
& ( setIn(X319,alive)
| ~ leq(X320,X319)
| host(X320) != host(X319)
| ~ setIn(X320,alive)
| ~ epred1_3(X307,X306,X305) )
& ( X322 = X321
| host(X322) != host(X321)
| ~ setIn(X321,alive)
| ~ setIn(X322,alive)
| ~ epred1_3(X307,X306,X305) )
& ( host(X325) = host(X323)
| ~ setIn(X323,alive)
| ~ setIn(X325,alive)
| host(X324) != host(X323)
| host(X326) != host(X325)
| ~ elem(m_Down(X326),queue(host(X323)))
| ~ elem(m_Down(X324),queue(host(X325)))
| ~ epred1_3(X307,X306,X305) )
& ( queue(host(X305)) = cons(m_Down(X306),X307)
| ~ epred1_3(X307,X306,X305) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,negated_conjecture,
! [X300] :
( epred1_3(esk5_0,esk8_0,esk7_0)
& setIn(esk7_0,alive)
& ~ leq(host(esk7_0),host(esk8_0))
& ( index(status,host(esk7_0)) = wait
| index(ldr,host(esk7_0)) = host(esk8_0) )
& ( host(esk8_0) = host(index(elid,host(esk7_0)))
| index(ldr,host(esk7_0)) = host(esk8_0) )
& ( index(status,host(esk7_0)) = wait
| index(status,host(esk7_0)) = norm )
& ( host(esk8_0) = host(index(elid,host(esk7_0)))
| index(status,host(esk7_0)) = norm )
& ( host(esk7_0) != host(X300)
| leq(X300,esk6_0) )
& ~ setIn(esk6_0,pids)
& host(esk7_0) = host(esk6_0)
& host(esk6_0) != s(zero)
& host(esk7_0) = host(esk9_0)
& host(esk7_0) != host(esk11_0)
& ( esk9_0 != esk7_0
| esk9_0 = esk6_0 )
& ( setIn(esk9_0,alive)
| esk9_0 = esk6_0 )
& ( esk11_0 != esk7_0
| esk11_0 = esk6_0 )
& ( setIn(esk11_0,alive)
| esk11_0 = esk6_0 )
& host(esk11_0) != host(esk9_0)
& host(esk10_0) = host(esk9_0)
& host(esk12_0) = host(esk11_0)
& elem(m_Down(esk12_0),esk5_0)
& elem(m_Down(esk10_0),queue(host(esk11_0))) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,plain,
! [X247,X248,X249] :
( ( ~ elem(X247,cons(X248,X249))
| X247 = X248
| elem(X247,X249) )
& ( X247 != X248
| elem(X247,cons(X248,X249)) )
& ( ~ elem(X247,X249)
| elem(X247,cons(X248,X249)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_8,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
epred1_3(esk5_0,esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
cons(m_Down(esk8_0),esk5_0) = queue(host(esk7_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,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_3(X5,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( elem(X1,queue(host(esk7_0)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
host(esk10_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
host(esk7_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( host(X1) = host(esk7_0)
| host(esk7_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ 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_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
elem(m_Down(esk10_0),queue(host(esk11_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
host(esk10_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
host(esk7_0) != host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
( host(esk11_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk11_0,alive)
| ~ elem(m_Down(X1),esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( setIn(esk11_0,alive)
| esk11_0 = esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( esk11_0 = esk6_0
| host(esk11_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
elem(m_Down(esk12_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
host(esk12_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
( esk11_0 = esk6_0
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_27,negated_conjecture,
esk11_0 = esk6_0,
inference(spm,[status(thm)],[c_0_26,c_0_9]) ).
cnf(c_0_28,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV452+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.18/0.33 % Computer : n004.cluster.edu
% 0.18/0.33 % Model : x86_64 x86_64
% 0.18/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.33 % Memory : 8042.1875MB
% 0.18/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 300
% 0.18/0.33 % DateTime : Tue May 5 05:17:02 EDT 2026
% 0.18/0.33 % CPUTime :
% 0.18/0.34 % start to proof: theBenchmark
% 10.78/7.07 % Version : CSE_E---1.7
% 10.78/7.07 % Problem : theBenchmark.p
% 10.78/7.07 % SZS status Theorem for theBenchmark.p
% 10.78/7.07 % SZS output start CNFRefutation
% See solution above
% 10.78/7.11 % Total time : 5.371s
%------------------------------------------------------------------------------