TSTP Solution File: SWV462+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV462+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:24:55 EDT 2024
% Result : Theorem 13.38s 2.20s
% Output : CNFRefutation 13.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 11
% Syntax : Number of formulae : 89 ( 41 unt; 0 def)
% Number of atoms : 574 ( 240 equ)
% Maximal formula atoms : 114 ( 6 avg)
% Number of connectives : 754 ( 269 ~; 195 |; 220 &)
% ( 5 <=>; 65 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 29 ( 29 usr; 18 con; 0-7 aty)
% Number of variables : 334 ( 60 sgn 231 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( ! [X6,X7] :
( elem(m_Ldr(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_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X6,alive)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X6)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X6,X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( setIn(X18,alive)
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& index(status,host(X18)) = elec_2
& host(X7) = index(pendack,host(X18))
& host(X17) = s(index(pendack,host(X18))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> 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_12,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_12) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_32,axiom,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_32) ).
fof(axiom_31,axiom,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_31) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( X5 = s(X6)
| leq(X5,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
fof(c_0_10,plain,
! [X13,X5,X12] :
( epred1_3(X12,X5,X13)
<=> ( ! [X6,X7] :
( elem(m_Ldr(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_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X6,alive)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X6)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X6,X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
introduced(definition) ).
fof(c_0_11,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X12,X5,X13)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( setIn(X18,alive)
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& index(status,host(X18)) = elec_2
& host(X7) = index(pendack,host(X18))
& host(X17) = s(index(pendack,host(X18))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_10]) ).
fof(c_0_12,negated_conjecture,
( epred1_3(esk1_0,esk3_0,esk2_0)
& setIn(esk2_0,alive)
& host(esk2_0) != host(esk4_0)
& host(esk3_0) = host(esk7_0)
& host(esk2_0) != host(esk7_0)
& setIn(esk7_0,alive)
& leq(nbr_proc,s(index(pendack,host(esk7_0))))
& elem(m_Down(esk6_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0)))
& elem(m_Ack(esk7_0,esk5_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0)))
& index(status,host(esk7_0)) = elec_2
& host(esk5_0) = index(pendack,host(esk7_0))
& host(esk6_0) = s(index(pendack,host(esk7_0)))
& setIn(esk4_0,alive)
& index(ldr,host(esk4_0)) = host(esk4_0)
& index(status,host(esk4_0)) = norm ),
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_13,plain,
! [X13,X5,X12] :
( epred1_3(X12,X5,X13)
=> ( ! [X6,X7] :
( elem(m_Ldr(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_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X6,alive)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X6)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X6,X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk7_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
host(esk5_0) = index(pendack,host(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
host(esk6_0) = s(index(pendack,host(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X122,X123,X124,X125,X126,X127,X128,X129,X130,X131,X132,X133,X134,X135,X136,X137,X138,X139,X140,X141,X142,X143,X144,X145,X146,X147,X148,X149,X150,X151,X152,X153,X154,X155,X156,X157,X159,X160,X161,X162] :
( ( ~ elem(m_Ldr(X126),queue(host(X125)))
| ~ leq(host(X125),host(X126))
| ~ epred1_3(X124,X123,X122) )
& ( ~ elem(m_Down(X128),queue(host(X127)))
| host(X128) != host(X127)
| ~ epred1_3(X124,X123,X122) )
& ( ~ elem(m_Halt(X130),queue(host(X129)))
| ~ leq(host(X129),host(X130))
| ~ epred1_3(X124,X123,X122) )
& ( ~ elem(m_Ack(X133,X131),queue(host(X132)))
| ~ leq(host(X131),host(X133))
| ~ epred1_3(X124,X123,X122) )
& ( X135 = X134
| host(X135) != host(X134)
| ~ setIn(X134,alive)
| ~ setIn(X135,alive)
| ~ epred1_3(X124,X123,X122) )
& ( ~ setIn(X137,alive)
| ~ elem(m_Ack(X137,X136),queue(host(X137)))
| leq(host(X136),index(pendack,host(X137)))
| ~ epred1_3(X124,X123,X122) )
& ( ~ setIn(X139,alive)
| index(status,host(X139)) != elec_1
| ~ elem(m_Ack(X139,X138),queue(host(X139)))
| ~ epred1_3(X124,X123,X122) )
& ( index(status,host(X140)) != elec_1
| ~ setIn(X140,alive)
| index(elid,host(X140)) = X140
| ~ epred1_3(X124,X123,X122) )
& ( index(status,host(X140)) != elec_2
| ~ setIn(X140,alive)
| index(elid,host(X140)) = X140
| ~ epred1_3(X124,X123,X122) )
& ( leq(host(X141),host(X142))
| ~ setIn(X141,alive)
| ~ setIn(X142,alive)
| index(status,host(X141)) != elec_2
| index(status,host(X142)) != elec_2
| leq(index(pendack,host(X142)),host(X141))
| ~ epred1_3(X124,X123,X122) )
& ( ~ setIn(X145,alive)
| ~ elem(m_Down(X144),queue(host(X145)))
| host(X144) != host(X143)
| ~ setIn(X143,alive)
| index(ldr,host(X143)) != host(X143)
| index(status,host(X143)) != norm
| ~ epred1_3(X124,X123,X122) )
& ( ~ setIn(X146,alive)
| ~ setIn(X148,alive)
| host(X148) != host(X147)
| index(status,host(X146)) != elec_2
| index(status,host(X148)) != elec_2
| ~ elem(m_Ack(X146,X147),queue(host(X146)))
| ~ epred1_3(X124,X123,X122) )
& ( leq(host(X149),host(X150))
| ~ setIn(X149,alive)
| ~ setIn(X150,alive)
| index(status,host(X149)) != elec_2
| index(status,host(X150)) != elec_2
| ~ leq(index(pendack,host(X149)),index(pendack,host(X150)))
| ~ epred1_3(X124,X123,X122) )
& ( leq(index(pendack,host(X153)),host(X151))
| ~ setIn(X153,alive)
| ~ elem(m_Halt(X153),queue(host(X152)))
| index(status,host(X153)) != elec_2
| ~ setIn(X151,alive)
| index(ldr,host(X151)) != host(X151)
| index(status,host(X151)) != norm
| ~ epred1_3(X124,X123,X122) )
& ( ~ leq(host(X157),esk8_7(X122,X123,X124,X154,X155,X156,X157))
| ~ elem(m_Down(X156),queue(host(X157)))
| host(X157) != host(X155)
| host(X157) != nbr_proc
| index(status,host(X157)) != elec_1
| ~ setIn(X154,alive)
| ~ elem(m_Down(X155),queue(host(X154)))
| ~ epred1_3(X124,X123,X122) )
& ( leq(s(zero),esk8_7(X122,X123,X124,X154,X155,X156,X157))
| ~ elem(m_Down(X156),queue(host(X157)))
| host(X157) != host(X155)
| host(X157) != nbr_proc
| index(status,host(X157)) != elec_1
| ~ setIn(X154,alive)
| ~ elem(m_Down(X155),queue(host(X154)))
| ~ epred1_3(X124,X123,X122) )
& ( ~ setIn(esk8_7(X122,X123,X124,X154,X155,X156,X157),index(down,host(X157)))
| ~ elem(m_Down(X156),queue(host(X157)))
| host(X157) != host(X155)
| host(X157) != nbr_proc
| index(status,host(X157)) != elec_1
| ~ setIn(X154,alive)
| ~ elem(m_Down(X155),queue(host(X154)))
| ~ epred1_3(X124,X123,X122) )
& ( esk8_7(X122,X123,X124,X154,X155,X156,X157) != host(X156)
| ~ elem(m_Down(X156),queue(host(X157)))
| host(X157) != host(X155)
| host(X157) != nbr_proc
| index(status,host(X157)) != elec_1
| ~ setIn(X154,alive)
| ~ elem(m_Down(X155),queue(host(X154)))
| ~ epred1_3(X124,X123,X122) )
& ( ~ setIn(X161,alive)
| ~ elem(m_Ack(X161,X159),queue(host(X161)))
| ~ elem(m_Down(X160),queue(host(X161)))
| ~ leq(nbr_proc,s(index(pendack,host(X161))))
| index(status,host(X161)) != elec_2
| host(X159) != index(pendack,host(X161))
| host(X160) != s(index(pendack,host(X161)))
| ~ setIn(X162,alive)
| index(ldr,host(X162)) != host(X162)
| index(status,host(X162)) != norm
| ~ epred1_3(X124,X123,X122) )
& ( queue(host(X122)) = cons(m_Halt(X123),X124)
| ~ epred1_3(X124,X123,X122) ) ),
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_13])])])])])])]) ).
fof(c_0_18,plain,
! [X80,X81] :
( ( ~ leq(X80,X81)
| ~ leq(X81,X80)
| X80 = X81 )
& ( leq(X80,X81)
| X80 != X81 )
& ( leq(X81,X80)
| X80 != X81 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])]) ).
cnf(c_0_19,negated_conjecture,
leq(nbr_proc,s(host(esk5_0))),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
s(host(esk5_0)) = host(esk6_0),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_21,plain,
! [X85] : leq(host(X85),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_22,plain,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
inference(fof_simplification,[status(thm)],[axiom_12]) ).
cnf(c_0_23,plain,
( ~ setIn(X1,alive)
| ~ elem(m_Ack(X1,X2),queue(host(X1)))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ leq(nbr_proc,s(index(pendack,host(X1))))
| index(status,host(X1)) != elec_2
| host(X2) != index(pendack,host(X1))
| host(X3) != s(index(pendack,host(X1)))
| ~ setIn(X4,alive)
| index(ldr,host(X4)) != host(X4)
| index(status,host(X4)) != norm
| ~ epred1_3(X5,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk4_0,alive),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
index(ldr,host(esk4_0)) = host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
index(status,host(esk4_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
leq(nbr_proc,host(esk6_0)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X77] : leq(X77,X77),
inference(variable_rename,[status(thm)],[axiom_59]) ).
fof(c_0_31,plain,
! [X42,X43,X44] :
( ( ~ elem(X42,snoc(X44,X43))
| X42 = X43
| elem(X42,X44) )
& ( X42 != X43
| elem(X42,snoc(X44,X43)) )
& ( ~ elem(X42,X44)
| elem(X42,snoc(X44,X43)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_32,plain,
! [X54,X55,X56] : m_Ack(X54,X55) != m_Down(X56),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
( host(X1) != s(index(pendack,host(X2)))
| host(X3) != index(pendack,host(X2))
| index(status,host(X2)) != elec_2
| ~ epred1_3(X4,X5,X6)
| ~ leq(nbr_proc,s(index(pendack,host(X2))))
| ~ setIn(X2,alive)
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ elem(m_Down(X1),queue(host(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
index(status,host(esk7_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
elem(m_Down(esk6_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
m_Ack(X1,X2) != m_Down(X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( host(X1) != host(esk5_0)
| host(X2) != nbr_proc
| ~ epred1_3(X3,X4,X5)
| ~ elem(m_Ack(esk7_0,X1),queue(host(esk7_0)))
| ~ elem(m_Down(X2),queue(host(esk7_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15]),c_0_20]),c_0_35]),c_0_15]),c_0_36]),c_0_15]),c_0_20]),c_0_35]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk7_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( host(X1) != host(esk5_0)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Ack(esk7_0,X1),queue(host(esk7_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_42])]) ).
cnf(c_0_44,negated_conjecture,
elem(m_Ack(esk7_0,esk5_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_45,plain,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
inference(fof_simplification,[status(thm)],[axiom_32]) ).
cnf(c_0_46,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| ~ elem(m_Ack(esk7_0,esk5_0),queue(host(esk7_0))) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( m_Ack(esk3_0,esk2_0) = m_Ack(esk7_0,esk5_0)
| elem(m_Ack(esk7_0,esk5_0),queue(host(esk7_0))) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
fof(c_0_48,plain,
! [X64,X65,X66,X67] :
( X66 = X67
| m_Ack(X64,X66) != m_Ack(X65,X67) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])]) ).
cnf(c_0_49,negated_conjecture,
( m_Ack(esk3_0,esk2_0) = m_Ack(esk7_0,esk5_0)
| ~ epred1_3(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
epred1_3(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_51,plain,
( X1 = X2
| m_Ack(X3,X1) != m_Ack(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,negated_conjecture,
m_Ack(esk3_0,esk2_0) = m_Ack(esk7_0,esk5_0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_53,plain,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
inference(fof_simplification,[status(thm)],[axiom_31]) ).
cnf(c_0_54,negated_conjecture,
( X1 = esk2_0
| m_Ack(X2,X1) != m_Ack(esk7_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_55,plain,
! [X39,X40,X41] :
( ( ~ elem(X39,cons(X40,X41))
| X39 = X40
| elem(X39,X41) )
& ( X39 != X40
| elem(X39,cons(X40,X41)) )
& ( ~ elem(X39,X41)
| elem(X39,cons(X40,X41)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_56,plain,
! [X60,X61,X62,X63] :
( X60 = X61
| m_Ack(X60,X62) != m_Ack(X61,X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])])]) ).
cnf(c_0_57,negated_conjecture,
esk5_0 = esk2_0,
inference(er,[status(thm)],[c_0_54]) ).
fof(c_0_58,plain,
! [X36,X37] :
( ( ~ leq(X36,s(X37))
| X36 = s(X37)
| leq(X36,X37) )
& ( X36 != s(X37)
| leq(X36,s(X37)) )
& ( ~ leq(X36,X37)
| leq(X36,s(X37)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])])]) ).
cnf(c_0_59,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_61,plain,
( X1 = X2
| m_Ack(X1,X3) != m_Ack(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_62,negated_conjecture,
m_Ack(esk3_0,esk2_0) = m_Ack(esk7_0,esk2_0),
inference(rw,[status(thm)],[c_0_52,c_0_57]) ).
cnf(c_0_63,plain,
( X1 = s(X2)
| leq(X1,X2)
| ~ leq(X1,s(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,negated_conjecture,
s(host(esk5_0)) = nbr_proc,
inference(rw,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_65,plain,
( leq(index(pendack,host(X1)),host(X2))
| ~ setIn(X1,alive)
| ~ elem(m_Halt(X1),queue(host(X3)))
| index(status,host(X1)) != elec_2
| ~ setIn(X2,alive)
| index(ldr,host(X2)) != host(X2)
| index(status,host(X2)) != norm
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_66,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_67,negated_conjecture,
cons(m_Halt(esk3_0),esk1_0) = queue(host(esk2_0)),
inference(spm,[status(thm)],[c_0_60,c_0_50]) ).
cnf(c_0_68,negated_conjecture,
( esk3_0 = X1
| m_Ack(esk7_0,esk2_0) != m_Ack(X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( X1 = nbr_proc
| leq(X1,host(esk5_0))
| ~ leq(X1,nbr_proc) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( leq(index(pendack,host(X1)),host(esk4_0))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive)
| ~ elem(m_Halt(X1),queue(host(X5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_71,negated_conjecture,
elem(m_Halt(esk3_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
esk3_0 = esk7_0,
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_73,plain,
( ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| host(X2) != host(X3)
| ~ setIn(X3,alive)
| index(ldr,host(X3)) != host(X3)
| index(status,host(X3)) != norm
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_74,negated_conjecture,
( host(X1) = nbr_proc
| leq(host(X1),host(esk5_0)) ),
inference(spm,[status(thm)],[c_0_69,c_0_29]) ).
cnf(c_0_75,negated_conjecture,
( leq(host(esk5_0),host(esk4_0))
| ~ epred1_3(X1,X2,X3)
| ~ elem(m_Halt(esk7_0),queue(host(X4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_34]),c_0_15]),c_0_36])]) ).
cnf(c_0_76,negated_conjecture,
elem(m_Halt(esk7_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,negated_conjecture,
( host(X1) != host(esk4_0)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X5,alive)
| ~ elem(m_Down(X1),queue(host(X5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_78,negated_conjecture,
( host(esk5_0) = host(X1)
| host(X1) = nbr_proc
| ~ leq(host(esk5_0),host(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_74]) ).
cnf(c_0_79,negated_conjecture,
( leq(host(esk2_0),host(esk4_0))
| ~ epred1_3(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_57]) ).
cnf(c_0_80,negated_conjecture,
epred1_3(esk1_0,esk7_0,esk2_0),
inference(rw,[status(thm)],[c_0_50,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( host(X1) != host(esk4_0)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),queue(host(esk7_0))) ),
inference(spm,[status(thm)],[c_0_77,c_0_34]) ).
cnf(c_0_82,negated_conjecture,
( host(esk2_0) = host(X1)
| host(X1) = nbr_proc
| ~ leq(host(esk2_0),host(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_57]),c_0_57]) ).
cnf(c_0_83,negated_conjecture,
leq(host(esk2_0),host(esk4_0)),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
host(esk2_0) != host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_85,negated_conjecture,
( host(esk4_0) != nbr_proc
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_35]),c_0_42])]) ).
cnf(c_0_86,negated_conjecture,
host(esk4_0) = nbr_proc,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_87,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_80,c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV462+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 06:38:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 13.38/2.20 # Version: 3.1.0
% 13.38/2.20 # Preprocessing class: FSLSSMSMSSSNFFN.
% 13.38/2.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.38/2.20 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.38/2.20 # Starting new_bool_3 with 300s (1) cores
% 13.38/2.20 # Starting new_bool_1 with 300s (1) cores
% 13.38/2.20 # Starting sh5l with 300s (1) cores
% 13.38/2.20 # new_bool_3 with pid 29419 completed with status 0
% 13.38/2.20 # Result found by new_bool_3
% 13.38/2.20 # Preprocessing class: FSLSSMSMSSSNFFN.
% 13.38/2.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.38/2.20 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.38/2.20 # Starting new_bool_3 with 300s (1) cores
% 13.38/2.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.38/2.20 # Search class: FGHSM-FFMM31-MFFFFFNN
% 13.38/2.20 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 13.38/2.20 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 13.38/2.20 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 29422 completed with status 0
% 13.38/2.20 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 13.38/2.20 # Preprocessing class: FSLSSMSMSSSNFFN.
% 13.38/2.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.38/2.20 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.38/2.20 # Starting new_bool_3 with 300s (1) cores
% 13.38/2.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.38/2.20 # Search class: FGHSM-FFMM31-MFFFFFNN
% 13.38/2.20 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 13.38/2.20 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 13.38/2.20 # Preprocessing time : 0.003 s
% 13.38/2.20 # Presaturation interreduction done
% 13.38/2.20
% 13.38/2.20 # Proof found!
% 13.38/2.20 # SZS status Theorem
% 13.38/2.20 # SZS output start CNFRefutation
% See solution above
% 13.38/2.20 # Parsed axioms : 67
% 13.38/2.20 # Removed by relevancy pruning/SinE : 14
% 13.38/2.20 # Initial clauses : 102
% 13.38/2.20 # Removed in clause preprocessing : 6
% 13.38/2.20 # Initial clauses in saturation : 96
% 13.38/2.20 # Processed clauses : 9413
% 13.38/2.20 # ...of these trivial : 323
% 13.38/2.20 # ...subsumed : 7127
% 13.38/2.20 # ...remaining for further processing : 1963
% 13.38/2.20 # Other redundant clauses eliminated : 5
% 13.38/2.20 # Clauses deleted for lack of memory : 0
% 13.38/2.20 # Backward-subsumed : 294
% 13.38/2.20 # Backward-rewritten : 156
% 13.38/2.20 # Generated clauses : 272389
% 13.38/2.20 # ...of the previous two non-redundant : 130571
% 13.38/2.20 # ...aggressively subsumed : 0
% 13.38/2.20 # Contextual simplify-reflections : 1
% 13.38/2.20 # Paramodulations : 272075
% 13.38/2.20 # Factorizations : 286
% 13.38/2.20 # NegExts : 0
% 13.38/2.20 # Equation resolutions : 27
% 13.38/2.20 # Disequality decompositions : 0
% 13.38/2.20 # Total rewrite steps : 182048
% 13.38/2.20 # ...of those cached : 181311
% 13.38/2.20 # Propositional unsat checks : 0
% 13.38/2.20 # Propositional check models : 0
% 13.38/2.20 # Propositional check unsatisfiable : 0
% 13.38/2.20 # Propositional clauses : 0
% 13.38/2.20 # Propositional clauses after purity: 0
% 13.38/2.20 # Propositional unsat core size : 0
% 13.38/2.20 # Propositional preprocessing time : 0.000
% 13.38/2.20 # Propositional encoding time : 0.000
% 13.38/2.20 # Propositional solver time : 0.000
% 13.38/2.20 # Success case prop preproc time : 0.000
% 13.38/2.20 # Success case prop encoding time : 0.000
% 13.38/2.20 # Success case prop solver time : 0.000
% 13.38/2.20 # Current number of processed clauses : 1415
% 13.38/2.20 # Positive orientable unit clauses : 208
% 13.38/2.20 # Positive unorientable unit clauses: 0
% 13.38/2.20 # Negative unit clauses : 34
% 13.38/2.20 # Non-unit-clauses : 1173
% 13.38/2.20 # Current number of unprocessed clauses: 120327
% 13.38/2.20 # ...number of literals in the above : 422320
% 13.38/2.20 # Current number of archived formulas : 0
% 13.38/2.20 # Current number of archived clauses : 544
% 13.38/2.20 # Clause-clause subsumption calls (NU) : 602782
% 13.38/2.20 # Rec. Clause-clause subsumption calls : 472832
% 13.38/2.20 # Non-unit clause-clause subsumptions : 7221
% 13.38/2.20 # Unit Clause-clause subsumption calls : 11951
% 13.38/2.20 # Rewrite failures with RHS unbound : 0
% 13.38/2.20 # BW rewrite match attempts : 3930
% 13.38/2.20 # BW rewrite match successes : 26
% 13.38/2.20 # Condensation attempts : 0
% 13.38/2.20 # Condensation successes : 0
% 13.38/2.20 # Termbank termtop insertions : 4037819
% 13.38/2.20 # Search garbage collected termcells : 1734
% 13.38/2.20
% 13.38/2.20 # -------------------------------------------------
% 13.38/2.20 # User time : 1.636 s
% 13.38/2.20 # System time : 0.037 s
% 13.38/2.20 # Total time : 1.673 s
% 13.38/2.20 # Maximum resident set size: 2264 pages
% 13.38/2.20
% 13.38/2.20 # -------------------------------------------------
% 13.38/2.20 # User time : 1.639 s
% 13.38/2.20 # System time : 0.039 s
% 13.38/2.20 # Total time : 1.678 s
% 13.38/2.20 # Maximum resident set size: 1812 pages
% 13.38/2.20 % E---3.1 exiting
% 13.38/2.20 % E exiting
%------------------------------------------------------------------------------