%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV474+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 : Thu Sep 24 02:55:36 PM UTC 2026
% Result : Theorem 183.65s 27.22s
% Output : CNFRefutation 183.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 69 ( 33 unt; 0 def)
% Number of atoms : 538 ( 252 equ)
% Maximal formula atoms : 86 ( 7 avg)
% Number of connectives : 730 ( 261 ~; 181 |; 210 &)
% ( 3 <=>; 75 =>; 0 <=; 0 <~>)
% Maximal formula depth : 53 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 19 con; 0-7 aty)
% Number of variables : 269 ( 44 sgn 193 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( setIn(host(X16),index(down,host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X15,X14] :
( ( host(index(elid,host(X14))) = host(X15)
& index(status,host(X14)) = wait
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( index(ldr,host(X14)) = host(X15)
& index(status,host(X14)) = norm
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ~ ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,X20] :
( host(X5) = host(X20)
=> ( ( index(status,host(X20)) = elec_1
& host(X20) = nbr_proc
& host(X20) = host(X18)
& elem(m_Down(X19),X12)
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X20),X17) )
=> ( X17 = host(X19)
| X17 = host(X6)
| setIn(X17,index(down,host(X5))) ) ) )
=> ~ ( elem(m_Down(X18),queue(host(X7)))
& setIn(X7,alive) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X6,X5)
& leq(X5,X6) )
<=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
fof(c_0_5,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( setIn(host(X16),index(down,host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X15,X14] :
( ( host(index(elid,host(X14))) = host(X15)
& index(status,host(X14)) = wait
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( index(ldr,host(X14)) = host(X15)
& index(status,host(X14)) = norm
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ~ ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,X20] :
( host(X5) = host(X20)
=> ( ( index(status,host(X20)) = elec_1
& host(X20) = nbr_proc
& host(X20) = host(X18)
& elem(m_Down(X19),X12)
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X20),X17) )
=> ( X17 = host(X19)
| X17 = host(X6)
| setIn(X17,index(down,host(X5))) ) ) )
=> ~ ( elem(m_Down(X18),queue(host(X7)))
& setIn(X7,alive) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_6,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
<=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( setIn(host(X16),index(down,host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X15,X14] :
( ( host(index(elid,host(X14))) = host(X15)
& index(status,host(X14)) = wait
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( index(ldr,host(X14)) = host(X15)
& index(status,host(X14)) = norm
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) ) ),
introduced(definition) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X5,X6)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ~ ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,X20] :
( host(X5) = host(X20)
=> ( ( index(status,host(X20)) = elec_1
& host(X20) = nbr_proc
& host(X20) = host(X18)
& elem(m_Down(X19),X12)
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X20),X17) )
=> ( X17 = host(X19)
| X17 = host(X6)
| setIn(X17,index(down,host(X5))) ) ) )
=> ~ ( elem(m_Down(X18),queue(host(X7)))
& setIn(X7,alive) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5]),c_0_6]) ).
fof(c_0_8,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( setIn(host(X16),index(down,host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X15,X14] :
( ( host(index(elid,host(X14))) = host(X15)
& index(status,host(X14)) = wait
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( index(ldr,host(X14)) = host(X15)
& index(status,host(X14)) = norm
& host(X14) = host(X7)
& setIn(X14,alive)
& host(X14) != host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
! [X158] :
( elem(m_Down(esk10_0),queue(host(esk9_0)))
& setIn(esk9_0,alive)
& index(status,host(esk12_0)) = elec_1
& host(esk12_0) = nbr_proc
& host(esk12_0) = host(esk10_0)
& elem(m_Down(esk11_0),esk5_0)
& ( X158 = host(esk11_0)
| X158 = host(esk7_0)
| setIn(X158,index(down,host(esk6_0)))
| ~ leq(s(zero),X158)
| leq(host(esk12_0),X158) )
& host(esk6_0) = host(esk12_0)
& host(esk6_0) != host(esk9_0)
& ( index(status,host(esk6_0)) != elec_1
| esk8_0 != host(esk7_0) )
& ( index(status,host(esk6_0)) != elec_1
| ~ setIn(esk8_0,index(down,host(esk6_0))) )
& ( index(status,host(esk6_0)) != elec_1
| leq(s(zero),esk8_0) )
& ( index(status,host(esk6_0)) != elec_1
| ~ leq(host(esk6_0),esk8_0) )
& ( host(esk7_0) != host(index(elid,host(esk6_0)))
| index(status,host(esk6_0)) != wait )
& ( index(status,host(esk6_0)) != norm
| index(ldr,host(esk6_0)) != host(esk7_0) )
& ~ leq(host(esk6_0),host(esk7_0))
& setIn(esk6_0,alive)
& epred1_3(esk5_0,esk6_0,esk7_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])]) ).
fof(c_0_10,plain,
! [X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179,X180,X181,X182,X183,X184,X185,X186,X187,X188] :
( ( ~ epred1_3(X161,X160,X159)
| queue(host(X160)) = cons(m_Down(X159),X161) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X186),queue(host(X185)))
| ~ setIn(X185,alive)
| index(status,host(X188)) != elec_1
| host(X188) != host(X186)
| host(X188) != nbr_proc
| ~ elem(m_Down(X187),queue(host(X188)))
| esk13_7(X159,X160,X161,X185,X186,X187,X188) != host(X187) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X186),queue(host(X185)))
| ~ setIn(X185,alive)
| index(status,host(X188)) != elec_1
| host(X188) != host(X186)
| host(X188) != nbr_proc
| ~ elem(m_Down(X187),queue(host(X188)))
| ~ setIn(esk13_7(X159,X160,X161,X185,X186,X187,X188),index(down,host(X188))) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X186),queue(host(X185)))
| ~ setIn(X185,alive)
| index(status,host(X188)) != elec_1
| host(X188) != host(X186)
| host(X188) != nbr_proc
| ~ elem(m_Down(X187),queue(host(X188)))
| leq(s(zero),esk13_7(X159,X160,X161,X185,X186,X187,X188)) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X186),queue(host(X185)))
| ~ setIn(X185,alive)
| index(status,host(X188)) != elec_1
| host(X188) != host(X186)
| host(X188) != nbr_proc
| ~ elem(m_Down(X187),queue(host(X188)))
| ~ leq(host(X188),esk13_7(X159,X160,X161,X185,X186,X187,X188)) )
& ( ~ epred1_3(X161,X160,X159)
| ~ setIn(host(X182),index(down,host(X183)))
| ~ elem(m_Down(X184),queue(host(X181)))
| host(X184) != host(X183)
| host(X182) != host(X181)
| ~ setIn(X183,alive)
| ~ setIn(X181,alive)
| host(X183) = host(X181) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X178),queue(host(X179)))
| ~ elem(m_Down(X180),queue(host(X177)))
| host(X180) != host(X179)
| host(X178) != host(X177)
| ~ setIn(X179,alive)
| ~ setIn(X177,alive)
| host(X179) = host(X177) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X174),queue(host(X175)))
| host(index(elid,host(X176))) != host(X175)
| index(status,host(X176)) != wait
| host(X176) != host(X174)
| ~ setIn(X176,alive)
| host(X176) = host(X175) )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_Down(X171),queue(host(X172)))
| index(ldr,host(X173)) != host(X172)
| index(status,host(X173)) != norm
| host(X173) != host(X171)
| ~ setIn(X173,alive)
| host(X173) = host(X172) )
& ( ~ epred1_3(X161,X160,X159)
| index(elid,host(X170)) = X170
| ~ setIn(X170,alive)
| index(status,host(X170)) != elec_2 )
& ( ~ epred1_3(X161,X160,X159)
| index(elid,host(X170)) = X170
| ~ setIn(X170,alive)
| index(status,host(X170)) != elec_1 )
& ( ~ epred1_3(X161,X160,X159)
| ~ setIn(X169,alive)
| ~ setIn(X168,alive)
| host(X169) != host(X168)
| X169 = X168 )
& ( ~ epred1_3(X161,X160,X159)
| ~ elem(m_NotNorm(X166),queue(host(X167)))
| host(X167) != nbr_proc )
& ( ~ epred1_3(X161,X160,X159)
| host(X165) != host(X164)
| ~ elem(m_Down(X165),queue(host(X164))) )
& ( ~ epred1_3(X161,X160,X159)
| ~ leq(host(X162),host(X163))
| ~ elem(m_Ldr(X163),queue(host(X162))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
host(esk6_0) = host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
host(esk12_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ epred1_3(X5,X6,X7)
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Down(X4),queue(host(X2)))
| host(X4) != host(X1)
| host(X3) != host(X2)
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X1) = host(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
host(esk6_0) != host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
index(status,host(esk12_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ epred1_3(X5,X6,X7)
| ~ setIn(host(X3),index(down,host(X1)))
| ~ elem(m_Down(X4),queue(host(X2)))
| host(X4) != host(X1)
| host(X3) != host(X2)
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X1) = host(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X3),queue(host(esk9_0)))
| ~ setIn(X1,alive)
| ~ epred1_3(X4,X5,X6)
| host(X1) != host(X3)
| host(esk9_0) != host(X2)
| host(X1) = host(esk9_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
host(esk9_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
host(esk12_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( index(status,host(esk6_0)) != elec_1
| ~ setIn(esk8_0,index(down,host(esk6_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
index(status,nbr_proc) = elec_1,
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ leq(s(zero),X1)
| X1 = host(esk11_0)
| X1 = host(esk7_0)
| setIn(X1,index(down,host(esk6_0)))
| leq(host(esk12_0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( index(status,host(esk6_0)) != elec_1
| leq(s(zero),esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( index(status,host(esk6_0)) != elec_1
| esk8_0 != host(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( index(status,host(esk6_0)) != elec_1
| ~ leq(host(esk6_0),esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( ~ elem(m_Down(X3),queue(host(esk9_0)))
| ~ setIn(X1,alive)
| ~ setIn(host(X2),index(down,host(X1)))
| ~ epred1_3(X4,X5,X6)
| host(X1) != host(X3)
| host(esk9_0) != host(X2)
| host(X1) = host(esk9_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ elem(m_Down(X2),queue(host(esk9_0)))
| ~ epred1_3(X3,X4,X5)
| host(X2) != nbr_proc
| host(esk9_0) != host(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_16]),c_0_16]),c_0_21]) ).
cnf(c_0_31,negated_conjecture,
host(esk10_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_32,negated_conjecture,
elem(m_Down(esk10_0),queue(host(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
~ setIn(esk8_0,index(down,nbr_proc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_16]),c_0_24]),c_0_16])]) ).
cnf(c_0_34,negated_conjecture,
( ~ leq(s(zero),X1)
| setIn(X1,index(down,nbr_proc))
| leq(nbr_proc,X1)
| X1 = host(esk7_0)
| X1 = host(esk11_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_12]),c_0_16]) ).
cnf(c_0_35,negated_conjecture,
leq(s(zero),esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_16]),c_0_24])]) ).
cnf(c_0_36,negated_conjecture,
host(esk7_0) != esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_16]),c_0_24])]) ).
cnf(c_0_37,negated_conjecture,
~ leq(nbr_proc,esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_16]),c_0_24]),c_0_16])]) ).
cnf(c_0_38,negated_conjecture,
( ~ elem(m_Down(X2),queue(host(esk9_0)))
| ~ setIn(host(X1),index(down,nbr_proc))
| ~ epred1_3(X3,X4,X5)
| host(X2) != nbr_proc
| host(esk9_0) != host(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_16]),c_0_16]),c_0_16]),c_0_21]) ).
cnf(c_0_39,negated_conjecture,
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ epred1_3(X2,X3,X4)
| host(esk9_0) != host(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
host(esk11_0) = esk8_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_36]),c_0_37]) ).
fof(c_0_41,plain,
! [X101,X102,X103] :
( ( elem(X101,cons(X102,X103))
| ~ elem(X101,X103) )
& ( elem(X101,cons(X102,X103))
| X101 != X102 )
& ( elem(X101,X103)
| X101 = X102
| ~ elem(X101,cons(X102,X103)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
cnf(c_0_42,plain,
( ~ epred1_3(X3,X1,X2)
| queue(host(X1)) = cons(m_Down(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_44,negated_conjecture,
( ~ setIn(host(X1),index(down,nbr_proc))
| ~ epred1_3(X2,X3,X4)
| host(esk9_0) != host(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_32])]) ).
cnf(c_0_45,negated_conjecture,
( ~ elem(m_Down(esk11_0),queue(nbr_proc))
| ~ epred1_3(X1,X2,X3)
| host(esk9_0) != esk8_0 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( ~ elem(X1,X2)
| elem(X1,cons(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_16]) ).
cnf(c_0_48,negated_conjecture,
( ~ setIn(host(esk9_0),index(down,nbr_proc))
| ~ epred1_3(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_44]) ).
fof(c_0_49,plain,
! [X25] : leq(s(zero),host(X25)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_50,negated_conjecture,
( ~ elem(m_Down(esk11_0),queue(nbr_proc))
| host(esk9_0) != esk8_0 ),
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( ~ elem(X1,esk5_0)
| elem(X1,queue(nbr_proc)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
elem(m_Down(esk11_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_53,plain,
! [X140,X141] :
( ( X140 != X141
| leq(X141,X140) )
& ( X140 != X141
| leq(X140,X141) )
& ( X140 = X141
| ~ leq(X141,X140)
| ~ leq(X140,X141) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
cnf(c_0_54,negated_conjecture,
~ setIn(host(esk9_0),index(down,nbr_proc)),
inference(spm,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( ~ leq(s(zero),X1)
| setIn(X1,index(down,nbr_proc))
| leq(nbr_proc,X1)
| X1 = esk8_0
| X1 = host(esk7_0) ),
inference(rw,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_56,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,negated_conjecture,
host(esk9_0) != esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
fof(c_0_58,plain,
! [X26] : leq(host(X26),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_59,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( leq(nbr_proc,host(esk9_0))
| host(esk9_0) = host(esk7_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_61,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_62,plain,
( X1 != X2
| elem(X1,cons(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_63,negated_conjecture,
host(esk9_0) = host(esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),c_0_21]) ).
cnf(c_0_64,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ epred1_3(X2,X3,X4)
| host(esk7_0) != host(X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
elem(m_Down(esk7_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_64,c_0_47]) ).
cnf(c_0_67,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_65]),c_0_66])]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_43,c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV474+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 % Computer : n006.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 21 08:52:57 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.47 Running first-order theorem proving
% 0.17/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 183.65/27.22 % Version: 3.5.1
% 183.65/27.22 % Preprocessing class: FSLSSMSMSSSNFFN.
% 183.65/27.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.65/27.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 183.65/27.22 % Starting new_bool_3 with 300s (1) cores
% 183.65/27.22 % Starting new_bool_1 with 300s (1) cores
% 183.65/27.22 % Starting sh5l with 300s (1) cores
% 183.65/27.22 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2476819 completed with status 0
% 183.65/27.22 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 183.65/27.22 % Preprocessing class: FSLSSMSMSSSNFFN.
% 183.65/27.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.65/27.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 183.65/27.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.65/27.22 % No SInE strategy applied
% 183.65/27.22 % Search class: FGHSM-FFMM31-MFFFFFNN
% 183.65/27.22 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 183.65/27.22 % Starting SubtermCWHack with 136s (1) cores
% 183.65/27.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 183.65/27.22 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 183.65/27.22 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 183.65/27.22 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 183.65/27.22 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 2476828 completed with status 0
% 183.65/27.22 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 183.65/27.22 % Preprocessing class: FSLSSMSMSSSNFFN.
% 183.65/27.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.65/27.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 183.65/27.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.65/27.22 % No SInE strategy applied
% 183.65/27.22 % Search class: FGHSM-FFMM31-MFFFFFNN
% 183.65/27.22 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 183.65/27.22 % Starting SubtermCWHack with 136s (1) cores
% 183.65/27.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 183.65/27.22 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 183.65/27.22 % Preprocessing time : 0.004 s
% 183.65/27.22 % Presaturation interreduction done
% 183.65/27.22
% 183.65/27.22 % Proof found!
% 183.65/27.22 % SZS status Theorem
% 183.65/27.22 % SZS output start CNFRefutation
% See solution above
% 183.65/27.22 % Parsed axioms : 67
% 183.65/27.22 % Removed by relevancy pruning/SinE : 0
% 183.65/27.22 % Initial clauses : 129
% 183.65/27.22 % Removed in clause preprocessing : 6
% 183.65/27.22 % Initial clauses in saturation : 123
% 183.65/27.22 % Processed clauses : 52478
% 183.65/27.22 % ...of these trivial : 730
% 183.65/27.22 % ...subsumed : 47008
% 183.65/27.22 % ...remaining for further processing : 4740
% 183.65/27.22 % Other redundant clauses eliminated : 7
% 183.65/27.22 % Clauses deleted for lack of memory : 0
% 183.65/27.22 % Backward-subsumed : 358
% 183.65/27.22 % Backward-rewritten : 22
% 183.65/27.22 % Generated clauses : 1301862
% 183.65/27.22 % ...of the previous two non-redundant : 766908
% 183.65/27.22 % ...aggressively subsumed : 0
% 183.65/27.22 % Contextual simplify-reflections : 5
% 183.65/27.22 % Paramodulations : 1301638
% 183.65/27.22 % Factorizations : 176
% 183.65/27.22 % NegExts : 0
% 183.65/27.22 % Equation resolutions : 47
% 183.65/27.22 % Disequality decompositions : 0
% 183.65/27.22 % Total rewrite steps : 597246
% 183.65/27.22 % ...of those cached : 596473
% 183.65/27.22 % Propositional unsat checks : 0
% 183.65/27.22 % Propositional check models : 0
% 183.65/27.22 % Propositional check unsatisfiable : 0
% 183.65/27.22 % Propositional clauses : 0
% 183.65/27.22 % Propositional clauses after purity: 0
% 183.65/27.22 % Propositional unsat core size : 0
% 183.65/27.22 % Propositional preprocessing time : 0.000
% 183.65/27.22 % Propositional encoding time : 0.000
% 183.65/27.22 % Propositional solver time : 0.000
% 183.65/27.22 % Success case prop preproc time : 0.000
% 183.65/27.22 % Success case prop encoding time : 0.000
% 183.65/27.22 % Success case prop solver time : 0.000
% 183.65/27.22 % Current number of processed clauses : 4235
% 183.65/27.22 % Positive orientable unit clauses : 228
% 183.65/27.22 % Positive unorientable unit clauses: 0
% 183.65/27.22 % Negative unit clauses : 255
% 183.65/27.22 % Non-unit-clauses : 3752
% 183.65/27.22 % Current number of unprocessed clauses: 713037
% 183.65/27.22 % ...number of literals in the above : 2391226
% 183.65/27.22 % Current number of archived formulas : 0
% 183.65/27.22 % Current number of archived clauses : 498
% 183.65/27.22 % Clause-clause subsumption calls (NU) : 12976683
% 183.65/27.22 % Rec. Clause-clause subsumption calls : 7114766
% 183.65/27.22 % Non-unit clause-clause subsumptions : 19955
% 183.65/27.22 % Unit Clause-clause subsumption calls : 165810
% 183.65/27.22 % Rewrite failures with RHS unbound : 0
% 183.65/27.22 % BW rewrite match attempts : 4384
% 183.65/27.22 % BW rewrite match successes : 22
% 183.65/27.22 % Condensation attempts : 0
% 183.65/27.22 % Condensation successes : 0
% 183.65/27.22 % Termbank termtop insertions : 22971050
% 183.65/27.22 % Search garbage collected termcells : 1974
% 183.65/27.22
% 183.65/27.22 % -------------------------------------------------
% 183.65/27.22 % User time : 25.732 s
% 183.65/27.22 % System time : 0.592 s
% 183.65/27.22 % Total time : 26.323 s
% 183.65/27.22 % Maximum resident set size: 3984 pages
% 183.65/27.22
% 183.65/27.22 % -------------------------------------------------
% 183.65/27.22 % User time : 126.832 s
% 183.65/27.22 % System time : 3.393 s
% 183.65/27.22 % Total time : 130.225 s
% 183.65/27.22 % Maximum resident set size: 4864 pages
% 183.65/27.22 % E exiting
%------------------------------------------------------------------------------