TSTP Solution File: SWV448+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:16:50 EDT 2022
% Result : Theorem 1.24s 134.40s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 66 ( 27 unt; 0 def)
% Number of atoms : 443 ( 192 equ)
% Maximal formula atoms : 76 ( 6 avg)
% Number of connectives : 575 ( 198 ~; 183 |; 144 &)
% ( 3 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 19 con; 0-6 aty)
% Number of variables : 208 ( 19 sgn 110 !; 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] :
( ( 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,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X14) )
=> X14 = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X15) = index(pendack,host(X14)) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X15),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X15) = index(pendack,host(X14)) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& ~ leq(host(X14),host(X7))
& elem(m_Down(X15),queue(host(X14)))
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ( leq(nbr_proc,host(X5))
=> ! [X7] :
( ~ setIn(host(X7),setEmpty)
=> ! [X16] :
( host(X5) = host(X16)
=> ! [X17] :
( host(X5) != host(X17)
=> ( ( setIn(X16,alive)
& setIn(X17,alive)
& host(X5) = host(X16)
& index(ldr,host(X17)) = host(X17)
& index(status,host(X17)) = norm )
=> X17 = X16 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj) ).
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(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(c_0_4,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
<=> ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),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,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X14) )
=> X14 = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X15) = index(pendack,host(X14)) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X15),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X15) = index(pendack,host(X14)) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& ~ leq(host(X14),host(X7))
& elem(m_Down(X15),queue(host(X14)))
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X5,X6,X12)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ( leq(nbr_proc,host(X5))
=> ! [X7] :
( ~ setIn(host(X7),setEmpty)
=> ! [X16] :
( host(X5) = host(X16)
=> ! [X17] :
( host(X5) != host(X17)
=> ( ( setIn(X16,alive)
& setIn(X17,alive)
& host(X5) = host(X16)
& index(ldr,host(X17)) = host(X17)
& index(status,host(X17)) = norm )
=> X17 = X16 ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X22] :
( epred1_3(esk6_0,esk7_0,esk5_0)
& setIn(esk6_0,alive)
& ~ leq(host(esk6_0),host(esk7_0))
& ( index(ldr,host(esk6_0)) != host(esk7_0)
| index(status,host(esk6_0)) != norm )
& ( index(status,host(esk6_0)) != wait
| host(esk7_0) != host(index(elid,host(esk6_0))) )
& ( leq(host(esk6_0),X22)
| ~ leq(s(zero),X22)
| setIn(X22,index(down,host(esk6_0)))
| X22 = host(esk7_0) )
& index(status,host(esk6_0)) = elec_1
& leq(nbr_proc,host(esk6_0))
& ~ setIn(host(esk8_0),setEmpty)
& host(esk6_0) = host(esk9_0)
& host(esk6_0) != host(esk10_0)
& setIn(esk9_0,alive)
& setIn(esk10_0,alive)
& host(esk6_0) = host(esk9_0)
& index(ldr,host(esk10_0)) = host(esk10_0)
& index(status,host(esk10_0)) = norm
& esk10_0 != esk9_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,X6,X5] :
( epred1_3(X5,X6,X12)
=> ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),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,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X14) )
=> X14 = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X15) = index(pendack,host(X14)) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X15),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X15) = index(pendack,host(X14)) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& ~ leq(host(X14),host(X7))
& elem(m_Down(X15),queue(host(X14)))
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_8,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_9,negated_conjecture,
leq(nbr_proc,host(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
host(esk6_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_12,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X28,X29,X27,X31,X32,X30,X33,X34,X35] :
( ( ~ elem(m_Ldr(X21),queue(host(X20)))
| ~ leq(host(X20),host(X21))
| ~ epred1_3(X19,X18,X17) )
& ( X23 = X22
| host(X23) != host(X22)
| ~ setIn(X22,alive)
| ~ setIn(X23,alive)
| ~ epred1_3(X19,X18,X17) )
& ( index(status,host(X24)) != elec_1
| ~ setIn(X24,alive)
| index(elid,host(X24)) = X24
| ~ epred1_3(X19,X18,X17) )
& ( index(status,host(X24)) != elec_2
| ~ setIn(X24,alive)
| index(elid,host(X24)) = X24
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X25,alive)
| ~ setIn(X26,alive)
| index(ldr,host(X25)) != host(X25)
| index(status,host(X25)) != norm
| index(status,host(X26)) != norm
| index(ldr,host(X26)) != host(X26)
| X26 = X25
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X29,alive)
| ~ elem(m_Down(X28),queue(host(X29)))
| ~ leq(nbr_proc,index(pendack,host(X29)))
| index(status,host(X29)) != elec_2
| host(X28) != index(pendack,host(X29))
| ~ setIn(X27,alive)
| index(ldr,host(X27)) != host(X27)
| index(status,host(X27)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X32,alive)
| ~ elem(m_Ack(X32,X31),queue(host(X32)))
| ~ leq(nbr_proc,index(pendack,host(X32)))
| index(status,host(X32)) != elec_2
| host(X31) != index(pendack,host(X32))
| ~ setIn(X30,alive)
| index(ldr,host(X30)) != host(X30)
| index(status,host(X30)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( ~ leq(host(X35),esk11_6(X17,X18,X19,X33,X34,X35))
| leq(host(X35),host(X33))
| ~ elem(m_Down(X34),queue(host(X35)))
| index(status,host(X35)) != elec_1
| ~ setIn(X33,alive)
| index(ldr,host(X33)) != host(X33)
| index(status,host(X33)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( leq(s(zero),esk11_6(X17,X18,X19,X33,X34,X35))
| leq(host(X35),host(X33))
| ~ elem(m_Down(X34),queue(host(X35)))
| index(status,host(X35)) != elec_1
| ~ setIn(X33,alive)
| index(ldr,host(X33)) != host(X33)
| index(status,host(X33)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(esk11_6(X17,X18,X19,X33,X34,X35),index(down,host(X35)))
| leq(host(X35),host(X33))
| ~ elem(m_Down(X34),queue(host(X35)))
| index(status,host(X35)) != elec_1
| ~ setIn(X33,alive)
| index(ldr,host(X33)) != host(X33)
| index(status,host(X33)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( esk11_6(X17,X18,X19,X33,X34,X35) != host(X34)
| leq(host(X35),host(X33))
| ~ elem(m_Down(X34),queue(host(X35)))
| index(status,host(X35)) != elec_1
| ~ setIn(X33,alive)
| index(ldr,host(X33)) != host(X33)
| index(status,host(X33)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( queue(host(X19)) = cons(m_Down(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_13,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
leq(nbr_proc,host(esk9_0)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X4 = X5
| ~ epred1_3(X1,X2,X3)
| ~ setIn(X4,alive)
| ~ setIn(X5,alive)
| host(X4) != host(X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( esk9_0 = X1
| host(X1) != nbr_proc
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_20,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( esk6_0 = esk9_0
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
epred1_3(esk6_0,esk7_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
index(status,host(esk6_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_25,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_26,negated_conjecture,
esk6_0 = esk9_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( leq(host(X5),host(X4))
| leq(s(zero),esk11_6(X3,X2,X1,X4,X6,X5))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| index(status,host(X5)) != elec_1
| ~ elem(m_Down(X6),queue(host(X5))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
index(ldr,host(esk10_0)) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
index(status,host(esk10_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
index(status,host(esk9_0)) = elec_1,
inference(rw,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_32,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
epred1_3(esk9_0,esk7_0,esk5_0),
inference(rw,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( leq(s(zero),esk11_6(X1,X2,X3,esk10_0,X4,X5))
| leq(host(X5),host(esk10_0))
| index(status,host(X5)) != elec_1
| ~ epred1_3(X3,X2,X1)
| ~ elem(m_Down(X4),queue(host(X5))) ),
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])]) ).
cnf(c_0_36,negated_conjecture,
index(status,nbr_proc) = elec_1,
inference(rw,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_37,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
cons(m_Down(esk7_0),esk5_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_17]) ).
cnf(c_0_39,plain,
( leq(host(X5),host(X4))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| index(status,host(X5)) != elec_1
| ~ elem(m_Down(X6),queue(host(X5)))
| ~ setIn(esk11_6(X3,X2,X1,X4,X6,X5),index(down,host(X5))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,negated_conjecture,
( X1 = host(esk7_0)
| setIn(X1,index(down,host(esk6_0)))
| leq(host(esk6_0),X1)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_41,negated_conjecture,
( leq(s(zero),esk11_6(X1,X2,X3,esk10_0,X4,esk9_0))
| leq(nbr_proc,host(esk10_0))
| ~ epred1_3(X3,X2,X1)
| ~ elem(m_Down(X4),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_17]),c_0_36])]) ).
cnf(c_0_42,plain,
elem(m_Down(esk7_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( leq(host(X5),host(X4))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| index(status,host(X5)) != elec_1
| ~ elem(m_Down(X6),queue(host(X5)))
| ~ leq(host(X5),esk11_6(X3,X2,X1,X4,X6,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,negated_conjecture,
( leq(host(X1),host(esk10_0))
| index(status,host(X1)) != elec_1
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk11_6(X4,X3,X2,esk10_0,X5,X1),index(down,host(X1)))
| ~ elem(m_Down(X5),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_45,negated_conjecture,
( X1 = host(esk7_0)
| leq(host(esk9_0),X1)
| setIn(X1,index(down,host(esk9_0)))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_10]),c_0_10]) ).
cnf(c_0_46,plain,
( leq(s(zero),esk11_6(X1,X2,X3,esk10_0,esk7_0,esk9_0))
| leq(nbr_proc,host(esk10_0))
| ~ epred1_3(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( leq(host(X5),host(X4))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| index(status,host(X5)) != elec_1
| ~ elem(m_Down(X6),queue(host(X5)))
| esk11_6(X3,X2,X1,X4,X6,X5) != host(X6) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( leq(host(X1),host(esk10_0))
| index(status,host(X1)) != elec_1
| ~ epred1_3(X2,X3,X4)
| ~ leq(host(X1),esk11_6(X4,X3,X2,esk10_0,X5,X1))
| ~ elem(m_Down(X5),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_49,negated_conjecture,
( leq(nbr_proc,host(esk10_0))
| ~ epred1_3(X1,X2,X3)
| ~ setIn(esk11_6(X3,X2,X1,esk10_0,X4,esk9_0),index(down,nbr_proc))
| ~ elem(m_Down(X4),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_17]),c_0_36])]) ).
cnf(c_0_50,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_45,c_0_17]),c_0_17]) ).
cnf(c_0_51,negated_conjecture,
( leq(s(zero),esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0))
| leq(nbr_proc,host(esk10_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_52,negated_conjecture,
( leq(host(X1),host(esk10_0))
| esk11_6(X2,X3,X4,esk10_0,X5,X1) != host(X5)
| index(status,host(X1)) != elec_1
| ~ epred1_3(X4,X3,X2)
| ~ elem(m_Down(X5),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_53,negated_conjecture,
( leq(nbr_proc,host(esk10_0))
| ~ epred1_3(X1,X2,X3)
| ~ leq(nbr_proc,esk11_6(X3,X2,X1,esk10_0,X4,esk9_0))
| ~ elem(m_Down(X4),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_17]),c_0_36])]) ).
cnf(c_0_54,plain,
( leq(nbr_proc,host(esk10_0))
| ~ epred1_3(X1,X2,X3)
| ~ setIn(esk11_6(X3,X2,X1,esk10_0,esk7_0,esk9_0),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_49,c_0_42]) ).
cnf(c_0_55,negated_conjecture,
( esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0) = host(esk7_0)
| leq(nbr_proc,esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0))
| leq(nbr_proc,host(esk10_0))
| setIn(esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( leq(nbr_proc,host(esk10_0))
| esk11_6(X1,X2,X3,esk10_0,X4,esk9_0) != host(X4)
| ~ epred1_3(X3,X2,X1)
| ~ elem(m_Down(X4),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_17]),c_0_36])]) ).
cnf(c_0_57,plain,
( leq(nbr_proc,host(esk10_0))
| ~ epred1_3(X1,X2,X3)
| ~ leq(nbr_proc,esk11_6(X3,X2,X1,esk10_0,esk7_0,esk9_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_42]) ).
cnf(c_0_58,plain,
( esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0) = host(esk7_0)
| leq(nbr_proc,esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0))
| leq(nbr_proc,host(esk10_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_34])]) ).
cnf(c_0_59,negated_conjecture,
host(esk6_0) != host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_60,plain,
( leq(nbr_proc,host(esk10_0))
| esk11_6(X1,X2,X3,esk10_0,esk7_0,esk9_0) != host(esk7_0)
| ~ epred1_3(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_42]) ).
cnf(c_0_61,plain,
( esk11_6(esk5_0,esk7_0,esk9_0,esk10_0,esk7_0,esk9_0) = host(esk7_0)
| leq(nbr_proc,host(esk10_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_34])]) ).
cnf(c_0_62,negated_conjecture,
host(esk10_0) != host(esk9_0),
inference(rw,[status(thm)],[c_0_59,c_0_10]) ).
cnf(c_0_63,plain,
leq(nbr_proc,host(esk10_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_34])]) ).
cnf(c_0_64,negated_conjecture,
host(esk10_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_62,c_0_17]) ).
cnf(c_0_65,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_63]),c_0_15])]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 01:51:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/23.41 eprover: CPU time limit exceeded, terminating
% 0.41/23.42 eprover: CPU time limit exceeded, terminating
% 0.41/23.44 eprover: CPU time limit exceeded, terminating
% 0.41/23.45 eprover: CPU time limit exceeded, terminating
% 0.59/46.45 eprover: CPU time limit exceeded, terminating
% 0.59/46.46 eprover: CPU time limit exceeded, terminating
% 0.59/46.46 eprover: CPU time limit exceeded, terminating
% 0.59/46.46 eprover: CPU time limit exceeded, terminating
% 0.76/69.47 eprover: CPU time limit exceeded, terminating
% 0.76/69.48 eprover: CPU time limit exceeded, terminating
% 0.76/69.49 eprover: CPU time limit exceeded, terminating
% 0.76/69.50 eprover: CPU time limit exceeded, terminating
% 0.93/92.49 eprover: CPU time limit exceeded, terminating
% 0.93/92.51 eprover: CPU time limit exceeded, terminating
% 0.93/92.52 eprover: CPU time limit exceeded, terminating
% 0.93/92.52 eprover: CPU time limit exceeded, terminating
% 1.10/115.51 eprover: CPU time limit exceeded, terminating
% 1.10/115.53 eprover: CPU time limit exceeded, terminating
% 1.10/115.54 eprover: CPU time limit exceeded, terminating
% 1.10/115.57 eprover: CPU time limit exceeded, terminating
% 1.24/134.40 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.24/134.40
% 1.24/134.40 # Failure: Resource limit exceeded (time)
% 1.24/134.40 # OLD status Res
% 1.24/134.40 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.24/134.40 # Preprocessing time : 0.018 s
% 1.24/134.40 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.24/134.40
% 1.24/134.40 # Failure: Resource limit exceeded (time)
% 1.24/134.40 # OLD status Res
% 1.24/134.40 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.24/134.40 # Preprocessing time : 0.019 s
% 1.24/134.40 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 1.24/134.40
% 1.24/134.40 # Failure: Resource limit exceeded (time)
% 1.24/134.40 # OLD status Res
% 1.24/134.40 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 1.24/134.40 # Preprocessing time : 0.019 s
% 1.24/134.40 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 1.24/134.40
% 1.24/134.40 # Failure: Resource limit exceeded (time)
% 1.24/134.40 # OLD status Res
% 1.24/134.40 # Preprocessing time : 0.013 s
% 1.24/134.40 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 1.24/134.40
% 1.24/134.40 # Failure: Resource limit exceeded (time)
% 1.24/134.40 # OLD status Res
% 1.24/134.40 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 1.24/134.40 # Preprocessing time : 0.024 s
% 1.24/134.40 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 1.24/134.40 # Preprocessing time : 0.013 s
% 1.24/134.40
% 1.24/134.40 # Proof found!
% 1.24/134.40 # SZS status Theorem
% 1.24/134.40 # SZS output start CNFRefutation
% See solution above
% 1.24/134.40 # Proof object total steps : 66
% 1.24/134.40 # Proof object clause steps : 54
% 1.24/134.40 # Proof object formula steps : 12
% 1.24/134.40 # Proof object conjectures : 36
% 1.24/134.40 # Proof object clause conjectures : 33
% 1.24/134.40 # Proof object formula conjectures : 3
% 1.24/134.40 # Proof object initial clauses used : 20
% 1.24/134.40 # Proof object initial formulas used : 4
% 1.24/134.40 # Proof object generating inferences : 24
% 1.24/134.40 # Proof object simplifying inferences : 48
% 1.24/134.40 # Training examples: 0 positive, 0 negative
% 1.24/134.40 # Parsed axioms : 67
% 1.24/134.40 # Removed by relevancy pruning/SinE : 0
% 1.24/134.40 # Initial clauses : 125
% 1.24/134.40 # Removed in clause preprocessing : 6
% 1.24/134.40 # Initial clauses in saturation : 119
% 1.24/134.40 # Processed clauses : 15986
% 1.24/134.40 # ...of these trivial : 1076
% 1.24/134.40 # ...subsumed : 9965
% 1.24/134.40 # ...remaining for further processing : 4945
% 1.24/134.40 # Other redundant clauses eliminated : 156
% 1.24/134.40 # Clauses deleted for lack of memory : 1128947
% 1.24/134.40 # Backward-subsumed : 1094
% 1.24/134.40 # Backward-rewritten : 148
% 1.24/134.40 # Generated clauses : 2146889
% 1.24/134.40 # ...of the previous two non-trivial : 1373201
% 1.24/134.40 # Contextual simplify-reflections : 0
% 1.24/134.40 # Paramodulations : 2145713
% 1.24/134.40 # Factorizations : 778
% 1.24/134.40 # Equation resolutions : 398
% 1.24/134.40 # Current number of processed clauses : 3699
% 1.24/134.40 # Positive orientable unit clauses : 260
% 1.24/134.40 # Positive unorientable unit clauses: 0
% 1.24/134.40 # Negative unit clauses : 40
% 1.24/134.40 # Non-unit-clauses : 3399
% 1.24/134.40 # Current number of unprocessed clauses: 171651
% 1.24/134.40 # ...number of literals in the above : 785963
% 1.24/134.40 # Current number of archived formulas : 0
% 1.24/134.40 # Current number of archived clauses : 1242
% 1.24/134.40 # Clause-clause subsumption calls (NU) : 3077144
% 1.24/134.40 # Rec. Clause-clause subsumption calls : 321690
% 1.24/134.40 # Non-unit clause-clause subsumptions : 10872
% 1.24/134.40 # Unit Clause-clause subsumption calls : 140969
% 1.24/134.40 # Rewrite failures with RHS unbound : 0
% 1.24/134.40 # BW rewrite match attempts : 14343
% 1.24/134.40 # BW rewrite match successes : 53
% 1.24/134.40 # Condensation attempts : 0
% 1.24/134.40 # Condensation successes : 0
% 1.24/134.40 # Termbank termtop insertions : 41432423
% 1.24/134.40
% 1.24/134.40 # -------------------------------------------------
% 1.24/134.40 # User time : 17.798 s
% 1.24/134.40 # System time : 0.150 s
% 1.24/134.40 # Total time : 17.948 s
% 1.24/134.40 # Maximum resident set size: 145084 pages
% 1.24/138.53 eprover: CPU time limit exceeded, terminating
% 1.24/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.55 eprover: No such file or directory
% 1.24/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.55 eprover: No such file or directory
% 1.24/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.56 eprover: No such file or directory
% 1.24/138.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.57 eprover: No such file or directory
% 1.24/138.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.57 eprover: No such file or directory
% 1.24/138.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.58 eprover: No such file or directory
% 1.24/138.58 eprover: CPU time limit exceeded, terminating
% 1.24/138.59 eprover: CPU time limit exceeded, terminating
% 1.24/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.24/138.60 eprover: No such file or directory
% 1.24/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.24/138.61 eprover: No such file or directory
% 1.24/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.61 eprover: No such file or directory
% 1.24/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.24/138.61 eprover: No such file or directory
% 1.24/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.61 eprover: No such file or directory
% 1.24/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.24/138.61 eprover: No such file or directory
% 1.24/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.62 eprover: No such file or directory
% 1.24/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.24/138.62 eprover: No such file or directory
% 1.24/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.62 eprover: No such file or directory
% 1.24/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.24/138.62 eprover: No such file or directory
% 1.24/138.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.63 eprover: No such file or directory
% 1.24/138.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/138.63 eprover: No such file or directory
%------------------------------------------------------------------------------