0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n020.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% DateTime   : Tue Jul 13 17:04:21 EDT 2021
0.12/0.34	% CPUTime    : 
1.01/1.29	============================== Prover9 ===============================
1.01/1.29	Prover9 (32) version 2009-11A, November 2009.
1.01/1.29	Process 10276 was started by sandbox on n020.cluster.edu,
1.01/1.29	Tue Jul 13 17:04:22 2021
1.01/1.29	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_10113_n020.cluster.edu".
1.01/1.29	============================== end of head ===========================
1.01/1.29	
1.01/1.29	============================== INPUT =================================
1.01/1.29	
1.01/1.29	% Reading from file /tmp/Prover9_10113_n020.cluster.edu
1.01/1.29	
1.01/1.29	set(prolog_style_variables).
1.01/1.29	set(auto2).
1.01/1.29	    % set(auto2) -> set(auto).
1.01/1.29	    % set(auto) -> set(auto_inference).
1.01/1.29	    % set(auto) -> set(auto_setup).
1.01/1.29	    % set(auto_setup) -> set(predicate_elim).
1.01/1.29	    % set(auto_setup) -> assign(eq_defs, unfold).
1.01/1.29	    % set(auto) -> set(auto_limits).
1.01/1.29	    % set(auto_limits) -> assign(max_weight, "100.000").
1.01/1.29	    % set(auto_limits) -> assign(sos_limit, 20000).
1.01/1.29	    % set(auto) -> set(auto_denials).
1.01/1.29	    % set(auto) -> set(auto_process).
1.01/1.29	    % set(auto2) -> assign(new_constants, 1).
1.01/1.29	    % set(auto2) -> assign(fold_denial_max, 3).
1.01/1.29	    % set(auto2) -> assign(max_weight, "200.000").
1.01/1.29	    % set(auto2) -> assign(max_hours, 1).
1.01/1.29	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
1.01/1.29	    % set(auto2) -> assign(max_seconds, 0).
1.01/1.29	    % set(auto2) -> assign(max_minutes, 5).
1.01/1.29	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
1.01/1.29	    % set(auto2) -> set(sort_initial_sos).
1.01/1.29	    % set(auto2) -> assign(sos_limit, -1).
1.01/1.29	    % set(auto2) -> assign(lrs_ticks, 3000).
1.01/1.29	    % set(auto2) -> assign(max_megs, 400).
1.01/1.29	    % set(auto2) -> assign(stats, some).
1.01/1.29	    % set(auto2) -> clear(echo_input).
1.01/1.29	    % set(auto2) -> set(quiet).
1.01/1.29	    % set(auto2) -> clear(print_initial_clauses).
1.01/1.29	    % set(auto2) -> clear(print_given).
1.01/1.29	assign(lrs_ticks,-1).
1.01/1.29	assign(sos_limit,10000).
1.01/1.29	assign(order,kbo).
1.01/1.29	set(lex_order_vars).
1.01/1.29	clear(print_given).
1.01/1.29	
1.01/1.29	% formulas(sos).  % not echoed (110 formulas)
1.01/1.29	
1.01/1.29	============================== end of input ==========================
1.01/1.29	
1.01/1.29	% From the command line: assign(max_seconds, 1200).
1.01/1.29	
1.01/1.29	============================== PROCESS NON-CLAUSAL FORMULAS ==========
1.01/1.29	
1.01/1.29	% Formulas that are not ordinary clauses:
1.01/1.29	1 (all A all B set_intersection2(A,B) = set_difference(A,set_difference(A,B))) # label(t48_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	2 (all A all B all C all D (ordered_pair(A,B) = ordered_pair(C,D) -> A = C & D = B)) # label(t33_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	3 (all A A = union(powerset(A))) # label(t99_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	4 (all A all B (subset(A,B) & B != A <-> proper_subset(A,B))) # label(d8_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	5 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(B,D) & in(A,C))) # label(l55_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	6 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	7 (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].
1.01/1.29	8 (all A all B (-in(A,B) -> disjoint(singleton(A),B))) # label(l28_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	9 (all A all B all C (set_intersection2(A,B) = C <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	10 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	11 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	12 (all A all B A = set_union2(A,A)) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	13 (all A all B (element(B,powerset(A)) -> set_difference(A,B) = subset_complement(A,B))) # label(d5_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	14 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	15 (all A all B (A = set_difference(A,singleton(B)) <-> -in(B,A))) # label(t65_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	16 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	17 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	18 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	19 (all A all B all C (cartesian_product2(A,B) = C <-> (all D (in(D,C) <-> (exists E exists F (D = ordered_pair(E,F) & in(F,B) & in(E,A))))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	20 (all A all B set_intersection2(B,A) = set_intersection2(A,B)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	21 (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].
1.01/1.29	22 (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].
1.01/1.29	23 (all A all B all C (unordered_pair(B,C) = singleton(A) -> C = B)) # label(t9_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	24 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	25 $T # label(dt_k3_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	26 (all A all B (subset(A,B) <-> empty_set = set_difference(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	27 (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].
1.01/1.29	28 (all A all B set_union2(A,B) = set_union2(A,set_difference(B,A))) # label(t39_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	29 (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].
1.01/1.29	30 (all A all B (B = A <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	31 (all A all B (proper_subset(A,B) -> -proper_subset(B,A))) # label(antisymmetry_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	32 (all A all B -(empty(B) & B != A & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	33 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	34 (all A all B all C all D (in(B,D) & in(A,C) <-> in(ordered_pair(A,B),cartesian_product2(C,D)))) # label(t106_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	35 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	36 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	37 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	38 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	39 (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].
1.01/1.29	40 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	41 (all A all B unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B)) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	42 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	43 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	44 (all A all B (subset(A,singleton(B)) <-> A = singleton(B) | empty_set = A)) # label(t39_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	45 (all A all B (empty_set = set_intersection2(A,B) <-> disjoint(A,B))) # label(d7_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	46 (all A all B all C (subset(C,B) & subset(A,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	47 (all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	48 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	49 (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].
1.01/1.29	50 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.29	51 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	52 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.29	53 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	54 (all A exists B ((all C all D (in(C,B) & subset(D,C) -> in(D,B))) & (all C -(-in(C,B) & -are_equipotent(C,B) & subset(C,B))) & (all C (in(C,B) -> in(powerset(C),B))) & in(A,B))) # label(t136_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	55 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	56 (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].
1.01/1.30	57 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	58 (all A all B (in(A,B) -> B = set_union2(singleton(A),B))) # label(t46_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	59 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	60 (all A all B all C all D -(unordered_pair(C,D) = unordered_pair(A,B) & C != A & A != D)) # label(t10_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	61 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	62 (all A all B all C (in(B,C) & in(A,C) <-> subset(unordered_pair(A,B),C))) # label(t38_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	63 (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].
1.01/1.30	64 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	65 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	66 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	67 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	68 (all A all B ((all C (C = A <-> in(C,B))) <-> B = singleton(A))) # label(d1_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	69 (all A all B -(in(A,B) & disjoint(singleton(A),B))) # label(l25_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	70 (all A all B -(proper_subset(B,A) & subset(A,B))) # label(t60_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	71 (all A all B set_union2(B,A) = set_union2(A,B)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	72 (all A all B (subset(A,B) -> B = set_union2(A,B))) # label(t12_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	73 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	74 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	75 (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].
1.01/1.30	76 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	77 (all A exists B ((all C -(in(C,B) & (all D -(in(D,B) & (all E (subset(E,C) -> in(E,D))))))) & (all C -(-are_equipotent(C,B) & -in(C,B) & subset(C,B))) & (all C all D (in(C,B) & subset(D,C) -> in(D,B))) & in(A,B))) # label(t9_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	78 (all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	79 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	80 (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].
1.01/1.30	81 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	82 (all A all B (in(A,B) <-> subset(singleton(A),B))) # label(t37_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	83 (all A all B all C (subset(A,C) & subset(A,B) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	84 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	85 (all A all B all C ((all D (in(D,C) <-> A = D | D = B)) <-> unordered_pair(A,B) = C)) # label(d2_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	86 (all A all B (subset(singleton(A),singleton(B)) -> B = A)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	87 (all A all B (-(disjoint(A,B) & (exists C (in(C,A) & in(C,B)))) & -((all C -(in(C,A) & in(C,B))) & -disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	88 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	89 (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].
1.01/1.30	90 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	91 (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].
1.01/1.30	92 (all A all B all C all D (subset(C,D) & subset(A,B) -> subset(cartesian_product2(A,C),cartesian_product2(B,D)))) # label(t119_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	93 (all A all B ((-empty(A) -> (in(B,A) <-> element(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	94 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	95 (all A all B all C (subset(A,B) -> subset(cartesian_product2(C,A),cartesian_product2(C,B)) & subset(cartesian_product2(A,C),cartesian_product2(B,C)))) # label(t118_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	96 (all A all B (in(A,B) -> subset(A,union(B)))) # label(t92_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	97 (all A all B (subset(A,B) <-> set_difference(A,B) = empty_set)) # label(l32_xboole_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	98 (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].
1.01/1.30	99 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	100 (all A all B all C (unordered_pair(B,C) = singleton(A) -> A = B)) # label(t8_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	101 (all A all B ((all C (in(C,B) <-> in(C,A))) -> B = A)) # label(t2_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	102 (all A all B (in(A,B) <-> subset(singleton(A),B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
1.01/1.30	103 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	104 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.01/1.30	105 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause).  [assumption].
4.67/5.05	106 (all A all B (subset(A,singleton(B)) <-> A = singleton(B) | A = empty_set)) # label(l4_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
4.67/5.05	107 (all A all B all C ((all D (-in(D,B) & in(D,A) <-> in(D,C))) <-> C = set_difference(A,B))) # label(d4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
4.67/5.05	108 -(all A all B (element(B,powerset(A)) -> (all C (element(C,powerset(A)) -> (subset(B,subset_complement(A,C)) <-> disjoint(B,C)))))) # label(t43_subset_1) # label(negated_conjecture) # label(non_clause).  [assumption].
4.67/5.05	
4.67/5.05	============================== end of process non-clausal formulas ===
4.67/5.05	
4.67/5.05	============================== PROCESS INITIAL CLAUSES ===============
4.67/5.05	
4.67/5.05	============================== PREDICATE ELIMINATION =================
4.67/5.05	
4.67/5.05	============================== end predicate elimination =============
4.67/5.05	
4.67/5.05	Auto_denials:  (non-Horn, no changes).
4.67/5.05	
4.67/5.05	Term ordering decisions:
4.67/5.05	Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_difference=1. set_union2=1. cartesian_product2=1. set_intersection2=1. unordered_pair=1. ordered_pair=1. subset_complement=1. f7=1. f9=1. f13=1. f15=1. f17=1. f18=1. f20=1. f22=1. f24=1. singleton=1. powerset=1. union=1. f8=1. f10=1. f12=1. f14=1. f19=1. f23=1. f1=1. f4=1. f5=1. f6=1. f11=1. f16=1. f21=1. f25=1. f2=1. f3=1.
4.67/5.05	
4.67/5.05	============================== end of process initial clauses ========
4.67/5.05	
4.67/5.05	============================== CLAUSES FOR SEARCH ====================
4.67/5.05	
4.67/5.05	============================== end of clauses for search =============
4.67/5.05	
4.67/5.05	============================== SEARCH ================================
4.67/5.05	
4.67/5.05	% Starting search at 0.04 seconds.
4.67/5.05	
4.67/5.05	Low Water (keep): wt=45.000, iters=3517
4.67/5.05	
4.67/5.05	Low Water (keep): wt=40.000, iters=3422
4.67/5.05	
4.67/5.05	Low Water (keep): wt=37.000, iters=3351
4.67/5.05	
4.67/5.05	Low Water (keep): wt=36.000, iters=3334
4.67/5.05	
4.67/5.05	Low Water (keep): wt=34.000, iters=3408
4.67/5.05	
4.67/5.05	Low Water (keep): wt=33.000, iters=3399
4.67/5.05	
4.67/5.05	Low Water (keep): wt=31.000, iters=3370
4.67/5.05	
4.67/5.05	Low Water (keep): wt=30.000, iters=3416
4.67/5.05	
4.67/5.05	Low Water (keep): wt=26.000, iters=3351
4.67/5.05	
4.67/5.05	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 30 (0.00 of 0.83 sec).
4.67/5.05	
4.67/5.05	Low Water (keep): wt=24.000, iters=3445
4.67/5.05	
4.67/5.05	Low Water (keep): wt=23.000, iters=3357
4.67/5.05	
4.67/5.05	Low Water (keep): wt=22.000, iters=3341
4.67/5.05	
4.67/5.05	Low Water (keep): wt=21.000, iters=3367
4.67/5.05	
4.67/5.05	Low Water (keep): wt=20.000, iters=3343
4.67/5.05	
4.67/5.05	Low Water (keep): wt=19.000, iters=3354
4.67/5.05	
4.67/5.05	Low Water (keep): wt=18.000, iters=3353
4.67/5.05	
4.67/5.05	Low Water (keep): wt=17.000, iters=3351
4.67/5.05	
4.67/5.05	Low Water (keep): wt=16.000, iters=3348
4.67/5.05	
4.67/5.05	Low Water (keep): wt=15.000, iters=3348
4.67/5.05	
4.67/5.05	Low Water (keep): wt=14.000, iters=3337
4.67/5.05	
4.67/5.05	Low Water (keep): wt=13.000, iters=3337
4.67/5.05	
4.67/5.05	Low Water (keep): wt=12.000, iters=3334
4.67/5.05	
4.67/5.05	Low Water (keep): wt=11.000, iters=3339
4.67/5.05	
4.67/5.05	Low Water (keep): wt=10.000, iters=3393
4.67/5.05	
4.67/5.05	Low Water (displace): id=2093, wt=74.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=1983, wt=64.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=1833, wt=63.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2108, wt=62.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2104, wt=59.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2117, wt=58.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2236, wt=56.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=1782, wt=55.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2339, wt=54.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2709, wt=53.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2147, wt=52.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=1801, wt=51.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2636, wt=50.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2103, wt=49.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2099, wt=48.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=1952, wt=47.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2273, wt=46.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=3930, wt=45.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=3125, wt=44.000
4.67/5.05	
4.67/5.05	Low Water (keep): wt=9.000, iters=3335
4.67/5.05	
4.67/5.05	Low Water (displace): id=1894, wt=43.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2708, wt=42.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=2450, wt=41.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=3936, wt=40.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=3807, wt=39.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=3670, wt=38.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=4117, wt=37.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=4085, wt=36.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=4163, wt=35.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=3126, wt=34.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=13344, wt=17.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=14508, wt=15.000
4.67/5.05	
4.67/5.05	Low Water (displace): id=6779, Alarm clock 
119.72/120.07	Prover9 interrupted
119.72/120.07	EOF