%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV460+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:55:34 PM UTC 2026
% Result : Theorem 195.79s 29.50s
% Output : CNFRefutation 195.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 22 unt; 0 def)
% Number of atoms : 485 ( 164 equ)
% Maximal formula atoms : 72 ( 8 avg)
% Number of connectives : 628 ( 200 ~; 134 |; 209 &)
% ( 5 <=>; 80 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 240 ( 18 sgn 192 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& elem(m_Down(X15),queue(host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X14),host(X7)) )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(host(X14),index(down,host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(X14,alive) )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( index(status,host(X16)) = elec_2
& setIn(X16,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X16)) )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_62,axiom,
! [X5,X6,X7] :
( ( leq(X6,X7)
& leq(X5,X6) )
=> leq(X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_62) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X6,X5)
& leq(X5,X6) )
<=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( leq(X5,X6)
| X5 = s(X6) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
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_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
fof(axiom_58,axiom,
! [X5] : ~ leq(s(X5),X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_58) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(c_0_9,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
<=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& elem(m_Down(X15),queue(host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X14),host(X7)) )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(host(X14),index(down,host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(X14,alive) )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) ) ),
introduced(definition) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& elem(m_Down(X15),queue(host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X14),host(X7)) )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(host(X14),index(down,host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(X14,alive) )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( index(status,host(X16)) = elec_2
& setIn(X16,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X16)) )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_11,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& elem(m_Down(X15),queue(host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X7)) = elec_2
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X14)) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& host(X14) = host(X15)
& setIn(X14,alive)
& setIn(X7,alive)
& ~ leq(host(X14),host(X7)) )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(host(X14),index(down,host(X7)))
& setIn(X14,alive)
& setIn(X7,alive) )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7] :
( ( setIn(X7,alive)
& ( index(status,host(X7)) = elec_2
| index(status,host(X7)) = elec_1 ) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( index(status,host(X14)) = elec_2
& setIn(X14,alive) )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_9]) ).
fof(c_0_12,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X5,X6)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( index(status,host(X16)) = elec_2
& setIn(X16,alive)
& setIn(X7,alive)
& ~ leq(host(X7),host(X16)) )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10]),c_0_9]) ).
fof(c_0_13,plain,
! [X97,X98,X99] :
( ( elem(X97,cons(X98,X99))
| ~ elem(X97,X99) )
& ( elem(X97,cons(X98,X99))
| X97 != X98 )
& ( elem(X97,X99)
| X97 = X98
| ~ elem(X97,cons(X98,X99)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_14,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] :
( ( ~ epred1_3(X154,X153,X152)
| queue(host(X153)) = cons(m_Down(X152),X154) )
& ( ~ epred1_3(X154,X153,X152)
| ~ leq(index(pendack,host(X179)),index(pendack,host(X180)))
| index(status,host(X180)) != elec_2
| index(status,host(X179)) != elec_2
| ~ setIn(X180,alive)
| ~ setIn(X179,alive)
| leq(host(X179),host(X180)) )
& ( ~ epred1_3(X154,X153,X152)
| leq(index(pendack,host(X178)),host(X176))
| index(status,host(X178)) != elec_2
| host(X178) != host(X177)
| ~ elem(m_Down(X177),queue(host(X176)))
| ~ setIn(X178,alive)
| ~ setIn(X176,alive) )
& ( ~ epred1_3(X154,X153,X152)
| ~ elem(m_Ack(X173,X174),queue(host(X173)))
| index(status,host(X175)) != elec_2
| index(status,host(X173)) != elec_2
| host(X175) != host(X174)
| ~ setIn(X175,alive)
| ~ setIn(X173,alive) )
& ( ~ epred1_3(X154,X153,X152)
| leq(index(pendack,host(X172)),host(X171))
| index(status,host(X172)) != elec_2
| index(status,host(X171)) != elec_2
| ~ setIn(X172,alive)
| ~ setIn(X171,alive)
| leq(host(X171),host(X172)) )
& ( ~ epred1_3(X154,X153,X152)
| ~ elem(m_Down(X169),queue(host(X168)))
| index(status,host(X170)) != elec_2
| host(X170) != host(X169)
| ~ setIn(X170,alive)
| ~ setIn(X168,alive)
| leq(host(X170),host(X168)) )
& ( ~ epred1_3(X154,X153,X152)
| leq(index(pendack,host(X167)),host(X166))
| index(status,host(X167)) != elec_2
| ~ setIn(host(X167),index(down,host(X166)))
| ~ setIn(X167,alive)
| ~ setIn(X166,alive) )
& ( ~ epred1_3(X154,X153,X152)
| index(elid,host(X165)) = X165
| ~ setIn(X165,alive)
| index(status,host(X165)) != elec_2 )
& ( ~ epred1_3(X154,X153,X152)
| index(elid,host(X165)) = X165
| ~ setIn(X165,alive)
| index(status,host(X165)) != elec_1 )
& ( ~ epred1_3(X154,X153,X152)
| ~ elem(m_Ack(X163,X164),queue(host(X163)))
| index(status,host(X164)) != elec_2
| ~ setIn(X164,alive) )
& ( ~ epred1_3(X154,X153,X152)
| ~ setIn(X162,alive)
| ~ setIn(X161,alive)
| host(X162) != host(X161)
| X162 = X161 )
& ( ~ epred1_3(X154,X153,X152)
| ~ leq(host(X158),host(X160))
| ~ elem(m_Ack(X160,X158),queue(host(X159))) )
& ( ~ epred1_3(X154,X153,X152)
| ~ leq(index(pendack,host(X157)),host(X157))
| index(status,host(X157)) != elec_2 )
& ( ~ epred1_3(X154,X153,X152)
| ~ leq(host(X155),host(X156))
| ~ elem(m_Halt(X156),queue(host(X155))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_15,negated_conjecture,
! [X149] :
( leq(s(host(esk6_0)),index(pendack,host(esk9_0)))
& index(status,host(esk9_0)) = elec_2
& setIn(esk9_0,alive)
& setIn(esk8_0,alive)
& ~ leq(host(esk8_0),host(esk9_0))
& host(esk6_0) != host(esk9_0)
& host(esk6_0) = host(esk8_0)
& ~ leq(nbr_proc,host(esk6_0))
& index(status,host(esk6_0)) = elec_1
& ( X149 = host(esk7_0)
| setIn(X149,index(down,host(esk6_0)))
| ~ leq(s(zero),X149)
| leq(host(esk6_0),X149) )
& ( host(esk7_0) != host(index(elid,host(esk6_0)))
| index(status,host(esk6_0)) != wait )
& ( index(status,host(esk6_0)) != norm
| index(ldr,host(esk6_0)) != host(esk7_0) )
& ~ leq(host(esk6_0),host(esk7_0))
& setIn(esk6_0,alive)
& epred1_3(esk5_0,esk6_0,esk7_0) ),
inference(fof_nnf,[status(thm)],[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_12])])])])])]) ).
fof(c_0_16,plain,
! [X138,X139,X140] :
( leq(X138,X140)
| ~ leq(X139,X140)
| ~ leq(X138,X139) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_62])])]) ).
cnf(c_0_17,plain,
( X1 != X2
| elem(X1,cons(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ epred1_3(X3,X1,X2)
| queue(host(X1)) = cons(m_Down(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X136,X137] :
( ( X136 != X137
| leq(X137,X136) )
& ( X136 != X137
| leq(X136,X137) )
& ( X136 = X137
| ~ leq(X137,X136)
| ~ leq(X136,X137) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
fof(c_0_21,plain,
! [X143,X144] :
( ( leq(X143,s(X144))
| ~ leq(X143,X144) )
& ( leq(X143,s(X144))
| X143 != s(X144) )
& ( leq(X143,X144)
| X143 = s(X144)
| ~ leq(X143,s(X144)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])])]) ).
cnf(c_0_22,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
leq(s(host(esk6_0)),index(pendack,host(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,plain,
! [X141,X142] :
( ( leq(X141,X142)
| ~ leq(s(X141),s(X142)) )
& ( leq(s(X141),s(X142))
| ~ leq(X141,X142) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_63])])]) ).
fof(c_0_25,plain,
! [X21] : leq(s(zero),host(X21)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_26,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_28,plain,
! [X5] : ~ leq(s(X5),X5),
inference(fof_simplification,[status(thm)],[axiom_58]) ).
cnf(c_0_29,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( ~ leq(X1,X2)
| leq(X1,s(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( ~ leq(X1,s(host(esk6_0)))
| leq(X1,index(pendack,host(esk9_0))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( ~ leq(X1,X2)
| leq(s(X1),s(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( ~ leq(s(zero),X1)
| X1 = host(esk7_0)
| setIn(X1,index(down,host(esk6_0)))
| leq(host(esk6_0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( ~ epred1_3(X4,X5,X6)
| index(status,host(X2)) != elec_2
| host(X2) != host(X3)
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| leq(index(pendack,host(X2)),host(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_37,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_38,plain,
! [X132] : ~ leq(s(X132),X132),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
cnf(c_0_39,plain,
( ~ leq(X2,X1)
| ~ leq(s(X1),X2)
| s(X1) = X2 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,negated_conjecture,
( ~ leq(X1,host(esk6_0))
| leq(s(X1),index(pendack,host(esk9_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( ~ epred1_3(X3,X4,X5)
| index(status,host(X2)) != elec_2
| ~ setIn(host(X2),index(down,host(X1)))
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| leq(index(pendack,host(X2)),host(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,negated_conjecture,
( setIn(host(X1),index(down,host(esk6_0)))
| leq(host(esk6_0),host(X1))
| host(X1) = host(esk7_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
( ~ setIn(X1,alive)
| ~ epred1_3(X2,X3,X4)
| host(X1) != host(esk7_0)
| index(status,host(X1)) != elec_2
| leq(index(pendack,host(X1)),host(esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_44,plain,
~ leq(s(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( ~ leq(X1,host(esk6_0))
| ~ leq(index(pendack,host(esk9_0)),X1)
| s(X1) = index(pendack,host(esk9_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( ~ setIn(X1,alive)
| ~ epred1_3(X2,X3,X4)
| index(status,host(X1)) != elec_2
| leq(host(esk6_0),host(X1))
| leq(index(pendack,host(X1)),host(esk6_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37])]),c_0_43]) ).
fof(c_0_47,plain,
! [X133] : leq(X133,X133),
inference(variable_rename,[status(thm)],[axiom_59]) ).
cnf(c_0_48,negated_conjecture,
~ leq(host(esk8_0),host(esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_49,negated_conjecture,
host(esk6_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_50,negated_conjecture,
( ~ leq(X1,host(esk6_0))
| ~ leq(index(pendack,host(esk9_0)),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( ~ setIn(X1,alive)
| index(status,host(X1)) != elec_2
| leq(host(esk6_0),host(X1))
| leq(index(pendack,host(X1)),host(esk6_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_19]) ).
cnf(c_0_52,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
index(status,host(esk9_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_54,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_55,negated_conjecture,
~ leq(host(esk6_0),host(esk9_0)),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]),c_0_54])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV460+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.58 % Computer : n015.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Mon Sep 21 08:55:51 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.64 Running first-order theorem proving
% 0.16/0.64 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 195.79/29.49 % Version: 3.5.1
% 195.79/29.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 195.79/29.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.79/29.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 195.79/29.49 % Starting new_bool_3 with 300s (1) cores
% 195.79/29.49 % Starting new_bool_1 with 300s (1) cores
% 195.79/29.49 % Starting sh5l with 300s (1) cores
% 195.79/29.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1092945 completed with status 0
% 195.79/29.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 195.79/29.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 195.79/29.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.79/29.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 195.79/29.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 195.79/29.49 % No SInE strategy applied
% 195.79/29.49 % Search class: FGHSM-FFMM21-MFFFFFNN
% 195.79/29.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 195.79/29.49 % Starting SubtermCWHack with 136s (1) cores
% 195.79/29.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 195.79/29.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 195.79/29.49 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 195.79/29.50 % Starting new_bool_3 with 136s (1) cores
% 195.79/29.50 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1092955 completed with status 0
% 195.79/29.50 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 195.79/29.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 195.79/29.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.79/29.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 195.79/29.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 195.79/29.50 % No SInE strategy applied
% 195.79/29.50 % Search class: FGHSM-FFMM21-MFFFFFNN
% 195.79/29.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 195.79/29.50 % Starting SubtermCWHack with 136s (1) cores
% 195.79/29.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 195.79/29.50 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 195.79/29.50 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 195.79/29.50 % Preprocessing time : 0.007 s
% 195.79/29.50
% 195.79/29.50 % Proof found!
% 195.79/29.50 % SZS status Theorem
% 195.79/29.50 % SZS output start CNFRefutation
% See solution above
% 195.79/29.50 % Parsed axioms : 67
% 195.79/29.50 % Removed by relevancy pruning/SinE : 0
% 195.79/29.50 % Initial clauses : 125
% 195.79/29.50 % Removed in clause preprocessing : 6
% 195.79/29.50 % Initial clauses in saturation : 119
% 195.79/29.50 % Processed clauses : 15287
% 195.79/29.50 % ...of these trivial : 322
% 195.79/29.50 % ...subsumed : 11682
% 195.79/29.50 % ...remaining for further processing : 3283
% 195.79/29.50 % Other redundant clauses eliminated : 323
% 195.79/29.50 % Clauses deleted for lack of memory : 0
% 195.79/29.50 % Backward-subsumed : 396
% 195.79/29.50 % Backward-rewritten : 45
% 195.79/29.50 % Generated clauses : 972803
% 195.79/29.50 % ...of the previous two non-redundant : 672711
% 195.79/29.50 % ...aggressively subsumed : 0
% 195.79/29.50 % Contextual simplify-reflections : 66
% 195.79/29.50 % Paramodulations : 971297
% 195.79/29.50 % Factorizations : 966
% 195.79/29.50 % NegExts : 0
% 195.79/29.50 % Equation resolutions : 540
% 195.79/29.50 % Disequality decompositions : 0
% 195.79/29.50 % Total rewrite steps : 340582
% 195.79/29.50 % ...of those cached : 339559
% 195.79/29.50 % Propositional unsat checks : 0
% 195.79/29.50 % Propositional check models : 0
% 195.79/29.50 % Propositional check unsatisfiable : 0
% 195.79/29.50 % Propositional clauses : 0
% 195.79/29.50 % Propositional clauses after purity: 0
% 195.79/29.50 % Propositional unsat core size : 0
% 195.79/29.50 % Propositional preprocessing time : 0.000
% 195.79/29.50 % Propositional encoding time : 0.000
% 195.79/29.50 % Propositional solver time : 0.000
% 195.79/29.50 % Success case prop preproc time : 0.000
% 195.79/29.50 % Success case prop encoding time : 0.000
% 195.79/29.50 % Success case prop solver time : 0.000
% 195.79/29.50 % Current number of processed clauses : 2838
% 195.79/29.50 % Positive orientable unit clauses : 151
% 195.79/29.50 % Positive unorientable unit clauses: 0
% 195.79/29.50 % Negative unit clauses : 211
% 195.79/29.50 % Non-unit-clauses : 2476
% 195.79/29.50 % Current number of unprocessed clauses: 653149
% 195.79/29.50 % ...number of literals in the above : 3124610
% 195.79/29.50 % Current number of archived formulas : 0
% 195.79/29.50 % Current number of archived clauses : 441
% 195.79/29.50 % Clause-clause subsumption calls (NU) : 2769567
% 195.79/29.50 % Rec. Clause-clause subsumption calls : 1087476
% 195.79/29.50 % Non-unit clause-clause subsumptions : 5503
% 195.79/29.50 % Unit Clause-clause subsumption calls : 77692
% 195.79/29.50 % Rewrite failures with RHS unbound : 0
% 195.79/29.50 % BW rewrite match attempts : 1346
% 195.79/29.50 % BW rewrite match successes : 20
% 195.79/29.50 % Condensation attempts : 0
% 195.79/29.50 % Condensation successes : 0
% 195.79/29.50 % Termbank termtop insertions : 16003893
% 195.79/29.50 % Search garbage collected termcells : 1719
% 195.79/29.50
% 195.79/29.50 % -------------------------------------------------
% 195.79/29.50 % User time : 26.822 s
% 195.79/29.50 % System time : 0.777 s
% 195.79/29.50 % Total time : 27.599 s
% 195.79/29.50 % Maximum resident set size: 3980 pages
% 195.79/29.50
% 195.79/29.50 % -------------------------------------------------
% 195.79/29.50 % User time : 134.452 s
% 195.79/29.50 % System time : 4.346 s
% 195.79/29.50 % Total time : 138.798 s
% 195.79/29.50 % Maximum resident set size: 4864 pages
% 195.79/29.50 % E exiting
%------------------------------------------------------------------------------