TSTP Solution File: SEU178+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SEU178+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n006.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 13:29:40 EDT 2022

% Result   : Timeout 300.02s 300.27s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU178+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n006.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 : Mon Jun 20 05:08:25 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 18357 was started by sandbox on n006.cluster.edu,
% 0.77/1.03  Mon Jun 20 05:08:26 2022
% 0.77/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18204_n006.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_18204_n006.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 (39 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  1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  3 (all A (relation(A) <-> (all B -(in(B,A) & (all C all D B != ordered_pair(C,D)))))) # label(d1_relat_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  4 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  5 (all A (relation(A) -> (all B (B = relation_dom(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(C,D),A)))))))) # label(d4_relat_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  6 (all A (relation(A) -> (all B (B = relation_rng(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(D,C),A)))))))) # label(d5_relat_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  7 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  8 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  9 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  10 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  11 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  12 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  13 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  14 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  15 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  16 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  17 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  18 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  19 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  20 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  21 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  22 (all A all B (-empty(A) & -empty(B) -> -empty(cartesian_product2(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  23 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  24 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  25 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  26 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  28 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  29 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(t106_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  30 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  31 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  32 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  33 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  34 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  35 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  36 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  37 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  38 -(all A (relation(A) -> subset(A,cartesian_product2(relation_dom(A),relation_rng(A))))) # label(t21_relat_1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.77/1.04  
% 0.77/1.04  ============================== end of process non-clausal formulas ===
% 0.77/1.04  
% 0.77/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.04  
% 0.77/1.04  ============================== PREDICATE ELIMINATION =================
% 0.77/1.04  39 -relation(A) | -in(B,A) | ordered_pair(f1(A,B),f2(A,B)) = B # label(d1_relat_1) # label(axiom).  [clausify(3)].
% 0.77/1.04  40 relation(c1) # label(rc1_relat_1) # label(axiom).  [clausify(23)].
% 0.77/1.04  41 relation(c4) # label(t21_relat_1) # label(negated_conjecture).  [clausify(38)].
% 0.77/1.04  42 relation(A) | in(f3(A),A) # label(d1_relat_1) # label(axiom).  [clausify(3)].
% 0.77/1.04  43 relation(A) | ordered_pair(B,C) != f3(A) # label(d1_relat_1) # label(axiom).  [clausify(3)].
% 0.77/1.04  Derived: -in(A,c1) | ordered_pair(f1(c1,A),f2(c1,A)) = A.  [resolve(39,a,40,a)].
% 0.77/1.04  Derived: -in(A,c4) | ordered_pair(f1(c4,A),f2(c4,A)) = A.  [resolve(39,a,41,a)].
% 0.77/1.04  Derived: -in(A,B) | ordered_pair(f1(B,A),f2(B,A)) = A | in(f3(B),B).  [resolve(39,a,42,a)].
% 0.77/1.04  Derived: -in(A,B) | ordered_pair(f1(B,A),f2(B,A)) = A | ordered_pair(C,D) != f3(B).  [resolve(39,a,43,a)].
% 0.77/1.04  44 -relation(A) | relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) # label(d4_relat_1) # label(axiom).  [clausify(5)].
% 0.77/1.04  Derived: relation_dom(c1) != A | in(B,A) | -in(ordered_pair(B,C),c1).  [resolve(44,a,40,a)].
% 0.77/1.04  Derived: relation_dom(c4) != A | in(B,A) | -in(ordered_pair(B,C),c4).  [resolve(44,a,41,a)].
% 0.77/1.04  Derived: relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) | in(f3(A),A).  [resolve(44,a,42,a)].
% 0.77/1.04  Derived: relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) | ordered_pair(E,F) != f3(A).  [resolve(44,a,43,a)].
% 0.77/1.04  45 -relation(A) | relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) # label(d5_relat_1) # label(axiom).  [clausify(6)].
% 0.77/1.04  Derived: relation_rng(c1) != A | in(B,A) | -in(ordered_pair(C,B),c1).  [resolve(45,a,40,a)].
% 0.77/1.04  Derived: relation_rng(c4) != A | in(B,A) | -in(ordered_pair(C,B),c4).  [resolve(45,a,41,a)].
% 0.77/1.04  Derived: relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) | in(f3(A),A).  [resolve(45,a,42,a)].
% 0.77/1.04  Derived: relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) | ordered_pair(E,F) != f3(A).  [resolve(45,a,43,a)].
% 0.77/1.04  46 -relation(A) | relation_dom(A) != B | -in(C,B) | in(ordered_pair(C,f5(A,B,C)),A) # label(d4_relat_1) # label(axiom).  [clausify(5)].
% 0.77/1.04  Derived: relation_dom(c1) != A | -in(B,A) | in(ordered_pair(B,f5(c1,A,B)),c1).  [resolve(46,a,40,a)].
% 0.77/1.04  Derived: relation_dom(c4) != A | -in(B,A) | in(ordered_pair(B,f5(c4,A,B)),c4).  [resolve(46,a,41,a)].
% 0.77/1.04  Derived: relation_dom(A) != B | -in(C,B) | in(ordered_pair(C,f5(A,B,C)),A) | in(f3(A),A).  [resolve(46,a,42,a)].
% 0.77/1.04  Derived: relation_dom(A) != B | -in(C,B) | in(ordered_pair(C,f5(A,B,C)),A) | ordered_pair(D,E) != f3(A).  [resolve(46,a,43,a)].
% 0.77/1.04  47 -relation(A) | relation_rng(A) != B | -in(C,B) | in(ordered_pair(f8(A,B,C),C),A) # label(d5_relat_1) # label(axiom).  [clausify(6)].
% 0.77/1.04  Derived: relation_rng(c1) != A | -in(B,A) | in(ordered_pair(f8(c1,A,B),B),c1).  [resolve(47,a,40,a)].
% 0.77/1.04  Derived: relation_rng(c4) != A | -in(B,A) | in(ordered_pair(f8(c4,A,B),B),c4).  [resolve(47,a,41,a)].
% 0.77/1.04  Derived: relation_rng(A) != B | -in(C,B) | in(ordered_pair(f8(A,B,C),C),A) | in(f3(A),A).  [resolve(47,a,42,a)].
% 0.77/1.04  Derived: relation_rng(A) != B | -in(C,B) | in(ordered_pair(f8(A,B,C),C),A) | ordered_pair(D,E) != f3(A).  [resolve(47,a,43,a)].
% 0.77/1.04  48 -relation(A) | relation_dom(A) = B | -in(f6(A,B),B) | -in(ordered_pair(f6(A,B),C),A) # label(d4_relat_1) # label(axiom).  [clausify(5)].
% 0.77/1.04  Derived: relation_dom(c1) = A | -in(f6(c1,A),A) | -in(ordered_pair(f6(c1,A),B),c1).  [resolve(48,a,40,a)].
% 0.77/1.04  Derived: relation_dom(c4) = A | -in(f6(c4,A),A) | -in(ordered_pair(f6(c4,A),B),c4).  [resolve(48,a,41,a)].
% 0.77/1.04  Derived: relation_dom(A) = B | -in(f6(A,B),B) | -in(ordered_pair(f6(A,B),C),A) | in(f3(A),A).  [resolve(48,a,42,a)].
% 0.77/1.04  Derived: relation_dom(A) = B | -in(f6(A,B),B) | -in(ordered_pair(f6(A,B),C),A) | ordered_pair(D,E) != f3(A).  [resolve(48,a,43,a)].
% 0.77/1.04  49 -relation(A) | relation_rng(A) = B | -in(f9(A,B),B) | -in(ordered_pair(C,f9(A,B)),A) # label(d5_relat_1) # label(axiom).  [clausify(6)].
% 0.77/1.04  Derived: relation_rng(c1) = A | -in(f9(c1,A),A) | -in(ordered_pair(B,f9(c1,A)),c1).  [resolve(49,a,40,a)].
% 0.77/1.04  Derived: relation_rng(c4) = A | -in(f9(c4,A),A) | -in(ordered_pair(B,f9(c4,A)),c4).  [resolve(49,a,41,a)].
% 0.77/1.04  Derived: relation_rng(A) = B | -in(f9(A,B),B) | -in(ordered_pair(C,f9(A,B)),A) | in(f3(A),A).  [resolve(49,a,42,a)].
% 0.77/1.04  Derived: relation_rng(A) = B | -in(f9(A,B),B) | -in(ordered_pair(C,f9(A,B)),A) | ordered_pair(D,E) != f3(A).  [resolve(49,a,43,a)].
% 0.77/1.04  50 -relation(A) | relation_dom(A) = B | in(f6(A,B),B) | in(ordered_pair(f6(A,B),f7(A,B)),A) # label(d4_relat_1) # label(axiom).  [clausify(5)].
% 0.77/1.04  Derived: relation_dom(c1) = A | in(f6(c1,A),A) | in(ordered_pair(f6(c1,A),f7(c1,A)),c1).  [resolve(50,a,40,a)].
% 0.77/1.04  Derived: relation_dom(c4) = A | in(f6(c4,A),A) | in(ordered_pair(f6(c4,A),f7(c4,A)),c4).  [resolve(50,a,41,a)].
% 0.77/1.04  Derived: relation_dom(A) = B | in(f6(A,B),B) | in(ordered_pair(f6(A,B),f7(A,B)),A) | in(f3(A),A).  [resolve(50,a,42,a)].
% 0.77/1.04  Derived: relation_dom(A) = B | in(f6(A,B),B) | in(ordered_pair(f6(A,B),f7(A,B)),A) | ordered_pair(C,D) != f3(A).  [resolve(50,a,43,a)].
% 0.77/1.04  51 -relation(A) | relation_rng(A) = B | in(f9(A,B),B) | in(ordered_pair(f10(A,B),f9(A,B)),A) # label(d5_relat_1) # label(axiom).  [clausify(6)].
% 0.77/1.04  Derived: relation_rng(c1) = A | in(f9(c1,A),A) | in(ordered_pair(f10(c1,A),f9(c1,A)),c1).  [resolve(51,a,40,a)].
% 0.77/1.04  Derived: relation_rng(c4) = A | in(f9(c4,A),A) | in(ordered_pair(f10(c4,A),f9(c4,A)),c4).  [resolve(51,a,41,a)].
% 0.77/1.04  Derived: relation_rng(A) = B | in(f9(A,B),B) | in(ordered_pair(f10(A,B),f9(A,B)),A) | in(f3(A),A).  [resolve(51,a,42,a)].
% 0.77/1.04  Derived: relation_rng(A) = B | in(f9(A,B),B) | in(ordered_pair(f10(A,B),f9(A,B)),A) | ordered_pair(C,D) != f3(A).  [resolve(51,a,43,a)].
% 2.17/2.52  
% 2.17/2.52  ============================== end predicate elimination =============
% 2.17/2.52  
% 2.17/2.52  Auto_denials:  (non-Horn, no changes).
% 2.17/2.52  
% 2.17/2.52  Term ordering decisions:
% 2.17/2.52  Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. c4=1. ordered_pair=1. cartesian_product2=1. unordered_pair=1. f1=1. f2=1. f4=1. f6=1. f7=1. f9=1. f10=1. relation_dom=1. relation_rng=1. powerset=1. singleton=1. f3=1. f11=1. f12=1. f13=1. f5=1. f8=1.
% 2.17/2.52  
% 2.17/2.52  ============================== end of process initial clauses ========
% 2.17/2.52  
% 2.17/2.52  ============================== CLAUSES FOR SEARCH ====================
% 2.17/2.52  
% 2.17/2.52  ============================== end of clauses for search =============
% 2.17/2.52  
% 2.17/2.52  ============================== SEARCH ================================
% 2.17/2.52  
% 2.17/2.52  % Starting search at 0.02 seconds.
% 2.17/2.52  
% 2.17/2.52  Low Water (keep): wt=13.000, iters=3367
% 2.17/2.52  
% 2.17/2.52  Low Water (keep): wt=12.000, iters=3408
% 2.17/2.52  
% 2.17/2.52  Low Water (keep): wt=11.000, iters=3337
% 2.17/2.52  
% 2.17/2.52  Low Water (keep): wt=10.000, iters=3333
% 2.17/2.52  
% 2.17/2.52  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 35 (0.00 of 0.51 sec).
% 2.17/2.52  
% 2.17/2.52  Low Water (keep): wt=9.000, iters=3337
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9309, wt=144.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9317, wt=143.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9243, wt=128.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9251, wt=127.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9325, wt=125.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8411, wt=124.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9304, wt=123.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9354, wt=121.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9719, wt=113.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9238, wt=110.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9738, wt=109.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9337, wt=107.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8971, wt=106.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8676, wt=105.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9533, wt=104.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9532, wt=103.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9239, wt=101.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9552, wt=100.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9336, wt=99.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9342, wt=97.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9282, wt=96.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8446, wt=95.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9348, wt=94.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8451, wt=93.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9343, wt=92.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9338, wt=91.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9281, wt=90.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9346, wt=89.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9358, wt=88.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9357, wt=87.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=5186, wt=86.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9347, wt=85.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9737, wt=84.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9289, wt=83.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9350, wt=82.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9349, wt=81.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9341, wt=80.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8897, wt=79.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8442, wt=78.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9733, wt=77.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9339, wt=76.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9041, wt=75.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9326, wt=74.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9260, wt=73.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8445, wt=72.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9551, wt=71.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9717, wt=70.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9726, wt=69.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9292, wt=68.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8457, wt=67.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10450, wt=66.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9740, wt=65.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9547, wt=64.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10445, wt=63.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10514, wt=62.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8683, wt=61.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=6991, wt=60.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10509, wt=59.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=8686, wt=58.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=6988, wt=57.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10452, wt=56.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9524, wt=55.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=7059, wt=54.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10998, wt=53.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=10528, wt=52.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=11241, wt=51.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=9703, wt=50.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=11155, wt=49.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=11428, wt=48.000
% 2.17/2.52  
% 2.17/2.52  Low Water (displace): id=11538, wt=47.000
% 2.17/2.52  
% 2.17/2.52  Low Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------