TSTP Solution File: SWV457+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV457+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 : 300s
% DateTime : Thu Aug 31 21:41:21 EDT 2023
% Result : Theorem 0.83s 0.90s
% Output : CNFRefutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 58
% Syntax : Number of formulae : 114 ( 32 unt; 49 typ; 0 def)
% Number of atoms : 432 ( 166 equ)
% Maximal formula atoms : 79 ( 6 avg)
% Number of connectives : 561 ( 194 ~; 130 |; 173 &)
% ( 4 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 63 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 27 >; 11 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 43 ( 43 usr; 22 con; 0-2 aty)
% Number of variables : 256 ( 35 sgn; 193 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
m_Ack: ( $i * $i ) > $i ).
tff(decl_23,type,
host: $i > $i ).
tff(decl_24,type,
queue: $i > $i ).
tff(decl_25,type,
elem: ( $i * $i ) > $o ).
tff(decl_26,type,
pids: $i ).
tff(decl_27,type,
setIn: ( $i * $i ) > $o ).
tff(decl_28,type,
s: $i > $i ).
tff(decl_29,type,
zero: $i ).
tff(decl_30,type,
leq: ( $i * $i ) > $o ).
tff(decl_31,type,
nbr_proc: $i ).
tff(decl_32,type,
elec_1: $i ).
tff(decl_33,type,
elec_2: $i ).
tff(decl_34,type,
wait: $i ).
tff(decl_35,type,
norm: $i ).
tff(decl_36,type,
m_Halt: $i > $i ).
tff(decl_37,type,
m_Down: $i > $i ).
tff(decl_38,type,
m_NotNorm: $i > $i ).
tff(decl_39,type,
m_Ldr: $i > $i ).
tff(decl_40,type,
m_NormQ: $i > $i ).
tff(decl_41,type,
nil: $i ).
tff(decl_42,type,
alive: $i ).
tff(decl_43,type,
cons: ( $i * $i ) > $i ).
tff(decl_44,type,
head: $i > $i ).
tff(decl_45,type,
tail: $i > $i ).
tff(decl_46,type,
snoc: ( $i * $i ) > $i ).
tff(decl_47,type,
last: $i > $i ).
tff(decl_48,type,
init: $i > $i ).
tff(decl_49,type,
q_nil: $i ).
tff(decl_50,type,
pidElem: $i > $o ).
tff(decl_51,type,
pidMsg: $i > $i ).
tff(decl_52,type,
ordered: $i > $o ).
tff(decl_53,type,
setEmpty: $i ).
tff(decl_54,type,
pendack: $i ).
tff(decl_55,type,
index: ( $i * $i ) > $i ).
tff(decl_56,type,
status: $i ).
tff(decl_57,type,
elid: $i ).
tff(decl_58,type,
down: $i ).
tff(decl_59,type,
ldr: $i ).
tff(decl_60,type,
epred1_3: ( $i * $i * $i ) > $o ).
tff(decl_61,type,
esk1_1: $i > $i ).
tff(decl_62,type,
esk2_1: $i > $i ).
tff(decl_63,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_65,type,
esk5_0: $i ).
tff(decl_66,type,
esk6_0: $i ).
tff(decl_67,type,
esk7_0: $i ).
tff(decl_68,type,
esk8_0: $i ).
tff(decl_69,type,
esk9_0: $i ).
tff(decl_70,type,
esk10_0: $i ).
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/benchmark/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_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
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_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(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_8,plain,
! [X13,X5,X12] :
( epred1_3(X12,X5,X13)
<=> ( ! [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_9,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X12,X5,X13)
=> ( 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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_8]) ).
fof(c_0_10,negated_conjecture,
( epred1_3(esk5_0,esk7_0,esk6_0)
& setIn(esk6_0,alive)
& host(esk6_0) != host(esk8_0)
& host(esk7_0) = host(esk10_0)
& host(esk6_0) != host(esk10_0)
& setIn(esk10_0,alive)
& leq(nbr_proc,index(pendack,host(esk10_0)))
& elem(m_Ack(esk10_0,esk9_0),snoc(queue(host(esk10_0)),m_Ack(esk7_0,esk6_0)))
& index(status,host(esk10_0)) = elec_2
& host(esk9_0) = index(pendack,host(esk10_0))
& setIn(esk8_0,alive)
& index(ldr,host(esk8_0)) = host(esk8_0)
& index(status,host(esk8_0)) = norm ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_11,plain,
! [X135,X136] :
( ( ~ leq(X135,X136)
| ~ leq(X136,X135)
| X135 = X136 )
& ( leq(X135,X136)
| X135 != X136 )
& ( leq(X136,X135)
| X135 != X136 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])]) ).
cnf(c_0_12,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk10_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
host(esk9_0) = index(pendack,host(esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X21] : leq(host(X21),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_15,plain,
! [X13,X5,X12] :
( epred1_3(X12,X5,X13)
=> ( ! [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_8]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
leq(nbr_proc,host(esk9_0)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X151,X152,X153,X154,X155,X156,X157,X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179,X180,X181,X182,X183,X184,X185,X186,X187] :
( ( ~ elem(m_Ack(X155,X154),queue(host(X155)))
| setIn(X155,pids)
| ~ epred1_3(X153,X152,X151) )
& ( ~ elem(m_Down(X157),queue(host(X156)))
| ~ setIn(X157,alive)
| ~ epred1_3(X153,X152,X151) )
& ( ~ elem(m_Ldr(X159),queue(host(X158)))
| ~ leq(host(X158),host(X159))
| ~ epred1_3(X153,X152,X151) )
& ( ~ elem(m_Ack(X162,X160),queue(host(X161)))
| ~ leq(host(X160),host(X162))
| ~ epred1_3(X153,X152,X151) )
& ( setIn(X163,alive)
| ~ leq(X164,X163)
| host(X164) != host(X163)
| ~ setIn(X164,alive)
| ~ epred1_3(X153,X152,X151) )
& ( X166 = X165
| host(X166) != host(X165)
| ~ setIn(X165,alive)
| ~ setIn(X166,alive)
| ~ epred1_3(X153,X152,X151) )
& ( ~ setIn(X168,alive)
| ~ elem(m_Ack(X168,X167),queue(host(X168)))
| leq(host(X167),index(pendack,host(X168)))
| ~ epred1_3(X153,X152,X151) )
& ( ~ setIn(X170,alive)
| index(status,host(X170)) != elec_1
| ~ elem(m_Ack(X169,X170),queue(host(X169)))
| ~ epred1_3(X153,X152,X151) )
& ( ~ setIn(X172,alive)
| index(status,host(X172)) != elec_1
| ~ elem(m_Ack(X172,X171),queue(host(X172)))
| ~ epred1_3(X153,X152,X151) )
& ( index(status,host(X173)) != elec_1
| ~ setIn(X173,alive)
| index(elid,host(X173)) = X173
| ~ epred1_3(X153,X152,X151) )
& ( index(status,host(X173)) != elec_2
| ~ setIn(X173,alive)
| index(elid,host(X173)) = X173
| ~ epred1_3(X153,X152,X151) )
& ( ~ elem(m_Down(X174),queue(host(X175)))
| ~ elem(m_Ack(X176,X175),queue(host(X176)))
| host(X176) != host(X174)
| ~ setIn(X176,alive)
| ~ epred1_3(X153,X152,X151) )
& ( ~ setIn(X178,alive)
| ~ setIn(X179,alive)
| ~ elem(m_Ack(X179,X177),queue(host(X179)))
| host(X178) != host(X177)
| ~ setIn(host(X179),index(down,host(X178)))
| ~ epred1_3(X153,X152,X151) )
& ( leq(host(X180),host(X181))
| ~ setIn(X180,alive)
| ~ setIn(X181,alive)
| index(status,host(X180)) != elec_2
| index(status,host(X181)) != elec_2
| ~ leq(index(pendack,host(X180)),index(pendack,host(X181)))
| ~ epred1_3(X153,X152,X151) )
& ( leq(index(pendack,host(X184)),host(X182))
| ~ setIn(X184,alive)
| ~ elem(m_Halt(X184),queue(host(X183)))
| index(status,host(X184)) != elec_2
| ~ setIn(X182,alive)
| index(ldr,host(X182)) != host(X182)
| index(status,host(X182)) != norm
| ~ epred1_3(X153,X152,X151) )
& ( ~ setIn(X187,alive)
| ~ elem(m_Ack(X187,X186),queue(host(X187)))
| ~ leq(nbr_proc,index(pendack,host(X187)))
| index(status,host(X187)) != elec_2
| host(X186) != index(pendack,host(X187))
| ~ setIn(X185,alive)
| index(ldr,host(X185)) != host(X185)
| index(status,host(X185)) != norm
| ~ epred1_3(X153,X152,X151) )
& ( queue(host(X151)) = cons(m_Halt(X152),X153)
| ~ epred1_3(X153,X152,X151) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_20,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_21,plain,
! [X132] : leq(X132,X132),
inference(variable_rename,[status(thm)],[axiom_59]) ).
fof(c_0_22,plain,
! [X99,X100,X101] :
( ( ~ elem(X99,snoc(X101,X100))
| X99 = X100
| elem(X99,X101) )
& ( X99 != X100
| elem(X99,snoc(X101,X100)) )
& ( ~ elem(X99,X101)
| elem(X99,snoc(X101,X100)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])]) ).
cnf(c_0_23,plain,
( ~ setIn(X1,alive)
| ~ elem(m_Ack(X1,X2),queue(host(X1)))
| ~ leq(nbr_proc,index(pendack,host(X1)))
| index(status,host(X1)) != elec_2
| host(X2) != index(pendack,host(X1))
| ~ setIn(X3,alive)
| index(ldr,host(X3)) != host(X3)
| index(status,host(X3)) != norm
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
index(pendack,host(esk10_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
elem(m_Ack(esk10_0,esk9_0),snoc(queue(host(esk10_0)),m_Ack(esk7_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,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(esk10_0,X2),queue(host(esk10_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( m_Ack(esk10_0,esk9_0) = m_Ack(esk7_0,esk6_0)
| elem(m_Ack(esk10_0,esk9_0),queue(host(esk10_0))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( m_Ack(esk10_0,esk9_0) = m_Ack(esk7_0,esk6_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_30,c_0_31]),c_0_20])]) ).
cnf(c_0_33,negated_conjecture,
index(status,host(esk8_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
index(ldr,host(esk8_0)) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_36,plain,
! [X67,X68,X69,X70] :
( X67 = X68
| m_Ack(X67,X69) != m_Ack(X68,X70) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_31])]) ).
cnf(c_0_37,negated_conjecture,
( m_Ack(esk10_0,esk9_0) = m_Ack(esk7_0,esk6_0)
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,plain,
( X1 = X2
| m_Ack(X1,X3) != m_Ack(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
m_Ack(esk10_0,esk9_0) = m_Ack(esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( esk10_0 = X1
| m_Ack(esk7_0,esk6_0) != m_Ack(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_42,plain,
! [X71,X72,X73,X74] :
( X73 = X74
| m_Ack(X71,X73) != m_Ack(X72,X74) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_32])]) ).
cnf(c_0_43,negated_conjecture,
esk7_0 = esk10_0,
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_44,plain,
( X1 = X2
| m_Ack(X3,X1) != m_Ack(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
m_Ack(esk10_0,esk9_0) = m_Ack(esk10_0,esk6_0),
inference(rw,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( esk9_0 = X1
| m_Ack(esk10_0,esk6_0) != m_Ack(X2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_47,plain,
! [X96,X97,X98] :
( ( ~ elem(X96,cons(X97,X98))
| X96 = X97
| elem(X96,X98) )
& ( X96 != X97
| elem(X96,cons(X97,X98)) )
& ( ~ elem(X96,X98)
| elem(X96,cons(X97,X98)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_48,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_49,negated_conjecture,
esk9_0 = esk6_0,
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
queue(host(esk6_0)) = cons(m_Halt(esk7_0),esk5_0),
inference(spm,[status(thm)],[c_0_48,c_0_38]) ).
cnf(c_0_52,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_20,c_0_49]) ).
cnf(c_0_53,plain,
( leq(index(pendack,host(X1)),host(X2))
| ~ setIn(X1,alive)
| ~ elem(m_Halt(X1),queue(host(X3)))
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| index(ldr,host(X2)) != host(X2)
| index(status,host(X2)) != norm
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_54,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_55,negated_conjecture,
cons(m_Halt(esk10_0),esk5_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( leq(nbr_proc,host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive)
| ~ elem(m_Halt(esk10_0),queue(host(X5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_24]),c_0_25]),c_0_27])]) ).
cnf(c_0_57,negated_conjecture,
elem(m_Halt(esk10_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( leq(nbr_proc,host(X1))
| 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_56,c_0_52]),c_0_57])]) ).
cnf(c_0_59,negated_conjecture,
( leq(nbr_proc,host(esk8_0))
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_60,negated_conjecture,
epred1_3(esk5_0,esk10_0,esk6_0),
inference(rw,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_61,negated_conjecture,
host(esk6_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_62,negated_conjecture,
leq(nbr_proc,host(esk8_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
host(esk8_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_61,c_0_52]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_62]),c_0_18])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV457+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31 % Computer : n031.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 29 07:03:55 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.18/0.54 start to proof: theBenchmark
% 0.83/0.90 % Version : CSE_E---1.5
% 0.83/0.90 % Problem : theBenchmark.p
% 0.83/0.90 % Proof found
% 0.83/0.90 % SZS status Theorem for theBenchmark.p
% 0.83/0.90 % SZS output start Proof
% See solution above
% 0.83/0.90 % Total time : 0.344000 s
% 0.83/0.90 % SZS output end Proof
% 0.83/0.90 % Total time : 0.348000 s
%------------------------------------------------------------------------------