%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV451+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 : n031.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 88.74s 53.94s
% Output : CNFRefutation 89.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 69 ( 35 unt; 0 def)
% Number of atoms : 328 ( 152 equ)
% Maximal formula atoms : 51 ( 4 avg)
% Number of connectives : 421 ( 162 ~; 102 |; 104 &)
% ( 3 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 27 ( 27 usr; 16 con; 0-2 aty)
% Number of variables : 192 ( 28 sgn 128 !; 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(X6)) = cons(m_NotNorm(X5),X12) )
=> ( setIn(X6,alive)
=> ( ( index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm
& index(elid,host(X6)) = X5 )
=> ( ( ! [X7] :
( host(X6) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X6) = host(X13) )
=> ( host(X13) = s(zero)
=> ( ~ leq(nbr_proc,host(X13))
=> ! [X7] :
( s(host(X13)) = host(X7)
=> ( host(X6) != host(X7)
=> ! [X17,X18] :
( s(host(X13)) != host(X18)
=> ( host(X6) = host(X18)
=> ! [X19] :
( ( ( ( X7 != X6
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X6
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(axiom_35,axiom,
! [X5,X4] : head(cons(X5,X4)) = X5,
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_35) ).
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_01,axiom,
! [X3,X4] :
( s(host(X3)) = host(X4)
=> host(X3) != host(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_01) ).
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_17,axiom,
! [X5,X6] : m_Down(X5) != m_Halt(X6),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
fof(c_0_6,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(X6)) = cons(m_NotNorm(X5),X12) ) ),
introduced(definition) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( setIn(X6,alive)
=> ( ( index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm
& index(elid,host(X6)) = X5 )
=> ( ( ! [X7] :
( host(X6) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X6) = host(X13) )
=> ( host(X13) = s(zero)
=> ( ~ leq(nbr_proc,host(X13))
=> ! [X7] :
( s(host(X13)) = host(X7)
=> ( host(X6) != host(X7)
=> ! [X17,X18] :
( s(host(X13)) != host(X18)
=> ( host(X6) = host(X18)
=> ! [X19] :
( ( ( ( X7 != X6
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X6
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_6]) ).
fof(c_0_8,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(X6)) = cons(m_NotNorm(X5),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
! [X300] :
( epred1_3(esk5_0,esk8_0,esk7_0)
& setIn(esk8_0,alive)
& index(ldr,host(esk8_0)) = host(esk8_0)
& index(status,host(esk8_0)) = norm
& index(elid,host(esk8_0)) = esk7_0
& ( host(esk8_0) != host(X300)
| leq(X300,esk6_0) )
& ~ setIn(esk6_0,pids)
& host(esk8_0) = host(esk6_0)
& host(esk6_0) = s(zero)
& ~ leq(nbr_proc,host(esk6_0))
& s(host(esk6_0)) = host(esk9_0)
& host(esk8_0) != host(esk9_0)
& s(host(esk6_0)) != host(esk11_0)
& host(esk8_0) = host(esk11_0)
& ( esk9_0 != esk8_0
| esk9_0 = esk6_0 )
& ( setIn(esk9_0,alive)
| esk9_0 = esk6_0 )
& ( esk11_0 != esk8_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(esk10_0),esk5_0)
& elem(m_Down(esk12_0),snoc(queue(host(esk9_0)),m_Halt(esk6_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_7])])])])]) ).
fof(c_0_10,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(X306)) = cons(m_NotNorm(X305),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_8])])])]) ).
cnf(c_0_11,negated_conjecture,
host(esk6_0) = s(zero),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
host(esk8_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X228,X229] : head(cons(X228,X229)) = X228,
inference(variable_rename,[status(thm)],[axiom_35]) ).
cnf(c_0_14,plain,
( queue(host(X1)) = cons(m_NotNorm(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
epred1_3(esk5_0,esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
host(esk8_0) = s(zero),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
head(cons(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
cons(m_NotNorm(esk7_0),esk5_0) = queue(s(zero)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
fof(c_0_19,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_20,negated_conjecture,
m_NotNorm(esk7_0) = head(queue(s(zero))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
host(esk12_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
host(esk8_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( setIn(X1,alive)
| ~ leq(X2,X1)
| host(X2) != host(X1)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
cons(head(queue(s(zero))),esk5_0) = queue(s(zero)),
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
s(host(esk6_0)) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_27,plain,
! [X169,X170] :
( s(host(X169)) != host(X170)
| host(X169) != host(X170) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_01])]) ).
cnf(c_0_28,negated_conjecture,
host(esk12_0) = host(esk8_0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( setIn(X1,alive)
| host(X1) != host(X2)
| ~ leq(X2,X1)
| ~ setIn(X2,alive) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_31,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
( leq(X1,esk6_0)
| host(esk8_0) != host(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,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_10]) ).
cnf(c_0_34,negated_conjecture,
( elem(X1,queue(s(zero)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
elem(m_Down(esk10_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,negated_conjecture,
host(esk10_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,negated_conjecture,
host(esk9_0) = s(s(zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_12]),c_0_16]) ).
cnf(c_0_38,plain,
( s(host(X1)) != host(X2)
| host(X1) != host(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
host(esk12_0) = s(zero),
inference(rw,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_40,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( setIn(X1,alive)
| host(X1) != s(zero)
| ~ leq(esk8_0,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]) ).
cnf(c_0_42,negated_conjecture,
( leq(X1,esk6_0)
| host(X1) != s(zero) ),
inference(rw,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_43,negated_conjecture,
( host(X1) = s(zero)
| host(X2) != s(zero)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(s(zero)))
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_16]),c_0_31])]) ).
cnf(c_0_44,negated_conjecture,
elem(m_Down(esk10_0),queue(s(zero))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
host(esk10_0) = s(s(zero)),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
( host(X1) != s(s(zero))
| host(X1) != s(zero) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( X1 = esk8_0
| host(X1) != s(zero)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_16]),c_0_31])]) ).
cnf(c_0_48,negated_conjecture,
setIn(esk6_0,alive),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_12]),c_0_16]),c_0_16])]) ).
cnf(c_0_49,negated_conjecture,
( host(X1) != s(s(zero))
| host(X2) != s(zero)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( setIn(esk9_0,alive)
| esk9_0 = esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_51,negated_conjecture,
esk6_0 = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_12]),c_0_16])]) ).
fof(c_0_52,plain,
! [X250,X251,X252] :
( ( ~ elem(X250,snoc(X252,X251))
| X250 = X251
| elem(X250,X252) )
& ( X250 != X251
| elem(X250,snoc(X252,X251)) )
& ( ~ elem(X250,X252)
| elem(X250,snoc(X252,X251)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])]) ).
cnf(c_0_53,negated_conjecture,
elem(m_Down(esk12_0),snoc(queue(host(esk9_0)),m_Halt(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_54,plain,
! [X190,X191] : m_Down(X190) != m_Halt(X191),
inference(variable_rename,[status(thm)],[axiom_17]) ).
cnf(c_0_55,negated_conjecture,
( host(X1) != s(zero)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk9_0,alive)
| ~ elem(m_Down(X1),queue(s(s(zero)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_56,negated_conjecture,
( esk9_0 = esk8_0
| setIn(esk9_0,alive) ),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,negated_conjecture,
elem(m_Down(esk12_0),snoc(queue(s(s(zero))),m_Halt(esk6_0))),
inference(rw,[status(thm)],[c_0_53,c_0_37]) ).
cnf(c_0_59,plain,
m_Down(X1) != m_Halt(X2),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
s(host(esk6_0)) != host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_61,negated_conjecture,
( esk9_0 = esk8_0
| host(X1) != s(zero)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),queue(s(s(zero)))) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
elem(m_Down(esk12_0),queue(s(s(zero)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
s(host(esk8_0)) != host(esk11_0),
inference(rw,[status(thm)],[c_0_60,c_0_12]) ).
cnf(c_0_64,negated_conjecture,
( esk9_0 = esk8_0
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_39])]) ).
cnf(c_0_65,negated_conjecture,
s(host(esk8_0)) != host(esk8_0),
inference(rw,[status(thm)],[c_0_63,c_0_22]) ).
cnf(c_0_66,negated_conjecture,
esk9_0 = esk8_0,
inference(spm,[status(thm)],[c_0_64,c_0_15]) ).
cnf(c_0_67,negated_conjecture,
s(s(zero)) != s(zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_16]),c_0_16]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_66]),c_0_16]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV451+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.15/0.33 % Computer : n031.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 05:19:09 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 88.74/53.94 % Version : CSE_E---1.7
% 88.74/53.94 % Problem : theBenchmark.p
% 88.74/53.94 % SZS status Theorem for theBenchmark.p
% 88.74/53.94 % SZS output start CNFRefutation
% See solution above
% 89.03/54.28 % Total time : 42.423s
%------------------------------------------------------------------------------