TSTP Solution File: SWV474+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV474+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:47:04 EDT 2023
% Result : Theorem 25.53s 3.68s
% Output : CNFRefutation 25.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 68 ( 33 unt; 0 def)
% Number of atoms : 465 ( 214 equ)
% Maximal formula atoms : 86 ( 6 avg)
% Number of connectives : 629 ( 232 ~; 176 |; 164 &)
% ( 3 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 53 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 19 con; 0-7 aty)
% Number of variables : 235 ( 47 sgn; 155 !; 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_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ~ ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [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(X5)))
| X17 = host(X6)
| 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/sandbox/tmp/tmp.zoig0GqwjM/E---3.1_31212.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.zoig0GqwjM/E---3.1_31212.p',axiom_46) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox/tmp/tmp.zoig0GqwjM/E---3.1_31212.p',axiom_02) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox/tmp/tmp.zoig0GqwjM/E---3.1_31212.p',axiom_61) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/tmp/tmp.zoig0GqwjM/E---3.1_31212.p',axiom_04) ).
fof(c_0_5,plain,
! [X5,X6,X12] :
( epred1_3(X12,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_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ~ ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [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(X5)))
| X17 = host(X6)
| 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,X12] :
( epred1_3(X12,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_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
! [X29] :
( epred1_3(esk1_0,esk3_0,esk2_0)
& setIn(esk2_0,alive)
& ~ leq(host(esk2_0),host(esk3_0))
& ( index(ldr,host(esk2_0)) != host(esk3_0)
| index(status,host(esk2_0)) != norm )
& ( index(status,host(esk2_0)) != wait
| host(esk3_0) != host(index(elid,host(esk2_0))) )
& ( ~ leq(host(esk2_0),esk4_0)
| index(status,host(esk2_0)) != elec_1 )
& ( leq(s(zero),esk4_0)
| index(status,host(esk2_0)) != elec_1 )
& ( ~ setIn(esk4_0,index(down,host(esk2_0)))
| index(status,host(esk2_0)) != elec_1 )
& ( esk4_0 != host(esk3_0)
| index(status,host(esk2_0)) != elec_1 )
& host(esk2_0) != host(esk5_0)
& host(esk2_0) = host(esk8_0)
& ( leq(host(esk8_0),X29)
| ~ leq(s(zero),X29)
| setIn(X29,index(down,host(esk2_0)))
| X29 = host(esk3_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(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[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] :
( ( ~ elem(m_Ldr(X130),queue(host(X129)))
| ~ leq(host(X129),host(X130))
| ~ epred1_3(X128,X127,X126) )
& ( ~ elem(m_Down(X132),queue(host(X131)))
| host(X132) != host(X131)
| ~ epred1_3(X128,X127,X126) )
& ( host(X134) != nbr_proc
| ~ elem(m_NotNorm(X133),queue(host(X134)))
| ~ epred1_3(X128,X127,X126) )
& ( X136 = X135
| host(X136) != host(X135)
| ~ setIn(X135,alive)
| ~ setIn(X136,alive)
| ~ epred1_3(X128,X127,X126) )
& ( index(status,host(X137)) != elec_1
| ~ setIn(X137,alive)
| index(elid,host(X137)) = X137
| ~ epred1_3(X128,X127,X126) )
& ( index(status,host(X137)) != elec_2
| ~ setIn(X137,alive)
| index(elid,host(X137)) = X137
| ~ epred1_3(X128,X127,X126) )
& ( host(X140) = host(X139)
| ~ setIn(X140,alive)
| host(X140) != host(X138)
| index(status,host(X140)) != norm
| index(ldr,host(X140)) != host(X139)
| ~ elem(m_Down(X138),queue(host(X139)))
| ~ epred1_3(X128,X127,X126) )
& ( host(X143) = host(X142)
| ~ setIn(X143,alive)
| host(X143) != host(X141)
| index(status,host(X143)) != wait
| host(index(elid,host(X143))) != host(X142)
| ~ elem(m_Down(X141),queue(host(X142)))
| ~ epred1_3(X128,X127,X126) )
& ( host(X146) = host(X144)
| ~ setIn(X144,alive)
| ~ setIn(X146,alive)
| host(X145) != host(X144)
| host(X147) != host(X146)
| ~ elem(m_Down(X147),queue(host(X144)))
| ~ elem(m_Down(X145),queue(host(X146)))
| ~ epred1_3(X128,X127,X126) )
& ( host(X150) = host(X148)
| ~ setIn(X148,alive)
| ~ setIn(X150,alive)
| host(X149) != host(X148)
| host(X151) != host(X150)
| ~ elem(m_Down(X151),queue(host(X148)))
| ~ setIn(host(X149),index(down,host(X150)))
| ~ epred1_3(X128,X127,X126) )
& ( ~ leq(host(X155),esk9_7(X126,X127,X128,X152,X153,X154,X155))
| ~ elem(m_Down(X154),queue(host(X155)))
| host(X155) != nbr_proc
| host(X155) != host(X153)
| index(status,host(X155)) != elec_1
| ~ setIn(X152,alive)
| ~ elem(m_Down(X153),queue(host(X152)))
| ~ epred1_3(X128,X127,X126) )
& ( leq(s(zero),esk9_7(X126,X127,X128,X152,X153,X154,X155))
| ~ elem(m_Down(X154),queue(host(X155)))
| host(X155) != nbr_proc
| host(X155) != host(X153)
| index(status,host(X155)) != elec_1
| ~ setIn(X152,alive)
| ~ elem(m_Down(X153),queue(host(X152)))
| ~ epred1_3(X128,X127,X126) )
& ( ~ setIn(esk9_7(X126,X127,X128,X152,X153,X154,X155),index(down,host(X155)))
| ~ elem(m_Down(X154),queue(host(X155)))
| host(X155) != nbr_proc
| host(X155) != host(X153)
| index(status,host(X155)) != elec_1
| ~ setIn(X152,alive)
| ~ elem(m_Down(X153),queue(host(X152)))
| ~ epred1_3(X128,X127,X126) )
& ( esk9_7(X126,X127,X128,X152,X153,X154,X155) != host(X154)
| ~ elem(m_Down(X154),queue(host(X155)))
| host(X155) != nbr_proc
| host(X155) != host(X153)
| index(status,host(X155)) != elec_1
| ~ setIn(X152,alive)
| ~ elem(m_Down(X153),queue(host(X152)))
| ~ epred1_3(X128,X127,X126) )
& ( queue(host(X126)) = cons(m_Down(X127),X128)
| ~ epred1_3(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(esk2_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,negated_conjecture,
index(status,host(esk8_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_3(X5,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
setIn(esk5_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
host(esk2_0) != host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
host(esk2_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( leq(host(esk8_0),X1)
| setIn(X1,index(down,host(esk2_0)))
| X1 = host(esk3_0)
| X1 = host(esk7_0)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( leq(s(zero),esk4_0)
| index(status,host(esk2_0)) != elec_1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
index(status,nbr_proc) = elec_1,
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( esk4_0 != host(esk3_0)
| index(status,host(esk2_0)) != elec_1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( ~ leq(host(esk2_0),esk4_0)
| index(status,host(esk2_0)) != elec_1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
( ~ setIn(esk4_0,index(down,host(esk2_0)))
| index(status,host(esk2_0)) != elec_1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,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_3(X5,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_24,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_25,negated_conjecture,
( host(X1) = host(esk5_0)
| host(esk5_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(host(X2),index(down,host(X1)))
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(host(esk5_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
setIn(esk2_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
host(esk5_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
host(esk8_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( X1 = host(esk7_0)
| X1 = host(esk3_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_17,c_0_11]),c_0_16]) ).
cnf(c_0_30,negated_conjecture,
leq(s(zero),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_16]),c_0_19])]) ).
cnf(c_0_31,negated_conjecture,
host(esk3_0) != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16]),c_0_19])]) ).
cnf(c_0_32,negated_conjecture,
~ leq(nbr_proc,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16]),c_0_19]),c_0_16])]) ).
cnf(c_0_33,negated_conjecture,
~ setIn(esk4_0,index(down,nbr_proc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16]),c_0_19]),c_0_16])]) ).
cnf(c_0_34,negated_conjecture,
( host(X1) = host(esk5_0)
| host(esk5_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),queue(host(esk5_0)))
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_35,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Down(esk7_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,negated_conjecture,
epred1_3(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_39,negated_conjecture,
( host(esk5_0) != host(X1)
| host(X2) != nbr_proc
| ~ epred1_3(X3,X4,X5)
| ~ 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_25,c_0_26]),c_0_16]),c_0_16]),c_0_16]),c_0_27]) ).
cnf(c_0_40,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_41,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_42,negated_conjecture,
host(esk7_0) = esk4_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33]) ).
fof(c_0_43,plain,
! [X69] : leq(s(zero),host(X69)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_44,negated_conjecture,
( host(esk5_0) != host(X1)
| host(X2) != nbr_proc
| ~ epred1_3(X3,X4,X5)
| ~ 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_34,c_0_26]),c_0_16]),c_0_16]),c_0_16]),c_0_27]) ).
cnf(c_0_45,negated_conjecture,
elem(m_Down(esk7_0),cons(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
cons(m_Down(esk3_0),esk1_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_16]) ).
cnf(c_0_47,negated_conjecture,
( host(esk5_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(host(X1),index(down,nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
( X1 = host(esk3_0)
| X1 = esk4_0
| leq(nbr_proc,X1)
| setIn(X1,index(down,nbr_proc))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_42]) ).
cnf(c_0_49,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( host(esk5_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_40]),c_0_41])]) ).
cnf(c_0_51,negated_conjecture,
elem(m_Down(esk7_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| ~ setIn(host(esk5_0),index(down,nbr_proc)) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( host(X1) = host(esk3_0)
| host(X1) = esk4_0
| leq(nbr_proc,host(X1))
| setIn(host(X1),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( host(esk5_0) != esk4_0
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_42]),c_0_51])]) ).
fof(c_0_55,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_56,negated_conjecture,
( host(esk5_0) = host(esk3_0)
| leq(nbr_proc,host(esk5_0))
| ~ epred1_3(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
fof(c_0_57,plain,
! [X55] : leq(host(X55),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_58,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( host(esk5_0) = host(esk3_0)
| leq(nbr_proc,host(esk5_0)) ),
inference(spm,[status(thm)],[c_0_56,c_0_38]) ).
cnf(c_0_60,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_61,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_62,negated_conjecture,
host(esk5_0) = host(esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),c_0_27]) ).
cnf(c_0_63,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( host(esk3_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),queue(nbr_proc)) ),
inference(rw,[status(thm)],[c_0_50,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
elem(m_Down(esk3_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_63,c_0_46]) ).
cnf(c_0_66,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_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_38,c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWV474+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 03:48:51 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.zoig0GqwjM/E---3.1_31212.p
% 25.53/3.68 # Version: 3.1pre001
% 25.53/3.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 25.53/3.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.53/3.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 25.53/3.68 # Starting new_bool_3 with 300s (1) cores
% 25.53/3.68 # Starting new_bool_1 with 300s (1) cores
% 25.53/3.68 # Starting sh5l with 300s (1) cores
% 25.53/3.68 # new_bool_3 with pid 31291 completed with status 0
% 25.53/3.68 # Result found by new_bool_3
% 25.53/3.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 25.53/3.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.53/3.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 25.53/3.68 # Starting new_bool_3 with 300s (1) cores
% 25.53/3.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.53/3.68 # Search class: FGHSM-FFMM31-MFFFFFNN
% 25.53/3.68 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 25.53/3.68 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 25.53/3.68 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 31294 completed with status 0
% 25.53/3.68 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 25.53/3.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 25.53/3.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.53/3.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 25.53/3.68 # Starting new_bool_3 with 300s (1) cores
% 25.53/3.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.53/3.68 # Search class: FGHSM-FFMM31-MFFFFFNN
% 25.53/3.68 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 25.53/3.68 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 25.53/3.68 # Preprocessing time : 0.003 s
% 25.53/3.68 # Presaturation interreduction done
% 25.53/3.68
% 25.53/3.68 # Proof found!
% 25.53/3.68 # SZS status Theorem
% 25.53/3.68 # SZS output start CNFRefutation
% See solution above
% 25.53/3.68 # Parsed axioms : 67
% 25.53/3.68 # Removed by relevancy pruning/SinE : 14
% 25.53/3.68 # Initial clauses : 100
% 25.53/3.68 # Removed in clause preprocessing : 6
% 25.53/3.68 # Initial clauses in saturation : 94
% 25.53/3.68 # Processed clauses : 9731
% 25.53/3.68 # ...of these trivial : 361
% 25.53/3.68 # ...subsumed : 7361
% 25.53/3.68 # ...remaining for further processing : 2009
% 25.53/3.68 # Other redundant clauses eliminated : 9
% 25.53/3.68 # Clauses deleted for lack of memory : 0
% 25.53/3.68 # Backward-subsumed : 228
% 25.53/3.68 # Backward-rewritten : 56
% 25.53/3.68 # Generated clauses : 323048
% 25.53/3.68 # ...of the previous two non-redundant : 124007
% 25.53/3.68 # ...aggressively subsumed : 0
% 25.53/3.68 # Contextual simplify-reflections : 7
% 25.53/3.68 # Paramodulations : 322594
% 25.53/3.68 # Factorizations : 428
% 25.53/3.68 # NegExts : 0
% 25.53/3.68 # Equation resolutions : 25
% 25.53/3.68 # Total rewrite steps : 238562
% 25.53/3.68 # Propositional unsat checks : 0
% 25.53/3.68 # Propositional check models : 0
% 25.53/3.68 # Propositional check unsatisfiable : 0
% 25.53/3.68 # Propositional clauses : 0
% 25.53/3.68 # Propositional clauses after purity: 0
% 25.53/3.68 # Propositional unsat core size : 0
% 25.53/3.68 # Propositional preprocessing time : 0.000
% 25.53/3.68 # Propositional encoding time : 0.000
% 25.53/3.68 # Propositional solver time : 0.000
% 25.53/3.68 # Success case prop preproc time : 0.000
% 25.53/3.68 # Success case prop encoding time : 0.000
% 25.53/3.68 # Success case prop solver time : 0.000
% 25.53/3.68 # Current number of processed clauses : 1631
% 25.53/3.68 # Positive orientable unit clauses : 220
% 25.53/3.68 # Positive unorientable unit clauses: 0
% 25.53/3.68 # Negative unit clauses : 35
% 25.53/3.68 # Non-unit-clauses : 1376
% 25.53/3.68 # Current number of unprocessed clauses: 113967
% 25.53/3.68 # ...number of literals in the above : 442666
% 25.53/3.68 # Current number of archived formulas : 0
% 25.53/3.68 # Current number of archived clauses : 374
% 25.53/3.68 # Clause-clause subsumption calls (NU) : 841161
% 25.53/3.68 # Rec. Clause-clause subsumption calls : 596776
% 25.53/3.68 # Non-unit clause-clause subsumptions : 7407
% 25.53/3.68 # Unit Clause-clause subsumption calls : 11297
% 25.53/3.68 # Rewrite failures with RHS unbound : 0
% 25.53/3.68 # BW rewrite match attempts : 3833
% 25.53/3.68 # BW rewrite match successes : 10
% 25.53/3.68 # Condensation attempts : 0
% 25.53/3.68 # Condensation successes : 0
% 25.53/3.68 # Termbank termtop insertions : 4583064
% 25.53/3.68
% 25.53/3.68 # -------------------------------------------------
% 25.53/3.68 # User time : 3.092 s
% 25.53/3.68 # System time : 0.069 s
% 25.53/3.68 # Total time : 3.161 s
% 25.53/3.68 # Maximum resident set size: 2100 pages
% 25.53/3.68
% 25.53/3.68 # -------------------------------------------------
% 25.53/3.68 # User time : 3.095 s
% 25.53/3.68 # System time : 0.071 s
% 25.53/3.68 # Total time : 3.166 s
% 25.53/3.68 # Maximum resident set size: 1776 pages
% 25.53/3.68 % E---3.1 exiting
% 25.53/3.68 % E---3.1 exiting
%------------------------------------------------------------------------------