%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV462+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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.40s 26.59s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 105 ( 47 unt; 0 def)
% Number of atoms : 620 ( 249 equ)
% Maximal formula atoms : 114 ( 5 avg)
% Number of connectives : 820 ( 305 ~; 220 |; 220 &)
% ( 12 <=>; 63 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-3 aty)
% Number of functors : 29 ( 29 usr; 18 con; 0-7 aty)
% Number of variables : 328 ( 49 sgn 245 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5] :
( ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X6,alive)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X6)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X6,X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) )
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( setIn(X18,alive)
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& index(status,host(X18)) = elec_2
& host(X7) = index(pendack,host(X18))
& host(X17) = s(index(pendack,host(X18))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
fof(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_61,axiom,
! [X5,X6] :
( ( leq(X5,X6)
& leq(X6,X5) )
<=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
fof(axiom_12,axiom,
! [X5,X6,X7] : m_Ack(X5,X6) != m_Down(X7),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_12) ).
fof(axiom_31,axiom,
! [X8,X9,X10,X11] :
( X8 != X9
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_31) ).
fof(axiom_59,axiom,
! [X5] : leq(X5,X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_59) ).
fof(axiom_64,axiom,
! [X5,X6] :
( leq(X5,s(X6))
<=> ( X5 = s(X6)
| leq(X5,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
fof(axiom_32,axiom,
! [X8,X9,X10,X11] :
( X10 != X11
=> m_Ack(X8,X10) != m_Ack(X9,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_32) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(c_0_10,plain,
! [X12,X5,X13] :
( epred1_3(X13,X5,X12)
<=> ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X6,alive)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X6)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X6,X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
introduced(definition) ).
fof(c_0_11,plain,
! [X12,X5,X13] :
( epred1_3(X13,X5,X12)
=> ( ! [X6,X7] :
( elem(m_Ldr(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X7) != host(X6) )
& ! [X6,X7] :
( elem(m_Halt(X7),queue(host(X6)))
=> ~ leq(host(X6),host(X7)) )
& ! [X6,X7,X14] :
( elem(m_Ack(X14,X6),queue(host(X7)))
=> ~ leq(host(X6),host(X14)) )
& ! [X6,X7] :
( ( X7 != X6
& host(X7) = host(X6) )
=> ( ~ setIn(X6,alive)
| ~ setIn(X7,alive) ) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& elem(m_Ack(X7,X6),queue(host(X7))) )
=> leq(host(X6),index(pendack,host(X7))) )
& ! [X6,X7] :
( ( setIn(X7,alive)
& index(status,host(X7)) = elec_1 )
=> ~ elem(m_Ack(X7,X6),queue(host(X7))) )
& ! [X6] :
( ( ( index(status,host(X6)) = elec_1
| index(status,host(X6)) = elec_2 )
& setIn(X6,alive) )
=> index(elid,host(X6)) = X6 )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> leq(index(pendack,host(X7)),host(X6)) )
& ! [X6,X7,X14] :
( ( setIn(X14,alive)
& elem(m_Down(X7),queue(host(X14)))
& host(X7) = host(X6) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X14] :
( ( setIn(X6,alive)
& setIn(X14,alive)
& host(X14) = host(X7)
& index(status,host(X6)) = elec_2
& index(status,host(X14)) = elec_2 )
=> ~ elem(m_Ack(X6,X7),queue(host(X6))) )
& ! [X6,X7] :
( ( ~ leq(host(X6),host(X7))
& setIn(X6,alive)
& setIn(X7,alive)
& index(status,host(X6)) = elec_2
& index(status,host(X7)) = elec_2 )
=> ~ leq(index(pendack,host(X6)),index(pendack,host(X7))) )
& ! [X6,X7,X14] :
( ( ~ leq(index(pendack,host(X14)),host(X6))
& setIn(X14,alive)
& elem(m_Halt(X14),queue(host(X7)))
& index(status,host(X14)) = elec_2 )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& ! [X6,X7,X15,X14] :
( ( ! [X16] :
( ( ~ leq(host(X14),X16)
& leq(s(zero),X16) )
=> ( setIn(X16,index(down,host(X14)))
| X16 = host(X15) ) )
& elem(m_Down(X15),queue(host(X14)))
& host(X14) = host(X7)
& host(X14) = nbr_proc
& index(status,host(X14)) = elec_1 )
=> ~ ( setIn(X6,alive)
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X6,X7,X15,X14] :
( ( setIn(X14,alive)
& elem(m_Ack(X14,X7),queue(host(X14)))
& elem(m_Down(X15),queue(host(X14)))
& leq(nbr_proc,s(index(pendack,host(X14))))
& index(status,host(X14)) = elec_2
& host(X7) = index(pendack,host(X14))
& host(X15) = s(index(pendack,host(X14))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) )
& queue(host(X13)) = cons(m_Halt(X5),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_10]) ).
fof(c_0_12,negated_conjecture,
~ ! [X12,X13,X5] :
( epred1_3(X13,X5,X12)
=> ( setIn(X13,alive)
=> ! [X6] :
( host(X13) != host(X6)
=> ! [X7,X17,X18] :
( host(X5) = host(X18)
=> ( host(X13) != host(X18)
=> ( ( setIn(X18,alive)
& leq(nbr_proc,s(index(pendack,host(X18))))
& elem(m_Down(X17),snoc(queue(host(X18)),m_Ack(X5,X13)))
& elem(m_Ack(X18,X7),snoc(queue(host(X18)),m_Ack(X5,X13)))
& index(status,host(X18)) = elec_2
& host(X7) = index(pendack,host(X18))
& host(X17) = s(index(pendack,host(X18))) )
=> ~ ( setIn(X6,alive)
& index(ldr,host(X6)) = host(X6)
& index(status,host(X6)) = norm ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_10]) ).
fof(c_0_13,plain,
! [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,X45,X46,X47,X48,X49,X50,X51,X52,X55,X56,X57,X54] :
( ( ~ elem(m_Ldr(X21),queue(host(X20)))
| ~ leq(host(X20),host(X21))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Down(X23),queue(host(X22)))
| host(X23) != host(X22)
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Halt(X25),queue(host(X24)))
| ~ leq(host(X24),host(X25))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Ack(X28,X26),queue(host(X27)))
| ~ leq(host(X26),host(X28))
| ~ epred1_3(X19,X18,X17) )
& ( X30 = X29
| host(X30) != host(X29)
| ~ setIn(X29,alive)
| ~ setIn(X30,alive)
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X32,alive)
| ~ elem(m_Ack(X32,X31),queue(host(X32)))
| leq(host(X31),index(pendack,host(X32)))
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X34,alive)
| index(status,host(X34)) != elec_1
| ~ elem(m_Ack(X34,X33),queue(host(X34)))
| ~ epred1_3(X19,X18,X17) )
& ( index(status,host(X35)) != elec_1
| ~ setIn(X35,alive)
| index(elid,host(X35)) = X35
| ~ epred1_3(X19,X18,X17) )
& ( index(status,host(X35)) != elec_2
| ~ setIn(X35,alive)
| index(elid,host(X35)) = X35
| ~ epred1_3(X19,X18,X17) )
& ( leq(host(X36),host(X37))
| ~ setIn(X36,alive)
| ~ setIn(X37,alive)
| index(status,host(X36)) != elec_2
| index(status,host(X37)) != elec_2
| leq(index(pendack,host(X37)),host(X36))
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X40,alive)
| ~ elem(m_Down(X39),queue(host(X40)))
| host(X39) != host(X38)
| ~ setIn(X38,alive)
| index(ldr,host(X38)) != host(X38)
| index(status,host(X38)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X41,alive)
| ~ setIn(X43,alive)
| host(X43) != host(X42)
| index(status,host(X41)) != elec_2
| index(status,host(X43)) != elec_2
| ~ elem(m_Ack(X41,X42),queue(host(X41)))
| ~ epred1_3(X19,X18,X17) )
& ( leq(host(X44),host(X45))
| ~ setIn(X44,alive)
| ~ setIn(X45,alive)
| index(status,host(X44)) != elec_2
| index(status,host(X45)) != elec_2
| ~ leq(index(pendack,host(X44)),index(pendack,host(X45)))
| ~ epred1_3(X19,X18,X17) )
& ( leq(index(pendack,host(X48)),host(X46))
| ~ setIn(X48,alive)
| ~ elem(m_Halt(X48),queue(host(X47)))
| index(status,host(X48)) != elec_2
| ~ setIn(X46,alive)
| index(ldr,host(X46)) != host(X46)
| index(status,host(X46)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( ~ leq(host(X52),esk8_7(X17,X18,X19,X49,X50,X51,X52))
| ~ elem(m_Down(X51),queue(host(X52)))
| host(X52) != host(X50)
| host(X52) != nbr_proc
| index(status,host(X52)) != elec_1
| ~ setIn(X49,alive)
| ~ elem(m_Down(X50),queue(host(X49)))
| ~ epred1_3(X19,X18,X17) )
& ( leq(s(zero),esk8_7(X17,X18,X19,X49,X50,X51,X52))
| ~ elem(m_Down(X51),queue(host(X52)))
| host(X52) != host(X50)
| host(X52) != nbr_proc
| index(status,host(X52)) != elec_1
| ~ setIn(X49,alive)
| ~ elem(m_Down(X50),queue(host(X49)))
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(esk8_7(X17,X18,X19,X49,X50,X51,X52),index(down,host(X52)))
| ~ elem(m_Down(X51),queue(host(X52)))
| host(X52) != host(X50)
| host(X52) != nbr_proc
| index(status,host(X52)) != elec_1
| ~ setIn(X49,alive)
| ~ elem(m_Down(X50),queue(host(X49)))
| ~ epred1_3(X19,X18,X17) )
& ( esk8_7(X17,X18,X19,X49,X50,X51,X52) != host(X51)
| ~ elem(m_Down(X51),queue(host(X52)))
| host(X52) != host(X50)
| host(X52) != nbr_proc
| index(status,host(X52)) != elec_1
| ~ setIn(X49,alive)
| ~ elem(m_Down(X50),queue(host(X49)))
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X57,alive)
| ~ elem(m_Ack(X57,X55),queue(host(X57)))
| ~ elem(m_Down(X56),queue(host(X57)))
| ~ leq(nbr_proc,s(index(pendack,host(X57))))
| index(status,host(X57)) != elec_2
| host(X55) != index(pendack,host(X57))
| host(X56) != s(index(pendack,host(X57)))
| ~ setIn(X54,alive)
| index(ldr,host(X54)) != host(X54)
| index(status,host(X54)) != norm
| ~ epred1_3(X19,X18,X17) )
& ( queue(host(X19)) = cons(m_Halt(X18),X17)
| ~ epred1_3(X19,X18,X17) ) ),
inference(distribute,[status(thm)],[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_11])])])])])])])]) ).
fof(c_0_14,plain,
( ~ epred18_0
<=> ! [X3,X2,X1] : ~ epred1_3(X1,X2,X3) ),
introduced(definition) ).
fof(c_0_15,negated_conjecture,
( epred1_3(esk2_0,esk3_0,esk1_0)
& setIn(esk2_0,alive)
& host(esk2_0) != host(esk4_0)
& host(esk3_0) = host(esk7_0)
& host(esk2_0) != host(esk7_0)
& setIn(esk7_0,alive)
& leq(nbr_proc,s(index(pendack,host(esk7_0))))
& elem(m_Down(esk6_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0)))
& elem(m_Ack(esk7_0,esk5_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0)))
& index(status,host(esk7_0)) = elec_2
& host(esk5_0) = index(pendack,host(esk7_0))
& host(esk6_0) = s(index(pendack,host(esk7_0)))
& setIn(esk4_0,alive)
& index(ldr,host(esk4_0)) = host(esk4_0)
& index(status,host(esk4_0)) = norm ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_16,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
fof(c_0_17,plain,
( ~ epred16_0
<=> ! [X7,X6,X5] :
( ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Ack(X6,X7),queue(host(X6)))
| ~ setIn(X6,alive)
| ~ leq(nbr_proc,s(index(pendack,host(X6))))
| index(status,host(X6)) != elec_2
| host(X7) != index(pendack,host(X6))
| host(X5) != s(index(pendack,host(X6))) ) ),
introduced(definition) ).
fof(c_0_18,plain,
( ~ epred17_0
<=> ! [X4] :
( ~ setIn(X4,alive)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4) ) ),
introduced(definition) ).
cnf(c_0_19,plain,
( ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| host(X5) != s(index(pendack,host(X6)))
| host(X7) != index(pendack,host(X6))
| index(status,host(X6)) != elec_2
| ~ leq(nbr_proc,s(index(pendack,host(X6))))
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Ack(X6,X7),queue(host(X6)))
| ~ setIn(X6,alive) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( epred18_0
| ~ epred1_3(X1,X2,X3) ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
epred1_3(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( ~ elem(X7,snoc(X9,X8))
| X7 = X8
| elem(X7,X9) )
& ( X7 != X8
| elem(X7,snoc(X9,X8)) )
& ( ~ elem(X7,X9)
| elem(X7,snoc(X9,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_47])])])])]) ).
fof(c_0_23,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])])])])]) ).
cnf(c_0_24,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
host(esk6_0) = s(index(pendack,host(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ epred18_0
| ~ epred17_0
| ~ epred16_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_17]),c_0_18]),c_0_14]) ).
cnf(c_0_27,negated_conjecture,
epred18_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( epred17_0
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ setIn(X1,alive) ),
inference(split_equiv,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
index(ldr,host(esk4_0)) = host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
index(status,host(esk4_0)) = norm,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,negated_conjecture,
setIn(esk4_0,alive),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_32,plain,
( ~ epred28_0
<=> ! [X2] :
( ~ elem(m_Ack(esk7_0,X2),queue(host(esk7_0)))
| host(X2) != index(pendack,host(esk7_0)) ) ),
introduced(definition) ).
cnf(c_0_33,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
elem(m_Ack(esk7_0,esk5_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk7_0)))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_37,negated_conjecture,
leq(s(index(pendack,host(esk7_0))),nbr_proc),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_38,plain,
( ~ epred17_0
| ~ epred16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_39,negated_conjecture,
epred17_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
fof(c_0_40,plain,
! [X8,X9,X10] : m_Ack(X8,X9) != m_Down(X10),
inference(variable_rename,[status(thm)],[axiom_12]) ).
fof(c_0_41,plain,
! [X12,X13,X14,X15] :
( X12 = X13
| m_Ack(X12,X14) != m_Ack(X13,X15) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_31])])])]) ).
cnf(c_0_42,plain,
( epred28_0
| host(X1) != index(pendack,host(esk7_0))
| ~ elem(m_Ack(esk7_0,X1),queue(host(esk7_0))) ),
inference(split_equiv,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( m_Ack(esk7_0,esk5_0) = m_Ack(esk3_0,esk2_0)
| elem(m_Ack(esk7_0,esk5_0),queue(host(esk7_0))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
host(esk5_0) = index(pendack,host(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_45,negated_conjecture,
nbr_proc = s(index(pendack,host(esk7_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_46,plain,
~ epred16_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
fof(c_0_47,plain,
! [X6] : leq(X6,X6),
inference(variable_rename,[status(thm)],[axiom_59]) ).
fof(c_0_48,plain,
( ~ epred27_0
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(host(esk7_0)))
| host(X1) != s(index(pendack,host(esk7_0))) ) ),
introduced(definition) ).
cnf(c_0_49,negated_conjecture,
elem(m_Down(esk6_0),snoc(queue(host(esk7_0)),m_Ack(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_50,plain,
m_Ack(X1,X2) != m_Down(X3),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_51,plain,
( ~ epred13_0
<=> ! [X3,X2,X1] : ~ epred1_3(X1,X2,X3) ),
introduced(definition) ).
cnf(c_0_52,plain,
( X1 = X3
| m_Ack(X1,X2) != m_Ack(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_53,negated_conjecture,
( m_Ack(esk7_0,esk5_0) = m_Ack(esk3_0,esk2_0)
| epred28_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_54,plain,
( host(X1) != s(index(pendack,host(X2)))
| host(X3) != index(pendack,host(X2))
| index(status,host(X2)) != elec_2
| ~ leq(s(index(pendack,host(esk7_0))),s(index(pendack,host(X2))))
| ~ setIn(X2,alive)
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ elem(m_Down(X1),queue(host(X2))) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_17]),c_0_45]),c_0_46]) ).
cnf(c_0_55,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
index(status,host(esk7_0)) = elec_2,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_57,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_58,plain,
( epred27_0
| host(X1) != s(index(pendack,host(esk7_0)))
| ~ elem(m_Down(X1),queue(host(esk7_0))) ),
inference(split_equiv,[status(thm)],[c_0_48]) ).
cnf(c_0_59,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk7_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_49]),c_0_50]) ).
fof(c_0_60,plain,
( ~ epred12_0
<=> ! [X6,X5,X4] :
( ~ elem(m_Down(X5),queue(host(X6)))
| ~ setIn(X4,alive)
| ~ setIn(X6,alive)
| host(X4) != host(X5)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4) ) ),
introduced(definition) ).
cnf(c_0_61,plain,
( ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| host(X5) != host(X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ setIn(X6,alive) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_62,plain,
( epred13_0
| ~ epred1_3(X1,X2,X3) ),
inference(split_equiv,[status(thm)],[c_0_51]) ).
cnf(c_0_63,negated_conjecture,
( esk7_0 = X1
| epred28_0
| m_Ack(esk3_0,esk2_0) != m_Ack(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_64,plain,
( ~ epred28_0
| ~ epred27_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57])]),c_0_48]),c_0_32]) ).
cnf(c_0_65,negated_conjecture,
epred27_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_25])]) ).
cnf(c_0_66,plain,
( ~ epred13_0
| ~ epred12_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_61,c_0_60]),c_0_51]) ).
cnf(c_0_67,negated_conjecture,
epred13_0,
inference(spm,[status(thm)],[c_0_62,c_0_21]) ).
cnf(c_0_68,negated_conjecture,
( esk3_0 = esk7_0
| epred28_0 ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_69,plain,
~ epred28_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_70,plain,
~ epred12_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
fof(c_0_71,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])])])])]) ).
fof(c_0_72,plain,
! [X12,X13,X14,X15] :
( X14 = X15
| m_Ack(X12,X14) != m_Ack(X13,X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_32])]) ).
cnf(c_0_73,negated_conjecture,
esk3_0 = esk7_0,
inference(sr,[status(thm)],[c_0_68,c_0_69]) ).
fof(c_0_74,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])])])])]) ).
cnf(c_0_75,plain,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| host(X1) != host(X2)
| ~ setIn(X1,alive)
| ~ setIn(X3,alive)
| ~ elem(m_Down(X2),queue(host(X3))) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_60]),c_0_70]) ).
cnf(c_0_76,plain,
( leq(X1,X2)
| X1 = s(X2)
| ~ leq(X1,s(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_77,plain,
leq(host(X1),s(index(pendack,host(esk7_0)))),
inference(rw,[status(thm)],[c_0_24,c_0_45]) ).
cnf(c_0_78,plain,
( X2 = X4
| m_Ack(X1,X2) != m_Ack(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,negated_conjecture,
m_Ack(esk7_0,esk5_0) = m_Ack(esk7_0,esk2_0),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_53,c_0_69]),c_0_73]) ).
cnf(c_0_80,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_81,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_82,negated_conjecture,
( host(X1) != s(index(pendack,host(esk7_0)))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_59]),c_0_25]),c_0_57])]) ).
cnf(c_0_83,plain,
( host(X1) = s(index(pendack,host(esk7_0)))
| leq(host(X1),index(pendack,host(esk7_0))) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
( X1 = esk5_0
| m_Ack(X2,X1) != m_Ack(esk7_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_85,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_80]) ).
cnf(c_0_86,negated_conjecture,
cons(m_Halt(esk3_0),esk1_0) = queue(host(esk2_0)),
inference(spm,[status(thm)],[c_0_81,c_0_21]) ).
cnf(c_0_87,negated_conjecture,
host(esk4_0) != s(index(pendack,host(esk7_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_88,plain,
( host(X1) = host(X2)
| leq(host(X1),index(pendack,host(esk7_0)))
| leq(host(X2),index(pendack,host(esk7_0))) ),
inference(pm,[status(thm)],[c_0_83,c_0_83]) ).
cnf(c_0_89,negated_conjecture,
esk5_0 = esk2_0,
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_90,plain,
( leq(index(pendack,host(X5)),host(X4))
| ~ epred1_3(X1,X2,X3)
| index(status,host(X4)) != norm
| index(ldr,host(X4)) != host(X4)
| ~ setIn(X4,alive)
| index(status,host(X5)) != elec_2
| ~ elem(m_Halt(X5),queue(host(X6)))
| ~ setIn(X5,alive) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_91,negated_conjecture,
elem(m_Halt(esk3_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_92,negated_conjecture,
host(esk3_0) = host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_93,negated_conjecture,
( leq(host(esk4_0),index(pendack,host(esk7_0)))
| leq(host(X1),index(pendack,host(esk7_0))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_87,c_0_88]),c_0_83]) ).
cnf(c_0_94,negated_conjecture,
host(esk2_0) != host(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_95,negated_conjecture,
host(esk2_0) = index(pendack,host(esk7_0)),
inference(rw,[status(thm)],[c_0_44,c_0_89]) ).
cnf(c_0_96,plain,
( leq(index(pendack,host(esk7_0)),host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk3_0,alive)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),c_0_92]),c_0_56])]) ).
cnf(c_0_97,negated_conjecture,
leq(host(esk4_0),index(pendack,host(esk7_0))),
inference(ef,[status(thm)],[c_0_93]) ).
cnf(c_0_98,negated_conjecture,
host(esk4_0) != index(pendack,host(esk7_0)),
inference(rw,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,negated_conjecture,
( epred28_0
| epred1_3(esk2_0,esk7_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_68]) ).
cnf(c_0_100,plain,
( leq(index(pendack,host(esk7_0)),host(X1))
| index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| ~ epred1_3(X2,X3,X4)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_73]),c_0_57])]) ).
cnf(c_0_101,negated_conjecture,
~ leq(index(pendack,host(esk7_0)),host(esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_97]),c_0_98]) ).
cnf(c_0_102,negated_conjecture,
epred1_3(esk2_0,esk7_0,esk1_0),
inference(sr,[status(thm)],[c_0_99,c_0_69]) ).
cnf(c_0_103,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_29]),c_0_30]),c_0_31])]),c_0_101]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_102,c_0_103]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV462+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 19:23:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/23.40 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/26.59 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.40/26.59
% 0.40/26.59 # Failure: Resource limit exceeded (time)
% 0.40/26.59 # OLD status Res
% 0.40/26.59 # Preprocessing time : 0.021 s
% 0.40/26.59 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.40/26.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.40/26.59 # Preprocessing time : 0.022 s
% 0.40/26.59
% 0.40/26.59 # Proof found!
% 0.40/26.59 # SZS status Theorem
% 0.40/26.59 # SZS output start CNFRefutation
% See solution above
% 0.40/26.59 # Proof object total steps : 105
% 0.40/26.59 # Proof object clause steps : 74
% 0.40/26.59 # Proof object formula steps : 31
% 0.40/26.59 # Proof object conjectures : 44
% 0.40/26.59 # Proof object clause conjectures : 41
% 0.40/26.59 # Proof object formula conjectures : 3
% 0.40/26.59 # Proof object initial clauses used : 31
% 0.40/26.59 # Proof object initial formulas used : 10
% 0.40/26.59 # Proof object generating inferences : 26
% 0.40/26.59 # Proof object simplifying inferences : 59
% 0.40/26.59 # Training examples: 0 positive, 0 negative
% 0.40/26.59 # Parsed axioms : 67
% 0.40/26.59 # Removed by relevancy pruning/SinE : 14
% 0.40/26.59 # Initial clauses : 102
% 0.40/26.59 # Removed in clause preprocessing : 6
% 0.40/26.59 # Initial clauses in saturation : 96
% 0.40/26.59 # Processed clauses : 5907
% 0.40/26.59 # ...of these trivial : 145
% 0.40/26.59 # ...subsumed : 4173
% 0.40/26.59 # ...remaining for further processing : 1589
% 0.40/26.59 # Other redundant clauses eliminated : 15
% 0.40/26.59 # Clauses deleted for lack of memory : 0
% 0.40/26.59 # Backward-subsumed : 135
% 0.40/26.59 # Backward-rewritten : 142
% 0.40/26.59 # Generated clauses : 63024
% 0.40/26.59 # ...of the previous two non-trivial : 47344
% 0.40/26.59 # Contextual simplify-reflections : 2057
% 0.40/26.59 # Paramodulations : 62744
% 0.40/26.59 # Factorizations : 45
% 0.40/26.59 # Equation resolutions : 128
% 0.40/26.59 # Current number of processed clauses : 1290
% 0.40/26.59 # Positive orientable unit clauses : 72
% 0.40/26.59 # Positive unorientable unit clauses: 0
% 0.40/26.59 # Negative unit clauses : 124
% 0.40/26.59 # Non-unit-clauses : 1094
% 0.40/26.59 # Current number of unprocessed clauses: 35714
% 0.40/26.59 # ...number of literals in the above : 136569
% 0.40/26.59 # Current number of archived formulas : 0
% 0.40/26.59 # Current number of archived clauses : 287
% 0.40/26.59 # Clause-clause subsumption calls (NU) : 1309657
% 0.40/26.59 # Rec. Clause-clause subsumption calls : 501883
% 0.40/26.59 # Non-unit clause-clause subsumptions : 4273
% 0.40/26.59 # Unit Clause-clause subsumption calls : 6997
% 0.40/26.59 # Rewrite failures with RHS unbound : 0
% 0.40/26.59 # BW rewrite match attempts : 218
% 0.40/26.59 # BW rewrite match successes : 38
% 0.40/26.59 # Condensation attempts : 0
% 0.40/26.59 # Condensation successes : 0
% 0.40/26.59 # Termbank termtop insertions : 1020023
% 0.40/26.59
% 0.40/26.59 # -------------------------------------------------
% 0.40/26.59 # User time : 2.430 s
% 0.40/26.59 # System time : 0.016 s
% 0.40/26.59 # Total time : 2.446 s
% 0.40/26.59 # Maximum resident set size: 30904 pages
% 0.40/46.42 eprover: CPU time limit exceeded, terminating
% 0.40/46.43 eprover: CPU time limit exceeded, terminating
% 0.40/46.43 eprover: CPU time limit exceeded, terminating
% 0.40/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.44 eprover: No such file or directory
% 0.40/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.44 eprover: No such file or directory
% 0.40/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.44 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.45 eprover: No such file or directory
% 0.40/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.46 eprover: No such file or directory
% 0.40/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.46 eprover: No such file or directory
% 0.40/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.46 eprover: No such file or directory
% 0.40/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.46 eprover: No such file or directory
% 0.40/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.46 eprover: No such file or directory
% 0.40/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.46 eprover: No such file or directory
% 0.40/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.47 eprover: No such file or directory
% 0.40/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47 eprover: No such file or directory
% 0.40/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47 eprover: No such file or directory
% 0.40/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47 eprover: No such file or directory
% 0.40/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.47 eprover: No such file or directory
% 0.40/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47 eprover: No such file or directory
% 0.40/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48 eprover: No such file or directory
% 0.40/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.48 eprover: No such file or directory
% 0.40/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48 eprover: No such file or directory
% 0.40/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48 eprover: No such file or directory
% 0.40/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.48 eprover: No such file or directory
% 0.40/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48 eprover: No such file or directory
% 0.40/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49 eprover: No such file or directory
% 0.40/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49 eprover: No such file or directory
%------------------------------------------------------------------------------