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

View Problem - Process Solution

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

% Computer : n004.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:32:16 EDT 2022

% Result   : Timeout 300.04s 300.32s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET817+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 18:47:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/1.03  ============================== Prover9 ===============================
% 0.45/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03  Process 4193 was started by sandbox on n004.cluster.edu,
% 0.45/1.03  Sun Jul 10 18:47:38 2022
% 0.45/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4038_n004.cluster.edu".
% 0.45/1.03  ============================== end of head ===========================
% 0.45/1.03  
% 0.45/1.03  ============================== INPUT =================================
% 0.45/1.03  
% 0.45/1.03  % Reading from file /tmp/Prover9_4038_n004.cluster.edu
% 0.45/1.03  
% 0.45/1.03  set(prolog_style_variables).
% 0.45/1.03  set(auto2).
% 0.45/1.03      % set(auto2) -> set(auto).
% 0.45/1.03      % set(auto) -> set(auto_inference).
% 0.45/1.03      % set(auto) -> set(auto_setup).
% 0.45/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03      % set(auto) -> set(auto_limits).
% 0.45/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03      % set(auto) -> set(auto_denials).
% 0.45/1.03      % set(auto) -> set(auto_process).
% 0.45/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03      % set(auto2) -> assign(stats, some).
% 0.45/1.03      % set(auto2) -> clear(echo_input).
% 0.45/1.03      % set(auto2) -> set(quiet).
% 0.45/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03      % set(auto2) -> clear(print_given).
% 0.45/1.03  assign(lrs_ticks,-1).
% 0.45/1.03  assign(sos_limit,10000).
% 0.45/1.03  assign(order,kbo).
% 0.45/1.03  set(lex_order_vars).
% 0.45/1.03  clear(print_given).
% 0.45/1.03  
% 0.45/1.03  % formulas(sos).  % not echoed (23 formulas)
% 0.45/1.03  
% 0.45/1.03  ============================== end of input ==========================
% 0.45/1.03  
% 0.45/1.03  % From the command line: assign(max_seconds, 300).
% 0.45/1.03  
% 0.45/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03  
% 0.45/1.03  % Formulas that are not ordinary clauses:
% 0.45/1.03  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.45/1.03  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.45/1.03  3 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  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.45/1.03  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.45/1.03  6 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  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.45/1.03  8 (all X all A (member(X,singleton(A)) <-> X = A)) # label(singleton) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  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.45/1.03  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.45/1.03  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.45/1.03  12 (all A (member(A,on) <-> set(A) & strict_well_order(member_predicate,A) & (all X (member(X,A) -> subset(X,A))))) # label(ordinal_number) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  13 (all R all E (strict_well_order(R,E) <-> strict_order(R,E) & (all A (subset(A,E) & (exists X member(X,A)) -> (exists Y least(Y,R,A)))))) # label(strict_well_order) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  14 (all R all E all M (least(M,R,E) <-> member(M,E) & (all X (member(X,E) -> M = X | apply(R,M,X))))) # label(least) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  15 (all X all Y (apply(member_predicate,X,Y) <-> member(X,Y))) # label(rel_member) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  16 (all R all E (strict_order(R,E) <-> (all X all Y (member(X,E) & member(Y,E) -> -(apply(R,X,Y) & apply(R,Y,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(strict_order) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  17 (all X (set(X) -> (all Y (member(Y,X) -> set(Y))))) # label(set_member) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  18 (all X all R all A all Y (member(Y,initial_segment(X,R,A)) <-> member(Y,A) & apply(R,Y,X))) # label(initial_segment) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  19 (all A all X (member(X,suc(A)) <-> member(X,union(A,singleton(A))))) # label(successor) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  20 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(thI3) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  21 (all X (set(X) -> set(product(X)))) # label(set_product) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  22 (all A all X (member(X,A) -> subset(product(A),X))) # label(thI42) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  23 -(all A (subset(A,on) & set(A) & (exists X member(X,A)) -> member(product(A),on))) # label(thV21) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.45/1.03  
% 0.45/1.03  ============================== end of process non-clausal formulas ===
% 0.45/1.03  
% 0.45/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03  
% 0.45/1.03  ============================== PREDICATE ELIMINATION =================
% 0.45/1.03  24 -strict_order(A,B) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  25 strict_order(A,B) | member(f9(A,B),B) | member(f11(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  26 strict_order(A,B) | member(f9(A,B),B) | member(f12(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  27 strict_order(A,B) | member(f9(A,B),B) | member(f13(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  28 strict_order(A,B) | member(f10(A,B),B) | member(f11(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  29 strict_order(A,B) | member(f10(A,B),B) | member(f12(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  30 strict_order(A,B) | member(f10(A,B),B) | member(f13(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  31 strict_order(A,B) | member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  32 strict_order(A,B) | member(f9(A,B),B) | apply(A,f12(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  33 strict_order(A,B) | member(f10(A,B),B) | apply(A,f11(A,B),f12(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  34 strict_order(A,B) | member(f10(A,B),B) | apply(A,f12(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  35 strict_order(A,B) | apply(A,f9(A,B),f10(A,B)) | member(f11(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  36 strict_order(A,B) | apply(A,f9(A,B),f10(A,B)) | member(f12(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  37 strict_order(A,B) | apply(A,f9(A,B),f10(A,B)) | member(f13(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  38 strict_order(A,B) | apply(A,f10(A,B),f9(A,B)) | member(f11(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  39 strict_order(A,B) | apply(A,f10(A,B),f9(A,B)) | member(f12(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  40 strict_order(A,B) | apply(A,f10(A,B),f9(A,B)) | member(f13(A,B),B) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  41 strict_order(A,B) | apply(A,f9(A,B),f10(A,B)) | apply(A,f11(A,B),f12(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.45/1.03  42 strict_order(A,B) | apply(A,f9(A,B),f10(A,B)) | apply(A,f12(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.03  43 strict_order(A,B) | apply(A,f10(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.03  44 strict_order(A,B) | apply(A,f10(A,B),f9(A,B)) | apply(A,f12(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f9(D,B),B) | member(f11(D,B),B).  [resolve(24,a,25,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f9(D,B),B) | member(f12(D,B),B).  [resolve(24,a,26,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f9(D,B),B) | member(f13(D,B),B).  [resolve(24,a,27,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f10(D,B),B) | member(f11(D,B),B).  [resolve(24,a,28,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f10(D,B),B) | member(f12(D,B),B).  [resolve(24,a,29,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f10(D,B),B) | member(f13(D,B),B).  [resolve(24,a,30,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f9(D,B),B) | apply(D,f11(D,B),f12(D,B)).  [resolve(24,a,31,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f9(D,B),B) | apply(D,f12(D,B),f13(D,B)).  [resolve(24,a,32,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f10(D,B),B) | apply(D,f11(D,B),f12(D,B)).  [resolve(24,a,33,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | member(f10(D,B),B) | apply(D,f12(D,B),f13(D,B)).  [resolve(24,a,34,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f9(D,B),f10(D,B)) | member(f11(D,B),B).  [resolve(24,a,35,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f9(D,B),f10(D,B)) | member(f12(D,B),B).  [resolve(24,a,36,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f9(D,B),f10(D,B)) | member(f13(D,B),B).  [resolve(24,a,37,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f10(D,B),f9(D,B)) | member(f11(D,B),B).  [resolve(24,a,38,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f10(D,B),f9(D,B)) | member(f12(D,B),B).  [resolve(24,a,39,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f10(D,B),f9(D,B)) | member(f13(D,B),B).  [resolve(24,a,40,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f9(D,B),f10(D,B)) | apply(D,f11(D,B),f12(D,B)).  [resolve(24,a,41,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f9(D,B),f10(D,B)) | apply(D,f12(D,B),f13(D,B)).  [resolve(24,a,42,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f10(D,B),f9(D,B)) | apply(D,f11(D,B),f12(D,B)).  [resolve(24,a,43,a)].
% 0.77/1.03  Derived: -member(A,B) | -member(C,B) | -apply(D,A,C) | -apply(D,C,A) | apply(D,f10(D,B),f9(D,B)) | apply(D,f12(D,B),f13(D,B)).  [resolve(24,a,44,a)].
% 0.77/1.03  45 -strict_well_order(A,B) | strict_order(A,B) # label(strict_well_order) # label(axiom).  [clausify(13)].
% 0.77/1.03  Derived: -strict_well_order(A,B) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C).  [resolve(45,b,24,a)].
% 0.77/1.03  46 strict_well_order(A,B) | -strict_order(A,B) | subset(f6(A,B),B) # label(strict_well_order) # label(axiom).  [clausify(13)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | member(f11(A,B),B).  [resolve(46,b,25,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | member(f12(A,B),B).  [resolve(46,b,26,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | member(f13(A,B),B).  [resolve(46,b,27,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | member(f11(A,B),B).  [resolve(46,b,28,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | member(f12(A,B),B).  [resolve(46,b,29,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | member(f13(A,B),B).  [resolve(46,b,30,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)).  [resolve(46,b,31,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | apply(A,f12(A,B),f13(A,B)).  [resolve(46,b,32,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | apply(A,f11(A,B),f12(A,B)).  [resolve(46,b,33,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | apply(A,f12(A,B),f13(A,B)).  [resolve(46,b,34,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f9(A,B),f10(A,B)) | member(f11(A,B),B).  [resolve(46,b,35,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f9(A,B),f10(A,B)) | member(f12(A,B),B).  [resolve(46,b,36,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f9(A,B),f10(A,B)) | member(f13(A,B),B).  [resolve(46,b,37,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f10(A,B),f9(A,B)) | member(f11(A,B),B).  [resolve(46,b,38,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f10(A,B),f9(A,B)) | member(f12(A,B),B).  [resolve(46,b,39,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f10(A,B),f9(A,B)) | member(f13(A,B),B).  [resolve(46,b,40,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f9(A,B),f10(A,B)) | apply(A,f11(A,B),f12(A,B)).  [resolve(46,b,41,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f9(A,B),f10(A,B)) | apply(A,f12(A,B),f13(A,B)).  [resolve(46,b,42,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f10(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)).  [resolve(46,b,43,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | subset(f6(A,B),B) | apply(A,f10(A,B),f9(A,B)) | apply(A,f12(A,B),f13(A,B)).  [resolve(46,b,44,a)].
% 0.77/1.03  47 strict_well_order(A,B) | -strict_order(A,B) | -least(C,A,f6(A,B)) # label(strict_well_order) # label(axiom).  [clausify(13)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | member(f11(A,B),B).  [resolve(47,b,25,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | member(f12(A,B),B).  [resolve(47,b,26,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | member(f13(A,B),B).  [resolve(47,b,27,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | member(f11(A,B),B).  [resolve(47,b,28,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | member(f12(A,B),B).  [resolve(47,b,29,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | member(f13(A,B),B).  [resolve(47,b,30,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)).  [resolve(47,b,31,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | apply(A,f12(A,B),f13(A,B)).  [resolve(47,b,32,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | apply(A,f11(A,B),f12(A,B)).  [resolve(47,b,33,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | apply(A,f12(A,B),f13(A,B)).  [resolve(47,b,34,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | member(f11(A,B),B).  [resolve(47,b,35,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | member(f12(A,B),B).  [resolve(47,b,36,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | member(f13(A,B),B).  [resolve(47,b,37,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | member(f11(A,B),B).  [resolve(47,b,38,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | member(f12(A,B),B).  [resolve(47,b,39,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | member(f13(A,B),B).  [resolve(47,b,40,a)].
% 0.77/1.03  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | apply(A,f11(A,B),f12(A,B)).  [resolve(47,b,41,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | apply(A,f12(A,B),f13(A,B)).  [resolve(47,b,42,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)).  [resolve(47,b,43,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | apply(A,f12(A,B),f13(A,B)).  [resolve(47,b,44,a)].
% 0.77/1.04  48 strict_well_order(A,B) | -strict_order(A,B) | member(f7(A,B),f6(A,B)) # label(strict_well_order) # label(axiom).  [clausify(13)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | member(f11(A,B),B).  [resolve(48,b,25,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | member(f12(A,B),B).  [resolve(48,b,26,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | member(f13(A,B),B).  [resolve(48,b,27,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | member(f11(A,B),B).  [resolve(48,b,28,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | member(f12(A,B),B).  [resolve(48,b,29,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | member(f13(A,B),B).  [resolve(48,b,30,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)).  [resolve(48,b,31,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | apply(A,f12(A,B),f13(A,B)).  [resolve(48,b,32,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | apply(A,f11(A,B),f12(A,B)).  [resolve(48,b,33,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | apply(A,f12(A,B),f13(A,B)).  [resolve(48,b,34,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | member(f11(A,B),B).  [resolve(48,b,35,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | member(f12(A,B),B).  [resolve(48,b,36,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | member(f13(A,B),B).  [resolve(48,b,37,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | member(f11(A,B),B).  [resolve(48,b,38,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | member(f12(A,B),B).  [resolve(48,b,39,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | member(f13(A,B),B).  [resolve(48,b,40,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | apply(A,f11(A,B),f12(A,B)).  [resolve(48,b,41,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f9(A,B),f10(A,B)) | apply(A,f12(A,B),f13(A,B)).  [resolve(48,b,42,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)).  [resolve(48,b,43,a)].
% 0.77/1.04  Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | apply(A,f10(A,B),f9(A,B)) | apply(A,f12(A,B),f13(A,B)).  [resolve(48,b,44,a)].
% 0.77/1.04  49 strict_order(A,B) | member(f9(A,B),B) | -apply(A,f11(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.04  Derived: member(f9(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C).  [resolve(49,a,24,a)].
% 0.77/1.04  Derived: member(f9(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | subset(f6(A,B),B).  [resolve(49,a,46,b)].
% 0.77/1.04  Derived: member(f9(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | -least(C,A,f6(A,B)).  [resolve(49,a,47,b)].
% 0.77/1.04  Derived: member(f9(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | member(f7(A,B),f6(A,B)).  [resolve(49,a,48,b)].
% 0.77/1.04  50 strict_order(A,B) | member(f10(A,B),B) | -apply(A,f11(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.04  Derived: member(f10(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C).  [resolve(50,a,24,a)].
% 0.77/1.04  Derived: member(f10(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | subset(f6(A,B),B).  [resolve(50,a,46,b)].
% 0.77/1.04  Derived: member(f10(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | -least(C,A,f6(A,B)).  [resolve(50,a,47,b)].
% 0.77/1.04  Derived: member(f10(A,B),B) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | member(f7(A,B),f6(A,B)).  [resolve(50,a,48,b)].
% 0.77/1.04  51 strict_order(A,B) | apply(A,f9(A,B),f10(A,B)) | -apply(A,f11(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.04  Derived: apply(A,f9(A,B),f10(A,B)) | -apply(A,f11(A,B),f13(A,B)) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C).  [resolve(51,a,24,a)].
% 0.77/1.04  Derived: apply(A,f9(A,B),f10(A,B)) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | subset(f6(A,B),B).  [resolve(51,a,46,b)].
% 0.77/1.04  Derived: apply(A,f9(A,B),f10(A,B)) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | -least(C,A,f6(A,B)).  [resolve(51,a,47,b)].
% 0.77/1.04  Derived: apply(A,f9(A,B),f10(A,B)) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | member(f7(A,B),f6(A,B)).  [resolve(51,a,48,b)].
% 0.77/1.04  52 strict_order(A,B) | apply(A,f10(A,B),f9(A,B)) | -apply(A,f11(A,B),f13(A,B)) # label(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.04  Derived: apply(A,f10(A,B),f9(A,B)) | -apply(A,f11(A,B),f13(A,B)) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C).  [resolve(52,a,24,a)].
% 0.77/1.04  Derived: apply(A,f10(A,B),f9(A,B)) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | subset(f6(A,B),B).  [resolve(52,a,46,b)].
% 0.77/1.04  Derived: apply(A,f10(A,B),f9(A,B)) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | -least(C,A,f6(A,B)).  [resolve(52,a,47,b)].
% 0.77/1.04  Derived: apply(A,f10(A,B),f9(A,B)) | -apply(A,f11(A,B),f13(A,B)) | strict_well_order(A,B) | member(f7(A,B),f6(A,B)).  [resolve(52,a,48,b)].
% 0.77/1.04  53 -strict_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(strict_order) # label(axiom).  [clausify(16)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f9(E,B),B) | member(f11(E,B),B).  [resolve(53,a,25,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f9(E,B),B) | member(f12(E,B),B).  [resolve(53,a,26,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f9(E,B),B) | member(f13(E,B),B).  [resolve(53,a,27,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f10(E,B),B) | member(f11(E,B),B).  [resolve(53,a,28,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f10(E,B),B) | member(f12(E,B),B).  [resolve(53,a,29,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f10(E,B),B) | member(f13(E,B),B).  [resolve(53,a,30,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f9(E,B),B) | apply(E,f11(E,B),f12(E,B)).  [resolve(53,a,31,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f9(E,B),B) | apply(E,f12(E,B),f13(E,B)).  [resolve(53,a,32,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f10(E,B),B) | apply(E,f11(E,B),f12(E,B)).  [resolve(53,a,33,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f10(E,B),B) | apply(E,f12(E,B),f13(E,B)).  [resolve(53,a,34,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f9(E,B),f10(E,B)) | member(f11(E,B),B).  [resolve(53,a,35,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f9(E,B),f10(E,B)) | member(f12(E,B),B).  [resolve(53,a,36,a)].
% 0.77/1.04  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f9(E,B),f10(E,B)) | member(f13(E,B),B).  [resolve(53,a,37,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f10(E,B),f9(E,B)) | member(f11(E,B),B).  [resolve(53,a,38,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f10(E,B),f9(E,B)) | member(f12(E,B),B).  [resolve(53,a,39,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f10(E,B),f9(E,B)) | member(f13(E,B),B).  [resolve(53,a,40,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f9(E,B),f10(E,B)) | apply(E,f11(E,B),f12(E,B)).  [resolve(53,a,41,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f9(E,B),f10(E,B)) | apply(E,f12(E,B),f13(E,B)).  [resolve(53,a,42,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f10(E,B),f9(E,B)) | apply(E,f11(E,B),f12(E,B)).  [resolve(53,a,43,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f10(E,B),f9(E,B)) | apply(E,f12(E,B),f13(E,B)).  [resolve(53,a,44,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | -strict_well_order(E,B).  [resolve(53,a,45,b)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f9(E,B),B) | -apply(E,f11(E,B),f13(E,B)).  [resolve(53,a,49,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | member(f10(E,B),B) | -apply(E,f11(E,B),f13(E,B)).  [resolve(53,a,50,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f9(E,B),f10(E,B)) | -apply(E,f11(E,B),f13(E,B)).  [resolve(53,a,51,a)].
% 1.75/2.05  Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,A,C) | -apply(E,C,D) | apply(E,A,D) | apply(E,f10(E,B),f9(E,B)) | -apply(E,f11(E,B),f13(E,B)).  [resolve(53,a,52,a)].
% 1.75/2.05  54 equal_set(A,B) | -subset(A,B) | -subset(B,A) # label(equal_set) # label(axiom).  [clausify(2)].
% 1.75/2.05  55 -equal_set(A,B) | subset(A,B) # label(equal_set) # label(axiom).  [clausify(2)].
% 1.75/2.05  56 -equal_set(A,B) | subset(B,A) # label(equal_set) # label(axiom).  [clausify(2)].
% 1.75/2.05  
% 1.75/2.05  ============================== end predicate elimination =============
% 1.75/2.05  
% 1.75/2.05  Auto_denials:  (non-Horn, no changes).
% 1.75/2.05  
% 1.75/2.05  Term ordering decisions:
% 1.75/2.05  Function symbol KB weights:  on=1. member_predicate=1. empty_set=1. c1=1. c2=1. union=1. intersection=1. unordered_pair=1. difference=1. f1=1. f2=1. f3=1. f6=1. f7=1. f9=1. f10=1. f11=1. f12=1. f13=1. product=1. singleton=1. sum=1. power_set=1. suc=1. f4=1. initial_segment=1. f5=1. f8=1.
% 1.75/2.05  
% 1.75/2.05  ============================== end of process initial clauses ========
% 1.75/2.05  
% 1.75/2.05  ============================== CLAUSES FOR SEARCH ====================
% 1.75/2.05  
% 1.75/2.05  ============================== end of clauses for search =============
% 1.75/2.05  
% 1.75/2.05  ============================== SEARCH ================================
% 1.75/2.05  
% 1.75/2.05  % Starting search at 0.06 seconds.
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=58.000, iters=5790
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=55.000, iters=5493
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=50.000, iters=4575
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=47.000, iters=4143
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=44.000, iters=3810
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=43.000, iters=3612
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=40.000, iters=3364
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=37.000, iters=3605
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=34.000, iters=3336
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=32.000, iters=3391
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=31.000, iters=3429
% 1.75/2.05  
% 1.75/2.05  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 58 (0.00 of 0.73 sec).
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=30.000, iters=3877
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=27.000, iters=3497
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=26.000, iters=3556
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=19.000, iters=3402
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=17.000, iters=3457
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=16.000, iters=3514
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=15.000, iters=3342
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=14.000, iters=3351
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=13.000, iters=3337
% 1.75/2.05  
% 1.75/2.05  Low Water (keep): wt=12.000, iters=3342
% 1.75/2.05  
% 1.75/2.05  Low WaCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------