TSTP Solution File: SWV471+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV471+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:55 EDT 2022
% Result : Theorem 0.43s 28.62s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 20 unt; 0 def)
% Number of atoms : 427 ( 182 equ)
% Maximal formula atoms : 86 ( 8 avg)
% Number of connectives : 603 ( 228 ~; 169 |; 150 &)
% ( 6 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 53 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-3 aty)
% Number of functors : 30 ( 30 usr; 18 con; 0-7 aty)
% Number of variables : 241 ( 13 sgn 167 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( host(X7) = nbr_proc
=> ~ elem(m_NotNorm(X6),queue(host(X7))) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(ldr,host(X14)) = host(X7)
& index(status,host(X14)) = norm )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X7) )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& elem(m_Down(X7),queue(host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& setIn(host(X7),index(down,host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X5) != host(X6)
=> ( host(X13) = host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( ! [X16] :
( ( ~ leq(host(X18),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X18)))
| X16 = host(X17) ) )
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& host(X18) = host(X7)
& host(X18) = nbr_proc
& index(status,host(X18)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),X12) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
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_12,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_12) ).
fof(c_0_4,plain,
! [X12,X5,X13] :
( epred1_3(X13,X5,X12)
<=> ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( host(X7) = nbr_proc
=> ~ elem(m_NotNorm(X6),queue(host(X7))) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(ldr,host(X14)) = host(X7)
& index(status,host(X14)) = norm )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X7) )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& elem(m_Down(X7),queue(host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& setIn(host(X7),index(down,host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X13,X5,X12)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X5) != host(X6)
=> ( host(X13) = host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( ! [X16] :
( ( ~ leq(host(X18),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X18)))
| X16 = host(X17) ) )
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& host(X18) = host(X7)
& host(X18) = nbr_proc
& index(status,host(X18)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),X12) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X26] :
( epred1_3(esk2_0,esk3_0,esk1_0)
& setIn(esk2_0,alive)
& host(esk3_0) != host(esk4_0)
& host(esk2_0) = host(esk4_0)
& host(esk3_0) = host(esk7_0)
& host(esk2_0) != host(esk7_0)
& ( leq(host(esk7_0),X26)
| ~ leq(s(zero),X26)
| setIn(X26,index(down,host(esk7_0)))
| X26 = host(esk6_0) )
& elem(m_Down(esk6_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0)))
& host(esk7_0) = host(esk5_0)
& host(esk7_0) = nbr_proc
& index(status,host(esk7_0)) = elec_1
& setIn(esk4_0,alive)
& elem(m_Down(esk5_0),esk1_0) ),
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_5])])])])])])]) ).
fof(c_0_7,plain,
! [X12,X5,X13] :
( epred1_3(X13,X5,X12)
=> ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( host(X7) = nbr_proc
=> ~ elem(m_NotNorm(X6),queue(host(X7))) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(ldr,host(X14)) = host(X7)
& index(status,host(X14)) = norm )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X14] :
( ( host(X14) != host(X7)
& setIn(X14,alive)
& host(X14) = host(X6)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X7) )
=> ~ elem(m_Down(X6),queue(host(X7))) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& elem(m_Down(X7),queue(host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( host(X15) != host(X6)
& setIn(X6,alive)
& setIn(X15,alive)
& host(X7) = host(X6)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X6)))
& setIn(host(X7),index(down,host(X15))) ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( X1 = host(esk6_0)
| setIn(X1,index(down,host(esk7_0)))
| leq(host(esk7_0),X1)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
host(esk7_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [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] :
( ( ~ elem(m_Ldr(X21),queue(host(X20)))
| ~ leq(host(X20),host(X21))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Down(X23),queue(host(X22)))
| host(X23) != host(X22)
| ~ epred1_3(X19,X18,X17) )
& ( host(X25) != nbr_proc
| ~ elem(m_NotNorm(X24),queue(host(X25)))
| ~ epred1_3(X19,X18,X17) )
& ( X27 = X26
| host(X27) != host(X26)
| ~ setIn(X26,alive)
| ~ setIn(X27,alive)
| ~ epred1_3(X19,X18,X17) )
& ( index(status,host(X28)) != elec_1
| ~ setIn(X28,alive)
| index(elid,host(X28)) = X28
| ~ epred1_3(X19,X18,X17) )
& ( index(status,host(X28)) != elec_2
| ~ setIn(X28,alive)
| index(elid,host(X28)) = X28
| ~ epred1_3(X19,X18,X17) )
& ( host(X31) = host(X30)
| ~ setIn(X31,alive)
| host(X31) != host(X29)
| index(ldr,host(X31)) != host(X30)
| index(status,host(X31)) != norm
| ~ elem(m_Down(X29),queue(host(X30)))
| ~ epred1_3(X19,X18,X17) )
& ( host(X34) = host(X33)
| ~ setIn(X34,alive)
| host(X34) != host(X32)
| index(status,host(X34)) != wait
| host(index(elid,host(X34))) != host(X33)
| ~ elem(m_Down(X32),queue(host(X33)))
| ~ epred1_3(X19,X18,X17) )
& ( host(X37) = host(X35)
| ~ setIn(X35,alive)
| ~ setIn(X37,alive)
| host(X36) != host(X35)
| host(X38) != host(X37)
| ~ elem(m_Down(X38),queue(host(X35)))
| ~ elem(m_Down(X36),queue(host(X37)))
| ~ epred1_3(X19,X18,X17) )
& ( host(X41) = host(X39)
| ~ setIn(X39,alive)
| ~ setIn(X41,alive)
| host(X40) != host(X39)
| host(X42) != host(X41)
| ~ elem(m_Down(X42),queue(host(X39)))
| ~ setIn(host(X40),index(down,host(X41)))
| ~ epred1_3(X19,X18,X17) )
& ( ~ leq(host(X46),esk8_7(X17,X18,X19,X43,X44,X45,X46))
| ~ elem(m_Down(X45),queue(host(X46)))
| host(X46) != host(X44)
| host(X46) != nbr_proc
| index(status,host(X46)) != elec_1
| ~ setIn(X43,alive)
| ~ elem(m_Down(X44),queue(host(X43)))
| ~ epred1_3(X19,X18,X17) )
& ( leq(s(zero),esk8_7(X17,X18,X19,X43,X44,X45,X46))
| ~ elem(m_Down(X45),queue(host(X46)))
| host(X46) != host(X44)
| host(X46) != nbr_proc
| index(status,host(X46)) != elec_1
| ~ setIn(X43,alive)
| ~ elem(m_Down(X44),queue(host(X43)))
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(esk8_7(X17,X18,X19,X43,X44,X45,X46),index(down,host(X46)))
| ~ elem(m_Down(X45),queue(host(X46)))
| host(X46) != host(X44)
| host(X46) != nbr_proc
| index(status,host(X46)) != elec_1
| ~ setIn(X43,alive)
| ~ elem(m_Down(X44),queue(host(X43)))
| ~ epred1_3(X19,X18,X17) )
& ( esk8_7(X17,X18,X19,X43,X44,X45,X46) != host(X45)
| ~ elem(m_Down(X45),queue(host(X46)))
| host(X46) != host(X44)
| host(X46) != nbr_proc
| index(status,host(X46)) != elec_1
| ~ setIn(X43,alive)
| ~ elem(m_Down(X44),queue(host(X43)))
| ~ epred1_3(X19,X18,X17) )
& ( queue(host(X19)) = cons(m_Halt(X18),X17)
| ~ epred1_3(X19,X18,X17) ) ),
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_7])])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
index(status,host(esk7_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( X1 = host(esk6_0)
| leq(nbr_proc,X1)
| setIn(X1,index(down,nbr_proc))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_13,plain,
( leq(s(zero),esk8_7(X3,X2,X1,X5,X4,X7,X6))
| ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ setIn(X5,alive)
| index(status,host(X6)) != elec_1
| host(X6) != nbr_proc
| host(X6) != host(X4)
| ~ elem(m_Down(X7),queue(host(X6))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ setIn(X5,alive)
| index(status,host(X6)) != elec_1
| host(X6) != nbr_proc
| host(X6) != host(X4)
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ setIn(esk8_7(X3,X2,X1,X5,X4,X7,X6),index(down,host(X6))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
index(status,nbr_proc) = elec_1,
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_16,plain,
( ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ setIn(X5,alive)
| index(status,host(X6)) != elec_1
| host(X6) != nbr_proc
| host(X6) != host(X4)
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ leq(host(X6),esk8_7(X3,X2,X1,X5,X4,X7,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( ~ elem(X7,cons(X8,X9))
| X7 = X8
| elem(X7,X9) )
& ( X7 != X8
| elem(X7,cons(X8,X9)) )
& ( ~ elem(X7,X9)
| elem(X7,cons(X8,X9)) ) ),
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_46])])])])]) ).
cnf(c_0_18,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
epred1_3(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( esk8_7(X1,X2,X3,X4,X5,X6,X7) = host(esk6_0)
| leq(nbr_proc,esk8_7(X1,X2,X3,X4,X5,X6,X7))
| setIn(esk8_7(X1,X2,X3,X4,X5,X6,X7),index(down,nbr_proc))
| index(status,host(X7)) != elec_1
| host(X5) != host(X7)
| host(X7) != nbr_proc
| ~ epred1_3(X3,X2,X1)
| ~ setIn(X4,alive)
| ~ elem(m_Down(X6),queue(host(X7)))
| ~ elem(m_Down(X5),queue(host(X4))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( host(X1) != nbr_proc
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk8_7(X4,X3,X2,X5,X1,X6,esk7_0),index(down,nbr_proc))
| ~ setIn(X5,alive)
| ~ elem(m_Down(X1),queue(host(X5)))
| ~ elem(m_Down(X6),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
( host(X1) != nbr_proc
| ~ epred1_3(X2,X3,X4)
| ~ leq(nbr_proc,esk8_7(X4,X3,X2,X5,X1,X6,esk7_0))
| ~ setIn(X5,alive)
| ~ elem(m_Down(X1),queue(host(X5)))
| ~ elem(m_Down(X6),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_15])]) ).
fof(c_0_23,plain,
( ~ epred50_0
<=> ! [X1,X2,X3] : ~ epred1_3(X3,X2,X1) ),
introduced(definition) ).
cnf(c_0_24,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
cons(m_Halt(esk3_0),esk1_0) = queue(host(esk2_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,plain,
( ~ epred48_0
<=> ! [X6] :
( ~ elem(m_Down(X6),queue(nbr_proc))
| host(esk6_0) != host(X6) ) ),
introduced(definition) ).
fof(c_0_27,plain,
( ~ epred49_0
<=> ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X4,alive)
| host(X5) != nbr_proc ) ),
introduced(definition) ).
cnf(c_0_28,plain,
( ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ setIn(X5,alive)
| index(status,host(X6)) != elec_1
| host(X6) != nbr_proc
| host(X6) != host(X4)
| ~ elem(m_Down(X7),queue(host(X6)))
| esk8_7(X3,X2,X1,X5,X4,X7,X6) != host(X7) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( esk8_7(X1,X2,X3,X4,X5,X6,esk7_0) = host(esk6_0)
| host(X5) != nbr_proc
| ~ epred1_3(X3,X2,X1)
| ~ setIn(X4,alive)
| ~ elem(m_Down(X5),queue(host(X4)))
| ~ elem(m_Down(X6),queue(nbr_proc)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_9]),c_0_15])]),c_0_21]),c_0_22]) ).
cnf(c_0_30,plain,
( epred50_0
| ~ epred1_3(X1,X2,X3) ),
inference(split_equiv,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( elem(X1,queue(host(esk2_0)))
| ~ elem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
elem(m_Down(esk5_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
host(esk7_0) = host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,plain,
( ~ epred50_0
| ~ epred49_0
| ~ epred48_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_29]),c_0_9]),c_0_15]),c_0_9]),c_0_9]),c_0_9])]),c_0_26]),c_0_27]),c_0_23]) ).
cnf(c_0_35,negated_conjecture,
epred50_0,
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_36,plain,
( epred49_0
| host(X1) != nbr_proc
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),queue(host(X2))) ),
inference(split_equiv,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
elem(m_Down(esk5_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
host(esk5_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_33,c_0_9]) ).
cnf(c_0_39,negated_conjecture,
setIn(esk2_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_40,plain,
( ~ epred49_0
| ~ epred48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_41,negated_conjecture,
epred49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).
fof(c_0_42,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])])])])]) ).
cnf(c_0_43,negated_conjecture,
elem(m_Down(esk6_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_44,plain,
! [X8,X9,X10] : m_Ack(X8,X9) != m_Down(X10),
inference(variable_rename,[status(thm)],[axiom_12]) ).
cnf(c_0_45,plain,
~ epred48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_46,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,negated_conjecture,
elem(m_Down(esk6_0),snoc(queue(nbr_proc),m_Ack(esk3_0,esk2_0))),
inference(rw,[status(thm)],[c_0_43,c_0_9]) ).
cnf(c_0_48,plain,
m_Ack(X1,X2) != m_Down(X3),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( host(esk6_0) != host(X1)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_26]),c_0_45]) ).
cnf(c_0_50,negated_conjecture,
elem(m_Down(esk6_0),queue(nbr_proc)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_49,c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV471+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 19:50:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.40/23.42 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.40/23.42
% 0.40/23.43 eprover: CPU time limit exceeded, terminating
% 0.40/23.43 eprover: CPU time limit exceeded, terminating
% 0.43/28.62 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.43/28.62
% 0.43/28.62 # Failure: Resource limit exceeded (time)
% 0.43/28.62 # OLD status Res
% 0.43/28.62 # Preprocessing time : 0.020 s
% 0.43/28.62 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.43/28.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.43/28.62 # Preprocessing time : 0.012 s
% 0.43/28.62
% 0.43/28.62 # Proof found!
% 0.43/28.62 # SZS status Theorem
% 0.43/28.62 # SZS output start CNFRefutation
% See solution above
% 0.43/28.62 # Proof object total steps : 52
% 0.43/28.62 # Proof object clause steps : 37
% 0.43/28.62 # Proof object formula steps : 15
% 0.43/28.62 # Proof object conjectures : 26
% 0.43/28.62 # Proof object clause conjectures : 23
% 0.43/28.62 # Proof object formula conjectures : 3
% 0.43/28.62 # Proof object initial clauses used : 18
% 0.43/28.62 # Proof object initial formulas used : 4
% 0.43/28.62 # Proof object generating inferences : 12
% 0.43/28.62 # Proof object simplifying inferences : 31
% 0.43/28.62 # Training examples: 0 positive, 0 negative
% 0.43/28.62 # Parsed axioms : 67
% 0.43/28.62 # Removed by relevancy pruning/SinE : 14
% 0.43/28.62 # Initial clauses : 95
% 0.43/28.62 # Removed in clause preprocessing : 6
% 0.43/28.62 # Initial clauses in saturation : 89
% 0.43/28.62 # Processed clauses : 8698
% 0.43/28.62 # ...of these trivial : 120
% 0.43/28.62 # ...subsumed : 6219
% 0.43/28.62 # ...remaining for further processing : 2359
% 0.43/28.62 # Other redundant clauses eliminated : 26
% 0.43/28.62 # Clauses deleted for lack of memory : 0
% 0.43/28.62 # Backward-subsumed : 220
% 0.43/28.62 # Backward-rewritten : 190
% 0.43/28.62 # Generated clauses : 136873
% 0.43/28.62 # ...of the previous two non-trivial : 102689
% 0.43/28.62 # Contextual simplify-reflections : 6223
% 0.43/28.62 # Paramodulations : 136527
% 0.43/28.62 # Factorizations : 88
% 0.43/28.62 # Equation resolutions : 86
% 0.43/28.62 # Current number of processed clauses : 1941
% 0.43/28.62 # Positive orientable unit clauses : 131
% 0.43/28.62 # Positive unorientable unit clauses: 0
% 0.43/28.62 # Negative unit clauses : 81
% 0.43/28.62 # Non-unit-clauses : 1729
% 0.43/28.62 # Current number of unprocessed clauses: 78158
% 0.43/28.62 # ...number of literals in the above : 443330
% 0.43/28.62 # Current number of archived formulas : 0
% 0.43/28.62 # Current number of archived clauses : 411
% 0.43/28.62 # Clause-clause subsumption calls (NU) : 1884279
% 0.43/28.62 # Rec. Clause-clause subsumption calls : 642131
% 0.43/28.62 # Non-unit clause-clause subsumptions : 9585
% 0.43/28.62 # Unit Clause-clause subsumption calls : 76271
% 0.43/28.62 # Rewrite failures with RHS unbound : 0
% 0.43/28.62 # BW rewrite match attempts : 348
% 0.43/28.62 # BW rewrite match successes : 96
% 0.43/28.62 # Condensation attempts : 0
% 0.43/28.62 # Condensation successes : 0
% 0.43/28.62 # Termbank termtop insertions : 2141603
% 0.43/28.62
% 0.43/28.62 # -------------------------------------------------
% 0.43/28.62 # User time : 4.467 s
% 0.43/28.62 # System time : 0.051 s
% 0.43/28.62 # Total time : 4.518 s
% 0.43/28.62 # Maximum resident set size: 66864 pages
% 0.43/46.44 eprover: CPU time limit exceeded, terminating
% 0.43/46.45 eprover: CPU time limit exceeded, terminating
% 0.43/46.45 eprover: CPU time limit exceeded, terminating
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.49 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.50 eprover: No such file or directory
% 0.43/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.51 eprover: No such file or directory
% 0.43/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.51 eprover: No such file or directory
% 0.43/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.51 eprover: No such file or directory
% 0.43/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.51 eprover: No such file or directory
% 0.43/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.43/46.52 eprover: No such file or directory
%------------------------------------------------------------------------------