%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV463+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 : n007.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 1.25s 0.61s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 34 unt; 0 def)
% Number of atoms : 600 ( 248 equ)
% Maximal formula atoms : 114 ( 10 avg)
% Number of connectives : 794 ( 251 ~; 156 |; 289 &)
% ( 6 <=>; 92 =>; 0 <=; 0 <~>)
% Maximal formula depth : 72 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-4 aty)
% Number of functors : 32 ( 32 usr; 21 con; 0-8 aty)
% Number of variables : 294 ( 14 sgn 265 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Ack(X13,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)
=> ( ( host(X6) = index(pendack,host(X5))
& index(status,host(X5)) = elec_2
& index(elid,host(X5)) = X13 )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( host(X7) = host(X6)
| 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) )
=> ~ ( index(status,host(X17)) = norm
& index(ldr,host(X17)) = host(X17)
& setIn(X17,alive) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
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_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_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Ack(X13,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)
=> ( ( host(X6) = index(pendack,host(X5))
& index(status,host(X5)) = elec_2
& index(elid,host(X5)) = X13 )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( host(X7) = host(X6)
| 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) )
=> ~ ( index(status,host(X17)) = norm
& index(ldr,host(X17)) = host(X17)
& setIn(X17,alive) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_8,plain,
! [X6,X5,X13,X12] :
( epred1_4(X12,X13,X5,X6)
<=> ( queue(host(X5)) = cons(m_Ack(X13,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_4(X12,X13,X5,X6)
=> ( setIn(X5,alive)
=> ( ( host(X6) = index(pendack,host(X5))
& index(status,host(X5)) = elec_2
& index(elid,host(X5)) = X13 )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( host(X7) = host(X6)
| 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) )
=> ~ ( index(status,host(X17)) = norm
& index(ldr,host(X17)) = 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,plain,
! [X6,X5,X13,X12] :
( epred1_4(X12,X13,X5,X6)
=> ( queue(host(X5)) = cons(m_Ack(X13,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_11,negated_conjecture,
( index(status,host(esk10_0)) = norm
& index(ldr,host(esk10_0)) = host(esk10_0)
& setIn(esk10_0,alive)
& host(esk12_0) = s(index(pendack,host(esk13_0)))
& host(esk11_0) = index(pendack,host(esk13_0))
& index(status,host(esk13_0)) = elec_2
& elem(m_Ack(esk13_0,esk11_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0)))
& elem(m_Down(esk12_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0)))
& leq(nbr_proc,s(index(pendack,host(esk13_0))))
& setIn(esk13_0,alive)
& host(esk7_0) != host(esk13_0)
& host(esk9_0) = host(esk13_0)
& host(esk7_0) != host(esk10_0)
& ( host(esk9_0) = host(esk8_0)
| setIn(host(esk9_0),index(acks,host(esk7_0))) )
& leq(nbr_proc,index(pendack,host(esk7_0)))
& host(esk8_0) = index(pendack,host(esk7_0))
& index(status,host(esk7_0)) = elec_2
& index(elid,host(esk7_0)) = esk6_0
& setIn(esk7_0,alive)
& epred1_4(esk5_0,esk6_0,esk7_0,esk8_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_12,plain,
! [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,X194,X195,X197,X198,X199,X200] :
( ( ~ epred1_4(X162,X161,X160,X159)
| queue(host(X160)) = cons(m_Ack(X161,X159),X162) )
& ( ~ epred1_4(X162,X161,X160,X159)
| index(status,host(X200)) != norm
| index(ldr,host(X200)) != host(X200)
| ~ setIn(X200,alive)
| host(X198) != s(index(pendack,host(X199)))
| host(X197) != index(pendack,host(X199))
| index(status,host(X199)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X199))))
| ~ elem(m_Ack(X199,X197),queue(host(X199)))
| ~ elem(m_Down(X198),queue(host(X199)))
| ~ setIn(X199,alive) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ elem(m_Down(X193),queue(host(X192)))
| ~ setIn(X192,alive)
| index(status,host(X195)) != elec_1
| host(X195) != host(X193)
| host(X195) != nbr_proc
| ~ elem(m_Down(X194),queue(host(X195)))
| esk14_8(X159,X160,X161,X162,X192,X193,X194,X195) != host(X194) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ elem(m_Down(X193),queue(host(X192)))
| ~ setIn(X192,alive)
| index(status,host(X195)) != elec_1
| host(X195) != host(X193)
| host(X195) != nbr_proc
| ~ elem(m_Down(X194),queue(host(X195)))
| ~ setIn(esk14_8(X159,X160,X161,X162,X192,X193,X194,X195),index(down,host(X195))) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ elem(m_Down(X193),queue(host(X192)))
| ~ setIn(X192,alive)
| index(status,host(X195)) != elec_1
| host(X195) != host(X193)
| host(X195) != nbr_proc
| ~ elem(m_Down(X194),queue(host(X195)))
| leq(s(zero),esk14_8(X159,X160,X161,X162,X192,X193,X194,X195)) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ elem(m_Down(X193),queue(host(X192)))
| ~ setIn(X192,alive)
| index(status,host(X195)) != elec_1
| host(X195) != host(X193)
| host(X195) != nbr_proc
| ~ elem(m_Down(X194),queue(host(X195)))
| ~ leq(host(X195),esk14_8(X159,X160,X161,X162,X192,X193,X194,X195)) )
& ( ~ epred1_4(X162,X161,X160,X159)
| index(status,host(X189)) != norm
| index(ldr,host(X189)) != host(X189)
| ~ setIn(X189,alive)
| index(status,host(X191)) != elec_2
| ~ elem(m_Halt(X191),queue(host(X190)))
| ~ setIn(X191,alive)
| leq(index(pendack,host(X191)),host(X189)) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ leq(index(pendack,host(X187)),index(pendack,host(X188)))
| index(status,host(X188)) != elec_2
| index(status,host(X187)) != elec_2
| ~ setIn(X188,alive)
| ~ setIn(X187,alive)
| leq(host(X187),host(X188)) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ elem(m_Ack(X184,X185),queue(host(X184)))
| index(status,host(X186)) != elec_2
| index(status,host(X184)) != elec_2
| host(X186) != host(X185)
| ~ setIn(X186,alive)
| ~ setIn(X184,alive) )
& ( ~ epred1_4(X162,X161,X160,X159)
| leq(index(pendack,host(X183)),host(X182))
| index(status,host(X183)) != elec_2
| index(status,host(X182)) != elec_2
| ~ setIn(X183,alive)
| ~ setIn(X182,alive)
| leq(host(X182),host(X183)) )
& ( ~ epred1_4(X162,X161,X160,X159)
| index(status,host(X179)) != norm
| index(ldr,host(X179)) != host(X179)
| ~ setIn(X179,alive)
| host(X180) != host(X179)
| ~ elem(m_Down(X180),queue(host(X181)))
| ~ setIn(X181,alive) )
& ( ~ epred1_4(X162,X161,X160,X159)
| index(elid,host(X178)) = X178
| ~ setIn(X178,alive)
| index(status,host(X178)) != elec_2 )
& ( ~ epred1_4(X162,X161,X160,X159)
| index(elid,host(X178)) = X178
| ~ setIn(X178,alive)
| index(status,host(X178)) != elec_1 )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ elem(m_Ack(X177,X176),queue(host(X177)))
| index(status,host(X177)) != elec_1
| ~ setIn(X177,alive) )
& ( ~ epred1_4(X162,X161,X160,X159)
| leq(host(X174),index(pendack,host(X175)))
| ~ elem(m_Ack(X175,X174),queue(host(X175)))
| ~ setIn(X175,alive) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ setIn(X173,alive)
| ~ setIn(X172,alive)
| host(X173) != host(X172)
| X173 = X172 )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ leq(host(X169),host(X171))
| ~ elem(m_Ack(X171,X169),queue(host(X170))) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ leq(host(X167),host(X168))
| ~ elem(m_Halt(X168),queue(host(X167))) )
& ( ~ epred1_4(X162,X161,X160,X159)
| host(X166) != host(X165)
| ~ elem(m_Down(X166),queue(host(X165))) )
& ( ~ epred1_4(X162,X161,X160,X159)
| ~ leq(host(X163),host(X164))
| ~ elem(m_Ldr(X164),queue(host(X163))) ) ),
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_10])])])])])])]) ).
fof(c_0_13,plain,
( ~ epred3_0
<=> ! [X3,X4,X5,X6] : ~ epred1_4(X3,X4,X5,X6) ),
introduced(definition) ).
fof(c_0_14,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Ldr(X7),
inference(fof_simplification,[status(thm)],[axiom_14]) ).
cnf(c_0_15,negated_conjecture,
host(esk12_0) = s(index(pendack,host(esk13_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
host(esk11_0) = index(pendack,host(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,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) ).
fof(c_0_18,plain,
( ~ epred11_0
<=> ! [X4] :
( index(ldr,host(X4)) != host(X4)
| index(status,host(X4)) != norm
| ~ setIn(X4,alive) ) ),
introduced(definition) ).
cnf(c_0_19,plain,
( ~ epred1_4(X5,X6,X7,X8)
| 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_12]) ).
cnf(c_0_20,plain,
( ~ epred1_4(X1,X2,X3,X4)
| epred3_0 ),
inference(split_equiv,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,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_23,plain,
! [X36,X37,X38] : m_Ack(X36,X37) != m_Ldr(X38),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
fof(c_0_24,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_25,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk13_0)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
s(host(esk11_0)) = host(esk12_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_27,plain,
! [X26] : leq(host(X26),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_28,plain,
( ~ epred3_0
| ~ epred10_0
| ~ epred11_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_17]),c_0_18]),c_0_13]) ).
cnf(c_0_29,negated_conjecture,
epred3_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( ~ setIn(X1,alive)
| index(status,host(X1)) != norm
| index(ldr,host(X1)) != host(X1)
| epred11_0 ),
inference(split_equiv,[status(thm)],[c_0_18]) ).
cnf(c_0_31,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
index(ldr,host(esk10_0)) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
index(status,host(esk10_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_34,plain,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
cnf(c_0_35,plain,
( ~ elem(X1,snoc(X2,X3))
| elem(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Ack(esk13_0,esk11_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,plain,
m_Ack(X1,X2) != m_Ldr(X3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_39,negated_conjecture,
leq(nbr_proc,host(esk12_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_16]),c_0_26]) ).
cnf(c_0_40,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_41,plain,
! [X137] : leq(X137,X137),
inference(variable_rename,[status(thm)],[axiom_59]) ).
cnf(c_0_42,plain,
( ~ epred10_0
| ~ epred11_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_43,negated_conjecture,
epred11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
fof(c_0_44,plain,
! [X46,X47] : m_Down(X46) != m_Ldr(X47),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_34])]) ).
cnf(c_0_45,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_17]) ).
cnf(c_0_46,negated_conjecture,
elem(m_Ack(esk13_0,esk11_0),queue(host(esk13_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_47,negated_conjecture,
host(esk12_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_48,negated_conjecture,
index(status,host(esk13_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,negated_conjecture,
setIn(esk13_0,alive),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_51,plain,
~ epred10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_52,negated_conjecture,
elem(m_Down(esk12_0),snoc(queue(host(esk13_0)),m_Ldr(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_53,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,negated_conjecture,
( ~ elem(m_Down(X1),queue(host(esk13_0)))
| 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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_16]),c_0_26]),c_0_47]),c_0_16]),c_0_48]),c_0_16]),c_0_26]),c_0_47]),c_0_49]),c_0_50])]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
elem(m_Down(esk12_0),queue(host(esk13_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_52]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV463+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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:50:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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
% 1.25/0.61 % Version: 3.5.1
% 1.25/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.25/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.25/0.61 % Starting new_bool_3 with 300s (1) cores
% 1.25/0.61 % Starting new_bool_1 with 300s (1) cores
% 1.25/0.61 % Starting sh5l with 300s (1) cores
% 1.25/0.61 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 702261 completed with status 0
% 1.25/0.61 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.25/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.25/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.25/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.25/0.61 % No SInE strategy applied
% 1.25/0.61 % Search class: FGHSM-FFMM31-MFFFFFNN
% 1.25/0.61 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.25/0.61 % Starting SubtermCWHack with 136s (1) cores
% 1.25/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.25/0.61 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 1.25/0.61 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 1.25/0.61 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 1.25/0.61 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 702272 completed with status 0
% 1.25/0.61 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 1.25/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.25/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.25/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.25/0.61 % No SInE strategy applied
% 1.25/0.61 % Search class: FGHSM-FFMM31-MFFFFFNN
% 1.25/0.61 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.25/0.61 % Starting SubtermCWHack with 136s (1) cores
% 1.25/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.25/0.61 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 1.25/0.61 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 1.25/0.61 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 1.25/0.61 % Preprocessing time : 0.003 s
% 1.25/0.61
% 1.25/0.61 % Proof found!
% 1.25/0.61 % SZS status Theorem
% 1.25/0.61 % SZS output start CNFRefutation
% See solution above
% 1.25/0.61 % Parsed axioms : 67
% 1.25/0.61 % Removed by relevancy pruning/SinE : 0
% 1.25/0.61 % Initial clauses : 136
% 1.25/0.61 % Removed in clause preprocessing : 6
% 1.25/0.61 % Initial clauses in saturation : 130
% 1.25/0.61 % Processed clauses : 887
% 1.25/0.61 % ...of these trivial : 23
% 1.25/0.61 % ...subsumed : 415
% 1.25/0.61 % ...remaining for further processing : 449
% 1.25/0.61 % Other redundant clauses eliminated : 8
% 1.25/0.61 % Clauses deleted for lack of memory : 0
% 1.25/0.61 % Backward-subsumed : 10
% 1.25/0.61 % Backward-rewritten : 18
% 1.25/0.61 % Generated clauses : 2949
% 1.25/0.61 % ...of the previous two non-redundant : 2661
% 1.25/0.61 % ...aggressively subsumed : 0
% 1.25/0.61 % Contextual simplify-reflections : 3
% 1.25/0.61 % Paramodulations : 2874
% 1.25/0.61 % Factorizations : 2
% 1.25/0.61 % NegExts : 0
% 1.25/0.61 % Equation resolutions : 54
% 1.25/0.61 % Disequality decompositions : 0
% 1.25/0.61 % Total rewrite steps : 684
% 1.25/0.61 % ...of those cached : 593
% 1.25/0.61 % Propositional unsat checks : 0
% 1.25/0.61 % Propositional check models : 0
% 1.25/0.61 % Propositional check unsatisfiable : 0
% 1.25/0.61 % Propositional clauses : 0
% 1.25/0.61 % Propositional clauses after purity: 0
% 1.25/0.61 % Propositional unsat core size : 0
% 1.25/0.61 % Propositional preprocessing time : 0.000
% 1.25/0.61 % Propositional encoding time : 0.000
% 1.25/0.61 % Propositional solver time : 0.000
% 1.25/0.61 % Success case prop preproc time : 0.000
% 1.25/0.61 % Success case prop encoding time : 0.000
% 1.25/0.61 % Success case prop solver time : 0.000
% 1.25/0.61 % Current number of processed clauses : 408
% 1.25/0.61 % Positive orientable unit clauses : 56
% 1.25/0.61 % Positive unorientable unit clauses: 0
% 1.25/0.61 % Negative unit clauses : 88
% 1.25/0.61 % Non-unit-clauses : 264
% 1.25/0.61 % Current number of unprocessed clauses: 1864
% 1.25/0.61 % ...number of literals in the above : 6998
% 1.25/0.61 % Current number of archived formulas : 0
% 1.25/0.61 % Current number of archived clauses : 29
% 1.25/0.61 % Clause-clause subsumption calls (NU) : 33660
% 1.25/0.61 % Rec. Clause-clause subsumption calls : 12328
% 1.25/0.61 % Non-unit clause-clause subsumptions : 180
% 1.25/0.61 % Unit Clause-clause subsumption calls : 4975
% 1.25/0.61 % Rewrite failures with RHS unbound : 0
% 1.25/0.61 % BW rewrite match attempts : 16
% 1.25/0.61 % BW rewrite match successes : 5
% 1.25/0.61 % Condensation attempts : 0
% 1.25/0.61 % Condensation successes : 0
% 1.25/0.61 % Termbank termtop insertions : 46535
% 1.25/0.61 % Search garbage collected termcells : 2081
% 1.25/0.61
% 1.25/0.61 % -------------------------------------------------
% 1.25/0.61 % User time : 0.111 s
% 1.25/0.61 % System time : 0.010 s
% 1.25/0.61 % Total time : 0.121 s
% 1.25/0.61 % Maximum resident set size: 3992 pages
% 1.25/0.61
% 1.25/0.61 % -------------------------------------------------
% 1.25/0.61 % User time : 0.705 s
% 1.25/0.61 % System time : 0.049 s
% 1.25/0.61 % Total time : 0.754 s
% 1.25/0.61 % Maximum resident set size: 4608 pages
% 1.25/0.61 % E exiting
%------------------------------------------------------------------------------