%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV455+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 : n029.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.94s 1.90s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 226 ( 85 equ)
% Maximal formula atoms : 46 ( 8 avg)
% Number of connectives : 318 ( 119 ~; 61 |; 93 &)
% ( 2 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 135 ( 15 sgn 109 !; 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] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X17,X18] :
( host(X5) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X7)
& setIn(X7,alive)
& setIn(X18,alive)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X7))) ) ) ) ) ) ) ) ) ),
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(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,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] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X17,X18] :
( host(X5) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X7)
& setIn(X7,alive)
& setIn(X18,alive)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X7))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_2]) ).
fof(c_0_4,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_5,negated_conjecture,
( epred1_3(esk5_0,esk7_0,esk6_0)
& setIn(esk6_0,alive)
& ~ leq(host(esk6_0),host(esk7_0))
& ( index(ldr,host(esk6_0)) != host(esk7_0)
| index(status,host(esk6_0)) != norm )
& ( index(status,host(esk6_0)) != wait
| host(esk7_0) != host(index(elid,host(esk6_0))) )
& ( ~ leq(host(esk6_0),esk8_0)
| index(status,host(esk6_0)) != elec_1 )
& ( leq(s(zero),esk8_0)
| index(status,host(esk6_0)) != elec_1 )
& ( ~ setIn(esk8_0,index(down,host(esk6_0)))
| index(status,host(esk6_0)) != elec_1 )
& ( esk8_0 != host(esk7_0)
| index(status,host(esk6_0)) != elec_1 )
& host(esk6_0) != host(esk9_0)
& host(esk6_0) = host(esk11_0)
& host(esk11_0) != host(esk9_0)
& setIn(esk9_0,alive)
& setIn(esk11_0,alive)
& host(esk10_0) = host(esk9_0)
& host(esk12_0) = host(esk11_0)
& elem(m_Down(esk10_0),esk5_0)
& elem(m_Down(esk12_0),queue(host(esk9_0))) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X304,X305,X306,X307,X308,X309,X310,X311,X312,X313,X314,X315,X316,X317,X318,X319,X320,X321,X322,X323,X324,X325] :
( ( ~ setIn(X308,alive)
| ~ elem(m_Down(X308),queue(host(X307)))
| ~ epred1_3(X306,X305,X304) )
& ( ~ elem(m_Down(X310),queue(host(X309)))
| ~ setIn(X310,alive)
| ~ epred1_3(X306,X305,X304) )
& ( ~ elem(m_Down(X312),queue(host(X311)))
| host(X312) != host(X311)
| ~ epred1_3(X306,X305,X304) )
& ( ~ elem(m_Halt(X314),queue(host(X313)))
| ~ leq(host(X313),host(X314))
| ~ epred1_3(X306,X305,X304) )
& ( ~ elem(m_Ack(X317,X315),queue(host(X316)))
| ~ leq(host(X315),host(X317))
| ~ epred1_3(X306,X305,X304) )
& ( setIn(X318,alive)
| ~ leq(X319,X318)
| host(X319) != host(X318)
| ~ setIn(X319,alive)
| ~ epred1_3(X306,X305,X304) )
& ( X321 = X320
| host(X321) != host(X320)
| ~ setIn(X320,alive)
| ~ setIn(X321,alive)
| ~ epred1_3(X306,X305,X304) )
& ( host(X324) = host(X322)
| ~ setIn(X322,alive)
| ~ setIn(X324,alive)
| host(X323) != host(X322)
| host(X325) != host(X324)
| ~ elem(m_Down(X325),queue(host(X322)))
| ~ elem(m_Down(X323),queue(host(X324)))
| ~ epred1_3(X306,X305,X304) )
& ( queue(host(X304)) = cons(m_Down(X305),X306)
| ~ epred1_3(X306,X305,X304) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,negated_conjecture,
host(esk12_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
host(esk6_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,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_10,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
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_6]) ).
cnf(c_0_13,negated_conjecture,
elem(m_Down(esk12_0),queue(host(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
host(esk12_0) = host(esk6_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( host(X1) = host(esk9_0)
| host(esk9_0) != host(X2)
| host(X1) != host(esk6_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
( elem(X1,queue(host(esk6_0)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
host(esk6_0) != host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( host(esk9_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
elem(m_Down(esk10_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
host(esk10_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV455+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % 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.32 % Computer : n029.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 05:17:14 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.94/1.90 % Version : CSE_E---1.7
% 1.94/1.90 % Problem : theBenchmark.p
% 1.94/1.90 % SZS status Theorem for theBenchmark.p
% 1.94/1.90 % SZS output start CNFRefutation
% See solution above
% 1.94/1.90 % Total time : 1.372s
%------------------------------------------------------------------------------