TSTP Solution File: SWV473+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV473+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:59:38 EDT 2023
% Result : Theorem 23.26s 3.51s
% Output : CNFRefutation 23.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 24 unt; 0 def)
% Number of atoms : 406 ( 182 equ)
% Maximal formula atoms : 86 ( 7 avg)
% Number of connectives : 555 ( 200 ~; 150 |; 154 &)
% ( 3 <=>; 48 =>; 0 <=; 0 <~>)
% Maximal formula depth : 54 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 30 ( 30 usr; 20 con; 0-8 aty)
% Number of variables : 235 ( 48 sgn; 156 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& setIn(host(X16),index(down,host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) )
=> ( setIn(X5,alive)
=> ( ~ ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,X20] :
( host(X5) = host(X20)
=> ( ( ! [X17] :
( ( ~ leq(host(X20),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X20)))
| X17 = host(X19) ) )
& elem(m_Down(X19),X12)
& host(X20) = host(X18)
& host(X20) = nbr_proc
& index(status,host(X20)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X18),queue(host(X7))) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dHh79U0nF3/E---3.1_4636.p',conj) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox2/tmp/tmp.dHh79U0nF3/E---3.1_4636.p',axiom_02) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dHh79U0nF3/E---3.1_4636.p',axiom_46) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox2/tmp/tmp.dHh79U0nF3/E---3.1_4636.p',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox2/tmp/tmp.dHh79U0nF3/E---3.1_4636.p',axiom_04) ).
fof(c_0_5,plain,
! [X5,X6,X13,X12] :
( epred1_4(X12,X13,X6,X5)
<=> ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& setIn(host(X16),index(down,host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_4(X12,X13,X6,X5)
=> ( setIn(X5,alive)
=> ( ~ ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X18,X19,X20] :
( host(X5) = host(X20)
=> ( ( ! [X17] :
( ( ~ leq(host(X20),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X20)))
| X17 = host(X19) ) )
& elem(m_Down(X19),X12)
& host(X20) = host(X18)
& host(X20) = nbr_proc
& index(status,host(X20)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X18),queue(host(X7))) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_5]) ).
fof(c_0_7,plain,
! [X5,X6,X13,X12] :
( epred1_4(X12,X13,X6,X5)
=> ( ! [X7,X14] :
( elem(m_Ldr(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( host(X14) = nbr_proc
=> ~ elem(m_NotNorm(X7),queue(host(X14))) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = norm
& index(ldr,host(X14)) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X15,X14] :
( ( host(X14) != host(X15)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X14)) = wait
& host(index(elid,host(X14))) = host(X15) )
=> ~ elem(m_Down(X7),queue(host(X15))) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& setIn(host(X16),index(down,host(X15))) ) )
& ! [X7,X16,X15,X14] :
( ( ! [X17] :
( ( ~ leq(host(X14),X17)
& leq(s(zero),X17) )
=> ( setIn(X17,index(down,host(X14)))
| X17 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = nbr_proc
& host(X14) = host(X16)
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X7,alive)
& elem(m_Down(X16),queue(host(X7))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
! [X29] :
( epred1_4(esk1_0,esk2_0,esk4_0,esk3_0)
& setIn(esk3_0,alive)
& ( index(elid,host(esk3_0)) != esk2_0
| index(status,host(esk3_0)) != elec_2
| host(esk4_0) != index(pendack,host(esk3_0)) )
& host(esk3_0) != host(esk5_0)
& host(esk3_0) = host(esk8_0)
& ( leq(host(esk8_0),X29)
| ~ leq(s(zero),X29)
| setIn(X29,index(down,host(esk8_0)))
| X29 = host(esk7_0) )
& elem(m_Down(esk7_0),esk1_0)
& host(esk8_0) = host(esk6_0)
& host(esk8_0) = nbr_proc
& index(status,host(esk8_0)) = elec_1
& setIn(esk5_0,alive)
& elem(m_Down(esk6_0),queue(host(esk5_0))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [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] :
( ( ~ elem(m_Ldr(X131),queue(host(X130)))
| ~ leq(host(X130),host(X131))
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ elem(m_Down(X133),queue(host(X132)))
| host(X133) != host(X132)
| ~ epred1_4(X129,X128,X127,X126) )
& ( host(X135) != nbr_proc
| ~ elem(m_NotNorm(X134),queue(host(X135)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( X137 = X136
| host(X137) != host(X136)
| ~ setIn(X136,alive)
| ~ setIn(X137,alive)
| ~ epred1_4(X129,X128,X127,X126) )
& ( index(status,host(X138)) != elec_1
| ~ setIn(X138,alive)
| index(elid,host(X138)) = X138
| ~ epred1_4(X129,X128,X127,X126) )
& ( index(status,host(X138)) != elec_2
| ~ setIn(X138,alive)
| index(elid,host(X138)) = X138
| ~ epred1_4(X129,X128,X127,X126) )
& ( host(X141) = host(X140)
| ~ setIn(X141,alive)
| host(X141) != host(X139)
| index(status,host(X141)) != norm
| index(ldr,host(X141)) != host(X140)
| ~ elem(m_Down(X139),queue(host(X140)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( host(X144) = host(X143)
| ~ setIn(X144,alive)
| host(X144) != host(X142)
| index(status,host(X144)) != wait
| host(index(elid,host(X144))) != host(X143)
| ~ elem(m_Down(X142),queue(host(X143)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( host(X147) = host(X145)
| ~ setIn(X145,alive)
| ~ setIn(X147,alive)
| host(X146) != host(X145)
| host(X148) != host(X147)
| ~ elem(m_Down(X148),queue(host(X145)))
| ~ elem(m_Down(X146),queue(host(X147)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( host(X151) = host(X149)
| ~ setIn(X149,alive)
| ~ setIn(X151,alive)
| host(X150) != host(X149)
| host(X152) != host(X151)
| ~ elem(m_Down(X152),queue(host(X149)))
| ~ setIn(host(X150),index(down,host(X151)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ leq(host(X156),esk9_8(X126,X127,X128,X129,X153,X154,X155,X156))
| ~ elem(m_Down(X155),queue(host(X156)))
| host(X156) != nbr_proc
| host(X156) != host(X154)
| index(status,host(X156)) != elec_1
| ~ setIn(X153,alive)
| ~ elem(m_Down(X154),queue(host(X153)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( leq(s(zero),esk9_8(X126,X127,X128,X129,X153,X154,X155,X156))
| ~ elem(m_Down(X155),queue(host(X156)))
| host(X156) != nbr_proc
| host(X156) != host(X154)
| index(status,host(X156)) != elec_1
| ~ setIn(X153,alive)
| ~ elem(m_Down(X154),queue(host(X153)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ setIn(esk9_8(X126,X127,X128,X129,X153,X154,X155,X156),index(down,host(X156)))
| ~ elem(m_Down(X155),queue(host(X156)))
| host(X156) != nbr_proc
| host(X156) != host(X154)
| index(status,host(X156)) != elec_1
| ~ setIn(X153,alive)
| ~ elem(m_Down(X154),queue(host(X153)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( esk9_8(X126,X127,X128,X129,X153,X154,X155,X156) != host(X155)
| ~ elem(m_Down(X155),queue(host(X156)))
| host(X156) != nbr_proc
| host(X156) != host(X154)
| index(status,host(X156)) != elec_1
| ~ setIn(X153,alive)
| ~ elem(m_Down(X154),queue(host(X153)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( queue(host(X126)) = cons(m_Ack(X128,X127),X129)
| ~ epred1_4(X129,X128,X127,X126) ) ),
inference(distribute,[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_7])])])])])]) ).
cnf(c_0_10,negated_conjecture,
host(esk3_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
host(esk8_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( host(X1) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| host(X3) != host(X2)
| host(X4) != host(X1)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ setIn(host(X3),index(down,host(X1)))
| ~ epred1_4(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
setIn(esk5_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
host(esk3_0) != host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
host(esk3_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( host(X1) = host(esk5_0)
| host(esk5_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(host(X2),index(down,host(X1)))
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(host(esk5_0))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
host(esk5_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
host(esk8_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( host(esk5_0) != host(X1)
| host(X2) != nbr_proc
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(host(X1),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(host(esk5_0))) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]),c_0_15]),c_0_15]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( leq(host(esk8_0),X1)
| setIn(X1,index(down,host(esk8_0)))
| X1 = host(esk7_0)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_24,plain,
! [X69] : leq(s(zero),host(X69)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_25,negated_conjecture,
( host(esk5_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ setIn(host(X1),index(down,nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
( X1 = host(esk7_0)
| leq(nbr_proc,X1)
| setIn(X1,index(down,nbr_proc))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_11]),c_0_11]) ).
cnf(c_0_27,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( host(X1) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| host(X3) != host(X2)
| host(X4) != host(X1)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ epred1_4(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( ~ epred1_4(X1,X2,X3,X4)
| ~ setIn(host(esk5_0),index(down,nbr_proc)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( host(X1) = host(esk7_0)
| leq(nbr_proc,host(X1))
| setIn(host(X1),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
! [X31,X32,X33] :
( ( ~ elem(X31,cons(X32,X33))
| X31 = X32
| elem(X31,X33) )
& ( X31 != X32
| elem(X31,cons(X32,X33)) )
& ( ~ elem(X31,X33)
| elem(X31,cons(X32,X33)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_32,negated_conjecture,
( host(X1) = host(esk5_0)
| host(esk5_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(host(esk5_0)))
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
fof(c_0_33,plain,
! [X59,X60] :
( ( ~ leq(X59,X60)
| ~ leq(X60,X59)
| X59 = X60 )
& ( leq(X59,X60)
| X59 != X60 )
& ( leq(X60,X59)
| X59 != X60 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])]) ).
cnf(c_0_34,negated_conjecture,
( host(esk7_0) = host(esk5_0)
| leq(nbr_proc,host(esk5_0))
| ~ epred1_4(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
epred1_4(esk1_0,esk2_0,esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_36,plain,
! [X55] : leq(host(X55),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_37,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
elem(m_Down(esk7_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_39,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,negated_conjecture,
( host(esk5_0) != host(X1)
| host(X2) != nbr_proc
| ~ epred1_4(X3,X4,X5,X6)
| ~ elem(m_Down(X2),queue(host(esk5_0)))
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_17]),c_0_15]),c_0_15]),c_0_15]),c_0_18]) ).
cnf(c_0_41,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( host(esk7_0) = host(esk5_0)
| leq(nbr_proc,host(esk5_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
elem(m_Down(esk7_0),cons(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
cons(m_Ack(esk2_0,esk4_0),esk1_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_15]) ).
cnf(c_0_46,negated_conjecture,
( host(esk5_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_21]),c_0_22])]) ).
cnf(c_0_47,negated_conjecture,
host(esk7_0) = host(esk5_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_18]) ).
cnf(c_0_48,negated_conjecture,
elem(m_Down(esk7_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV473+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 03:42:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.dHh79U0nF3/E---3.1_4636.p
% 23.26/3.51 # Version: 3.1pre001
% 23.26/3.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 23.26/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.26/3.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 23.26/3.51 # Starting new_bool_3 with 300s (1) cores
% 23.26/3.51 # Starting new_bool_1 with 300s (1) cores
% 23.26/3.51 # Starting sh5l with 300s (1) cores
% 23.26/3.51 # new_bool_3 with pid 4714 completed with status 0
% 23.26/3.51 # Result found by new_bool_3
% 23.26/3.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 23.26/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.26/3.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 23.26/3.51 # Starting new_bool_3 with 300s (1) cores
% 23.26/3.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.26/3.51 # Search class: FGHSM-FFMM31-MFFFFFNN
% 23.26/3.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 23.26/3.51 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 23.26/3.51 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 4717 completed with status 0
% 23.26/3.51 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 23.26/3.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 23.26/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.26/3.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 23.26/3.51 # Starting new_bool_3 with 300s (1) cores
% 23.26/3.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.26/3.51 # Search class: FGHSM-FFMM31-MFFFFFNN
% 23.26/3.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 23.26/3.51 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 23.26/3.51 # Preprocessing time : 0.007 s
% 23.26/3.51 # Presaturation interreduction done
% 23.26/3.51
% 23.26/3.51 # Proof found!
% 23.26/3.51 # SZS status Theorem
% 23.26/3.51 # SZS output start CNFRefutation
% See solution above
% 23.26/3.51 # Parsed axioms : 67
% 23.26/3.51 # Removed by relevancy pruning/SinE : 14
% 23.26/3.51 # Initial clauses : 94
% 23.26/3.51 # Removed in clause preprocessing : 6
% 23.26/3.51 # Initial clauses in saturation : 88
% 23.26/3.51 # Processed clauses : 9334
% 23.26/3.51 # ...of these trivial : 311
% 23.26/3.51 # ...subsumed : 7242
% 23.26/3.51 # ...remaining for further processing : 1781
% 23.26/3.51 # Other redundant clauses eliminated : 6
% 23.26/3.51 # Clauses deleted for lack of memory : 0
% 23.26/3.51 # Backward-subsumed : 151
% 23.26/3.51 # Backward-rewritten : 80
% 23.26/3.51 # Generated clauses : 317075
% 23.26/3.51 # ...of the previous two non-redundant : 149954
% 23.26/3.51 # ...aggressively subsumed : 0
% 23.26/3.51 # Contextual simplify-reflections : 12
% 23.26/3.51 # Paramodulations : 316674
% 23.26/3.51 # Factorizations : 377
% 23.26/3.51 # NegExts : 0
% 23.26/3.51 # Equation resolutions : 23
% 23.26/3.51 # Total rewrite steps : 200997
% 23.26/3.51 # Propositional unsat checks : 0
% 23.26/3.51 # Propositional check models : 0
% 23.26/3.51 # Propositional check unsatisfiable : 0
% 23.26/3.51 # Propositional clauses : 0
% 23.26/3.51 # Propositional clauses after purity: 0
% 23.26/3.51 # Propositional unsat core size : 0
% 23.26/3.51 # Propositional preprocessing time : 0.000
% 23.26/3.51 # Propositional encoding time : 0.000
% 23.26/3.51 # Propositional solver time : 0.000
% 23.26/3.51 # Success case prop preproc time : 0.000
% 23.26/3.51 # Success case prop encoding time : 0.000
% 23.26/3.51 # Success case prop solver time : 0.000
% 23.26/3.51 # Current number of processed clauses : 1461
% 23.26/3.51 # Positive orientable unit clauses : 203
% 23.26/3.51 # Positive unorientable unit clauses: 0
% 23.26/3.51 # Negative unit clauses : 31
% 23.26/3.51 # Non-unit-clauses : 1227
% 23.26/3.51 # Current number of unprocessed clauses: 140716
% 23.26/3.51 # ...number of literals in the above : 536465
% 23.26/3.51 # Current number of archived formulas : 0
% 23.26/3.51 # Current number of archived clauses : 316
% 23.26/3.51 # Clause-clause subsumption calls (NU) : 601770
% 23.26/3.51 # Rec. Clause-clause subsumption calls : 416926
% 23.26/3.51 # Non-unit clause-clause subsumptions : 7103
% 23.26/3.51 # Unit Clause-clause subsumption calls : 9012
% 23.26/3.51 # Rewrite failures with RHS unbound : 0
% 23.26/3.51 # BW rewrite match attempts : 3532
% 23.26/3.51 # BW rewrite match successes : 4
% 23.26/3.51 # Condensation attempts : 0
% 23.26/3.51 # Condensation successes : 0
% 23.26/3.51 # Termbank termtop insertions : 4925035
% 23.26/3.51
% 23.26/3.51 # -------------------------------------------------
% 23.26/3.51 # User time : 2.771 s
% 23.26/3.51 # System time : 0.071 s
% 23.26/3.51 # Total time : 2.842 s
% 23.26/3.51 # Maximum resident set size: 2100 pages
% 23.26/3.51
% 23.26/3.51 # -------------------------------------------------
% 23.26/3.51 # User time : 2.773 s
% 23.26/3.51 # System time : 0.073 s
% 23.26/3.51 # Total time : 2.845 s
% 23.26/3.51 # Maximum resident set size: 1776 pages
% 23.26/3.51 % E---3.1 exiting
%------------------------------------------------------------------------------