TSTP Solution File: SWV474+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV474+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:16:55 EDT 2022
% Result : Theorem 0.38s 25.57s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 64 ( 31 unt; 0 def)
% Number of atoms : 454 ( 216 equ)
% Maximal formula atoms : 86 ( 7 avg)
% Number of connectives : 603 ( 213 ~; 169 |; 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 : 219 ( 37 sgn 160 !; 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
fof(axiom_02,axiom,
! [X3] : leq(s(zero),host(X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
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(axiom_04,axiom,
! [X3] : leq(host(X3),nbr_proc),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
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(c_0_5,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
<=> ( ! [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(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 )
=> ! [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(assume_negation,[status(cth)],[conj]),c_0_5]) ).
fof(c_0_7,negated_conjecture,
! [X30] :
( epred1_3(esk2_0,esk3_0,esk1_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),X30)
| ~ leq(s(zero),X30)
| setIn(X30,index(down,host(esk2_0)))
| X30 = host(esk3_0)
| X30 = 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(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_6])])])])])])])]) ).
cnf(c_0_8,negated_conjecture,
host(esk2_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,negated_conjecture,
host(esk8_0) = nbr_proc,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
index(status,host(esk8_0)) = elec_1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
nbr_proc = host(esk2_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( X1 = host(esk7_0)
| X1 = host(esk3_0)
| setIn(X1,index(down,host(esk2_0)))
| leq(host(esk8_0),X1)
| ~ leq(s(zero),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( leq(s(zero),esk4_0)
| index(status,host(esk2_0)) != elec_1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
elec_1 = index(status,host(esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( index(status,host(esk2_0)) != elec_1
| ~ leq(host(esk2_0),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( index(status,host(esk2_0)) != elec_1
| ~ setIn(esk4_0,index(down,host(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( X1 = host(esk7_0)
| X1 = host(esk3_0)
| leq(host(esk2_0),X1)
| setIn(X1,index(down,host(esk2_0)))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_9]),c_0_11]) ).
cnf(c_0_18,negated_conjecture,
leq(s(zero),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
~ leq(host(esk2_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
~ setIn(esk4_0,index(down,host(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
( index(status,host(esk2_0)) != elec_1
| esk4_0 != host(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_22,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
=> ( ! [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]) ).
cnf(c_0_23,negated_conjecture,
( esk4_0 = host(esk3_0)
| host(esk7_0) = esk4_0 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
esk4_0 != host(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_14])]) ).
fof(c_0_25,plain,
! [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] :
( ( ~ elem(m_Ldr(X22),queue(host(X21)))
| ~ leq(host(X21),host(X22))
| ~ epred1_3(X20,X19,X18) )
& ( ~ elem(m_Down(X24),queue(host(X23)))
| host(X24) != host(X23)
| ~ epred1_3(X20,X19,X18) )
& ( host(X26) != nbr_proc
| ~ elem(m_NotNorm(X25),queue(host(X26)))
| ~ epred1_3(X20,X19,X18) )
& ( X28 = X27
| host(X28) != host(X27)
| ~ setIn(X27,alive)
| ~ setIn(X28,alive)
| ~ epred1_3(X20,X19,X18) )
& ( index(status,host(X29)) != elec_1
| ~ setIn(X29,alive)
| index(elid,host(X29)) = X29
| ~ epred1_3(X20,X19,X18) )
& ( index(status,host(X29)) != elec_2
| ~ setIn(X29,alive)
| index(elid,host(X29)) = X29
| ~ epred1_3(X20,X19,X18) )
& ( host(X32) = host(X31)
| ~ setIn(X32,alive)
| host(X32) != host(X30)
| index(status,host(X32)) != norm
| index(ldr,host(X32)) != host(X31)
| ~ elem(m_Down(X30),queue(host(X31)))
| ~ epred1_3(X20,X19,X18) )
& ( host(X35) = host(X34)
| ~ setIn(X35,alive)
| host(X35) != host(X33)
| index(status,host(X35)) != wait
| host(index(elid,host(X35))) != host(X34)
| ~ elem(m_Down(X33),queue(host(X34)))
| ~ epred1_3(X20,X19,X18) )
& ( host(X38) = host(X36)
| ~ setIn(X36,alive)
| ~ setIn(X38,alive)
| host(X37) != host(X36)
| host(X39) != host(X38)
| ~ elem(m_Down(X39),queue(host(X36)))
| ~ elem(m_Down(X37),queue(host(X38)))
| ~ epred1_3(X20,X19,X18) )
& ( host(X42) = host(X40)
| ~ setIn(X40,alive)
| ~ setIn(X42,alive)
| host(X41) != host(X40)
| host(X43) != host(X42)
| ~ elem(m_Down(X43),queue(host(X40)))
| ~ setIn(host(X41),index(down,host(X42)))
| ~ epred1_3(X20,X19,X18) )
& ( ~ leq(host(X47),esk9_7(X18,X19,X20,X44,X45,X46,X47))
| ~ elem(m_Down(X46),queue(host(X47)))
| host(X47) != nbr_proc
| host(X47) != host(X45)
| index(status,host(X47)) != elec_1
| ~ setIn(X44,alive)
| ~ elem(m_Down(X45),queue(host(X44)))
| ~ epred1_3(X20,X19,X18) )
& ( leq(s(zero),esk9_7(X18,X19,X20,X44,X45,X46,X47))
| ~ elem(m_Down(X46),queue(host(X47)))
| host(X47) != nbr_proc
| host(X47) != host(X45)
| index(status,host(X47)) != elec_1
| ~ setIn(X44,alive)
| ~ elem(m_Down(X45),queue(host(X44)))
| ~ epred1_3(X20,X19,X18) )
& ( ~ setIn(esk9_7(X18,X19,X20,X44,X45,X46,X47),index(down,host(X47)))
| ~ elem(m_Down(X46),queue(host(X47)))
| host(X47) != nbr_proc
| host(X47) != host(X45)
| index(status,host(X47)) != elec_1
| ~ setIn(X44,alive)
| ~ elem(m_Down(X45),queue(host(X44)))
| ~ epred1_3(X20,X19,X18) )
& ( esk9_7(X18,X19,X20,X44,X45,X46,X47) != host(X46)
| ~ elem(m_Down(X46),queue(host(X47)))
| host(X47) != nbr_proc
| host(X47) != host(X45)
| index(status,host(X47)) != elec_1
| ~ setIn(X44,alive)
| ~ elem(m_Down(X45),queue(host(X44)))
| ~ epred1_3(X20,X19,X18) )
& ( queue(host(X20)) = cons(m_Down(X19),X18)
| ~ epred1_3(X20,X19,X18) ) ),
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_22])])])])])])])]) ).
cnf(c_0_26,negated_conjecture,
host(esk7_0) = esk4_0,
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X4] : leq(s(zero),host(X4)),
inference(variable_rename,[status(thm)],[axiom_02]) ).
cnf(c_0_28,plain,
( host(X5) = host(X7)
| ~ epred1_3(X1,X2,X3)
| ~ setIn(host(X4),index(down,host(X5)))
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X6) != host(X5)
| host(X4) != host(X7)
| ~ setIn(X5,alive)
| ~ setIn(X7,alive) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( X1 = host(esk3_0)
| X1 = esk4_0
| leq(host(esk2_0),X1)
| setIn(X1,index(down,host(esk2_0)))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
setIn(esk2_0,alive),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,plain,
leq(s(zero),host(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
host(esk8_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_33,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_34,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
epred1_3(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_36,plain,
( host(X1) = host(esk3_0)
| host(esk2_0) = host(X2)
| host(X1) = esk4_0
| leq(host(esk2_0),host(X1))
| host(esk2_0) != host(X3)
| host(X1) != host(X2)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X3),queue(host(X2))) ),
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])]) ).
cnf(c_0_37,negated_conjecture,
elem(m_Down(esk6_0),queue(host(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_38,negated_conjecture,
host(esk6_0) = host(esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_9]),c_0_11]) ).
cnf(c_0_39,negated_conjecture,
setIn(esk5_0,alive),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_40,negated_conjecture,
host(esk2_0) != host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_41,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
cons(m_Down(esk3_0),esk1_0) = queue(host(esk2_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( host(X1) = host(esk3_0)
| host(X1) = esk4_0
| leq(host(esk2_0),host(X1))
| host(X1) != host(esk5_0)
| ~ epred1_3(X2,X3,X4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]),c_0_40]) ).
fof(c_0_44,plain,
! [X4] : leq(host(X4),nbr_proc),
inference(variable_rename,[status(thm)],[axiom_04]) ).
cnf(c_0_45,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,plain,
( host(X5) = host(X7)
| ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X6) != host(X5)
| host(X4) != host(X7)
| ~ setIn(X5,alive)
| ~ setIn(X7,alive) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_47,negated_conjecture,
( elem(X1,queue(host(esk2_0)))
| ~ elem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
elem(m_Down(esk7_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_49,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_50,negated_conjecture,
( host(X1) = host(esk3_0)
| host(X1) = esk4_0
| leq(host(esk2_0),host(X1))
| host(X1) != host(esk5_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_35]) ).
cnf(c_0_51,plain,
leq(host(X1),nbr_proc),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( host(X1) = host(esk5_0)
| host(X1) != host(esk2_0)
| host(X2) != host(esk5_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_54,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( host(esk5_0) = host(esk3_0)
| host(esk5_0) = esk4_0
| leq(host(esk2_0),host(esk5_0)) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_57,plain,
leq(host(X1),host(esk2_0)),
inference(rw,[status(thm)],[c_0_51,c_0_11]) ).
cnf(c_0_58,negated_conjecture,
elem(m_Down(esk3_0),queue(host(esk2_0))),
inference(spm,[status(thm)],[c_0_52,c_0_42]) ).
cnf(c_0_59,negated_conjecture,
( host(esk5_0) != esk4_0
| ~ 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_53,c_0_54]),c_0_26]),c_0_30])]),c_0_40]) ).
cnf(c_0_60,negated_conjecture,
( host(esk5_0) = host(esk3_0)
| host(esk5_0) = esk4_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_40]) ).
cnf(c_0_61,negated_conjecture,
( host(esk5_0) != host(esk3_0)
| ~ epred1_3(X1,X2,X3) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_58]),c_0_30])]),c_0_40]) ).
cnf(c_0_62,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV474+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.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 : Wed Jun 15 08:17:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.37/23.41 eprover: CPU time limit exceeded, terminating
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.44 eprover: CPU time limit exceeded, terminating
% 0.38/25.57 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.38/25.57
% 0.38/25.57 # Failure: Resource limit exceeded (time)
% 0.38/25.57 # OLD status Res
% 0.38/25.57 # Preprocessing time : 0.020 s
% 0.38/25.57 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.38/25.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.38/25.57 # Preprocessing time : 0.011 s
% 0.38/25.57
% 0.38/25.57 # Proof found!
% 0.38/25.57 # SZS status Theorem
% 0.38/25.57 # SZS output start CNFRefutation
% See solution above
% 0.38/25.57 # Proof object total steps : 64
% 0.38/25.57 # Proof object clause steps : 50
% 0.38/25.57 # Proof object formula steps : 14
% 0.38/25.57 # Proof object conjectures : 42
% 0.38/25.57 # Proof object clause conjectures : 39
% 0.38/25.57 # Proof object formula conjectures : 3
% 0.38/25.57 # Proof object initial clauses used : 23
% 0.38/25.57 # Proof object initial formulas used : 5
% 0.38/25.57 # Proof object generating inferences : 14
% 0.38/25.57 # Proof object simplifying inferences : 43
% 0.38/25.57 # Training examples: 0 positive, 0 negative
% 0.38/25.57 # Parsed axioms : 67
% 0.38/25.57 # Removed by relevancy pruning/SinE : 14
% 0.38/25.57 # Initial clauses : 100
% 0.38/25.57 # Removed in clause preprocessing : 6
% 0.38/25.57 # Initial clauses in saturation : 94
% 0.38/25.57 # Processed clauses : 5558
% 0.38/25.57 # ...of these trivial : 130
% 0.38/25.57 # ...subsumed : 4145
% 0.38/25.57 # ...remaining for further processing : 1283
% 0.38/25.57 # Other redundant clauses eliminated : 4
% 0.38/25.57 # Clauses deleted for lack of memory : 0
% 0.38/25.57 # Backward-subsumed : 115
% 0.38/25.57 # Backward-rewritten : 91
% 0.38/25.57 # Generated clauses : 72712
% 0.38/25.57 # ...of the previous two non-trivial : 54710
% 0.38/25.57 # Contextual simplify-reflections : 1588
% 0.38/25.57 # Paramodulations : 72571
% 0.38/25.57 # Factorizations : 49
% 0.38/25.57 # Equation resolutions : 56
% 0.38/25.57 # Current number of processed clauses : 1066
% 0.38/25.57 # Positive orientable unit clauses : 87
% 0.38/25.57 # Positive unorientable unit clauses: 0
% 0.38/25.57 # Negative unit clauses : 128
% 0.38/25.57 # Non-unit-clauses : 851
% 0.38/25.57 # Current number of unprocessed clauses: 40879
% 0.38/25.57 # ...number of literals in the above : 151157
% 0.38/25.57 # Current number of archived formulas : 0
% 0.38/25.57 # Current number of archived clauses : 210
% 0.38/25.57 # Clause-clause subsumption calls (NU) : 362963
% 0.38/25.57 # Rec. Clause-clause subsumption calls : 267367
% 0.38/25.57 # Non-unit clause-clause subsumptions : 3359
% 0.38/25.57 # Unit Clause-clause subsumption calls : 4528
% 0.38/25.57 # Rewrite failures with RHS unbound : 0
% 0.38/25.57 # BW rewrite match attempts : 502
% 0.38/25.57 # BW rewrite match successes : 45
% 0.38/25.57 # Condensation attempts : 0
% 0.38/25.57 # Condensation successes : 0
% 0.38/25.57 # Termbank termtop insertions : 989103
% 0.38/25.57
% 0.38/25.57 # -------------------------------------------------
% 0.38/25.57 # User time : 1.813 s
% 0.38/25.57 # System time : 0.016 s
% 0.38/25.57 # Total time : 1.829 s
% 0.38/25.57 # Maximum resident set size: 32676 pages
%------------------------------------------------------------------------------