TSTP Solution File: SET031-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET031-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 04:26:07 EDT 2022
% Result : Timeout 300.11s 300.37s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET031-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 13:37:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.77/1.03 ============================== Prover9 ===============================
% 0.77/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03 Process 29747 was started by sandbox2 on n007.cluster.edu,
% 0.77/1.03 Sun Jul 10 13:37:47 2022
% 0.77/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29594_n007.cluster.edu".
% 0.77/1.03 ============================== end of head ===========================
% 0.77/1.03
% 0.77/1.03 ============================== INPUT =================================
% 0.77/1.03
% 0.77/1.03 % Reading from file /tmp/Prover9_29594_n007.cluster.edu
% 0.77/1.03
% 0.77/1.03 set(prolog_style_variables).
% 0.77/1.03 set(auto2).
% 0.77/1.03 % set(auto2) -> set(auto).
% 0.77/1.03 % set(auto) -> set(auto_inference).
% 0.77/1.03 % set(auto) -> set(auto_setup).
% 0.77/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03 % set(auto) -> set(auto_limits).
% 0.77/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03 % set(auto) -> set(auto_denials).
% 0.77/1.03 % set(auto) -> set(auto_process).
% 0.77/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03 % set(auto2) -> assign(stats, some).
% 0.77/1.03 % set(auto2) -> clear(echo_input).
% 0.77/1.03 % set(auto2) -> set(quiet).
% 0.77/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03 % set(auto2) -> clear(print_given).
% 0.77/1.03 assign(lrs_ticks,-1).
% 0.77/1.03 assign(sos_limit,10000).
% 0.77/1.03 assign(order,kbo).
% 0.77/1.03 set(lex_order_vars).
% 0.77/1.03 clear(print_given).
% 0.77/1.03
% 0.77/1.03 % formulas(sos). % not echoed (157 formulas)
% 0.77/1.03
% 0.77/1.03 ============================== end of input ==========================
% 0.77/1.03
% 0.77/1.03 % From the command line: assign(max_seconds, 300).
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03
% 0.77/1.03 % Formulas that are not ordinary clauses:
% 0.77/1.03
% 0.77/1.03 ============================== end of process non-clausal formulas ===
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.03
% 0.77/1.03 ============================== PREDICATE ELIMINATION =================
% 0.77/1.03 1 proper_subset(A,B) | -subset(A,B) | A = B # label(proper_subset3) # label(axiom). [assumption].
% 0.77/1.03 2 -proper_subset(A,B) | subset(A,B) # label(proper_subset1) # label(axiom). [assumption].
% 0.77/1.03 3 -proper_subset(A,B) | A != B # label(proper_subset2) # label(axiom). [assumption].
% 0.77/1.03 4 single_valued_set(A) | little_set(f19(A)) # label(single_valued_set2) # label(axiom). [assumption].
% 0.77/1.03 5 -single_valued_set(A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D # label(single_valued_set1) # label(axiom). [assumption].
% 0.77/1.03 Derived: little_set(f19(A)) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(4,a,5,a)].
% 0.77/1.03 6 single_valued_set(A) | little_set(f20(A)) # label(single_valued_set3) # label(axiom). [assumption].
% 0.77/1.03 Derived: little_set(f20(A)) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(6,a,5,a)].
% 0.77/1.03 7 single_valued_set(A) | little_set(f21(A)) # label(single_valued_set4) # label(axiom). [assumption].
% 0.77/1.03 Derived: little_set(f21(A)) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(7,a,5,a)].
% 0.77/1.03 8 single_valued_set(A) | member(ordered_pair(f19(A),f20(A)),A) # label(single_valued_set5) # label(axiom). [assumption].
% 0.77/1.03 Derived: member(ordered_pair(f19(A),f20(A)),A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(8,a,5,a)].
% 0.77/1.03 9 single_valued_set(A) | member(ordered_pair(f19(A),f21(A)),A) # label(single_valued_set6) # label(axiom). [assumption].
% 0.77/1.03 Derived: member(ordered_pair(f19(A),f21(A)),A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(9,a,5,a)].
% 0.77/1.04 10 single_valued_set(A) | f20(A) != f21(A) # label(single_valued_set7) # label(axiom). [assumption].
% 0.77/1.04 Derived: f20(A) != f21(A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(10,a,5,a)].
% 0.77/1.04 11 -function(A) | single_valued_set(A) # label(function2) # label(axiom). [assumption].
% 0.77/1.04 Derived: -function(A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(11,b,5,a)].
% 0.77/1.04 12 function(A) | -relation(A) | -single_valued_set(A) # label(function3) # label(axiom). [assumption].
% 0.77/1.04 Derived: function(A) | -relation(A) | little_set(f19(A)). [resolve(12,c,4,a)].
% 0.77/1.04 Derived: function(A) | -relation(A) | little_set(f20(A)). [resolve(12,c,6,a)].
% 0.77/1.04 Derived: function(A) | -relation(A) | little_set(f21(A)). [resolve(12,c,7,a)].
% 0.77/1.04 Derived: function(A) | -relation(A) | member(ordered_pair(f19(A),f20(A)),A). [resolve(12,c,8,a)].
% 0.77/1.04 Derived: function(A) | -relation(A) | member(ordered_pair(f19(A),f21(A)),A). [resolve(12,c,9,a)].
% 0.77/1.04 Derived: function(A) | -relation(A) | f20(A) != f21(A). [resolve(12,c,10,a)].
% 0.77/1.04 13 disjoint(A,B) | member(f23(A,B),A) # label(disjoint2) # label(axiom). [assumption].
% 0.77/1.04 14 -disjoint(A,B) | -member(C,A) | -member(C,B) # label(disjoint1) # label(axiom). [assumption].
% 0.77/1.04 Derived: member(f23(A,B),A) | -member(C,A) | -member(C,B). [resolve(13,a,14,a)].
% 0.77/1.04 15 disjoint(A,B) | member(f23(A,B),B) # label(disjoint3) # label(axiom). [assumption].
% 0.77/1.04 Derived: member(f23(A,B),B) | -member(C,A) | -member(C,B). [resolve(15,a,14,a)].
% 0.77/1.04 16 A = empty_set | disjoint(f24(A),A) # label(regularity2) # label(axiom). [assumption].
% 0.77/1.04 Derived: A = empty_set | -member(B,f24(A)) | -member(B,A). [resolve(16,b,14,a)].
% 0.77/1.04 17 one_to_one_function(A) | -function(A) | -function(converse(A)) # label(one_to_one_function3) # label(axiom). [assumption].
% 0.77/1.04 18 -one_to_one_function(A) | function(A) # label(one_to_one_function1) # label(axiom). [assumption].
% 0.77/1.04 19 -one_to_one_function(A) | function(converse(A)) # label(one_to_one_function2) # label(axiom). [assumption].
% 0.77/1.04 20 function(f25) # label(choice1) # label(axiom). [assumption].
% 0.77/1.04 21 -function(A) | relation(A) # label(function1) # label(axiom). [assumption].
% 0.77/1.04 22 -little_set(A) | -function(B) | little_set(image(A,B)) # label(image_and_substitution6) # label(axiom). [assumption].
% 0.77/1.04 Derived: relation(f25). [resolve(20,a,21,a)].
% 0.77/1.04 Derived: -little_set(A) | little_set(image(A,f25)). [resolve(20,a,22,b)].
% 0.77/1.04 23 -maps(A,B,C) | function(A) # label(maps1) # label(axiom). [assumption].
% 0.77/1.04 Derived: -maps(A,B,C) | relation(A). [resolve(23,b,21,a)].
% 0.77/1.04 Derived: -maps(A,B,C) | -little_set(D) | little_set(image(D,A)). [resolve(23,b,22,b)].
% 0.77/1.04 24 maps(A,B,C) | -function(A) | domain_of(A) != B | -subset(range_of(A),C) # label(maps4) # label(axiom). [assumption].
% 0.77/1.04 Derived: maps(f25,A,B) | domain_of(f25) != A | -subset(range_of(f25),B). [resolve(24,b,20,a)].
% 0.77/1.04 Derived: maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C) | -maps(A,D,E). [resolve(24,b,23,b)].
% 0.77/1.04 25 -function(A) | little_set(apply(A,B)) # label(function_values_are_small) # label(axiom). [assumption].
% 0.77/1.04 Derived: little_set(apply(f25,A)). [resolve(25,a,20,a)].
% 0.77/1.04 Derived: little_set(apply(A,B)) | -maps(A,C,D). [resolve(25,a,23,b)].
% 0.77/1.04 26 -function(A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(11,b,5,a)].
% 0.77/1.04 Derived: -little_set(A) | -little_set(B) | -little_set(C) | -member(ordered_pair(A,B),f25) | -member(ordered_pair(A,C),f25) | B = C. [resolve(26,a,20,a)].
% 0.77/1.04 Derived: -little_set(A) | -little_set(B) | -little_set(C) | -member(ordered_pair(A,B),D) | -member(ordered_pair(A,C),D) | B = C | -maps(D,E,F). [resolve(26,a,23,b)].
% 0.77/1.04 27 function(A) | -relation(A) | little_set(f19(A)). [resolve(12,c,4,a)].
% 0.77/1.04 Derived: -relation(A) | little_set(f19(A)) | -little_set(B) | little_set(image(B,A)). [resolve(27,a,22,b)].
% 0.77/1.04 Derived: -relation(A) | little_set(f19(A)) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(27,a,24,b)].
% 0.77/1.04 Derived: -relation(A) | little_set(f19(A)) | little_set(apply(A,B)). [resolve(27,a,25,a)].
% 0.77/1.04 Derived: -relation(A) | little_set(f19(A)) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(27,a,26,a)].
% 0.77/1.04 28 function(A) | -relation(A) | little_set(f20(A)). [resolve(12,c,6,a)].
% 0.77/1.04 Derived: -relation(A) | little_set(f20(A)) | -little_set(B) | little_set(image(B,A)). [resolve(28,a,22,b)].
% 0.77/1.04 Derived: -relation(A) | little_set(f20(A)) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(28,a,24,b)].
% 0.77/1.04 Derived: -relation(A) | little_set(f20(A)) | little_set(apply(A,B)). [resolve(28,a,25,a)].
% 0.77/1.04 Derived: -relation(A) | little_set(f20(A)) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(28,a,26,a)].
% 0.77/1.04 29 function(A) | -relation(A) | little_set(f21(A)). [resolve(12,c,7,a)].
% 0.77/1.04 Derived: -relation(A) | little_set(f21(A)) | -little_set(B) | little_set(image(B,A)). [resolve(29,a,22,b)].
% 0.77/1.04 Derived: -relation(A) | little_set(f21(A)) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(29,a,24,b)].
% 0.77/1.04 Derived: -relation(A) | little_set(f21(A)) | little_set(apply(A,B)). [resolve(29,a,25,a)].
% 0.77/1.04 Derived: -relation(A) | little_set(f21(A)) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(29,a,26,a)].
% 0.77/1.04 30 function(A) | -relation(A) | member(ordered_pair(f19(A),f20(A)),A). [resolve(12,c,8,a)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f20(A)),A) | -little_set(B) | little_set(image(B,A)). [resolve(30,a,22,b)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f20(A)),A) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(30,a,24,b)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f20(A)),A) | little_set(apply(A,B)). [resolve(30,a,25,a)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f20(A)),A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(30,a,26,a)].
% 0.77/1.04 31 function(A) | -relation(A) | member(ordered_pair(f19(A),f21(A)),A). [resolve(12,c,9,a)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f21(A)),A) | -little_set(B) | little_set(image(B,A)). [resolve(31,a,22,b)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f21(A)),A) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(31,a,24,b)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f21(A)),A) | little_set(apply(A,B)). [resolve(31,a,25,a)].
% 0.77/1.04 Derived: -relation(A) | member(ordered_pair(f19(A),f21(A)),A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(31,a,26,a)].
% 0.77/1.04 32 function(A) | -relation(A) | f20(A) != f21(A). [resolve(12,c,10,a)].
% 0.77/1.04 Derived: -relation(A) | f20(A) != f21(A) | -little_set(B) | little_set(image(B,A)). [resolve(32,a,22,b)].
% 0.77/1.04 Derived: -relation(A) | f20(A) != f21(A) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(32,a,24,b)].
% 0.77/1.04 Derived: -relation(A) | f20(A) != f21(A) | little_set(apply(A,B)). [resolve(32,a,25,a)].
% 0.77/1.04 Derived: -relation(A) | f20(A) != f21(A) | -little_set(B) | -little_set(C) | -little_set(D) | -member(ordered_pair(B,C),A) | -member(ordered_pair(B,D),A) | C = D. [resolve(32,a,26,a)].
% 0.77/1.04 33 homomorphism(A,B,C,D,E) | -closed(B,C) | -closed(D,E) | -maps(A,B,D) | member(f32(A,B,C,D,E),B) # label(homomorphism5) # label(axiom). [assumption].
% 0.77/1.04 34 -homomorphism(A,B,C,D,E) | closed(B,C) # label(homomorphism1) # label(axiom). [assumption].
% 0.77/1.04 35 -homomorphism(A,B,C,D,E) | closed(D,E) # label(homomorphism2) # label(axiom). [assumption].
% 0.77/1.04 36 -homomorphism(A,B,C,D,E) | maps(A,B,D) # label(homomorphism3) # label(axiom). [assumption].
% 0.77/1.04 37 -homomorphism(A,B,C,D,E) | -member(F,B) | -member(V6,B) | apply(A,apply_to_two_arguments(C,F,V6)) = apply_to_two_arguments(E,apply(A,F),apply(A,V6)) # label(homomorphism4) # label(axiom). [assumption].
% 6.20/6.45 Derived: -closed(A,B) | -closed(C,D) | -maps(E,A,C) | member(f32(E,A,B,C,D),A) | -member(F,A) | -member(V6,A) | apply(E,apply_to_two_arguments(B,F,V6)) = apply_to_two_arguments(D,apply(E,F),apply(E,V6)). [resolve(33,a,37,a)].
% 6.20/6.45 38 homomorphism(A,B,C,D,E) | -closed(B,C) | -closed(D,E) | -maps(A,B,D) | member(f33(A,B,C,D,E),B) # label(homomorphism6) # label(axiom). [assumption].
% 6.20/6.45 Derived: -closed(A,B) | -closed(C,D) | -maps(E,A,C) | member(f33(E,A,B,C,D),A) | -member(F,A) | -member(V6,A) | apply(E,apply_to_two_arguments(B,F,V6)) = apply_to_two_arguments(D,apply(E,F),apply(E,V6)). [resolve(38,a,37,a)].
% 6.20/6.45 39 homomorphism(A,B,C,D,E) | -closed(B,C) | -closed(D,E) | -maps(A,B,D) | apply(A,apply_to_two_arguments(C,f32(A,B,C,D,E),f33(A,B,C,D,E))) != apply_to_two_arguments(E,apply(A,f32(A,B,C,D,E)),apply(A,f33(A,B,C,D,E))) # label(homomorphism7) # label(axiom). [assumption].
% 6.20/6.45 Derived: -closed(A,B) | -closed(C,D) | -maps(E,A,C) | apply(E,apply_to_two_arguments(B,f32(E,A,B,C,D),f33(E,A,B,C,D))) != apply_to_two_arguments(D,apply(E,f32(E,A,B,C,D)),apply(E,f33(E,A,B,C,D))) | -member(F,A) | -member(V6,A) | apply(E,apply_to_two_arguments(B,F,V6)) = apply_to_two_arguments(D,apply(E,F),apply(E,V6)). [resolve(39,a,37,a)].
% 6.20/6.45
% 6.20/6.45 ============================== end predicate elimination =============
% 6.20/6.45
% 6.20/6.45 Auto_denials: (non-Horn, no changes).
% 6.20/6.45
% 6.20/6.45 Term ordering decisions:
% 6.20/6.45 Function symbol KB weights: f25=1. empty_set=1. infinity=1. estin=1. identity_relation=1. universal_set=1. a=1. b=1. ordered_pair=1. apply=1. image=1. non_ordered_pair=1. compose=1. cross_product=1. f1=1. intersection=1. f10=1. f11=1. f12=1. f13=1. f14=1. f27=1. f4=1. f7=1. f8=1. f9=1. f16=1. f17=1. f23=1. f5=1. f6=1. union=1. restrict=1. first=1. second=1. f19=1. f20=1. f21=1. domain_of=1. range_of=1. flip_range_of=1. rotate_right=1. singleton_set=1. sigma=1. complement=1. converse=1. powerset=1. f18=1. f2=1. f24=1. f26=1. f3=1. successor=1. apply_to_two_arguments=1. f22=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1.
% 6.20/6.45
% 6.20/6.45 ============================== end of process initial clauses ========
% 6.20/6.45
% 6.20/6.45 ============================== CLAUSES FOR SEARCH ====================
% 6.20/6.45
% 6.20/6.45 ============================== end of clauses for search =============
% 6.20/6.45
% 6.20/6.45 ============================== SEARCH ================================
% 6.20/6.45
% 6.20/6.45 % Starting search at 0.07 seconds.
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=61.000, iters=3333
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=51.000, iters=3367
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=49.000, iters=3347
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=46.000, iters=3358
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=44.000, iters=3398
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=42.000, iters=3336
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=40.000, iters=3348
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=38.000, iters=3516
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=36.000, iters=3357
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=34.000, iters=3360
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=33.000, iters=3348
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=32.000, iters=3363
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=31.000, iters=3333
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=30.000, iters=3351
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=29.000, iters=3386
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=28.000, iters=3357
% 6.20/6.45
% 6.20/6.45 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 52 (0.00 of 1.24 sec).
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=27.000, iters=3341
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=26.000, iters=3370
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=25.000, iters=3336
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=24.000, iters=3333
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=23.000, iters=3384
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=3742, wt=99.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=3741, wt=95.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10896, wt=20.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10899, wt=19.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10910, wt=17.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10912, wt=16.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10933, wt=15.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10987, wt=8.000
% 6.20/6.45
% 6.20/6.45 Low Water (displace): id=10993, wt=7.000
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=22.000, iters=3340
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=21.000, iters=3385
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=20.000, iters=3333
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=19.000, iters=3344
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=18.000, iters=3346
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=17.000, iters=3338
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=16.000, iters=3333
% 6.20/6.45
% 6.20/6.45 Low Water (keep): wt=15.000, iters=3352
% 6.20/6.45
% 6.20/6.45 Low Water (keep): Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------