TSTP Solution File: SWV466+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV466+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:54 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 76 ( 45 unt; 0 def)
% Number of atoms : 539 ( 215 equ)
% Maximal formula atoms : 114 ( 7 avg)
% Number of connectives : 695 ( 232 ~; 165 |; 224 &)
% ( 5 <=>; 69 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 20 con; 0-7 aty)
% Number of variables : 274 ( 38 sgn 220 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14))) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_1 )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& host(X15) = host(X7) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X7))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X15)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X16),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X16) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( setIn(X20,alive)
& leq(nbr_proc,s(index(pendack,host(X20))))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& index(status,host(X20)) = elec_2
& host(X18) = index(pendack,host(X20))
& host(X19) = s(index(pendack,host(X20))) )
=> ~ ( setIn(X17,alive)
& host(X5) = host(X17) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
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_14,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Ldr(X7),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_14) ).
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_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( X5 = s(X6)
| leq(X5,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
fof(c_0_8,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] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14))) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_1 )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& host(X15) = host(X7) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X7))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X15)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X16),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X16) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_9,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X5,X6,X12)
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( setIn(X20,alive)
& leq(nbr_proc,s(index(pendack,host(X20))))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& index(status,host(X20)) = elec_2
& host(X18) = index(pendack,host(X20))
& host(X19) = s(index(pendack,host(X20))) )
=> ~ ( setIn(X17,alive)
& host(X5) = host(X17) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_8]) ).
fof(c_0_10,negated_conjecture,
( epred1_3(esk6_0,esk7_0,esk5_0)
& setIn(esk6_0,alive)
& leq(host(esk6_0),host(esk7_0))
& index(status,host(esk6_0)) = elec_2
& host(esk7_0) = index(pendack,host(esk6_0))
& leq(nbr_proc,index(pendack,host(esk6_0)))
& setIn(host(esk8_0),index(acks,host(esk6_0)))
& host(esk6_0) = host(esk9_0)
& host(esk8_0) = host(esk12_0)
& host(esk6_0) != host(esk12_0)
& setIn(esk12_0,alive)
& leq(nbr_proc,s(index(pendack,host(esk12_0))))
& elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0)))
& elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0)))
& index(status,host(esk12_0)) = elec_2
& host(esk10_0) = index(pendack,host(esk12_0))
& host(esk11_0) = s(index(pendack,host(esk12_0)))
& setIn(esk9_0,alive)
& host(esk6_0) = host(esk9_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_11,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk12_0)))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
host(esk10_0) = index(pendack,host(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
host(esk11_0) = s(index(pendack,host(esk12_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,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] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14))) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_1 )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& host(X15) = host(X7) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X7))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X15)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& ! [X7,X16,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X16),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X16) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X7,alive)
& index(ldr,host(X7)) = host(X7)
& index(status,host(X7)) = norm ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
fof(c_0_15,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_16,plain,
! [X7,X8] : m_Down(X7) != m_Ldr(X8),
inference(variable_rename,[status(thm)],[axiom_18]) ).
fof(c_0_17,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_18,negated_conjecture,
leq(nbr_proc,s(host(esk10_0))),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
s(host(esk10_0)) = host(esk11_0),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
fof(c_0_20,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_21,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
host(esk7_0) = index(pendack,host(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39,X40,X41,X42,X43,X44,X45,X46,X47,X48,X49,X50,X51,X52,X53,X56,X57,X58,X55] :
( ( ~ elem(m_Ldr(X22),queue(host(X21)))
| ~ leq(host(X21),host(X22))
| ~ epred1_3(X20,X19,X18) )
& ( ~ elem(m_Down(X24),queue(host(X23)))
| host(X24) != host(X23)
| ~ epred1_3(X20,X19,X18) )
& ( ~ elem(m_Halt(X26),queue(host(X25)))
| ~ leq(host(X25),host(X26))
| ~ epred1_3(X20,X19,X18) )
& ( ~ elem(m_Ack(X29,X27),queue(host(X28)))
| ~ leq(host(X27),host(X29))
| ~ epred1_3(X20,X19,X18) )
& ( X31 = X30
| host(X31) != host(X30)
| ~ setIn(X30,alive)
| ~ setIn(X31,alive)
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(X33,alive)
| ~ elem(m_Ack(X33,X32),queue(host(X33)))
| leq(host(X32),index(pendack,host(X33)))
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(X35,alive)
| index(status,host(X35)) != elec_1
| ~ elem(m_Ack(X35,X34),queue(host(X35)))
| ~ epred1_3(X20,X19,X18) )
& ( index(status,host(X36)) != elec_1
| ~ setIn(X36,alive)
| index(elid,host(X36)) = X36
| ~ epred1_3(X20,X19,X18) )
& ( index(status,host(X36)) != elec_2
| ~ setIn(X36,alive)
| index(elid,host(X36)) = X36
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(X39,alive)
| ~ elem(m_Down(X38),queue(host(X39)))
| host(X38) != host(X37)
| ~ setIn(X37,alive)
| index(ldr,host(X37)) != host(X37)
| index(status,host(X37)) != norm
| ~ epred1_3(X20,X19,X18) )
& ( leq(host(X40),host(X41))
| ~ setIn(X40,alive)
| ~ setIn(X41,alive)
| index(status,host(X40)) != elec_2
| index(status,host(X41)) != elec_2
| leq(index(pendack,host(X41)),host(X40))
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(X42,alive)
| ~ setIn(X44,alive)
| host(X44) != host(X43)
| index(status,host(X42)) != elec_2
| index(status,host(X44)) != elec_2
| ~ elem(m_Ack(X42,X43),queue(host(X42)))
| ~ epred1_3(X20,X19,X18) )
& ( leq(host(X45),host(X46))
| ~ setIn(X45,alive)
| ~ setIn(X46,alive)
| index(status,host(X45)) != elec_2
| index(status,host(X46)) != elec_2
| ~ leq(index(pendack,host(X45)),index(pendack,host(X46)))
| ~ epred1_3(X20,X19,X18) )
& ( leq(index(pendack,host(X49)),host(X47))
| ~ setIn(X49,alive)
| ~ elem(m_Halt(X49),queue(host(X48)))
| index(status,host(X49)) != elec_2
| ~ setIn(X47,alive)
| index(ldr,host(X47)) != host(X47)
| index(status,host(X47)) != norm
| ~ epred1_3(X20,X19,X18) )
& ( ~ leq(host(X53),esk13_7(X18,X19,X20,X50,X51,X52,X53))
| ~ elem(m_Down(X52),queue(host(X53)))
| host(X53) != nbr_proc
| host(X53) != host(X51)
| index(status,host(X53)) != elec_1
| ~ setIn(X50,alive)
| ~ elem(m_Down(X51),queue(host(X50)))
| ~ epred1_3(X20,X19,X18) )
& ( leq(s(zero),esk13_7(X18,X19,X20,X50,X51,X52,X53))
| ~ elem(m_Down(X52),queue(host(X53)))
| host(X53) != nbr_proc
| host(X53) != host(X51)
| index(status,host(X53)) != elec_1
| ~ setIn(X50,alive)
| ~ elem(m_Down(X51),queue(host(X50)))
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(esk13_7(X18,X19,X20,X50,X51,X52,X53),index(down,host(X53)))
| ~ elem(m_Down(X52),queue(host(X53)))
| host(X53) != nbr_proc
| host(X53) != host(X51)
| index(status,host(X53)) != elec_1
| ~ setIn(X50,alive)
| ~ elem(m_Down(X51),queue(host(X50)))
| ~ epred1_3(X20,X19,X18) )
& ( esk13_7(X18,X19,X20,X50,X51,X52,X53) != host(X52)
| ~ elem(m_Down(X52),queue(host(X53)))
| host(X53) != nbr_proc
| host(X53) != host(X51)
| index(status,host(X53)) != elec_1
| ~ setIn(X50,alive)
| ~ elem(m_Down(X51),queue(host(X50)))
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(X58,alive)
| ~ elem(m_Down(X57),queue(host(X58)))
| ~ elem(m_Ack(X58,X56),queue(host(X58)))
| ~ leq(nbr_proc,s(index(pendack,host(X58))))
| index(status,host(X58)) != elec_2
| host(X56) != index(pendack,host(X58))
| host(X57) != s(index(pendack,host(X58)))
| ~ setIn(X55,alive)
| index(ldr,host(X55)) != host(X55)
| index(status,host(X55)) != norm
| ~ epred1_3(X20,X19,X18) )
& ( queue(host(X20)) = cons(m_Down(X19),X18)
| ~ epred1_3(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_14])])])])])])])]) ).
cnf(c_0_24,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
leq(nbr_proc,host(esk11_0)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
leq(nbr_proc,host(esk7_0)),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
( ~ epred1_3(X1,X2,X3)
| host(X4) != host(X5)
| ~ elem(m_Down(X4),queue(host(X5))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
elem(m_Down(esk11_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
host(esk11_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_34,plain,
( leq(index(pendack,host(X4)),host(X5))
| leq(host(X5),host(X4))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != elec_2
| index(status,host(X5)) != elec_2
| ~ setIn(X4,alive)
| ~ setIn(X5,alive) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
epred1_3(esk6_0,esk7_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,negated_conjecture,
host(esk7_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_29])]) ).
cnf(c_0_37,plain,
( host(esk12_0) != nbr_proc
| ~ epred1_3(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
fof(c_0_38,plain,
! [X8,X9,X10] : m_Ack(X8,X9) != m_Ldr(X10),
inference(variable_rename,[status(thm)],[axiom_14]) ).
cnf(c_0_39,negated_conjecture,
( leq(index(pendack,host(X1)),host(X2))
| leq(host(X2),host(X1))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
index(pendack,host(esk6_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
index(status,host(esk6_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,plain,
( host(X1) = nbr_proc
| ~ leq(nbr_proc,host(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_44,negated_conjecture,
host(esk8_0) = host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
host(esk12_0) != nbr_proc,
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_47,plain,
m_Ack(X1,X2) != m_Ldr(X3),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_48,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_49,negated_conjecture,
( leq(host(X1),host(esk6_0))
| leq(nbr_proc,host(X1))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_50,negated_conjecture,
setIn(esk12_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_51,negated_conjecture,
index(status,host(esk12_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_52,negated_conjecture,
~ leq(nbr_proc,host(esk12_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_53,plain,
( ~ epred1_3(X1,X2,X3)
| ~ elem(m_Ack(X4,X5),queue(host(X4)))
| index(status,host(X6)) != elec_2
| index(status,host(X4)) != elec_2
| host(X6) != host(X5)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_54,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_46]),c_0_47]) ).
cnf(c_0_55,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_57,negated_conjecture,
leq(host(esk12_0),host(esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),c_0_52]) ).
cnf(c_0_58,negated_conjecture,
host(esk6_0) != host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_59,plain,
( index(status,host(X1)) != elec_2
| host(esk10_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_51]),c_0_50])]) ).
cnf(c_0_60,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_61,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_56,c_0_35]) ).
cnf(c_0_62,negated_conjecture,
( leq(host(X1),host(esk12_0))
| leq(host(esk10_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_12]),c_0_51]),c_0_50])]) ).
cnf(c_0_63,negated_conjecture,
~ leq(host(esk6_0),host(esk12_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_57]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( index(status,host(X1)) != elec_2
| host(esk10_0) != host(X1)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
fof(c_0_65,plain,
! [X7,X8,X7,X8] :
( ( ~ leq(X7,s(X8))
| X7 = s(X8)
| leq(X7,X8) )
& ( X7 != s(X8)
| leq(X7,s(X8)) )
& ( ~ leq(X7,X8)
| leq(X7,s(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_64])])])])]) ).
cnf(c_0_66,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
leq(host(esk10_0),host(esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_42]),c_0_41])]),c_0_63]) ).
cnf(c_0_68,negated_conjecture,
host(esk10_0) != host(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_42]),c_0_41])]) ).
cnf(c_0_69,plain,
( leq(X1,X2)
| X1 = s(X2)
| ~ leq(X1,s(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_70,negated_conjecture,
s(host(esk10_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_71,plain,
( host(esk6_0) != nbr_proc
| ~ epred1_3(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_66]),c_0_36]) ).
cnf(c_0_72,negated_conjecture,
~ leq(host(esk6_0),host(esk10_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_67]),c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( X1 = nbr_proc
| leq(X1,host(esk10_0))
| ~ leq(X1,nbr_proc) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
host(esk6_0) != nbr_proc,
inference(spm,[status(thm)],[c_0_71,c_0_35]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_29])]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV466+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 20:03:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.022 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 76
% 0.24/1.42 # Proof object clause steps : 56
% 0.24/1.42 # Proof object formula steps : 20
% 0.24/1.42 # Proof object conjectures : 43
% 0.24/1.42 # Proof object clause conjectures : 40
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 25
% 0.24/1.42 # Proof object initial formulas used : 8
% 0.24/1.42 # Proof object generating inferences : 24
% 0.24/1.42 # Proof object simplifying inferences : 38
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 67
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 135
% 0.24/1.42 # Removed in clause preprocessing : 6
% 0.24/1.42 # Initial clauses in saturation : 129
% 0.24/1.42 # Processed clauses : 3328
% 0.24/1.42 # ...of these trivial : 120
% 0.24/1.42 # ...subsumed : 2245
% 0.24/1.42 # ...remaining for further processing : 963
% 0.24/1.42 # Other redundant clauses eliminated : 9
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 25
% 0.24/1.42 # Backward-rewritten : 45
% 0.24/1.42 # Generated clauses : 26224
% 0.24/1.42 # ...of the previous two non-trivial : 17245
% 0.24/1.42 # Contextual simplify-reflections : 380
% 0.24/1.42 # Paramodulations : 26155
% 0.24/1.42 # Factorizations : 12
% 0.24/1.42 # Equation resolutions : 57
% 0.24/1.42 # Current number of processed clauses : 889
% 0.24/1.42 # Positive orientable unit clauses : 115
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 177
% 0.24/1.42 # Non-unit-clauses : 597
% 0.24/1.42 # Current number of unprocessed clauses: 10160
% 0.24/1.42 # ...number of literals in the above : 34763
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 70
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 211185
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 128326
% 0.24/1.42 # Non-unit clause-clause subsumptions : 885
% 0.24/1.42 # Unit Clause-clause subsumption calls : 24523
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 652
% 0.24/1.42 # BW rewrite match successes : 33
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 392141
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.337 s
% 0.24/1.42 # System time : 0.006 s
% 0.24/1.42 # Total time : 0.343 s
% 0.24/1.42 # Maximum resident set size: 12548 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------