TSTP Solution File: SWV460+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV460+1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:59:36 EDT 2023
% Result : Theorem 80.36s 10.60s
% Output : CNFRefutation 80.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 22 unt; 0 def)
% Number of atoms : 383 ( 129 equ)
% Maximal formula atoms : 72 ( 8 avg)
% Number of connectives : 505 ( 169 ~; 116 |; 159 &)
% ( 3 <=>; 58 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 197 ( 26 sgn; 149 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& setIn(host(X14),index(down,host(X7)))
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( ~ leq(host(X14),host(X7))
& setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Down(X15),queue(host(X7)))
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& 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 )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( ~ leq(host(X7),host(X16))
& setIn(X7,alive)
& setIn(X16,alive)
& index(status,host(X16)) = elec_2 )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UHMzJv6ZS6/E---3.1_8886.p',conj) ).
fof(axiom_58,axiom,
! [X5] : ~ leq(s(X5),X5),
file('/export/starexec/sandbox2/tmp/tmp.UHMzJv6ZS6/E---3.1_8886.p',axiom_58) ).
fof(axiom_62,axiom,
! [X5,X6,X7] :
( ( leq(X5,X6)
& leq(X6,X7) )
=> leq(X5,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.UHMzJv6ZS6/E---3.1_8886.p',axiom_62) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox2/tmp/tmp.UHMzJv6ZS6/E---3.1_8886.p',axiom_02) ).
fof(axiom_63,axiom,
! [X5,X6] :
( leq(X5,X6)
<=> leq(s(X5),s(X6)) ),
file('/export/starexec/sandbox2/tmp/tmp.UHMzJv6ZS6/E---3.1_8886.p',axiom_63) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UHMzJv6ZS6/E---3.1_8886.p',axiom_46) ).
fof(c_0_6,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
<=> ( ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& setIn(host(X14),index(down,host(X7)))
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( ~ leq(host(X14),host(X7))
& setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Down(X15),queue(host(X7)))
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_7,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 )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X16] :
( host(X5) != host(X16)
=> ( ( ~ leq(host(X7),host(X16))
& setIn(X7,alive)
& setIn(X16,alive)
& index(status,host(X16)) = elec_2 )
=> ~ leq(s(host(X5)),index(pendack,host(X16))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_6]) ).
fof(c_0_8,plain,
! [X5] : ~ leq(s(X5),X5),
inference(fof_simplification,[status(thm)],[axiom_58]) ).
fof(c_0_9,plain,
! [X28,X29,X30] :
( ~ leq(X28,X29)
| ~ leq(X29,X30)
| leq(X28,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_62])]) ).
fof(c_0_10,negated_conjecture,
! [X20] :
( 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),X20)
| ~ leq(s(zero),X20)
| setIn(X20,index(down,host(esk2_0)))
| X20 = host(esk3_0) )
& index(status,host(esk2_0)) = elec_1
& ~ leq(nbr_proc,host(esk2_0))
& host(esk2_0) = host(esk4_0)
& host(esk2_0) != host(esk5_0)
& ~ leq(host(esk4_0),host(esk5_0))
& setIn(esk4_0,alive)
& setIn(esk5_0,alive)
& index(status,host(esk5_0)) = elec_2
& leq(s(host(esk2_0)),index(pendack,host(esk5_0))) ),
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_7])])])])]) ).
fof(c_0_11,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
=> ( ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7] :
( index(status,host(X7)) = elec_2
=> ~ leq(index(pendack,host(X7)),host(X7)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X14] :
( ( setIn(X14,alive)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X14),queue(host(X7))) )
& ! [X7] :
( ( ( index(status,host(X7)) = elec_1
| index(status,host(X7)) = elec_2 )
& setIn(X7,alive) )
=> index(elid,host(X7)) = X7 )
& ! [X7,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& setIn(host(X14),index(down,host(X7)))
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( ~ leq(host(X14),host(X7))
& setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Down(X15),queue(host(X7))) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& host(X14) = host(X15)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X7,X15),queue(host(X7))) )
& ! [X7,X15,X14] :
( ( setIn(X7,alive)
& setIn(X14,alive)
& elem(m_Down(X15),queue(host(X7)))
& host(X14) = host(X15)
& index(status,host(X14)) = elec_2 )
=> leq(index(pendack,host(X14)),host(X7)) )
& ! [X7,X14] :
( ( ~ leq(host(X7),host(X14))
& setIn(X7,alive)
& setIn(X14,alive)
& index(status,host(X7)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ leq(index(pendack,host(X7)),index(pendack,host(X14))) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X44] : leq(s(zero),host(X44)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
fof(c_0_13,plain,
! [X38] : ~ leq(s(X38),X38),
inference(variable_rename,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
leq(s(host(esk2_0)),index(pendack,host(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X119,X120,X121,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] :
( ( ~ elem(m_Halt(X123),queue(host(X122)))
| ~ leq(host(X122),host(X123))
| ~ epred1_3(X121,X120,X119) )
& ( index(status,host(X124)) != elec_2
| ~ leq(index(pendack,host(X124)),host(X124))
| ~ epred1_3(X121,X120,X119) )
& ( ~ elem(m_Ack(X127,X125),queue(host(X126)))
| ~ leq(host(X125),host(X127))
| ~ epred1_3(X121,X120,X119) )
& ( X129 = X128
| host(X129) != host(X128)
| ~ setIn(X128,alive)
| ~ setIn(X129,alive)
| ~ epred1_3(X121,X120,X119) )
& ( ~ setIn(X131,alive)
| index(status,host(X131)) != elec_2
| ~ elem(m_Ack(X130,X131),queue(host(X130)))
| ~ epred1_3(X121,X120,X119) )
& ( index(status,host(X132)) != elec_1
| ~ setIn(X132,alive)
| index(elid,host(X132)) = X132
| ~ epred1_3(X121,X120,X119) )
& ( index(status,host(X132)) != elec_2
| ~ setIn(X132,alive)
| index(elid,host(X132)) = X132
| ~ epred1_3(X121,X120,X119) )
& ( ~ setIn(X133,alive)
| ~ setIn(X134,alive)
| ~ setIn(host(X134),index(down,host(X133)))
| index(status,host(X134)) != elec_2
| leq(index(pendack,host(X134)),host(X133))
| ~ epred1_3(X121,X120,X119) )
& ( leq(host(X137),host(X135))
| ~ setIn(X135,alive)
| ~ setIn(X137,alive)
| host(X137) != host(X136)
| index(status,host(X137)) != elec_2
| ~ elem(m_Down(X136),queue(host(X135)))
| ~ epred1_3(X121,X120,X119) )
& ( leq(host(X138),host(X139))
| ~ setIn(X138,alive)
| ~ setIn(X139,alive)
| index(status,host(X138)) != elec_2
| index(status,host(X139)) != elec_2
| leq(index(pendack,host(X139)),host(X138))
| ~ epred1_3(X121,X120,X119) )
& ( ~ setIn(X140,alive)
| ~ setIn(X142,alive)
| host(X142) != host(X141)
| index(status,host(X140)) != elec_2
| index(status,host(X142)) != elec_2
| ~ elem(m_Ack(X140,X141),queue(host(X140)))
| ~ epred1_3(X121,X120,X119) )
& ( ~ setIn(X143,alive)
| ~ setIn(X145,alive)
| ~ elem(m_Down(X144),queue(host(X143)))
| host(X145) != host(X144)
| index(status,host(X145)) != elec_2
| leq(index(pendack,host(X145)),host(X143))
| ~ epred1_3(X121,X120,X119) )
& ( leq(host(X146),host(X147))
| ~ setIn(X146,alive)
| ~ setIn(X147,alive)
| index(status,host(X146)) != elec_2
| index(status,host(X147)) != elec_2
| ~ leq(index(pendack,host(X146)),index(pendack,host(X147)))
| ~ epred1_3(X121,X120,X119) )
& ( queue(host(X119)) = cons(m_Down(X120),X121)
| ~ epred1_3(X121,X120,X119) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_17,negated_conjecture,
( leq(host(esk2_0),X1)
| setIn(X1,index(down,host(esk2_0)))
| X1 = host(esk3_0)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
~ leq(s(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( leq(X1,index(pendack,host(esk5_0)))
| ~ leq(X1,s(host(esk2_0))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,plain,
! [X39,X40] :
( ( ~ leq(X39,X40)
| leq(s(X39),s(X40)) )
& ( ~ leq(s(X39),s(X40))
| leq(X39,X40) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_63])]) ).
cnf(c_0_22,plain,
( leq(index(pendack,host(X2)),host(X1))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ setIn(host(X2),index(down,host(X1)))
| index(status,host(X2)) != elec_2
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( host(X1) = host(esk3_0)
| leq(host(esk2_0),host(X1))
| setIn(host(X1),index(down,host(esk2_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk2_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
~ leq(s(index(pendack,host(esk5_0))),s(host(esk2_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( leq(s(X1),s(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ leq(host(esk4_0),host(esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
host(esk2_0) = host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
epred1_3(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_31,plain,
! [X51,X52,X53] :
( ( ~ elem(X51,cons(X52,X53))
| X51 = X52
| elem(X51,X53) )
& ( X51 != X52
| elem(X51,cons(X52,X53)) )
& ( ~ elem(X51,X53)
| elem(X51,cons(X52,X53)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_32,plain,
( host(X1) = host(esk3_0)
| leq(index(pendack,host(X1)),host(esk2_0))
| leq(host(esk2_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
index(status,host(esk5_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
setIn(esk5_0,alive),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
~ leq(index(pendack,host(esk5_0)),host(esk2_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
~ leq(host(esk2_0),host(esk5_0)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( leq(index(pendack,host(X2)),host(X1))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X3),queue(host(X1)))
| host(X2) != host(X3)
| index(status,host(X2)) != elec_2
| ~ epred1_3(X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_38,negated_conjecture,
queue(host(esk2_0)) = cons(m_Down(esk3_0),esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( host(esk3_0) = host(esk5_0)
| ~ epred1_3(X1,X2,X3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( leq(index(pendack,host(X1)),host(esk2_0))
| index(status,host(X1)) != elec_2
| host(X1) != host(X2)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),cons(m_Down(esk3_0),esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).
cnf(c_0_42,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
host(esk3_0) = host(esk5_0),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
( leq(index(pendack,host(X1)),host(esk2_0))
| index(status,host(X1)) != elec_2
| host(X1) != host(esk5_0)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWV460+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 03:38:22 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.UHMzJv6ZS6/E---3.1_8886.p
% 80.36/10.60 # Version: 3.1pre001
% 80.36/10.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 80.36/10.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.36/10.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 80.36/10.60 # Starting new_bool_3 with 300s (1) cores
% 80.36/10.60 # Starting new_bool_1 with 300s (1) cores
% 80.36/10.60 # Starting sh5l with 300s (1) cores
% 80.36/10.60 # new_bool_3 with pid 8964 completed with status 0
% 80.36/10.60 # Result found by new_bool_3
% 80.36/10.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 80.36/10.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.36/10.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 80.36/10.60 # Starting new_bool_3 with 300s (1) cores
% 80.36/10.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 80.36/10.60 # Search class: FGHSM-FFMM21-MFFFFFNN
% 80.36/10.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 80.36/10.60 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 80.36/10.60 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 8967 completed with status 0
% 80.36/10.60 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 80.36/10.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 80.36/10.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.36/10.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 80.36/10.60 # Starting new_bool_3 with 300s (1) cores
% 80.36/10.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 80.36/10.60 # Search class: FGHSM-FFMM21-MFFFFFNN
% 80.36/10.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 80.36/10.60 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 80.36/10.60 # Preprocessing time : 0.003 s
% 80.36/10.60 # Presaturation interreduction done
% 80.36/10.60
% 80.36/10.60 # Proof found!
% 80.36/10.60 # SZS status Theorem
% 80.36/10.60 # SZS output start CNFRefutation
% See solution above
% 80.36/10.60 # Parsed axioms : 67
% 80.36/10.60 # Removed by relevancy pruning/SinE : 14
% 80.36/10.60 # Initial clauses : 96
% 80.36/10.60 # Removed in clause preprocessing : 6
% 80.36/10.60 # Initial clauses in saturation : 90
% 80.36/10.60 # Processed clauses : 39971
% 80.36/10.60 # ...of these trivial : 1090
% 80.36/10.60 # ...subsumed : 34972
% 80.36/10.60 # ...remaining for further processing : 3909
% 80.36/10.60 # Other redundant clauses eliminated : 12
% 80.36/10.60 # Clauses deleted for lack of memory : 0
% 80.36/10.60 # Backward-subsumed : 559
% 80.36/10.60 # Backward-rewritten : 121
% 80.36/10.60 # Generated clauses : 841998
% 80.36/10.60 # ...of the previous two non-redundant : 510713
% 80.36/10.60 # ...aggressively subsumed : 0
% 80.36/10.60 # Contextual simplify-reflections : 9
% 80.36/10.60 # Paramodulations : 841504
% 80.36/10.60 # Factorizations : 471
% 80.36/10.60 # NegExts : 0
% 80.36/10.60 # Equation resolutions : 21
% 80.36/10.60 # Total rewrite steps : 384472
% 80.36/10.60 # Propositional unsat checks : 0
% 80.36/10.60 # Propositional check models : 0
% 80.36/10.60 # Propositional check unsatisfiable : 0
% 80.36/10.60 # Propositional clauses : 0
% 80.36/10.60 # Propositional clauses after purity: 0
% 80.36/10.60 # Propositional unsat core size : 0
% 80.36/10.60 # Propositional preprocessing time : 0.000
% 80.36/10.60 # Propositional encoding time : 0.000
% 80.36/10.60 # Propositional solver time : 0.000
% 80.36/10.60 # Success case prop preproc time : 0.000
% 80.36/10.60 # Success case prop encoding time : 0.000
% 80.36/10.60 # Success case prop solver time : 0.000
% 80.36/10.60 # Current number of processed clauses : 3138
% 80.36/10.60 # Positive orientable unit clauses : 206
% 80.36/10.60 # Positive unorientable unit clauses: 0
% 80.36/10.60 # Negative unit clauses : 271
% 80.36/10.60 # Non-unit-clauses : 2661
% 80.36/10.60 # Current number of unprocessed clauses: 468541
% 80.36/10.60 # ...number of literals in the above : 1558623
% 80.36/10.60 # Current number of archived formulas : 0
% 80.36/10.60 # Current number of archived clauses : 766
% 80.36/10.60 # Clause-clause subsumption calls (NU) : 1329141
% 80.36/10.60 # Rec. Clause-clause subsumption calls : 1170897
% 80.36/10.60 # Non-unit clause-clause subsumptions : 10035
% 80.36/10.60 # Unit Clause-clause subsumption calls : 17371
% 80.36/10.60 # Rewrite failures with RHS unbound : 0
% 80.36/10.60 # BW rewrite match attempts : 4229
% 80.36/10.60 # BW rewrite match successes : 56
% 80.36/10.60 # Condensation attempts : 0
% 80.36/10.60 # Condensation successes : 0
% 80.36/10.60 # Termbank termtop insertions : 15222523
% 80.36/10.60
% 80.36/10.60 # -------------------------------------------------
% 80.36/10.60 # User time : 9.717 s
% 80.36/10.60 # System time : 0.289 s
% 80.36/10.60 # Total time : 10.007 s
% 80.36/10.60 # Maximum resident set size: 2176 pages
% 80.36/10.60
% 80.36/10.60 # -------------------------------------------------
% 80.36/10.60 # User time : 9.720 s
% 80.36/10.60 # System time : 0.291 s
% 80.36/10.60 # Total time : 10.011 s
% 80.36/10.60 # Maximum resident set size: 1772 pages
% 80.36/10.60 % E---3.1 exiting
%------------------------------------------------------------------------------