%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV466+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 11.64s 1.90s
% Output : CNFRefutation 11.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 78 ( 40 unt; 0 def)
% Number of atoms : 652 ( 255 equ)
% Maximal formula atoms : 114 ( 8 avg)
% Number of connectives : 850 ( 276 ~; 185 |; 286 &)
% ( 8 <=>; 95 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 20 con; 0-7 aty)
% Number of variables : 324 ( 30 sgn 264 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X16) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X16),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X15)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X7)) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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
& 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] :
( ( host(X15) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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_1
& setIn(X14,alive) )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7,X14] :
( ( elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [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,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) )
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( host(X6) = index(pendack,host(X5))
& index(status,host(X5)) = elec_2 )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( host(X19) = s(index(pendack,host(X20)))
& host(X18) = index(pendack,host(X20))
& index(status,host(X20)) = elec_2
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& leq(nbr_proc,s(index(pendack,host(X20))))
& setIn(X20,alive) )
=> ~ ( host(X5) = host(X17)
& setIn(X17,alive) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X6,X5)
& leq(X5,X6) )
<=> 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_14,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Ldr(X7),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_14) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( leq(X5,X6)
| X5 = s(X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X16) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X16),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X15)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X7)) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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
& 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] :
( ( host(X15) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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_1
& setIn(X14,alive) )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7,X14] :
( ( elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [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,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) )
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( host(X6) = index(pendack,host(X5))
& index(status,host(X5)) = elec_2 )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( host(X19) = s(index(pendack,host(X20)))
& host(X18) = index(pendack,host(X20))
& index(status,host(X20)) = elec_2
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& leq(nbr_proc,s(index(pendack,host(X20))))
& setIn(X20,alive) )
=> ~ ( host(X5) = host(X17)
& setIn(X17,alive) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_8,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
<=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X16) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X16),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X15)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X7)) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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
& 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] :
( ( host(X15) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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_1
& setIn(X14,alive) )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7,X14] :
( ( elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [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,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) ) ),
introduced(definition) ).
fof(c_0_9,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X5,X6)
=> ( setIn(X5,alive)
=> ( leq(host(X5),host(X6))
=> ( ( host(X6) = index(pendack,host(X5))
& index(status,host(X5)) = elec_2 )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( setIn(host(X7),index(acks,host(X5)))
=> ! [X17] :
( host(X5) = host(X17)
=> ! [X18,X19,X20] :
( host(X7) = host(X20)
=> ( host(X5) != host(X20)
=> ( ( host(X19) = s(index(pendack,host(X20)))
& host(X18) = index(pendack,host(X20))
& index(status,host(X20)) = elec_2
& elem(m_Ack(X20,X18),snoc(queue(host(X20)),m_Ldr(X5)))
& elem(m_Down(X19),snoc(queue(host(X20)),m_Ldr(X5)))
& leq(nbr_proc,s(index(pendack,host(X20))))
& setIn(X20,alive) )
=> ~ ( host(X5) = host(X17)
& setIn(X17,alive) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7]),c_0_8]) ).
fof(c_0_10,negated_conjecture,
( host(esk6_0) = host(esk9_0)
& setIn(esk9_0,alive)
& host(esk11_0) = s(index(pendack,host(esk12_0)))
& host(esk10_0) = index(pendack,host(esk12_0))
& index(status,host(esk12_0)) = elec_2
& elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0)))
& elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0)))
& leq(nbr_proc,s(index(pendack,host(esk12_0))))
& setIn(esk12_0,alive)
& host(esk6_0) != host(esk12_0)
& host(esk8_0) = host(esk12_0)
& host(esk6_0) = host(esk9_0)
& setIn(host(esk8_0),index(acks,host(esk6_0)))
& leq(nbr_proc,index(pendack,host(esk6_0)))
& host(esk7_0) = index(pendack,host(esk6_0))
& index(status,host(esk6_0)) = elec_2
& 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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_11,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X16) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X16),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [X7,X16,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = host(X16)
& host(X14) = nbr_proc
& elem(m_Down(X15),queue(host(X14)))
& ! [X17] :
( ( leq(s(zero),X17)
& ~ leq(host(X14),X17) )
=> ( X17 = host(X15)
| setIn(X17,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X7)))
& setIn(X7,alive) ) )
& ! [X7,X15,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X15)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X7)) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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
& 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] :
( ( host(X15) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X7)) = norm
& index(ldr,host(X7)) = host(X7)
& setIn(X7,alive) ) )
& ! [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_1
& setIn(X14,alive) )
=> ~ elem(m_Ack(X14,X7),queue(host(X14))) )
& ! [X7,X14] :
( ( elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> leq(host(X7),index(pendack,host(X14))) )
& ! [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,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X140,X141] :
( ( X140 != X141
| leq(X141,X140) )
& ( X140 != X141
| leq(X140,X141) )
& ( X140 = X141
| ~ leq(X141,X140)
| ~ leq(X140,X141) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
cnf(c_0_13,negated_conjecture,
leq(nbr_proc,index(pendack,host(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
host(esk7_0) = index(pendack,host(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X26] : leq(host(X26),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_16,plain,
! [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,X191,X192,X193,X195,X196,X197,X198] :
( ( ~ epred1_3(X160,X159,X158)
| queue(host(X159)) = cons(m_Down(X158),X160) )
& ( ~ epred1_3(X160,X159,X158)
| index(status,host(X198)) != norm
| index(ldr,host(X198)) != host(X198)
| ~ setIn(X198,alive)
| host(X196) != s(index(pendack,host(X197)))
| host(X195) != index(pendack,host(X197))
| index(status,host(X197)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X197))))
| ~ elem(m_Ack(X197,X195),queue(host(X197)))
| ~ elem(m_Down(X196),queue(host(X197)))
| ~ setIn(X197,alive) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Down(X191),queue(host(X190)))
| ~ setIn(X190,alive)
| index(status,host(X193)) != elec_1
| host(X193) != host(X191)
| host(X193) != nbr_proc
| ~ elem(m_Down(X192),queue(host(X193)))
| esk13_7(X158,X159,X160,X190,X191,X192,X193) != host(X192) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Down(X191),queue(host(X190)))
| ~ setIn(X190,alive)
| index(status,host(X193)) != elec_1
| host(X193) != host(X191)
| host(X193) != nbr_proc
| ~ elem(m_Down(X192),queue(host(X193)))
| ~ setIn(esk13_7(X158,X159,X160,X190,X191,X192,X193),index(down,host(X193))) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Down(X191),queue(host(X190)))
| ~ setIn(X190,alive)
| index(status,host(X193)) != elec_1
| host(X193) != host(X191)
| host(X193) != nbr_proc
| ~ elem(m_Down(X192),queue(host(X193)))
| leq(s(zero),esk13_7(X158,X159,X160,X190,X191,X192,X193)) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Down(X191),queue(host(X190)))
| ~ setIn(X190,alive)
| index(status,host(X193)) != elec_1
| host(X193) != host(X191)
| host(X193) != nbr_proc
| ~ elem(m_Down(X192),queue(host(X193)))
| ~ leq(host(X193),esk13_7(X158,X159,X160,X190,X191,X192,X193)) )
& ( ~ epred1_3(X160,X159,X158)
| index(status,host(X187)) != norm
| index(ldr,host(X187)) != host(X187)
| ~ setIn(X187,alive)
| index(status,host(X189)) != elec_2
| ~ elem(m_Halt(X189),queue(host(X188)))
| ~ setIn(X189,alive)
| leq(index(pendack,host(X189)),host(X187)) )
& ( ~ epred1_3(X160,X159,X158)
| ~ leq(index(pendack,host(X185)),index(pendack,host(X186)))
| index(status,host(X186)) != elec_2
| index(status,host(X185)) != elec_2
| ~ setIn(X186,alive)
| ~ setIn(X185,alive)
| leq(host(X185),host(X186)) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Ack(X182,X183),queue(host(X182)))
| index(status,host(X184)) != elec_2
| index(status,host(X182)) != elec_2
| host(X184) != host(X183)
| ~ setIn(X184,alive)
| ~ setIn(X182,alive) )
& ( ~ epred1_3(X160,X159,X158)
| leq(index(pendack,host(X181)),host(X180))
| index(status,host(X181)) != elec_2
| index(status,host(X180)) != elec_2
| ~ setIn(X181,alive)
| ~ setIn(X180,alive)
| leq(host(X180),host(X181)) )
& ( ~ epred1_3(X160,X159,X158)
| index(status,host(X177)) != norm
| index(ldr,host(X177)) != host(X177)
| ~ setIn(X177,alive)
| host(X178) != host(X177)
| ~ elem(m_Down(X178),queue(host(X179)))
| ~ setIn(X179,alive) )
& ( ~ epred1_3(X160,X159,X158)
| index(elid,host(X176)) = X176
| ~ setIn(X176,alive)
| index(status,host(X176)) != elec_2 )
& ( ~ epred1_3(X160,X159,X158)
| index(elid,host(X176)) = X176
| ~ setIn(X176,alive)
| index(status,host(X176)) != elec_1 )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Ack(X175,X174),queue(host(X175)))
| index(status,host(X175)) != elec_1
| ~ setIn(X175,alive) )
& ( ~ epred1_3(X160,X159,X158)
| leq(host(X172),index(pendack,host(X173)))
| ~ elem(m_Ack(X173,X172),queue(host(X173)))
| ~ setIn(X173,alive) )
& ( ~ epred1_3(X160,X159,X158)
| ~ setIn(X171,alive)
| ~ setIn(X170,alive)
| host(X171) != host(X170)
| X171 = X170 )
& ( ~ epred1_3(X160,X159,X158)
| ~ leq(host(X167),host(X169))
| ~ elem(m_Ack(X169,X167),queue(host(X168))) )
& ( ~ epred1_3(X160,X159,X158)
| ~ leq(host(X165),host(X166))
| ~ elem(m_Halt(X166),queue(host(X165))) )
& ( ~ epred1_3(X160,X159,X158)
| host(X164) != host(X163)
| ~ elem(m_Down(X164),queue(host(X163))) )
& ( ~ epred1_3(X160,X159,X158)
| ~ leq(host(X161),host(X162))
| ~ elem(m_Ldr(X162),queue(host(X161))) ) ),
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_11])])])])])])]) ).
cnf(c_0_17,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
leq(nbr_proc,host(esk7_0)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
( ~ epred3_0
<=> ! [X3,X4,X5] : ~ epred1_3(X3,X4,X5) ),
introduced(definition) ).
cnf(c_0_21,plain,
( ~ epred1_3(X3,X4,X5)
| ~ leq(index(pendack,host(X1)),index(pendack,host(X2)))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| leq(host(X1),host(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
host(esk10_0) = index(pendack,host(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
index(status,host(esk12_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk12_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
host(esk7_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
fof(c_0_26,plain,
( ~ epred8_0
<=> ! [X1,X3,X2] :
( index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| host(X2) != host(X3)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Ack(X1,X3),queue(host(X1))) ) ),
introduced(definition) ).
cnf(c_0_27,plain,
( ~ epred1_3(X4,X5,X6)
| ~ elem(m_Ack(X1,X3),queue(host(X1)))
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| host(X2) != host(X3)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( ~ epred1_3(X1,X2,X3)
| epred3_0 ),
inference(split_equiv,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Ldr(X7),
inference(fof_simplification,[status(thm)],[axiom_14]) ).
cnf(c_0_31,negated_conjecture,
( ~ setIn(X1,alive)
| ~ leq(host(esk10_0),index(pendack,host(X1)))
| ~ epred1_3(X2,X3,X4)
| index(status,host(X1)) != elec_2
| leq(host(esk12_0),host(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_32,negated_conjecture,
index(pendack,host(esk6_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
index(status,host(esk6_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,plain,
( ~ epred3_0
| ~ epred8_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27,c_0_26]),c_0_20]) ).
cnf(c_0_36,negated_conjecture,
epred3_0,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_37,plain,
! [X104,X105,X106] :
( ( elem(X104,snoc(X106,X105))
| ~ elem(X104,X106) )
& ( elem(X104,snoc(X106,X105))
| X104 != X105 )
& ( elem(X104,X106)
| X104 = X105
| ~ elem(X104,snoc(X106,X105)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_38,plain,
! [X36,X37,X38] : m_Ack(X36,X37) != m_Ldr(X38),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
host(esk11_0) = s(index(pendack,host(esk12_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
( ~ epred1_3(X3,X4,X5)
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| leq(index(pendack,host(X2)),host(X1))
| leq(host(X1),host(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_41,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| leq(host(esk12_0),host(esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_19]),c_0_34])]) ).
cnf(c_0_42,plain,
~ epred8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_43,plain,
( ~ elem(X1,snoc(X2,X3))
| elem(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Ldr(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,plain,
m_Ack(X1,X2) != m_Ldr(X3),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk12_0)))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_47,negated_conjecture,
s(host(esk10_0)) = host(esk11_0),
inference(rw,[status(thm)],[c_0_39,c_0_22]) ).
fof(c_0_48,plain,
( ~ epred2_0
<=> ! [X1,X2] :
( host(X1) != host(X2)
| ~ elem(m_Down(X1),queue(host(X2))) ) ),
introduced(definition) ).
cnf(c_0_49,plain,
( ~ epred1_3(X3,X4,X5)
| host(X1) != host(X2)
| ~ elem(m_Down(X1),queue(host(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_50,plain,
! [X101,X102,X103] :
( ( elem(X101,cons(X102,X103))
| ~ elem(X101,X103) )
& ( elem(X101,cons(X102,X103))
| X101 != X102 )
& ( elem(X101,X103)
| X101 = X102
| ~ elem(X101,cons(X102,X103)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
cnf(c_0_51,negated_conjecture,
( ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2
| leq(host(X2),host(X1))
| leq(index(pendack,host(X1)),host(X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_52,negated_conjecture,
leq(host(esk12_0),host(esk6_0)),
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_53,negated_conjecture,
host(esk6_0) != host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_54,plain,
( ~ elem(m_Ack(X1,X3),queue(host(X1)))
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| host(X2) != host(X3)
| index(status,host(X2)) != elec_2
| index(status,host(X1)) != elec_2 ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_26]),c_0_42]) ).
cnf(c_0_55,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_56,negated_conjecture,
leq(nbr_proc,host(esk11_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_22]),c_0_47]) ).
cnf(c_0_57,plain,
( ~ epred2_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_49,c_0_48]),c_0_20]) ).
cnf(c_0_58,plain,
( X1 != X2
| elem(X1,cons(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,plain,
( ~ epred1_3(X3,X1,X2)
| queue(host(X1)) = cons(m_Down(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_60,negated_conjecture,
( ~ setIn(X1,alive)
| index(status,host(X1)) != elec_2
| leq(host(esk10_0),host(X1))
| leq(host(X1),host(esk12_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_61,negated_conjecture,
~ leq(host(esk6_0),host(esk12_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_52]),c_0_53]) ).
cnf(c_0_62,negated_conjecture,
( ~ setIn(X1,alive)
| host(X1) != host(esk10_0)
| index(status,host(X1)) != elec_2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_23]),c_0_24])]) ).
fof(c_0_63,plain,
! [X147,X148] :
( ( leq(X147,s(X148))
| ~ leq(X147,X148) )
& ( leq(X147,s(X148))
| X147 != s(X148) )
& ( leq(X147,X148)
| X147 = s(X148)
| ~ leq(X147,s(X148)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])])]) ).
cnf(c_0_64,negated_conjecture,
host(esk11_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_56]),c_0_19])]) ).
cnf(c_0_65,plain,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_36])]) ).
cnf(c_0_66,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_67,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_59,c_0_29]) ).
cnf(c_0_68,negated_conjecture,
leq(host(esk10_0),host(esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_34]),c_0_33])]),c_0_61]) ).
cnf(c_0_69,negated_conjecture,
host(esk10_0) != host(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_34]),c_0_33])]) ).
cnf(c_0_70,plain,
( ~ leq(X1,s(X2))
| leq(X1,X2)
| X1 = s(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,negated_conjecture,
s(host(esk10_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_47,c_0_64]) ).
cnf(c_0_72,plain,
( ~ elem(m_Down(X1),queue(host(X2)))
| host(X1) != host(X2) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_48]),c_0_65]) ).
cnf(c_0_73,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_74,negated_conjecture,
~ leq(host(esk6_0),host(esk10_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_68]),c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( ~ leq(X1,nbr_proc)
| leq(X1,host(esk10_0))
| X1 = nbr_proc ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,plain,
host(esk6_0) != nbr_proc,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_25]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_19])]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV466+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n018.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 08:54:43 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 11.64/1.90 % Version: 3.5.1
% 11.64/1.90 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.64/1.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.64/1.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.64/1.90 % Starting new_bool_3 with 300s (1) cores
% 11.64/1.90 % Starting new_bool_1 with 300s (1) cores
% 11.64/1.90 % Starting sh5l with 300s (1) cores
% 11.64/1.90 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1510296 completed with status 0
% 11.64/1.90 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 11.64/1.90 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.64/1.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.64/1.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.64/1.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.64/1.90 % No SInE strategy applied
% 11.64/1.90 % Search class: FGHSM-FFMM31-MFFFFFNN
% 11.64/1.90 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 11.64/1.90 % Starting SubtermCWHack with 136s (1) cores
% 11.64/1.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.64/1.90 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 11.64/1.90 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 11.64/1.90 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 11.64/1.90 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 1510307 completed with status 0
% 11.64/1.90 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 11.64/1.90 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.64/1.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.64/1.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.64/1.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.64/1.90 % No SInE strategy applied
% 11.64/1.90 % Search class: FGHSM-FFMM31-MFFFFFNN
% 11.64/1.90 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 11.64/1.90 % Starting SubtermCWHack with 136s (1) cores
% 11.64/1.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.64/1.90 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 11.64/1.90 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 11.64/1.90 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 11.64/1.90 % Preprocessing time : 0.003 s
% 11.64/1.90
% 11.64/1.90 % Proof found!
% 11.64/1.90 % SZS status Theorem
% 11.64/1.90 % SZS output start CNFRefutation
% See solution above
% 11.64/1.90 % Parsed axioms : 67
% 11.64/1.90 % Removed by relevancy pruning/SinE : 0
% 11.64/1.90 % Initial clauses : 135
% 11.64/1.90 % Removed in clause preprocessing : 6
% 11.64/1.90 % Initial clauses in saturation : 129
% 11.64/1.90 % Processed clauses : 7130
% 11.64/1.90 % ...of these trivial : 147
% 11.64/1.90 % ...subsumed : 5345
% 11.64/1.90 % ...remaining for further processing : 1638
% 11.64/1.90 % Other redundant clauses eliminated : 10
% 11.64/1.90 % Clauses deleted for lack of memory : 0
% 11.64/1.90 % Backward-subsumed : 64
% 11.64/1.90 % Backward-rewritten : 31
% 11.64/1.90 % Generated clauses : 68745
% 11.64/1.90 % ...of the previous two non-redundant : 61700
% 11.64/1.90 % ...aggressively subsumed : 0
% 11.64/1.90 % Contextual simplify-reflections : 29
% 11.64/1.90 % Paramodulations : 68459
% 11.64/1.90 % Factorizations : 20
% 11.64/1.90 % NegExts : 0
% 11.64/1.90 % Equation resolutions : 248
% 11.64/1.90 % Disequality decompositions : 0
% 11.64/1.90 % Total rewrite steps : 16109
% 11.64/1.90 % ...of those cached : 15691
% 11.64/1.90 % Propositional unsat checks : 0
% 11.64/1.90 % Propositional check models : 0
% 11.64/1.90 % Propositional check unsatisfiable : 0
% 11.64/1.90 % Propositional clauses : 0
% 11.64/1.90 % Propositional clauses after purity: 0
% 11.64/1.90 % Propositional unsat core size : 0
% 11.64/1.90 % Propositional preprocessing time : 0.000
% 11.64/1.90 % Propositional encoding time : 0.000
% 11.64/1.90 % Propositional solver time : 0.000
% 11.64/1.90 % Success case prop preproc time : 0.000
% 11.64/1.90 % Success case prop encoding time : 0.000
% 11.64/1.90 % Success case prop solver time : 0.000
% 11.64/1.90 % Current number of processed clauses : 1531
% 11.64/1.90 % Positive orientable unit clauses : 87
% 11.64/1.90 % Positive unorientable unit clauses: 0
% 11.64/1.90 % Negative unit clauses : 138
% 11.64/1.90 % Non-unit-clauses : 1306
% 11.64/1.90 % Current number of unprocessed clauses: 54372
% 11.64/1.90 % ...number of literals in the above : 225258
% 11.64/1.90 % Current number of archived formulas : 0
% 11.64/1.90 % Current number of archived clauses : 95
% 11.64/1.90 % Clause-clause subsumption calls (NU) : 1261650
% 11.64/1.90 % Rec. Clause-clause subsumption calls : 395551
% 11.64/1.90 % Non-unit clause-clause subsumptions : 2570
% 11.64/1.90 % Unit Clause-clause subsumption calls : 27748
% 11.64/1.90 % Rewrite failures with RHS unbound : 0
% 11.64/1.90 % BW rewrite match attempts : 93
% 11.64/1.90 % BW rewrite match successes : 15
% 11.64/1.90 % Condensation attempts : 0
% 11.64/1.90 % Condensation successes : 0
% 11.64/1.90 % Termbank termtop insertions : 960534
% 11.64/1.90 % Search garbage collected termcells : 2043
% 11.64/1.90
% 11.64/1.90 % -------------------------------------------------
% 11.64/1.90 % User time : 1.379 s
% 11.64/1.90 % System time : 0.056 s
% 11.64/1.90 % Total time : 1.435 s
% 11.64/1.90 % Maximum resident set size: 4248 pages
% 11.64/1.90
% 11.64/1.90 % -------------------------------------------------
% 11.64/1.90 % User time : 6.923 s
% 11.64/1.90 % System time : 0.287 s
% 11.64/1.90 % Total time : 7.209 s
% 11.64/1.90 % Maximum resident set size: 4608 pages
% 11.64/1.90 % E exiting
%------------------------------------------------------------------------------