TSTP Solution File: SWV471+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV471+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:45:28 EDT 2024
% Result : Theorem 51.35s 6.96s
% Output : CNFRefutation 51.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 63 ( 26 unt; 0 def)
% Number of atoms : 446 ( 203 equ)
% Maximal formula atoms : 86 ( 7 avg)
% Number of connectives : 610 ( 227 ~; 180 |; 150 &)
% ( 3 <=>; 50 =>; 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 : 33 ( 33 usr; 19 con; 0-7 aty)
% Number of variables : 266 ( 18 sgn 166 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p',axiom_47) ).
fof(axiom_40,axiom,
! [X4] :
( X4 = q_nil
| X4 = snoc(init(X4),last(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p',axiom_40) ).
fof(axiom_41,axiom,
! [X5,X4] : q_nil != cons(X5,X4),
file('/export/starexec/sandbox/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p',axiom_41) ).
fof(conj,conjecture,
! [X12,X13,X5] :
( ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( host(X7) = nbr_proc
=> ~ elem(m_NotNorm(X6),queue(host(X7))) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(ldr,host(X14)) = host(X7)
& index(status,host(X14)) = norm )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X7) )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& elem(m_Down(X7),queue(host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& setIn(host(X7),index(down,host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X5) != host(X6)
=> ( host(X13) = host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( ! [X16] :
( ( ~ leq(host(X18),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X18)))
| X16 = host(X17) ) )
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& host(X18) = host(X7)
& host(X18) = nbr_proc
& index(status,host(X18)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),X12) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p',axiom_46) ).
fof(axiom_12,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
file('/export/starexec/sandbox/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p',axiom_12) ).
fof(c_0_6,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
<=> ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( host(X7) = nbr_proc
=> ~ elem(m_NotNorm(X6),queue(host(X7))) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(ldr,host(X14)) = host(X7)
& index(status,host(X14)) = norm )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X7) )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& elem(m_Down(X7),queue(host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& setIn(host(X7),index(down,host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
introduced(definition) ).
fof(c_0_7,plain,
! [X102,X103,X104] :
( ( ~ elem(X102,snoc(X104,X103))
| X102 = X103
| elem(X102,X104) )
& ( X102 != X103
| elem(X102,snoc(X104,X103)) )
& ( ~ elem(X102,X104)
| elem(X102,snoc(X104,X103)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_8,plain,
! [X89] :
( X89 = q_nil
| X89 = snoc(init(X89),last(X89)) ),
inference(variable_rename,[status(thm)],[axiom_40]) ).
fof(c_0_9,plain,
! [X5,X4] : q_nil != cons(X5,X4),
inference(fof_simplification,[status(thm)],[axiom_41]) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X12,X13,X5)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X5) != host(X6)
=> ( host(X13) = host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( ! [X16] :
( ( ~ leq(host(X18),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X18)))
| X16 = host(X17) ) )
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& host(X18) = host(X7)
& host(X18) = nbr_proc
& index(status,host(X18)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),X12) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_6]) ).
cnf(c_0_11,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( X1 = q_nil
| X1 = snoc(init(X1),last(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X99,X100,X101] :
( ( ~ elem(X99,cons(X100,X101))
| X99 = X100
| elem(X99,X101) )
& ( X99 != X100
| elem(X99,cons(X100,X101)) )
& ( ~ elem(X99,X101)
| elem(X99,cons(X100,X101)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_14,plain,
! [X90,X91] : q_nil != cons(X90,X91),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_15,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
=> ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( host(X7) = nbr_proc
=> ~ elem(m_NotNorm(X6),queue(host(X7))) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(ldr,host(X14)) = host(X7)
& index(status,host(X14)) = norm )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X7) )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& elem(m_Down(X7),queue(host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& setIn(host(X7),index(down,host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
fof(c_0_16,negated_conjecture,
! [X155] :
( epred1_3(esk5_0,esk6_0,esk7_0)
& setIn(esk6_0,alive)
& host(esk7_0) != host(esk8_0)
& host(esk6_0) = host(esk8_0)
& host(esk7_0) = host(esk11_0)
& host(esk6_0) != host(esk11_0)
& ( leq(host(esk11_0),X155)
| ~ leq(s(zero),X155)
| setIn(X155,index(down,host(esk11_0)))
| X155 = host(esk10_0) )
& elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0)))
& host(esk11_0) = host(esk9_0)
& host(esk11_0) = nbr_proc
& index(status,host(esk11_0)) = elec_1
& setIn(esk8_0,alive)
& elem(m_Down(esk9_0),esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
cnf(c_0_17,plain,
( X1 = last(X2)
| X2 = q_nil
| elem(X1,init(X2))
| ~ elem(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
q_nil != cons(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [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] :
( ( ~ elem(m_Ldr(X160),queue(host(X159)))
| ~ leq(host(X159),host(X160))
| ~ epred1_3(X158,X157,X156) )
& ( ~ elem(m_Down(X162),queue(host(X161)))
| host(X162) != host(X161)
| ~ epred1_3(X158,X157,X156) )
& ( host(X164) != nbr_proc
| ~ elem(m_NotNorm(X163),queue(host(X164)))
| ~ epred1_3(X158,X157,X156) )
& ( X166 = X165
| host(X166) != host(X165)
| ~ setIn(X165,alive)
| ~ setIn(X166,alive)
| ~ epred1_3(X158,X157,X156) )
& ( index(status,host(X167)) != elec_1
| ~ setIn(X167,alive)
| index(elid,host(X167)) = X167
| ~ epred1_3(X158,X157,X156) )
& ( index(status,host(X167)) != elec_2
| ~ setIn(X167,alive)
| index(elid,host(X167)) = X167
| ~ epred1_3(X158,X157,X156) )
& ( host(X170) = host(X169)
| ~ setIn(X170,alive)
| host(X170) != host(X168)
| index(ldr,host(X170)) != host(X169)
| index(status,host(X170)) != norm
| ~ elem(m_Down(X168),queue(host(X169)))
| ~ epred1_3(X158,X157,X156) )
& ( host(X173) = host(X172)
| ~ setIn(X173,alive)
| host(X173) != host(X171)
| index(status,host(X173)) != wait
| host(index(elid,host(X173))) != host(X172)
| ~ elem(m_Down(X171),queue(host(X172)))
| ~ epred1_3(X158,X157,X156) )
& ( host(X176) = host(X174)
| ~ setIn(X174,alive)
| ~ setIn(X176,alive)
| host(X175) != host(X174)
| host(X177) != host(X176)
| ~ elem(m_Down(X177),queue(host(X174)))
| ~ elem(m_Down(X175),queue(host(X176)))
| ~ epred1_3(X158,X157,X156) )
& ( host(X180) = host(X178)
| ~ setIn(X178,alive)
| ~ setIn(X180,alive)
| host(X179) != host(X178)
| host(X181) != host(X180)
| ~ elem(m_Down(X181),queue(host(X178)))
| ~ setIn(host(X179),index(down,host(X180)))
| ~ epred1_3(X158,X157,X156) )
& ( ~ leq(host(X185),esk12_7(X156,X157,X158,X182,X183,X184,X185))
| ~ elem(m_Down(X184),queue(host(X185)))
| host(X185) != host(X183)
| host(X185) != nbr_proc
| index(status,host(X185)) != elec_1
| ~ setIn(X182,alive)
| ~ elem(m_Down(X183),queue(host(X182)))
| ~ epred1_3(X158,X157,X156) )
& ( leq(s(zero),esk12_7(X156,X157,X158,X182,X183,X184,X185))
| ~ elem(m_Down(X184),queue(host(X185)))
| host(X185) != host(X183)
| host(X185) != nbr_proc
| index(status,host(X185)) != elec_1
| ~ setIn(X182,alive)
| ~ elem(m_Down(X183),queue(host(X182)))
| ~ epred1_3(X158,X157,X156) )
& ( ~ setIn(esk12_7(X156,X157,X158,X182,X183,X184,X185),index(down,host(X185)))
| ~ elem(m_Down(X184),queue(host(X185)))
| host(X185) != host(X183)
| host(X185) != nbr_proc
| index(status,host(X185)) != elec_1
| ~ setIn(X182,alive)
| ~ elem(m_Down(X183),queue(host(X182)))
| ~ epred1_3(X158,X157,X156) )
& ( esk12_7(X156,X157,X158,X182,X183,X184,X185) != host(X184)
| ~ elem(m_Down(X184),queue(host(X185)))
| host(X185) != host(X183)
| host(X185) != nbr_proc
| index(status,host(X185)) != elec_1
| ~ setIn(X182,alive)
| ~ elem(m_Down(X183),queue(host(X182)))
| ~ epred1_3(X158,X157,X156) )
& ( queue(host(X157)) = cons(m_Halt(X156),X158)
| ~ epred1_3(X158,X157,X156) ) ),
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_15])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( leq(host(esk11_0),X1)
| setIn(X1,index(down,host(esk11_0)))
| X1 = host(esk10_0)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
host(esk11_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
index(status,host(esk11_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( X1 = last(cons(X2,X3))
| elem(X1,init(cons(X2,X3)))
| ~ elem(X1,X3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
elem(m_Down(esk9_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
host(esk6_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( X1 = host(esk10_0)
| leq(nbr_proc,X1)
| setIn(X1,index(down,nbr_proc))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_30,plain,
( leq(s(zero),esk12_7(X1,X2,X3,X4,X5,X6,X7))
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X7) != host(X5)
| host(X7) != nbr_proc
| index(status,host(X7)) != elec_1
| ~ setIn(X4,alive)
| ~ elem(m_Down(X5),queue(host(X4)))
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( ~ setIn(esk12_7(X1,X2,X3,X4,X5,X6,X7),index(down,host(X7)))
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X7) != host(X5)
| host(X7) != nbr_proc
| index(status,host(X7)) != elec_1
| ~ setIn(X4,alive)
| ~ elem(m_Down(X5),queue(host(X4)))
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,negated_conjecture,
index(status,nbr_proc) = elec_1,
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_33,plain,
( ~ leq(host(X1),esk12_7(X2,X3,X4,X5,X6,X7,X1))
| ~ elem(m_Down(X7),queue(host(X1)))
| host(X1) != host(X6)
| host(X1) != nbr_proc
| index(status,host(X1)) != elec_1
| ~ setIn(X5,alive)
| ~ elem(m_Down(X6),queue(host(X5)))
| ~ epred1_3(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,plain,
( elem(X1,snoc(X3,X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,plain,
( elem(X1,snoc(X2,X3))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_36,negated_conjecture,
( last(cons(X1,esk5_0)) = m_Down(esk9_0)
| elem(m_Down(esk9_0),init(cons(X1,esk5_0))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
cons(m_Halt(esk7_0),esk5_0) = queue(host(esk8_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_38,negated_conjecture,
( esk12_7(X1,X2,X3,X4,X5,X6,X7) = host(esk10_0)
| leq(nbr_proc,esk12_7(X1,X2,X3,X4,X5,X6,X7))
| setIn(esk12_7(X1,X2,X3,X4,X5,X6,X7),index(down,nbr_proc))
| index(status,host(X7)) != elec_1
| host(X5) != host(X7)
| host(X7) != nbr_proc
| ~ epred1_3(X3,X2,X1)
| ~ setIn(X4,alive)
| ~ elem(m_Down(X6),queue(host(X7)))
| ~ elem(m_Down(X5),queue(host(X4))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( host(X1) != nbr_proc
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk12_7(X4,X3,X2,X5,X1,X6,esk11_0),index(down,nbr_proc))
| ~ setIn(X5,alive)
| ~ elem(m_Down(X1),queue(host(X5)))
| ~ elem(m_Down(X6),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( host(X1) != nbr_proc
| ~ epred1_3(X2,X3,X4)
| ~ leq(nbr_proc,esk12_7(X4,X3,X2,X5,X1,X6,esk11_0))
| ~ setIn(X5,alive)
| ~ elem(m_Down(X1),queue(host(X5)))
| ~ elem(m_Down(X6),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_32])]) ).
cnf(c_0_41,plain,
elem(X1,snoc(X2,X1)),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
( X1 = q_nil
| elem(X2,X1)
| ~ elem(X2,init(X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_12]) ).
cnf(c_0_43,negated_conjecture,
( last(queue(host(esk8_0))) = m_Down(esk9_0)
| elem(m_Down(esk9_0),init(queue(host(esk8_0)))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
queue(host(esk8_0)) != q_nil,
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
fof(c_0_45,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
inference(fof_simplification,[status(thm)],[axiom_12]) ).
cnf(c_0_46,plain,
( esk12_7(X1,X2,X3,X4,X5,X6,X7) != host(X6)
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X7) != host(X5)
| host(X7) != nbr_proc
| index(status,host(X7)) != elec_1
| ~ setIn(X4,alive)
| ~ elem(m_Down(X5),queue(host(X4)))
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_47,negated_conjecture,
( esk12_7(X1,X2,X3,X4,X5,X6,esk11_0) = host(esk10_0)
| host(X5) != nbr_proc
| ~ epred1_3(X3,X2,X1)
| ~ setIn(X4,alive)
| ~ elem(m_Down(X5),queue(host(X4)))
| ~ elem(m_Down(X6),queue(nbr_proc)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_22]),c_0_32])]),c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( X1 = q_nil
| elem(last(X1),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_49,negated_conjecture,
( last(queue(host(esk8_0))) = m_Down(esk9_0)
| elem(m_Down(esk9_0),queue(host(esk8_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
host(esk11_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_51,negated_conjecture,
elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_52,plain,
! [X28,X29,X30] : m_Ack(X28,X29) != m_Down(X30),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_45])]) ).
cnf(c_0_53,plain,
( host(esk10_0) != host(X1)
| host(X2) != nbr_proc
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X2),queue(host(X6)))
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
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_46,c_0_47]),c_0_22]),c_0_32]),c_0_22]),c_0_22]),c_0_22])]) ).
cnf(c_0_54,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk8_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_44]) ).
cnf(c_0_55,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_50,c_0_22]) ).
cnf(c_0_56,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_57,negated_conjecture,
elem(m_Down(esk10_0),snoc(queue(nbr_proc),m_Ack(esk7_0,esk6_0))),
inference(rw,[status(thm)],[c_0_51,c_0_22]) ).
cnf(c_0_58,plain,
m_Ack(X1,X2) != m_Down(X3),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( host(esk10_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]) ).
cnf(c_0_60,negated_conjecture,
elem(m_Down(esk10_0),queue(nbr_proc)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_57]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWV471+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 17:02:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/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/tmp/tmp.i9L9h8ctVd/E---3.1_17318.p
% 51.35/6.96 # Version: 3.1.0
% 51.35/6.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 51.35/6.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.35/6.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 51.35/6.96 # Starting new_bool_3 with 300s (1) cores
% 51.35/6.96 # Starting new_bool_1 with 300s (1) cores
% 51.35/6.96 # Starting sh5l with 300s (1) cores
% 51.35/6.96 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17396 completed with status 0
% 51.35/6.96 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 51.35/6.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 51.35/6.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.35/6.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 51.35/6.96 # No SInE strategy applied
% 51.35/6.96 # Search class: FGHSM-FFMM31-MFFFFFNN
% 51.35/6.96 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 51.35/6.96 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 51.35/6.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 51.35/6.96 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 51.35/6.96 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 51.35/6.96 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 51.35/6.96 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 17406 completed with status 0
% 51.35/6.96 # Result found by U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 51.35/6.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 51.35/6.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.35/6.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 51.35/6.96 # No SInE strategy applied
% 51.35/6.96 # Search class: FGHSM-FFMM31-MFFFFFNN
% 51.35/6.96 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 51.35/6.96 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 51.35/6.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 51.35/6.96 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 51.35/6.96 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 51.35/6.96 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 51.35/6.96 # Preprocessing time : 0.003 s
% 51.35/6.96 # Presaturation interreduction done
% 51.35/6.96
% 51.35/6.96 # Proof found!
% 51.35/6.96 # SZS status Theorem
% 51.35/6.96 # SZS output start CNFRefutation
% See solution above
% 51.35/6.96 # Parsed axioms : 67
% 51.35/6.96 # Removed by relevancy pruning/SinE : 0
% 51.35/6.96 # Initial clauses : 124
% 51.35/6.96 # Removed in clause preprocessing : 6
% 51.35/6.96 # Initial clauses in saturation : 118
% 51.35/6.96 # Processed clauses : 29901
% 51.35/6.96 # ...of these trivial : 1392
% 51.35/6.96 # ...subsumed : 25016
% 51.35/6.96 # ...remaining for further processing : 3493
% 51.35/6.96 # Other redundant clauses eliminated : 236
% 51.35/6.96 # Clauses deleted for lack of memory : 0
% 51.35/6.96 # Backward-subsumed : 348
% 51.35/6.96 # Backward-rewritten : 47
% 51.35/6.96 # Generated clauses : 673409
% 51.35/6.96 # ...of the previous two non-redundant : 497626
% 51.35/6.96 # ...aggressively subsumed : 0
% 51.35/6.96 # Contextual simplify-reflections : 22
% 51.35/6.96 # Paramodulations : 673025
% 51.35/6.96 # Factorizations : 140
% 51.35/6.96 # NegExts : 0
% 51.35/6.96 # Equation resolutions : 243
% 51.35/6.96 # Disequality decompositions : 0
% 51.35/6.96 # Total rewrite steps : 225780
% 51.35/6.96 # ...of those cached : 223546
% 51.35/6.96 # Propositional unsat checks : 0
% 51.35/6.96 # Propositional check models : 0
% 51.35/6.96 # Propositional check unsatisfiable : 0
% 51.35/6.96 # Propositional clauses : 0
% 51.35/6.96 # Propositional clauses after purity: 0
% 51.35/6.96 # Propositional unsat core size : 0
% 51.35/6.96 # Propositional preprocessing time : 0.000
% 51.35/6.96 # Propositional encoding time : 0.000
% 51.35/6.96 # Propositional solver time : 0.000
% 51.35/6.96 # Success case prop preproc time : 0.000
% 51.35/6.96 # Success case prop encoding time : 0.000
% 51.35/6.96 # Success case prop solver time : 0.000
% 51.35/6.96 # Current number of processed clauses : 2977
% 51.35/6.96 # Positive orientable unit clauses : 282
% 51.35/6.96 # Positive unorientable unit clauses: 0
% 51.35/6.96 # Negative unit clauses : 435
% 51.35/6.96 # Non-unit-clauses : 2260
% 51.35/6.96 # Current number of unprocessed clauses: 451515
% 51.35/6.96 # ...number of literals in the above : 1428985
% 51.35/6.96 # Current number of archived formulas : 0
% 51.35/6.96 # Current number of archived clauses : 509
% 51.35/6.96 # Clause-clause subsumption calls (NU) : 1655782
% 51.35/6.96 # Rec. Clause-clause subsumption calls : 1156085
% 51.35/6.96 # Non-unit clause-clause subsumptions : 10764
% 51.35/6.96 # Unit Clause-clause subsumption calls : 208936
% 51.35/6.96 # Rewrite failures with RHS unbound : 0
% 51.35/6.96 # BW rewrite match attempts : 11006
% 51.35/6.96 # BW rewrite match successes : 38
% 51.35/6.96 # Condensation attempts : 0
% 51.35/6.96 # Condensation successes : 0
% 51.35/6.96 # Termbank termtop insertions : 15120339
% 51.35/6.96 # Search garbage collected termcells : 1851
% 51.35/6.96
% 51.35/6.96 # -------------------------------------------------
% 51.35/6.96 # User time : 5.942 s
% 51.35/6.96 # System time : 0.191 s
% 51.35/6.96 # Total time : 6.133 s
% 51.35/6.96 # Maximum resident set size: 2156 pages
% 51.35/6.96
% 51.35/6.96 # -------------------------------------------------
% 51.35/6.96 # User time : 30.860 s
% 51.35/6.96 # System time : 0.849 s
% 51.35/6.96 # Total time : 31.709 s
% 51.35/6.96 # Maximum resident set size: 1792 pages
% 51.35/6.96 % E---3.1 exiting
% 51.35/6.96 % E exiting
%------------------------------------------------------------------------------