%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP082^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:04:18 AM UTC 2026
% Result : Theorem 4.99s 1.09s
% Output : CNFRefutation 4.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 74 ( 29 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 306 ( 23 ~; 10 |; 1 &; 266 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 22 usr; 11 con; 0-7 aty)
% Number of variables : 58 ( 0 ^; 54 !; 4 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_val: $tType ).
thf(decl_sort2,type,
g: $tType ).
thf(decl_sort3,type,
list_node: $tType ).
thf(decl_sort4,type,
node: $tType ).
thf(decl_sort5,type,
list_P561207620_edgeD: $tType ).
thf(decl_sort6,type,
val: $tType ).
thf(decl_sort7,type,
produc1432036078de_val: $tType ).
thf(decl_sort8,type,
option_list_val: $tType ).
thf(decl_23,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(decl_27,type,
append_node: list_node > list_node > list_node ).
thf(decl_33,type,
cons_node: node > list_node > list_node ).
thf(decl_36,type,
nil_node: list_node ).
thf(decl_39,type,
hd_node: list_node > node ).
thf(decl_51,type,
sSA_CF551432799de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > node ).
thf(decl_60,type,
alpha_n: g > list_node ).
thf(decl_62,type,
defs: g > node > set_val ).
thf(decl_63,type,
g2: g ).
thf(decl_64,type,
i: node ).
thf(decl_65,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(decl_66,type,
invar: g > $o ).
thf(decl_72,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(decl_73,type,
pred_phi_r: node ).
thf(decl_74,type,
r: val ).
thf(decl_75,type,
ri: list_node ).
thf(decl_76,type,
rs: list_node ).
thf(decl_77,type,
rs_rest: list_node ).
thf(decl_80,type,
tmp: list_node ).
thf(decl_81,type,
esk1_0: list_node ).
thf(decl_245,type,
esk153_1: list_node > list_node ).
thf(decl_246,type,
esk154_1: list_node > node ).
thf(fact_235_neq__Nil__rev__conv,axiom,
! [X408: list_node] :
( ( X408 != nil_node )
<=> ? [X409: list_node,X410: node] :
( X408
= ( append_node @ X409 @ ( cons_node @ X410 @ nil_node ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_235_neq__Nil__rev__conv) ).
thf(fact_38_hd__append2,axiom,
! [X14: list_node,X15: list_node] :
( ( X14 != nil_node )
=> ( ( hd_node @ ( append_node @ X14 @ X15 ) )
= ( hd_node @ X14 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_38_hd__append2) ).
thf(fact_19__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062rs_H__rest_O_Ars_H_A_061_Ari_A_064_Ars_H__rest_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062,axiom,
~ ! [X8: list_node] :
( rs
!= ( append_node @ ri @ X8 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_19__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062rs_H__rest_O_Ars_H_A_061_Ari_A_064_Ars_H__rest_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062) ).
thf(fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062,axiom,
( ri
= ( append_node @ tmp @ ( cons_node @ i @ nil_node ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062) ).
thf(conj_0,conjecture,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r,
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',conj_0) ).
thf(fact_3_old_Opath2__split_I2_J,axiom,
! [X1: g,X2: node,X3: list_node,X4: node,X5: list_node,X6: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ ( append_node @ X3 @ ( cons_node @ X4 @ X5 ) ) @ X6 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X4 @ ( cons_node @ X4 @ X5 ) @ X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_3_old_Opath2__split_I2_J) ).
thf(fact_16_old_Opath2__forget__hd,axiom,
! [X1: g,X2: node,X3: list_node,X6: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ X3 @ X6 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ ( hd_node @ X3 ) @ X3 @ X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_16_old_Opath2__forget__hd) ).
thf(fact_1_rs_H__rest__def,axiom,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_1_rs_H__rest__def) ).
thf(fact_5_rs_H__props_I1_J,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
file('/export/starexec/sandbox2/tmp/tmp.fqMuqj6m8V/E---3.1_3126667.p',fact_5_rs_H__props_I1_J) ).
thf(c_0_9,plain,
! [X408: list_node] :
( ( X408 != nil_node )
<=> ? [X409: list_node,X410: node] :
( X408
= ( append_node @ X409 @ ( cons_node @ X410 @ nil_node ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_235_neq__Nil__rev__conv]) ).
thf(c_0_10,plain,
! [X2526: list_node,X2529: list_node,X2530: list_node,X2531: node] :
( ( ( X2526 = nil_node )
| ( X2526
= ( append_node @ ( esk153_1 @ X2526 ) @ ( cons_node @ ( esk154_1 @ X2526 ) @ nil_node ) ) ) )
& ( ( X2529
!= ( append_node @ X2530 @ ( cons_node @ X2531 @ nil_node ) ) )
| ( X2529 != nil_node ) ) ),
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)],[c_0_9])])])])])]) ).
thf(c_0_11,plain,
! [X14: list_node,X15: list_node] :
( ( X14 != nil_node )
=> ( ( hd_node @ ( append_node @ X14 @ X15 ) )
= ( hd_node @ X14 ) ) ),
inference(fof_simplification,[status(thm)],[fact_38_hd__append2]) ).
thf(c_0_12,plain,
~ ! [X8: list_node] :
( rs
!= ( append_node @ ri @ X8 ) ),
inference(fof_simplification,[status(thm)],[fact_19__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062rs_H__rest_O_Ars_H_A_061_Ari_A_064_Ars_H__rest_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062]) ).
thf(c_0_13,plain,
! [X2: node,X5: list_node,X3: list_node] :
( ( X3
!= ( append_node @ X5 @ ( cons_node @ X2 @ nil_node ) ) )
| ( X3 != nil_node ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X1852: list_node,X1853: list_node] :
( ( X1852 = nil_node )
| ( ( hd_node @ ( append_node @ X1852 @ X1853 ) )
= ( hd_node @ X1852 ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
thf(c_0_15,plain,
( rs
= ( append_node @ ri @ esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_16,plain,
! [X3: list_node,X2: node] :
( ( append_node @ X3 @ ( cons_node @ X2 @ nil_node ) )
!= nil_node ),
inference(er,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
( ri
= ( append_node @ tmp @ ( cons_node @ i @ nil_node ) ) ),
inference(split_conjunct,[status(thm)],[fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062]) ).
thf(c_0_18,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_19,plain,
! [X1796: g,X1797: node,X1798: list_node,X1799: node,X1800: list_node,X1801: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1796 @ X1797 @ ( append_node @ X1798 @ ( cons_node @ X1799 @ X1800 ) ) @ X1801 )
| ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1796 @ X1799 @ ( cons_node @ X1799 @ X1800 ) @ X1801 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_old_Opath2__split_I2_J])])]) ).
thf(c_0_20,plain,
! [X1830: g,X1831: node,X1832: list_node,X1833: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1830 @ X1831 @ X1832 @ X1833 )
| ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1830 @ ( hd_node @ X1832 ) @ X1832 @ X1833 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_16_old_Opath2__forget__hd])])]) ).
thf(c_0_21,plain,
! [X5: list_node,X3: list_node] :
( ( X3 = nil_node )
| ( ( hd_node @ ( append_node @ X3 @ X5 ) )
= ( hd_node @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_22,plain,
( rs
= ( append_node @ ri @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_23,plain,
ri != nil_node,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_24,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
thf(c_0_25,plain,
! [X1: g,X2: node,X3: list_node,X4: node,X5: list_node,X6: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X4 @ ( cons_node @ X4 @ X5 ) @ X6 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ ( append_node @ X3 @ ( cons_node @ X4 @ X5 ) ) @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,plain,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
inference(split_conjunct,[status(thm)],[fact_1_rs_H__rest__def]) ).
thf(c_0_27,plain,
! [X1: g,X2: node,X3: list_node,X4: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ ( hd_node @ X3 ) @ X3 @ X4 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_28,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
inference(split_conjunct,[status(thm)],[fact_5_rs_H__props_I1_J]) ).
thf(c_0_29,plain,
( ( hd_node @ rs )
= ( hd_node @ ri ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
thf(c_0_30,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
thf(c_0_31,plain,
! [X1: g,X4: node,X2: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ i @ ( cons_node @ i @ rs_rest ) @ X2 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X4 @ rs @ X2 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_32,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( hd_node @ ri ) @ rs @ pred_phi_r,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
thf(c_0_33,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP082^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n014.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 19:49:00 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.20/0.29 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.fqMuqj6m8V/E---3.1_3126667.p
% 4.99/1.09 % Version: 3.5.1-ho
% 4.99/1.09 % Preprocessing class: HSLSSMSMSSMNHSA.
% 4.99/1.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/1.09 % Starting ehoh_best2 with 1500s (5) cores
% 4.99/1.09 % Starting additional_ho_6 with 300s (1) cores
% 4.99/1.09 % Starting new_bool_5 with 300s (1) cores
% 4.99/1.09 % Starting new_bool_1 with 300s (1) cores
% 4.99/1.09 % new_bool_5 with pid 3126682 completed with status 9
% 4.99/1.09 % ehoh_best2 with pid 3126680 completed with status 0
% 4.99/1.09 % Result found by ehoh_best2
% 4.99/1.09 % Preprocessing class: HSLSSMSMSSMNHSA.
% 4.99/1.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/1.09 % Starting ehoh_best2 with 1500s (5) cores
% 4.99/1.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.99/1.09 % No SInE strategy applied
% 4.99/1.09 % Search class: HGHSM-FSLM31-MHSFFSBN
% 4.99/1.09 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.99/1.09 % Starting SubtermCWHack with 136s (1) cores
% 4.99/1.09 % Starting ehoh_best2 with 151s (1) cores
% 4.99/1.09 % Starting lpo4_lambdas_fix with 136s (1) cores
% 4.99/1.09 % Starting post_as_ho3 with 136s (1) cores
% 4.99/1.09 % Starting full_lambda_10 with 136s (1) cores
% 4.99/1.09 % full_lambda_10 with pid 3126698 completed with status 0
% 4.99/1.09 % Result found by full_lambda_10
% 4.99/1.09 % Preprocessing class: HSLSSMSMSSMNHSA.
% 4.99/1.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/1.09 % Starting ehoh_best2 with 1500s (5) cores
% 4.99/1.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.99/1.09 % No SInE strategy applied
% 4.99/1.09 % Search class: HGHSM-FSLM31-MHSFFSBN
% 4.99/1.09 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.99/1.09 % Starting SubtermCWHack with 136s (1) cores
% 4.99/1.09 % Starting ehoh_best2 with 151s (1) cores
% 4.99/1.09 % Starting lpo4_lambdas_fix with 136s (1) cores
% 4.99/1.09 % Starting post_as_ho3 with 136s (1) cores
% 4.99/1.09 % Starting full_lambda_10 with 136s (1) cores
% 4.99/1.09 % Preprocessing time : 0.017 s
% 4.99/1.09 % Presaturation interreduction done
% 4.99/1.09
% 4.99/1.09 % Proof found!
% 4.99/1.09 % SZS status Theorem
% 4.99/1.09 % SZS output start CNFRefutation
% See solution above
% 4.99/1.09 % Parsed axioms : 423
% 4.99/1.09 % Removed by relevancy pruning/SinE : 0
% 4.99/1.09 % Initial clauses : 869
% 4.99/1.09 % Removed in clause preprocessing : 111
% 4.99/1.09 % Initial clauses in saturation : 758
% 4.99/1.09 % Processed clauses : 1939
% 4.99/1.09 % ...of these trivial : 43
% 4.99/1.09 % ...subsumed : 358
% 4.99/1.09 % ...remaining for further processing : 1538
% 4.99/1.09 % Other redundant clauses eliminated : 2507
% 4.99/1.09 % Clauses deleted for lack of memory : 0
% 4.99/1.09 % Backward-subsumed : 10
% 4.99/1.09 % Backward-rewritten : 29
% 4.99/1.09 % Generated clauses : 13939
% 4.99/1.09 % ...of the previous two non-redundant : 10939
% 4.99/1.09 % ...aggressively subsumed : 0
% 4.99/1.09 % Contextual simplify-reflections : 1
% 4.99/1.09 % Paramodulations : 11445
% 4.99/1.09 % Factorizations : 4
% 4.99/1.09 % NegExts : 0
% 4.99/1.09 % Equation resolutions : 2546
% 4.99/1.09 % Disequality decompositions : 0
% 4.99/1.09 % Total rewrite steps : 1341
% 4.99/1.09 % ...of those cached : 956
% 4.99/1.09 % Propositional unsat checks : 0
% 4.99/1.09 % Propositional check models : 0
% 4.99/1.09 % Propositional check unsatisfiable : 0
% 4.99/1.09 % Propositional clauses : 0
% 4.99/1.09 % Propositional clauses after purity: 0
% 4.99/1.09 % Propositional unsat core size : 0
% 4.99/1.09 % Propositional preprocessing time : 0.000
% 4.99/1.09 % Propositional encoding time : 0.000
% 4.99/1.09 % Propositional solver time : 0.000
% 4.99/1.09 % Success case prop preproc time : 0.000
% 4.99/1.09 % Success case prop encoding time : 0.000
% 4.99/1.09 % Success case prop solver time : 0.000
% 4.99/1.09 % Current number of processed clauses : 824
% 4.99/1.09 % Positive orientable unit clauses : 151
% 4.99/1.09 % Positive unorientable unit clauses: 0
% 4.99/1.09 % Negative unit clauses : 65
% 4.99/1.09 % Non-unit-clauses : 608
% 4.99/1.09 % Current number of unprocessed clauses: 10268
% 4.99/1.09 % ...number of literals in the above : 36659
% 4.99/1.09 % Current number of archived formulas : 0
% 4.99/1.09 % Current number of archived clauses : 579
% 4.99/1.09 % Clause-clause subsumption calls (NU) : 129088
% 4.99/1.09 % Rec. Clause-clause subsumption calls : 52077
% 4.99/1.09 % Non-unit clause-clause subsumptions : 205
% 4.99/1.09 % Unit Clause-clause subsumption calls : 7404
% 4.99/1.09 % Rewrite failures with RHS unbound : 0
% 4.99/1.09 % BW rewrite match attempts : 330
% 4.99/1.09 % BW rewrite match successes : 4
% 4.99/1.09 % Condensation attempts : 1939
% 4.99/1.09 % Condensation successes : 0
% 4.99/1.09 % Termbank termtop insertions : 851570
% 4.99/1.09 % Search garbage collected termcells : 19085
% 4.99/1.09
% 4.99/1.09 % -------------------------------------------------
% 4.99/1.09 % User time : 0.715 s
% 4.99/1.09 % System time : 0.027 s
% 4.99/1.09 % Total time : 0.742 s
% 4.99/1.09 % Maximum resident set size: 7700 pages
% 4.99/1.09
% 4.99/1.09 % -------------------------------------------------
% 4.99/1.09 % User time : 3.425 s
% 4.99/1.09 % System time : 0.169 s
% 4.99/1.09 % Total time : 3.594 s
% 4.99/1.09 % Maximum resident set size: 5888 pages
% 4.99/1.09 % E exiting
%------------------------------------------------------------------------------