%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:55:33 PM UTC 2026
% Result : Theorem 22.68s 3.73s
% Output : CNFRefutation 22.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 41 ( 15 unt; 0 def)
% Number of atoms : 332 ( 145 equ)
% Maximal formula atoms : 50 ( 8 avg)
% Number of connectives : 455 ( 164 ~; 98 |; 128 &)
% ( 2 <=>; 63 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 185 ( 22 sgn 138 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& leq(X14,X7)
& ~ setIn(X7,alive) )
=> ~ setIn(X14,alive) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) ) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ( host(X5) = host(X13)
& ~ setIn(X13,pids)
& ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) ) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( host(X19) = host(X18)
& host(X17) = host(X7)
& host(X18) != host(X7)
& ( X18 = X13
| ( setIn(X18,alive)
& X18 != X5 ) )
& ( X7 = X13
| ( setIn(X7,alive)
& X7 != X5 ) ) )
=> ~ ( elem(m_Down(X17),queue(host(X18)))
& elem(m_Down(X19),X12) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(c_0_2,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& leq(X14,X7)
& ~ setIn(X7,alive) )
=> ~ setIn(X14,alive) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) ) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ( host(X5) = host(X13)
& ~ setIn(X13,pids)
& ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) ) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( host(X19) = host(X18)
& host(X17) = host(X7)
& host(X18) != host(X7)
& ( X18 = X13
| ( setIn(X18,alive)
& X18 != X5 ) )
& ( X7 = X13
| ( setIn(X7,alive)
& X7 != X5 ) ) )
=> ~ ( elem(m_Down(X17),queue(host(X18)))
& elem(m_Down(X19),X12) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
fof(c_0_3,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
<=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& leq(X14,X7)
& ~ setIn(X7,alive) )
=> ~ setIn(X14,alive) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X5,X6)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( host(X6) = host(index(elid,host(X5)))
& index(status,host(X5)) = wait )
| ( index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) ) )
=> ( ( host(X5) = host(X13)
& ~ setIn(X13,pids)
& ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) ) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( host(X19) = host(X18)
& host(X17) = host(X7)
& host(X18) != host(X7)
& ( X18 = X13
| ( setIn(X18,alive)
& X18 != X5 ) )
& ( X7 = X13
| ( setIn(X7,alive)
& X7 != X5 ) ) )
=> ~ ( elem(m_Down(X17),queue(host(X18)))
& elem(m_Down(X19),X12) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3]) ).
fof(c_0_5,plain,
! [X6,X5,X12] :
( epred1_3(X12,X5,X6)
=> ( queue(host(X5)) = cons(m_Down(X6),X12)
& ! [X7,X16,X15,X14] :
( ( host(X14) = host(X15)
& host(X16) = host(X7)
& setIn(X15,alive)
& setIn(X7,alive)
& host(X15) != host(X7) )
=> ~ ( elem(m_Down(X16),queue(host(X15)))
& elem(m_Down(X14),queue(host(X7))) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& X14 != X7 )
=> ( ~ setIn(X14,alive)
| ~ setIn(X7,alive) ) )
& ! [X7,X14] :
( ( host(X14) = host(X7)
& leq(X14,X7)
& ~ setIn(X7,alive) )
=> ~ setIn(X14,alive) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
! [X153] :
( elem(m_Down(esk10_0),queue(host(esk11_0)))
& elem(m_Down(esk12_0),esk5_0)
& host(esk12_0) = host(esk11_0)
& host(esk10_0) = host(esk9_0)
& host(esk11_0) != host(esk9_0)
& ( esk11_0 = esk6_0
| setIn(esk11_0,alive) )
& ( esk11_0 = esk6_0
| esk11_0 != esk7_0 )
& ( esk9_0 = esk6_0
| setIn(esk9_0,alive) )
& ( esk9_0 = esk6_0
| esk9_0 != esk7_0 )
& host(esk7_0) != host(esk11_0)
& host(esk7_0) = host(esk9_0)
& host(esk6_0) != s(zero)
& host(esk7_0) = host(esk6_0)
& ~ setIn(esk6_0,pids)
& ( leq(X153,esk6_0)
| host(esk7_0) != host(X153) )
& ( index(status,host(esk7_0)) = norm
| host(esk8_0) = host(index(elid,host(esk7_0))) )
& ( index(status,host(esk7_0)) = norm
| index(status,host(esk7_0)) = wait )
& ( index(ldr,host(esk7_0)) = host(esk8_0)
| host(esk8_0) = host(index(elid,host(esk7_0))) )
& ( index(ldr,host(esk7_0)) = host(esk8_0)
| index(status,host(esk7_0)) = wait )
& ~ leq(host(esk7_0),host(esk8_0))
& setIn(esk7_0,alive)
& epred1_3(esk5_0,esk7_0,esk8_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_7,plain,
! [X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179] :
( ( ~ epred1_3(X160,X159,X158)
| queue(host(X159)) = cons(m_Down(X158),X160) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Down(X177),queue(host(X178)))
| ~ elem(m_Down(X179),queue(host(X176)))
| host(X179) != host(X178)
| host(X177) != host(X176)
| ~ setIn(X178,alive)
| ~ setIn(X176,alive)
| host(X178) = host(X176) )
& ( ~ epred1_3(X160,X159,X158)
| ~ setIn(X175,alive)
| ~ setIn(X174,alive)
| host(X175) != host(X174)
| X175 = X174 )
& ( ~ epred1_3(X160,X159,X158)
| ~ setIn(X173,alive)
| host(X173) != host(X172)
| ~ leq(X173,X172)
| setIn(X172,alive) )
& ( ~ epred1_3(X160,X159,X158)
| ~ leq(host(X169),host(X171))
| ~ elem(m_Ack(X171,X169),queue(host(X170))) )
& ( ~ epred1_3(X160,X159,X158)
| ~ leq(host(X167),host(X168))
| ~ elem(m_Halt(X168),queue(host(X167))) )
& ( ~ epred1_3(X160,X159,X158)
| host(X166) != host(X165)
| ~ elem(m_Down(X166),queue(host(X165))) )
& ( ~ epred1_3(X160,X159,X158)
| ~ setIn(X164,alive)
| ~ elem(m_Down(X164),queue(host(X163))) )
& ( ~ epred1_3(X160,X159,X158)
| ~ elem(m_Down(X162),queue(host(X161)))
| ~ setIn(X162,alive) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,negated_conjecture,
host(esk10_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
host(esk7_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X1) != host(X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ epred1_3(X3,X4,X5)
| ~ setIn(X2,alive)
| host(X2) != host(X1)
| ~ leq(X2,X1)
| setIn(X1,alive) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ epred1_3(X5,X6,X7)
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Down(X4),queue(host(X2)))
| host(X4) != host(X1)
| host(X3) != host(X2)
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X1) = host(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
elem(m_Down(esk10_0),queue(host(esk11_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
host(esk10_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,plain,
( ~ epred1_3(X3,X1,X2)
| queue(host(X1)) = cons(m_Down(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X1) != host(X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( ~ setIn(X2,alive)
| ~ leq(X2,X1)
| host(X1) != host(X2)
| setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( ~ elem(m_Down(X2),queue(host(X1)))
| ~ setIn(X1,alive)
| ~ setIn(esk11_0,alive)
| ~ epred1_3(X3,X4,X5)
| host(X1) != host(esk7_0)
| host(esk11_0) != host(X2)
| host(X1) = host(esk11_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
queue(host(esk7_0)) = cons(m_Down(esk8_0),esk5_0),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
host(esk7_0) != host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_23,plain,
! [X100,X101,X102] :
( ( elem(X100,cons(X101,X102))
| ~ elem(X100,X102) )
& ( elem(X100,cons(X101,X102))
| X100 != X101 )
& ( elem(X100,X102)
| X100 = X101
| ~ elem(X100,cons(X101,X102)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ setIn(X1,alive)
| host(X1) != host(esk7_0)
| X1 = esk7_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ leq(esk7_0,X1)
| host(X1) != host(esk7_0)
| setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ elem(m_Down(X1),cons(m_Down(esk8_0),esk5_0))
| ~ setIn(esk11_0,alive)
| ~ epred1_3(X2,X3,X4)
| host(esk11_0) != host(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]),c_0_22]) ).
cnf(c_0_27,plain,
( ~ elem(X1,X2)
| elem(X1,cons(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ leq(esk7_0,X1)
| host(X1) != host(esk7_0)
| X1 = esk7_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( host(esk7_0) != host(X1)
| leq(X1,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
( ~ elem(m_Down(X1),esk5_0)
| ~ setIn(esk11_0,alive)
| ~ epred1_3(X2,X3,X4)
| host(esk11_0) != host(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
elem(m_Down(esk12_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
host(esk12_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
( esk11_0 = esk6_0
| setIn(esk11_0,alive) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
esk6_0 = esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_36,negated_conjecture,
( ~ setIn(esk11_0,alive)
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
( setIn(esk11_0,alive)
| esk11_0 = esk7_0 ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ setIn(esk11_0,alive),
inference(spm,[status(thm)],[c_0_36,c_0_11]) ).
cnf(c_0_39,negated_conjecture,
esk11_0 = esk7_0,
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 08:52:07 UTC 2026
% 0.13/0.35 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.68/3.73 % Version: 3.5.1
% 22.68/3.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 22.68/3.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.68/3.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 22.68/3.73 % Starting new_bool_3 with 300s (1) cores
% 22.68/3.73 % Starting new_bool_1 with 300s (1) cores
% 22.68/3.73 % Starting sh5l with 300s (1) cores
% 22.68/3.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3693946 completed with status 0
% 22.68/3.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 22.68/3.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 22.68/3.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.68/3.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 22.68/3.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.68/3.73 % No SInE strategy applied
% 22.68/3.73 % Search class: FGHSM-FFMM21-MFFFFFNN
% 22.68/3.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 22.68/3.73 % Starting SubtermCWHack with 136s (1) cores
% 22.68/3.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 22.68/3.73 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 22.68/3.73 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 22.68/3.73 % Starting new_bool_3 with 136s (1) cores
% 22.68/3.73 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 3693955 completed with status 0
% 22.68/3.73 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 22.68/3.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 22.68/3.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.68/3.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 22.68/3.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.68/3.73 % No SInE strategy applied
% 22.68/3.73 % Search class: FGHSM-FFMM21-MFFFFFNN
% 22.68/3.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 22.68/3.73 % Starting SubtermCWHack with 136s (1) cores
% 22.68/3.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 22.68/3.73 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 22.68/3.73 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 22.68/3.73 % Preprocessing time : 0.004 s
% 22.68/3.73
% 22.68/3.73 % Proof found!
% 22.68/3.73 % SZS status Theorem
% 22.68/3.73 % SZS output start CNFRefutation
% See solution above
% 22.68/3.73 % Parsed axioms : 67
% 22.68/3.73 % Removed by relevancy pruning/SinE : 0
% 22.68/3.73 % Initial clauses : 127
% 22.68/3.73 % Removed in clause preprocessing : 6
% 22.68/3.73 % Initial clauses in saturation : 121
% 22.68/3.73 % Processed clauses : 4972
% 22.68/3.73 % ...of these trivial : 95
% 22.68/3.73 % ...subsumed : 3274
% 22.68/3.73 % ...remaining for further processing : 1603
% 22.68/3.73 % Other redundant clauses eliminated : 20
% 22.68/3.73 % Clauses deleted for lack of memory : 0
% 22.68/3.73 % Backward-subsumed : 167
% 22.68/3.73 % Backward-rewritten : 65
% 22.68/3.73 % Generated clauses : 131991
% 22.68/3.73 % ...of the previous two non-redundant : 110360
% 22.68/3.73 % ...aggressively subsumed : 0
% 22.68/3.73 % Contextual simplify-reflections : 34
% 22.68/3.73 % Paramodulations : 131686
% 22.68/3.73 % Factorizations : 193
% 22.68/3.73 % NegExts : 0
% 22.68/3.73 % Equation resolutions : 111
% 22.68/3.73 % Disequality decompositions : 0
% 22.68/3.73 % Total rewrite steps : 28684
% 22.68/3.73 % ...of those cached : 27993
% 22.68/3.73 % Propositional unsat checks : 0
% 22.68/3.73 % Propositional check models : 0
% 22.68/3.73 % Propositional check unsatisfiable : 0
% 22.68/3.73 % Propositional clauses : 0
% 22.68/3.73 % Propositional clauses after purity: 0
% 22.68/3.73 % Propositional unsat core size : 0
% 22.68/3.73 % Propositional preprocessing time : 0.000
% 22.68/3.73 % Propositional encoding time : 0.000
% 22.68/3.73 % Propositional solver time : 0.000
% 22.68/3.73 % Success case prop preproc time : 0.000
% 22.68/3.73 % Success case prop encoding time : 0.000
% 22.68/3.73 % Success case prop solver time : 0.000
% 22.68/3.73 % Current number of processed clauses : 1366
% 22.68/3.73 % Positive orientable unit clauses : 81
% 22.68/3.73 % Positive unorientable unit clauses: 0
% 22.68/3.73 % Negative unit clauses : 131
% 22.68/3.73 % Non-unit-clauses : 1154
% 22.68/3.73 % Current number of unprocessed clauses: 104898
% 22.68/3.73 % ...number of literals in the above : 421145
% 22.68/3.73 % Current number of archived formulas : 0
% 22.68/3.73 % Current number of archived clauses : 233
% 22.68/3.73 % Clause-clause subsumption calls (NU) : 243682
% 22.68/3.73 % Rec. Clause-clause subsumption calls : 140327
% 22.68/3.73 % Non-unit clause-clause subsumptions : 2269
% 22.68/3.73 % Unit Clause-clause subsumption calls : 21207
% 22.68/3.73 % Rewrite failures with RHS unbound : 0
% 22.68/3.73 % BW rewrite match attempts : 195
% 22.68/3.73 % BW rewrite match successes : 13
% 22.68/3.73 % Condensation attempts : 0
% 22.68/3.73 % Condensation successes : 0
% 22.68/3.73 % Termbank termtop insertions : 1776471
% 22.68/3.73 % Search garbage collected termcells : 1671
% 22.68/3.73
% 22.68/3.73 % -------------------------------------------------
% 22.68/3.73 % User time : 2.996 s
% 22.68/3.73 % System time : 0.110 s
% 22.68/3.73 % Total time : 3.106 s
% 22.68/3.73 % Maximum resident set size: 3924 pages
% 22.68/3.73
% 22.68/3.73 % -------------------------------------------------
% 22.68/3.73 % User time : 15.522 s
% 22.68/3.73 % System time : 0.565 s
% 22.68/3.73 % Total time : 16.088 s
% 22.68/3.73 % Maximum resident set size: 4608 pages
% 22.68/3.73 % E exiting
%------------------------------------------------------------------------------