TSTP Solution File: SWV472+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV472+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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.39s 27.58s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 25 unt; 0 def)
% Number of atoms : 487 ( 213 equ)
% Maximal formula atoms : 86 ( 7 avg)
% Number of connectives : 693 ( 270 ~; 205 |; 158 &)
% ( 6 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 54 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-4 aty)
% Number of functors : 32 ( 32 usr; 20 con; 0-8 aty)
% Number of variables : 297 ( 21 sgn 171 !; 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] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& setIn(host(X16),index(down,host(X15))) ) )
& ! [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))) ) )
& 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] :
( s(index(pendack,host(X5))) = host(X7)
=> ( host(X5) = host(X7)
=> ! [X18,X19,X20] :
( s(index(pendack,host(X5))) != host(X20)
=> ( host(X5) != host(X20)
=> ( ( ! [X17] :
( ( ~ leq(host(X20),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X20)))
| X17 = host(X19) ) )
& elem(m_Down(X19),queue(host(X20)))
& host(X20) = host(X18)
& host(X20) = nbr_proc
& index(status,host(X20)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X18),snoc(X12,m_Halt(X5))) ) ) ) ) ) ) ) ) ) ),
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_17,axiom,
! [X5,X6] : m_Down(X5) != m_Halt(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
fof(c_0_4,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] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& setIn(host(X16),index(down,host(X15))) ) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_5,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] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& setIn(host(X16),index(down,host(X15))) ) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_6,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] :
( s(index(pendack,host(X5))) = host(X7)
=> ( host(X5) = host(X7)
=> ! [X18,X19,X20] :
( s(index(pendack,host(X5))) != host(X20)
=> ( host(X5) != host(X20)
=> ( ( ! [X17] :
( ( ~ leq(host(X20),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X20)))
| X17 = host(X19) ) )
& elem(m_Down(X19),queue(host(X20)))
& host(X20) = host(X18)
& host(X20) = nbr_proc
& index(status,host(X20)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X18),snoc(X12,m_Halt(X5))) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_4]) ).
fof(c_0_7,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] :
( ( ~ 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) )
& ( host(X27) != nbr_proc
| ~ elem(m_NotNorm(X26),queue(host(X27)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( X29 = X28
| host(X29) != host(X28)
| ~ setIn(X28,alive)
| ~ setIn(X29,alive)
| ~ epred1_4(X21,X20,X19,X18) )
& ( index(status,host(X30)) != elec_1
| ~ setIn(X30,alive)
| index(elid,host(X30)) = X30
| ~ epred1_4(X21,X20,X19,X18) )
& ( index(status,host(X30)) != elec_2
| ~ setIn(X30,alive)
| index(elid,host(X30)) = X30
| ~ epred1_4(X21,X20,X19,X18) )
& ( host(X33) = host(X32)
| ~ setIn(X33,alive)
| host(X33) != host(X31)
| index(status,host(X33)) != norm
| index(ldr,host(X33)) != host(X32)
| ~ elem(m_Down(X31),queue(host(X32)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( host(X36) = host(X35)
| ~ setIn(X36,alive)
| host(X36) != host(X34)
| index(status,host(X36)) != wait
| host(index(elid,host(X36))) != host(X35)
| ~ elem(m_Down(X34),queue(host(X35)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( host(X39) = host(X37)
| ~ setIn(X37,alive)
| ~ setIn(X39,alive)
| host(X38) != host(X37)
| host(X40) != host(X39)
| ~ elem(m_Down(X40),queue(host(X37)))
| ~ elem(m_Down(X38),queue(host(X39)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( host(X43) = host(X41)
| ~ setIn(X41,alive)
| ~ setIn(X43,alive)
| host(X42) != host(X41)
| host(X44) != host(X43)
| ~ elem(m_Down(X44),queue(host(X41)))
| ~ setIn(host(X42),index(down,host(X43)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ leq(host(X48),esk9_8(X18,X19,X20,X21,X45,X46,X47,X48))
| ~ elem(m_Down(X47),queue(host(X48)))
| host(X48) != nbr_proc
| host(X48) != host(X46)
| index(status,host(X48)) != elec_1
| ~ setIn(X45,alive)
| ~ elem(m_Down(X46),queue(host(X45)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( leq(s(zero),esk9_8(X18,X19,X20,X21,X45,X46,X47,X48))
| ~ elem(m_Down(X47),queue(host(X48)))
| host(X48) != nbr_proc
| host(X48) != host(X46)
| index(status,host(X48)) != elec_1
| ~ setIn(X45,alive)
| ~ elem(m_Down(X46),queue(host(X45)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( ~ setIn(esk9_8(X18,X19,X20,X21,X45,X46,X47,X48),index(down,host(X48)))
| ~ elem(m_Down(X47),queue(host(X48)))
| host(X48) != nbr_proc
| host(X48) != host(X46)
| index(status,host(X48)) != elec_1
| ~ setIn(X45,alive)
| ~ elem(m_Down(X46),queue(host(X45)))
| ~ epred1_4(X21,X20,X19,X18) )
& ( esk9_8(X18,X19,X20,X21,X45,X46,X47,X48) != host(X47)
| ~ elem(m_Down(X47),queue(host(X48)))
| host(X48) != nbr_proc
| host(X48) != host(X46)
| index(status,host(X48)) != elec_1
| ~ setIn(X45,alive)
| ~ elem(m_Down(X46),queue(host(X45)))
| ~ 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_5])])])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X29] :
( epred1_4(esk3_0,esk4_0,esk2_0,esk1_0)
& setIn(esk3_0,alive)
& index(elid,host(esk3_0)) = esk2_0
& index(status,host(esk3_0)) = elec_2
& host(esk4_0) = index(pendack,host(esk3_0))
& ~ leq(nbr_proc,index(pendack,host(esk3_0)))
& s(index(pendack,host(esk3_0))) = host(esk5_0)
& host(esk3_0) = host(esk5_0)
& s(index(pendack,host(esk3_0))) != host(esk8_0)
& host(esk3_0) != host(esk8_0)
& ( leq(host(esk8_0),X29)
| ~ leq(s(zero),X29)
| setIn(X29,index(down,host(esk8_0)))
| X29 = host(esk7_0) )
& elem(m_Down(esk7_0),queue(host(esk8_0)))
& host(esk8_0) = host(esk6_0)
& host(esk8_0) = nbr_proc
& index(status,host(esk8_0)) = elec_1
& setIn(esk5_0,alive)
& elem(m_Down(esk6_0),snoc(esk1_0,m_Halt(esk3_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_6])])])])])])]) ).
cnf(c_0_9,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_7]) ).
cnf(c_0_10,negated_conjecture,
index(status,host(esk3_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
epred1_4(esk3_0,esk4_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
index(elid,host(esk3_0)) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( index(elid,host(X1)) = X1
| index(status,host(X1)) != index(status,host(esk3_0))
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
epred1_4(esk3_0,esk4_0,index(elid,host(esk3_0)),esk1_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
index(status,host(esk8_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
host(esk8_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( index(elid,host(X1)) = X1
| index(status,host(X1)) != index(status,host(esk3_0))
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( X1 = host(esk7_0)
| setIn(X1,index(down,host(esk8_0)))
| leq(host(esk8_0),X1)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( leq(s(zero),esk9_8(X4,X3,X2,X1,X6,X5,X8,X7))
| ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ setIn(X6,alive)
| index(status,host(X7)) != elec_1
| host(X7) != host(X5)
| host(X7) != nbr_proc
| ~ elem(m_Down(X8),queue(host(X7))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
elec_1 = index(status,nbr_proc),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ setIn(X6,alive)
| index(status,host(X7)) != elec_1
| host(X7) != host(X5)
| host(X7) != nbr_proc
| ~ elem(m_Down(X8),queue(host(X7)))
| ~ setIn(esk9_8(X4,X3,X2,X1,X6,X5,X8,X7),index(down,host(X7))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ setIn(X6,alive)
| index(status,host(X7)) != elec_1
| host(X7) != host(X5)
| host(X7) != nbr_proc
| ~ elem(m_Down(X8),queue(host(X7)))
| ~ leq(host(X7),esk9_8(X4,X3,X2,X1,X6,X5,X8,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
index(elid,host(esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( X1 = host(esk7_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_19,c_0_16]),c_0_16]) ).
cnf(c_0_26,plain,
( leq(s(zero),esk9_8(X1,X2,X3,X4,X5,X6,X7,X8))
| index(status,host(X8)) != index(status,nbr_proc)
| host(X6) != host(X8)
| host(X8) != nbr_proc
| ~ epred1_4(X4,X3,X2,X1)
| ~ setIn(X5,alive)
| ~ elem(m_Down(X7),queue(host(X8)))
| ~ elem(m_Down(X6),queue(host(X5))) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( index(status,host(X1)) != index(status,nbr_proc)
| host(X2) != host(X1)
| host(X1) != nbr_proc
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(esk9_8(X6,X5,X4,X3,X7,X2,X8,X1),index(down,host(X1)))
| ~ setIn(X7,alive)
| ~ elem(m_Down(X8),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X7))) ),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,plain,
( index(status,host(X1)) != index(status,nbr_proc)
| host(X2) != host(X1)
| host(X1) != nbr_proc
| ~ epred1_4(X3,X4,X5,X6)
| ~ leq(host(X1),esk9_8(X6,X5,X4,X3,X7,X2,X8,X1))
| ~ setIn(X7,alive)
| ~ elem(m_Down(X8),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X7))) ),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
fof(c_0_29,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_30,plain,
( queue(host(X1)) = cons(m_Ack(X3,X2),X4)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,negated_conjecture,
epred1_4(esk3_0,esk4_0,esk3_0,esk1_0),
inference(rw,[status(thm)],[c_0_14,c_0_24]) ).
fof(c_0_32,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_33,plain,
! [X7,X8] : m_Down(X7) != m_Halt(X8),
inference(variable_rename,[status(thm)],[axiom_17]) ).
cnf(c_0_34,plain,
( ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ setIn(X6,alive)
| index(status,host(X7)) != elec_1
| host(X7) != host(X5)
| host(X7) != nbr_proc
| ~ elem(m_Down(X8),queue(host(X7)))
| esk9_8(X4,X3,X2,X1,X6,X5,X8,X7) != host(X8) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
( esk9_8(X1,X2,X3,X4,X5,X6,X7,X8) = host(esk7_0)
| leq(nbr_proc,esk9_8(X1,X2,X3,X4,X5,X6,X7,X8))
| setIn(esk9_8(X1,X2,X3,X4,X5,X6,X7,X8),index(down,nbr_proc))
| index(status,host(X8)) != index(status,nbr_proc)
| host(X6) != host(X8)
| host(X8) != nbr_proc
| ~ epred1_4(X4,X3,X2,X1)
| ~ setIn(X5,alive)
| ~ elem(m_Down(X7),queue(host(X8)))
| ~ elem(m_Down(X6),queue(host(X5))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
( host(X1) != nbr_proc
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(esk9_8(X5,X4,X3,X2,X6,X1,X7,esk8_0),index(down,nbr_proc))
| ~ setIn(X6,alive)
| ~ elem(m_Down(X1),queue(host(X6)))
| ~ elem(m_Down(X7),queue(nbr_proc)) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_37,negated_conjecture,
( host(X1) != nbr_proc
| ~ epred1_4(X2,X3,X4,X5)
| ~ leq(nbr_proc,esk9_8(X5,X4,X3,X2,X6,X1,X7,esk8_0))
| ~ setIn(X6,alive)
| ~ elem(m_Down(X1),queue(host(X6)))
| ~ elem(m_Down(X7),queue(nbr_proc)) ),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
fof(c_0_38,plain,
( ~ epred30_0
<=> ! [X1,X2,X3,X4] : ~ epred1_4(X4,X3,X2,X1) ),
introduced(definition) ).
cnf(c_0_39,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
cons(m_Ack(esk3_0,esk4_0),esk1_0) = queue(host(esk3_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,negated_conjecture,
elem(m_Down(esk6_0),snoc(esk1_0,m_Halt(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_43,plain,
m_Down(X1) != m_Halt(X2),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_44,plain,
( ~ epred28_0
<=> ! [X7] :
( ~ elem(m_Down(X7),queue(nbr_proc))
| host(esk7_0) != host(X7) ) ),
introduced(definition) ).
fof(c_0_45,plain,
( ~ epred29_0
<=> ! [X5,X6] :
( ~ elem(m_Down(X6),queue(host(X5)))
| ~ setIn(X5,alive)
| host(X6) != nbr_proc ) ),
introduced(definition) ).
cnf(c_0_46,plain,
( index(status,host(X1)) != index(status,nbr_proc)
| esk9_8(X2,X3,X4,X5,X6,X7,X8,X1) != host(X8)
| host(X7) != host(X1)
| host(X1) != nbr_proc
| ~ epred1_4(X5,X4,X3,X2)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X8),queue(host(X1)))
| ~ elem(m_Down(X7),queue(host(X6))) ),
inference(rw,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_47,negated_conjecture,
( esk9_8(X1,X2,X3,X4,X5,X6,X7,esk8_0) = host(esk7_0)
| host(X6) != nbr_proc
| ~ epred1_4(X4,X3,X2,X1)
| ~ setIn(X5,alive)
| ~ elem(m_Down(X6),queue(host(X5)))
| ~ elem(m_Down(X7),queue(nbr_proc)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_16]),c_0_36]),c_0_37]) ).
cnf(c_0_48,plain,
( epred30_0
| ~ epred1_4(X1,X2,X3,X4) ),
inference(split_equiv,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
( elem(X1,queue(host(esk3_0)))
| ~ elem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,negated_conjecture,
elem(m_Down(esk6_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_51,negated_conjecture,
host(esk8_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_52,plain,
( ~ epred30_0
| ~ epred29_0
| ~ epred28_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(pm,[status(thm)],[c_0_46,c_0_47]),c_0_16]),c_0_16]),c_0_16]),c_0_16])]),c_0_44]),c_0_45]),c_0_38]) ).
cnf(c_0_53,negated_conjecture,
epred30_0,
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_54,plain,
( epred29_0
| host(X1) != nbr_proc
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),queue(host(X2))) ),
inference(split_equiv,[status(thm)],[c_0_45]) ).
cnf(c_0_55,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk3_0))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_51,c_0_16]) ).
cnf(c_0_57,plain,
( ~ epred29_0
| ~ epred28_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_58,negated_conjecture,
epred29_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_18])]) ).
cnf(c_0_59,plain,
~ epred28_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_60,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_61,plain,
( host(esk7_0) != host(X1)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_44]),c_0_59]) ).
cnf(c_0_62,negated_conjecture,
elem(m_Down(esk7_0),queue(nbr_proc)),
inference(rw,[status(thm)],[c_0_60,c_0_16]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_61,c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV472+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 14 15:57:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.37/23.39 eprover: CPU time limit exceeded, terminating
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.39/27.58 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.39/27.58
% 0.39/27.58 # Failure: Resource limit exceeded (time)
% 0.39/27.58 # OLD status Res
% 0.39/27.58 # Preprocessing time : 0.020 s
% 0.39/27.58 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.39/27.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.39/27.58 # Preprocessing time : 0.021 s
% 0.39/27.58
% 0.39/27.58 # Proof found!
% 0.39/27.58 # SZS status Theorem
% 0.39/27.58 # SZS output start CNFRefutation
% See solution above
% 0.39/27.58 # Proof object total steps : 64
% 0.39/27.58 # Proof object clause steps : 49
% 0.39/27.58 # Proof object formula steps : 15
% 0.39/27.58 # Proof object conjectures : 29
% 0.39/27.58 # Proof object clause conjectures : 26
% 0.39/27.58 # Proof object formula conjectures : 3
% 0.39/27.58 # Proof object initial clauses used : 21
% 0.39/27.58 # Proof object initial formulas used : 4
% 0.39/27.58 # Proof object generating inferences : 14
% 0.39/27.58 # Proof object simplifying inferences : 31
% 0.39/27.58 # Training examples: 0 positive, 0 negative
% 0.39/27.58 # Parsed axioms : 67
% 0.39/27.58 # Removed by relevancy pruning/SinE : 14
% 0.39/27.58 # Initial clauses : 99
% 0.39/27.58 # Removed in clause preprocessing : 6
% 0.39/27.58 # Initial clauses in saturation : 93
% 0.39/27.58 # Processed clauses : 9481
% 0.39/27.58 # ...of these trivial : 113
% 0.39/27.58 # ...subsumed : 7401
% 0.39/27.58 # ...remaining for further processing : 1967
% 0.39/27.58 # Other redundant clauses eliminated : 18
% 0.39/27.58 # Clauses deleted for lack of memory : 0
% 0.39/27.58 # Backward-subsumed : 159
% 0.39/27.58 # Backward-rewritten : 154
% 0.39/27.58 # Generated clauses : 117154
% 0.39/27.58 # ...of the previous two non-trivial : 87797
% 0.39/27.58 # Contextual simplify-reflections : 3127
% 0.39/27.58 # Paramodulations : 116863
% 0.39/27.58 # Factorizations : 73
% 0.39/27.58 # Equation resolutions : 74
% 0.39/27.58 # Current number of processed clauses : 1636
% 0.39/27.58 # Positive orientable unit clauses : 126
% 0.39/27.58 # Positive unorientable unit clauses: 0
% 0.39/27.58 # Negative unit clauses : 216
% 0.39/27.58 # Non-unit-clauses : 1294
% 0.39/27.58 # Current number of unprocessed clauses: 62859
% 0.39/27.58 # ...number of literals in the above : 322223
% 0.39/27.58 # Current number of archived formulas : 0
% 0.39/27.58 # Current number of archived clauses : 324
% 0.39/27.58 # Clause-clause subsumption calls (NU) : 994574
% 0.39/27.58 # Rec. Clause-clause subsumption calls : 592288
% 0.39/27.58 # Non-unit clause-clause subsumptions : 6431
% 0.39/27.58 # Unit Clause-clause subsumption calls : 60175
% 0.39/27.58 # Rewrite failures with RHS unbound : 0
% 0.39/27.58 # BW rewrite match attempts : 467
% 0.39/27.58 # BW rewrite match successes : 85
% 0.39/27.58 # Condensation attempts : 0
% 0.39/27.58 # Condensation successes : 0
% 0.39/27.58 # Termbank termtop insertions : 1818125
% 0.39/27.58
% 0.39/27.58 # -------------------------------------------------
% 0.39/27.58 # User time : 3.590 s
% 0.39/27.58 # System time : 0.031 s
% 0.39/27.58 # Total time : 3.621 s
% 0.39/27.58 # Maximum resident set size: 53096 pages
% 0.39/46.41 eprover: CPU time limit exceeded, terminating
% 0.39/46.42 eprover: CPU time limit exceeded, terminating
% 0.39/46.42 eprover: CPU time limit exceeded, terminating
% 0.39/46.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.43 eprover: No such file or directory
% 0.39/46.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.43 eprover: No such file or directory
% 0.39/46.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.43 eprover: No such file or directory
% 0.39/46.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.43 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
%------------------------------------------------------------------------------