TSTP Solution File: SWV460+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV460+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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 : 600s
% DateTime : Wed Jul 20 18:16:53 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 385 ( 135 equ)
% Maximal formula atoms : 72 ( 8 avg)
% Number of connectives : 507 ( 166 ~; 118 |; 162 &)
% ( 4 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 7 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 : 189 ( 24 sgn 153 !; 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/solver/bin/../tmp/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
fof(axiom_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( X5 = s(X6)
| leq(X5,X6) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
fof(axiom_58,axiom,
! [X5] : ~ leq(s(X5),X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_58) ).
fof(c_0_6,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
<=> ( ! [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,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
=> ( ! [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_8,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X5,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))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_6]) ).
fof(c_0_9,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( ~ elem(X7,cons(X8,X9))
| X7 = X8
| elem(X7,X9) )
& ( X7 != X8
| elem(X7,cons(X8,X9)) )
& ( ~ elem(X7,X9)
| elem(X7,cons(X8,X9)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])])]) ).
fof(c_0_10,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39,X40,X41,X42,X43,X44] :
( ( ~ elem(m_Halt(X20),queue(host(X19)))
| ~ leq(host(X19),host(X20))
| ~ epred1_3(X18,X17,X16) )
& ( index(status,host(X21)) != elec_2
| ~ leq(index(pendack,host(X21)),host(X21))
| ~ epred1_3(X18,X17,X16) )
& ( ~ elem(m_Ack(X24,X22),queue(host(X23)))
| ~ leq(host(X22),host(X24))
| ~ epred1_3(X18,X17,X16) )
& ( X26 = X25
| host(X26) != host(X25)
| ~ setIn(X25,alive)
| ~ setIn(X26,alive)
| ~ epred1_3(X18,X17,X16) )
& ( ~ setIn(X28,alive)
| index(status,host(X28)) != elec_2
| ~ elem(m_Ack(X27,X28),queue(host(X27)))
| ~ epred1_3(X18,X17,X16) )
& ( index(status,host(X29)) != elec_1
| ~ setIn(X29,alive)
| index(elid,host(X29)) = X29
| ~ epred1_3(X18,X17,X16) )
& ( index(status,host(X29)) != elec_2
| ~ setIn(X29,alive)
| index(elid,host(X29)) = X29
| ~ epred1_3(X18,X17,X16) )
& ( ~ setIn(X30,alive)
| ~ setIn(X31,alive)
| ~ setIn(host(X31),index(down,host(X30)))
| index(status,host(X31)) != elec_2
| leq(index(pendack,host(X31)),host(X30))
| ~ epred1_3(X18,X17,X16) )
& ( leq(host(X34),host(X32))
| ~ setIn(X32,alive)
| ~ setIn(X34,alive)
| host(X34) != host(X33)
| index(status,host(X34)) != elec_2
| ~ elem(m_Down(X33),queue(host(X32)))
| ~ epred1_3(X18,X17,X16) )
& ( leq(host(X35),host(X36))
| ~ setIn(X35,alive)
| ~ setIn(X36,alive)
| index(status,host(X35)) != elec_2
| index(status,host(X36)) != elec_2
| leq(index(pendack,host(X36)),host(X35))
| ~ epred1_3(X18,X17,X16) )
& ( ~ setIn(X37,alive)
| ~ setIn(X39,alive)
| host(X39) != host(X38)
| index(status,host(X37)) != elec_2
| index(status,host(X39)) != elec_2
| ~ elem(m_Ack(X37,X38),queue(host(X37)))
| ~ epred1_3(X18,X17,X16) )
& ( ~ setIn(X40,alive)
| ~ setIn(X42,alive)
| ~ elem(m_Down(X41),queue(host(X40)))
| host(X42) != host(X41)
| index(status,host(X42)) != elec_2
| leq(index(pendack,host(X42)),host(X40))
| ~ epred1_3(X18,X17,X16) )
& ( leq(host(X43),host(X44))
| ~ setIn(X43,alive)
| ~ setIn(X44,alive)
| index(status,host(X43)) != elec_2
| index(status,host(X44)) != elec_2
| ~ leq(index(pendack,host(X43)),index(pendack,host(X44)))
| ~ epred1_3(X18,X17,X16) )
& ( queue(host(X18)) = cons(m_Down(X17),X16)
| ~ epred1_3(X18,X17,X16) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X21] :
( epred1_3(esk6_0,esk7_0,esk5_0)
& setIn(esk6_0,alive)
& ~ leq(host(esk6_0),host(esk7_0))
& ( index(ldr,host(esk6_0)) != host(esk7_0)
| index(status,host(esk6_0)) != norm )
& ( index(status,host(esk6_0)) != wait
| host(esk7_0) != host(index(elid,host(esk6_0))) )
& ( leq(host(esk6_0),X21)
| ~ leq(s(zero),X21)
| setIn(X21,index(down,host(esk6_0)))
| X21 = host(esk7_0) )
& index(status,host(esk6_0)) = elec_1
& ~ leq(nbr_proc,host(esk6_0))
& host(esk6_0) = host(esk8_0)
& host(esk6_0) != host(esk9_0)
& ~ leq(host(esk8_0),host(esk9_0))
& setIn(esk8_0,alive)
& setIn(esk9_0,alive)
& index(status,host(esk9_0)) = elec_2
& leq(s(host(esk6_0)),index(pendack,host(esk9_0))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])])]) ).
cnf(c_0_12,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
epred1_3(esk6_0,esk7_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X7,X8,X7,X8] :
( ( ~ leq(X7,X8)
| ~ leq(X8,X7)
| X7 = X8 )
& ( leq(X7,X8)
| X7 != X8 )
& ( leq(X8,X7)
| X7 != X8 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_61])])])])]) ).
fof(c_0_16,plain,
! [X4] : leq(s(zero),host(X4)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_17,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
leq(s(host(esk6_0)),index(pendack,host(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X7,X8,X7,X8] :
( ( ~ leq(X7,s(X8))
| X7 = s(X8)
| leq(X7,X8) )
& ( X7 != s(X8)
| leq(X7,s(X8)) )
& ( ~ leq(X7,X8)
| leq(X7,s(X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])])])]) ).
cnf(c_0_22,negated_conjecture,
( X1 = host(esk7_0)
| setIn(X1,index(down,host(esk6_0)))
| leq(host(esk6_0),X1)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( leq(index(pendack,host(X4)),host(X5))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != elec_2
| host(X4) != host(X6)
| ~ elem(m_Down(X6),queue(host(X5)))
| ~ setIn(X4,alive)
| ~ setIn(X5,alive) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_27,plain,
! [X6] : ~ leq(s(X6),X6),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_58])]) ).
cnf(c_0_28,negated_conjecture,
( s(host(esk6_0)) = index(pendack,host(esk9_0))
| ~ leq(index(pendack,host(esk9_0)),s(host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( leq(X1,s(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( leq(index(pendack,host(X4)),host(X5))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != elec_2
| ~ setIn(host(X4),index(down,host(X5)))
| ~ setIn(X4,alive)
| ~ setIn(X5,alive) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( host(X1) = host(esk7_0)
| leq(host(esk6_0),host(X1))
| setIn(host(X1),index(down,host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( leq(index(pendack,host(X1)),host(esk6_0))
| index(status,host(X1)) != elec_2
| host(X1) != host(esk7_0)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
~ leq(s(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( s(host(esk6_0)) = index(pendack,host(esk9_0))
| ~ leq(index(pendack,host(esk9_0)),host(esk6_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( leq(index(pendack,host(X1)),host(esk6_0))
| leq(host(esk6_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ leq(host(esk8_0),host(esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,negated_conjecture,
host(esk6_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,negated_conjecture,
~ leq(index(pendack,host(esk9_0)),host(esk6_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( leq(index(pendack,host(X1)),host(esk6_0))
| leq(host(esk6_0),host(X1))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_40,negated_conjecture,
index(status,host(esk9_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
~ leq(host(esk6_0),host(esk9_0)),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV460+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n011.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 21:17:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.020 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 44
% 0.24/1.42 # Proof object clause steps : 28
% 0.24/1.42 # Proof object formula steps : 16
% 0.24/1.42 # Proof object conjectures : 20
% 0.24/1.42 # Proof object clause conjectures : 17
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 16
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 10
% 0.24/1.42 # Proof object simplifying inferences : 11
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 67
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 125
% 0.24/1.42 # Removed in clause preprocessing : 6
% 0.24/1.42 # Initial clauses in saturation : 119
% 0.24/1.42 # Processed clauses : 6383
% 0.24/1.42 # ...of these trivial : 144
% 0.24/1.42 # ...subsumed : 4773
% 0.24/1.42 # ...remaining for further processing : 1466
% 0.24/1.42 # Other redundant clauses eliminated : 26
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 45
% 0.24/1.42 # Backward-rewritten : 46
% 0.24/1.42 # Generated clauses : 48802
% 0.24/1.42 # ...of the previous two non-trivial : 36659
% 0.24/1.42 # Contextual simplify-reflections : 1275
% 0.24/1.42 # Paramodulations : 48677
% 0.24/1.42 # Factorizations : 23
% 0.24/1.42 # Equation resolutions : 100
% 0.24/1.42 # Current number of processed clauses : 1369
% 0.24/1.42 # Positive orientable unit clauses : 116
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 180
% 0.24/1.42 # Non-unit-clauses : 1073
% 0.24/1.42 # Current number of unprocessed clauses: 27436
% 0.24/1.42 # ...number of literals in the above : 107088
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 93
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1327796
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 783603
% 0.24/1.42 # Non-unit clause-clause subsumptions : 2357
% 0.24/1.42 # Unit Clause-clause subsumption calls : 40055
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 699
% 0.24/1.42 # BW rewrite match successes : 15
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 756389
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.849 s
% 0.24/1.42 # System time : 0.018 s
% 0.24/1.42 # Total time : 0.867 s
% 0.24/1.42 # Maximum resident set size: 26748 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------