TSTP Solution File: SWV473+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV473+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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.36s 18.55s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 21 unt; 0 def)
% Number of atoms : 408 ( 188 equ)
% Maximal formula atoms : 86 ( 8 avg)
% Number of connectives : 558 ( 199 ~; 154 |; 154 &)
% ( 3 <=>; 48 =>; 0 <=; 0 <~>)
% Maximal formula depth : 54 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 30 ( 30 usr; 20 con; 0-8 aty)
% Number of variables : 234 ( 44 sgn 161 !; 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)) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,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),X12)
& host(X20) = host(X18)
& host(X20) = nbr_proc
& index(status,host(X20)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X18),queue(host(X7))) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
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) ) ),
introduced(definition) ).
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)) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,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),X12)
& host(X20) = host(X18)
& host(X20) = nbr_proc
& index(status,host(X20)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X18),queue(host(X7))) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_5]) ).
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] :
( 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_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)) )
& host(esk3_0) != host(esk5_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),esk1_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),queue(host(esk5_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])])])])])])]) ).
fof(c_0_9,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_7])])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
host(esk3_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
host(esk8_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,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]) ).
fof(c_0_13,plain,
! [X4] : leq(s(zero),host(X4)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_14,plain,
( host(X6) = host(X8)
| ~ epred1_4(X1,X2,X3,X4)
| ~ setIn(host(X5),index(down,host(X6)))
| ~ elem(m_Down(X7),queue(host(X8)))
| host(X7) != host(X6)
| host(X5) != host(X8)
| ~ setIn(X6,alive)
| ~ setIn(X8,alive) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
host(esk3_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,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_12,c_0_11]),c_0_11]) ).
cnf(c_0_18,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( host(X6) = host(X8)
| ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X8)))
| host(X7) != host(X6)
| host(X5) != host(X8)
| ~ setIn(X6,alive)
| ~ setIn(X8,alive) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
host(esk8_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
host(esk3_0) != host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,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_23,plain,
( queue(host(X1)) = cons(m_Ack(X3,X2),X4)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
epred1_4(esk3_0,esk4_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( host(X1) = nbr_proc
| host(X2) != host(X1)
| host(X3) != nbr_proc
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(host(X2),index(down,nbr_proc))
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_26,negated_conjecture,
( host(X1) = host(esk7_0)
| leq(nbr_proc,host(X1))
| setIn(host(X1),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( host(X1) = nbr_proc
| host(X1) != host(X2)
| host(X3) != nbr_proc
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Down(X2),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_16])]) ).
cnf(c_0_28,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
setIn(esk5_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
host(esk5_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_32,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
cons(m_Ack(esk2_0,esk4_0),esk1_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).
cnf(c_0_34,negated_conjecture,
( host(X1) = host(esk7_0)
| host(X2) = nbr_proc
| leq(nbr_proc,host(X1))
| host(X1) != host(X2)
| host(X3) != nbr_proc
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X3),queue(host(X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( host(esk5_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( elem(X1,queue(nbr_proc))
| ~ elem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_37,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_38,negated_conjecture,
( host(X1) = host(esk7_0)
| leq(nbr_proc,host(X1))
| host(X1) != host(esk5_0)
| ~ epred1_4(X2,X3,X4,X5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
fof(c_0_39,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_40,negated_conjecture,
( host(esk5_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
elem(m_Down(esk7_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( host(X1) = host(esk7_0)
| leq(nbr_proc,host(X1))
| host(X1) != host(esk5_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_24]) ).
cnf(c_0_44,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( host(esk5_0) != host(esk7_0)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( host(X1) = host(esk7_0)
| host(X1) = nbr_proc
| host(X1) != host(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
host(esk5_0) != host(esk7_0),
inference(spm,[status(thm)],[c_0_45,c_0_24]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_47]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV473+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 22:48:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.36/18.55 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.36/18.55 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.36/18.55 # Preprocessing time : 0.023 s
% 0.36/18.55
% 0.36/18.55 # Proof found!
% 0.36/18.55 # SZS status Theorem
% 0.36/18.55 # SZS output start CNFRefutation
% See solution above
% 0.36/18.55 # Proof object total steps : 49
% 0.36/18.55 # Proof object clause steps : 35
% 0.36/18.55 # Proof object formula steps : 14
% 0.36/18.55 # Proof object conjectures : 31
% 0.36/18.55 # Proof object clause conjectures : 28
% 0.36/18.55 # Proof object formula conjectures : 3
% 0.36/18.55 # Proof object initial clauses used : 17
% 0.36/18.55 # Proof object initial formulas used : 5
% 0.36/18.55 # Proof object generating inferences : 14
% 0.36/18.55 # Proof object simplifying inferences : 22
% 0.36/18.55 # Training examples: 0 positive, 0 negative
% 0.36/18.55 # Parsed axioms : 67
% 0.36/18.55 # Removed by relevancy pruning/SinE : 14
% 0.36/18.55 # Initial clauses : 94
% 0.36/18.55 # Removed in clause preprocessing : 6
% 0.36/18.55 # Initial clauses in saturation : 88
% 0.36/18.55 # Processed clauses : 25833
% 0.36/18.55 # ...of these trivial : 730
% 0.36/18.55 # ...subsumed : 22755
% 0.36/18.55 # ...remaining for further processing : 2348
% 0.36/18.55 # Other redundant clauses eliminated : 858
% 0.36/18.55 # Clauses deleted for lack of memory : 176117
% 0.36/18.55 # Backward-subsumed : 292
% 0.36/18.55 # Backward-rewritten : 50
% 0.36/18.55 # Generated clauses : 513091
% 0.36/18.55 # ...of the previous two non-trivial : 364335
% 0.36/18.55 # Contextual simplify-reflections : 15042
% 0.36/18.55 # Paramodulations : 511576
% 0.36/18.55 # Factorizations : 538
% 0.36/18.55 # Equation resolutions : 977
% 0.36/18.55 # Current number of processed clauses : 2002
% 0.36/18.55 # Positive orientable unit clauses : 105
% 0.36/18.55 # Positive unorientable unit clauses: 0
% 0.36/18.55 # Negative unit clauses : 102
% 0.36/18.55 # Non-unit-clauses : 1795
% 0.36/18.55 # Current number of unprocessed clauses: 97569
% 0.36/18.55 # ...number of literals in the above : 382438
% 0.36/18.55 # Current number of archived formulas : 0
% 0.36/18.55 # Current number of archived clauses : 342
% 0.36/18.55 # Clause-clause subsumption calls (NU) : 6267213
% 0.36/18.55 # Rec. Clause-clause subsumption calls : 4252526
% 0.36/18.55 # Non-unit clause-clause subsumptions : 26676
% 0.36/18.55 # Unit Clause-clause subsumption calls : 18221
% 0.36/18.55 # Rewrite failures with RHS unbound : 0
% 0.36/18.55 # BW rewrite match attempts : 947
% 0.36/18.55 # BW rewrite match successes : 39
% 0.36/18.55 # Condensation attempts : 0
% 0.36/18.55 # Condensation successes : 0
% 0.36/18.55 # Termbank termtop insertions : 7686076
% 0.36/18.55
% 0.36/18.55 # -------------------------------------------------
% 0.36/18.55 # User time : 16.968 s
% 0.36/18.55 # System time : 0.124 s
% 0.36/18.55 # Total time : 17.092 s
% 0.36/18.55 # Maximum resident set size: 127620 pages
% 0.39/23.43 eprover: CPU time limit exceeded, terminating
% 0.39/23.45 eprover: CPU time limit exceeded, terminating
% 0.39/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.45 eprover: No such file or directory
% 0.39/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.46 eprover: No such file or directory
% 0.39/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.47 eprover: No such file or directory
% 0.39/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.47 eprover: No such file or directory
% 0.39/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.47 eprover: No such file or directory
% 0.39/23.47 eprover: CPU time limit exceeded, terminating
% 0.39/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.47 eprover: No such file or directory
% 0.39/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.48 eprover: No such file or directory
% 0.39/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.48 eprover: No such file or directory
% 0.39/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.48 eprover: No such file or directory
% 0.39/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.48 eprover: No such file or directory
% 0.39/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.49 eprover: No such file or directory
% 0.39/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.49 eprover: No such file or directory
% 0.39/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.49 eprover: No such file or directory
% 0.39/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.49 eprover: No such file or directory
% 0.39/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.49 eprover: No such file or directory
% 0.39/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.49 eprover: No such file or directory
% 0.39/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.50 eprover: No such file or directory
% 0.39/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.50 eprover: No such file or directory
% 0.39/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.50 eprover: No such file or directory
% 0.39/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.50 eprover: No such file or directory
% 0.39/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.50 eprover: No such file or directory
% 0.39/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.51 eprover: No such file or directory
% 0.39/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/23.51 eprover: No such file or directory
% 0.39/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.51 eprover: No such file or directory
% 0.39/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.51 eprover: No such file or directory
% 0.39/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.52 eprover: No such file or directory
% 0.39/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.52 eprover: No such file or directory
% 0.39/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.52 eprover: No such file or directory
% 0.39/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.52 eprover: No such file or directory
% 0.39/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.52 eprover: No such file or directory
% 0.39/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.53 eprover: No such file or directory
% 0.39/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.53 eprover: No such file or directory
% 0.39/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/23.53 eprover: No such file or directory
%------------------------------------------------------------------------------