TSTP Solution File: SWV457+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV457+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:52 EDT 2022
% Result : Theorem 0.27s 1.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 30 unt; 0 def)
% Number of atoms : 435 ( 171 equ)
% Maximal formula atoms : 79 ( 6 avg)
% Number of connectives : 569 ( 198 ~; 134 |; 173 &)
% ( 4 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 63 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 17 con; 0-2 aty)
% Number of variables : 255 ( 36 sgn 199 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( ~ setIn(X6,alive)
& leq(X7,X6)
& host(X7) = host(X6) )
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( elem(m_Down(X6),queue(host(X7)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& host(X14) = host(X6) )
=> ~ setIn(X14,alive) )
& ! [X6,X7,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Ack(X14,X6),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14)) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X15] :
( host(X5) = host(X15)
=> ( host(X13) != host(X15)
=> ( ( setIn(X15,alive)
& leq(nbr_proc,index(pendack,host(X15)))
& elem(m_Ack(X15,X7),snoc(queue(host(X15)),m_Ack(X5,X13)))
& index(status,host(X15)) = elec_2
& host(X7) = index(pendack,host(X15)) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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_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_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_31,axiom,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_31) ).
fof(axiom_32,axiom,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_32) ).
fof(c_0_7,plain,
! [X12,X5,X13] :
( epred1_3(X13,X5,X12)
<=> ( ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( ~ setIn(X6,alive)
& leq(X7,X6)
& host(X7) = host(X6) )
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( elem(m_Down(X6),queue(host(X7)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& host(X14) = host(X6) )
=> ~ setIn(X14,alive) )
& ! [X6,X7,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Ack(X14,X6),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14)) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
introduced(definition) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X13,X5,X12)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X15] :
( host(X5) = host(X15)
=> ( host(X13) != host(X15)
=> ( ( setIn(X15,alive)
& leq(nbr_proc,index(pendack,host(X15)))
& elem(m_Ack(X15,X7),snoc(queue(host(X15)),m_Ack(X5,X13)))
& index(status,host(X15)) = elec_2
& host(X7) = index(pendack,host(X15)) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_7]) ).
fof(c_0_9,negated_conjecture,
( epred1_3(esk2_0,esk3_0,esk1_0)
& setIn(esk2_0,alive)
& host(esk2_0) != host(esk4_0)
& host(esk3_0) = host(esk6_0)
& host(esk2_0) != host(esk6_0)
& setIn(esk6_0,alive)
& leq(nbr_proc,index(pendack,host(esk6_0)))
& elem(m_Ack(esk6_0,esk5_0),snoc(queue(host(esk6_0)),m_Ack(esk3_0,esk2_0)))
& index(status,host(esk6_0)) = elec_2
& host(esk5_0) = index(pendack,host(esk6_0))
& setIn(esk4_0,alive)
& index(ldr,host(esk4_0)) = host(esk4_0)
& index(status,host(esk4_0)) = norm ),
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_8])])])])]) ).
cnf(c_0_10,negated_conjecture,
host(esk5_0) = index(pendack,host(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
host(esk3_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X12,X5,X13] :
( epred1_3(X13,X5,X12)
=> ( ! [X6,X7] :
( elem(m_Ack(X7,X6),queue(host(X7)))
=> setIn(X7,pids) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( ~ setIn(X6,alive)
& leq(X7,X6)
& host(X7) = host(X6) )
=> ~ setIn(X7,alive) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7,X14] :
( ( elem(m_Down(X6),queue(host(X7)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& host(X14) = host(X6) )
=> ~ setIn(X14,alive) )
& ! [X6,X7,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Ack(X14,X6),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ setIn(host(X14),index(down,host(X7))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& leq(nbr_proc,index(pendack,host(X14)))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14)) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
fof(c_0_13,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_14,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
index(pendack,host(esk3_0)) = host(esk5_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_16,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_17,plain,
! [X15,X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39,X40,X41,X42,X43,X44,X45,X46,X47,X48,X50,X51,X49] :
( ( ~ elem(m_Ack(X19,X18),queue(host(X19)))
| setIn(X19,pids)
| ~ epred1_3(X17,X16,X15) )
& ( ~ elem(m_Down(X21),queue(host(X20)))
| ~ setIn(X21,alive)
| ~ epred1_3(X17,X16,X15) )
& ( ~ elem(m_Ldr(X23),queue(host(X22)))
| ~ leq(host(X22),host(X23))
| ~ epred1_3(X17,X16,X15) )
& ( ~ elem(m_Ack(X26,X24),queue(host(X25)))
| ~ leq(host(X24),host(X26))
| ~ epred1_3(X17,X16,X15) )
& ( setIn(X27,alive)
| ~ leq(X28,X27)
| host(X28) != host(X27)
| ~ setIn(X28,alive)
| ~ epred1_3(X17,X16,X15) )
& ( X30 = X29
| host(X30) != host(X29)
| ~ setIn(X29,alive)
| ~ setIn(X30,alive)
| ~ epred1_3(X17,X16,X15) )
& ( ~ setIn(X32,alive)
| ~ elem(m_Ack(X32,X31),queue(host(X32)))
| leq(host(X31),index(pendack,host(X32)))
| ~ epred1_3(X17,X16,X15) )
& ( ~ setIn(X34,alive)
| index(status,host(X34)) != elec_1
| ~ elem(m_Ack(X33,X34),queue(host(X33)))
| ~ epred1_3(X17,X16,X15) )
& ( ~ setIn(X36,alive)
| index(status,host(X36)) != elec_1
| ~ elem(m_Ack(X36,X35),queue(host(X36)))
| ~ epred1_3(X17,X16,X15) )
& ( index(status,host(X37)) != elec_1
| ~ setIn(X37,alive)
| index(elid,host(X37)) = X37
| ~ epred1_3(X17,X16,X15) )
& ( index(status,host(X37)) != elec_2
| ~ setIn(X37,alive)
| index(elid,host(X37)) = X37
| ~ epred1_3(X17,X16,X15) )
& ( ~ elem(m_Down(X38),queue(host(X39)))
| ~ elem(m_Ack(X40,X39),queue(host(X40)))
| host(X40) != host(X38)
| ~ setIn(X40,alive)
| ~ epred1_3(X17,X16,X15) )
& ( ~ setIn(X42,alive)
| ~ setIn(X43,alive)
| ~ elem(m_Ack(X43,X41),queue(host(X43)))
| host(X42) != host(X41)
| ~ setIn(host(X43),index(down,host(X42)))
| ~ epred1_3(X17,X16,X15) )
& ( leq(host(X44),host(X45))
| ~ setIn(X44,alive)
| ~ setIn(X45,alive)
| index(status,host(X44)) != elec_2
| index(status,host(X45)) != elec_2
| ~ leq(index(pendack,host(X44)),index(pendack,host(X45)))
| ~ epred1_3(X17,X16,X15) )
& ( leq(index(pendack,host(X48)),host(X46))
| ~ setIn(X48,alive)
| ~ elem(m_Halt(X48),queue(host(X47)))
| index(status,host(X48)) != elec_2
| ~ setIn(X46,alive)
| index(ldr,host(X46)) != host(X46)
| index(status,host(X46)) != norm
| ~ epred1_3(X17,X16,X15) )
& ( ~ setIn(X51,alive)
| ~ elem(m_Ack(X51,X50),queue(host(X51)))
| ~ leq(nbr_proc,index(pendack,host(X51)))
| index(status,host(X51)) != elec_2
| host(X50) != index(pendack,host(X51))
| ~ setIn(X49,alive)
| index(ldr,host(X49)) != host(X49)
| index(status,host(X49)) != norm
| ~ epred1_3(X17,X16,X15) )
& ( queue(host(X17)) = cons(m_Halt(X16),X15)
| ~ epred1_3(X17,X16,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[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_12])])])])])])]) ).
cnf(c_0_18,negated_conjecture,
index(status,host(esk6_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
leq(nbr_proc,host(esk5_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_15]) ).
cnf(c_0_21,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( ~ elem(X7,snoc(X9,X8))
| X7 = X8
| elem(X7,X9) )
& ( X7 != X8
| elem(X7,snoc(X9,X8)) )
& ( ~ elem(X7,X9)
| elem(X7,snoc(X9,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])])]) ).
cnf(c_0_23,negated_conjecture,
elem(m_Ack(esk6_0,esk5_0),snoc(queue(host(esk6_0)),m_Ack(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_24,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_25,plain,
( ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| host(X5) != index(pendack,host(X6))
| index(status,host(X6)) != elec_2
| ~ leq(nbr_proc,index(pendack,host(X6)))
| ~ elem(m_Ack(X6,X5),queue(host(X6)))
| ~ setIn(X6,alive) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
index(status,host(esk3_0)) = elec_2,
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_27,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
host(esk5_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_29,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
elem(m_Ack(esk6_0,esk5_0),snoc(queue(host(esk3_0)),m_Ack(esk3_0,esk2_0))),
inference(rw,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_31,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,negated_conjecture,
epred1_3(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| host(X2) != nbr_proc
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Ack(esk6_0,X2),queue(host(esk3_0))) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_11]),c_0_15]),c_0_26]),c_0_15]),c_0_20]),c_0_27])]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( m_Ack(esk6_0,esk5_0) = m_Ack(esk3_0,esk2_0)
| elem(m_Ack(esk6_0,esk5_0),queue(host(esk3_0))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
cons(m_Halt(esk3_0),esk1_0) = queue(host(esk2_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( m_Ack(esk6_0,esk5_0) = m_Ack(esk3_0,esk2_0)
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28])]) ).
cnf(c_0_39,negated_conjecture,
index(status,host(esk4_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,negated_conjecture,
index(ldr,host(esk4_0)) = host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
setIn(esk4_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,plain,
( leq(index(pendack,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_2
| ~ elem(m_Halt(X5),queue(host(X6)))
| ~ setIn(X5,alive) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_43,negated_conjecture,
elem(m_Halt(esk3_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_44,plain,
! [X12,X13,X14,X15] :
( X12 = X13
| m_Ack(X12,X14) != m_Ack(X13,X15) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_31])])])]) ).
cnf(c_0_45,negated_conjecture,
( m_Ack(esk6_0,esk5_0) = m_Ack(esk3_0,esk2_0)
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_46,plain,
( leq(nbr_proc,host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk3_0,alive)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_15]),c_0_28]),c_0_26])]) ).
cnf(c_0_47,plain,
( X1 = X3
| m_Ack(X1,X2) != m_Ack(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
m_Ack(esk6_0,esk5_0) = m_Ack(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_45,c_0_33]) ).
cnf(c_0_49,negated_conjecture,
( leq(nbr_proc,host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ setIn(esk3_0,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_46,c_0_33]) ).
cnf(c_0_50,negated_conjecture,
( esk6_0 = X1
| m_Ack(esk3_0,esk2_0) != m_Ack(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( host(X1) = nbr_proc
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ setIn(esk3_0,alive)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_49]),c_0_21])]) ).
cnf(c_0_52,negated_conjecture,
esk6_0 = esk3_0,
inference(er,[status(thm)],[c_0_50]) ).
fof(c_0_53,plain,
! [X12,X13,X14,X15] :
( X14 = X15
| m_Ack(X12,X14) != m_Ack(X13,X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_32])]) ).
cnf(c_0_54,negated_conjecture,
( host(esk4_0) = nbr_proc
| ~ setIn(esk3_0,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_55,negated_conjecture,
setIn(esk3_0,alive),
inference(rw,[status(thm)],[c_0_27,c_0_52]) ).
cnf(c_0_56,plain,
( X2 = X4
| m_Ack(X1,X2) != m_Ack(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
m_Ack(esk3_0,esk2_0) = m_Ack(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_48,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
host(esk2_0) != host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_59,negated_conjecture,
host(esk4_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_60,negated_conjecture,
( X1 = esk2_0
| m_Ack(X2,X1) != m_Ack(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
host(esk2_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
esk2_0 = esk5_0,
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV457+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 09:51:56 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.27/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.46 # Preprocessing time : 0.022 s
% 0.27/1.46
% 0.27/1.46 # Proof found!
% 0.27/1.46 # SZS status Theorem
% 0.27/1.46 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 64
% 0.27/1.46 # Proof object clause steps : 46
% 0.27/1.46 # Proof object formula steps : 18
% 0.27/1.46 # Proof object conjectures : 38
% 0.27/1.46 # Proof object clause conjectures : 35
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 20
% 0.27/1.46 # Proof object initial formulas used : 7
% 0.27/1.46 # Proof object generating inferences : 16
% 0.27/1.46 # Proof object simplifying inferences : 37
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 67
% 0.27/1.46 # Removed by relevancy pruning/SinE : 19
% 0.27/1.46 # Initial clauses : 90
% 0.27/1.46 # Removed in clause preprocessing : 6
% 0.27/1.46 # Initial clauses in saturation : 84
% 0.27/1.46 # Processed clauses : 1074
% 0.27/1.46 # ...of these trivial : 6
% 0.27/1.46 # ...subsumed : 591
% 0.27/1.46 # ...remaining for further processing : 477
% 0.27/1.46 # Other redundant clauses eliminated : 6
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 38
% 0.27/1.46 # Backward-rewritten : 237
% 0.27/1.46 # Generated clauses : 10112
% 0.27/1.46 # ...of the previous two non-trivial : 9865
% 0.27/1.46 # Contextual simplify-reflections : 685
% 0.27/1.46 # Paramodulations : 10023
% 0.27/1.46 # Factorizations : 60
% 0.27/1.46 # Equation resolutions : 29
% 0.27/1.46 # Current number of processed clauses : 198
% 0.27/1.46 # Positive orientable unit clauses : 25
% 0.27/1.46 # Positive unorientable unit clauses: 0
% 0.27/1.46 # Negative unit clauses : 26
% 0.27/1.46 # Non-unit-clauses : 147
% 0.27/1.46 # Current number of unprocessed clauses: 2778
% 0.27/1.46 # ...number of literals in the above : 12483
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 275
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 120378
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 16819
% 0.27/1.46 # Non-unit clause-clause subsumptions : 1244
% 0.27/1.46 # Unit Clause-clause subsumption calls : 1268
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 24
% 0.27/1.46 # BW rewrite match successes : 9
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 206261
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.424 s
% 0.27/1.46 # System time : 0.009 s
% 0.27/1.46 # Total time : 0.433 s
% 0.27/1.46 # Maximum resident set size: 9168 pages
% 0.29/23.45 eprover: CPU time limit exceeded, terminating
% 0.29/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.46 eprover: No such file or directory
% 0.29/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.47 eprover: No such file or directory
% 0.29/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.48 eprover: No such file or directory
% 0.29/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.48 eprover: No such file or directory
% 0.29/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.49 eprover: No such file or directory
% 0.29/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.49 eprover: No such file or directory
% 0.29/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.50 eprover: No such file or directory
% 0.29/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.50 eprover: No such file or directory
% 0.29/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.51 eprover: No such file or directory
% 0.29/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.52 eprover: No such file or directory
% 0.29/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------