%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV457+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:34 PM UTC 2026
% Result : Theorem 0.56s 0.59s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 31 unt; 0 def)
% Number of atoms : 495 ( 191 equ)
% Maximal formula atoms : 79 ( 7 avg)
% Number of connectives : 638 ( 208 ~; 122 |; 221 &)
% ( 4 <=>; 83 =>; 0 <=; 0 <~>)
% Maximal formula depth : 63 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 17 con; 0-2 aty)
% Number of variables : 294 ( 28 sgn 241 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X14] :
( ( host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,index(pendack,host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Ack(X14,X6),queue(host(X14)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) = host(X6)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X6),queue(host(X7))) )
=> ~ setIn(X14,alive) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& leq(X7,X6)
& ~ setIn(X6,alive) )
=> ~ setIn(X7,alive) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) ) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X15] :
( host(X5) = host(X15)
=> ( host(X13) != host(X15)
=> ( ( host(X7) = index(pendack,host(X15))
& index(status,host(X15)) = elec_2
& elem(m_Ack(X15,X7),snoc(queue(host(X15)),m_Ack(X5,X13)))
& leq(nbr_proc,index(pendack,host(X15)))
& setIn(X15,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X6,X5)
& leq(X5,X6) )
<=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(axiom_31,axiom,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_31) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_32,axiom,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_32) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X13,X5] :
( ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X14] :
( ( host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,index(pendack,host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Ack(X14,X6),queue(host(X14)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) = host(X6)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X6),queue(host(X7))) )
=> ~ setIn(X14,alive) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& leq(X7,X6)
& ~ setIn(X6,alive) )
=> ~ setIn(X7,alive) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) ) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X15] :
( host(X5) = host(X15)
=> ( host(X13) != host(X15)
=> ( ( host(X7) = index(pendack,host(X15))
& index(status,host(X15)) = elec_2
& elem(m_Ack(X15,X7),snoc(queue(host(X15)),m_Ack(X5,X13)))
& leq(nbr_proc,index(pendack,host(X15)))
& setIn(X15,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_9,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
<=> ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X14] :
( ( host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,index(pendack,host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Ack(X14,X6),queue(host(X14)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) = host(X6)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X6),queue(host(X7))) )
=> ~ setIn(X14,alive) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& leq(X7,X6)
& ~ setIn(X6,alive) )
=> ~ setIn(X7,alive) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) ) ) ),
introduced(definition) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X12,X13,X5)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X15] :
( host(X5) = host(X15)
=> ( host(X13) != host(X15)
=> ( ( host(X7) = index(pendack,host(X15))
& index(status,host(X15)) = elec_2
& elem(m_Ack(X15,X7),snoc(queue(host(X15)),m_Ack(X5,X13)))
& leq(nbr_proc,index(pendack,host(X15)))
& setIn(X15,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8]),c_0_9]) ).
fof(c_0_11,negated_conjecture,
( index(status,host(esk8_0)) = norm
& index(ldr,host(esk8_0)) = host(esk8_0)
& setIn(esk8_0,alive)
& host(esk9_0) = index(pendack,host(esk10_0))
& index(status,host(esk10_0)) = elec_2
& elem(m_Ack(esk10_0,esk9_0),snoc(queue(host(esk10_0)),m_Ack(esk7_0,esk6_0)))
& leq(nbr_proc,index(pendack,host(esk10_0)))
& setIn(esk10_0,alive)
& host(esk6_0) != host(esk10_0)
& host(esk7_0) = host(esk10_0)
& host(esk6_0) != host(esk8_0)
& setIn(esk6_0,alive)
& epred1_3(esk5_0,esk6_0,esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
=> ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X14] :
( ( host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,index(pendack,host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Ack(X14,X6),queue(host(X14)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) = host(X6)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X6),queue(host(X7))) )
=> ~ setIn(X14,alive) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& leq(X7,X6)
& ~ setIn(X6,alive) )
=> ~ setIn(X7,alive) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) ) ) ),
inference(split_equiv,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X99,X100,X101] :
( ( elem(X99,snoc(X101,X100))
| ~ elem(X99,X101) )
& ( elem(X99,snoc(X101,X100))
| X99 != X100 )
& ( elem(X99,X101)
| X99 = X100
| ~ elem(X99,snoc(X101,X100)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_14,plain,
! [X135,X136] :
( ( X135 != X136
| leq(X136,X135) )
& ( X135 != X136
| leq(X135,X136) )
& ( X135 = X136
| ~ leq(X136,X135)
| ~ leq(X135,X136) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
cnf(c_0_15,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk10_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
host(esk9_0) = index(pendack,host(esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X21] : leq(host(X21),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_18,plain,
! [X151,X152,X153,X154,X155,X156,X157,X158,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] :
( ( ~ epred1_3(X153,X152,X151)
| queue(host(X152)) = cons(m_Halt(X151),X153) )
& ( ~ epred1_3(X153,X152,X151)
| index(status,host(X185)) != norm
| index(ldr,host(X185)) != host(X185)
| ~ setIn(X185,alive)
| host(X186) != index(pendack,host(X187))
| index(status,host(X187)) != elec_2
| ~ leq(nbr_proc,index(pendack,host(X187)))
| ~ elem(m_Ack(X187,X186),queue(host(X187)))
| ~ setIn(X187,alive) )
& ( ~ epred1_3(X153,X152,X151)
| index(status,host(X182)) != norm
| index(ldr,host(X182)) != host(X182)
| ~ setIn(X182,alive)
| index(status,host(X184)) != elec_2
| ~ elem(m_Halt(X184),queue(host(X183)))
| ~ setIn(X184,alive)
| leq(index(pendack,host(X184)),host(X182)) )
& ( ~ epred1_3(X153,X152,X151)
| ~ leq(index(pendack,host(X180)),index(pendack,host(X181)))
| index(status,host(X181)) != elec_2
| index(status,host(X180)) != elec_2
| ~ setIn(X181,alive)
| ~ setIn(X180,alive)
| leq(host(X180),host(X181)) )
& ( ~ epred1_3(X153,X152,X151)
| ~ setIn(host(X179),index(down,host(X178)))
| host(X178) != host(X177)
| ~ elem(m_Ack(X179,X177),queue(host(X179)))
| ~ setIn(X179,alive)
| ~ setIn(X178,alive) )
& ( ~ epred1_3(X153,X152,X151)
| ~ setIn(X176,alive)
| host(X176) != host(X174)
| ~ elem(m_Ack(X176,X175),queue(host(X176)))
| ~ elem(m_Down(X174),queue(host(X175))) )
& ( ~ epred1_3(X153,X152,X151)
| index(elid,host(X173)) = X173
| ~ setIn(X173,alive)
| index(status,host(X173)) != elec_2 )
& ( ~ epred1_3(X153,X152,X151)
| index(elid,host(X173)) = X173
| ~ setIn(X173,alive)
| index(status,host(X173)) != elec_1 )
& ( ~ epred1_3(X153,X152,X151)
| ~ elem(m_Ack(X172,X171),queue(host(X172)))
| index(status,host(X172)) != elec_1
| ~ setIn(X172,alive) )
& ( ~ epred1_3(X153,X152,X151)
| ~ elem(m_Ack(X169,X170),queue(host(X169)))
| index(status,host(X170)) != elec_1
| ~ setIn(X170,alive) )
& ( ~ epred1_3(X153,X152,X151)
| leq(host(X167),index(pendack,host(X168)))
| ~ elem(m_Ack(X168,X167),queue(host(X168)))
| ~ setIn(X168,alive) )
& ( ~ epred1_3(X153,X152,X151)
| ~ setIn(X166,alive)
| ~ setIn(X165,alive)
| host(X166) != host(X165)
| X166 = X165 )
& ( ~ epred1_3(X153,X152,X151)
| ~ setIn(X164,alive)
| host(X164) != host(X163)
| ~ leq(X164,X163)
| setIn(X163,alive) )
& ( ~ epred1_3(X153,X152,X151)
| ~ leq(host(X160),host(X162))
| ~ elem(m_Ack(X162,X160),queue(host(X161))) )
& ( ~ epred1_3(X153,X152,X151)
| ~ leq(host(X158),host(X159))
| ~ elem(m_Ldr(X159),queue(host(X158))) )
& ( ~ epred1_3(X153,X152,X151)
| ~ setIn(X157,alive)
| ~ elem(m_Down(X157),queue(host(X156))) )
& ( ~ epred1_3(X153,X152,X151)
| setIn(X155,pids)
| ~ elem(m_Ack(X155,X154),queue(host(X155))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_19,plain,
( ~ elem(X1,snoc(X2,X3))
| elem(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
elem(m_Ack(esk10_0,esk9_0),snoc(queue(host(esk10_0)),m_Ack(esk7_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
leq(nbr_proc,host(esk9_0)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X132] : leq(X132,X132),
inference(variable_rename,[status(thm)],[axiom_59]) ).
cnf(c_0_25,plain,
( ~ epred1_3(X4,X5,X6)
| index(status,host(X3)) != norm
| index(ldr,host(X3)) != host(X3)
| ~ setIn(X3,alive)
| host(X2) != index(pendack,host(X1))
| index(status,host(X1)) != elec_2
| ~ leq(nbr_proc,index(pendack,host(X1)))
| ~ elem(m_Ack(X1,X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( elem(m_Ack(esk10_0,esk9_0),queue(host(esk10_0)))
| m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
inference(fof_simplification,[status(thm)],[axiom_31]) ).
cnf(c_0_32,plain,
( ~ setIn(X1,alive)
| ~ epred1_3(X2,X3,X4)
| index(status,host(X1)) != norm
| index(ldr,host(X1)) != host(X1)
| m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_16]),c_0_27]),c_0_28]),c_0_16]),c_0_27]),c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
index(ldr,host(esk8_0)) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
index(status,host(esk8_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_36,plain,
! [X67,X68,X69,X70] :
( m_Ack(X67,X69) != m_Ack(X68,X70)
| X67 = X68 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_39,plain,
( m_Ack(X1,X3) != m_Ack(X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
m_Ack(esk7_0,esk6_0) = m_Ack(esk10_0,esk9_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_41,plain,
! [X96,X97,X98] :
( ( elem(X96,cons(X97,X98))
| ~ elem(X96,X98) )
& ( elem(X96,cons(X97,X98))
| X96 != X97 )
& ( elem(X96,X98)
| X96 = X97
| ~ elem(X96,cons(X97,X98)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_42,plain,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
inference(fof_simplification,[status(thm)],[axiom_32]) ).
cnf(c_0_43,negated_conjecture,
( m_Ack(esk10_0,esk9_0) != m_Ack(X1,X2)
| esk7_0 = X1 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( X1 != X2
| elem(X1,cons(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
( ~ epred1_3(X3,X1,X2)
| queue(host(X1)) = cons(m_Halt(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_46,plain,
! [X71,X72,X73,X74] :
( m_Ack(X71,X73) != m_Ack(X72,X74)
| X73 = X74 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_47,negated_conjecture,
esk7_0 = esk10_0,
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_48,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
cons(m_Halt(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_50,plain,
( m_Ack(X3,X1) != m_Ack(X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
m_Ack(esk10_0,esk9_0) = m_Ack(esk10_0,esk6_0),
inference(rw,[status(thm)],[c_0_40,c_0_47]) ).
cnf(c_0_52,plain,
( ~ epred1_3(X4,X5,X6)
| index(status,host(X2)) != norm
| index(ldr,host(X2)) != host(X2)
| ~ setIn(X2,alive)
| index(status,host(X1)) != elec_2
| ~ elem(m_Halt(X1),queue(host(X3)))
| ~ setIn(X1,alive)
| leq(index(pendack,host(X1)),host(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_53,negated_conjecture,
elem(m_Halt(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
host(esk7_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_55,negated_conjecture,
( m_Ack(esk10_0,esk6_0) != m_Ack(X2,X1)
| esk9_0 = X1 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( ~ setIn(X1,alive)
| ~ epred1_3(X2,X3,X4)
| index(status,host(X1)) != norm
| index(ldr,host(X1)) != host(X1)
| leq(nbr_proc,host(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_16]),c_0_27]),c_0_54]),c_0_28])]),c_0_47]),c_0_30])]) ).
cnf(c_0_57,negated_conjecture,
esk9_0 = esk6_0,
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| leq(nbr_proc,host(esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_59,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk10_0),
inference(rw,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_60,negated_conjecture,
host(esk6_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_61,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_27,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
leq(nbr_proc,host(esk8_0)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
host(esk8_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_62]),c_0_23])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV457+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 08:55:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.56/0.59 % Version: 3.5.1
% 0.56/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.56/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.56/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.56/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.56/0.59 % Starting sh5l with 300s (1) cores
% 0.56/0.59 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1092122 completed with status 0
% 0.56/0.59 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.56/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.56/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.56/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.56/0.59 % No SInE strategy applied
% 0.56/0.59 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.56/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.56/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.56/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.56/0.59 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.56/0.59 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.56/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.56/0.59 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1092131 completed with status 0
% 0.56/0.59 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.56/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.56/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.56/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.56/0.59 % No SInE strategy applied
% 0.56/0.59 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.56/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.56/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.56/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.56/0.59 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.56/0.59 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.56/0.59 % Preprocessing time : 0.006 s
% 0.56/0.59
% 0.56/0.59 % Proof found!
% 0.56/0.59 % SZS status Theorem
% 0.56/0.59 % SZS output start CNFRefutation
% See solution above
% 0.56/0.59 % Parsed axioms : 67
% 0.56/0.59 % Removed by relevancy pruning/SinE : 0
% 0.56/0.59 % Initial clauses : 126
% 0.56/0.59 % Removed in clause preprocessing : 6
% 0.56/0.59 % Initial clauses in saturation : 120
% 0.56/0.59 % Processed clauses : 778
% 0.56/0.59 % ...of these trivial : 21
% 0.56/0.59 % ...subsumed : 308
% 0.56/0.59 % ...remaining for further processing : 449
% 0.56/0.59 % Other redundant clauses eliminated : 9
% 0.56/0.59 % Clauses deleted for lack of memory : 0
% 0.56/0.59 % Backward-subsumed : 25
% 0.56/0.59 % Backward-rewritten : 27
% 0.56/0.59 % Generated clauses : 3318
% 0.56/0.59 % ...of the previous two non-redundant : 2898
% 0.56/0.59 % ...aggressively subsumed : 0
% 0.56/0.59 % Contextual simplify-reflections : 3
% 0.56/0.59 % Paramodulations : 3263
% 0.56/0.59 % Factorizations : 22
% 0.56/0.59 % NegExts : 0
% 0.56/0.59 % Equation resolutions : 33
% 0.56/0.59 % Disequality decompositions : 0
% 0.56/0.59 % Total rewrite steps : 916
% 0.56/0.59 % ...of those cached : 770
% 0.56/0.59 % Propositional unsat checks : 0
% 0.56/0.59 % Propositional check models : 0
% 0.56/0.59 % Propositional check unsatisfiable : 0
% 0.56/0.59 % Propositional clauses : 0
% 0.56/0.59 % Propositional clauses after purity: 0
% 0.56/0.59 % Propositional unsat core size : 0
% 0.56/0.59 % Propositional preprocessing time : 0.000
% 0.56/0.59 % Propositional encoding time : 0.000
% 0.56/0.59 % Propositional solver time : 0.000
% 0.56/0.59 % Success case prop preproc time : 0.000
% 0.56/0.59 % Success case prop encoding time : 0.000
% 0.56/0.59 % Success case prop solver time : 0.000
% 0.56/0.59 % Current number of processed clauses : 393
% 0.56/0.59 % Positive orientable unit clauses : 56
% 0.56/0.59 % Positive unorientable unit clauses: 0
% 0.56/0.59 % Negative unit clauses : 55
% 0.56/0.59 % Non-unit-clauses : 282
% 0.56/0.59 % Current number of unprocessed clauses: 2052
% 0.56/0.59 % ...number of literals in the above : 8592
% 0.56/0.59 % Current number of archived formulas : 0
% 0.56/0.59 % Current number of archived clauses : 52
% 0.56/0.59 % Clause-clause subsumption calls (NU) : 27581
% 0.56/0.59 % Rec. Clause-clause subsumption calls : 9810
% 0.56/0.59 % Non-unit clause-clause subsumptions : 201
% 0.56/0.59 % Unit Clause-clause subsumption calls : 3166
% 0.56/0.59 % Rewrite failures with RHS unbound : 0
% 0.56/0.59 % BW rewrite match attempts : 32
% 0.56/0.59 % BW rewrite match successes : 10
% 0.56/0.59 % Condensation attempts : 0
% 0.56/0.59 % Condensation successes : 0
% 0.56/0.59 % Termbank termtop insertions : 52926
% 0.56/0.59 % Search garbage collected termcells : 1721
% 0.56/0.59
% 0.56/0.59 % -------------------------------------------------
% 0.56/0.59 % User time : 0.126 s
% 0.56/0.59 % System time : 0.009 s
% 0.56/0.59 % Total time : 0.135 s
% 0.56/0.59 % Maximum resident set size: 3696 pages
% 0.56/0.59
% 0.56/0.59 % -------------------------------------------------
% 0.56/0.59 % User time : 0.553 s
% 0.56/0.59 % System time : 0.037 s
% 0.56/0.59 % Total time : 0.590 s
% 0.56/0.59 % Maximum resident set size: 4864 pages
% 0.56/0.59 % E exiting
%------------------------------------------------------------------------------