TSTP Solution File: SWV461+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV461+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:59:36 EDT 2023
% Result : Theorem 5.88s 1.42s
% Output : CNFRefutation 5.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 63 ( 35 unt; 0 def)
% Number of atoms : 533 ( 215 equ)
% Maximal formula atoms : 115 ( 8 avg)
% Number of connectives : 716 ( 246 ~; 164 |; 227 &)
% ( 6 <=>; 73 =>; 0 <=; 0 <~>)
% Maximal formula depth : 70 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 19 con; 0-5 aty)
% Number of variables : 231 ( 9 sgn; 206 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13] :
( ( ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( ( X6 != X5
& host(X6) = host(X5) )
=> ( ~ setIn(X5,alive)
| ~ setIn(X6,alive) ) )
& ! [X5,X6] :
( ( setIn(X6,alive)
& elem(m_Ack(X6,X5),queue(host(X6))) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( setIn(X6,alive)
& index(status,host(X6)) = elec_1 )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5] :
( ( ( index(status,host(X5)) = elec_1
| index(status,host(X5)) = elec_2 )
& setIn(X5,alive) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6,X7] :
( ( setIn(X7,alive)
& elem(m_Down(X6),queue(host(X7)))
& host(X6) = host(X5) )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) )
& ! [X5,X6,X7] :
( ( setIn(X5,alive)
& setIn(X7,alive)
& host(X7) = host(X6)
& index(status,host(X5)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6] :
( ( ~ leq(host(X5),host(X6))
& setIn(X5,alive)
& setIn(X6,alive)
& index(status,host(X5)) = elec_2
& index(status,host(X6)) = elec_2 )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6] :
( ( ~ leq(host(X5),host(X6))
& setIn(X5,alive)
& setIn(X6,alive)
& index(status,host(X5)) = elec_2
& index(status,host(X6)) = elec_2 )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6,X7] :
( ( ~ leq(index(pendack,host(X7)),host(X5))
& setIn(X7,alive)
& elem(m_Halt(X7),queue(host(X6)))
& index(status,host(X7)) = elec_2 )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) )
& ! [X5,X6,X7,X14] :
( ( ! [X15] :
( ( ~ leq(host(X14),X15)
& leq(s(zero),X15) )
=> ( setIn(X15,index(down,host(X14)))
| X15 = host(X7) ) )
& elem(m_Down(X7),queue(host(X14)))
& host(X14) = host(X6)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5))) ) )
& ! [X5,X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& elem(m_Ack(X14,X6),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X6) = index(pendack,host(X14))
& host(X7) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) ) )
=> ( queue(host(X13)) = q_nil
=> ( ( ! [X5] :
( host(X13) = host(X5)
=> leq(X5,X12) )
& ~ setIn(X12,pids)
& host(X13) = host(X12) )
=> ( host(X12) = s(zero)
=> ( ~ leq(nbr_proc,host(X12))
=> ! [X5] :
( host(X12) != host(X5)
=> ! [X6,X7,X16] :
( s(host(X12)) = host(X16)
=> ( host(X12) != host(X16)
=> ( ( ( setIn(X16,alive)
| X16 = X12 )
& leq(nbr_proc,s(index(pendack,host(X16))))
& elem(m_Down(X7),snoc(queue(host(X16)),m_Halt(X12)))
& elem(m_Ack(X16,X6),snoc(queue(host(X16)),m_Halt(X12)))
& index(status,host(X16)) = elec_2
& host(X6) = index(pendack,host(X16))
& host(X7) = s(index(pendack,host(X16))) )
=> ~ ( ( setIn(X5,alive)
| X5 = X12 )
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',conj) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom_47) ).
fof(axiom_11,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Halt(X7),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom_11) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom_04) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom_59) ).
fof(axiom_17,axiom,
! [X5,X6] : m_Down(X5) != m_Halt(X6),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom_17) ).
fof(axiom,axiom,
! [X1,X2] :
( elem(m_Ack(X1,X2),queue(host(X1)))
=> ( setIn(X1,pids)
& setIn(X2,pids) ) ),
file('/export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p',axiom) ).
fof(c_0_8,plain,
! [X13] :
( epred1_1(X13)
<=> ( ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( ( X6 != X5
& host(X6) = host(X5) )
=> ( ~ setIn(X5,alive)
| ~ setIn(X6,alive) ) )
& ! [X5,X6] :
( ( setIn(X6,alive)
& elem(m_Ack(X6,X5),queue(host(X6))) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( setIn(X6,alive)
& index(status,host(X6)) = elec_1 )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5] :
( ( ( index(status,host(X5)) = elec_1
| index(status,host(X5)) = elec_2 )
& setIn(X5,alive) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6,X7] :
( ( setIn(X7,alive)
& elem(m_Down(X6),queue(host(X7)))
& host(X6) = host(X5) )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) )
& ! [X5,X6,X7] :
( ( setIn(X5,alive)
& setIn(X7,alive)
& host(X7) = host(X6)
& index(status,host(X5)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6] :
( ( ~ leq(host(X5),host(X6))
& setIn(X5,alive)
& setIn(X6,alive)
& index(status,host(X5)) = elec_2
& index(status,host(X6)) = elec_2 )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6] :
( ( ~ leq(host(X5),host(X6))
& setIn(X5,alive)
& setIn(X6,alive)
& index(status,host(X5)) = elec_2
& index(status,host(X6)) = elec_2 )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6,X7] :
( ( ~ leq(index(pendack,host(X7)),host(X5))
& setIn(X7,alive)
& elem(m_Halt(X7),queue(host(X6)))
& index(status,host(X7)) = elec_2 )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) )
& ! [X5,X6,X7,X14] :
( ( ! [X15] :
( ( ~ leq(host(X14),X15)
& leq(s(zero),X15) )
=> ( setIn(X15,index(down,host(X14)))
| X15 = host(X7) ) )
& elem(m_Down(X7),queue(host(X14)))
& host(X14) = host(X6)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5))) ) )
& ! [X5,X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& elem(m_Ack(X14,X6),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X6) = index(pendack,host(X14))
& host(X7) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) ) ) ),
introduced(definition) ).
fof(c_0_9,negated_conjecture,
~ ! [X12,X13] :
( epred1_1(X13)
=> ( queue(host(X13)) = q_nil
=> ( ( ! [X5] :
( host(X13) = host(X5)
=> leq(X5,X12) )
& ~ setIn(X12,pids)
& host(X13) = host(X12) )
=> ( host(X12) = s(zero)
=> ( ~ leq(nbr_proc,host(X12))
=> ! [X5] :
( host(X12) != host(X5)
=> ! [X6,X7,X16] :
( s(host(X12)) = host(X16)
=> ( host(X12) != host(X16)
=> ( ( ( setIn(X16,alive)
| X16 = X12 )
& leq(nbr_proc,s(index(pendack,host(X16))))
& elem(m_Down(X7),snoc(queue(host(X16)),m_Halt(X12)))
& elem(m_Ack(X16,X6),snoc(queue(host(X16)),m_Halt(X12)))
& index(status,host(X16)) = elec_2
& host(X6) = index(pendack,host(X16))
& host(X7) = s(index(pendack,host(X16))) )
=> ~ ( ( setIn(X5,alive)
| X5 = X12 )
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_8]) ).
fof(c_0_10,plain,
! [X13] :
( epred1_1(X13)
=> ( ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( ( X6 != X5
& host(X6) = host(X5) )
=> ( ~ setIn(X5,alive)
| ~ setIn(X6,alive) ) )
& ! [X5,X6] :
( ( setIn(X6,alive)
& elem(m_Ack(X6,X5),queue(host(X6))) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( setIn(X6,alive)
& index(status,host(X6)) = elec_1 )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5] :
( ( ( index(status,host(X5)) = elec_1
| index(status,host(X5)) = elec_2 )
& setIn(X5,alive) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6,X7] :
( ( setIn(X7,alive)
& elem(m_Down(X6),queue(host(X7)))
& host(X6) = host(X5) )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) )
& ! [X5,X6,X7] :
( ( setIn(X5,alive)
& setIn(X7,alive)
& host(X7) = host(X6)
& index(status,host(X5)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6] :
( ( ~ leq(host(X5),host(X6))
& setIn(X5,alive)
& setIn(X6,alive)
& index(status,host(X5)) = elec_2
& index(status,host(X6)) = elec_2 )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6] :
( ( ~ leq(host(X5),host(X6))
& setIn(X5,alive)
& setIn(X6,alive)
& index(status,host(X5)) = elec_2
& index(status,host(X6)) = elec_2 )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6,X7] :
( ( ~ leq(index(pendack,host(X7)),host(X5))
& setIn(X7,alive)
& elem(m_Halt(X7),queue(host(X6)))
& index(status,host(X7)) = elec_2 )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) )
& ! [X5,X6,X7,X14] :
( ( ! [X15] :
( ( ~ leq(host(X14),X15)
& leq(s(zero),X15) )
=> ( setIn(X15,index(down,host(X14)))
| X15 = host(X7) ) )
& elem(m_Down(X7),queue(host(X14)))
& host(X14) = host(X6)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5))) ) )
& ! [X5,X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& elem(m_Ack(X14,X6),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X6) = index(pendack,host(X14))
& host(X7) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X5,alive)
& index(ldr,host(X5)) = host(X5)
& index(status,host(X5)) = norm ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
fof(c_0_11,negated_conjecture,
! [X148] :
( epred1_1(esk6_0)
& queue(host(esk6_0)) = q_nil
& ( host(esk6_0) != host(X148)
| leq(X148,esk5_0) )
& ~ setIn(esk5_0,pids)
& host(esk6_0) = host(esk5_0)
& host(esk5_0) = s(zero)
& ~ leq(nbr_proc,host(esk5_0))
& host(esk5_0) != host(esk7_0)
& s(host(esk5_0)) = host(esk10_0)
& host(esk5_0) != host(esk10_0)
& ( setIn(esk10_0,alive)
| esk10_0 = esk5_0 )
& leq(nbr_proc,s(index(pendack,host(esk10_0))))
& elem(m_Down(esk9_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0)))
& elem(m_Ack(esk10_0,esk8_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0)))
& index(status,host(esk10_0)) = elec_2
& host(esk8_0) = index(pendack,host(esk10_0))
& host(esk9_0) = s(index(pendack,host(esk10_0)))
& ( setIn(esk7_0,alive)
| esk7_0 = esk5_0 )
& index(ldr,host(esk7_0)) = host(esk7_0)
& index(status,host(esk7_0)) = norm ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_12,plain,
! [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,X189,X190,X191,X192] :
( ( host(X153) != host(X154)
| ~ setIn(X154,alive)
| ~ epred1_1(X153) )
& ( ~ elem(m_Ldr(X156),queue(host(X155)))
| ~ leq(host(X155),host(X156))
| ~ epred1_1(X153) )
& ( ~ elem(m_Down(X158),queue(host(X157)))
| host(X158) != host(X157)
| ~ epred1_1(X153) )
& ( ~ elem(m_Halt(X160),queue(host(X159)))
| ~ leq(host(X159),host(X160))
| ~ epred1_1(X153) )
& ( ~ elem(m_Ack(X163,X161),queue(host(X162)))
| ~ leq(host(X161),host(X163))
| ~ epred1_1(X153) )
& ( X165 = X164
| host(X165) != host(X164)
| ~ setIn(X164,alive)
| ~ setIn(X165,alive)
| ~ epred1_1(X153) )
& ( ~ setIn(X167,alive)
| ~ elem(m_Ack(X167,X166),queue(host(X167)))
| leq(host(X166),index(pendack,host(X167)))
| ~ epred1_1(X153) )
& ( ~ setIn(X169,alive)
| index(status,host(X169)) != elec_1
| ~ elem(m_Ack(X169,X168),queue(host(X169)))
| ~ epred1_1(X153) )
& ( index(status,host(X170)) != elec_1
| ~ setIn(X170,alive)
| index(elid,host(X170)) = X170
| ~ epred1_1(X153) )
& ( index(status,host(X170)) != elec_2
| ~ setIn(X170,alive)
| index(elid,host(X170)) = X170
| ~ epred1_1(X153) )
& ( ~ setIn(X173,alive)
| ~ elem(m_Down(X172),queue(host(X173)))
| host(X172) != host(X171)
| ~ setIn(X171,alive)
| index(ldr,host(X171)) != host(X171)
| index(status,host(X171)) != norm
| ~ epred1_1(X153) )
& ( ~ setIn(X174,alive)
| ~ setIn(X176,alive)
| host(X176) != host(X175)
| index(status,host(X174)) != elec_2
| index(status,host(X176)) != elec_2
| ~ elem(m_Ack(X174,X175),queue(host(X174)))
| ~ epred1_1(X153) )
& ( leq(host(X177),host(X178))
| ~ setIn(X177,alive)
| ~ setIn(X178,alive)
| index(status,host(X177)) != elec_2
| index(status,host(X178)) != elec_2
| leq(index(pendack,host(X178)),host(X177))
| ~ epred1_1(X153) )
& ( leq(host(X179),host(X180))
| ~ setIn(X179,alive)
| ~ setIn(X180,alive)
| index(status,host(X179)) != elec_2
| index(status,host(X180)) != elec_2
| ~ leq(index(pendack,host(X179)),index(pendack,host(X180)))
| ~ epred1_1(X153) )
& ( leq(index(pendack,host(X183)),host(X181))
| ~ setIn(X183,alive)
| ~ elem(m_Halt(X183),queue(host(X182)))
| index(status,host(X183)) != elec_2
| ~ setIn(X181,alive)
| index(ldr,host(X181)) != host(X181)
| index(status,host(X181)) != norm
| ~ epred1_1(X153) )
& ( ~ leq(host(X187),esk11_5(X153,X184,X185,X186,X187))
| ~ elem(m_Down(X186),queue(host(X187)))
| host(X187) != host(X185)
| host(X187) != nbr_proc
| index(status,host(X187)) != elec_1
| ~ setIn(X184,alive)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ epred1_1(X153) )
& ( leq(s(zero),esk11_5(X153,X184,X185,X186,X187))
| ~ elem(m_Down(X186),queue(host(X187)))
| host(X187) != host(X185)
| host(X187) != nbr_proc
| index(status,host(X187)) != elec_1
| ~ setIn(X184,alive)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ epred1_1(X153) )
& ( ~ setIn(esk11_5(X153,X184,X185,X186,X187),index(down,host(X187)))
| ~ elem(m_Down(X186),queue(host(X187)))
| host(X187) != host(X185)
| host(X187) != nbr_proc
| index(status,host(X187)) != elec_1
| ~ setIn(X184,alive)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ epred1_1(X153) )
& ( esk11_5(X153,X184,X185,X186,X187) != host(X186)
| ~ elem(m_Down(X186),queue(host(X187)))
| host(X187) != host(X185)
| host(X187) != nbr_proc
| index(status,host(X187)) != elec_1
| ~ setIn(X184,alive)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ epred1_1(X153) )
& ( ~ setIn(X191,alive)
| ~ elem(m_Down(X190),queue(host(X191)))
| ~ elem(m_Ack(X191,X189),queue(host(X191)))
| ~ leq(nbr_proc,s(index(pendack,host(X191))))
| index(status,host(X191)) != elec_2
| host(X189) != index(pendack,host(X191))
| host(X190) != s(index(pendack,host(X191)))
| ~ setIn(X192,alive)
| index(ldr,host(X192)) != host(X192)
| index(status,host(X192)) != norm
| ~ epred1_1(X153) ) ),
inference(distribute,[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_10])])])])])]) ).
fof(c_0_13,plain,
( ~ epred3_0
<=> ! [X3] : ~ epred1_1(X3) ),
introduced(definition) ).
fof(c_0_14,plain,
( ~ epred11_0
<=> ! [X4] :
( ~ setIn(X4,alive)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4) ) ),
introduced(definition) ).
cnf(c_0_15,negated_conjecture,
host(esk9_0) = s(index(pendack,host(esk10_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
host(esk8_0) = index(pendack,host(esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
( ~ epred10_0
<=> ! [X3,X2,X1] :
( ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Ack(X1,X3),queue(host(X1)))
| ~ setIn(X1,alive)
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| index(status,host(X1)) != elec_2
| host(X3) != index(pendack,host(X1))
| host(X2) != s(index(pendack,host(X1))) ) ),
introduced(definition) ).
cnf(c_0_18,plain,
( ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Ack(X1,X3),queue(host(X1)))
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| index(status,host(X1)) != elec_2
| host(X3) != index(pendack,host(X1))
| host(X2) != s(index(pendack,host(X1)))
| ~ setIn(X4,alive)
| index(ldr,host(X4)) != host(X4)
| index(status,host(X4)) != norm
| ~ epred1_1(X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( epred3_0
| ~ epred1_1(X1) ),
inference(split_equiv,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
epred1_1(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( epred11_0
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ setIn(X1,alive) ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( setIn(esk7_0,alive)
| esk7_0 = esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
index(ldr,host(esk7_0)) = host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
index(status,host(esk7_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X100,X101,X102] :
( ( ~ elem(X100,snoc(X102,X101))
| X100 = X101
| elem(X100,X102) )
& ( X100 != X101
| elem(X100,snoc(X102,X101)) )
& ( ~ elem(X100,X102)
| elem(X100,snoc(X102,X101)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])]) ).
fof(c_0_26,plain,
! [X23,X24,X25] : m_Ack(X23,X24) != m_Halt(X25),
inference(variable_rename,[status(thm)],[axiom_11]) ).
fof(c_0_27,plain,
! [X136,X137] :
( ( ~ leq(X136,X137)
| ~ leq(X137,X136)
| X136 = X137 )
& ( leq(X136,X137)
| X136 != X137 )
& ( leq(X137,X136)
| X136 != X137 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])]) ).
cnf(c_0_28,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk10_0)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
s(host(esk8_0)) = host(esk9_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_30,plain,
! [X22] : leq(host(X22),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_31,plain,
( ~ epred11_0
| ~ epred10_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18,c_0_17]),c_0_14]),c_0_13]) ).
cnf(c_0_32,negated_conjecture,
epred3_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_33,negated_conjecture,
host(esk5_0) != host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
( esk7_0 = esk5_0
| epred11_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_35,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Ack(esk10_0,esk8_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,plain,
m_Ack(X1,X2) != m_Halt(X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
leq(nbr_proc,host(esk9_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_16]),c_0_29]) ).
cnf(c_0_40,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_41,plain,
! [X133] : leq(X133,X133),
inference(variable_rename,[status(thm)],[axiom_59]) ).
cnf(c_0_42,plain,
( ~ epred11_0
| ~ epred10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_43,negated_conjecture,
epred11_0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_44,plain,
! [X40,X41] : m_Down(X40) != m_Halt(X41),
inference(variable_rename,[status(thm)],[axiom_17]) ).
cnf(c_0_45,plain,
( epred10_0
| host(X1) != s(index(pendack,host(X2)))
| host(X3) != index(pendack,host(X2))
| index(status,host(X2)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X2))))
| ~ setIn(X2,alive)
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ elem(m_Down(X1),queue(host(X2))) ),
inference(split_equiv,[status(thm)],[c_0_17]) ).
cnf(c_0_46,negated_conjecture,
elem(m_Ack(esk10_0,esk8_0),queue(host(esk10_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_47,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_48,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
~ epred10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_51,negated_conjecture,
elem(m_Down(esk9_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_52,plain,
m_Down(X1) != m_Halt(X2),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_53,plain,
! [X17,X18] :
( ( setIn(X17,pids)
| ~ elem(m_Ack(X17,X18),queue(host(X17))) )
& ( setIn(X18,pids)
| ~ elem(m_Ack(X17,X18),queue(host(X17))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom])])]) ).
cnf(c_0_54,negated_conjecture,
( host(X1) != nbr_proc
| ~ setIn(esk10_0,alive)
| ~ elem(m_Down(X1),queue(host(esk10_0))) ),
inference(sr,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_16]),c_0_29]),c_0_47]),c_0_16]),c_0_48]),c_0_16]),c_0_29]),c_0_47]),c_0_49])]),c_0_50]) ).
cnf(c_0_55,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk10_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_51]),c_0_52]) ).
cnf(c_0_56,plain,
( setIn(X1,pids)
| ~ elem(m_Ack(X1,X2),queue(host(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( setIn(esk10_0,alive)
| esk10_0 = esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_58,negated_conjecture,
~ setIn(esk10_0,alive),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_47])]) ).
cnf(c_0_59,negated_conjecture,
setIn(esk10_0,pids),
inference(spm,[status(thm)],[c_0_56,c_0_46]) ).
cnf(c_0_60,negated_conjecture,
esk10_0 = esk5_0,
inference(sr,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
~ setIn(esk5_0,pids),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV461+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_E %s %d THM
% 0.17/0.35 % Computer : n025.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 2400
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Tue Oct 3 04:12:06 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.OMlWetwLbb/E---3.1_32454.p
% 5.88/1.42 # Version: 3.1pre001
% 5.88/1.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.88/1.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.88/1.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.88/1.42 # Starting new_bool_3 with 300s (1) cores
% 5.88/1.42 # Starting new_bool_1 with 300s (1) cores
% 5.88/1.42 # Starting sh5l with 300s (1) cores
% 5.88/1.42 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32538 completed with status 0
% 5.88/1.42 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.88/1.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.88/1.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.88/1.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.88/1.42 # No SInE strategy applied
% 5.88/1.42 # Search class: FGHSM-FFMM31-MFFFFFNN
% 5.88/1.42 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 5.88/1.42 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 5.88/1.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.88/1.42 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 5.88/1.42 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 5.88/1.42 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 5.88/1.42 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 32547 completed with status 0
% 5.88/1.42 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 5.88/1.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.88/1.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.88/1.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.88/1.42 # No SInE strategy applied
% 5.88/1.42 # Search class: FGHSM-FFMM31-MFFFFFNN
% 5.88/1.42 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 5.88/1.42 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 5.88/1.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.88/1.42 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 5.88/1.42 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 5.88/1.42 # Preprocessing time : 0.003 s
% 5.88/1.42
% 5.88/1.42 # Proof found!
% 5.88/1.42 # SZS status Theorem
% 5.88/1.42 # SZS output start CNFRefutation
% See solution above
% 5.88/1.42 # Parsed axioms : 67
% 5.88/1.42 # Removed by relevancy pruning/SinE : 0
% 5.88/1.42 # Initial clauses : 136
% 5.88/1.42 # Removed in clause preprocessing : 6
% 5.88/1.42 # Initial clauses in saturation : 130
% 5.88/1.42 # Processed clauses : 8150
% 5.88/1.42 # ...of these trivial : 94
% 5.88/1.42 # ...subsumed : 6371
% 5.88/1.42 # ...remaining for further processing : 1685
% 5.88/1.42 # Other redundant clauses eliminated : 13
% 5.88/1.42 # Clauses deleted for lack of memory : 0
% 5.88/1.42 # Backward-subsumed : 118
% 5.88/1.42 # Backward-rewritten : 221
% 5.88/1.42 # Generated clauses : 67829
% 5.88/1.42 # ...of the previous two non-redundant : 59710
% 5.88/1.42 # ...aggressively subsumed : 0
% 5.88/1.42 # Contextual simplify-reflections : 36
% 5.88/1.42 # Paramodulations : 67646
% 5.88/1.42 # Factorizations : 14
% 5.88/1.42 # NegExts : 0
% 5.88/1.42 # Equation resolutions : 145
% 5.88/1.42 # Total rewrite steps : 22136
% 5.88/1.42 # Propositional unsat checks : 0
% 5.88/1.42 # Propositional check models : 0
% 5.88/1.42 # Propositional check unsatisfiable : 0
% 5.88/1.42 # Propositional clauses : 0
% 5.88/1.42 # Propositional clauses after purity: 0
% 5.88/1.42 # Propositional unsat core size : 0
% 5.88/1.42 # Propositional preprocessing time : 0.000
% 5.88/1.42 # Propositional encoding time : 0.000
% 5.88/1.42 # Propositional solver time : 0.000
% 5.88/1.42 # Success case prop preproc time : 0.000
% 5.88/1.42 # Success case prop encoding time : 0.000
% 5.88/1.42 # Success case prop solver time : 0.000
% 5.88/1.42 # Current number of processed clauses : 1331
% 5.88/1.42 # Positive orientable unit clauses : 70
% 5.88/1.42 # Positive unorientable unit clauses: 0
% 5.88/1.42 # Negative unit clauses : 114
% 5.88/1.42 # Non-unit-clauses : 1147
% 5.88/1.42 # Current number of unprocessed clauses: 51261
% 5.88/1.42 # ...number of literals in the above : 216062
% 5.88/1.42 # Current number of archived formulas : 0
% 5.88/1.42 # Current number of archived clauses : 340
% 5.88/1.42 # Clause-clause subsumption calls (NU) : 1226553
% 5.88/1.42 # Rec. Clause-clause subsumption calls : 271968
% 5.88/1.42 # Non-unit clause-clause subsumptions : 2374
% 5.88/1.42 # Unit Clause-clause subsumption calls : 18426
% 5.88/1.42 # Rewrite failures with RHS unbound : 0
% 5.88/1.42 # BW rewrite match attempts : 64
% 5.88/1.42 # BW rewrite match successes : 9
% 5.88/1.42 # Condensation attempts : 0
% 5.88/1.42 # Condensation successes : 0
% 5.88/1.42 # Termbank termtop insertions : 911221
% 5.88/1.42
% 5.88/1.42 # -------------------------------------------------
% 5.88/1.42 # User time : 0.843 s
% 5.88/1.42 # System time : 0.022 s
% 5.88/1.42 # Total time : 0.865 s
% 5.88/1.42 # Maximum resident set size: 2224 pages
% 5.88/1.42
% 5.88/1.42 # -------------------------------------------------
% 5.88/1.42 # User time : 4.239 s
% 5.88/1.42 # System time : 0.134 s
% 5.88/1.42 # Total time : 4.373 s
% 5.88/1.42 # Maximum resident set size: 1788 pages
% 5.88/1.42 % E---3.1 exiting
%------------------------------------------------------------------------------