TSTP Solution File: SET765+4 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SET765+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n028.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:31:56 EDT 2022

% Result   : Timeout 300.06s 300.37s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET765+4 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 01:05:58 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/0.97  ============================== Prover9 ===============================
% 0.41/0.97  Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.97  Process 2540 was started by sandbox2 on n028.cluster.edu,
% 0.41/0.97  Mon Jul 11 01:05:58 2022
% 0.41/0.97  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2387_n028.cluster.edu".
% 0.41/0.97  ============================== end of head ===========================
% 0.41/0.97  
% 0.41/0.97  ============================== INPUT =================================
% 0.41/0.97  
% 0.41/0.97  % Reading from file /tmp/Prover9_2387_n028.cluster.edu
% 0.41/0.97  
% 0.41/0.97  set(prolog_style_variables).
% 0.41/0.97  set(auto2).
% 0.41/0.97      % set(auto2) -> set(auto).
% 0.41/0.97      % set(auto) -> set(auto_inference).
% 0.41/0.97      % set(auto) -> set(auto_setup).
% 0.41/0.97      % set(auto_setup) -> set(predicate_elim).
% 0.41/0.97      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.97      % set(auto) -> set(auto_limits).
% 0.41/0.97      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.97      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.97      % set(auto) -> set(auto_denials).
% 0.41/0.97      % set(auto) -> set(auto_process).
% 0.41/0.97      % set(auto2) -> assign(new_constants, 1).
% 0.41/0.97      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.97      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.97      % set(auto2) -> assign(max_hours, 1).
% 0.41/0.97      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.97      % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.97      % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.97      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.97      % set(auto2) -> set(sort_initial_sos).
% 0.41/0.97      % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.97      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.97      % set(auto2) -> assign(max_megs, 400).
% 0.41/0.97      % set(auto2) -> assign(stats, some).
% 0.41/0.97      % set(auto2) -> clear(echo_input).
% 0.41/0.97      % set(auto2) -> set(quiet).
% 0.41/0.97      % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.97      % set(auto2) -> clear(print_given).
% 0.41/0.97  assign(lrs_ticks,-1).
% 0.41/0.97  assign(sos_limit,10000).
% 0.41/0.97  assign(order,kbo).
% 0.41/0.97  set(lex_order_vars).
% 0.41/0.97  clear(print_given).
% 0.41/0.97  
% 0.41/0.97  % formulas(sos).  % not echoed (17 formulas)
% 0.41/0.97  
% 0.41/0.97  ============================== end of input ==========================
% 0.41/0.97  
% 0.41/0.97  % From the command line: assign(max_seconds, 300).
% 0.41/0.97  
% 0.41/0.97  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.97  
% 0.41/0.97  % Formulas that are not ordinary clauses:
% 0.41/0.97  1 (all A all B (subset(A,B) <-> (all X (member(X,A) -> member(X,B))))) # label(subset) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  2 (all A all B (equal_set(A,B) <-> subset(A,B) & subset(B,A))) # label(equal_set) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  3 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  4 (all X all A all B (member(X,intersection(A,B)) <-> member(X,A) & member(X,B))) # label(intersection) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  5 (all X all A all B (member(X,union(A,B)) <-> member(X,A) | member(X,B))) # label(union) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  6 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  7 (all B all A all E (member(B,difference(E,A)) <-> member(B,E) & -member(B,A))) # label(difference) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  8 (all X all A (member(X,singleton(A)) <-> X = A)) # label(singleton) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  9 (all X all A all B (member(X,unordered_pair(A,B)) <-> X = A | X = B)) # label(unordered_pair) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  10 (all X all A (member(X,sum(A)) <-> (exists Y (member(Y,A) & member(X,Y))))) # label(sum) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  11 (all X all A (member(X,product(A)) <-> (all Y (member(Y,A) -> member(X,Y))))) # label(product) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  12 (all A all B (disjoint(A,B) <-> -(exists X (member(X,A) & member(X,B))))) # label(disjoint) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  13 (all A all E (partition(A,E) <-> (all X (member(X,A) -> subset(X,E))) & (all X (member(X,E) -> (exists Y (member(Y,A) & member(X,Y))))) & (all X all Y (member(X,A) & member(Y,A) -> ((exists Z (member(Z,X) & member(Z,Y))) -> X = Y))))) # label(partition) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  14 (all A all R (equivalence(R,A) <-> (all X (member(X,A) -> apply(R,X,X))) & (all X all Y (member(X,A) & member(Y,A) -> (apply(R,X,Y) -> apply(R,Y,X)))) & (all X all Y all Z (member(X,A) & member(Y,A) & member(Z,A) -> (apply(R,X,Y) & apply(R,Y,Z) -> apply(R,X,Z)))))) # label(equivalence) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  15 (all R all E all A all X (member(X,equivalence_class(A,E,R)) <-> member(X,E) & apply(R,A,X))) # label(equivalence_class) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  16 (all R all E (pre_order(R,E) <-> (all X (member(X,E) -> apply(R,X,X))) & (all X all Y all Z (member(X,E) & member(Y,E) & member(Z,E) -> (apply(R,X,Y) & apply(R,Y,Z) -> apply(R,X,Z)))))) # label(pre_order) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.97  17 -(all E all R all X (equivalence(R,E) & subset(X,E) -> equivalence(R,X))) # label(thIII01) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.41/0.97  
% 0.41/0.97  ============================== end of process non-clausal formulas ===
% 0.41/0.97  
% 0.41/0.97  ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.97  
% 0.41/0.97  ============================== PREDICATE ELIMINATION =================
% 0.41/0.97  18 equal_set(A,B) | -subset(A,B) | -subset(B,A) # label(equal_set) # label(axiom).  [clausify(2)].
% 0.41/0.97  19 -equal_set(A,B) | subset(A,B) # label(equal_set) # label(axiom).  [clausify(2)].
% 0.41/0.97  20 -equal_set(A,B) | subset(B,A) # label(equal_set) # label(axiom).  [clausify(2)].
% 0.41/0.97  21 disjoint(A,B) | member(f4(A,B),A) # label(disjoint) # label(axiom).  [clausify(12)].
% 0.41/0.97  22 -disjoint(A,B) | -member(C,A) | -member(C,B) # label(disjoint) # label(axiom).  [clausify(12)].
% 0.41/0.97  Derived: member(f4(A,B),A) | -member(C,A) | -member(C,B).  [resolve(21,a,22,a)].
% 0.41/0.97  23 disjoint(A,B) | member(f4(A,B),B) # label(disjoint) # label(axiom).  [clausify(12)].
% 0.41/0.97  Derived: member(f4(A,B),B) | -member(C,A) | -member(C,B).  [resolve(23,a,22,a)].
% 0.41/0.97  24 partition(A,B) | member(f6(A,B),A) | member(f7(A,B),B) | member(f8(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  25 -partition(A,B) | -member(C,A) | subset(C,B) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  26 -partition(A,B) | -member(C,B) | member(f5(A,B,C),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  27 -partition(A,B) | -member(C,B) | member(C,f5(A,B,C)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  28 -partition(A,B) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,A) | subset(C,B).  [resolve(24,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,B) | member(f5(A,B,C),A).  [resolve(24,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(24,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(24,a,28,a)].
% 0.41/0.97  29 partition(A,B) | member(f6(A,B),A) | member(f7(A,B),B) | member(f9(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,A) | subset(C,B).  [resolve(29,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,B) | member(f5(A,B,C),A).  [resolve(29,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(29,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(29,a,28,a)].
% 0.41/0.97  30 partition(A,B) | member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,A) | subset(C,B).  [resolve(30,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,B) | member(f5(A,B,C),A).  [resolve(30,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(30,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(30,a,28,a)].
% 0.41/0.97  31 partition(A,B) | member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,A) | subset(C,B).  [resolve(31,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,B) | member(f5(A,B,C),A).  [resolve(31,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(31,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(31,a,28,a)].
% 0.41/0.97  32 partition(A,B) | member(f6(A,B),A) | member(f7(A,B),B) | f9(A,B) != f8(A,B) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,A) | subset(C,B).  [resolve(32,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,B) | member(f5(A,B,C),A).  [resolve(32,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(32,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(32,a,28,a)].
% 0.41/0.97  33 partition(A,B) | member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,A) | subset(D,B).  [resolve(33,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,B) | member(f5(A,B,D),A).  [resolve(33,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(33,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(33,a,28,a)].
% 0.41/0.97  34 partition(A,B) | member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,A) | subset(D,B).  [resolve(34,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,B) | member(f5(A,B,D),A).  [resolve(34,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(34,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(34,a,28,a)].
% 0.41/0.97  35 partition(A,B) | member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,A) | subset(D,B).  [resolve(35,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,B) | member(f5(A,B,D),A).  [resolve(35,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(35,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(35,a,28,a)].
% 0.41/0.97  36 partition(A,B) | member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,A) | subset(D,B).  [resolve(36,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,B) | member(f5(A,B,D),A).  [resolve(36,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(36,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(36,a,28,a)].
% 0.41/0.97  37 partition(A,B) | member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,A) | subset(D,B).  [resolve(37,a,25,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,B) | member(f5(A,B,D),A).  [resolve(37,a,26,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(37,a,27,a)].
% 0.41/0.97  Derived: member(f6(A,B),A) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(37,a,28,a)].
% 0.41/0.97  38 partition(A,B) | -subset(f6(A,B),B) | member(f7(A,B),B) | member(f8(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,A) | subset(C,B).  [resolve(38,a,25,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,B) | member(f5(A,B,C),A).  [resolve(38,a,26,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(38,a,27,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(38,a,28,a)].
% 0.41/0.97  39 partition(A,B) | -subset(f6(A,B),B) | member(f7(A,B),B) | member(f9(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,A) | subset(C,B).  [resolve(39,a,25,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,B) | member(f5(A,B,C),A).  [resolve(39,a,26,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(39,a,27,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(39,a,28,a)].
% 0.41/0.97  40 partition(A,B) | -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,A) | subset(C,B).  [resolve(40,a,25,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,B) | member(f5(A,B,C),A).  [resolve(40,a,26,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(40,a,27,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f8(A,B)) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(40,a,28,a)].
% 0.41/0.97  41 partition(A,B) | -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,A) | subset(C,B).  [resolve(41,a,25,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,B) | member(f5(A,B,C),A).  [resolve(41,a,26,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(41,a,27,a)].
% 0.41/0.97  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f10(A,B),f9(A,B)) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(41,a,28,a)].
% 0.41/0.97  42 partition(A,B) | -subset(f6(A,B),B) | member(f7(A,B),B) | f9(A,B) != f8(A,B) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,A) | subset(C,B).  [resolve(42,a,25,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,B) | member(f5(A,B,C),A).  [resolve(42,a,26,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,B) | member(C,f5(A,B,C)).  [resolve(42,a,27,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C.  [resolve(42,a,28,a)].
% 0.41/0.98  43 partition(A,B) | -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,A) | subset(D,B).  [resolve(43,a,25,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,B) | member(f5(A,B,D),A).  [resolve(43,a,26,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(43,a,27,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f8(A,B),A) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(43,a,28,a)].
% 0.41/0.98  44 partition(A,B) | -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,A) | subset(D,B).  [resolve(44,a,25,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,B) | member(f5(A,B,D),A).  [resolve(44,a,26,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(44,a,27,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f9(A,B),A) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(44,a,28,a)].
% 0.41/0.98  45 partition(A,B) | -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,A) | subset(D,B).  [resolve(45,a,25,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,B) | member(f5(A,B,D),A).  [resolve(45,a,26,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(45,a,27,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f8(A,B)) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(45,a,28,a)].
% 0.41/0.98  46 partition(A,B) | -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,A) | subset(D,B).  [resolve(46,a,25,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,B) | member(f5(A,B,D),A).  [resolve(46,a,26,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(46,a,27,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | member(f10(A,B),f9(A,B)) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(46,a,28,a)].
% 0.41/0.98  47 partition(A,B) | -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) # label(partition) # label(axiom).  [clausify(13)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,A) | subset(D,B).  [resolve(47,a,25,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,B) | member(f5(A,B,D),A).  [resolve(47,a,26,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,B) | member(D,f5(A,B,D)).  [resolve(47,a,27,a)].
% 0.41/0.98  Derived: -subset(f6(A,B),B) | -member(C,A) | -member(f7(A,B),C) | f9(A,B) != f8(A,B) | -member(D,A) | -member(E,A) | -member(F,D) | -member(F,E) | E = D.  [resolve(47,a,28,a)].
% 0.41/0.98  48 pre_order(A,B) | member(f17(A,B),B) | member(f18(A,B),B) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  49 -pre_order(A,B) | -member(C,B) | apply(A,C,C) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  50 -pre_order(A,B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: member(f17(A,B),B) | member(f18(A,B),B) | -member(C,B) | apply(A,C,C).  [resolve(48,a,49,a)].
% 0.41/0.98  Derived: member(f17(A,B),B) | member(f18(A,B),B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(48,a,50,a)].
% 0.41/0.98  51 pre_order(A,B) | member(f17(A,B),B) | member(f19(A,B),B) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: member(f17(A,B),B) | member(f19(A,B),B) | -member(C,B) | apply(A,C,C).  [resolve(51,a,49,a)].
% 0.41/0.98  Derived: member(f17(A,B),B) | member(f19(A,B),B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(51,a,50,a)].
% 0.41/0.98  52 pre_order(A,B) | member(f17(A,B),B) | member(f20(A,B),B) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: member(f17(A,B),B) | member(f20(A,B),B) | -member(C,B) | apply(A,C,C).  [resolve(52,a,49,a)].
% 0.41/0.98  Derived: member(f17(A,B),B) | member(f20(A,B),B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(52,a,50,a)].
% 0.41/0.98  53 pre_order(A,B) | member(f17(A,B),B) | apply(A,f18(A,B),f19(A,B)) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: member(f17(A,B),B) | apply(A,f18(A,B),f19(A,B)) | -member(C,B) | apply(A,C,C).  [resolve(53,a,49,a)].
% 0.41/0.98  Derived: member(f17(A,B),B) | apply(A,f18(A,B),f19(A,B)) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(53,a,50,a)].
% 0.41/0.98  54 pre_order(A,B) | member(f17(A,B),B) | apply(A,f19(A,B),f20(A,B)) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: member(f17(A,B),B) | apply(A,f19(A,B),f20(A,B)) | -member(C,B) | apply(A,C,C).  [resolve(54,a,49,a)].
% 0.41/0.98  Derived: member(f17(A,B),B) | apply(A,f19(A,B),f20(A,B)) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(54,a,50,a)].
% 0.41/0.98  55 pre_order(A,B) | member(f17(A,B),B) | -apply(A,f18(A,B),f20(A,B)) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: member(f17(A,B),B) | -apply(A,f18(A,B),f20(A,B)) | -member(C,B) | apply(A,C,C).  [resolve(55,a,49,a)].
% 0.41/0.98  Derived: member(f17(A,B),B) | -apply(A,f18(A,B),f20(A,B)) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(55,a,50,a)].
% 0.41/0.98  56 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | member(f18(A,B),B) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: -apply(A,f17(A,B),f17(A,B)) | member(f18(A,B),B) | -member(C,B) | apply(A,C,C).  [resolve(56,a,49,a)].
% 0.41/0.98  Derived: -apply(A,f17(A,B),f17(A,B)) | member(f18(A,B),B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(56,a,50,a)].
% 0.41/0.98  57 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | member(f19(A,B),B) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: -apply(A,f17(A,B),f17(A,B)) | member(f19(A,B),B) | -member(C,B) | apply(A,C,C).  [resolve(57,a,49,a)].
% 0.41/0.98  Derived: -apply(A,f17(A,B),f17(A,B)) | member(f19(A,B),B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(57,a,50,a)].
% 0.41/0.98  58 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | member(f20(A,B),B) # label(pre_order) # label(axiom).  [clausify(16)].
% 0.41/0.98  Derived: -apply(A,f17(A,B),f17(A,B)) | member(f20(A,B),B) | -member(C,B) | apply(A,C,C).  [resolve(58,a,49,a)].
% 0.41/0.98  Derived: -apply(A,f17(A,B),f17(A,B)) | member(f20(A,B),B) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(58,a,50,a)].
% 2.14/2.43  59 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | apply(A,f18(A,B),f19(A,B)) # label(pre_order) # label(axiom).  [clausify(16)].
% 2.14/2.43  Derived: -apply(A,f17(A,B),f17(A,B)) | apply(A,f18(A,B),f19(A,B)) | -member(C,B) | apply(A,C,C).  [resolve(59,a,49,a)].
% 2.14/2.43  Derived: -apply(A,f17(A,B),f17(A,B)) | apply(A,f18(A,B),f19(A,B)) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(59,a,50,a)].
% 2.14/2.43  60 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | apply(A,f19(A,B),f20(A,B)) # label(pre_order) # label(axiom).  [clausify(16)].
% 2.14/2.43  Derived: -apply(A,f17(A,B),f17(A,B)) | apply(A,f19(A,B),f20(A,B)) | -member(C,B) | apply(A,C,C).  [resolve(60,a,49,a)].
% 2.14/2.43  Derived: -apply(A,f17(A,B),f17(A,B)) | apply(A,f19(A,B),f20(A,B)) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(60,a,50,a)].
% 2.14/2.43  61 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | -apply(A,f18(A,B),f20(A,B)) # label(pre_order) # label(axiom).  [clausify(16)].
% 2.14/2.43  Derived: -apply(A,f17(A,B),f17(A,B)) | -apply(A,f18(A,B),f20(A,B)) | -member(C,B) | apply(A,C,C).  [resolve(61,a,49,a)].
% 2.14/2.43  Derived: -apply(A,f17(A,B),f17(A,B)) | -apply(A,f18(A,B),f20(A,B)) | -member(C,B) | -member(D,B) | -member(E,B) | -apply(A,C,D) | -apply(A,D,E) | apply(A,C,E).  [resolve(61,a,50,a)].
% 2.14/2.43  
% 2.14/2.43  ============================== end predicate elimination =============
% 2.14/2.43  
% 2.14/2.43  Auto_denials:  (non-Horn, no changes).
% 2.14/2.43  
% 2.14/2.43  Term ordering decisions:
% 2.14/2.43  Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. intersection=1. union=1. unordered_pair=1. difference=1. f1=1. f2=1. f3=1. f4=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. product=1. sum=1. power_set=1. singleton=1. equivalence_class=1. f5=1.
% 2.14/2.43  
% 2.14/2.43  ============================== end of process initial clauses ========
% 2.14/2.43  
% 2.14/2.43  ============================== CLAUSES FOR SEARCH ====================
% 2.14/2.43  
% 2.14/2.43  ============================== end of clauses for search =============
% 2.14/2.43  
% 2.14/2.43  ============================== SEARCH ================================
% 2.14/2.43  
% 2.14/2.43  % Starting search at 0.11 seconds.
% 2.14/2.43  
% 2.14/2.43  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.30 sec).
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=53.000, iters=4111
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=51.000, iters=4041
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=47.000, iters=3751
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=45.000, iters=3631
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=41.000, iters=3468
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=39.000, iters=3335
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=38.000, iters=3356
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=34.000, iters=4528
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=32.000, iters=3529
% 2.14/2.43  
% 2.14/2.43  Low Water (keep): wt=31.000, iters=3341
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4762, wt=94.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4888, wt=93.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4782, wt=92.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4907, wt=91.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4759, wt=90.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4779, wt=88.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4731, wt=87.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4780, wt=86.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4764, wt=85.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5509, wt=84.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4784, wt=83.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5537, wt=82.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5470, wt=81.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4887, wt=80.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5478, wt=79.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4906, wt=78.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4890, wt=77.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5679, wt=76.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4911, wt=75.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5703, wt=74.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4917, wt=73.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4914, wt=72.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4921, wt=71.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4846, wt=70.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4736, wt=69.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4926, wt=68.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5682, wt=67.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4933, wt=66.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5708, wt=65.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5680, wt=64.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5723, wt=63.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=5705, wt=62.000
% 2.14/2.43  
% 2.14/2.43  Low Water (displace): id=4848, wt=61.000
% 2.14/2.43  
% 2.14/2.43  Low Water (diCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------