TSTP Solution File: SWV466+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV466+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:47:03 EDT 2023
% Result : Theorem 2.84s 0.90s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 72 ( 36 unt; 0 def)
% Number of atoms : 546 ( 211 equ)
% Maximal formula atoms : 114 ( 7 avg)
% Number of connectives : 709 ( 235 ~; 176 |; 224 &)
% ( 5 <=>; 69 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 20 con; 0-7 aty)
% Number of variables : 285 ( 50 sgn; 206 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14))) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_1 )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& host(X15) = host(X7) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X7))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X15)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X16),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X16) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( setIn(X20,alive)
& leq(nbr_proc,s(index(pendack,host(X20))))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& index(status,host(X20)) = elec_2
& host(X18) = index(pendack,host(X20))
& host(X19) = s(index(pendack,host(X20))) )
=> ~ ( setIn(X17,alive)
& host(X5) = host(X17) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',conj) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',axiom_04) ).
fof(axiom_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( X5 = s(X6)
| leq(X5,X6) ) ),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',axiom_64) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',axiom_47) ).
fof(axiom_14,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Ldr(X7),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',axiom_14) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.NPS5bY2SgN/E---3.1_3790.p',axiom_46) ).
fof(c_0_7,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
<=> ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14))) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_1 )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& host(X15) = host(X7) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X7))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X15)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X16),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X16) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( setIn(X20,alive)
& leq(nbr_proc,s(index(pendack,host(X20))))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& index(status,host(X20)) = elec_2
& host(X18) = index(pendack,host(X20))
& host(X19) = s(index(pendack,host(X20))) )
=> ~ ( setIn(X17,alive)
& host(X5) = host(X17) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_7]) ).
fof(c_0_9,negated_conjecture,
( epred1_3(esk1_0,esk3_0,esk2_0)
& setIn(esk2_0,alive)
& leq(host(esk2_0),host(esk3_0))
& index(status,host(esk2_0)) = elec_2
& host(esk3_0) = index(pendack,host(esk2_0))
& leq(nbr_proc,index(pendack,host(esk2_0)))
& setIn(host(esk4_0),index(acks,host(esk2_0)))
& host(esk2_0) = host(esk5_0)
& host(esk4_0) = host(esk8_0)
& host(esk2_0) != host(esk8_0)
& setIn(esk8_0,alive)
& leq(nbr_proc,s(index(pendack,host(esk8_0))))
& elem(m_Down(esk7_0),snoc(queue(host(esk8_0)),m_Ldr(esk2_0)))
& elem(m_Ack(esk8_0,esk6_0),snoc(queue(host(esk8_0)),m_Ldr(esk2_0)))
& index(status,host(esk8_0)) = elec_2
& host(esk6_0) = index(pendack,host(esk8_0))
& host(esk7_0) = s(index(pendack,host(esk8_0)))
& setIn(esk5_0,alive)
& host(esk2_0) = host(esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])]) ).
fof(c_0_10,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
=> ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14))) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_1 )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& host(X15) = host(X7) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X7))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X15)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X16),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X16) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X93,X94] :
( ( ~ leq(X93,X94)
| ~ leq(X94,X93)
| X93 = X94 )
& ( leq(X93,X94)
| X93 != X94 )
& ( leq(X94,X93)
| X93 != X94 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])]) ).
cnf(c_0_12,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
host(esk3_0) = index(pendack,host(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X98] : leq(host(X98),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_15,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk8_0)))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
host(esk6_0) = index(pendack,host(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
host(esk7_0) = s(index(pendack,host(esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X125,X126,X127,X128,X129,X130,X131,X132,X133,X134,X135,X136,X137,X138,X139,X140,X141,X142,X143,X144,X145,X146,X147,X148,X149,X150,X151,X152,X153,X154,X155,X156,X157,X158,X159,X160,X162,X163,X164,X165] :
( ( ~ elem(m_Ldr(X129),queue(host(X128)))
| ~ leq(host(X128),host(X129))
| ~ epred1_3(X127,X126,X125) )
& ( ~ elem(m_Down(X131),queue(host(X130)))
| host(X131) != host(X130)
| ~ epred1_3(X127,X126,X125) )
& ( ~ elem(m_Halt(X133),queue(host(X132)))
| ~ leq(host(X132),host(X133))
| ~ epred1_3(X127,X126,X125) )
& ( ~ elem(m_Ack(X136,X134),queue(host(X135)))
| ~ leq(host(X134),host(X136))
| ~ epred1_3(X127,X126,X125) )
& ( X138 = X137
| host(X138) != host(X137)
| ~ setIn(X137,alive)
| ~ setIn(X138,alive)
| ~ epred1_3(X127,X126,X125) )
& ( ~ setIn(X140,alive)
| ~ elem(m_Ack(X140,X139),queue(host(X140)))
| leq(host(X139),index(pendack,host(X140)))
| ~ epred1_3(X127,X126,X125) )
& ( ~ setIn(X142,alive)
| index(status,host(X142)) != elec_1
| ~ elem(m_Ack(X142,X141),queue(host(X142)))
| ~ epred1_3(X127,X126,X125) )
& ( index(status,host(X143)) != elec_1
| ~ setIn(X143,alive)
| index(elid,host(X143)) = X143
| ~ epred1_3(X127,X126,X125) )
& ( index(status,host(X143)) != elec_2
| ~ setIn(X143,alive)
| index(elid,host(X143)) = X143
| ~ epred1_3(X127,X126,X125) )
& ( ~ setIn(X146,alive)
| ~ elem(m_Down(X145),queue(host(X146)))
| host(X145) != host(X144)
| ~ setIn(X144,alive)
| index(ldr,host(X144)) != host(X144)
| index(status,host(X144)) != norm
| ~ epred1_3(X127,X126,X125) )
& ( leq(host(X147),host(X148))
| ~ setIn(X147,alive)
| ~ setIn(X148,alive)
| index(status,host(X147)) != elec_2
| index(status,host(X148)) != elec_2
| leq(index(pendack,host(X148)),host(X147))
| ~ epred1_3(X127,X126,X125) )
& ( ~ setIn(X149,alive)
| ~ setIn(X151,alive)
| host(X151) != host(X150)
| index(status,host(X149)) != elec_2
| index(status,host(X151)) != elec_2
| ~ elem(m_Ack(X149,X150),queue(host(X149)))
| ~ epred1_3(X127,X126,X125) )
& ( leq(host(X152),host(X153))
| ~ setIn(X152,alive)
| ~ setIn(X153,alive)
| index(status,host(X152)) != elec_2
| index(status,host(X153)) != elec_2
| ~ leq(index(pendack,host(X152)),index(pendack,host(X153)))
| ~ epred1_3(X127,X126,X125) )
& ( leq(index(pendack,host(X156)),host(X154))
| ~ setIn(X156,alive)
| ~ elem(m_Halt(X156),queue(host(X155)))
| index(status,host(X156)) != elec_2
| ~ setIn(X154,alive)
| index(ldr,host(X154)) != host(X154)
| index(status,host(X154)) != norm
| ~ epred1_3(X127,X126,X125) )
& ( ~ leq(host(X160),esk9_7(X125,X126,X127,X157,X158,X159,X160))
| ~ elem(m_Down(X159),queue(host(X160)))
| host(X160) != nbr_proc
| host(X160) != host(X158)
| index(status,host(X160)) != elec_1
| ~ setIn(X157,alive)
| ~ elem(m_Down(X158),queue(host(X157)))
| ~ epred1_3(X127,X126,X125) )
& ( leq(s(zero),esk9_7(X125,X126,X127,X157,X158,X159,X160))
| ~ elem(m_Down(X159),queue(host(X160)))
| host(X160) != nbr_proc
| host(X160) != host(X158)
| index(status,host(X160)) != elec_1
| ~ setIn(X157,alive)
| ~ elem(m_Down(X158),queue(host(X157)))
| ~ epred1_3(X127,X126,X125) )
& ( ~ setIn(esk9_7(X125,X126,X127,X157,X158,X159,X160),index(down,host(X160)))
| ~ elem(m_Down(X159),queue(host(X160)))
| host(X160) != nbr_proc
| host(X160) != host(X158)
| index(status,host(X160)) != elec_1
| ~ setIn(X157,alive)
| ~ elem(m_Down(X158),queue(host(X157)))
| ~ epred1_3(X127,X126,X125) )
& ( esk9_7(X125,X126,X127,X157,X158,X159,X160) != host(X159)
| ~ elem(m_Down(X159),queue(host(X160)))
| host(X160) != nbr_proc
| host(X160) != host(X158)
| index(status,host(X160)) != elec_1
| ~ setIn(X157,alive)
| ~ elem(m_Down(X158),queue(host(X157)))
| ~ epred1_3(X127,X126,X125) )
& ( ~ setIn(X164,alive)
| ~ elem(m_Down(X163),queue(host(X164)))
| ~ elem(m_Ack(X164,X162),queue(host(X164)))
| ~ leq(nbr_proc,s(index(pendack,host(X164))))
| index(status,host(X164)) != elec_2
| host(X162) != index(pendack,host(X164))
| host(X163) != s(index(pendack,host(X164)))
| ~ setIn(X165,alive)
| index(ldr,host(X165)) != host(X165)
| index(status,host(X165)) != norm
| ~ epred1_3(X127,X126,X125) )
& ( queue(host(X125)) = cons(m_Down(X126),X127)
| ~ epred1_3(X127,X126,X125) ) ),
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])])])])])]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
leq(nbr_proc,host(esk3_0)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
leq(nbr_proc,s(host(esk6_0))),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
s(host(esk6_0)) = host(esk7_0),
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,plain,
( leq(host(X1),host(X2))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| index(status,host(X1)) != elec_2
| index(status,host(X2)) != elec_2
| ~ leq(index(pendack,host(X1)),index(pendack,host(X2)))
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
setIn(esk2_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
index(status,host(esk2_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
host(esk3_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
leq(nbr_proc,host(esk7_0)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( leq(host(X1),host(esk2_0))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ leq(index(pendack,host(X1)),nbr_proc)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_13])]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
index(status,host(esk8_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_32,plain,
! [X39,X40] :
( ( ~ leq(X39,s(X40))
| X39 = s(X40)
| leq(X39,X40) )
& ( X39 != s(X40)
| leq(X39,s(X40)) )
& ( ~ leq(X39,X40)
| leq(X39,s(X40)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])]) ).
cnf(c_0_33,negated_conjecture,
host(esk7_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_28]),c_0_21])]) ).
cnf(c_0_34,negated_conjecture,
( leq(host(esk8_0),host(esk2_0))
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_16]),c_0_21])]) ).
cnf(c_0_35,negated_conjecture,
epred1_3(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,plain,
( X1 = s(X2)
| leq(X1,X2)
| ~ leq(X1,s(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
s(host(esk6_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_38,plain,
( leq(host(X1),host(X2))
| leq(index(pendack,host(X2)),host(X1))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| index(status,host(X1)) != elec_2
| index(status,host(X2)) != elec_2
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_39,negated_conjecture,
leq(host(esk8_0),host(esk2_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
host(esk2_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
( X1 = nbr_proc
| leq(X1,host(esk6_0))
| ~ leq(X1,nbr_proc) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( leq(host(X1),host(esk8_0))
| leq(host(esk6_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_16]),c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
~ leq(host(esk2_0),host(esk8_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
( ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X2) != host(X3)
| index(status,host(X1)) != elec_2
| index(status,host(X2)) != elec_2
| ~ elem(m_Ack(X1,X3),queue(host(X1)))
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_45,negated_conjecture,
( host(X1) = nbr_proc
| leq(host(X1),host(esk6_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_46,negated_conjecture,
( leq(host(esk6_0),host(esk2_0))
| ~ epred1_3(X1,X2,X3) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_26])]),c_0_43]) ).
fof(c_0_47,plain,
! [X45,X46,X47] :
( ( ~ elem(X45,snoc(X47,X46))
| X45 = X46
| elem(X45,X47) )
& ( X45 != X46
| elem(X45,snoc(X47,X46)) )
& ( ~ elem(X45,X47)
| elem(X45,snoc(X47,X46)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])]) ).
fof(c_0_48,plain,
! [X54,X55,X56] : m_Ack(X54,X55) != m_Ldr(X56),
inference(variable_rename,[status(thm)],[axiom_14]) ).
fof(c_0_49,plain,
! [X42,X43,X44] :
( ( ~ elem(X42,cons(X43,X44))
| X42 = X43
| elem(X42,X44) )
& ( X42 != X43
| elem(X42,cons(X43,X44)) )
& ( ~ elem(X42,X44)
| elem(X42,cons(X43,X44)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_50,negated_conjecture,
( index(status,host(X1)) != elec_2
| host(esk2_0) != host(X2)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Ack(X1,X2),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_25]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
( host(esk6_0) = host(X1)
| host(X1) = nbr_proc
| ~ leq(host(esk6_0),host(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
leq(host(esk6_0),host(esk2_0)),
inference(spm,[status(thm)],[c_0_46,c_0_35]) ).
cnf(c_0_53,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
elem(m_Ack(esk8_0,esk6_0),snoc(queue(host(esk8_0)),m_Ldr(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_55,plain,
m_Ack(X1,X2) != m_Ldr(X3),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_58,negated_conjecture,
( host(esk2_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Ack(esk8_0,X1),queue(host(esk8_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_30]),c_0_31])]) ).
cnf(c_0_59,negated_conjecture,
( host(esk6_0) = host(esk2_0)
| host(esk2_0) = nbr_proc ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,negated_conjecture,
elem(m_Ack(esk8_0,esk6_0),queue(host(esk8_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_61,plain,
( ~ elem(m_Down(X1),queue(host(X2)))
| host(X1) != host(X2)
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_62,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_63,negated_conjecture,
cons(m_Down(esk3_0),esk1_0) = queue(host(esk2_0)),
inference(spm,[status(thm)],[c_0_57,c_0_35]) ).
cnf(c_0_64,negated_conjecture,
( host(esk2_0) = nbr_proc
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_65,plain,
( host(X1) != nbr_proc
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(spm,[status(thm)],[c_0_61,c_0_33]) ).
cnf(c_0_66,negated_conjecture,
elem(m_Down(esk3_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
host(esk2_0) = nbr_proc,
inference(spm,[status(thm)],[c_0_64,c_0_35]) ).
cnf(c_0_68,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(esk3_0),queue(nbr_proc)) ),
inference(spm,[status(thm)],[c_0_65,c_0_27]) ).
cnf(c_0_69,negated_conjecture,
elem(m_Down(esk3_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV466+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 04:33:46 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.NPS5bY2SgN/E---3.1_3790.p
% 2.84/0.90 # Version: 3.1pre001
% 2.84/0.90 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.84/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.84/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.84/0.90 # Starting new_bool_3 with 300s (1) cores
% 2.84/0.90 # Starting new_bool_1 with 300s (1) cores
% 2.84/0.90 # Starting sh5l with 300s (1) cores
% 2.84/0.90 # new_bool_1 with pid 3870 completed with status 0
% 2.84/0.90 # Result found by new_bool_1
% 2.84/0.90 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.84/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.84/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.84/0.90 # Starting new_bool_3 with 300s (1) cores
% 2.84/0.90 # Starting new_bool_1 with 300s (1) cores
% 2.84/0.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.84/0.90 # Search class: FGHSM-FFMM31-MFFFFFNN
% 2.84/0.90 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.84/0.90 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 2.84/0.90 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 3873 completed with status 0
% 2.84/0.90 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 2.84/0.90 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.84/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.84/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.84/0.90 # Starting new_bool_3 with 300s (1) cores
% 2.84/0.90 # Starting new_bool_1 with 300s (1) cores
% 2.84/0.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.84/0.90 # Search class: FGHSM-FFMM31-MFFFFFNN
% 2.84/0.90 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.84/0.90 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 2.84/0.90 # Preprocessing time : 0.004 s
% 2.84/0.90 # Presaturation interreduction done
% 2.84/0.90
% 2.84/0.90 # Proof found!
% 2.84/0.90 # SZS status Theorem
% 2.84/0.90 # SZS output start CNFRefutation
% See solution above
% 2.84/0.90 # Parsed axioms : 67
% 2.84/0.90 # Removed by relevancy pruning/SinE : 14
% 2.84/0.90 # Initial clauses : 106
% 2.84/0.90 # Removed in clause preprocessing : 6
% 2.84/0.90 # Initial clauses in saturation : 100
% 2.84/0.90 # Processed clauses : 3329
% 2.84/0.90 # ...of these trivial : 120
% 2.84/0.90 # ...subsumed : 2099
% 2.84/0.90 # ...remaining for further processing : 1110
% 2.84/0.90 # Other redundant clauses eliminated : 5
% 2.84/0.90 # Clauses deleted for lack of memory : 0
% 2.84/0.90 # Backward-subsumed : 177
% 2.84/0.90 # Backward-rewritten : 104
% 2.84/0.90 # Generated clauses : 51169
% 2.84/0.90 # ...of the previous two non-redundant : 22298
% 2.84/0.90 # ...aggressively subsumed : 0
% 2.84/0.90 # Contextual simplify-reflections : 0
% 2.84/0.90 # Paramodulations : 51070
% 2.84/0.90 # Factorizations : 75
% 2.84/0.90 # NegExts : 0
% 2.84/0.90 # Equation resolutions : 23
% 2.84/0.90 # Total rewrite steps : 38143
% 2.84/0.90 # Propositional unsat checks : 0
% 2.84/0.90 # Propositional check models : 0
% 2.84/0.90 # Propositional check unsatisfiable : 0
% 2.84/0.90 # Propositional clauses : 0
% 2.84/0.90 # Propositional clauses after purity: 0
% 2.84/0.90 # Propositional unsat core size : 0
% 2.84/0.90 # Propositional preprocessing time : 0.000
% 2.84/0.90 # Propositional encoding time : 0.000
% 2.84/0.90 # Propositional solver time : 0.000
% 2.84/0.90 # Success case prop preproc time : 0.000
% 2.84/0.90 # Success case prop encoding time : 0.000
% 2.84/0.90 # Success case prop solver time : 0.000
% 2.84/0.90 # Current number of processed clauses : 728
% 2.84/0.90 # Positive orientable unit clauses : 154
% 2.84/0.90 # Positive unorientable unit clauses: 0
% 2.84/0.90 # Negative unit clauses : 33
% 2.84/0.90 # Non-unit-clauses : 541
% 2.84/0.90 # Current number of unprocessed clauses: 18948
% 2.84/0.90 # ...number of literals in the above : 64278
% 2.84/0.90 # Current number of archived formulas : 0
% 2.84/0.90 # Current number of archived clauses : 378
% 2.84/0.90 # Clause-clause subsumption calls (NU) : 210440
% 2.84/0.90 # Rec. Clause-clause subsumption calls : 121340
% 2.84/0.90 # Non-unit clause-clause subsumptions : 2111
% 2.84/0.90 # Unit Clause-clause subsumption calls : 9164
% 2.84/0.90 # Rewrite failures with RHS unbound : 0
% 2.84/0.90 # BW rewrite match attempts : 1145
% 2.84/0.90 # BW rewrite match successes : 36
% 2.84/0.90 # Condensation attempts : 0
% 2.84/0.90 # Condensation successes : 0
% 2.84/0.90 # Termbank termtop insertions : 668442
% 2.84/0.90
% 2.84/0.90 # -------------------------------------------------
% 2.84/0.90 # User time : 0.385 s
% 2.84/0.90 # System time : 0.014 s
% 2.84/0.90 # Total time : 0.399 s
% 2.84/0.90 # Maximum resident set size: 2128 pages
% 2.84/0.90
% 2.84/0.90 # -------------------------------------------------
% 2.84/0.90 # User time : 0.387 s
% 2.84/0.90 # System time : 0.015 s
% 2.84/0.90 # Total time : 0.402 s
% 2.84/0.90 # Maximum resident set size: 1780 pages
% 2.84/0.90 % E---3.1 exiting
% 3.48/0.90 % E---3.1 exiting
%------------------------------------------------------------------------------