TSTP Solution File: SWV463+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV463+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : 10
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 34 unt; 0 def)
% Number of atoms : 491 ( 207 equ)
% Maximal formula atoms : 114 ( 9 avg)
% Number of connectives : 651 ( 212 ~; 144 |; 225 &)
% ( 3 <=>; 67 =>; 0 <=; 0 <~>)
% Maximal formula depth : 72 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 32 ( 32 usr; 21 con; 0-8 aty)
% Number of variables : 248 ( 27 sgn 210 !; 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_Ack(X13,X6),X12) )
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& 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)))
| host(X7) = host(X6) )
=> ! [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)
& index(ldr,host(X17)) = host(X17)
& index(status,host(X17)) = norm ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',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_14,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Ldr(X7),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_14) ).
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_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
fof(c_0_7,plain,
! [X12,X13,X6,X5] :
( epred1_4(X5,X6,X13,X12)
<=> ( ! [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_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_4(X5,X6,X13,X12)
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& 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)))
| host(X7) = host(X6) )
=> ! [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)
& index(ldr,host(X17)) = host(X17)
& index(status,host(X17)) = norm ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_7]) ).
fof(c_0_9,negated_conjecture,
( epred1_4(esk7_0,esk8_0,esk6_0,esk5_0)
& setIn(esk7_0,alive)
& index(elid,host(esk7_0)) = esk6_0
& index(status,host(esk7_0)) = elec_2
& host(esk8_0) = index(pendack,host(esk7_0))
& leq(nbr_proc,index(pendack,host(esk7_0)))
& ( setIn(host(esk9_0),index(acks,host(esk7_0)))
| host(esk9_0) = host(esk8_0) )
& host(esk7_0) != host(esk10_0)
& host(esk9_0) = host(esk13_0)
& host(esk7_0) != host(esk13_0)
& setIn(esk13_0,alive)
& leq(nbr_proc,s(index(pendack,host(esk13_0))))
& elem(m_Down(esk12_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0)))
& elem(m_Ack(esk13_0,esk11_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0)))
& index(status,host(esk13_0)) = elec_2
& host(esk11_0) = index(pendack,host(esk13_0))
& host(esk12_0) = s(index(pendack,host(esk13_0)))
& setIn(esk10_0,alive)
& index(ldr,host(esk10_0)) = host(esk10_0)
& index(status,host(esk10_0)) = norm ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_10,negated_conjecture,
host(esk12_0) = s(index(pendack,host(esk13_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
host(esk11_0) = index(pendack,host(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X12,X13,X6,X5] :
( epred1_4(X5,X6,X13,X12)
=> ( ! [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_Ack(X13,X6),X12) ) ),
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_Ldr(X10),
inference(variable_rename,[status(thm)],[axiom_14]) ).
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(esk13_0)))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
s(host(esk11_0)) = host(esk12_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,
! [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,X51,X52,X53,X54,X57,X58,X59,X56] :
( ( ~ elem(m_Ldr(X23),queue(host(X22)))
| ~ leq(host(X22),host(X23))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ elem(m_Down(X25),queue(host(X24)))
| host(X25) != host(X24)
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ elem(m_Halt(X27),queue(host(X26)))
| ~ leq(host(X26),host(X27))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ elem(m_Ack(X30,X28),queue(host(X29)))
| ~ leq(host(X28),host(X30))
| ~ epred1_4(X21,X20,X19,X18) )
& ( X32 = X31
| host(X32) != host(X31)
| ~ setIn(X31,alive)
| ~ setIn(X32,alive)
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(X34,alive)
| ~ elem(m_Ack(X34,X33),queue(host(X34)))
| leq(host(X33),index(pendack,host(X34)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(X36,alive)
| index(status,host(X36)) != elec_1
| ~ elem(m_Ack(X36,X35),queue(host(X36)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( index(status,host(X37)) != elec_1
| ~ setIn(X37,alive)
| index(elid,host(X37)) = X37
| ~ epred1_4(X21,X20,X19,X18) )
& ( index(status,host(X37)) != elec_2
| ~ setIn(X37,alive)
| index(elid,host(X37)) = X37
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(X40,alive)
| ~ elem(m_Down(X39),queue(host(X40)))
| host(X39) != host(X38)
| ~ setIn(X38,alive)
| index(ldr,host(X38)) != host(X38)
| index(status,host(X38)) != norm
| ~ epred1_4(X21,X20,X19,X18) )
& ( leq(host(X41),host(X42))
| ~ setIn(X41,alive)
| ~ setIn(X42,alive)
| index(status,host(X41)) != elec_2
| index(status,host(X42)) != elec_2
| leq(index(pendack,host(X42)),host(X41))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(X43,alive)
| ~ setIn(X45,alive)
| host(X45) != host(X44)
| index(status,host(X43)) != elec_2
| index(status,host(X45)) != elec_2
| ~ elem(m_Ack(X43,X44),queue(host(X43)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( leq(host(X46),host(X47))
| ~ setIn(X46,alive)
| ~ setIn(X47,alive)
| index(status,host(X46)) != elec_2
| index(status,host(X47)) != elec_2
| ~ leq(index(pendack,host(X46)),index(pendack,host(X47)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( leq(index(pendack,host(X50)),host(X48))
| ~ setIn(X50,alive)
| ~ elem(m_Halt(X50),queue(host(X49)))
| index(status,host(X50)) != elec_2
| ~ setIn(X48,alive)
| index(ldr,host(X48)) != host(X48)
| index(status,host(X48)) != norm
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ leq(host(X54),esk14_8(X18,X19,X20,X21,X51,X52,X53,X54))
| ~ elem(m_Down(X53),queue(host(X54)))
| host(X54) != nbr_proc
| host(X54) != host(X52)
| index(status,host(X54)) != elec_1
| ~ setIn(X51,alive)
| ~ elem(m_Down(X52),queue(host(X51)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( leq(s(zero),esk14_8(X18,X19,X20,X21,X51,X52,X53,X54))
| ~ elem(m_Down(X53),queue(host(X54)))
| host(X54) != nbr_proc
| host(X54) != host(X52)
| index(status,host(X54)) != elec_1
| ~ setIn(X51,alive)
| ~ elem(m_Down(X52),queue(host(X51)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(esk14_8(X18,X19,X20,X21,X51,X52,X53,X54),index(down,host(X54)))
| ~ elem(m_Down(X53),queue(host(X54)))
| host(X54) != nbr_proc
| host(X54) != host(X52)
| index(status,host(X54)) != elec_1
| ~ setIn(X51,alive)
| ~ elem(m_Down(X52),queue(host(X51)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( esk14_8(X18,X19,X20,X21,X51,X52,X53,X54) != host(X53)
| ~ elem(m_Down(X53),queue(host(X54)))
| host(X54) != nbr_proc
| host(X54) != host(X52)
| index(status,host(X54)) != elec_1
| ~ setIn(X51,alive)
| ~ elem(m_Down(X52),queue(host(X51)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(X59,alive)
| ~ elem(m_Down(X58),queue(host(X59)))
| ~ elem(m_Ack(X59,X57),queue(host(X59)))
| ~ leq(nbr_proc,s(index(pendack,host(X59))))
| index(status,host(X59)) != elec_2
| host(X57) != index(pendack,host(X59))
| host(X58) != s(index(pendack,host(X59)))
| ~ setIn(X56,alive)
| index(ldr,host(X56)) != host(X56)
| index(status,host(X56)) != norm
| ~ epred1_4(X21,X20,X19,X18) )
& ( queue(host(X21)) = cons(m_Ack(X19,X20),X18)
| ~ epred1_4(X21,X20,X19,X18) ) ),
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(esk13_0,esk11_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
m_Ack(X1,X2) != m_Ldr(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(esk12_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_Ldr(X8),
inference(variable_rename,[status(thm)],[axiom_18]) ).
cnf(c_0_28,plain,
( index(elid,host(X5)) = X5
| ~ epred1_4(X1,X2,X3,X4)
| ~ setIn(X5,alive)
| index(status,host(X5)) != elec_2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
epred1_4(esk7_0,esk8_0,esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( ~ epred1_4(X1,X2,X3,X4)
| index(status,host(X5)) != norm
| index(ldr,host(X5)) != host(X5)
| ~ setIn(X5,alive)
| host(X6) != s(index(pendack,host(X7)))
| host(X8) != index(pendack,host(X7))
| index(status,host(X7)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X7))))
| ~ elem(m_Ack(X7,X8),queue(host(X7)))
| ~ elem(m_Down(X6),queue(host(X7)))
| ~ setIn(X7,alive) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,negated_conjecture,
elem(m_Ack(esk13_0,esk11_0),queue(host(esk13_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_32,negated_conjecture,
host(esk12_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_33,negated_conjecture,
index(status,host(esk13_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
setIn(esk13_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Down(esk12_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
( index(elid,host(X1)) = X1
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,negated_conjecture,
index(elid,host(esk7_0)) = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
index(status,host(esk7_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,plain,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| host(X2) != nbr_proc
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(esk13_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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_11]),c_0_17]),c_0_32]),c_0_11]),c_0_33]),c_0_11]),c_0_17]),c_0_32]),c_0_34]),c_0_35])]) ).
cnf(c_0_43,negated_conjecture,
elem(m_Down(esk12_0),queue(host(esk13_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_36]),c_0_37]) ).
cnf(c_0_44,negated_conjecture,
esk6_0 = esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_32])]) ).
cnf(c_0_46,negated_conjecture,
epred1_4(esk7_0,esk8_0,esk7_0,esk5_0),
inference(rw,[status(thm)],[c_0_29,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_49,negated_conjecture,
index(ldr,host(esk10_0)) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_50,negated_conjecture,
index(status,host(esk10_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWV463+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 16 01:37:54 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 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 : 52
% 0.23/1.42 # Proof object clause steps : 34
% 0.23/1.42 # Proof object formula steps : 18
% 0.23/1.42 # Proof object conjectures : 28
% 0.23/1.42 # Proof object clause conjectures : 25
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 22
% 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 : 0
% 0.23/1.42 # Initial clauses : 136
% 0.23/1.42 # Removed in clause preprocessing : 6
% 0.23/1.42 # Initial clauses in saturation : 130
% 0.23/1.42 # Processed clauses : 6131
% 0.23/1.42 # ...of these trivial : 95
% 0.23/1.42 # ...subsumed : 4709
% 0.23/1.42 # ...remaining for further processing : 1327
% 0.23/1.42 # Other redundant clauses eliminated : 10
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 98
% 0.23/1.42 # Backward-rewritten : 31
% 0.23/1.42 # Generated clauses : 45092
% 0.23/1.42 # ...of the previous two non-trivial : 31129
% 0.23/1.42 # Contextual simplify-reflections : 987
% 0.23/1.42 # Paramodulations : 45004
% 0.23/1.42 # Factorizations : 20
% 0.23/1.42 # Equation resolutions : 67
% 0.23/1.42 # Current number of processed clauses : 1193
% 0.23/1.42 # Positive orientable unit clauses : 112
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 148
% 0.23/1.42 # Non-unit-clauses : 933
% 0.23/1.42 # Current number of unprocessed clauses: 22922
% 0.23/1.42 # ...number of literals in the above : 94357
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 130
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 961625
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 407741
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2039
% 0.23/1.42 # Unit Clause-clause subsumption calls : 25808
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 403
% 0.23/1.42 # BW rewrite match successes : 31
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 703696
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.659 s
% 0.23/1.42 # System time : 0.008 s
% 0.23/1.42 # Total time : 0.667 s
% 0.23/1.42 # Maximum resident set size: 23896 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 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: 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.44 eprover: CPU time limit exceeded, terminating
% 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.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.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.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.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.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.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.mepo_128.in
% 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.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.mepo_128.in
% 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.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 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.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------