%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP006^5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Wed Sep 30 08:03:59 AM UTC 2026
% Result : Theorem 5.95s 2.14s
% Output : CNFRefutation 5.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 90 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 503 ( 41 ~; 34 |; 7 &; 397 @)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 11 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 60 ( 0 ^; 60 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
del: $tType ).
thf(decl_23,type,
bool: del ).
thf(decl_25,type,
arr: del > del > del ).
thf(decl_26,type,
mem: $i > del > $o ).
thf(decl_27,type,
ap: $i > $i > $i ).
thf(decl_29,type,
p: $i > $o ).
thf(decl_619,type,
c_2EquantHeuristics_2EGUESS__FORALL__POINT: del > del > $i ).
thf(decl_630,type,
esk1_0: del ).
thf(decl_631,type,
esk2_0: del ).
thf(decl_632,type,
esk3_0: $i ).
thf(decl_633,type,
esk4_0: $i ).
thf(decl_634,type,
esk5_0: $i ).
thf(decl_635,type,
esk6_4: del > del > $i > $i > $i ).
thf(ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def,axiom,
! [X13: del,X20: del,X109: $i] :
( ( mem @ X109 @ ( arr @ X13 @ X20 ) )
=> ! [X58: $i] :
( ( mem @ X58 @ ( arr @ X20 @ bool ) )
=> ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X20 ) @ X109 ) @ X58 ) )
<=> ! [X2817: $i] :
( ( mem @ X2817 @ X13 )
=> ~ ( p @ ( ap @ X58 @ ( ap @ X109 @ X2817 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RiGofO7FBw/E---3.1_1229603.p',ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def) ).
thf(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
! [X13: del,X20: del,X109: $i] :
( ( mem @ X109 @ ( arr @ X20 @ X13 ) )
=> ! [X58: $i] :
( ( mem @ X58 @ ( arr @ X13 @ bool ) )
=> ! [X80: $i] :
( ( mem @ X80 @ ( arr @ X13 @ bool ) )
=> ( ! [X32: $i] :
( ( mem @ X32 @ X13 )
=> ( ( p @ ( ap @ X80 @ X32 ) )
=> ( p @ ( ap @ X58 @ X32 ) ) ) )
=> ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X58 ) )
=> ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X80 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RiGofO7FBw/E---3.1_1229603.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
thf(ap_tp,axiom,
! [X3: del,X4: del,X5: $i] :
( ( mem @ X5 @ ( arr @ X3 @ X4 ) )
=> ! [X6: $i] :
( ( mem @ X6 @ X3 )
=> ( mem @ ( ap @ X5 @ X6 ) @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RiGofO7FBw/E---3.1_1229603.p',ap_tp) ).
thf(c_0_3,plain,
! [X13: del,X20: del,X109: $i] :
( ( mem @ X109 @ ( arr @ X13 @ X20 ) )
=> ! [X58: $i] :
( ( mem @ X58 @ ( arr @ X20 @ bool ) )
=> ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X20 ) @ X109 ) @ X58 ) )
<=> ! [X2817: $i] :
( ( mem @ X2817 @ X13 )
=> ~ ( p @ ( ap @ X58 @ ( ap @ X109 @ X2817 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def]) ).
thf(c_0_4,negated_conjecture,
~ ! [X13: del,X20: del,X109: $i] :
( ( mem @ X109 @ ( arr @ X20 @ X13 ) )
=> ! [X58: $i] :
( ( mem @ X58 @ ( arr @ X13 @ bool ) )
=> ! [X80: $i] :
( ( mem @ X80 @ ( arr @ X13 @ bool ) )
=> ( ! [X32: $i] :
( ( mem @ X32 @ X13 )
=> ( ( p @ ( ap @ X80 @ X32 ) )
=> ( p @ ( ap @ X58 @ X32 ) ) ) )
=> ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X58 ) )
=> ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X80 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT]) ).
thf(c_0_5,plain,
! [X3506: del,X3507: del,X3508: $i,X3509: $i,X3510: $i] :
( ( ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3506 @ X3507 ) @ X3508 ) @ X3509 ) )
| ~ ( mem @ X3510 @ X3506 )
| ~ ( p @ ( ap @ X3509 @ ( ap @ X3508 @ X3510 ) ) )
| ~ ( mem @ X3509 @ ( arr @ X3507 @ bool ) )
| ~ ( mem @ X3508 @ ( arr @ X3506 @ X3507 ) ) )
& ( ( mem @ ( esk6_4 @ X3506 @ X3507 @ X3508 @ X3509 ) @ X3506 )
| ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3506 @ X3507 ) @ X3508 ) @ X3509 ) )
| ~ ( mem @ X3509 @ ( arr @ X3507 @ bool ) )
| ~ ( mem @ X3508 @ ( arr @ X3506 @ X3507 ) ) )
& ( ( p @ ( ap @ X3509 @ ( ap @ X3508 @ ( esk6_4 @ X3506 @ X3507 @ X3508 @ X3509 ) ) ) )
| ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3506 @ X3507 ) @ X3508 ) @ X3509 ) )
| ~ ( mem @ X3509 @ ( arr @ X3507 @ bool ) )
| ~ ( mem @ X3508 @ ( arr @ X3506 @ X3507 ) ) ) ),
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_3])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X3503: $i] :
( ( mem @ esk3_0 @ ( arr @ esk2_0 @ esk1_0 ) )
& ( mem @ esk4_0 @ ( arr @ esk1_0 @ bool ) )
& ( mem @ esk5_0 @ ( arr @ esk1_0 @ bool ) )
& ( ~ ( mem @ X3503 @ esk1_0 )
| ~ ( p @ ( ap @ esk5_0 @ X3503 ) )
| ( p @ ( ap @ esk4_0 @ X3503 ) ) )
& ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk4_0 ) )
& ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk5_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)],[c_0_4])])])])]) ).
thf(c_0_7,plain,
! [X3551: del,X3552: del,X3553: $i,X3554: $i] :
( ~ ( mem @ X3553 @ ( arr @ X3551 @ X3552 ) )
| ~ ( mem @ X3554 @ X3551 )
| ( mem @ ( ap @ X3553 @ X3554 ) @ X3552 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
thf(c_0_8,plain,
! [X2: $i,X3: del,X6: $i,X5: $i,X4: del] :
( ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ X4 ) @ X2 ) @ X5 ) )
| ~ ( mem @ X6 @ X3 )
| ~ ( p @ ( ap @ X5 @ ( ap @ X2 @ X6 ) ) )
| ~ ( mem @ X5 @ ( arr @ X4 @ bool ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
mem @ esk4_0 @ ( arr @ esk1_0 @ bool ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X2: $i,X5: $i,X4: del,X3: del] :
( ( mem @ ( ap @ X2 @ X5 ) @ X4 )
| ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) )
| ~ ( mem @ X5 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
mem @ esk3_0 @ ( arr @ esk2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X5: $i,X3: del] :
( ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ esk1_0 ) @ X2 ) @ esk4_0 ) )
| ~ ( p @ ( ap @ esk4_0 @ ( ap @ X2 @ X5 ) ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ esk1_0 ) )
| ~ ( mem @ X5 @ X3 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i] :
( ( p @ ( ap @ esk4_0 @ X2 ) )
| ~ ( mem @ X2 @ esk1_0 )
| ~ ( p @ ( ap @ esk5_0 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i] :
( ( mem @ ( ap @ esk3_0 @ X2 ) @ esk1_0 )
| ~ ( mem @ X2 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X2: $i] :
( ~ ( p @ ( ap @ esk4_0 @ ( ap @ esk3_0 @ X2 ) ) )
| ~ ( mem @ X2 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13])]) ).
thf(c_0_17,negated_conjecture,
~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_18,plain,
! [X2: $i,X3: del,X5: $i,X4: del] :
( ( mem @ ( esk6_4 @ X3 @ X4 @ X2 @ X5 ) @ X3 )
| ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ X4 ) @ X2 ) @ X5 ) )
| ~ ( mem @ X5 @ ( arr @ X4 @ bool ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_19,negated_conjecture,
mem @ esk5_0 @ ( arr @ esk1_0 @ bool ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i] :
( ~ ( p @ ( ap @ esk5_0 @ ( ap @ esk3_0 @ X2 ) ) )
| ~ ( mem @ X2 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_21,negated_conjecture,
mem @ ( esk6_4 @ esk2_0 @ esk1_0 @ esk3_0 @ esk5_0 ) @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_11])]) ).
thf(c_0_22,negated_conjecture,
~ ( p @ ( ap @ esk5_0 @ ( ap @ esk3_0 @ ( esk6_4 @ esk2_0 @ esk1_0 @ esk3_0 @ esk5_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_23,plain,
! [X2: $i,X3: del,X5: $i,X4: del] :
( ( p @ ( ap @ X2 @ ( ap @ X5 @ ( esk6_4 @ X3 @ X4 @ X5 @ X2 ) ) ) )
| ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ X4 ) @ X5 ) @ X2 ) )
| ~ ( mem @ X2 @ ( arr @ X4 @ bool ) )
| ~ ( mem @ X5 @ ( arr @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_11])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP006^5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 % Computer : n019.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 19:23:04 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.26 Running higher-order theorem proving
% 1.15/1.23 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.RiGofO7FBw/E---3.1_1229603.p
% 5.95/2.14 % Version: 3.5.1-ho
% 5.95/2.14 % Preprocessing class: HMLMSMLLSSLNSFA.
% 5.95/2.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.95/2.14 % Starting post_as_ho7 with 1200s (4) cores
% 5.95/2.14 % Starting full_lambda_5 with 600s (2) cores
% 5.95/2.14 % Starting full_lambda_9 with 300s (1) cores
% 5.95/2.14 % Starting full_lambda_7 with 300s (1) cores
% 5.95/2.14 % post_as_ho7 with pid 1229737 completed with status 0
% 5.95/2.14 % Result found by post_as_ho7
% 5.95/2.14 % Preprocessing class: HMLMSMLLSSLNSFA.
% 5.95/2.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.95/2.14 % Starting post_as_ho7 with 1200s (4) cores
% 5.95/2.14 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 5.95/2.14 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 5.95/2.14 % Search class: HGHSM-FSLS32-DSFFFFNN
% 5.95/2.14 % partial match(2): FGHSM-FSLS32-DFFFFFNN
% 5.95/2.14 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 5.95/2.14 % Starting SubtermCWHack with 109s (1) cores
% 5.95/2.14 % Starting post_as_ho7 with 121s (1) cores
% 5.95/2.14 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 5.95/2.14 % Starting new_bool_3 with 181s (1) cores
% 5.95/2.14 % post_as_ho7 with pid 1229742 completed with status 0
% 5.95/2.14 % Result found by post_as_ho7
% 5.95/2.14 % Preprocessing class: HMLMSMLLSSLNSFA.
% 5.95/2.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.95/2.14 % Starting post_as_ho7 with 1200s (4) cores
% 5.95/2.14 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 5.95/2.14 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 5.95/2.14 % Search class: HGHSM-FSLS32-DSFFFFNN
% 5.95/2.14 % partial match(2): FGHSM-FSLS32-DFFFFFNN
% 5.95/2.14 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 5.95/2.14 % Starting SubtermCWHack with 109s (1) cores
% 5.95/2.14 % Starting post_as_ho7 with 121s (1) cores
% 5.95/2.14 % Preprocessing time : 0.031 s
% 5.95/2.14
% 5.95/2.14 % Proof found!
% 5.95/2.14 % SZS status Theorem
% 5.95/2.14 % SZS output start CNFRefutation
% See solution above
% 5.95/2.14 % Parsed axioms : 4394
% 5.95/2.14 % Removed by relevancy pruning/SinE : 4212
% 5.95/2.14 % Initial clauses : 1267
% 5.95/2.14 % Removed in clause preprocessing : 901
% 5.95/2.14 % Initial clauses in saturation : 366
% 5.95/2.14 % Processed clauses : 466
% 5.95/2.14 % ...of these trivial : 1
% 5.95/2.14 % ...subsumed : 29
% 5.95/2.14 % ...remaining for further processing : 436
% 5.95/2.14 % Other redundant clauses eliminated : 34
% 5.95/2.14 % Clauses deleted for lack of memory : 0
% 5.95/2.14 % Backward-subsumed : 0
% 5.95/2.14 % Backward-rewritten : 1
% 5.95/2.14 % Generated clauses : 8767
% 5.95/2.14 % ...of the previous two non-redundant : 8703
% 5.95/2.14 % ...aggressively subsumed : 0
% 5.95/2.14 % Contextual simplify-reflections : 3
% 5.95/2.14 % Paramodulations : 8638
% 5.95/2.14 % Factorizations : 0
% 5.95/2.14 % NegExts : 8
% 5.95/2.14 % Equation resolutions : 41
% 5.95/2.14 % Disequality decompositions : 0
% 5.95/2.14 % Total rewrite steps : 65
% 5.95/2.14 % ...of those cached : 50
% 5.95/2.14 % Propositional unsat checks : 0
% 5.95/2.14 % Propositional check models : 0
% 5.95/2.14 % Propositional check unsatisfiable : 0
% 5.95/2.14 % Propositional clauses : 0
% 5.95/2.14 % Propositional clauses after purity: 0
% 5.95/2.14 % Propositional unsat core size : 0
% 5.95/2.14 % Propositional preprocessing time : 0.000
% 5.95/2.14 % Propositional encoding time : 0.000
% 5.95/2.14 % Propositional solver time : 0.000
% 5.95/2.14 % Success case prop preproc time : 0.000
% 5.95/2.14 % Success case prop encoding time : 0.000
% 5.95/2.14 % Success case prop solver time : 0.000
% 5.95/2.14 % Current number of processed clauses : 434
% 5.95/2.14 % Positive orientable unit clauses : 26
% 5.95/2.14 % Positive unorientable unit clauses: 4
% 5.95/2.14 % Negative unit clauses : 7
% 5.95/2.14 % Non-unit-clauses : 397
% 5.95/2.14 % Current number of unprocessed clauses: 8579
% 5.95/2.14 % ...number of literals in the above : 57353
% 5.95/2.14 % Current number of archived formulas : 0
% 5.95/2.14 % Current number of archived clauses : 1
% 5.95/2.14 % Clause-clause subsumption calls (NU) : 46395
% 5.95/2.14 % Rec. Clause-clause subsumption calls : 1867
% 5.95/2.14 % Non-unit clause-clause subsumptions : 27
% 5.95/2.14 % Unit Clause-clause subsumption calls : 600
% 5.95/2.14 % Rewrite failures with RHS unbound : 0
% 5.95/2.14 % BW rewrite match attempts : 3317
% 5.95/2.14 % BW rewrite match successes : 15
% 5.95/2.14 % Condensation attempts : 0
% 5.95/2.14 % Condensation successes : 0
% 5.95/2.14 % Termbank termtop insertions : 1042275
% 5.95/2.14 % Search garbage collected termcells : 85399
% 5.95/2.14
% 5.95/2.14 % -------------------------------------------------
% 5.95/2.14 % User time : 0.639 s
% 5.95/2.14 % System time : 0.052 s
% 5.95/2.14 % Total time : 0.692 s
% 5.95/2.14 % Maximum resident set size: 17632 pages
% 5.95/2.14
% 5.95/2.14 % -------------------------------------------------
% 5.95/2.14 % User time : 2.492 s
% 5.95/2.14 % System time : 0.166 s
% 5.95/2.14 % Total time : 2.658 s
% 5.95/2.14 % Maximum resident set size: 16128 pages
% 5.95/2.14 % E exiting
%------------------------------------------------------------------------------