%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:34 PM UTC 2026
% Result : Theorem 0.22s 0.69s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 281 ( 109 equ)
% Maximal formula atoms : 49 ( 10 avg)
% Number of connectives : 395 ( 142 ~; 63 |; 119 &)
% ( 2 <=>; 69 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 8 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 : 164 ( 16 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) ) )
=> ( ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( s(host(X5)) != host(X7)
=> ( host(X5) = host(X7)
=> ! [X17,X18] :
( s(host(X5)) != host(X18)
=> ( host(X5) != host(X18)
=> ! [X19] :
( ( host(X19) = host(X18)
& host(X17) = host(X7)
& setIn(X18,alive)
& setIn(X7,alive)
& host(X18) != host(X7) )
=> ~ ( elem(m_Down(X17),queue(host(X18)))
& elem(m_Down(X19),X12) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( elem(X5,X4)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/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) ) )
=> ( ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( s(host(X5)) != host(X7)
=> ( host(X5) = host(X7)
=> ! [X17,X18] :
( s(host(X5)) != host(X18)
=> ( host(X5) != host(X18)
=> ! [X19] :
( ( host(X19) = host(X18)
& host(X17) = host(X7)
& setIn(X18,alive)
& setIn(X7,alive)
& host(X18) != host(X7) )
=> ~ ( 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) ) )
=> ( ( index(status,host(X5)) = elec_1
& ! [X7] :
( ( leq(s(zero),X7)
& ~ leq(host(X5),X7) )
=> ( X7 = host(X6)
| setIn(X7,index(down,host(X5))) ) ) )
=> ( ~ leq(nbr_proc,host(X5))
=> ! [X7] :
( s(host(X5)) != host(X7)
=> ( host(X5) = host(X7)
=> ! [X17,X18] :
( s(host(X5)) != host(X18)
=> ( host(X5) != host(X18)
=> ! [X19] :
( ( host(X19) = host(X18)
& host(X17) = host(X7)
& setIn(X18,alive)
& setIn(X7,alive)
& host(X18) != host(X7) )
=> ~ ( 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,
! [X152] :
( elem(m_Down(esk9_0),queue(host(esk10_0)))
& elem(m_Down(esk11_0),esk5_0)
& host(esk11_0) = host(esk10_0)
& host(esk9_0) = host(esk8_0)
& setIn(esk10_0,alive)
& setIn(esk8_0,alive)
& host(esk10_0) != host(esk8_0)
& host(esk6_0) != host(esk10_0)
& s(host(esk6_0)) != host(esk10_0)
& host(esk6_0) = host(esk8_0)
& s(host(esk6_0)) != host(esk8_0)
& ~ leq(nbr_proc,host(esk6_0))
& index(status,host(esk6_0)) = elec_1
& ( X152 = host(esk7_0)
| setIn(X152,index(down,host(esk6_0)))
| ~ leq(s(zero),X152)
| leq(host(esk6_0),X152) )
& ( host(esk7_0) != host(index(elid,host(esk6_0)))
| index(status,host(esk6_0)) != wait )
& ( index(status,host(esk6_0)) != norm
| index(ldr,host(esk6_0)) != host(esk7_0) )
& ~ leq(host(esk6_0),host(esk7_0))
& setIn(esk6_0,alive)
& epred1_3(esk5_0,esk6_0,esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_7,plain,
! [X157,X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178] :
( ( ~ epred1_3(X159,X158,X157)
| queue(host(X158)) = cons(m_Down(X157),X159) )
& ( ~ epred1_3(X159,X158,X157)
| ~ elem(m_Down(X176),queue(host(X177)))
| ~ elem(m_Down(X178),queue(host(X175)))
| host(X178) != host(X177)
| host(X176) != host(X175)
| ~ setIn(X177,alive)
| ~ setIn(X175,alive)
| host(X177) = host(X175) )
& ( ~ epred1_3(X159,X158,X157)
| ~ setIn(X174,alive)
| ~ setIn(X173,alive)
| host(X174) != host(X173)
| X174 = X173 )
& ( ~ epred1_3(X159,X158,X157)
| ~ setIn(X172,alive)
| host(X172) != host(X171)
| ~ leq(X172,X171)
| setIn(X171,alive) )
& ( ~ epred1_3(X159,X158,X157)
| ~ leq(host(X168),host(X170))
| ~ elem(m_Ack(X170,X168),queue(host(X169))) )
& ( ~ epred1_3(X159,X158,X157)
| ~ leq(host(X166),host(X167))
| ~ elem(m_Halt(X167),queue(host(X166))) )
& ( ~ epred1_3(X159,X158,X157)
| host(X165) != host(X164)
| ~ elem(m_Down(X165),queue(host(X164))) )
& ( ~ epred1_3(X159,X158,X157)
| ~ setIn(X163,alive)
| ~ elem(m_Down(X163),queue(host(X162))) )
& ( ~ epred1_3(X159,X158,X157)
| ~ elem(m_Down(X161),queue(host(X160)))
| ~ setIn(X161,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(esk9_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
host(esk6_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,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_11,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_12,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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(esk9_0),queue(host(esk10_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
host(esk9_0) = host(esk6_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( ~ elem(X1,X2)
| elem(X1,cons(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ elem(m_Down(X2),queue(host(X1)))
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5)
| host(X1) != host(esk6_0)
| host(esk10_0) != host(X2)
| host(X1) = host(esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_20,negated_conjecture,
( ~ elem(X1,esk5_0)
| elem(X1,queue(host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
host(esk6_0) != host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( ~ elem(m_Down(X1),esk5_0)
| ~ epred1_3(X2,X3,X4)
| host(esk10_0) != host(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
elem(m_Down(esk11_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
host(esk11_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 08:52:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.69 % Version: 3.5.1
% 0.22/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.69 % Starting sh5l with 300s (1) cores
% 0.22/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2763414 completed with status 0
% 0.22/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.69 % No SInE strategy applied
% 0.22/0.69 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.22/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.69 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.22/0.69 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/0.69 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2763421 completed with status 0
% 0.22/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.69 % No SInE strategy applied
% 0.22/0.69 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.22/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.69 % Preprocessing time : 0.004 s
% 0.22/0.69 % Presaturation interreduction done
% 0.22/0.69
% 0.22/0.69 % Proof found!
% 0.22/0.69 % SZS status Theorem
% 0.22/0.69 % SZS output start CNFRefutation
% See solution above
% 0.22/0.69 % Parsed axioms : 67
% 0.22/0.69 % Removed by relevancy pruning/SinE : 0
% 0.22/0.69 % Initial clauses : 124
% 0.22/0.69 % Removed in clause preprocessing : 6
% 0.22/0.69 % Initial clauses in saturation : 118
% 0.22/0.69 % Processed clauses : 1385
% 0.22/0.69 % ...of these trivial : 37
% 0.22/0.69 % ...subsumed : 701
% 0.22/0.69 % ...remaining for further processing : 647
% 0.22/0.69 % Other redundant clauses eliminated : 21
% 0.22/0.69 % Clauses deleted for lack of memory : 0
% 0.22/0.69 % Backward-subsumed : 28
% 0.22/0.69 % Backward-rewritten : 6
% 0.22/0.69 % Generated clauses : 5253
% 0.22/0.69 % ...of the previous two non-redundant : 3678
% 0.22/0.69 % ...aggressively subsumed : 0
% 0.22/0.69 % Contextual simplify-reflections : 0
% 0.22/0.69 % Paramodulations : 5222
% 0.22/0.69 % Factorizations : 2
% 0.22/0.69 % NegExts : 0
% 0.22/0.69 % Equation resolutions : 28
% 0.22/0.69 % Disequality decompositions : 0
% 0.22/0.69 % Total rewrite steps : 2048
% 0.22/0.69 % ...of those cached : 1845
% 0.22/0.69 % Propositional unsat checks : 0
% 0.22/0.69 % Propositional check models : 0
% 0.22/0.69 % Propositional check unsatisfiable : 0
% 0.22/0.69 % Propositional clauses : 0
% 0.22/0.69 % Propositional clauses after purity: 0
% 0.22/0.69 % Propositional unsat core size : 0
% 0.22/0.69 % Propositional preprocessing time : 0.000
% 0.22/0.69 % Propositional encoding time : 0.000
% 0.22/0.69 % Propositional solver time : 0.000
% 0.22/0.69 % Success case prop preproc time : 0.000
% 0.22/0.69 % Success case prop encoding time : 0.000
% 0.22/0.69 % Success case prop solver time : 0.000
% 0.22/0.69 % Current number of processed clauses : 495
% 0.22/0.69 % Positive orientable unit clauses : 89
% 0.22/0.69 % Positive unorientable unit clauses: 0
% 0.22/0.69 % Negative unit clauses : 58
% 0.22/0.69 % Non-unit-clauses : 348
% 0.22/0.69 % Current number of unprocessed clauses: 2508
% 0.22/0.69 % ...number of literals in the above : 7342
% 0.22/0.69 % Current number of archived formulas : 0
% 0.22/0.69 % Current number of archived clauses : 145
% 0.22/0.69 % Clause-clause subsumption calls (NU) : 19596
% 0.22/0.69 % Rec. Clause-clause subsumption calls : 14695
% 0.22/0.69 % Non-unit clause-clause subsumptions : 450
% 0.22/0.69 % Unit Clause-clause subsumption calls : 1127
% 0.22/0.69 % Rewrite failures with RHS unbound : 0
% 0.22/0.69 % BW rewrite match attempts : 233
% 0.22/0.69 % BW rewrite match successes : 4
% 0.22/0.69 % Condensation attempts : 0
% 0.22/0.69 % Condensation successes : 0
% 0.22/0.69 % Termbank termtop insertions : 72470
% 0.22/0.69 % Search garbage collected termcells : 1628
% 0.22/0.69
% 0.22/0.69 % -------------------------------------------------
% 0.22/0.69 % User time : 0.197 s
% 0.22/0.69 % System time : 0.012 s
% 0.22/0.69 % Total time : 0.209 s
% 0.22/0.69 % Maximum resident set size: 3976 pages
% 0.22/0.69
% 0.22/0.69 % -------------------------------------------------
% 0.22/0.69 % User time : 0.869 s
% 0.22/0.69 % System time : 0.063 s
% 0.22/0.69 % Total time : 0.932 s
% 0.22/0.69 % Maximum resident set size: 4864 pages
% 0.22/0.69 % E exiting
%------------------------------------------------------------------------------