TSTP Solution File: SEU178+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU178+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% 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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 13:29:41 EDT 2022
% Result : Timeout 300.05s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU178+2 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 20 05:26:18 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.52/0.83 ============================== Prover9 ===============================
% 0.52/0.83 Prover9 (32) version 2009-11A, November 2009.
% 0.52/0.83 Process 15517 was started by sandbox2 on n032.cluster.edu,
% 0.52/0.83 Mon Jun 20 05:26:19 2022
% 0.52/0.83 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15362_n032.cluster.edu".
% 0.52/0.83 ============================== end of head ===========================
% 0.52/0.83
% 0.52/0.83 ============================== INPUT =================================
% 0.52/0.83
% 0.52/0.83 % Reading from file /tmp/Prover9_15362_n032.cluster.edu
% 0.52/0.83
% 0.52/0.83 set(prolog_style_variables).
% 0.52/0.83 set(auto2).
% 0.52/0.83 % set(auto2) -> set(auto).
% 0.52/0.83 % set(auto) -> set(auto_inference).
% 0.52/0.83 % set(auto) -> set(auto_setup).
% 0.52/0.83 % set(auto_setup) -> set(predicate_elim).
% 0.52/0.83 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.52/0.83 % set(auto) -> set(auto_limits).
% 0.52/0.83 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.52/0.83 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.52/0.83 % set(auto) -> set(auto_denials).
% 0.52/0.83 % set(auto) -> set(auto_process).
% 0.52/0.83 % set(auto2) -> assign(new_constants, 1).
% 0.52/0.83 % set(auto2) -> assign(fold_denial_max, 3).
% 0.52/0.83 % set(auto2) -> assign(max_weight, "200.000").
% 0.52/0.83 % set(auto2) -> assign(max_hours, 1).
% 0.52/0.83 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.52/0.83 % set(auto2) -> assign(max_seconds, 0).
% 0.52/0.83 % set(auto2) -> assign(max_minutes, 5).
% 0.52/0.83 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.52/0.83 % set(auto2) -> set(sort_initial_sos).
% 0.52/0.83 % set(auto2) -> assign(sos_limit, -1).
% 0.52/0.83 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.52/0.83 % set(auto2) -> assign(max_megs, 400).
% 0.52/0.83 % set(auto2) -> assign(stats, some).
% 0.52/0.83 % set(auto2) -> clear(echo_input).
% 0.52/0.83 % set(auto2) -> set(quiet).
% 0.52/0.83 % set(auto2) -> clear(print_initial_clauses).
% 0.52/0.83 % set(auto2) -> clear(print_given).
% 0.52/0.83 assign(lrs_ticks,-1).
% 0.52/0.83 assign(sos_limit,10000).
% 0.52/0.83 assign(order,kbo).
% 0.52/0.83 set(lex_order_vars).
% 0.52/0.83 clear(print_given).
% 0.52/0.83
% 0.52/0.83 % formulas(sos). % not echoed (145 formulas)
% 0.52/0.83
% 0.52/0.83 ============================== end of input ==========================
% 0.52/0.83
% 0.52/0.83 % From the command line: assign(max_seconds, 300).
% 0.52/0.83
% 0.52/0.83 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.52/0.83
% 0.52/0.83 % Formulas that are not ordinary clauses:
% 0.52/0.83 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 2 (all A all B (proper_subset(A,B) -> -proper_subset(B,A))) # label(antisymmetry_r2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 3 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 4 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 5 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 6 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 7 (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.52/0.83 8 (all A all B ((A != empty_set -> (B = set_meet(A) <-> (all C (in(C,B) <-> (all D (in(D,A) -> in(C,D))))))) & (A = empty_set -> (B = set_meet(A) <-> B = empty_set)))) # label(d1_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 9 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 10 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 11 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 12 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 13 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 14 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 15 (all A all B all C (C = cartesian_product2(A,B) <-> (all D (in(D,C) <-> (exists E exists F (in(E,A) & in(F,B) & D = ordered_pair(E,F))))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 16 (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.52/0.83 17 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 18 (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.52/0.83 19 (all A cast_to_subset(A) = A) # label(d4_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 20 (all A all B (B = union(A) <-> (all C (in(C,B) <-> (exists D (in(C,D) & in(D,A))))))) # label(d4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 21 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 22 (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.52/0.83 23 (all A all B (element(B,powerset(A)) -> subset_complement(A,B) = set_difference(A,B))) # label(d5_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 24 (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.52/0.83 25 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 26 (all A all B (element(B,powerset(powerset(A))) -> (all C (element(C,powerset(powerset(A))) -> (C = complements_of_subsets(A,B) <-> (all D (element(D,powerset(A)) -> (in(D,C) <-> in(subset_complement(A,D),B))))))))) # label(d8_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 27 (all A all B (proper_subset(A,B) <-> subset(A,B) & A != B)) # label(d8_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 28 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 29 $T # label(dt_k1_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 30 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 31 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 32 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 33 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 34 (all A element(cast_to_subset(A),powerset(A))) # label(dt_k2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 35 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 36 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 37 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 38 (all A all B (element(B,powerset(A)) -> element(subset_complement(A,B),powerset(A)))) # label(dt_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 39 $T # label(dt_k3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 40 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 41 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 42 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 43 (all A all B (element(B,powerset(powerset(A))) -> element(union_of_subsets(A,B),powerset(A)))) # label(dt_k5_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 44 (all A all B (element(B,powerset(powerset(A))) -> element(meet_of_subsets(A,B),powerset(A)))) # label(dt_k6_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 45 (all A all B all C (element(B,powerset(A)) & element(C,powerset(A)) -> element(subset_difference(A,B,C),powerset(A)))) # label(dt_k6_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 46 (all A all B (element(B,powerset(powerset(A))) -> element(complements_of_subsets(A,B),powerset(powerset(A))))) # label(dt_k7_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 47 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 48 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 49 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 50 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 51 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 52 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 53 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 54 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 55 (all A all B (-empty(A) & -empty(B) -> -empty(cartesian_product2(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 56 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 57 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 58 (all A all B (element(B,powerset(A)) -> subset_complement(A,subset_complement(A,B)) = B)) # label(involutiveness_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 59 (all A all B (element(B,powerset(powerset(A))) -> complements_of_subsets(A,complements_of_subsets(A,B)) = B)) # label(involutiveness_k7_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 60 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 61 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 62 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 63 (all A all B -(disjoint(singleton(A),B) & in(A,B))) # label(l25_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 64 (all A all B (-in(A,B) -> disjoint(singleton(A),B))) # label(l28_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 65 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 66 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 67 (all A all B (element(B,powerset(A)) -> (all C (in(C,B) -> in(C,A))))) # label(l3_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 68 (all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 69 (all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(l4_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 70 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 71 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(l55_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 72 (all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.83 73 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 74 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.83 75 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 76 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 77 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 78 (all A all B (element(B,powerset(powerset(A))) -> union_of_subsets(A,B) = union(B))) # label(redefinition_k5_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 79 (all A all B (element(B,powerset(powerset(A))) -> meet_of_subsets(A,B) = set_meet(B))) # label(redefinition_k6_setfam_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 80 (all A all B all C (element(B,powerset(A)) & element(C,powerset(A)) -> subset_difference(A,B,C) = set_difference(B,C))) # label(redefinition_k6_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 81 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 82 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 83 (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(lemma) # label(non_clause). [assumption].
% 0.52/0.84 84 (all A all B all C all D -(unordered_pair(A,B) = unordered_pair(C,D) & A != C & A != D)) # label(t10_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 85 (all A all B all C (subset(A,B) -> subset(cartesian_product2(A,C),cartesian_product2(B,C)) & subset(cartesian_product2(C,A),cartesian_product2(C,B)))) # label(t118_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 86 (all A all B all C all D (subset(A,B) & subset(C,D) -> subset(cartesian_product2(A,C),cartesian_product2(B,D)))) # label(t119_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 87 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 88 (all A exists B (in(A,B) & (all C all D (in(C,B) & subset(D,C) -> in(D,B))) & (all C (in(C,B) -> in(powerset(C),B))) & (all C -(subset(C,B) & -are_equipotent(C,B) & -in(C,B))))) # label(t136_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 89 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 90 (all A all B all C (subset(A,B) & subset(A,C) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 91 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 92 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 93 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 94 (all A all B all C (relation(C) -> (in(ordered_pair(A,B),C) -> in(A,relation_dom(C)) & in(B,relation_rng(C))))) # label(t20_relat_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 95 (all A all B all C (subset(A,B) -> subset(set_intersection2(A,C),set_intersection2(B,C)))) # label(t26_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 96 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 97 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 98 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 99 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 100 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 101 (all A all B all C (subset(A,B) -> subset(set_difference(A,C),set_difference(B,C)))) # label(t33_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 102 (all A all B all C all D (ordered_pair(A,B) = ordered_pair(C,D) -> A = C & B = D)) # label(t33_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 103 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 104 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 105 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(t37_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 106 (all A all B all C (subset(unordered_pair(A,B),C) <-> in(A,C) & in(B,C))) # label(t38_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 107 (all A all B set_union2(A,set_difference(B,A)) = set_union2(A,B)) # label(t39_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 108 (all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(t39_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 109 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 110 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 111 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 112 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 113 (all A all B set_difference(set_union2(A,B),B) = set_difference(A,B)) # label(t40_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 114 (all A all B (element(B,powerset(A)) -> (all C (element(C,powerset(A)) -> (disjoint(B,C) <-> subset(B,subset_complement(A,C))))))) # label(t43_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 115 (all A all B (subset(A,B) -> B = set_union2(A,set_difference(B,A)))) # label(t45_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 116 (all A all B (element(B,powerset(powerset(A))) -> -(B != empty_set & complements_of_subsets(A,B) = empty_set))) # label(t46_setfam_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 117 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(t46_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 118 (all A all B (element(B,powerset(powerset(A))) -> (B != empty_set -> subset_difference(A,cast_to_subset(A),union_of_subsets(A,B)) = meet_of_subsets(A,complements_of_subsets(A,B))))) # label(t47_setfam_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 119 (all A all B (element(B,powerset(powerset(A))) -> (B != empty_set -> union_of_subsets(A,complements_of_subsets(A,B)) = subset_difference(A,cast_to_subset(A),meet_of_subsets(A,B))))) # label(t48_setfam_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 120 (all A all B set_difference(A,set_difference(A,B)) = set_intersection2(A,B)) # label(t48_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 121 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 122 (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.52/0.84 123 (all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 124 (all A (A != empty_set -> (all B (element(B,powerset(A)) -> (all C (element(C,A) -> (-in(C,B) -> in(C,subset_complement(A,B))))))))) # label(t50_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 125 (all A all B all C (element(C,powerset(A)) -> -(in(B,subset_complement(A,C)) & in(B,C)))) # label(t54_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 126 (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.52/0.84 127 (all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 128 (all A all B all C (subset(A,B) & disjoint(B,C) -> disjoint(A,C))) # label(t63_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 129 (all A all B (set_difference(A,singleton(B)) = A <-> -in(B,A))) # label(t65_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 130 (all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 131 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 132 (all A all B (subset(singleton(A),singleton(B)) -> A = B)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 133 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 134 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 135 (all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 136 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 137 (all A all B all C (subset(A,B) & subset(C,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 138 (all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 139 (all A all B (in(A,B) -> subset(A,union(B)))) # label(t92_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 140 (all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 141 (all A exists B (in(A,B) & (all C all D (in(C,B) & subset(D,C) -> in(D,B))) & (all C -(in(C,B) & (all D -(in(D,B) & (all E (subset(E,C) -> in(E,D))))))) & (all C -(subset(C,B) & -are_equipotent(C,B) & -in(C,B))))) # label(t9_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.84 142 (all A all B all C (singleton(A) = unordered_pair(B,C) -> B = C)) # label(t9_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.52/0.84 143 -(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.52/0.84
% 0.52/0.84 ============================== end of process non-clausal formulas ===
% 0.52/0.84
% 0.52/0.84 ============================== PROCESS INITIAL CLAUSES ===============
% 0.52/0.84
% 0.52/0.84 ============================== PREDICATE ELIMINATION =================
% 0.52/0.84 144 relation(A) | in(f3(A),A) # label(d1_relat_1) # label(axiom). [clausify(7)].
% 0.52/0.84 145 -relation(A) | -in(B,A) | ordered_pair(f1(A,B),f2(A,B)) = B # label(d1_relat_1) # label(axiom). [clausify(7)].
% 0.52/0.84 Derived: in(f3(A),A) | -in(B,A) | ordered_pair(f1(A,B),f2(A,B)) = B. [resolve(144,a,145,a)].
% 0.52/0.84 146 relation(A) | ordered_pair(B,C) != f3(A) # label(d1_relat_1) # label(axiom). [clausify(7)].
% 0.52/0.84 Derived: ordered_pair(A,B) != f3(C) | -in(D,C) | ordered_pair(f1(C,D),f2(C,D)) = D. [resolve(146,a,145,a)].
% 0.52/0.84 147 -relation(A) | relation_dom(A) != B | -in(C,B) | in(ordered_pair(C,f19(A,B,C)),A) # label(d4_relat_1) # label(axiom). [clausify(18)].
% 0.52/0.84 Derived: relation_dom(A) != B | -in(C,B) | in(ordered_pair(C,f19(A,B,C)),A) | in(f3(A),A). [resolve(147,a,144,a)].
% 0.52/0.84 Derived: relation_dom(A) != B | -in(C,B) | in(ordered_pair(C,f19(A,B,C)),A) | ordered_pair(D,E) != f3(A). [resolve(147,a,146,a)].
% 0.52/0.84 148 -relation(A) | relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) # label(d4_relat_1) # label(axiom). [clausify(18)].
% 0.52/0.84 Derived: relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) | in(f3(A),A). [resolve(148,a,144,a)].
% 0.52/0.84 Derived: relation_dom(A) != B | in(C,B) | -in(ordered_pair(C,D),A) | ordered_pair(E,F) != f3(A). [resolve(148,a,146,a)].
% 0.52/0.84 149 -relation(A) | relation_dom(A) = B | in(f20(A,B),B) | in(ordered_pair(f20(A,B),f21(A,B)),A) # label(d4_relat_1) # label(axiom). [clausify(18)].
% 0.52/0.84 Derived: relation_dom(A) = B | in(f20(A,B),B) | in(ordered_pair(f20(A,B),f21(A,B)),A) | in(f3(A),A). [resolve(149,a,144,a)].
% 0.52/0.84 Derived: relation_dom(A) = B | in(f20(A,B),B) | in(ordered_pair(f20(A,B),f21(A,B)),A) | ordered_pair(C,D) != f3(A). [resolve(149,a,146,a)].
% 0.52/0.84 150 -relation(A) | relation_dom(A) = B | -in(f20(A,B),B) | -in(ordered_pair(f20(A,B),C),A) # label(d4_relat_1) # label(axiom). [clausify(18)].
% 0.52/0.84 Derived: relation_dom(A) = B | -in(f20(A,B),B) | -in(ordered_pair(f20(A,B),C),A) | in(f3(A),A). [resolve(150,a,144,a)].
% 0.52/0.84 Derived: relation_dom(A) = B | -in(f20(A,B),B) | -in(ordered_pair(f20(A,B),C),A) | ordered_pair(D,E) != f3(A). [resolve(150,a,146,a)].
% 0.52/0.84 151 -relation(A) | relation_rng(A) != B | -in(C,B) | in(ordered_pair(f26(A,B,C),C),A) # label(d5_relat_1) # label(axiom). [clausify(22)].
% 0.52/0.84 Derived: relation_rng(A) != B | -in(C,B) | in(ordered_pair(f26(A,B,C),C),A) | in(f3(A),A). [resolve(151,a,144,a)].
% 0.52/0.84 Derived: relation_rng(A) != B | -in(C,B) | in(ordered_pair(f26(A,B,C),C),A) | ordered_pair(D,E) != f3(A). [resolve(151,a,146,a)].
% 0.52/0.84 152 -relation(A) | relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) # label(d5_relat_1) # label(axiom). [clausify(22)].
% 0.52/0.84 Derived: relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) | in(f3(A),A). [resolve(152,a,144,a)].
% 0.52/0.84 Derived: relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) | ordered_pair(E,F) != f3(A). [resolve(152,a,146,a)].
% 0.52/0.84 153 -relation(A) | relation_rng(A) = B | in(f27(A,B),B) | in(ordered_pair(f28(A,B),f27(A,B)),A) # label(d5_relat_1) # label(axiom). [clausify(22)].
% 0.52/0.84 Derived: relation_rng(A) = B | in(f27(A,B),B) | in(ordered_pair(f28(A,B),f27(A,B)),A) | in(f3(A),A). [resolve(153,a,144,a)].
% 0.52/0.84 Derived: relation_rng(A) = B | in(f27(A,B),B) | in(ordered_pair(f28(A,B),f27(A,B)),A) | ordered_pair(C,D) != f3(A). [resolve(153,a,146,a)].
% 0.52/0.84 154 -relation(A) | relation_rng(A) = B | -in(f27(A,B),B) | -in(ordered_pair(C,f27(A,B)),A) # label(d5_relat_1) # label(axiom). [clausify(22)].
% 0.52/0.84 Derived: relation_rng(A) = B | -in(f27(A,B),B) | -in(ordered_pair(C,f27(A,B)),A) | in(f3(A),A). [resolve(154,a,144,a)].
% 0.52/0.84 Derived: relation_rng(A) = B | -in(f27(A,B),B) | -in(ordered_pair(C,f27(A,B)),A) | ordered_pair(D,E) != f3(A). [resolve(154,a,146,a)].
% 0.52/0.84 155 relation(c1) # label(rc1_relat_1) # label(axiom). [clausify(73)].
% 0.52/0.84 Derived: -in(A,c1) | ordered_pair(f1(c1,A),f2(c1,A)) = A. [resolve(155,a,145,a)].
% 0.52/0.84 Derived: relation_dom(c1) != A | -in(B,A) | in(ordered_pair(B,f19(c1,A,B)),c1). [resolve(155,a,147,a)].
% 0.52/0.84 Derived: relation_dom(c1) != A | in(B,A) | -in(ordered_pair(B,C),c1). [resolve(155,a,148,a)].
% 0.52/0.84 Derived: relation_dom(c1) = A | in(f20(c1,A),A) | in(ordered_pair(f20(c1,A),f21(c1,A)),c1). [resolve(155,a,149,a)].
% 0.52/0.84 Derived: relation_dom(c1) = A | -in(f20(c1,A),A) | -in(ordered_pair(f20(c1,A),B),c1). [resolve(155,a,150,a)].
% 0.52/0.84 Derived: relation_rng(c1) != A | -in(B,A) | in(ordered_pair(f26(c1,A,B),B),c1). [resolve(155,a,151,a)].
% 0.52/0.84 Derived: relation_rng(c1) != A | in(B,A) | -in(ordered_pair(C,B),c1). [resolve(155,a,152,a)].
% 0.52/0.84 Derived: relation_rng(c1) = A | in(f27(c1,A),A) | in(ordered_pair(f28(c1,A),f27(c1,A)),c1). [resolve(155,a,153,a)].
% 0.52/0.84 Derived: relation_rng(c1) = A | -in(f27(c1,A),A) | -in(ordered_pair(B,f27(c1,A)),c1). [resolve(155,a,154,a)].
% 0.52/0.84 156 -relation(A) | -in(ordered_pair(B,C),A) | in(B,relation_dom(A)) # label(t20_relat_1) # label(lemma). [clausify(94)].
% 0.52/0.84 Derived: -in(ordered_pair(A,B),C) | in(A,relation_dom(C)) | in(f3(C),C). [resolve(156,a,144,a)].
% 0.52/0.84 Derived: -in(ordered_pair(A,B),C) | in(A,relation_dom(C)) | ordered_pair(D,E) != f3(C). [resolve(156,a,146,a)].
% 0.52/0.84 Derived: -in(ordered_pair(A,B),c1) | in(A,relation_dom(c1)). [resolve(156,a,155,a)].
% 0.52/0.84 157 -relation(A) | -in(ordered_pair(B,C),A) | in(C,relation_rng(A)) # label(t20_relat_1) # label(lemma). [clausify(94)].
% 0.52/0.84 Derived: -in(ordered_pair(A,B),C) | in(B,relation_rng(C)) | in(f3(C),C). [resolve(157,a,144,a)].
% 0.52/0.84 Derived: -in(ordered_pair(A,B),C) | in(B,relation_rng(C)) | ordered_pair(D,E) != f3(C). [resolve(157,a,146,a)].
% 0.52/0.84 Derived: -in(ordered_pair(A,B),c1) | in(B,relation_rng(c1)). [resolve(157,a,155,a)].
% 0.52/0.84 158 relation(c4) # label(t21_relat_1) # label(negated_conjecture). [clausify(143)].
% 0.52/0.84 Derived: -in(A,c4) | ordered_pair(f1(c4,A),f2(c4,A)) = A. [resolve(158,a,145,a)].
% 0.52/0.84 Derived: relation_dom(c4) != A | -in(B,A) | in(ordered_pair(B,f19(c4,A,B)),c4). [resolve(158,a,147,a)].
% 2.04/2.34 Derived: relation_dom(c4) != A | in(B,A) | -in(ordered_pair(B,C),c4). [resolve(158,a,148,a)].
% 2.04/2.34 Derived: relation_dom(c4) = A | in(f20(c4,A),A) | in(ordered_pair(f20(c4,A),f21(c4,A)),c4). [resolve(158,a,149,a)].
% 2.04/2.34 Derived: relation_dom(c4) = A | -in(f20(c4,A),A) | -in(ordered_pair(f20(c4,A),B),c4). [resolve(158,a,150,a)].
% 2.04/2.34 Derived: relation_rng(c4) != A | -in(B,A) | in(ordered_pair(f26(c4,A,B),B),c4). [resolve(158,a,151,a)].
% 2.04/2.34 Derived: relation_rng(c4) != A | in(B,A) | -in(ordered_pair(C,B),c4). [resolve(158,a,152,a)].
% 2.04/2.34 Derived: relation_rng(c4) = A | in(f27(c4,A),A) | in(ordered_pair(f28(c4,A),f27(c4,A)),c4). [resolve(158,a,153,a)].
% 2.04/2.34 Derived: relation_rng(c4) = A | -in(f27(c4,A),A) | -in(ordered_pair(B,f27(c4,A)),c4). [resolve(158,a,154,a)].
% 2.04/2.34 Derived: -in(ordered_pair(A,B),c4) | in(A,relation_dom(c4)). [resolve(158,a,156,a)].
% 2.04/2.34 Derived: -in(ordered_pair(A,B),c4) | in(B,relation_rng(c4)). [resolve(158,a,157,a)].
% 2.04/2.34
% 2.04/2.34 ============================== end predicate elimination =============
% 2.04/2.34
% 2.04/2.34 Auto_denials: (non-Horn, no changes).
% 2.04/2.34
% 2.04/2.34 Term ordering decisions:
% 2.04/2.34 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. ordered_pair=1. set_difference=1. cartesian_product2=1. set_union2=1. set_intersection2=1. unordered_pair=1. complements_of_subsets=1. subset_complement=1. meet_of_subsets=1. union_of_subsets=1. f1=1. f2=1. f5=1. f6=1. f7=1. f9=1. f17=1. f20=1. f21=1. f23=1. f24=1. f27=1. f28=1. f31=1. f35=1. f36=1. f37=1. f39=1. powerset=1. singleton=1. relation_dom=1. relation_rng=1. union=1. set_meet=1. cast_to_subset=1. f3=1. f8=1. f30=1. f32=1. f33=1. f34=1. f38=1. subset_difference=1. f4=1. f10=1. f11=1. f14=1. f15=1. f16=1. f18=1. f19=1. f22=1. f25=1. f26=1. f29=1. f12=1. f13=1.
% 2.04/2.34
% 2.04/2.34 ============================== end of process initial clauses ========
% 2.04/2.34
% 2.04/2.34 ============================== CLAUSES FOR SEARCH ====================
% 2.04/2.34
% 2.04/2.34 ============================== end of clauses for search =============
% 2.04/2.34
% 2.04/2.34 ============================== SEARCH ================================
% 2.04/2.34
% 2.04/2.34 % Starting search at 0.05 seconds.
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=53.000, iters=3530
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=47.000, iters=3334
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=43.000, iters=3370
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=40.000, iters=3403
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=38.000, iters=3420
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=37.000, iters=3502
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=35.000, iters=3390
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=34.000, iters=3337
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=33.000, iters=3546
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=32.000, iters=3533
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=31.000, iters=3449
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=30.000, iters=3398
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=29.000, iters=3361
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=27.000, iters=3364
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=26.000, iters=3354
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=25.000, iters=3358
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=24.000, iters=3360
% 2.04/2.34
% 2.04/2.34 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 32 (0.00 of 0.77 sec).
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=23.000, iters=3450
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=22.000, iters=3369
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=21.000, iters=3352
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=20.000, iters=3336
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=19.000, iters=3339
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=18.000, iters=3349
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=17.000, iters=3342
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=16.000, iters=3344
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=15.000, iters=3348
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=14.000, iters=3333
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=13.000, iters=3416
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=12.000, iters=3337
% 2.04/2.34
% 2.04/2.34 Low Water (keep): wt=11.000, iters=3354
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2989, wt=113.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2987, wt=109.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=1947, wt=101.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=1952, wt=100.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2114, wt=97.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2113, wt=96.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=1949, wt=95.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2473, wt=92.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2116, wt=91.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=1950, wt=89.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2471, wt=88.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2111, wt=87.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2355, wt=86.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2380, wt=85.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2381, wt=84.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2353, wt=82.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): id=2761, wt=81.000
% 2.04/2.34
% 2.04/2.34 Low Water (displace): idCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------