TSTP Solution File: SWV456+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV456+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:52 EDT 2022
% Result : Theorem 0.41s 28.59s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 41 ( 16 unt; 0 def)
% Number of atoms : 307 ( 139 equ)
% Maximal formula atoms : 56 ( 7 avg)
% Number of connectives : 415 ( 149 ~; 100 |; 117 &)
% ( 2 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 41 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 166 ( 22 sgn 121 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [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))) ) )
& 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] :
( host(X5) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X5) = host(X13) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X13) != host(X18)
=> ( host(X5) != host(X18)
=> ! [X19] :
( ( ( ( X7 != X5
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X5
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X19),X12)
& setIn(host(X17),index(down,host(X18))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
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_2,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
<=> ( ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_3,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
=> ( ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_2]) ).
fof(c_0_4,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] :
( host(X5) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X5) = host(X13) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X13) != host(X18)
=> ( host(X5) != host(X18)
=> ! [X19] :
( ( ( ( X7 != X5
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X5
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X19),X12)
& setIn(host(X17),index(down,host(X18))) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_2]) ).
fof(c_0_5,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] :
( ( ~ elem(m_Down(X21),queue(host(X20)))
| ~ setIn(X21,alive)
| ~ 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) )
& ( setIn(X29,alive)
| ~ leq(X30,X29)
| host(X30) != host(X29)
| ~ setIn(X30,alive)
| ~ epred1_3(X19,X18,X17) )
& ( X32 = X31
| host(X32) != host(X31)
| ~ setIn(X31,alive)
| ~ setIn(X32,alive)
| ~ epred1_3(X19,X18,X17) )
& ( host(X35) = host(X33)
| ~ setIn(X33,alive)
| ~ setIn(X35,alive)
| host(X34) != host(X33)
| host(X36) != host(X35)
| ~ elem(m_Down(X36),queue(host(X33)))
| ~ elem(m_Down(X34),queue(host(X35)))
| ~ epred1_3(X19,X18,X17) )
& ( host(X39) = host(X37)
| ~ setIn(X37,alive)
| ~ setIn(X39,alive)
| host(X38) != host(X37)
| host(X40) != host(X39)
| ~ elem(m_Down(X40),queue(host(X37)))
| ~ setIn(host(X38),index(down,host(X39)))
| ~ epred1_3(X19,X18,X17) )
& ( queue(host(X19)) = cons(m_Down(X18),X17)
| ~ epred1_3(X19,X18,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X24] :
( epred1_3(esk3_0,esk4_0,esk1_0)
& setIn(esk3_0,alive)
& ~ leq(host(esk3_0),host(esk4_0))
& ( index(status,host(esk3_0)) = wait
| index(ldr,host(esk3_0)) = host(esk4_0) )
& ( host(esk4_0) = host(index(elid,host(esk3_0)))
| index(ldr,host(esk3_0)) = host(esk4_0) )
& ( index(status,host(esk3_0)) = wait
| index(status,host(esk3_0)) = norm )
& ( host(esk4_0) = host(index(elid,host(esk3_0)))
| index(status,host(esk3_0)) = norm )
& ( host(esk3_0) != host(X24)
| leq(X24,esk2_0) )
& ~ setIn(esk2_0,pids)
& host(esk3_0) = host(esk2_0)
& host(esk2_0) != s(zero)
& host(esk3_0) = host(esk5_0)
& host(esk2_0) != host(esk7_0)
& host(esk3_0) != host(esk7_0)
& ( esk5_0 != esk3_0
| esk5_0 = esk2_0 )
& ( setIn(esk5_0,alive)
| esk5_0 = esk2_0 )
& ( esk7_0 != esk3_0
| esk7_0 = esk2_0 )
& ( setIn(esk7_0,alive)
| esk7_0 = esk2_0 )
& host(esk7_0) != host(esk5_0)
& host(esk6_0) = host(esk5_0)
& host(esk8_0) = host(esk7_0)
& elem(m_Down(esk8_0),esk1_0)
& setIn(host(esk6_0),index(down,host(esk7_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_4])])])])])])])]) ).
cnf(c_0_7,plain,
( X4 = X5
| ~ epred1_3(X1,X2,X3)
| ~ setIn(X4,alive)
| ~ setIn(X5,alive)
| host(X4) != host(X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
epred1_3(esk3_0,esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( setIn(X5,alive)
| ~ epred1_3(X1,X2,X3)
| ~ setIn(X4,alive)
| host(X4) != host(X5)
| ~ leq(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( setIn(X1,alive)
| host(X2) != host(X1)
| ~ leq(X2,X1)
| ~ setIn(X2,alive) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
host(esk6_0) = host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
host(esk3_0) = host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( X1 = esk3_0
| host(X1) != host(esk3_0)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( setIn(X1,alive)
| host(esk3_0) != host(X1)
| ~ leq(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
setIn(host(esk6_0),index(down,host(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
host(esk6_0) = host(esk3_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( X1 = esk3_0
| host(X1) != host(esk3_0)
| ~ leq(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( leq(X1,esk2_0)
| host(esk3_0) != host(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
host(esk3_0) = host(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_22,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_23,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,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_5]) ).
cnf(c_0_25,negated_conjecture,
setIn(host(esk3_0),index(down,host(esk7_0))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( esk7_0 = esk2_0
| setIn(esk7_0,alive) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
esk2_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
cons(m_Down(esk4_0),esk1_0) = queue(host(esk3_0)),
inference(spm,[status(thm)],[c_0_23,c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( host(esk7_0) = host(X1)
| host(esk7_0) != host(X2)
| host(esk3_0) != host(X1)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(esk7_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( esk7_0 = esk3_0
| setIn(esk7_0,alive) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( elem(X1,queue(host(esk3_0)))
| ~ elem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
elem(m_Down(esk8_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
( host(esk7_0) = host(X1)
| esk7_0 = esk3_0
| host(esk7_0) != host(X2)
| host(esk3_0) != host(X1)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
elem(m_Down(esk8_0),queue(host(esk3_0))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
host(esk8_0) = host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
host(esk3_0) != host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_38,negated_conjecture,
( esk7_0 = esk3_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_34,c_0_35]),c_0_36]),c_0_11])]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
esk7_0 = esk3_0,
inference(spm,[status(thm)],[c_0_38,c_0_8]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV456+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 01:00:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.41/28.59 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.41/28.59
% 0.41/28.59 # Failure: Resource limit exceeded (time)
% 0.41/28.59 # OLD status Res
% 0.41/28.59 # Preprocessing time : 0.019 s
% 0.41/28.59 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.41/28.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.41/28.59 # Preprocessing time : 0.012 s
% 0.41/28.59
% 0.41/28.59 # Proof found!
% 0.41/28.59 # SZS status Theorem
% 0.41/28.59 # SZS output start CNFRefutation
% See solution above
% 0.41/28.59 # Proof object total steps : 41
% 0.41/28.59 # Proof object clause steps : 33
% 0.41/28.59 # Proof object formula steps : 8
% 0.41/28.59 # Proof object conjectures : 31
% 0.41/28.59 # Proof object clause conjectures : 28
% 0.41/28.59 # Proof object formula conjectures : 3
% 0.41/28.59 # Proof object initial clauses used : 16
% 0.41/28.59 # Proof object initial formulas used : 2
% 0.41/28.59 # Proof object generating inferences : 13
% 0.41/28.59 # Proof object simplifying inferences : 11
% 0.41/28.59 # Training examples: 0 positive, 0 negative
% 0.41/28.59 # Parsed axioms : 67
% 0.41/28.59 # Removed by relevancy pruning/SinE : 13
% 0.41/28.59 # Initial clauses : 101
% 0.41/28.59 # Removed in clause preprocessing : 6
% 0.41/28.59 # Initial clauses in saturation : 95
% 0.41/28.59 # Processed clauses : 6422
% 0.41/28.59 # ...of these trivial : 65
% 0.41/28.59 # ...subsumed : 4478
% 0.41/28.59 # ...remaining for further processing : 1879
% 0.41/28.59 # Other redundant clauses eliminated : 17
% 0.41/28.59 # Clauses deleted for lack of memory : 0
% 0.41/28.59 # Backward-subsumed : 358
% 0.41/28.59 # Backward-rewritten : 497
% 0.41/28.59 # Generated clauses : 107331
% 0.41/28.59 # ...of the previous two non-trivial : 97095
% 0.41/28.59 # Contextual simplify-reflections : 8601
% 0.41/28.59 # Paramodulations : 107133
% 0.41/28.59 # Factorizations : 95
% 0.41/28.59 # Equation resolutions : 70
% 0.41/28.59 # Current number of processed clauses : 1016
% 0.41/28.59 # Positive orientable unit clauses : 62
% 0.41/28.59 # Positive unorientable unit clauses: 0
% 0.41/28.59 # Negative unit clauses : 109
% 0.41/28.59 # Non-unit-clauses : 845
% 0.41/28.59 # Current number of unprocessed clauses: 50387
% 0.41/28.59 # ...number of literals in the above : 220832
% 0.41/28.59 # Current number of archived formulas : 0
% 0.41/28.59 # Current number of archived clauses : 855
% 0.41/28.59 # Clause-clause subsumption calls (NU) : 1768399
% 0.41/28.59 # Rec. Clause-clause subsumption calls : 299962
% 0.41/28.59 # Non-unit clause-clause subsumptions : 12766
% 0.41/28.59 # Unit Clause-clause subsumption calls : 4355
% 0.41/28.59 # Rewrite failures with RHS unbound : 0
% 0.41/28.59 # BW rewrite match attempts : 276
% 0.41/28.59 # BW rewrite match successes : 17
% 0.41/28.59 # Condensation attempts : 0
% 0.41/28.59 # Condensation successes : 0
% 0.41/28.59 # Termbank termtop insertions : 1466946
% 0.41/28.59
% 0.41/28.59 # -------------------------------------------------
% 0.41/28.59 # User time : 4.298 s
% 0.41/28.59 # System time : 0.046 s
% 0.41/28.59 # Total time : 4.344 s
% 0.41/28.59 # Maximum resident set size: 61932 pages
% 0.41/46.43 eprover: CPU time limit exceeded, terminating
% 0.41/46.44 eprover: CPU time limit exceeded, terminating
% 0.41/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.45 eprover: No such file or directory
% 0.41/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.45 eprover: No such file or directory
% 0.41/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.45 eprover: No such file or directory
% 0.41/46.46 eprover: CPU time limit exceeded, terminating
% 0.41/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.46 eprover: No such file or directory
% 0.41/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.46 eprover: No such file or directory
% 0.41/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.46 eprover: No such file or directory
% 0.41/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.46 eprover: No such file or directory
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
%------------------------------------------------------------------------------