TSTP Solution File: SET559-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET559-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:19:23 EDT 2023
% Result : Unsatisfiable 1997.57s 269.30s
% Output : CNFRefutation 1997.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 16 unt; 2 nHn; 37 RR)
% Number of literals : 67 ( 6 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_compatible_functions_alternate_defn2_3,negated_conjecture,
~ subclass(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',prove_compatible_functions_alternate_defn2_3) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',not_subclass_members1) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',cartesian_product4) ).
cnf(operation2,axiom,
( cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) = domain_of(X1)
| ~ operation(X1) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',operation2) ).
cnf(prove_compatible_functions_alternate_defn2_1,negated_conjecture,
operation(xf2),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',prove_compatible_functions_alternate_defn2_1) ).
cnf(compatible3,axiom,
( subclass(range_of(X1),domain_of(domain_of(X3)))
| ~ compatible(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',compatible3) ).
cnf(prove_compatible_functions_alternate_defn2_2,negated_conjecture,
compatible(xh,xf1,xf2),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',prove_compatible_functions_alternate_defn2_2) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',cartesian_product1) ).
cnf(cartesian_product3,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',cartesian_product3) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',not_subclass_members2) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',subclass_members) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p',cartesian_product2) ).
cnf(c_0_12,negated_conjecture,
~ subclass(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),
prove_compatible_functions_alternate_defn2_3 ).
cnf(c_0_13,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_14,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_15,negated_conjecture,
member(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),cross_product(range_of(xh),range_of(xh))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( cross_product(domain_of(domain_of(X1)),domain_of(domain_of(X1))) = domain_of(X1)
| ~ operation(X1) ),
operation2 ).
cnf(c_0_17,negated_conjecture,
operation(xf2),
prove_compatible_functions_alternate_defn2_1 ).
cnf(c_0_18,axiom,
( subclass(range_of(X1),domain_of(domain_of(X3)))
| ~ compatible(X1,X2,X3) ),
compatible3 ).
cnf(c_0_19,negated_conjecture,
compatible(xh,xf1,xf2),
prove_compatible_functions_alternate_defn2_2 ).
cnf(c_0_20,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product1 ).
cnf(c_0_21,negated_conjecture,
ordered_pair(first(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),second(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)))) = not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_23,negated_conjecture,
cross_product(domain_of(domain_of(xf2)),domain_of(domain_of(xf2))) = domain_of(xf2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_25,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_26,negated_conjecture,
subclass(range_of(xh),domain_of(domain_of(xf2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( member(first(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),X1)
| ~ member(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),cross_product(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_29,negated_conjecture,
( member(ordered_pair(X1,X2),domain_of(xf2))
| ~ member(X2,domain_of(domain_of(xf2)))
| ~ member(X1,domain_of(domain_of(xf2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ member(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),domain_of(xf2)),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( member(X1,domain_of(domain_of(xf2)))
| ~ member(X1,range_of(xh)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
member(first(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),range_of(xh)),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( member(second(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),X1)
| ~ member(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2)),cross_product(X2,X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(second(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),domain_of(domain_of(xf2)))
| ~ member(first(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),domain_of(domain_of(xf2))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
member(first(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),domain_of(domain_of(xf2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
member(second(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),range_of(xh)),
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_37,negated_conjecture,
~ member(second(not_subclass_element(cross_product(range_of(xh),range_of(xh)),domain_of(xf2))),domain_of(domain_of(xf2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET559-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:33:04 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.t0sHBM8U4j/E---3.1_24338.p
% 1997.57/269.30 # Version: 3.1pre001
% 1997.57/269.30 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1997.57/269.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1997.57/269.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1997.57/269.30 # Starting new_bool_3 with 300s (1) cores
% 1997.57/269.30 # Starting new_bool_1 with 300s (1) cores
% 1997.57/269.30 # Starting sh5l with 300s (1) cores
% 1997.57/269.30 # sh5l with pid 24440 completed with status 0
% 1997.57/269.30 # Result found by sh5l
% 1997.57/269.30 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1997.57/269.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1997.57/269.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1997.57/269.30 # Starting new_bool_3 with 300s (1) cores
% 1997.57/269.30 # Starting new_bool_1 with 300s (1) cores
% 1997.57/269.30 # Starting sh5l with 300s (1) cores
% 1997.57/269.30 # SinE strategy is gf500_gu_R04_F100_L20000
% 1997.57/269.30 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1997.57/269.30 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1997.57/269.30 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1997.57/269.30 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 24443 completed with status 7
% 1997.57/269.30 # Starting sh5l with 31s (1) cores
% 1997.57/269.30 # sh5l with pid 24450 completed with status 7
% 1997.57/269.30 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1997.57/269.30 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 24534 completed with status 7
% 1997.57/269.30 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1997.57/269.30 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 24537 completed with status 7
% 1997.57/269.30 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1997.57/269.30 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 24539 completed with status 7
% 1997.57/269.30 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1997.57/269.30 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 24542 completed with status 7
% 1997.57/269.30 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1997.57/269.30 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 24545 completed with status 7
% 1997.57/269.30 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1997.57/269.30 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 24548 completed with status 7
% 1997.57/269.30 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1997.57/269.30 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 24788 completed with status 7
% 1997.57/269.30 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1997.57/269.30 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 25256 completed with status 7
% 1997.57/269.30 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1997.57/269.30 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 25258 completed with status 7
% 1997.57/269.30 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1997.57/269.30 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with pid 25263 completed with status 0
% 1997.57/269.30 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I
% 1997.57/269.30 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1997.57/269.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1997.57/269.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1997.57/269.30 # Starting new_bool_3 with 300s (1) cores
% 1997.57/269.30 # Starting new_bool_1 with 300s (1) cores
% 1997.57/269.30 # Starting sh5l with 300s (1) cores
% 1997.57/269.30 # SinE strategy is gf500_gu_R04_F100_L20000
% 1997.57/269.30 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1997.57/269.30 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1997.57/269.30 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1997.57/269.30 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 24443 completed with status 7
% 1997.57/269.30 # Starting sh5l with 31s (1) cores
% 1997.57/269.30 # sh5l with pid 24450 completed with status 7
% 1997.57/269.30 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1997.57/269.30 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 24534 completed with status 7
% 1997.57/269.30 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1997.57/269.30 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 24537 completed with status 7
% 1997.57/269.30 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1997.57/269.30 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 24539 completed with status 7
% 1997.57/269.30 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1997.57/269.30 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 24542 completed with status 7
% 1997.57/269.30 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1997.57/269.30 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 24545 completed with status 7
% 1997.57/269.30 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1997.57/269.30 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 24548 completed with status 7
% 1997.57/269.30 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1997.57/269.30 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 24788 completed with status 7
% 1997.57/269.30 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1997.57/269.30 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 25256 completed with status 7
% 1997.57/269.30 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1997.57/269.30 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 25258 completed with status 7
% 1997.57/269.30 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1997.57/269.30 # Preprocessing time : 0.004 s
% 1997.57/269.30 # Presaturation interreduction done
% 1997.57/269.30
% 1997.57/269.30 # Proof found!
% 1997.57/269.30 # SZS status Unsatisfiable
% 1997.57/269.30 # SZS output start CNFRefutation
% See solution above
% 1997.57/269.30 # Parsed axioms : 115
% 1997.57/269.30 # Removed by relevancy pruning/SinE : 14
% 1997.57/269.30 # Initial clauses : 101
% 1997.57/269.30 # Removed in clause preprocessing : 0
% 1997.57/269.30 # Initial clauses in saturation : 101
% 1997.57/269.30 # Processed clauses : 3400
% 1997.57/269.30 # ...of these trivial : 38
% 1997.57/269.30 # ...subsumed : 1593
% 1997.57/269.30 # ...remaining for further processing : 1769
% 1997.57/269.30 # Other redundant clauses eliminated : 7
% 1997.57/269.30 # Clauses deleted for lack of memory : 0
% 1997.57/269.30 # Backward-subsumed : 28
% 1997.57/269.30 # Backward-rewritten : 120
% 1997.57/269.30 # Generated clauses : 16919
% 1997.57/269.30 # ...of the previous two non-redundant : 15688
% 1997.57/269.30 # ...aggressively subsumed : 0
% 1997.57/269.30 # Contextual simplify-reflections : 46
% 1997.57/269.30 # Paramodulations : 16908
% 1997.57/269.30 # Factorizations : 4
% 1997.57/269.30 # NegExts : 0
% 1997.57/269.30 # Equation resolutions : 7
% 1997.57/269.30 # Total rewrite steps : 5747
% 1997.57/269.30 # Propositional unsat checks : 0
% 1997.57/269.30 # Propositional check models : 0
% 1997.57/269.30 # Propositional check unsatisfiable : 0
% 1997.57/269.30 # Propositional clauses : 0
% 1997.57/269.30 # Propositional clauses after purity: 0
% 1997.57/269.30 # Propositional unsat core size : 0
% 1997.57/269.30 # Propositional preprocessing time : 0.000
% 1997.57/269.30 # Propositional encoding time : 0.000
% 1997.57/269.30 # Propositional solver time : 0.000
% 1997.57/269.30 # Success case prop preproc time : 0.000
% 1997.57/269.30 # Success case prop encoding time : 0.000
% 1997.57/269.30 # Success case prop solver time : 0.000
% 1997.57/269.30 # Current number of processed clauses : 1518
% 1997.57/269.30 # Positive orientable unit clauses : 414
% 1997.57/269.30 # Positive unorientable unit clauses: 4
% 1997.57/269.30 # Negative unit clauses : 25
% 1997.57/269.30 # Non-unit-clauses : 1075
% 1997.57/269.30 # Current number of unprocessed clauses: 12328
% 1997.57/269.30 # ...number of literals in the above : 31318
% 1997.57/269.30 # Current number of archived formulas : 0
% 1997.57/269.30 # Current number of archived clauses : 248
% 1997.57/269.30 # Clause-clause subsumption calls (NU) : 120180
% 1997.57/269.30 # Rec. Clause-clause subsumption calls : 96063
% 1997.57/269.30 # Non-unit clause-clause subsumptions : 1034
% 1997.57/269.30 # Unit Clause-clause subsumption calls : 6391
% 1997.57/269.30 # Rewrite failures with RHS unbound : 27
% 1997.57/269.30 # BW rewrite match attempts : 4239
% 1997.57/269.30 # BW rewrite match successes : 60
% 1997.57/269.30 # Condensation attempts : 0
% 1997.57/269.30 # Condensation successes : 0
% 1997.57/269.30 # Termbank termtop insertions : 310444
% 1997.57/269.30
% 1997.57/269.30 # -------------------------------------------------
% 1997.57/269.30 # User time : 254.889 s
% 1997.57/269.30 # System time : 7.377 s
% 1997.57/269.30 # Total time : 262.265 s
% 1997.57/269.30 # Maximum resident set size: 1996 pages
% 1997.57/269.30
% 1997.57/269.30 # -------------------------------------------------
% 1997.57/269.30 # User time : 254.891 s
% 1997.57/269.30 # System time : 7.387 s
% 1997.57/269.30 # Total time : 262.278 s
% 1997.57/269.30 # Maximum resident set size: 1776 pages
% 1997.57/269.30 % E---3.1 exiting
% 1997.57/269.30 % E---3.1 exiting
%------------------------------------------------------------------------------