TSTP Solution File: SWV460+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV460+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n004.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:22 EDT 2023
% Result : Theorem 21.19s 21.29s
% Output : CNFRefutation 21.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 55
% Syntax : Number of formulae : 95 ( 22 unt; 48 typ; 0 def)
% Number of atoms : 383 ( 129 equ)
% Maximal formula atoms : 72 ( 8 avg)
% Number of connectives : 505 ( 169 ~; 116 |; 159 &)
% ( 3 <=>; 58 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 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 : 42 ( 42 usr; 21 con; 0-2 aty)
% Number of variables : 197 ( 26 sgn; 149 !; 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,
status: $i ).
tff(decl_55,type,
index: ( $i * $i ) > $i ).
tff(decl_56,type,
pendack: $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 ).
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [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)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [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)
& setIn(host(X14),index(down,host(X7)))
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( ~ leq(host(X14),host(X7))
& setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Down(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(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,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Down(X15),queue(host(X7)))
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),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))) )
& 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] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( ~ leq(host(X7),host(X16))
& setIn(X7,alive)
& setIn(X16,alive)
& index(status,host(X16)) = elec_2 )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_58,axiom,
! [X5] : ~ leq(s(X5),X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_58) ).
fof(axiom_62,axiom,
! [X5,X6,X7] :
( ( leq(X5,X6)
& leq(X6,X7) )
=> leq(X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_62) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
fof(axiom_63,axiom,
! [X5,X6] :
( leq(X5,X6)
<=> leq(s(X5),s(X6)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_63) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(c_0_6,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
<=> ( ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [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)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [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)
& setIn(host(X14),index(down,host(X7)))
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( ~ leq(host(X14),host(X7))
& setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Down(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(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,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Down(X15),queue(host(X7)))
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),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))) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( 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] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( ~ leq(host(X7),host(X16))
& setIn(X7,alive)
& setIn(X16,alive)
& index(status,host(X16)) = elec_2 )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_6]) ).
fof(c_0_8,plain,
! [X5] : ~ leq(s(X5),X5),
inference(fof_simplification,[status(thm)],[axiom_58]) ).
fof(c_0_9,plain,
! [X138,X139,X140] :
( ~ leq(X138,X139)
| ~ leq(X139,X140)
| leq(X138,X140) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_62])]) ).
fof(c_0_10,negated_conjecture,
! [X149] :
( epred1_3(esk5_0,esk7_0,esk6_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),X149)
| ~ leq(s(zero),X149)
| setIn(X149,index(down,host(esk6_0)))
| X149 = host(esk7_0) )
& index(status,host(esk6_0)) = elec_1
& ~ leq(nbr_proc,host(esk6_0))
& host(esk6_0) = host(esk8_0)
& host(esk6_0) != host(esk9_0)
& ~ leq(host(esk8_0),host(esk9_0))
& setIn(esk8_0,alive)
& setIn(esk9_0,alive)
& index(status,host(esk9_0)) = elec_2
& leq(s(host(esk6_0)),index(pendack,host(esk9_0))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_11,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
=> ( ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [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)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [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)
& setIn(host(X14),index(down,host(X7)))
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( ~ leq(host(X14),host(X7))
& setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Down(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(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,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Down(X15),queue(host(X7)))
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),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))) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X21] : leq(s(zero),host(X21)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
fof(c_0_13,plain,
! [X132] : ~ leq(s(X132),X132),
inference(variable_rename,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
leq(s(host(esk6_0)),index(pendack,host(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [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] :
( ( ~ elem(m_Halt(X156),queue(host(X155)))
| ~ leq(host(X155),host(X156))
| ~ epred1_3(X154,X153,X152) )
& ( index(status,host(X157)) != elec_2
| ~ leq(index(pendack,host(X157)),host(X157))
| ~ epred1_3(X154,X153,X152) )
& ( ~ elem(m_Ack(X160,X158),queue(host(X159)))
| ~ leq(host(X158),host(X160))
| ~ epred1_3(X154,X153,X152) )
& ( X162 = X161
| host(X162) != host(X161)
| ~ setIn(X161,alive)
| ~ setIn(X162,alive)
| ~ epred1_3(X154,X153,X152) )
& ( ~ setIn(X164,alive)
| index(status,host(X164)) != elec_2
| ~ elem(m_Ack(X163,X164),queue(host(X163)))
| ~ epred1_3(X154,X153,X152) )
& ( index(status,host(X165)) != elec_1
| ~ setIn(X165,alive)
| index(elid,host(X165)) = X165
| ~ epred1_3(X154,X153,X152) )
& ( index(status,host(X165)) != elec_2
| ~ setIn(X165,alive)
| index(elid,host(X165)) = X165
| ~ epred1_3(X154,X153,X152) )
& ( ~ setIn(X166,alive)
| ~ setIn(X167,alive)
| ~ setIn(host(X167),index(down,host(X166)))
| index(status,host(X167)) != elec_2
| leq(index(pendack,host(X167)),host(X166))
| ~ epred1_3(X154,X153,X152) )
& ( leq(host(X170),host(X168))
| ~ setIn(X168,alive)
| ~ setIn(X170,alive)
| host(X170) != host(X169)
| index(status,host(X170)) != elec_2
| ~ elem(m_Down(X169),queue(host(X168)))
| ~ epred1_3(X154,X153,X152) )
& ( leq(host(X171),host(X172))
| ~ setIn(X171,alive)
| ~ setIn(X172,alive)
| index(status,host(X171)) != elec_2
| index(status,host(X172)) != elec_2
| leq(index(pendack,host(X172)),host(X171))
| ~ epred1_3(X154,X153,X152) )
& ( ~ setIn(X173,alive)
| ~ setIn(X175,alive)
| host(X175) != host(X174)
| index(status,host(X173)) != elec_2
| index(status,host(X175)) != elec_2
| ~ elem(m_Ack(X173,X174),queue(host(X173)))
| ~ epred1_3(X154,X153,X152) )
& ( ~ setIn(X176,alive)
| ~ setIn(X178,alive)
| ~ elem(m_Down(X177),queue(host(X176)))
| host(X178) != host(X177)
| index(status,host(X178)) != elec_2
| leq(index(pendack,host(X178)),host(X176))
| ~ epred1_3(X154,X153,X152) )
& ( leq(host(X179),host(X180))
| ~ setIn(X179,alive)
| ~ setIn(X180,alive)
| index(status,host(X179)) != elec_2
| index(status,host(X180)) != elec_2
| ~ leq(index(pendack,host(X179)),index(pendack,host(X180)))
| ~ epred1_3(X154,X153,X152) )
& ( queue(host(X152)) = cons(m_Down(X153),X154)
| ~ epred1_3(X154,X153,X152) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_17,negated_conjecture,
( leq(host(esk6_0),X1)
| setIn(X1,index(down,host(esk6_0)))
| X1 = host(esk7_0)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
~ leq(s(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( leq(X1,index(pendack,host(esk9_0)))
| ~ leq(X1,s(host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,plain,
! [X141,X142] :
( ( ~ leq(X141,X142)
| leq(s(X141),s(X142)) )
& ( ~ leq(s(X141),s(X142))
| leq(X141,X142) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_63])]) ).
cnf(c_0_22,plain,
( leq(index(pendack,host(X2)),host(X1))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ setIn(host(X2),index(down,host(X1)))
| index(status,host(X2)) != elec_2
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( host(X1) = host(esk7_0)
| leq(host(esk6_0),host(X1))
| setIn(host(X1),index(down,host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
~ leq(s(index(pendack,host(esk9_0))),s(host(esk6_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( leq(s(X1),s(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ leq(host(esk8_0),host(esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
host(esk6_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_31,plain,
! [X97,X98,X99] :
( ( ~ elem(X97,cons(X98,X99))
| X97 = X98
| elem(X97,X99) )
& ( X97 != X98
| elem(X97,cons(X98,X99)) )
& ( ~ elem(X97,X99)
| elem(X97,cons(X98,X99)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_32,plain,
( host(X1) = host(esk7_0)
| leq(index(pendack,host(X1)),host(esk6_0))
| leq(host(esk6_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
index(status,host(esk9_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
~ leq(index(pendack,host(esk9_0)),host(esk6_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
~ leq(host(esk6_0),host(esk9_0)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( leq(index(pendack,host(X2)),host(X1))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X3),queue(host(X1)))
| host(X2) != host(X3)
| index(status,host(X2)) != elec_2
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_38,negated_conjecture,
queue(host(esk6_0)) = cons(m_Down(esk7_0),esk5_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( host(esk7_0) = host(esk9_0)
| ~ epred1_3(X1,X2,X3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( leq(index(pendack,host(X1)),host(esk6_0))
| index(status,host(X1)) != elec_2
| host(X1) != host(X2)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),cons(m_Down(esk7_0),esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).
cnf(c_0_42,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
host(esk7_0) = host(esk9_0),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
( leq(index(pendack,host(X1)),host(esk6_0))
| index(status,host(X1)) != elec_2
| host(X1) != host(esk9_0)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV460+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 04:04:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.54/0.58 start to proof: theBenchmark
% 21.19/21.29 % Version : CSE_E---1.5
% 21.19/21.29 % Problem : theBenchmark.p
% 21.19/21.29 % Proof found
% 21.19/21.29 % SZS status Theorem for theBenchmark.p
% 21.19/21.29 % SZS output start Proof
% See solution above
% 21.19/21.29 % Total time : 20.692000 s
% 21.19/21.29 % SZS output end Proof
% 21.19/21.29 % Total time : 20.698000 s
%------------------------------------------------------------------------------