%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRA008+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 12:31:52 PM UTC 2026
% Result : Theorem 0.14s 10.51s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 170 ( 38 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 202 ( 80 ~; 77 |; 34 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 92 ( 3 sgn 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sequential_is_triangle,conjecture,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( sequential(X7,X8)
& precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ? [X9] : triangle(X7,X8,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_is_triangle) ).
fof(back_edge,lemma,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ? [X9] :
( head_of(X9) = tail_of(X7)
& tail_of(X9) = head_of(X8)
& edge(X9) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',back_edge) ).
fof(sequential_defn,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( head_of(X7) = tail_of(X8)
& X7 != X8
& edge(X8)
& edge(X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(triangle_defn,axiom,
! [X7,X8,X9] :
( triangle(X7,X8,X9)
<=> ( sequential(X9,X7)
& sequential(X8,X9)
& sequential(X7,X8)
& edge(X9)
& edge(X8)
& edge(X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',triangle_defn) ).
fof(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(c_0_5,negated_conjecture,
~ ( complete
=> ! [X2,X3,X7,X8,X4] :
( ( sequential(X7,X8)
& precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ? [X9] : triangle(X7,X8,X9) ) ),
inference(assume_negation,[status(cth)],[sequential_is_triangle]) ).
fof(c_0_6,lemma,
! [X84,X85,X86,X87,X88] :
( ( ~ complete
| ~ precedes(X86,X87,X88)
| ~ shortest_path(X84,X85,X88)
| head_of(esk9_4(X84,X85,X86,X87)) = tail_of(X86) )
& ( ~ complete
| ~ precedes(X86,X87,X88)
| ~ shortest_path(X84,X85,X88)
| tail_of(esk9_4(X84,X85,X86,X87)) = head_of(X87) )
& ( ~ complete
| ~ precedes(X86,X87,X88)
| ~ shortest_path(X84,X85,X88)
| edge(esk9_4(X84,X85,X86,X87)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[back_edge])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X95] :
( ~ triangle(esk12_0,esk13_0,X95)
& sequential(esk12_0,esk13_0)
& precedes(esk12_0,esk13_0,esk14_0)
& shortest_path(esk10_0,esk11_0,esk14_0)
& complete ),
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_5])])])])]) ).
cnf(c_0_8,lemma,
( ~ complete
| ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5)
| head_of(esk9_4(X1,X2,X3,X4)) = tail_of(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,lemma,
( ~ complete
| ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5)
| edge(esk9_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X7,X8] :
( sequential(X7,X8)
<=> ( head_of(X7) = tail_of(X8)
& X7 != X8
& edge(X8)
& edge(X7) ) ),
inference(fof_simplification,[status(thm)],[sequential_defn]) ).
cnf(c_0_12,lemma,
( ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5)
| head_of(esk9_4(X1,X2,X3,X4)) = tail_of(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
shortest_path(esk10_0,esk11_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,lemma,
( ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5)
| edge(esk9_4(X1,X2,X3,X4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9])]) ).
fof(c_0_15,plain,
! [X38,X39] :
( ( sequential(X38,X39)
| head_of(X38) != tail_of(X39)
| X38 = X39
| ~ edge(X39)
| ~ edge(X38) )
& ( ~ sequential(X38,X39)
| head_of(X38) = tail_of(X39) )
& ( ~ sequential(X38,X39)
| X38 != X39 )
& ( ~ sequential(X38,X39)
| edge(X39) )
& ( ~ sequential(X38,X39)
| edge(X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ precedes(X1,X2,esk14_0)
| head_of(esk9_4(esk10_0,esk11_0,X1,X2)) = tail_of(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
precedes(esk12_0,esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ~ precedes(X1,X2,esk14_0)
| edge(esk9_4(esk10_0,esk11_0,X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,lemma,
( ~ complete
| ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5)
| tail_of(esk9_4(X1,X2,X3,X4)) = head_of(X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_20,plain,
! [X67,X68,X69] :
( ( triangle(X67,X68,X69)
| ~ sequential(X69,X67)
| ~ sequential(X68,X69)
| ~ sequential(X67,X68)
| ~ edge(X69)
| ~ edge(X68)
| ~ edge(X67) )
& ( ~ triangle(X67,X68,X69)
| sequential(X69,X67) )
& ( ~ triangle(X67,X68,X69)
| sequential(X68,X69) )
& ( ~ triangle(X67,X68,X69)
| sequential(X67,X68) )
& ( ~ triangle(X67,X68,X69)
| edge(X69) )
& ( ~ triangle(X67,X68,X69)
| edge(X68) )
& ( ~ triangle(X67,X68,X69)
| edge(X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[triangle_defn])])])]) ).
cnf(c_0_21,plain,
( head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1)
| sequential(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
head_of(esk9_4(esk10_0,esk11_0,esk12_0,esk13_0)) = tail_of(esk12_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
edge(esk9_4(esk10_0,esk11_0,esk12_0,esk13_0)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_24,plain,
( ~ sequential(X1,X2)
| edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
sequential(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,lemma,
( ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5)
| tail_of(esk9_4(X1,X2,X3,X4)) = head_of(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_9])]) ).
cnf(c_0_27,plain,
( ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1)
| triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( ~ edge(X1)
| tail_of(X1) != tail_of(esk12_0)
| sequential(esk9_4(esk10_0,esk11_0,esk12_0,esk13_0),X1)
| esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ precedes(X1,X2,esk14_0)
| tail_of(esk9_4(esk10_0,esk11_0,X1,X2)) = head_of(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
( ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_27,c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( sequential(esk9_4(esk10_0,esk11_0,esk12_0,esk13_0),esk12_0)
| esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk12_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
tail_of(esk9_4(esk10_0,esk11_0,esk12_0,esk13_0)) = head_of(esk13_0),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_34,plain,
( ~ sequential(X2,X1)
| edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_35,plain,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
inference(fof_simplification,[status(thm)],[no_loops]) ).
cnf(c_0_36,negated_conjecture,
( ~ sequential(esk12_0,X1)
| ~ sequential(X1,esk9_4(esk10_0,esk11_0,esk12_0,esk13_0))
| triangle(esk12_0,X1,esk9_4(esk10_0,esk11_0,esk12_0,esk13_0))
| esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk12_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ triangle(esk12_0,esk13_0,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_38,negated_conjecture,
( ~ edge(X1)
| head_of(esk13_0) != head_of(X1)
| sequential(X1,esk9_4(esk10_0,esk11_0,esk12_0,esk13_0))
| X1 = esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_23])]) ).
cnf(c_0_39,negated_conjecture,
edge(esk13_0),
inference(spm,[status(thm)],[c_0_34,c_0_25]) ).
fof(c_0_40,plain,
! [X13] :
( head_of(X13) != tail_of(X13)
| ~ edge(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])]) ).
cnf(c_0_41,negated_conjecture,
( ~ sequential(esk13_0,esk9_4(esk10_0,esk11_0,esk12_0,esk13_0))
| esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk12_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_25]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( sequential(esk13_0,esk9_4(esk10_0,esk11_0,esk12_0,esk13_0))
| esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk13_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39])]) ).
cnf(c_0_43,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk12_0
| esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk13_0 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
tail_of(esk12_0) != head_of(esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_22]),c_0_23])]) ).
cnf(c_0_46,negated_conjecture,
esk9_4(esk10_0,esk11_0,esk12_0,esk13_0) = esk12_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_44]),c_0_45]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_46]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRA008+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/10.39 % Computer : n013.cluster.edu
% 0.10/10.39 % Model : x86_64 x86_64
% 0.10/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.39 % Memory : 8046.5625MB
% 0.10/10.39 % OS : Linux 6.8.0-71-generic
% 0.10/10.39 % CPULimit : 300
% 0.10/10.39 % WCLimit : 300
% 0.10/10.39 % DateTime : Sun Sep 20 18:22:17 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.45 Running first-order theorem proving
% 0.14/10.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.14/10.51 % Version: 3.5.1
% 0.14/10.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/10.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/10.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.51 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.51 % Starting sh5l with 300s (1) cores
% 0.14/10.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3162597 completed with status 0
% 0.14/10.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/10.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/10.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/10.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.51 % No SInE strategy applied
% 0.14/10.51 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.14/10.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.51 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/10.51 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/10.51 % Starting new_bool_3 with 136s (1) cores
% 0.14/10.51 % Starting new_bool_1 with 136s (1) cores
% 0.14/10.51 % new_bool_1 with pid 3162605 completed with status 0
% 0.14/10.51 % Result found by new_bool_1
% 0.14/10.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/10.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/10.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.51 % No SInE strategy applied
% 0.14/10.51 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.14/10.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.51 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/10.51 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/10.51 % Starting new_bool_3 with 136s (1) cores
% 0.14/10.51 % Starting new_bool_1 with 136s (1) cores
% 0.14/10.51 % Preprocessing time : 0.002 s
% 0.14/10.51 % Presaturation interreduction done
% 0.14/10.51
% 0.14/10.51 % Proof found!
% 0.14/10.51 % SZS status Theorem
% 0.14/10.51 % SZS output start CNFRefutation
% See solution above
% 0.14/10.51 % Parsed axioms : 19
% 0.14/10.51 % Removed by relevancy pruning/SinE : 0
% 0.14/10.51 % Initial clauses : 67
% 0.14/10.51 % Removed in clause preprocessing : 1
% 0.14/10.51 % Initial clauses in saturation : 66
% 0.14/10.51 % Processed clauses : 362
% 0.14/10.51 % ...of these trivial : 3
% 0.14/10.51 % ...subsumed : 33
% 0.14/10.51 % ...remaining for further processing : 326
% 0.14/10.51 % Other redundant clauses eliminated : 43
% 0.14/10.51 % Clauses deleted for lack of memory : 0
% 0.14/10.51 % Backward-subsumed : 11
% 0.14/10.51 % Backward-rewritten : 38
% 0.14/10.51 % Generated clauses : 637
% 0.14/10.51 % ...of the previous two non-redundant : 509
% 0.14/10.51 % ...aggressively subsumed : 0
% 0.14/10.51 % Contextual simplify-reflections : 18
% 0.14/10.51 % Paramodulations : 581
% 0.14/10.51 % Factorizations : 5
% 0.14/10.51 % NegExts : 0
% 0.14/10.51 % Equation resolutions : 50
% 0.14/10.51 % Disequality decompositions : 0
% 0.14/10.51 % Total rewrite steps : 285
% 0.14/10.51 % ...of those cached : 239
% 0.14/10.51 % Propositional unsat checks : 0
% 0.14/10.51 % Propositional check models : 0
% 0.14/10.51 % Propositional check unsatisfiable : 0
% 0.14/10.51 % Propositional clauses : 0
% 0.14/10.51 % Propositional clauses after purity: 0
% 0.14/10.51 % Propositional unsat core size : 0
% 0.14/10.51 % Propositional preprocessing time : 0.000
% 0.14/10.51 % Propositional encoding time : 0.000
% 0.14/10.51 % Propositional solver time : 0.000
% 0.14/10.51 % Success case prop preproc time : 0.000
% 0.14/10.51 % Success case prop encoding time : 0.000
% 0.14/10.51 % Success case prop solver time : 0.000
% 0.14/10.51 % Current number of processed clauses : 203
% 0.14/10.51 % Positive orientable unit clauses : 60
% 0.14/10.51 % Positive unorientable unit clauses: 0
% 0.14/10.51 % Negative unit clauses : 8
% 0.14/10.51 % Non-unit-clauses : 135
% 0.14/10.51 % Current number of unprocessed clauses: 275
% 0.14/10.51 % ...number of literals in the above : 1158
% 0.14/10.51 % Current number of archived formulas : 0
% 0.14/10.51 % Current number of archived clauses : 119
% 0.14/10.51 % Clause-clause subsumption calls (NU) : 3643
% 0.14/10.51 % Rec. Clause-clause subsumption calls : 1811
% 0.14/10.51 % Non-unit clause-clause subsumptions : 43
% 0.14/10.51 % Unit Clause-clause subsumption calls : 302
% 0.14/10.51 % Rewrite failures with RHS unbound : 0
% 0.14/10.51 % BW rewrite match attempts : 57
% 0.14/10.51 % BW rewrite match successes : 27
% 0.14/10.51 % Condensation attempts : 0
% 0.14/10.51 % Condensation successes : 0
% 0.14/10.51 % Termbank termtop insertions : 20206
% 0.14/10.51 % Search garbage collected termcells : 1287
% 0.14/10.51
% 0.14/10.51 % -------------------------------------------------
% 0.14/10.51 % User time : 0.031 s
% 0.14/10.51 % System time : 0.007 s
% 0.14/10.51 % Total time : 0.037 s
% 0.14/10.51 % Maximum resident set size: 3672 pages
% 0.14/10.51
% 0.14/10.51 % -------------------------------------------------
% 0.14/10.51 % User time : 0.143 s
% 0.14/10.51 % System time : 0.030 s
% 0.14/10.51 % Total time : 0.173 s
% 0.14/10.51 % Maximum resident set size: 4608 pages
% 0.14/10.51 % E exiting
%------------------------------------------------------------------------------