%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG251^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 07:44:53 AM UTC 2026
% Result : Theorem 0.38s 0.50s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 97 ( 35 equ; 0 cnn)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 362 ( 26 ~; 26 |; 11 &; 246 @)
% ( 8 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 14 con; 0-4 aty)
% Number of variables : 96 ( 6 ^; 87 !; 3 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
term: $tType ).
thf(decl_sort2,type,
subst: $tType ).
thf(decl_23,type,
one: term ).
thf(decl_26,type,
sub: term > subst > term ).
thf(decl_28,type,
sh: subst ).
thf(decl_29,type,
push: term > subst > subst ).
thf(decl_30,type,
comp: subst > subst > subst ).
thf(decl_31,type,
var: term > $o ).
thf(decl_46,type,
ulamvar1: $o ).
thf(decl_72,type,
ulamvarind: $o ).
thf(decl_83,type,
axclos: $o ).
thf(decl_86,type,
pushprop_lthm: $o ).
thf(decl_93,type,
axvarcons: $o ).
thf(decl_101,type,
pushprop_lem0: $o ).
thf(decl_117,type,
pushprop: $o ).
thf(decl_137,type,
axshiftcons: $o ).
thf(decl_142,type,
pushprop_p_and_p_prime: term > subst > ( term > $o ) > ( term > $o ) > $o ).
thf(decl_145,type,
epred1_3: ( term > $o ) > term > subst > term > $o ).
thf(decl_146,type,
esk1_1: ( term > $o ) > term ).
thf(decl_147,type,
epred2_0: term > $o ).
thf(decl_148,type,
esk2_0: term ).
thf(decl_149,type,
esk3_0: subst ).
thf(decl_150,type,
esk4_0: term ).
thf(thm,conjecture,
pushprop_lthm,
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',thm) ).
thf(pushprop_lthm,axiom,
( pushprop_lthm
<=> ( pushprop_lem0
=> ( ulamvar1
=> ( axvarcons
=> ( axclos
=> ( axshiftcons
=> ( ulamvarind
=> pushprop ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',pushprop_lthm) ).
thf(pushprop_lem0,axiom,
( pushprop_lem0
<=> ! [X6: term > $o,X1: term,X3: subst] :
? [X9: term > $o] : ( pushprop_p_and_p_prime @ X1 @ X3 @ X6 @ X9 ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',pushprop_lem0) ).
thf(ulamvar1,axiom,
( ulamvar1
<=> ( var @ one ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',ulamvar1) ).
thf(axvarcons,axiom,
( axvarcons
<=> ! [X1: term,X3: subst] :
( ( sub @ one @ ( push @ X1 @ X3 ) )
= X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',axvarcons) ).
thf(axclos,axiom,
( axclos
<=> ! [X1: term,X3: subst,X4: subst] :
( ( sub @ ( sub @ X1 @ X3 ) @ X4 )
= ( sub @ X1 @ ( comp @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',axclos) ).
thf(axshiftcons,axiom,
( axshiftcons
<=> ! [X1: term,X3: subst] :
( ( comp @ sh @ ( push @ X1 @ X3 ) )
= X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',axshiftcons) ).
thf(ulamvarind,axiom,
( ulamvarind
<=> ! [X6: term > $o] :
( ( X6 @ one )
=> ( ! [X1: term] :
( ( var @ X1 )
=> ( ( X6 @ X1 )
=> ( X6 @ ( sub @ X1 @ sh ) ) ) )
=> ! [X1: term] :
( ( var @ X1 )
=> ( X6 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',ulamvarind) ).
thf(pushprop,axiom,
( pushprop
<=> ! [X6: term > $o,X1: term,X3: subst] :
( ! [X2: term] :
( ( var @ X2 )
=> ( X6 @ ( sub @ X2 @ X3 ) ) )
=> ( ( X6 @ X1 )
=> ! [X2: term] :
( ( var @ X2 )
=> ( X6 @ ( sub @ X2 @ ( push @ X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p',pushprop) ).
thf(c_0_9,negated_conjecture,
~ pushprop_lthm,
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_10,axiom,
( pushprop_lthm
= ( ! [X47: term > $o,X48: term,X49: subst] :
? [X50: term > $o] : ( pushprop_p_and_p_prime @ X48 @ X49 @ X47 @ X50 )
=> ( ( var @ one )
=> ( ! [X51: term,X52: subst] :
( ( sub @ one @ ( push @ X51 @ X52 ) )
= X51 )
=> ( ! [X53: term,X54: subst,X55: subst] :
( ( sub @ ( sub @ X53 @ X54 ) @ X55 )
= ( sub @ X53 @ ( comp @ X54 @ X55 ) ) )
=> ( ! [X56: term,X57: subst] :
( ( comp @ sh @ ( push @ X56 @ X57 ) )
= X57 )
=> ( ! [X58: term > $o] :
( ( X58 @ one )
=> ( ! [X59: term] :
( ( var @ X59 )
=> ( ( X58 @ X59 )
=> ( X58 @ ( sub @ X59 @ sh ) ) ) )
=> ! [X60: term] :
( ( var @ X60 )
=> ( X58 @ X60 ) ) ) )
=> ! [X61: term > $o,X62: term,X63: subst] :
( ! [X64: term] :
( ( var @ X64 )
=> ( X61 @ ( sub @ X64 @ X63 ) ) )
=> ( ( X61 @ X62 )
=> ! [X65: term] :
( ( var @ X65 )
=> ( X61 @ ( sub @ X65 @ ( push @ X62 @ X63 ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pushprop_lthm,pushprop_lem0]),ulamvar1]),axvarcons]),axclos]),axshiftcons]),ulamvarind]),pushprop]) ).
thf(c_0_11,negated_conjecture,
~ ( ! [X66: term > $o,X67: term,X68: subst] :
? [X69: term > $o] : ( pushprop_p_and_p_prime @ X67 @ X68 @ X66 @ X69 )
=> ( ( var @ one )
=> ( ! [X70: term,X71: subst] :
( ( sub @ one @ ( push @ X70 @ X71 ) )
= X70 )
=> ( ! [X72: term,X73: subst,X74: subst] :
( ( sub @ ( sub @ X72 @ X73 ) @ X74 )
= ( sub @ X72 @ ( comp @ X73 @ X74 ) ) )
=> ( ! [X75: term,X76: subst] :
( ( comp @ sh @ ( push @ X75 @ X76 ) )
= X76 )
=> ( ! [X77: term > $o] :
( ( X77 @ one )
=> ( ! [X78: term] :
( ( var @ X78 )
=> ( ( X77 @ X78 )
=> ( X77 @ ( sub @ X78 @ sh ) ) ) )
=> ! [X79: term] :
( ( var @ X79 )
=> ( X77 @ X79 ) ) ) )
=> ! [X80: term > $o,X81: term,X82: subst] :
( ! [X83: term] :
( ( var @ X83 )
=> ( X80 @ ( sub @ X83 @ X82 ) ) )
=> ( ( X80 @ X81 )
=> ! [X84: term] :
( ( var @ X84 )
=> ( X80 @ ( sub @ X84 @ ( push @ X81 @ X82 ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X85: term > $o,X86: term,X87: subst,X89: term,X90: subst,X91: term,X92: subst,X93: subst,X94: term,X95: subst,X96: term > $o,X98: term,X102: term] :
( ( pushprop_p_and_p_prime @ X86 @ X87 @ X85 @ ( epred1_3 @ X85 @ X86 @ X87 ) )
& ( var @ one )
& ( ( sub @ one @ ( push @ X89 @ X90 ) )
= X89 )
& ( ( sub @ ( sub @ X91 @ X92 ) @ X93 )
= ( sub @ X91 @ ( comp @ X92 @ X93 ) ) )
& ( ( comp @ sh @ ( push @ X94 @ X95 ) )
= X95 )
& ( ( var @ ( esk1_1 @ X96 ) )
| ~ ( var @ X98 )
| ( X96 @ X98 )
| ~ ( X96 @ one ) )
& ( ( X96 @ ( esk1_1 @ X96 ) )
| ~ ( var @ X98 )
| ( X96 @ X98 )
| ~ ( X96 @ one ) )
& ( ~ ( X96 @ ( sub @ ( esk1_1 @ X96 ) @ sh ) )
| ~ ( var @ X98 )
| ( X96 @ X98 )
| ~ ( X96 @ one ) )
& ( ~ ( var @ X102 )
| ( epred2_0 @ ( sub @ X102 @ esk3_0 ) ) )
& ( epred2_0 @ esk2_0 )
& ( var @ esk4_0 )
& ~ ( epred2_0 @ ( sub @ esk4_0 @ ( push @ esk2_0 @ esk3_0 ) ) ) ),
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_11])])])])])]) ).
thf(c_0_13,negated_conjecture,
! [X1: term,X6: term > $o] :
( ( X6 @ X1 )
| ~ ( X6 @ ( sub @ ( esk1_1 @ X6 ) @ sh ) )
| ~ ( var @ X1 )
| ~ ( X6 @ one ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: term] :
( ( ( sub
@ ( esk1_1
@ ^ [Z0: term] : ( Z0 != X1 ) )
@ sh )
= X1 )
| ( one = X1 )
| ~ ( var @ X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_13]) ).
thf(c_0_15,negated_conjecture,
var @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X1: term,X3: subst,X4: subst] :
( ( sub @ ( sub @ X1 @ X3 ) @ X4 )
= ( sub @ X1 @ ( comp @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
( ( ( sub
@ ( esk1_1
@ ^ [Z0: term] : ( Z0 != esk4_0 ) )
@ sh )
= esk4_0 )
| ( one = esk4_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X1: term,X6: term > $o] :
( ( var @ ( esk1_1 @ X6 ) )
| ( X6 @ X1 )
| ~ ( var @ X1 )
| ~ ( X6 @ one ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
! [X3: subst] :
( ( ( sub
@ ( esk1_1
@ ^ [Z0: term] : ( Z0 != esk4_0 ) )
@ ( comp @ sh @ X3 ) )
= ( sub @ esk4_0 @ X3 ) )
| ( one = esk4_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X1: term,X3: subst] :
( ( comp @ sh @ ( push @ X1 @ X3 ) )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_21,negated_conjecture,
! [X1: term] :
( ( one = X1 )
| ( var
@ ( esk1_1
@ ^ [Z0: term] : ( Z0 != X1 ) ) )
| ~ ( var @ X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
! [X1: term] :
( ( epred2_0 @ ( sub @ X1 @ esk3_0 ) )
| ~ ( var @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_23,negated_conjecture,
! [X1: term,X3: subst] :
( ( ( sub
@ ( esk1_1
@ ^ [Z0: term] : ( Z0 != esk4_0 ) )
@ X3 )
= ( sub @ esk4_0 @ ( push @ X1 @ X3 ) ) )
| ( one = esk4_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
( ( one = esk4_0 )
| ( var
@ ( esk1_1
@ ^ [Z0: term] : ( Z0 != esk4_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
thf(c_0_25,negated_conjecture,
~ ( epred2_0 @ ( sub @ esk4_0 @ ( push @ esk2_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_26,negated_conjecture,
! [X1: term] :
( ( one = esk4_0 )
| ( epred2_0 @ ( sub @ esk4_0 @ ( push @ X1 @ esk3_0 ) ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_27,negated_conjecture,
! [X3: subst,X1: term] :
( ( sub @ one @ ( push @ X1 @ X3 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_28,negated_conjecture,
one = esk4_0,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X3: subst,X1: term] :
( ( sub @ esk4_0 @ ( push @ X1 @ X3 ) )
= X1 ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_30,negated_conjecture,
epred2_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ALG251^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.28 % Computer : n006.cluster.edu
% 0.12/0.28 % Model : x86_64 x86_64
% 0.12/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.28 % Memory : 8046.5625MB
% 0.12/0.28 % OS : Linux 6.8.0-71-generic
% 0.12/0.28 % CPULimit : 300
% 0.12/0.28 % WCLimit : 300
% 0.12/0.28 % DateTime : Tue Sep 29 17:32:09 UTC 2026
% 0.12/0.29 % CPUTime :
% 0.12/0.29 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.28/0.34 Running higher-order theorem proving
% 0.28/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.wpaHfFLyOu/E---3.1_1059345.p
% 0.38/0.50 % Version: 3.5.1-ho
% 0.38/0.50 % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.38/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.50 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.38/0.50 % Starting post_as_ho1 with 300s (1) cores
% 0.38/0.50 % Starting post_as_ho5 with 300s (1) cores
% 0.38/0.50 % Starting post_as_ho10 with 300s (1) cores
% 0.38/0.50 % post_as_ho5 with pid 1059360 completed with status 0
% 0.38/0.50 % Result found by post_as_ho5
% 0.38/0.50 % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.38/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.50 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.38/0.50 % Starting post_as_ho1 with 300s (1) cores
% 0.38/0.50 % Starting post_as_ho5 with 300s (1) cores
% 0.38/0.50 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.38/0.50 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.38/0.50 % Search class: HGUSM-FFSS21-SHFMMSBN
% 0.38/0.50 % partial match(2): HGUSM-FFSS32-SHFMMSBN
% 0.38/0.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.38/0.50 % SubtermCWHack with pid 1059362 completed with status 10
% 0.38/0.50 % Starting post_as_ho5 with 31s (1) cores
% 0.38/0.50 % post_as_ho5 with pid 1059363 completed with status 0
% 0.38/0.50 % Result found by post_as_ho5
% 0.38/0.50 % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.38/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.50 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.38/0.50 % Starting post_as_ho1 with 300s (1) cores
% 0.38/0.50 % Starting post_as_ho5 with 300s (1) cores
% 0.38/0.50 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.38/0.50 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.38/0.50 % Search class: HGUSM-FFSS21-SHFMMSBN
% 0.38/0.50 % partial match(2): HGUSM-FFSS32-SHFMMSBN
% 0.38/0.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.38/0.50 % SubtermCWHack with pid 1059362 completed with status 10
% 0.38/0.50 % Starting post_as_ho5 with 31s (1) cores
% 0.38/0.50 % Preprocessing time : 0.002 s
% 0.38/0.50 % Presaturation interreduction done
% 0.38/0.50
% 0.38/0.50 % Proof found!
% 0.38/0.50 % SZS status Theorem
% 0.38/0.50 % SZS output start CNFRefutation
% See solution above
% 0.38/0.50 % Parsed axioms : 238
% 0.38/0.50 % Removed by relevancy pruning/SinE : 229
% 0.38/0.50 % Initial clauses : 12
% 0.38/0.50 % Removed in clause preprocessing : 0
% 0.38/0.50 % Initial clauses in saturation : 12
% 0.38/0.50 % Processed clauses : 133
% 0.38/0.50 % ...of these trivial : 4
% 0.38/0.50 % ...subsumed : 27
% 0.38/0.50 % ...remaining for further processing : 102
% 0.38/0.50 % Other redundant clauses eliminated : 0
% 0.38/0.50 % Clauses deleted for lack of memory : 0
% 0.38/0.50 % Backward-subsumed : 12
% 0.38/0.50 % Backward-rewritten : 55
% 0.38/0.50 % Generated clauses : 405
% 0.38/0.50 % ...of the previous two non-redundant : 317
% 0.38/0.50 % ...aggressively subsumed : 0
% 0.38/0.50 % Contextual simplify-reflections : 1
% 0.38/0.50 % Paramodulations : 374
% 0.38/0.50 % Factorizations : 0
% 0.38/0.50 % NegExts : 3
% 0.38/0.50 % Equation resolutions : 11
% 0.38/0.50 % Disequality decompositions : 0
% 0.38/0.50 % Total rewrite steps : 389
% 0.38/0.50 % ...of those cached : 304
% 0.38/0.50 % Propositional unsat checks : 0
% 0.38/0.50 % Propositional check models : 0
% 0.38/0.50 % Propositional check unsatisfiable : 0
% 0.38/0.50 % Propositional clauses : 0
% 0.38/0.50 % Propositional clauses after purity: 0
% 0.38/0.50 % Propositional unsat core size : 0
% 0.38/0.50 % Propositional preprocessing time : 0.000
% 0.38/0.50 % Propositional encoding time : 0.000
% 0.38/0.50 % Propositional solver time : 0.000
% 0.38/0.50 % Success case prop preproc time : 0.000
% 0.38/0.50 % Success case prop encoding time : 0.000
% 0.38/0.50 % Success case prop solver time : 0.000
% 0.38/0.50 % Current number of processed clauses : 20
% 0.38/0.50 % Positive orientable unit clauses : 11
% 0.38/0.50 % Positive unorientable unit clauses: 0
% 0.38/0.50 % Negative unit clauses : 0
% 0.38/0.50 % Non-unit-clauses : 9
% 0.38/0.50 % Current number of unprocessed clauses: 156
% 0.38/0.50 % ...number of literals in the above : 674
% 0.38/0.50 % Current number of archived formulas : 0
% 0.38/0.50 % Current number of archived clauses : 82
% 0.38/0.50 % Clause-clause subsumption calls (NU) : 392
% 0.38/0.50 % Rec. Clause-clause subsumption calls : 200
% 0.38/0.50 % Non-unit clause-clause subsumptions : 40
% 0.38/0.50 % Unit Clause-clause subsumption calls : 6
% 0.38/0.50 % Rewrite failures with RHS unbound : 0
% 0.38/0.50 % BW rewrite match attempts : 4
% 0.38/0.50 % BW rewrite match successes : 4
% 0.38/0.50 % Condensation attempts : 0
% 0.38/0.50 % Condensation successes : 0
% 0.38/0.50 % Termbank termtop insertions : 38603
% 0.38/0.50 % Search garbage collected termcells : 2241
% 0.38/0.50
% 0.38/0.50 % -------------------------------------------------
% 0.38/0.50 % User time : 0.031 s
% 0.38/0.50 % System time : 0.012 s
% 0.38/0.50 % Total time : 0.043 s
% 0.38/0.50 % Maximum resident set size: 4492 pages
% 0.38/0.50
% 0.38/0.50 % -------------------------------------------------
% 0.38/0.50 % User time : 0.048 s
% 0.38/0.50 % System time : 0.017 s
% 0.38/0.50 % Total time : 0.065 s
% 0.38/0.50 % Maximum resident set size: 5120 pages
% 0.38/0.50 % E exiting
%------------------------------------------------------------------------------