TSTP Solution File: SET806+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET806+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:13 EDT 2022
% Result : Timeout 300.09s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET806+4 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n005.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 : Sat Jul 9 16:31:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.00 ============================== Prover9 ===============================
% 0.71/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.00 Process 22736 was started by sandbox2 on n005.cluster.edu,
% 0.71/1.00 Sat Jul 9 16:31:22 2022
% 0.71/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22403_n005.cluster.edu".
% 0.71/1.00 ============================== end of head ===========================
% 0.71/1.00
% 0.71/1.00 ============================== INPUT =================================
% 0.71/1.00
% 0.71/1.00 % Reading from file /tmp/Prover9_22403_n005.cluster.edu
% 0.71/1.00
% 0.71/1.00 set(prolog_style_variables).
% 0.71/1.00 set(auto2).
% 0.71/1.00 % set(auto2) -> set(auto).
% 0.71/1.00 % set(auto) -> set(auto_inference).
% 0.71/1.00 % set(auto) -> set(auto_setup).
% 0.71/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.00 % set(auto) -> set(auto_limits).
% 0.71/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.00 % set(auto) -> set(auto_denials).
% 0.71/1.00 % set(auto) -> set(auto_process).
% 0.71/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.00 % set(auto2) -> assign(stats, some).
% 0.71/1.00 % set(auto2) -> clear(echo_input).
% 0.71/1.00 % set(auto2) -> set(quiet).
% 0.71/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.00 % set(auto2) -> clear(print_given).
% 0.71/1.00 assign(lrs_ticks,-1).
% 0.71/1.00 assign(sos_limit,10000).
% 0.71/1.00 assign(order,kbo).
% 0.71/1.00 set(lex_order_vars).
% 0.71/1.00 clear(print_given).
% 0.71/1.00
% 0.71/1.00 % formulas(sos). % not echoed (18 formulas)
% 0.71/1.00
% 0.71/1.00 ============================== end of input ==========================
% 0.71/1.00
% 0.71/1.00 % From the command line: assign(max_seconds, 300).
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.00
% 0.71/1.00 % Formulas that are not ordinary clauses:
% 0.71/1.00 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.71/1.00 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.71/1.00 3 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 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.71/1.00 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.71/1.00 6 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 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.71/1.00 8 (all X all A (member(X,singleton(A)) <-> X = A)) # label(singleton) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 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.71/1.00 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.71/1.00 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.71/1.00 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.71/1.00 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.74/1.00 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.74/1.00 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.74/1.00 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.74/1.00 17 (all X all Y (apply(equal_set_predicate,X,Y) <-> equal_set(X,Y))) # label(rel_equal_set) # label(hypothesis) # label(non_clause). [assumption].
% 0.74/1.00 18 -(all E equivalence(equal_set_predicate,power_set(E))) # label(thIII13) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 19 equal_set(A,B) | -subset(A,B) | -subset(B,A) # label(equal_set) # label(axiom). [clausify(2)].
% 0.74/1.00 20 -equal_set(A,B) | subset(A,B) # label(equal_set) # label(axiom). [clausify(2)].
% 0.74/1.00 21 -equal_set(A,B) | subset(B,A) # label(equal_set) # label(axiom). [clausify(2)].
% 0.74/1.00 22 -apply(equal_set_predicate,A,B) | equal_set(A,B) # label(rel_equal_set) # label(hypothesis). [clausify(17)].
% 0.74/1.00 Derived: -apply(equal_set_predicate,A,B) | subset(A,B). [resolve(22,b,20,a)].
% 0.74/1.00 Derived: -apply(equal_set_predicate,A,B) | subset(B,A). [resolve(22,b,21,a)].
% 0.74/1.00 23 apply(equal_set_predicate,A,B) | -equal_set(A,B) # label(rel_equal_set) # label(hypothesis). [clausify(17)].
% 0.74/1.00 Derived: apply(equal_set_predicate,A,B) | -subset(A,B) | -subset(B,A). [resolve(23,b,19,a)].
% 0.74/1.00 24 disjoint(A,B) | member(f4(A,B),A) # label(disjoint) # label(axiom). [clausify(12)].
% 0.74/1.00 25 -disjoint(A,B) | -member(C,A) | -member(C,B) # label(disjoint) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: member(f4(A,B),A) | -member(C,A) | -member(C,B). [resolve(24,a,25,a)].
% 0.74/1.00 26 disjoint(A,B) | member(f4(A,B),B) # label(disjoint) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: member(f4(A,B),B) | -member(C,A) | -member(C,B). [resolve(26,a,25,a)].
% 0.74/1.00 27 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.74/1.00 28 -partition(A,B) | -member(C,A) | subset(C,B) # label(partition) # label(axiom). [clausify(13)].
% 0.74/1.00 29 -partition(A,B) | -member(C,B) | member(f5(A,B,C),A) # label(partition) # label(axiom). [clausify(13)].
% 0.74/1.00 30 -partition(A,B) | -member(C,B) | member(C,f5(A,B,C)) # label(partition) # label(axiom). [clausify(13)].
% 0.74/1.00 31 -partition(A,B) | -member(C,A) | -member(D,A) | -member(E,C) | -member(E,D) | D = C # label(partition) # label(axiom). [clausify(13)].
% 0.74/1.00 Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,A) | subset(C,B). [resolve(27,a,28,a)].
% 0.74/1.00 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(27,a,29,a)].
% 0.74/1.00 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(27,a,30,a)].
% 0.74/1.00 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(27,a,31,a)].
% 0.74/1.00 32 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.74/1.00 Derived: member(f6(A,B),A) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,A) | subset(C,B). [resolve(32,a,28,a)].
% 0.74/1.00 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(32,a,29,a)].
% 0.74/1.00 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(32,a,30,a)].
% 0.74/1.00 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(32,a,31,a)].
% 0.74/1.00 33 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.74/1.00 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(33,a,28,a)].
% 0.74/1.00 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(33,a,29,a)].
% 0.74/1.00 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(33,a,30,a)].
% 0.74/1.00 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(33,a,31,a)].
% 0.74/1.00 34 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.74/1.00 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(34,a,28,a)].
% 0.74/1.00 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(34,a,29,a)].
% 0.74/1.00 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(34,a,30,a)].
% 0.74/1.00 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(34,a,31,a)].
% 0.74/1.00 35 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.74/1.00 Derived: member(f6(A,B),A) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,A) | subset(C,B). [resolve(35,a,28,a)].
% 0.74/1.00 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(35,a,29,a)].
% 0.74/1.00 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(35,a,30,a)].
% 0.74/1.00 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(35,a,31,a)].
% 0.74/1.00 36 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.74/1.00 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(36,a,28,a)].
% 0.74/1.00 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(36,a,29,a)].
% 0.74/1.00 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(36,a,30,a)].
% 0.74/1.00 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(36,a,31,a)].
% 0.74/1.00 37 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.74/1.00 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(37,a,28,a)].
% 0.74/1.00 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(37,a,29,a)].
% 0.74/1.00 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(37,a,30,a)].
% 0.74/1.00 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(37,a,31,a)].
% 0.74/1.00 38 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.74/1.00 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(38,a,28,a)].
% 0.74/1.00 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(38,a,29,a)].
% 0.74/1.00 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(38,a,30,a)].
% 0.74/1.00 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(38,a,31,a)].
% 0.74/1.00 39 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.74/1.00 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(39,a,28,a)].
% 0.74/1.00 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(39,a,29,a)].
% 0.74/1.00 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(39,a,30,a)].
% 0.74/1.00 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(39,a,31,a)].
% 0.74/1.00 40 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.74/1.00 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(40,a,28,a)].
% 0.74/1.00 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(40,a,29,a)].
% 0.74/1.00 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(40,a,30,a)].
% 0.74/1.00 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(40,a,31,a)].
% 0.74/1.00 41 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.74/1.00 Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f8(A,B),A) | -member(C,A) | subset(C,B). [resolve(41,a,28,a)].
% 0.74/1.00 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(41,a,29,a)].
% 0.74/1.00 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(41,a,30,a)].
% 0.74/1.00 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(41,a,31,a)].
% 0.74/1.00 42 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.74/1.00 Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | member(f9(A,B),A) | -member(C,A) | subset(C,B). [resolve(42,a,28,a)].
% 0.74/1.00 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(42,a,29,a)].
% 0.74/1.00 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(42,a,30,a)].
% 0.74/1.00 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(42,a,31,a)].
% 0.74/1.00 43 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.74/1.00 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(43,a,28,a)].
% 0.74/1.00 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(43,a,29,a)].
% 0.74/1.00 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(43,a,30,a)].
% 0.74/1.00 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(43,a,31,a)].
% 0.74/1.00 44 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.74/1.00 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(44,a,28,a)].
% 0.74/1.00 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(44,a,29,a)].
% 0.74/1.00 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(44,a,30,a)].
% 0.74/1.00 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(44,a,31,a)].
% 0.74/1.00 45 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.74/1.00 Derived: -subset(f6(A,B),B) | member(f7(A,B),B) | f9(A,B) != f8(A,B) | -member(C,A) | subset(C,B). [resolve(45,a,28,a)].
% 0.74/1.00 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(45,a,29,a)].
% 0.74/1.00 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(45,a,30,a)].
% 0.74/1.00 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(45,a,31,a)].
% 0.74/1.00 46 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.74/1.00 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(46,a,28,a)].
% 0.74/1.00 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(46,a,29,a)].
% 0.74/1.00 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(46,a,30,a)].
% 0.74/1.00 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(46,a,31,a)].
% 0.74/1.00 47 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.74/1.01 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(47,a,28,a)].
% 0.74/1.01 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(47,a,29,a)].
% 0.74/1.01 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(47,a,30,a)].
% 0.74/1.01 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(47,a,31,a)].
% 0.74/1.01 48 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.74/1.01 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(48,a,28,a)].
% 0.74/1.01 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(48,a,29,a)].
% 0.74/1.01 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(48,a,30,a)].
% 0.74/1.01 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(48,a,31,a)].
% 0.74/1.01 49 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.74/1.01 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(49,a,28,a)].
% 0.74/1.01 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(49,a,29,a)].
% 0.74/1.01 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(49,a,30,a)].
% 0.74/1.01 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(49,a,31,a)].
% 0.74/1.01 50 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.74/1.01 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(50,a,28,a)].
% 0.74/1.01 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(50,a,29,a)].
% 0.74/1.01 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(50,a,30,a)].
% 0.74/1.01 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(50,a,31,a)].
% 0.74/1.01 51 pre_order(A,B) | member(f17(A,B),B) | member(f18(A,B),B) # label(pre_order) # label(axiom). [clausify(16)].
% 0.74/1.01 52 -pre_order(A,B) | -member(C,B) | apply(A,C,C) # label(pre_order) # label(axiom). [clausify(16)].
% 0.74/1.01 53 -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.74/1.01 Derived: member(f17(A,B),B) | member(f18(A,B),B) | -member(C,B) | apply(A,C,C). [resolve(51,a,52,a)].
% 0.74/1.01 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(51,a,53,a)].
% 0.74/1.01 54 pre_order(A,B) | member(f17(A,B),B) | member(f19(A,B),B) # label(pre_order) # label(axiom). [clausify(16)].
% 0.74/1.01 Derived: member(f17(A,B),B) | member(f19(A,B),B) | -member(C,B) | apply(A,C,C). [resolve(54,a,52,a)].
% 0.74/1.01 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(54,a,53,a)].
% 0.74/1.01 55 pre_order(A,B) | member(f17(A,B),B) | member(f20(A,B),B) # label(pre_order) # label(axiom). [clausify(16)].
% 0.74/1.01 Derived: member(f17(A,B),B) | member(f20(A,B),B) | -member(C,B) | apply(A,C,C). [resolve(55,a,52,a)].
% 0.74/1.01 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(55,a,53,a)].
% 0.74/1.01 56 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.74/1.01 Derived: member(f17(A,B),B) | apply(A,f18(A,B),f19(A,B)) | -member(C,B) | apply(A,C,C). [resolve(56,a,52,a)].
% 0.74/1.01 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(56,a,53,a)].
% 0.74/1.01 57 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.74/1.01 Derived: member(f17(A,B),B) | apply(A,f19(A,B),f20(A,B)) | -member(C,B) | apply(A,C,C). [resolve(57,a,52,a)].
% 0.74/1.01 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(57,a,53,a)].
% 0.74/1.01 58 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.74/1.01 Derived: member(f17(A,B),B) | -apply(A,f18(A,B),f20(A,B)) | -member(C,B) | apply(A,C,C). [resolve(58,a,52,a)].
% 0.74/1.01 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(58,a,53,a)].
% 0.74/1.01 59 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.74/1.01 Derived: -apply(A,f17(A,B),f17(A,B)) | member(f18(A,B),B) | -member(C,B) | apply(A,C,C). [resolve(59,a,52,a)].
% 0.74/1.01 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(59,a,53,a)].
% 0.74/1.01 60 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | member(f19(A,B),B) # label(pre_order) # label(axiom). [clausify(16)].
% 1.87/2.20 Derived: -apply(A,f17(A,B),f17(A,B)) | member(f19(A,B),B) | -member(C,B) | apply(A,C,C). [resolve(60,a,52,a)].
% 1.87/2.20 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(60,a,53,a)].
% 1.87/2.20 61 pre_order(A,B) | -apply(A,f17(A,B),f17(A,B)) | member(f20(A,B),B) # label(pre_order) # label(axiom). [clausify(16)].
% 1.87/2.20 Derived: -apply(A,f17(A,B),f17(A,B)) | member(f20(A,B),B) | -member(C,B) | apply(A,C,C). [resolve(61,a,52,a)].
% 1.87/2.20 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(61,a,53,a)].
% 1.87/2.20 62 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)].
% 1.87/2.20 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(62,a,52,a)].
% 1.87/2.20 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(62,a,53,a)].
% 1.87/2.20 63 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)].
% 1.87/2.20 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(63,a,52,a)].
% 1.87/2.20 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(63,a,53,a)].
% 1.87/2.20 64 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)].
% 1.87/2.20 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(64,a,52,a)].
% 1.87/2.20 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(64,a,53,a)].
% 1.87/2.20
% 1.87/2.20 ============================== end predicate elimination =============
% 1.87/2.20
% 1.87/2.20 Auto_denials: (non-Horn, no changes).
% 1.87/2.20
% 1.87/2.20 Term ordering decisions:
% 1.87/2.20 Function symbol KB weights: equal_set_predicate=1. empty_set=1. c1=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.
% 1.87/2.20
% 1.87/2.20 ============================== end of process initial clauses ========
% 1.87/2.20
% 1.87/2.20 ============================== CLAUSES FOR SEARCH ====================
% 1.87/2.20
% 1.87/2.20 ============================== end of clauses for search =============
% 1.87/2.20
% 1.87/2.20 ============================== SEARCH ================================
% 1.87/2.20
% 1.87/2.20 % Starting search at 0.06 seconds.
% 1.87/2.20
% 1.87/2.20 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.19 sec).
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=53.000, iters=3649
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=51.000, iters=3598
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=47.000, iters=3341
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=46.000, iters=3380
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=45.000, iters=3376
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=44.000, iters=3350
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=43.000, iters=3385
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=42.000, iters=3383
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=41.000, iters=3355
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=40.000, iters=3399
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=39.000, iters=3363
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=37.000, iters=5775
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=36.000, iters=3374
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=35.000, iters=3335
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=34.000, iters=3365
% 1.87/2.20
% 1.87/2.20 Low Water (keep): wt=33.000, iters=3339
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4561, wt=94.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4687, wt=93.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4581, wt=92.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4706, wt=91.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4558, wt=90.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4578, wt=88.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4530, wt=87.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4579, wt=86.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4563, wt=85.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=5337, wt=84.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=4583, wt=83.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=5365, wt=82.000
% 1.87/2.20
% 1.87/2.20 Low Water (displace): id=529Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------