%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV461+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 : n001.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 7.67s 1.57s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 66 ( 37 unt; 0 def)
% Number of atoms : 632 ( 261 equ)
% Maximal formula atoms : 115 ( 9 avg)
% Number of connectives : 839 ( 273 ~; 169 |; 291 &)
% ( 6 <=>; 100 =>; 0 <=; 0 <~>)
% Maximal formula depth : 70 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 19 con; 0-5 aty)
% Number of variables : 282 ( 9 sgn 257 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13] :
( ( ! [X5,X6,X7,X14] :
( ( host(X7) = s(index(pendack,host(X14)))
& host(X6) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X6),queue(host(X14)))
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6,X7,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& ! [X15] :
( ( leq(s(zero),X15)
& ~ leq(host(X14),X15) )
=> ( X15 = host(X7)
| setIn(X15,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X6),queue(host(X5)))
& setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& elem(m_Halt(X7),queue(host(X6)))
& setIn(X7,alive)
& ~ leq(index(pendack,host(X7)),host(X5)) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X5)) = elec_2
& host(X7) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive) )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6,X7] :
( ( host(X6) = host(X5)
& elem(m_Down(X6),queue(host(X7)))
& setIn(X7,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5] :
( ( setIn(X5,alive)
& ( index(status,host(X5)) = elec_2
| index(status,host(X5)) = elec_1 ) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_1
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5,X6] :
( ( elem(m_Ack(X6,X5),queue(host(X6)))
& setIn(X6,alive) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( host(X6) = host(X5)
& X6 != X5 )
=> ( ~ setIn(X6,alive)
| ~ setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) ) )
=> ( queue(host(X13)) = q_nil
=> ( ( host(X13) = host(X12)
& ~ setIn(X12,pids)
& ! [X5] :
( host(X13) = host(X5)
=> leq(X5,X12) ) )
=> ( host(X12) = s(zero)
=> ( ~ leq(nbr_proc,host(X12))
=> ! [X5] :
( host(X12) != host(X5)
=> ! [X6,X7,X16] :
( s(host(X12)) = host(X16)
=> ( host(X12) != host(X16)
=> ( ( host(X7) = s(index(pendack,host(X16)))
& host(X6) = index(pendack,host(X16))
& index(status,host(X16)) = elec_2
& elem(m_Ack(X16,X6),snoc(queue(host(X16)),m_Halt(X12)))
& elem(m_Down(X7),snoc(queue(host(X16)),m_Halt(X12)))
& leq(nbr_proc,s(index(pendack,host(X16))))
& ( X16 = X12
| setIn(X16,alive) ) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& ( X5 = X12
| setIn(X5,alive) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_11,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Halt(X7),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_11) ).
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_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_17,axiom,
! [X5,X6] : m_Down(X5) != m_Halt(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(axiom,axiom,
! [X1,X2] :
( elem(m_Ack(X1,X2),queue(host(X1)))
=> ( setIn(X2,pids)
& setIn(X1,pids) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X13] :
( ( ! [X5,X6,X7,X14] :
( ( host(X7) = s(index(pendack,host(X14)))
& host(X6) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X6),queue(host(X14)))
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6,X7,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& ! [X15] :
( ( leq(s(zero),X15)
& ~ leq(host(X14),X15) )
=> ( X15 = host(X7)
| setIn(X15,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X6),queue(host(X5)))
& setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& elem(m_Halt(X7),queue(host(X6)))
& setIn(X7,alive)
& ~ leq(index(pendack,host(X7)),host(X5)) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X5)) = elec_2
& host(X7) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive) )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6,X7] :
( ( host(X6) = host(X5)
& elem(m_Down(X6),queue(host(X7)))
& setIn(X7,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5] :
( ( setIn(X5,alive)
& ( index(status,host(X5)) = elec_2
| index(status,host(X5)) = elec_1 ) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_1
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5,X6] :
( ( elem(m_Ack(X6,X5),queue(host(X6)))
& setIn(X6,alive) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( host(X6) = host(X5)
& X6 != X5 )
=> ( ~ setIn(X6,alive)
| ~ setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) ) )
=> ( queue(host(X13)) = q_nil
=> ( ( host(X13) = host(X12)
& ~ setIn(X12,pids)
& ! [X5] :
( host(X13) = host(X5)
=> leq(X5,X12) ) )
=> ( host(X12) = s(zero)
=> ( ~ leq(nbr_proc,host(X12))
=> ! [X5] :
( host(X12) != host(X5)
=> ! [X6,X7,X16] :
( s(host(X12)) = host(X16)
=> ( host(X12) != host(X16)
=> ( ( host(X7) = s(index(pendack,host(X16)))
& host(X6) = index(pendack,host(X16))
& index(status,host(X16)) = elec_2
& elem(m_Ack(X16,X6),snoc(queue(host(X16)),m_Halt(X12)))
& elem(m_Down(X7),snoc(queue(host(X16)),m_Halt(X12)))
& leq(nbr_proc,s(index(pendack,host(X16))))
& ( X16 = X12
| setIn(X16,alive) ) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& ( X5 = X12
| setIn(X5,alive) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_9,plain,
! [X13] :
( epred1_1(X13)
<=> ( ! [X5,X6,X7,X14] :
( ( host(X7) = s(index(pendack,host(X14)))
& host(X6) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X6),queue(host(X14)))
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6,X7,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& ! [X15] :
( ( leq(s(zero),X15)
& ~ leq(host(X14),X15) )
=> ( X15 = host(X7)
| setIn(X15,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X6),queue(host(X5)))
& setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& elem(m_Halt(X7),queue(host(X6)))
& setIn(X7,alive)
& ~ leq(index(pendack,host(X7)),host(X5)) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X5)) = elec_2
& host(X7) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive) )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6,X7] :
( ( host(X6) = host(X5)
& elem(m_Down(X6),queue(host(X7)))
& setIn(X7,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5] :
( ( setIn(X5,alive)
& ( index(status,host(X5)) = elec_2
| index(status,host(X5)) = elec_1 ) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_1
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5,X6] :
( ( elem(m_Ack(X6,X5),queue(host(X6)))
& setIn(X6,alive) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( host(X6) = host(X5)
& X6 != X5 )
=> ( ~ setIn(X6,alive)
| ~ setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) ) ) ),
introduced(definition) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X13] :
( epred1_1(X13)
=> ( queue(host(X13)) = q_nil
=> ( ( host(X13) = host(X12)
& ~ setIn(X12,pids)
& ! [X5] :
( host(X13) = host(X5)
=> leq(X5,X12) ) )
=> ( host(X12) = s(zero)
=> ( ~ leq(nbr_proc,host(X12))
=> ! [X5] :
( host(X12) != host(X5)
=> ! [X6,X7,X16] :
( s(host(X12)) = host(X16)
=> ( host(X12) != host(X16)
=> ( ( host(X7) = s(index(pendack,host(X16)))
& host(X6) = index(pendack,host(X16))
& index(status,host(X16)) = elec_2
& elem(m_Ack(X16,X6),snoc(queue(host(X16)),m_Halt(X12)))
& elem(m_Down(X7),snoc(queue(host(X16)),m_Halt(X12)))
& leq(nbr_proc,s(index(pendack,host(X16))))
& ( X16 = X12
| setIn(X16,alive) ) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& ( X5 = X12
| setIn(X5,alive) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8]),c_0_9]) ).
fof(c_0_11,plain,
! [X13] :
( epred1_1(X13)
=> ( ! [X5,X6,X7,X14] :
( ( host(X7) = s(index(pendack,host(X14)))
& host(X6) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Ack(X14,X6),queue(host(X14)))
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6,X7,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& ! [X15] :
( ( leq(s(zero),X15)
& ~ leq(host(X14),X15) )
=> ( X15 = host(X7)
| setIn(X15,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X6),queue(host(X5)))
& setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& elem(m_Halt(X7),queue(host(X6)))
& setIn(X7,alive)
& ~ leq(index(pendack,host(X7)),host(X5)) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> ~ leq(index(pendack,host(X5)),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_2
& index(status,host(X5)) = elec_2
& setIn(X6,alive)
& setIn(X5,alive)
& ~ leq(host(X5),host(X6)) )
=> leq(index(pendack,host(X6)),host(X5)) )
& ! [X5,X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X5)) = elec_2
& host(X7) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive) )
=> ~ elem(m_Ack(X5,X6),queue(host(X5))) )
& ! [X5,X6,X7] :
( ( host(X6) = host(X5)
& elem(m_Down(X6),queue(host(X7)))
& setIn(X7,alive) )
=> ~ ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X5)
& setIn(X5,alive) ) )
& ! [X5] :
( ( setIn(X5,alive)
& ( index(status,host(X5)) = elec_2
| index(status,host(X5)) = elec_1 ) )
=> index(elid,host(X5)) = X5 )
& ! [X5,X6] :
( ( index(status,host(X6)) = elec_1
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X5),queue(host(X6))) )
& ! [X5,X6] :
( ( elem(m_Ack(X6,X5),queue(host(X6)))
& setIn(X6,alive) )
=> leq(host(X5),index(pendack,host(X6))) )
& ! [X5,X6] :
( ( host(X6) = host(X5)
& X6 != X5 )
=> ( ~ setIn(X6,alive)
| ~ setIn(X5,alive) ) )
& ! [X5,X6,X7] :
( elem(m_Ack(X7,X5),queue(host(X6)))
=> ~ leq(host(X5),host(X7)) )
& ! [X5,X6] :
( elem(m_Halt(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X6) != host(X5) )
& ! [X5,X6] :
( elem(m_Ldr(X6),queue(host(X5)))
=> ~ leq(host(X5),host(X6)) )
& ! [X5] :
( host(X13) = host(X5)
=> ~ setIn(X5,alive) ) ) ),
inference(split_equiv,[status(thm)],[c_0_9]) ).
fof(c_0_12,negated_conjecture,
! [X148] :
( index(status,host(esk7_0)) = norm
& index(ldr,host(esk7_0)) = host(esk7_0)
& ( esk7_0 = esk5_0
| setIn(esk7_0,alive) )
& host(esk9_0) = s(index(pendack,host(esk10_0)))
& host(esk8_0) = index(pendack,host(esk10_0))
& index(status,host(esk10_0)) = elec_2
& elem(m_Ack(esk10_0,esk8_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0)))
& elem(m_Down(esk9_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0)))
& leq(nbr_proc,s(index(pendack,host(esk10_0))))
& ( esk10_0 = esk5_0
| setIn(esk10_0,alive) )
& host(esk5_0) != host(esk10_0)
& s(host(esk5_0)) = host(esk10_0)
& host(esk5_0) != host(esk7_0)
& ~ leq(nbr_proc,host(esk5_0))
& host(esk5_0) = s(zero)
& host(esk6_0) = host(esk5_0)
& ~ setIn(esk5_0,pids)
& ( leq(X148,esk5_0)
| host(esk6_0) != host(X148) )
& queue(host(esk6_0)) = q_nil
& epred1_1(esk6_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)],[c_0_10])])])])]) ).
fof(c_0_13,plain,
! [X153,X154,X155,X156,X157,X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179,X180,X181,X182,X183,X184,X185,X186,X187,X189,X190,X191,X192] :
( ( ~ epred1_1(X153)
| index(status,host(X192)) != norm
| index(ldr,host(X192)) != host(X192)
| ~ setIn(X192,alive)
| host(X190) != s(index(pendack,host(X191)))
| host(X189) != index(pendack,host(X191))
| index(status,host(X191)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X191))))
| ~ elem(m_Ack(X191,X189),queue(host(X191)))
| ~ elem(m_Down(X190),queue(host(X191)))
| ~ setIn(X191,alive) )
& ( ~ epred1_1(X153)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ setIn(X184,alive)
| index(status,host(X187)) != elec_1
| host(X187) != nbr_proc
| host(X187) != host(X185)
| ~ elem(m_Down(X186),queue(host(X187)))
| esk11_5(X153,X184,X185,X186,X187) != host(X186) )
& ( ~ epred1_1(X153)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ setIn(X184,alive)
| index(status,host(X187)) != elec_1
| host(X187) != nbr_proc
| host(X187) != host(X185)
| ~ elem(m_Down(X186),queue(host(X187)))
| ~ setIn(esk11_5(X153,X184,X185,X186,X187),index(down,host(X187))) )
& ( ~ epred1_1(X153)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ setIn(X184,alive)
| index(status,host(X187)) != elec_1
| host(X187) != nbr_proc
| host(X187) != host(X185)
| ~ elem(m_Down(X186),queue(host(X187)))
| leq(s(zero),esk11_5(X153,X184,X185,X186,X187)) )
& ( ~ epred1_1(X153)
| ~ elem(m_Down(X185),queue(host(X184)))
| ~ setIn(X184,alive)
| index(status,host(X187)) != elec_1
| host(X187) != nbr_proc
| host(X187) != host(X185)
| ~ elem(m_Down(X186),queue(host(X187)))
| ~ leq(host(X187),esk11_5(X153,X184,X185,X186,X187)) )
& ( ~ epred1_1(X153)
| index(status,host(X181)) != norm
| index(ldr,host(X181)) != host(X181)
| ~ setIn(X181,alive)
| index(status,host(X183)) != elec_2
| ~ elem(m_Halt(X183),queue(host(X182)))
| ~ setIn(X183,alive)
| leq(index(pendack,host(X183)),host(X181)) )
& ( ~ epred1_1(X153)
| ~ 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_1(X153)
| leq(index(pendack,host(X178)),host(X177))
| index(status,host(X178)) != elec_2
| index(status,host(X177)) != elec_2
| ~ setIn(X178,alive)
| ~ setIn(X177,alive)
| leq(host(X177),host(X178)) )
& ( ~ epred1_1(X153)
| ~ elem(m_Ack(X174,X175),queue(host(X174)))
| index(status,host(X176)) != elec_2
| index(status,host(X174)) != elec_2
| host(X176) != host(X175)
| ~ setIn(X176,alive)
| ~ setIn(X174,alive) )
& ( ~ epred1_1(X153)
| index(status,host(X171)) != norm
| index(ldr,host(X171)) != host(X171)
| ~ setIn(X171,alive)
| host(X172) != host(X171)
| ~ elem(m_Down(X172),queue(host(X173)))
| ~ setIn(X173,alive) )
& ( ~ epred1_1(X153)
| index(elid,host(X170)) = X170
| ~ setIn(X170,alive)
| index(status,host(X170)) != elec_2 )
& ( ~ epred1_1(X153)
| index(elid,host(X170)) = X170
| ~ setIn(X170,alive)
| index(status,host(X170)) != elec_1 )
& ( ~ epred1_1(X153)
| ~ elem(m_Ack(X169,X168),queue(host(X169)))
| index(status,host(X169)) != elec_1
| ~ setIn(X169,alive) )
& ( ~ epred1_1(X153)
| leq(host(X166),index(pendack,host(X167)))
| ~ elem(m_Ack(X167,X166),queue(host(X167)))
| ~ setIn(X167,alive) )
& ( ~ epred1_1(X153)
| ~ setIn(X165,alive)
| ~ setIn(X164,alive)
| host(X165) != host(X164)
| X165 = X164 )
& ( ~ epred1_1(X153)
| ~ leq(host(X161),host(X163))
| ~ elem(m_Ack(X163,X161),queue(host(X162))) )
& ( ~ epred1_1(X153)
| ~ leq(host(X159),host(X160))
| ~ elem(m_Halt(X160),queue(host(X159))) )
& ( ~ epred1_1(X153)
| host(X158) != host(X157)
| ~ elem(m_Down(X158),queue(host(X157))) )
& ( ~ epred1_1(X153)
| ~ leq(host(X155),host(X156))
| ~ elem(m_Ldr(X156),queue(host(X155))) )
& ( ~ epred1_1(X153)
| ~ setIn(X154,alive)
| host(X153) != host(X154) ) ),
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])])])])])])]) ).
fof(c_0_14,plain,
( ~ epred3_0
<=> ! [X3] : ~ epred1_1(X3) ),
introduced(definition) ).
fof(c_0_15,plain,
( ~ epred11_0
<=> ! [X4] :
( index(ldr,host(X4)) != host(X4)
| index(status,host(X4)) != norm
| ~ setIn(X4,alive) ) ),
introduced(definition) ).
fof(c_0_16,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Halt(X7),
inference(fof_simplification,[status(thm)],[axiom_11]) ).
cnf(c_0_17,negated_conjecture,
host(esk9_0) = s(index(pendack,host(esk10_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
host(esk8_0) = index(pendack,host(esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
( ~ epred10_0
<=> ! [X3,X2,X1] :
( host(X2) != s(index(pendack,host(X1)))
| host(X3) != index(pendack,host(X1))
| index(status,host(X1)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| ~ setIn(X1,alive)
| ~ elem(m_Ack(X1,X3),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X1))) ) ),
introduced(definition) ).
cnf(c_0_20,plain,
( ~ epred1_1(X5)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| host(X2) != s(index(pendack,host(X1)))
| host(X3) != index(pendack,host(X1))
| index(status,host(X1)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| ~ elem(m_Ack(X1,X3),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ epred1_1(X1)
| epred3_0 ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
epred1_1(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( ~ setIn(X1,alive)
| index(status,host(X1)) != norm
| index(ldr,host(X1)) != host(X1)
| epred11_0 ),
inference(split_equiv,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( esk7_0 = esk5_0
| setIn(esk7_0,alive) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
index(ldr,host(esk7_0)) = host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
index(status,host(esk7_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X100,X101,X102] :
( ( elem(X100,snoc(X102,X101))
| ~ elem(X100,X102) )
& ( elem(X100,snoc(X102,X101))
| X100 != X101 )
& ( elem(X100,X102)
| X100 = X101
| ~ elem(X100,snoc(X102,X101)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_28,plain,
! [X23,X24,X25] : m_Ack(X23,X24) != m_Halt(X25),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
fof(c_0_29,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])])])]) ).
cnf(c_0_30,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk10_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
s(host(esk8_0)) = host(esk9_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_32,plain,
! [X22] : leq(host(X22),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_33,plain,
( ~ epred3_0
| ~ epred10_0
| ~ epred11_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_19]),c_0_15]),c_0_14]) ).
cnf(c_0_34,negated_conjecture,
epred3_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
host(esk5_0) != host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( epred11_0
| esk7_0 = esk5_0 ),
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])]) ).
fof(c_0_37,plain,
! [X5,X6] : m_Down(X5) != m_Halt(X6),
inference(fof_simplification,[status(thm)],[axiom_17]) ).
cnf(c_0_38,plain,
( ~ elem(X1,snoc(X2,X3))
| elem(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
elem(m_Ack(esk10_0,esk8_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
m_Ack(X1,X2) != m_Halt(X3),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
leq(nbr_proc,host(esk9_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_18]),c_0_31]) ).
cnf(c_0_43,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_44,plain,
! [X133] : leq(X133,X133),
inference(variable_rename,[status(thm)],[axiom_59]) ).
cnf(c_0_45,plain,
( ~ epred10_0
| ~ epred11_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_46,negated_conjecture,
epred11_0,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_47,plain,
! [X40,X41] : m_Down(X40) != m_Halt(X41),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_37])]) ).
cnf(c_0_48,plain,
( ~ 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))))
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| host(X1) != s(index(pendack,host(X2)))
| epred10_0 ),
inference(split_equiv,[status(thm)],[c_0_19]) ).
cnf(c_0_49,negated_conjecture,
elem(m_Ack(esk10_0,esk8_0),queue(host(esk10_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_50,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_51,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,plain,
~ epred10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_54,negated_conjecture,
elem(m_Down(esk9_0),snoc(queue(host(esk10_0)),m_Halt(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,plain,
m_Down(X1) != m_Halt(X2),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_56,plain,
! [X17,X18] :
( ( ~ elem(m_Ack(X17,X18),queue(host(X17)))
| setIn(X18,pids) )
& ( ~ elem(m_Ack(X17,X18),queue(host(X17)))
| setIn(X17,pids) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom])])])]) ).
cnf(c_0_57,negated_conjecture,
( ~ elem(m_Down(X1),queue(host(esk10_0)))
| ~ setIn(esk10_0,alive)
| host(X1) != nbr_proc ),
inference(sr,[status(thm)],[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_48,c_0_49]),c_0_18]),c_0_31]),c_0_50]),c_0_18]),c_0_51]),c_0_18]),c_0_31]),c_0_50]),c_0_52])]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk10_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_54]),c_0_55]) ).
cnf(c_0_59,plain,
( ~ elem(m_Ack(X1,X2),queue(host(X1)))
| setIn(X1,pids) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( esk10_0 = esk5_0
| setIn(esk10_0,alive) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_61,negated_conjecture,
~ setIn(esk10_0,alive),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_50])]) ).
cnf(c_0_62,negated_conjecture,
setIn(esk10_0,pids),
inference(spm,[status(thm)],[c_0_59,c_0_49]) ).
cnf(c_0_63,negated_conjecture,
esk10_0 = esk5_0,
inference(sr,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
~ setIn(esk5_0,pids),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV461+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.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:58:14 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 7.67/1.57 % Version: 3.5.1
% 7.67/1.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.67/1.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.67/1.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.67/1.57 % Starting new_bool_3 with 300s (1) cores
% 7.67/1.57 % Starting new_bool_1 with 300s (1) cores
% 7.67/1.57 % Starting sh5l with 300s (1) cores
% 7.67/1.57 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2740402 completed with status 0
% 7.67/1.57 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.67/1.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.67/1.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.67/1.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.67/1.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.67/1.57 % No SInE strategy applied
% 7.67/1.57 % Search class: FGHSM-FFMM31-MFFFFFNN
% 7.67/1.57 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 7.67/1.57 % Starting SubtermCWHack with 136s (1) cores
% 7.67/1.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.67/1.57 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 7.67/1.57 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 7.67/1.57 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 7.67/1.57 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 2740413 completed with status 0
% 7.67/1.57 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.67/1.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.67/1.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.67/1.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.67/1.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.67/1.57 % No SInE strategy applied
% 7.67/1.57 % Search class: FGHSM-FFMM31-MFFFFFNN
% 7.67/1.57 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 7.67/1.57 % Starting SubtermCWHack with 136s (1) cores
% 7.67/1.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.67/1.57 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 7.67/1.57 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 7.67/1.57 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 7.67/1.57 % Preprocessing time : 0.003 s
% 7.67/1.57
% 7.67/1.57 % Proof found!
% 7.67/1.57 % SZS status Theorem
% 7.67/1.57 % SZS output start CNFRefutation
% See solution above
% 7.67/1.57 % Parsed axioms : 67
% 7.67/1.57 % Removed by relevancy pruning/SinE : 0
% 7.67/1.57 % Initial clauses : 136
% 7.67/1.57 % Removed in clause preprocessing : 6
% 7.67/1.57 % Initial clauses in saturation : 130
% 7.67/1.57 % Processed clauses : 8150
% 7.67/1.57 % ...of these trivial : 94
% 7.67/1.57 % ...subsumed : 6371
% 7.67/1.57 % ...remaining for further processing : 1685
% 7.67/1.57 % Other redundant clauses eliminated : 13
% 7.67/1.57 % Clauses deleted for lack of memory : 0
% 7.67/1.57 % Backward-subsumed : 118
% 7.67/1.57 % Backward-rewritten : 221
% 7.67/1.57 % Generated clauses : 67831
% 7.67/1.57 % ...of the previous two non-redundant : 59712
% 7.67/1.57 % ...aggressively subsumed : 0
% 7.67/1.57 % Contextual simplify-reflections : 36
% 7.67/1.57 % Paramodulations : 67648
% 7.67/1.57 % Factorizations : 14
% 7.67/1.57 % NegExts : 0
% 7.67/1.57 % Equation resolutions : 145
% 7.67/1.57 % Disequality decompositions : 0
% 7.67/1.57 % Total rewrite steps : 22136
% 7.67/1.57 % ...of those cached : 21778
% 7.67/1.57 % Propositional unsat checks : 0
% 7.67/1.57 % Propositional check models : 0
% 7.67/1.57 % Propositional check unsatisfiable : 0
% 7.67/1.57 % Propositional clauses : 0
% 7.67/1.57 % Propositional clauses after purity: 0
% 7.67/1.57 % Propositional unsat core size : 0
% 7.67/1.57 % Propositional preprocessing time : 0.000
% 7.67/1.57 % Propositional encoding time : 0.000
% 7.67/1.57 % Propositional solver time : 0.000
% 7.67/1.57 % Success case prop preproc time : 0.000
% 7.67/1.57 % Success case prop encoding time : 0.000
% 7.67/1.57 % Success case prop solver time : 0.000
% 7.67/1.57 % Current number of processed clauses : 1331
% 7.67/1.57 % Positive orientable unit clauses : 70
% 7.67/1.57 % Positive unorientable unit clauses: 0
% 7.67/1.57 % Negative unit clauses : 114
% 7.67/1.57 % Non-unit-clauses : 1147
% 7.67/1.57 % Current number of unprocessed clauses: 51263
% 7.67/1.57 % ...number of literals in the above : 216067
% 7.67/1.57 % Current number of archived formulas : 0
% 7.67/1.57 % Current number of archived clauses : 340
% 7.67/1.57 % Clause-clause subsumption calls (NU) : 1221269
% 7.67/1.57 % Rec. Clause-clause subsumption calls : 265992
% 7.67/1.57 % Non-unit clause-clause subsumptions : 2374
% 7.67/1.57 % Unit Clause-clause subsumption calls : 18080
% 7.67/1.57 % Rewrite failures with RHS unbound : 0
% 7.67/1.57 % BW rewrite match attempts : 64
% 7.67/1.57 % BW rewrite match successes : 9
% 7.67/1.57 % Condensation attempts : 0
% 7.67/1.57 % Condensation successes : 0
% 7.67/1.57 % Termbank termtop insertions : 913156
% 7.67/1.57 % Search garbage collected termcells : 2106
% 7.67/1.57
% 7.67/1.57 % -------------------------------------------------
% 7.67/1.57 % User time : 1.038 s
% 7.67/1.57 % System time : 0.041 s
% 7.67/1.57 % Total time : 1.080 s
% 7.67/1.57 % Maximum resident set size: 3992 pages
% 7.67/1.57
% 7.67/1.57 % -------------------------------------------------
% 7.67/1.57 % User time : 4.882 s
% 7.67/1.57 % System time : 0.172 s
% 7.67/1.57 % Total time : 5.054 s
% 7.67/1.57 % Maximum resident set size: 4608 pages
% 7.67/1.57 % E exiting
%------------------------------------------------------------------------------