%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV465+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 : n014.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 102.47s 15.38s
% Output : CNFRefutation 102.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 69 ( 43 unt; 0 def)
% Number of atoms : 593 ( 243 equ)
% Maximal formula atoms : 114 ( 8 avg)
% Number of connectives : 767 ( 243 ~; 157 |; 280 &)
% ( 4 <=>; 83 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 18 con; 0-7 aty)
% Number of variables : 326 ( 35 sgn 260 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( queue(host(X5)) = cons(m_NormQ(X13),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) )
=> ( setIn(X5,alive)
=> ( index(status,host(X5)) != norm
=> ! [X6,X7,X17,X18] :
( host(X13) = host(X18)
=> ( host(X5) = host(X18)
=> ( ( host(X17) = s(index(pendack,host(X18)))
& host(X7) = index(pendack,host(X18))
& index(status,host(X18)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Ack(X18,X7),snoc(X12,m_NotNorm(X13)))
& elem(m_Down(X17),snoc(X12,m_NotNorm(X13)))
& setIn(X18,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_44,axiom,
! [X5,X6,X4] : snoc(cons(X5,X4),X6) = cons(X5,snoc(X4,X6)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_44) ).
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_19,axiom,
! [X5,X6] : m_Down(X5) != m_NotNorm(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_19) ).
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_13,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_NotNorm(X7),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_13) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(c_0_9,negated_conjecture,
~ ! [X12,X13,X5] :
( ( queue(host(X5)) = cons(m_NormQ(X13),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) )
=> ( setIn(X5,alive)
=> ( index(status,host(X5)) != norm
=> ! [X6,X7,X17,X18] :
( host(X13) = host(X18)
=> ( host(X5) = host(X18)
=> ( ( host(X17) = s(index(pendack,host(X18)))
& host(X7) = index(pendack,host(X18))
& index(status,host(X18)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Ack(X18,X7),snoc(X12,m_NotNorm(X13)))
& elem(m_Down(X17),snoc(X12,m_NotNorm(X13)))
& setIn(X18,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_10,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
<=> ( queue(host(X5)) = cons(m_NormQ(X13),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) ) ),
introduced(definition) ).
fof(c_0_11,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X12,X13,X5)
=> ( setIn(X5,alive)
=> ( index(status,host(X5)) != norm
=> ! [X6,X7,X17,X18] :
( host(X13) = host(X18)
=> ( host(X5) = host(X18)
=> ( ( host(X17) = s(index(pendack,host(X18)))
& host(X7) = index(pendack,host(X18))
& index(status,host(X18)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Ack(X18,X7),snoc(X12,m_NotNorm(X13)))
& elem(m_Down(X17),snoc(X12,m_NotNorm(X13)))
& setIn(X18,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9]),c_0_10]) ).
fof(c_0_12,plain,
! [X5,X13,X12] :
( epred1_3(X12,X13,X5)
=> ( queue(host(X5)) = cons(m_NormQ(X13),X12)
& ! [X6,X7,X15,X14] :
( ( host(X15) = s(index(pendack,host(X14)))
& host(X7) = index(pendack,host(X14))
& index(status,host(X14)) = elec_2
& leq(nbr_proc,s(index(pendack,host(X14))))
& elem(m_Down(X15),queue(host(X14)))
& elem(m_Ack(X14,X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7,X15,X14] :
( ( index(status,host(X14)) = elec_1
& host(X14) = nbr_proc
& host(X14) = host(X7)
& elem(m_Down(X15),queue(host(X14)))
& ! [X16] :
( ( leq(s(zero),X16)
& ~ leq(host(X14),X16) )
=> ( X16 = host(X15)
| setIn(X16,index(down,host(X14))) ) ) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& elem(m_Halt(X14),queue(host(X7)))
& setIn(X14,alive)
& ~ leq(index(pendack,host(X14)),host(X6)) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( index(status,host(X14)) = elec_2
& index(status,host(X6)) = elec_2
& host(X14) = host(X7)
& setIn(X14,alive)
& setIn(X6,alive) )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7,X14] :
( ( host(X7) = host(X6)
& elem(m_Down(X7),queue(host(X14)))
& setIn(X14,alive) )
=> ~ ( index(status,host(X6)) = norm
& index(ldr,host(X6)) = host(X6)
& setIn(X6,alive) ) )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_2
& index(status,host(X6)) = elec_2
& setIn(X7,alive)
& setIn(X6,alive)
& ~ leq(host(X6),host(X7)) )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6] :
( ( setIn(X6,alive)
& ( index(status,host(X6)) = elec_2
| index(status,host(X6)) = elec_1 ) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( index(status,host(X7)) = elec_1
& setIn(X7,alive) )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6,X7] :
( ( elem(m_Ack(X7,X6),queue(host(X7)))
& setIn(X7,alive) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( host(X7) = host(X6)
& X7 != X6 )
=> ( ~ setIn(X7,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_10]) ).
fof(c_0_13,negated_conjecture,
( index(status,host(esk8_0)) = norm
& index(ldr,host(esk8_0)) = host(esk8_0)
& setIn(esk8_0,alive)
& host(esk10_0) = s(index(pendack,host(esk11_0)))
& host(esk9_0) = index(pendack,host(esk11_0))
& index(status,host(esk11_0)) = elec_2
& leq(nbr_proc,s(index(pendack,host(esk11_0))))
& elem(m_Ack(esk11_0,esk9_0),snoc(esk5_0,m_NotNorm(esk6_0)))
& elem(m_Down(esk10_0),snoc(esk5_0,m_NotNorm(esk6_0)))
& setIn(esk11_0,alive)
& host(esk7_0) = host(esk11_0)
& host(esk6_0) = host(esk11_0)
& index(status,host(esk7_0)) != norm
& setIn(esk7_0,alive)
& epred1_3(esk5_0,esk6_0,esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_14,plain,
! [X99,X100,X101] :
( ( elem(X99,cons(X100,X101))
| ~ elem(X99,X101) )
& ( elem(X99,cons(X100,X101))
| X99 != X100 )
& ( elem(X99,X101)
| X99 = X100
| ~ elem(X99,cons(X100,X101)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_15,plain,
! [X95,X96,X97] : snoc(cons(X95,X97),X96) = cons(X95,snoc(X97,X96)),
inference(variable_rename,[status(thm)],[axiom_44]) ).
fof(c_0_16,plain,
! [X155,X156,X157,X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179,X180,X181,X182,X183,X184,X185,X186,X187,X188,X189,X190,X192,X193,X194,X195] :
( ( ~ epred1_3(X157,X156,X155)
| queue(host(X155)) = cons(m_NormQ(X156),X157) )
& ( ~ epred1_3(X157,X156,X155)
| index(status,host(X195)) != norm
| index(ldr,host(X195)) != host(X195)
| ~ setIn(X195,alive)
| host(X193) != s(index(pendack,host(X194)))
| host(X192) != index(pendack,host(X194))
| index(status,host(X194)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X194))))
| ~ elem(m_Down(X193),queue(host(X194)))
| ~ elem(m_Ack(X194,X192),queue(host(X194)))
| ~ setIn(X194,alive) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| esk12_7(X155,X156,X157,X187,X188,X189,X190) != host(X189) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| ~ setIn(esk12_7(X155,X156,X157,X187,X188,X189,X190),index(down,host(X190))) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| leq(s(zero),esk12_7(X155,X156,X157,X187,X188,X189,X190)) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Down(X188),queue(host(X187)))
| ~ setIn(X187,alive)
| index(status,host(X190)) != elec_1
| host(X190) != nbr_proc
| host(X190) != host(X188)
| ~ elem(m_Down(X189),queue(host(X190)))
| ~ leq(host(X190),esk12_7(X155,X156,X157,X187,X188,X189,X190)) )
& ( ~ epred1_3(X157,X156,X155)
| index(status,host(X184)) != norm
| index(ldr,host(X184)) != host(X184)
| ~ setIn(X184,alive)
| index(status,host(X186)) != elec_2
| ~ elem(m_Halt(X186),queue(host(X185)))
| ~ setIn(X186,alive)
| leq(index(pendack,host(X186)),host(X184)) )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(index(pendack,host(X182)),index(pendack,host(X183)))
| index(status,host(X183)) != elec_2
| index(status,host(X182)) != elec_2
| ~ setIn(X183,alive)
| ~ setIn(X182,alive)
| leq(host(X182),host(X183)) )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Ack(X179,X180),queue(host(X179)))
| index(status,host(X181)) != elec_2
| index(status,host(X179)) != elec_2
| host(X181) != host(X180)
| ~ setIn(X181,alive)
| ~ setIn(X179,alive) )
& ( ~ epred1_3(X157,X156,X155)
| index(status,host(X176)) != norm
| index(ldr,host(X176)) != host(X176)
| ~ setIn(X176,alive)
| host(X177) != host(X176)
| ~ elem(m_Down(X177),queue(host(X178)))
| ~ setIn(X178,alive) )
& ( ~ epred1_3(X157,X156,X155)
| leq(index(pendack,host(X175)),host(X174))
| index(status,host(X175)) != elec_2
| index(status,host(X174)) != elec_2
| ~ setIn(X175,alive)
| ~ setIn(X174,alive)
| leq(host(X174),host(X175)) )
& ( ~ epred1_3(X157,X156,X155)
| index(elid,host(X173)) = X173
| ~ setIn(X173,alive)
| index(status,host(X173)) != elec_2 )
& ( ~ epred1_3(X157,X156,X155)
| index(elid,host(X173)) = X173
| ~ setIn(X173,alive)
| index(status,host(X173)) != elec_1 )
& ( ~ epred1_3(X157,X156,X155)
| ~ elem(m_Ack(X172,X171),queue(host(X172)))
| index(status,host(X172)) != elec_1
| ~ setIn(X172,alive) )
& ( ~ epred1_3(X157,X156,X155)
| leq(host(X169),index(pendack,host(X170)))
| ~ elem(m_Ack(X170,X169),queue(host(X170)))
| ~ setIn(X170,alive) )
& ( ~ epred1_3(X157,X156,X155)
| ~ setIn(X168,alive)
| ~ setIn(X167,alive)
| host(X168) != host(X167)
| X168 = X167 )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(host(X164),host(X166))
| ~ elem(m_Ack(X166,X164),queue(host(X165))) )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(host(X162),host(X163))
| ~ elem(m_Halt(X163),queue(host(X162))) )
& ( ~ epred1_3(X157,X156,X155)
| host(X161) != host(X160)
| ~ elem(m_Down(X161),queue(host(X160))) )
& ( ~ epred1_3(X157,X156,X155)
| ~ leq(host(X158),host(X159))
| ~ elem(m_Ldr(X159),queue(host(X158))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
host(esk10_0) = s(index(pendack,host(esk11_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
host(esk9_0) = index(pendack,host(esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X102,X103,X104] :
( ( elem(X102,snoc(X104,X103))
| ~ elem(X102,X104) )
& ( elem(X102,snoc(X104,X103))
| X102 != X103 )
& ( elem(X102,X104)
| X102 = X103
| ~ elem(X102,snoc(X104,X103)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
cnf(c_0_20,plain,
( ~ elem(X1,X2)
| elem(X1,cons(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
snoc(cons(X1,X2),X3) = cons(X1,snoc(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X5,X6] : m_Down(X5) != m_NotNorm(X6),
inference(fof_simplification,[status(thm)],[axiom_19]) ).
cnf(c_0_23,plain,
( ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive)
| index(status,host(X1)) != elec_2
| index(elid,host(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk11_0,alive),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
index(status,host(esk11_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_26,plain,
! [X138,X139] :
( ( X138 != X139
| leq(X139,X138) )
& ( X138 != X139
| leq(X138,X139) )
& ( X138 = X139
| ~ leq(X139,X138)
| ~ leq(X138,X139) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
cnf(c_0_27,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk11_0)))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
s(host(esk9_0)) = host(esk10_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_29,plain,
! [X24] : leq(host(X24),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_30,plain,
( ~ elem(X1,snoc(X2,X3))
| elem(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( ~ elem(X1,snoc(X3,X4))
| elem(X1,snoc(cons(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_32,plain,
! [X46,X47] : m_Down(X46) != m_NotNorm(X47),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
fof(c_0_33,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_NotNorm(X7),
inference(fof_simplification,[status(thm)],[axiom_13]) ).
cnf(c_0_34,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| index(elid,host(esk11_0)) = esk11_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_35,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_36,plain,
( ~ epred1_3(X5,X6,X7)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| host(X3) != s(index(pendack,host(X1)))
| host(X2) != index(pendack,host(X1))
| index(status,host(X1)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Ack(X1,X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,negated_conjecture,
index(ldr,host(esk8_0)) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,negated_conjecture,
index(status,host(esk8_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41,negated_conjecture,
leq(nbr_proc,host(esk10_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_18]),c_0_28]) ).
cnf(c_0_42,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_43,plain,
! [X135] : leq(X135,X135),
inference(variable_rename,[status(thm)],[axiom_59]) ).
cnf(c_0_44,plain,
( ~ elem(X1,snoc(X4,X2))
| elem(X1,cons(X3,X4))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_45,negated_conjecture,
elem(m_Down(esk10_0),snoc(esk5_0,m_NotNorm(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,plain,
m_Down(X1) != m_NotNorm(X2),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_47,plain,
( ~ epred1_3(X3,X2,X1)
| queue(host(X1)) = cons(m_NormQ(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_48,negated_conjecture,
host(esk7_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_49,plain,
! [X31,X32,X33] : m_Ack(X31,X32) != m_NotNorm(X33),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_33])]) ).
cnf(c_0_50,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_51,negated_conjecture,
index(elid,host(esk11_0)) = esk11_0,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_52,negated_conjecture,
( ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ setIn(X2,alive)
| ~ leq(nbr_proc,s(index(pendack,host(X2))))
| ~ epred1_3(X4,X5,X6)
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| host(X1) != s(index(pendack,host(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_53,negated_conjecture,
host(esk10_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_54,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_55,negated_conjecture,
elem(m_Down(esk10_0),cons(X1,esk5_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_56,negated_conjecture,
cons(m_NormQ(esk6_0),esk5_0) = queue(host(esk11_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_48]) ).
cnf(c_0_57,negated_conjecture,
elem(m_Ack(esk11_0,esk9_0),snoc(esk5_0,m_NotNorm(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_58,plain,
m_Ack(X1,X2) != m_NotNorm(X3),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_59,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| esk7_0 = esk11_0 ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_50]),c_0_48]),c_0_48]),c_0_25])]),c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( ~ elem(m_Down(X2),queue(host(esk11_0)))
| ~ elem(m_Ack(esk11_0,X1),queue(host(esk11_0)))
| ~ epred1_3(X3,X4,X5)
| host(X2) != nbr_proc
| host(X1) != host(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_24]),c_0_18]),c_0_28]),c_0_53]),c_0_18]),c_0_25]),c_0_18]),c_0_28]),c_0_53]),c_0_54])]) ).
cnf(c_0_61,negated_conjecture,
elem(m_Down(esk10_0),queue(host(esk11_0))),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
elem(m_Ack(esk11_0,esk9_0),cons(X1,esk5_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_57]),c_0_58]) ).
cnf(c_0_63,negated_conjecture,
esk7_0 = esk11_0,
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_64,negated_conjecture,
( ~ elem(m_Ack(esk11_0,X1),queue(host(esk11_0)))
| ~ epred1_3(X2,X3,X4)
| host(X1) != host(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_53]),c_0_61])]) ).
cnf(c_0_65,negated_conjecture,
elem(m_Ack(esk11_0,esk9_0),queue(host(esk11_0))),
inference(spm,[status(thm)],[c_0_62,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk11_0),
inference(rw,[status(thm)],[c_0_35,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_64]),c_0_65])]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_66,c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV465+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:52:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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
% 102.47/15.38 % Version: 3.5.1
% 102.47/15.38 % Preprocessing class: FSLSSMSMSSSNFFN.
% 102.47/15.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 102.47/15.38 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 102.47/15.38 % Starting new_bool_3 with 300s (1) cores
% 102.47/15.38 % Starting new_bool_1 with 300s (1) cores
% 102.47/15.38 % Starting sh5l with 300s (1) cores
% 102.47/15.38 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3695166 completed with status 0
% 102.47/15.38 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 102.47/15.38 % Preprocessing class: FSLSSMSMSSSNFFN.
% 102.47/15.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 102.47/15.38 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 102.47/15.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 102.47/15.38 % No SInE strategy applied
% 102.47/15.38 % Search class: FGHSM-FFMM31-MFFFFFNN
% 102.47/15.38 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 102.47/15.38 % Starting SubtermCWHack with 136s (1) cores
% 102.47/15.38 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 102.47/15.38 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 102.47/15.38 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 102.47/15.38 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 102.47/15.38 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 3695172 completed with status 0
% 102.47/15.38 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 102.47/15.38 % Preprocessing class: FSLSSMSMSSSNFFN.
% 102.47/15.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 102.47/15.38 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 102.47/15.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 102.47/15.38 % No SInE strategy applied
% 102.47/15.38 % Search class: FGHSM-FFMM31-MFFFFFNN
% 102.47/15.38 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 102.47/15.38 % Starting SubtermCWHack with 136s (1) cores
% 102.47/15.38 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 102.47/15.38 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 102.47/15.38 % Preprocessing time : 0.003 s
% 102.47/15.38 % Presaturation interreduction done
% 102.47/15.38
% 102.47/15.38 % Proof found!
% 102.47/15.38 % SZS status Theorem
% 102.47/15.38 % SZS output start CNFRefutation
% See solution above
% 102.47/15.38 % Parsed axioms : 67
% 102.47/15.38 % Removed by relevancy pruning/SinE : 0
% 102.47/15.38 % Initial clauses : 131
% 102.47/15.38 % Removed in clause preprocessing : 6
% 102.47/15.38 % Initial clauses in saturation : 125
% 102.47/15.38 % Processed clauses : 44427
% 102.47/15.38 % ...of these trivial : 456
% 102.47/15.38 % ...subsumed : 39874
% 102.47/15.38 % ...remaining for further processing : 4097
% 102.47/15.38 % Other redundant clauses eliminated : 7
% 102.47/15.38 % Clauses deleted for lack of memory : 0
% 102.47/15.38 % Backward-subsumed : 438
% 102.47/15.38 % Backward-rewritten : 47
% 102.47/15.38 % Generated clauses : 851261
% 102.47/15.38 % ...of the previous two non-redundant : 525890
% 102.47/15.38 % ...aggressively subsumed : 0
% 102.47/15.38 % Contextual simplify-reflections : 0
% 102.47/15.38 % Paramodulations : 851052
% 102.47/15.38 % Factorizations : 158
% 102.47/15.38 % NegExts : 0
% 102.47/15.38 % Equation resolutions : 50
% 102.47/15.38 % Disequality decompositions : 0
% 102.47/15.38 % Total rewrite steps : 470770
% 102.47/15.38 % ...of those cached : 470156
% 102.47/15.38 % Propositional unsat checks : 0
% 102.47/15.38 % Propositional check models : 0
% 102.47/15.38 % Propositional check unsatisfiable : 0
% 102.47/15.38 % Propositional clauses : 0
% 102.47/15.38 % Propositional clauses after purity: 0
% 102.47/15.38 % Propositional unsat core size : 0
% 102.47/15.38 % Propositional preprocessing time : 0.000
% 102.47/15.38 % Propositional encoding time : 0.000
% 102.47/15.38 % Propositional solver time : 0.000
% 102.47/15.38 % Success case prop preproc time : 0.000
% 102.47/15.38 % Success case prop encoding time : 0.000
% 102.47/15.38 % Success case prop solver time : 0.000
% 102.47/15.38 % Current number of processed clauses : 3484
% 102.47/15.38 % Positive orientable unit clauses : 173
% 102.47/15.38 % Positive unorientable unit clauses: 0
% 102.47/15.38 % Negative unit clauses : 238
% 102.47/15.38 % Non-unit-clauses : 3073
% 102.47/15.38 % Current number of unprocessed clauses: 479618
% 102.47/15.38 % ...number of literals in the above : 1597539
% 102.47/15.38 % Current number of archived formulas : 0
% 102.47/15.38 % Current number of archived clauses : 606
% 102.47/15.38 % Clause-clause subsumption calls (NU) : 6429424
% 102.47/15.38 % Rec. Clause-clause subsumption calls : 3714412
% 102.47/15.38 % Non-unit clause-clause subsumptions : 17943
% 102.47/15.38 % Unit Clause-clause subsumption calls : 105100
% 102.47/15.38 % Rewrite failures with RHS unbound : 0
% 102.47/15.38 % BW rewrite match attempts : 2217
% 102.47/15.38 % BW rewrite match successes : 38
% 102.47/15.38 % Condensation attempts : 0
% 102.47/15.38 % Condensation successes : 0
% 102.47/15.38 % Termbank termtop insertions : 14687257
% 102.47/15.38 % Search garbage collected termcells : 1971
% 102.47/15.38
% 102.47/15.38 % -------------------------------------------------
% 102.47/15.38 % User time : 14.296 s
% 102.47/15.38 % System time : 0.366 s
% 102.47/15.38 % Total time : 14.662 s
% 102.47/15.38 % Maximum resident set size: 3988 pages
% 102.47/15.38
% 102.47/15.38 % -------------------------------------------------
% 102.47/15.38 % User time : 70.528 s
% 102.47/15.38 % System time : 2.092 s
% 102.47/15.38 % Total time : 72.620 s
% 102.47/15.38 % Maximum resident set size: 4864 pages
% 102.47/15.38 % E exiting
%------------------------------------------------------------------------------