TSTP Solution File: SWV461+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV461+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : 600s
% DateTime : Wed Jul 20 18:16:53 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 33 unt; 0 def)
% Number of atoms : 503 ( 216 equ)
% Maximal formula atoms : 115 ( 9 avg)
% Number of connectives : 675 ( 225 ~; 150 |; 225 &)
% ( 3 <=>; 72 =>; 0 <=; 0 <~>)
% Maximal formula depth : 70 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 19 con; 0-5 aty)
% Number of variables : 225 ( 15 sgn 202 !; 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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_11,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Halt(X7),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_11) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(axiom_17,axiom,
! [X5,X6] : m_Down(X5) != m_Halt(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
fof(c_0_7,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_8,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(assume_negation,[status(cth)],[conj]),c_0_7]) ).
fof(c_0_9,negated_conjecture,
! [X19] :
( epred1_1(esk2_0)
& queue(host(esk2_0)) = q_nil
& ( host(esk2_0) != host(X19)
| leq(X19,esk1_0) )
& ~ setIn(esk1_0,pids)
& host(esk2_0) = host(esk1_0)
& host(esk1_0) = s(zero)
& ~ leq(nbr_proc,host(esk1_0))
& host(esk1_0) != host(esk3_0)
& s(host(esk1_0)) = host(esk6_0)
& host(esk1_0) != host(esk6_0)
& ( setIn(esk6_0,alive)
| esk6_0 = esk1_0 )
& leq(nbr_proc,s(index(pendack,host(esk6_0))))
& elem(m_Down(esk5_0),snoc(queue(host(esk6_0)),m_Halt(esk1_0)))
& elem(m_Ack(esk6_0,esk4_0),snoc(queue(host(esk6_0)),m_Halt(esk1_0)))
& index(status,host(esk6_0)) = elec_2
& host(esk4_0) = index(pendack,host(esk6_0))
& host(esk5_0) = s(index(pendack,host(esk6_0)))
& ( setIn(esk3_0,alive)
| esk3_0 = esk1_0 )
& index(ldr,host(esk3_0)) = host(esk3_0)
& index(status,host(esk3_0)) = norm ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
host(esk5_0) = s(index(pendack,host(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
host(esk4_0) = index(pendack,host(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,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_7]) ).
fof(c_0_13,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( ~ elem(X7,snoc(X9,X8))
| X7 = X8
| elem(X7,X9) )
& ( X7 != X8
| elem(X7,snoc(X9,X8)) )
& ( ~ elem(X7,X9)
| elem(X7,snoc(X9,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])])]) ).
fof(c_0_14,plain,
! [X8,X9,X10] : m_Ack(X8,X9) != m_Halt(X10),
inference(variable_rename,[status(thm)],[axiom_11]) ).
fof(c_0_15,plain,
! [X7,X8,X7,X8] :
( ( ~ leq(X7,X8)
| ~ leq(X8,X7)
| X7 = X8 )
& ( leq(X7,X8)
| X7 != X8 )
& ( leq(X8,X7)
| X7 != X8 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])])]) ).
cnf(c_0_16,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk6_0)))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
s(host(esk4_0)) = host(esk5_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_18,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_19,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39,X40,X41,X42,X43,X44,X45,X46,X47,X48,X49,X50,X53,X54,X55,X52] :
( ( host(X16) != host(X17)
| ~ setIn(X17,alive)
| ~ epred1_1(X16) )
& ( ~ elem(m_Ldr(X19),queue(host(X18)))
| ~ leq(host(X18),host(X19))
| ~ epred1_1(X16) )
& ( ~ elem(m_Down(X21),queue(host(X20)))
| host(X21) != host(X20)
| ~ epred1_1(X16) )
& ( ~ elem(m_Halt(X23),queue(host(X22)))
| ~ leq(host(X22),host(X23))
| ~ epred1_1(X16) )
& ( ~ elem(m_Ack(X26,X24),queue(host(X25)))
| ~ leq(host(X24),host(X26))
| ~ epred1_1(X16) )
& ( X28 = X27
| host(X28) != host(X27)
| ~ setIn(X27,alive)
| ~ setIn(X28,alive)
| ~ epred1_1(X16) )
& ( ~ setIn(X30,alive)
| ~ elem(m_Ack(X30,X29),queue(host(X30)))
| leq(host(X29),index(pendack,host(X30)))
| ~ epred1_1(X16) )
& ( ~ setIn(X32,alive)
| index(status,host(X32)) != elec_1
| ~ elem(m_Ack(X32,X31),queue(host(X32)))
| ~ epred1_1(X16) )
& ( index(status,host(X33)) != elec_1
| ~ setIn(X33,alive)
| index(elid,host(X33)) = X33
| ~ epred1_1(X16) )
& ( index(status,host(X33)) != elec_2
| ~ setIn(X33,alive)
| index(elid,host(X33)) = X33
| ~ epred1_1(X16) )
& ( ~ setIn(X36,alive)
| ~ elem(m_Down(X35),queue(host(X36)))
| host(X35) != host(X34)
| ~ setIn(X34,alive)
| index(ldr,host(X34)) != host(X34)
| index(status,host(X34)) != norm
| ~ epred1_1(X16) )
& ( ~ setIn(X37,alive)
| ~ setIn(X39,alive)
| host(X39) != host(X38)
| index(status,host(X37)) != elec_2
| index(status,host(X39)) != elec_2
| ~ elem(m_Ack(X37,X38),queue(host(X37)))
| ~ epred1_1(X16) )
& ( leq(host(X40),host(X41))
| ~ setIn(X40,alive)
| ~ setIn(X41,alive)
| index(status,host(X40)) != elec_2
| index(status,host(X41)) != elec_2
| leq(index(pendack,host(X41)),host(X40))
| ~ epred1_1(X16) )
& ( leq(host(X42),host(X43))
| ~ setIn(X42,alive)
| ~ setIn(X43,alive)
| index(status,host(X42)) != elec_2
| index(status,host(X43)) != elec_2
| ~ leq(index(pendack,host(X42)),index(pendack,host(X43)))
| ~ epred1_1(X16) )
& ( leq(index(pendack,host(X46)),host(X44))
| ~ setIn(X46,alive)
| ~ elem(m_Halt(X46),queue(host(X45)))
| index(status,host(X46)) != elec_2
| ~ setIn(X44,alive)
| index(ldr,host(X44)) != host(X44)
| index(status,host(X44)) != norm
| ~ epred1_1(X16) )
& ( ~ leq(host(X50),esk7_5(X16,X47,X48,X49,X50))
| ~ elem(m_Down(X49),queue(host(X50)))
| host(X50) != host(X48)
| host(X50) != nbr_proc
| index(status,host(X50)) != elec_1
| ~ setIn(X47,alive)
| ~ elem(m_Down(X48),queue(host(X47)))
| ~ epred1_1(X16) )
& ( leq(s(zero),esk7_5(X16,X47,X48,X49,X50))
| ~ elem(m_Down(X49),queue(host(X50)))
| host(X50) != host(X48)
| host(X50) != nbr_proc
| index(status,host(X50)) != elec_1
| ~ setIn(X47,alive)
| ~ elem(m_Down(X48),queue(host(X47)))
| ~ epred1_1(X16) )
& ( ~ setIn(esk7_5(X16,X47,X48,X49,X50),index(down,host(X50)))
| ~ elem(m_Down(X49),queue(host(X50)))
| host(X50) != host(X48)
| host(X50) != nbr_proc
| index(status,host(X50)) != elec_1
| ~ setIn(X47,alive)
| ~ elem(m_Down(X48),queue(host(X47)))
| ~ epred1_1(X16) )
& ( esk7_5(X16,X47,X48,X49,X50) != host(X49)
| ~ elem(m_Down(X49),queue(host(X50)))
| host(X50) != host(X48)
| host(X50) != nbr_proc
| index(status,host(X50)) != elec_1
| ~ setIn(X47,alive)
| ~ elem(m_Down(X48),queue(host(X47)))
| ~ epred1_1(X16) )
& ( ~ setIn(X55,alive)
| ~ elem(m_Down(X54),queue(host(X55)))
| ~ elem(m_Ack(X55,X53),queue(host(X55)))
| ~ leq(nbr_proc,s(index(pendack,host(X55))))
| index(status,host(X55)) != elec_2
| host(X53) != index(pendack,host(X55))
| host(X54) != s(index(pendack,host(X55)))
| ~ setIn(X52,alive)
| index(ldr,host(X52)) != host(X52)
| index(status,host(X52)) != norm
| ~ epred1_1(X16) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])])])])])])]) ).
cnf(c_0_20,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
elem(m_Ack(esk6_0,esk4_0),snoc(queue(host(esk6_0)),m_Halt(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
m_Ack(X1,X2) != m_Halt(X3),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
leq(nbr_proc,host(esk5_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_17]) ).
cnf(c_0_25,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X6] : leq(X6,X6),
inference(variable_rename,[status(thm)],[axiom_59]) ).
fof(c_0_27,plain,
! [X7,X8] : m_Down(X7) != m_Halt(X8),
inference(variable_rename,[status(thm)],[axiom_17]) ).
cnf(c_0_28,plain,
( ~ epred1_1(X1)
| index(status,host(X2)) != norm
| index(ldr,host(X2)) != host(X2)
| ~ setIn(X2,alive)
| host(X3) != s(index(pendack,host(X4)))
| host(X5) != index(pendack,host(X4))
| index(status,host(X4)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X4))))
| ~ elem(m_Ack(X4,X5),queue(host(X4)))
| ~ elem(m_Down(X3),queue(host(X4)))
| ~ setIn(X4,alive) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
elem(m_Ack(esk6_0,esk4_0),queue(host(esk6_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
host(esk5_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
index(status,host(esk6_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
elem(m_Down(esk5_0),snoc(queue(host(esk6_0)),m_Halt(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,plain,
m_Down(X1) != m_Halt(X2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| host(X2) != nbr_proc
| ~ epred1_1(X3)
| ~ setIn(esk6_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(esk6_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_11]),c_0_17]),c_0_30]),c_0_11]),c_0_31]),c_0_11]),c_0_17]),c_0_30]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Down(esk5_0),queue(host(esk6_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_1(X2)
| ~ setIn(esk6_0,alive)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30])]) ).
cnf(c_0_38,negated_conjecture,
( esk3_0 = esk1_0
| setIn(esk3_0,alive) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
index(ldr,host(esk3_0)) = host(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,negated_conjecture,
index(status,host(esk3_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
( esk1_0 = esk3_0
| ~ epred1_1(X1)
| ~ setIn(esk6_0,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
epred1_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_43,negated_conjecture,
( esk1_0 = esk3_0
| ~ setIn(esk6_0,alive) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( esk6_0 = esk1_0
| setIn(esk6_0,alive) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
host(esk1_0) != host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_46,negated_conjecture,
host(esk2_0) = host(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_47,negated_conjecture,
( esk1_0 = esk6_0
| esk1_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
host(esk6_0) != host(esk2_0),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
host(esk1_0) != host(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_50,negated_conjecture,
esk1_0 = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
host(esk3_0) != host(esk2_0),
inference(rw,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWV461+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 13:33:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.022 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 53
% 0.23/1.42 # Proof object clause steps : 35
% 0.23/1.42 # Proof object formula steps : 18
% 0.23/1.42 # Proof object conjectures : 30
% 0.23/1.42 # Proof object clause conjectures : 27
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 21
% 0.23/1.42 # Proof object initial formulas used : 7
% 0.23/1.42 # Proof object generating inferences : 9
% 0.23/1.42 # Proof object simplifying inferences : 27
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 67
% 0.23/1.42 # Removed by relevancy pruning/SinE : 13
% 0.23/1.42 # Initial clauses : 109
% 0.23/1.42 # Removed in clause preprocessing : 6
% 0.23/1.42 # Initial clauses in saturation : 103
% 0.23/1.42 # Processed clauses : 2678
% 0.23/1.42 # ...of these trivial : 29
% 0.23/1.42 # ...subsumed : 1759
% 0.23/1.42 # ...remaining for further processing : 890
% 0.23/1.42 # Other redundant clauses eliminated : 4
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 107
% 0.23/1.42 # Backward-rewritten : 453
% 0.23/1.42 # Generated clauses : 26369
% 0.23/1.42 # ...of the previous two non-trivial : 23330
% 0.23/1.42 # Contextual simplify-reflections : 1139
% 0.23/1.42 # Paramodulations : 26309
% 0.23/1.42 # Factorizations : 38
% 0.23/1.42 # Equation resolutions : 22
% 0.23/1.42 # Current number of processed clauses : 326
% 0.23/1.42 # Positive orientable unit clauses : 47
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 79
% 0.23/1.42 # Non-unit-clauses : 200
% 0.23/1.42 # Current number of unprocessed clauses: 5132
% 0.23/1.42 # ...number of literals in the above : 17381
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 560
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 227349
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 140370
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2722
% 0.23/1.42 # Unit Clause-clause subsumption calls : 8209
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 64
% 0.23/1.42 # BW rewrite match successes : 13
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 316875
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.683 s
% 0.23/1.42 # System time : 0.011 s
% 0.23/1.42 # Total time : 0.694 s
% 0.23/1.42 # Maximum resident set size: 15604 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------