%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV462+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 : n012.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:35 PM UTC 2026
% Result : Theorem 71.01s 10.95s
% Output : CNFRefutation 71.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 88 ( 40 unt; 0 def)
% Number of atoms : 661 ( 278 equ)
% Maximal formula atoms : 114 ( 7 avg)
% Number of connectives : 866 ( 293 ~; 199 |; 282 &)
% ( 5 <=>; 87 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 29 ( 29 usr; 18 con; 0-7 aty)
% Number of variables : 373 ( 54 sgn 276 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( host(X17) = s(index(pendack,host(X18)))
& host(X7) = index(pendack,host(X18))
& index(status,host(X18)) = elec_2
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& leq(nbr_proc,s(index(pendack,host(X18))))
& setIn(X18,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
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_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
fof(axiom_12,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_12) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_31) ).
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_32,axiom,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_32) ).
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(c_0_10,negated_conjecture,
~ ! [X12,X13,X5] :
( ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( host(X17) = s(index(pendack,host(X18)))
& host(X7) = index(pendack,host(X18))
& index(status,host(X18)) = elec_2
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& leq(nbr_proc,s(index(pendack,host(X18))))
& setIn(X18,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_11,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
<=> ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) ) ),
introduced(definition) ).
fof(c_0_12,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X12,X13,X5)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( host(X17) = s(index(pendack,host(X18)))
& host(X7) = index(pendack,host(X18))
& index(status,host(X18)) = elec_2
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& leq(nbr_proc,s(index(pendack,host(X18))))
& setIn(X18,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10]),c_0_11]) ).
fof(c_0_13,negated_conjecture,
( index(status,host(esk8_0)) = norm
& index(ldr,host(esk8_0)) = host(esk8_0)
& setIn(esk8_0,alive)
& host(esk10_0) = s(index(pendack,host(esk11_0)))
& host(esk9_0) = index(pendack,host(esk11_0))
& index(status,host(esk11_0)) = elec_2
& elem(m_Ack(esk11_0,esk9_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0)))
& elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0)))
& leq(nbr_proc,s(index(pendack,host(esk11_0))))
& setIn(esk11_0,alive)
& host(esk6_0) != host(esk11_0)
& host(esk7_0) = host(esk11_0)
& host(esk6_0) != host(esk8_0)
& setIn(esk6_0,alive)
& epred1_3(esk5_0,esk6_0,esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_14,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
=> ( queue(host(X13)) = cons(m_Halt(X5),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
host(esk10_0) = s(index(pendack,host(esk11_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
host(esk9_0) = index(pendack,host(esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [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,X188,X189,X190,X192,X193,X194,X195] :
( ( ~ epred1_3(X157,X156,X155)
| queue(host(X156)) = cons(m_Halt(X155),X157) )
& ( ~ epred1_3(X157,X156,X155)
| index(status,host(X195)) != norm
| index(ldr,host(X195)) != host(X195)
| ~ setIn(X195,alive)
| host(X193) != s(index(pendack,host(X194)))
| host(X192) != index(pendack,host(X194))
| index(status,host(X194)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X194))))
| ~ elem(m_Down(X193),queue(host(X194)))
| ~ elem(m_Ack(X194,X192),queue(host(X194)))
| ~ setIn(X194,alive) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| esk12_7(X155,X156,X157,X187,X188,X189,X190) != host(X189) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| ~ setIn(esk12_7(X155,X156,X157,X187,X188,X189,X190),index(down,host(X190))) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| leq(s(zero),esk12_7(X155,X156,X157,X187,X188,X189,X190)) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| ~ leq(host(X190),esk12_7(X155,X156,X157,X187,X188,X189,X190)) )
& ( ~ epred1_3(X157,X156,X155)
| index(status,host(X184)) != norm
| index(ldr,host(X184)) != host(X184)
| ~ setIn(X184,alive)
| index(status,host(X186)) != elec_2
| ~ elem(m_Halt(X186),queue(host(X185)))
| ~ setIn(X186,alive)
| leq(index(pendack,host(X186)),host(X184)) )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(index(pendack,host(X182)),index(pendack,host(X183)))
| index(status,host(X183)) != elec_2
| index(status,host(X182)) != elec_2
| ~ setIn(X183,alive)
| ~ setIn(X182,alive)
| leq(host(X182),host(X183)) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Ack(X179,X180),queue(host(X179)))
| index(status,host(X181)) != elec_2
| index(status,host(X179)) != elec_2
| host(X181) != host(X180)
| ~ setIn(X181,alive)
| ~ setIn(X179,alive) )
& ( ~ epred1_3(X157,X156,X155)
| index(status,host(X176)) != norm
| index(ldr,host(X176)) != host(X176)
| ~ setIn(X176,alive)
| host(X177) != host(X176)
| ~ elem(m_Down(X177),queue(host(X178)))
| ~ setIn(X178,alive) )
& ( ~ epred1_3(X157,X156,X155)
| leq(index(pendack,host(X175)),host(X174))
| index(status,host(X175)) != elec_2
| index(status,host(X174)) != elec_2
| ~ setIn(X175,alive)
| ~ setIn(X174,alive)
| leq(host(X174),host(X175)) )
& ( ~ epred1_3(X157,X156,X155)
| index(elid,host(X173)) = X173
| ~ setIn(X173,alive)
| index(status,host(X173)) != elec_2 )
& ( ~ epred1_3(X157,X156,X155)
| index(elid,host(X173)) = X173
| ~ setIn(X173,alive)
| index(status,host(X173)) != elec_1 )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Ack(X172,X171),queue(host(X172)))
| index(status,host(X172)) != elec_1
| ~ setIn(X172,alive) )
& ( ~ epred1_3(X157,X156,X155)
| leq(host(X169),index(pendack,host(X170)))
| ~ elem(m_Ack(X170,X169),queue(host(X170)))
| ~ setIn(X170,alive) )
& ( ~ epred1_3(X157,X156,X155)
| ~ setIn(X168,alive)
| ~ setIn(X167,alive)
| host(X168) != host(X167)
| X168 = X167 )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(host(X164),host(X166))
| ~ elem(m_Ack(X166,X164),queue(host(X165))) )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(host(X162),host(X163))
| ~ elem(m_Halt(X163),queue(host(X162))) )
& ( ~ epred1_3(X157,X156,X155)
| host(X161) != host(X160)
| ~ elem(m_Down(X161),queue(host(X160))) )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(host(X158),host(X159))
| ~ elem(m_Ldr(X159),queue(host(X158))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])])]) ).
fof(c_0_18,plain,
! [X138,X139] :
( ( X138 != X139
| leq(X139,X138) )
& ( X138 != X139
| leq(X138,X139) )
& ( X138 = X139
| ~ leq(X139,X138)
| ~ leq(X138,X139) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
cnf(c_0_19,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk11_0)))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
s(host(esk9_0)) = host(esk10_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X24] : leq(host(X24),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_22,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
inference(fof_simplification,[status(thm)],[axiom_12]) ).
cnf(c_0_23,plain,
( ~ epred1_3(X5,X6,X7)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| host(X3) != s(index(pendack,host(X1)))
| host(X2) != index(pendack,host(X1))
| index(status,host(X1)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Ack(X1,X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
index(ldr,host(esk8_0)) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
index(status,host(esk8_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
leq(nbr_proc,host(esk10_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16]),c_0_20]) ).
cnf(c_0_29,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X135] : leq(X135,X135),
inference(variable_rename,[status(thm)],[axiom_59]) ).
fof(c_0_31,plain,
! [X102,X103,X104] :
( ( elem(X102,snoc(X104,X103))
| ~ elem(X102,X104) )
& ( elem(X102,snoc(X104,X103))
| X102 != X103 )
& ( elem(X102,X104)
| X102 = X103
| ~ elem(X102,snoc(X104,X103)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_32,plain,
! [X28,X29,X30] : m_Ack(X28,X29) != m_Down(X30),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
( ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ setIn(X2,alive)
| ~ leq(nbr_proc,s(index(pendack,host(X2))))
| ~ epred1_3(X4,X5,X6)
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| host(X1) != s(index(pendack,host(X2))) ),
inference(cn,[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])]) ).
cnf(c_0_34,negated_conjecture,
setIn(esk11_0,alive),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,negated_conjecture,
host(esk10_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
index(status,host(esk11_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( ~ elem(X1,snoc(X2,X3))
| elem(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,plain,
m_Ack(X1,X2) != m_Down(X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( ~ elem(m_Down(X2),queue(host(esk11_0)))
| ~ elem(m_Ack(esk11_0,X1),queue(host(esk11_0)))
| ~ epred1_3(X3,X4,X5)
| host(X2) != nbr_proc
| host(X1) != host(esk9_0) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]),c_0_20]),c_0_35]),c_0_16]),c_0_36]),c_0_16]),c_0_20]),c_0_35]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
elem(m_Down(esk10_0),queue(host(esk11_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ elem(m_Ack(esk11_0,X1),queue(host(esk11_0)))
| ~ epred1_3(X2,X3,X4)
| host(X1) != host(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_42])]) ).
fof(c_0_44,plain,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
inference(fof_simplification,[status(thm)],[axiom_31]) ).
cnf(c_0_45,negated_conjecture,
elem(m_Ack(esk11_0,esk9_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,negated_conjecture,
( ~ elem(m_Ack(esk11_0,esk9_0),queue(host(esk11_0)))
| ~ epred1_3(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_48,plain,
! [X70,X71,X72,X73] :
( m_Ack(X70,X72) != m_Ack(X71,X73)
| X70 = X71 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])]) ).
cnf(c_0_49,negated_conjecture,
( elem(m_Ack(esk11_0,esk9_0),queue(host(esk11_0)))
| m_Ack(esk7_0,esk6_0) = m_Ack(esk11_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
~ elem(m_Ack(esk11_0,esk9_0),queue(host(esk11_0))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( m_Ack(X1,X3) != m_Ack(X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,negated_conjecture,
m_Ack(esk7_0,esk6_0) = m_Ack(esk11_0,esk9_0),
inference(sr,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_53,plain,
! [X99,X100,X101] :
( ( elem(X99,cons(X100,X101))
| ~ elem(X99,X101) )
& ( elem(X99,cons(X100,X101))
| X99 != X100 )
& ( elem(X99,X101)
| X99 = X100
| ~ elem(X99,cons(X100,X101)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_54,plain,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
inference(fof_simplification,[status(thm)],[axiom_32]) ).
cnf(c_0_55,negated_conjecture,
( m_Ack(esk11_0,esk9_0) != m_Ack(X1,X2)
| esk7_0 = X1 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_56,plain,
! [X145,X146] :
( ( leq(X145,s(X146))
| ~ leq(X145,X146) )
& ( leq(X145,s(X146))
| X145 != s(X146) )
& ( leq(X145,X146)
| X145 = s(X146)
| ~ leq(X145,s(X146)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])])]) ).
cnf(c_0_57,plain,
( X1 != X2
| elem(X1,cons(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
( ~ epred1_3(X3,X1,X2)
| queue(host(X1)) = cons(m_Halt(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_59,plain,
! [X74,X75,X76,X77] :
( m_Ack(X74,X76) != m_Ack(X75,X77)
| X76 = X77 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])]) ).
cnf(c_0_60,negated_conjecture,
esk7_0 = esk11_0,
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
( ~ leq(X1,s(X2))
| leq(X1,X2)
| X1 = s(X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_62,negated_conjecture,
s(host(esk9_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_63,plain,
( ~ epred1_3(X4,X5,X6)
| index(status,host(X2)) != norm
| index(ldr,host(X2)) != host(X2)
| ~ setIn(X2,alive)
| index(status,host(X1)) != elec_2
| ~ elem(m_Halt(X1),queue(host(X3)))
| ~ setIn(X1,alive)
| leq(index(pendack,host(X1)),host(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_64,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_65,negated_conjecture,
cons(m_Halt(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_58,c_0_47]) ).
cnf(c_0_66,plain,
( m_Ack(X3,X1) != m_Ack(X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_67,negated_conjecture,
m_Ack(esk11_0,esk9_0) = m_Ack(esk11_0,esk6_0),
inference(rw,[status(thm)],[c_0_52,c_0_60]) ).
cnf(c_0_68,plain,
( ~ epred1_3(X4,X5,X6)
| index(status,host(X3)) != norm
| index(ldr,host(X3)) != host(X3)
| ~ setIn(X3,alive)
| host(X2) != host(X3)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_69,negated_conjecture,
( ~ leq(X1,nbr_proc)
| leq(X1,host(esk9_0))
| X1 = nbr_proc ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_70,negated_conjecture,
( ~ elem(m_Halt(X1),queue(host(X5)))
| ~ setIn(X1,alive)
| ~ epred1_3(X2,X3,X4)
| index(status,host(X1)) != elec_2
| leq(index(pendack,host(X1)),host(esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_71,negated_conjecture,
elem(m_Halt(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
( m_Ack(esk11_0,esk6_0) != m_Ack(X2,X1)
| esk9_0 = X1 ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
( ~ elem(m_Down(X1),queue(host(X5)))
| ~ setIn(X5,alive)
| ~ epred1_3(X2,X3,X4)
| host(X1) != host(esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_74,negated_conjecture,
( ~ leq(X1,nbr_proc)
| ~ leq(host(esk9_0),X1)
| X1 = nbr_proc
| host(esk9_0) = X1 ),
inference(spm,[status(thm)],[c_0_27,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( ~ elem(m_Halt(esk11_0),queue(host(X4)))
| ~ epred1_3(X1,X2,X3)
| leq(host(esk9_0),host(esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_34]),c_0_16]),c_0_36])]) ).
cnf(c_0_76,negated_conjecture,
elem(m_Halt(esk11_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_71,c_0_60]) ).
cnf(c_0_77,negated_conjecture,
esk9_0 = esk6_0,
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( ~ elem(m_Down(X1),queue(host(esk11_0)))
| ~ epred1_3(X2,X3,X4)
| host(X1) != host(esk8_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_34]) ).
cnf(c_0_79,negated_conjecture,
( ~ leq(host(esk9_0),host(X1))
| host(X1) = nbr_proc
| host(esk9_0) = host(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_29]) ).
cnf(c_0_80,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| leq(host(esk6_0),host(esk8_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_81,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk11_0),
inference(rw,[status(thm)],[c_0_47,c_0_60]) ).
cnf(c_0_82,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| host(esk8_0) != nbr_proc ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_35]),c_0_42])]) ).
cnf(c_0_83,negated_conjecture,
( ~ leq(host(esk6_0),host(X1))
| host(X1) = nbr_proc
| host(esk6_0) = host(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_77]),c_0_77]) ).
cnf(c_0_84,negated_conjecture,
leq(host(esk6_0),host(esk8_0)),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
host(esk6_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_86,negated_conjecture,
host(esk8_0) != nbr_proc,
inference(spm,[status(thm)],[c_0_82,c_0_47]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV462+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.56 % Computer : n012.cluster.edu
% 0.08/0.56 % Model : x86_64 x86_64
% 0.08/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.56 % Memory : 8046.5625MB
% 0.08/0.56 % OS : Linux 6.8.0-71-generic
% 0.08/0.56 % CPULimit : 300
% 0.08/0.56 % WCLimit : 300
% 0.08/0.56 % DateTime : Mon Sep 21 08:52:22 UTC 2026
% 0.08/0.56 % CPUTime :
% 0.08/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.60 Running first-order theorem proving
% 0.08/0.60 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
% 71.01/10.95 % Version: 3.5.1
% 71.01/10.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 71.01/10.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.01/10.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 71.01/10.95 % Starting new_bool_3 with 300s (1) cores
% 71.01/10.95 % Starting new_bool_1 with 300s (1) cores
% 71.01/10.95 % Starting sh5l with 300s (1) cores
% 71.01/10.95 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2032714 completed with status 0
% 71.01/10.95 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 71.01/10.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 71.01/10.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.01/10.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 71.01/10.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.01/10.95 % No SInE strategy applied
% 71.01/10.95 % Search class: FGHSM-FFMM31-MFFFFFNN
% 71.01/10.95 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 71.01/10.95 % Starting SubtermCWHack with 136s (1) cores
% 71.01/10.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 71.01/10.95 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 71.01/10.95 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 71.01/10.95 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 71.01/10.95 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 2032722 completed with status 0
% 71.01/10.95 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 71.01/10.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 71.01/10.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.01/10.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 71.01/10.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.01/10.95 % No SInE strategy applied
% 71.01/10.95 % Search class: FGHSM-FFMM31-MFFFFFNN
% 71.01/10.95 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 71.01/10.95 % Starting SubtermCWHack with 136s (1) cores
% 71.01/10.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 71.01/10.95 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 71.01/10.95 % Preprocessing time : 0.002 s
% 71.01/10.95 % Presaturation interreduction done
% 71.01/10.95
% 71.01/10.95 % Proof found!
% 71.01/10.95 % SZS status Theorem
% 71.01/10.95 % SZS output start CNFRefutation
% See solution above
% 71.01/10.95 % Parsed axioms : 67
% 71.01/10.95 % Removed by relevancy pruning/SinE : 0
% 71.01/10.95 % Initial clauses : 131
% 71.01/10.95 % Removed in clause preprocessing : 6
% 71.01/10.95 % Initial clauses in saturation : 125
% 71.01/10.95 % Processed clauses : 42065
% 71.01/10.95 % ...of these trivial : 430
% 71.01/10.95 % ...subsumed : 36935
% 71.01/10.95 % ...remaining for further processing : 4700
% 71.01/10.95 % Other redundant clauses eliminated : 7
% 71.01/10.95 % Clauses deleted for lack of memory : 0
% 71.01/10.95 % Backward-subsumed : 728
% 71.01/10.95 % Backward-rewritten : 485
% 71.01/10.95 % Generated clauses : 848064
% 71.01/10.95 % ...of the previous two non-redundant : 522212
% 71.01/10.95 % ...aggressively subsumed : 0
% 71.01/10.95 % Contextual simplify-reflections : 0
% 71.01/10.95 % Paramodulations : 847829
% 71.01/10.95 % Factorizations : 158
% 71.01/10.95 % NegExts : 0
% 71.01/10.95 % Equation resolutions : 53
% 71.01/10.95 % Disequality decompositions : 0
% 71.01/10.95 % Total rewrite steps : 484103
% 71.01/10.95 % ...of those cached : 483450
% 71.01/10.95 % Propositional unsat checks : 0
% 71.01/10.95 % Propositional check models : 0
% 71.01/10.95 % Propositional check unsatisfiable : 0
% 71.01/10.95 % Propositional clauses : 0
% 71.01/10.95 % Propositional clauses after purity: 0
% 71.01/10.95 % Propositional unsat core size : 0
% 71.01/10.95 % Propositional preprocessing time : 0.000
% 71.01/10.95 % Propositional encoding time : 0.000
% 71.01/10.95 % Propositional solver time : 0.000
% 71.01/10.95 % Success case prop preproc time : 0.000
% 71.01/10.95 % Success case prop encoding time : 0.000
% 71.01/10.95 % Success case prop solver time : 0.000
% 71.01/10.95 % Current number of processed clauses : 3335
% 71.01/10.95 % Positive orientable unit clauses : 170
% 71.01/10.95 % Positive unorientable unit clauses: 0
% 71.01/10.95 % Negative unit clauses : 226
% 71.01/10.95 % Non-unit-clauses : 2939
% 71.01/10.95 % Current number of unprocessed clauses: 477156
% 71.01/10.95 % ...number of literals in the above : 1566588
% 71.01/10.95 % Current number of archived formulas : 0
% 71.01/10.95 % Current number of archived clauses : 1358
% 71.01/10.95 % Clause-clause subsumption calls (NU) : 5788982
% 71.01/10.95 % Rec. Clause-clause subsumption calls : 3617169
% 71.01/10.95 % Non-unit clause-clause subsumptions : 19277
% 71.01/10.95 % Unit Clause-clause subsumption calls : 118267
% 71.01/10.95 % Rewrite failures with RHS unbound : 0
% 71.01/10.95 % BW rewrite match attempts : 1965
% 71.01/10.95 % BW rewrite match successes : 47
% 71.01/10.95 % Condensation attempts : 0
% 71.01/10.95 % Condensation successes : 0
% 71.01/10.95 % Termbank termtop insertions : 13959362
% 71.01/10.95 % Search garbage collected termcells : 1983
% 71.01/10.95
% 71.01/10.95 % -------------------------------------------------
% 71.01/10.95 % User time : 9.847 s
% 71.01/10.95 % System time : 0.244 s
% 71.01/10.95 % Total time : 10.091 s
% 71.01/10.95 % Maximum resident set size: 3988 pages
% 71.01/10.95
% 71.01/10.95 % -------------------------------------------------
% 71.01/10.95 % User time : 49.380 s
% 71.01/10.95 % System time : 1.421 s
% 71.01/10.95 % Total time : 50.801 s
% 71.01/10.95 % Maximum resident set size: 4864 pages
% 71.01/10.95 % E exiting
%------------------------------------------------------------------------------