TSTP Solution File: SWV449+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV449+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:50 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 29 unt; 0 def)
% Number of atoms : 268 ( 107 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 343 ( 126 ~; 78 |; 91 &)
% ( 3 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 197 ( 36 sgn 134 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) )
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( setIn(host(X7),index(acks,host(X5)))
| host(X7) = host(X6) )
=> ! [X17] :
( host(X7) = host(X17)
=> ( host(X5) = host(X17)
=> ! [X18,X19] :
( host(X7) != host(X19)
=> ( host(X5) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_44,axiom,
! [X5,X6,X4] : snoc(cons(X5,X4),X6) = cons(X5,snoc(X4,X6)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_44) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
fof(c_0_5,plain,
! [X12,X13,X6,X5] :
( epred1_4(X5,X6,X13,X12)
<=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_6,plain,
! [X12,X13,X6,X5] :
( epred1_4(X5,X6,X13,X12)
=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [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))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_4(X5,X6,X13,X12)
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( setIn(host(X7),index(acks,host(X5)))
| host(X7) = host(X6) )
=> ! [X17] :
( host(X7) = host(X17)
=> ( host(X5) = host(X17)
=> ! [X18,X19] :
( host(X7) != host(X19)
=> ( host(X5) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_5]) ).
fof(c_0_8,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39] :
( ( ~ setIn(X22,alive)
| ~ elem(m_Down(X22),queue(host(X21)))
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Down(X24),queue(host(X23)))
| ~ setIn(X24,alive)
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Down(X26),queue(host(X25)))
| host(X26) != host(X25)
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Halt(X28),queue(host(X27)))
| ~ leq(host(X27),host(X28))
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Ack(X31,X29),queue(host(X30)))
| ~ leq(host(X29),host(X31))
| ~ epred1_4(X20,X19,X18,X17) )
& ( setIn(X32,alive)
| ~ leq(X33,X32)
| host(X33) != host(X32)
| ~ setIn(X33,alive)
| ~ epred1_4(X20,X19,X18,X17) )
& ( X35 = X34
| host(X35) != host(X34)
| ~ setIn(X34,alive)
| ~ setIn(X35,alive)
| ~ epred1_4(X20,X19,X18,X17) )
& ( 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_4(X20,X19,X18,X17) )
& ( queue(host(X20)) = cons(m_Ack(X18,X19),X17)
| ~ epred1_4(X20,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_6])])])])])])]) ).
fof(c_0_9,negated_conjecture,
( epred1_4(esk3_0,esk4_0,esk2_0,esk1_0)
& setIn(esk3_0,alive)
& index(elid,host(esk3_0)) = esk2_0
& index(status,host(esk3_0)) = elec_2
& host(esk4_0) = index(pendack,host(esk3_0))
& leq(nbr_proc,index(pendack,host(esk3_0)))
& ( setIn(host(esk5_0),index(acks,host(esk3_0)))
| host(esk5_0) = host(esk4_0) )
& host(esk5_0) = host(esk6_0)
& host(esk3_0) = host(esk6_0)
& host(esk5_0) != host(esk8_0)
& host(esk3_0) != host(esk8_0)
& host(esk8_0) != host(esk6_0)
& setIn(esk6_0,alive)
& setIn(esk8_0,alive)
& host(esk7_0) = host(esk6_0)
& host(esk9_0) = host(esk8_0)
& elem(m_Down(esk7_0),queue(host(esk8_0)))
& elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk3_0))) ),
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_7])])])])]) ).
cnf(c_0_10,plain,
( X5 = X6
| ~ epred1_4(X1,X2,X3,X4)
| ~ setIn(X5,alive)
| ~ setIn(X6,alive)
| host(X5) != host(X6) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
epred1_4(esk3_0,esk4_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
host(esk5_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,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])])])])]) ).
fof(c_0_15,plain,
! [X7,X8,X9] : snoc(cons(X7,X9),X8) = cons(X7,snoc(X9,X8)),
inference(variable_rename,[status(thm)],[axiom_44]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
host(esk5_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
host(esk3_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,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])])])])]) ).
cnf(c_0_21,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
snoc(cons(X1,X2),X3) = cons(X1,snoc(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( X1 = esk6_0
| host(X1) != host(esk7_0)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
host(esk3_0) = host(esk7_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_13]),c_0_18]) ).
cnf(c_0_26,plain,
( queue(host(X1)) = cons(m_Ack(X3,X2),X4)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( elem(X1,snoc(cons(X2,X3),X4))
| ~ elem(X1,snoc(X3,X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
esk3_0 = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
fof(c_0_31,plain,
! [X7,X8] : m_Down(X7) != m_Ldr(X8),
inference(variable_rename,[status(thm)],[axiom_18]) ).
cnf(c_0_32,plain,
( host(X6) = host(X8)
| ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X8)))
| host(X7) != host(X6)
| host(X5) != host(X8)
| ~ setIn(X6,alive)
| ~ setIn(X8,alive) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
host(esk6_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
queue(host(esk7_0)) = cons(m_Ack(esk2_0,esk4_0),esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_25]) ).
cnf(c_0_35,plain,
( X1 = X2
| elem(X1,cons(X3,X4))
| ~ elem(X1,snoc(X4,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk6_0))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( host(X1) = host(esk7_0)
| host(X2) != host(esk7_0)
| host(X1) != host(X3)
| ~ epred1_4(X4,X5,X6,X7)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),cons(m_Ack(esk2_0,esk4_0),esk1_0))
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17])]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
elem(m_Down(esk9_0),cons(X1,esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
host(esk5_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
host(esk9_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,plain,
( host(X1) = host(esk7_0)
| host(X2) != host(esk7_0)
| host(X1) != host(esk9_0)
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_44,negated_conjecture,
host(esk9_0) != host(esk7_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_46,negated_conjecture,
( host(X1) != host(esk7_0)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),queue(host(esk9_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_43])]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk9_0))),
inference(rw,[status(thm)],[c_0_45,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
epred1_4(esk6_0,esk4_0,esk2_0,esk1_0),
inference(rw,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_49,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_48,c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV449+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % 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 : Tue Jun 14 17:34:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.019 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 51
% 0.22/1.41 # Proof object clause steps : 37
% 0.22/1.41 # Proof object formula steps : 14
% 0.22/1.41 # Proof object conjectures : 29
% 0.22/1.41 # Proof object clause conjectures : 26
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 18
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 11
% 0.22/1.41 # Proof object simplifying inferences : 22
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 67
% 0.22/1.41 # Removed by relevancy pruning/SinE : 20
% 0.22/1.41 # Initial clauses : 85
% 0.22/1.41 # Removed in clause preprocessing : 6
% 0.22/1.41 # Initial clauses in saturation : 79
% 0.22/1.41 # Processed clauses : 364
% 0.22/1.41 # ...of these trivial : 3
% 0.22/1.41 # ...subsumed : 165
% 0.22/1.41 # ...remaining for further processing : 196
% 0.22/1.41 # Other redundant clauses eliminated : 4
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 5
% 0.22/1.41 # Backward-rewritten : 13
% 0.22/1.41 # Generated clauses : 1278
% 0.22/1.41 # ...of the previous two non-trivial : 1197
% 0.22/1.41 # Contextual simplify-reflections : 40
% 0.22/1.41 # Paramodulations : 1242
% 0.22/1.41 # Factorizations : 24
% 0.22/1.41 # Equation resolutions : 11
% 0.22/1.41 # Current number of processed clauses : 173
% 0.22/1.41 # Positive orientable unit clauses : 28
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 33
% 0.22/1.41 # Non-unit-clauses : 112
% 0.22/1.41 # Current number of unprocessed clauses: 890
% 0.22/1.41 # ...number of literals in the above : 3551
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 19
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 6853
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 3389
% 0.22/1.41 # Non-unit clause-clause subsumptions : 177
% 0.22/1.41 # Unit Clause-clause subsumption calls : 272
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 11
% 0.22/1.41 # BW rewrite match successes : 5
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 19782
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.078 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.081 s
% 0.22/1.41 # Maximum resident set size: 4284 pages
%------------------------------------------------------------------------------