0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n010.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 180 0.12/0.34 % DateTime : Thu Aug 29 11:40:21 EDT 2019 0.12/0.34 % CPUTime : 0.46/1.02 ============================== Prover9 =============================== 0.46/1.02 Prover9 (32) version 2009-11A, November 2009. 0.46/1.02 Process 18711 was started by sandbox on n010.cluster.edu, 0.46/1.02 Thu Aug 29 11:40:22 2019 0.46/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_18555_n010.cluster.edu". 0.46/1.02 ============================== end of head =========================== 0.46/1.02 0.46/1.02 ============================== INPUT ================================= 0.46/1.02 0.46/1.02 % Reading from file /tmp/Prover9_18555_n010.cluster.edu 0.46/1.02 0.46/1.02 set(prolog_style_variables). 0.46/1.02 set(auto2). 0.46/1.02 % set(auto2) -> set(auto). 0.46/1.02 % set(auto) -> set(auto_inference). 0.46/1.02 % set(auto) -> set(auto_setup). 0.46/1.02 % set(auto_setup) -> set(predicate_elim). 0.46/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.46/1.02 % set(auto) -> set(auto_limits). 0.46/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.46/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.46/1.02 % set(auto) -> set(auto_denials). 0.46/1.02 % set(auto) -> set(auto_process). 0.46/1.02 % set(auto2) -> assign(new_constants, 1). 0.46/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.46/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.46/1.02 % set(auto2) -> assign(max_hours, 1). 0.46/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.46/1.02 % set(auto2) -> assign(max_seconds, 0). 0.46/1.02 % set(auto2) -> assign(max_minutes, 5). 0.46/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.46/1.02 % set(auto2) -> set(sort_initial_sos). 0.46/1.02 % set(auto2) -> assign(sos_limit, -1). 0.46/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.46/1.02 % set(auto2) -> assign(max_megs, 400). 0.46/1.02 % set(auto2) -> assign(stats, some). 0.46/1.02 % set(auto2) -> clear(echo_input). 0.46/1.02 % set(auto2) -> set(quiet). 0.46/1.02 % set(auto2) -> clear(print_initial_clauses). 0.46/1.02 % set(auto2) -> clear(print_given). 0.46/1.02 assign(lrs_ticks,-1). 0.46/1.02 assign(sos_limit,10000). 0.46/1.02 assign(order,kbo). 0.46/1.02 set(lex_order_vars). 0.46/1.02 clear(print_given). 0.46/1.02 0.46/1.02 % formulas(sos). % not echoed (21 formulas) 0.46/1.02 0.46/1.02 ============================== end of input ========================== 0.46/1.02 0.46/1.02 % From the command line: assign(max_seconds, 180). 0.46/1.02 0.46/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.46/1.02 0.46/1.02 % Formulas that are not ordinary clauses: 0.46/1.02 1 (all X all A all B (member(X,unordered_pair(A,B)) <-> X = B | X = A)) # label(unordered_pair) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 2 (all X all A (member(X,singleton(A)) <-> A = X)) # label(singleton) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 3 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 4 (all A all B ((all X (member(X,A) -> member(X,B))) <-> subset(A,B))) # label(subset) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 5 (all B all A all E (member(B,difference(E,A)) <-> -member(B,A) & member(B,E))) # label(difference) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 6 (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.46/1.02 7 (all A all B (subset(A,B) & subset(B,A) <-> equal_set(A,B))) # label(equal_set) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 8 (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.46/1.02 9 (all X all A all B (member(X,A) | member(X,B) <-> member(X,union(A,B)))) # label(union) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 10 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 11 (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.46/1.02 12 (all X all Y (apply(member_predicate,X,Y) <-> member(X,Y))) # label(rel_member) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 13 (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.46/1.02 14 (all R all E ((all A ((exists X member(X,A)) & subset(A,E) -> (exists Y least(Y,R,A)))) & strict_order(R,E) <-> strict_well_order(R,E))) # label(strict_well_order) # label(axiom) # label(non_clause). [assumption]. 0.46/1.03 15 (all R all E all M (least(M,R,E) <-> (all X (member(X,E) -> apply(R,M,X) | M = X)) & member(M,E))) # label(least) # label(axiom) # label(non_clause). [assumption]. 0.46/1.03 16 (all X (set(X) -> (all Y (member(Y,X) -> set(Y))))) # label(set_member) # label(axiom) # label(non_clause). [assumption]. 0.46/1.03 17 (all A all X (member(X,suc(A)) <-> member(X,union(A,singleton(A))))) # label(successor) # label(axiom) # label(non_clause). [assumption]. 0.46/1.03 18 (all R all E ((all X all Y (member(Y,E) & member(X,E) -> -(apply(R,X,Y) & apply(R,Y,X)))) & (all X all Y all Z (member(Y,E) & member(Z,E) & member(X,E) -> (apply(R,X,Y) & apply(R,Y,Z) -> apply(R,X,Z)))) <-> strict_order(R,E))) # label(strict_order) # label(axiom) # label(non_clause). [assumption]. 0.46/1.03 19 (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.46/1.03 20 (all A all B all C (subset(B,C) & subset(A,B) -> subset(A,C))) # label(thI3) # label(axiom) # label(non_clause). [assumption]. 0.46/1.03 21 -(all A (member(A,on) -> subset(sum(A),A))) # label(thV14) # label(negated_conjecture) # label(non_clause). [assumption]. 0.46/1.03 0.46/1.03 ============================== end of process non-clausal formulas === 0.46/1.03 0.46/1.03 ============================== PROCESS INITIAL CLAUSES =============== 0.46/1.03 0.46/1.03 ============================== PREDICATE ELIMINATION ================= 0.46/1.03 22 -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | -strict_order(D,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 23 member(f9(A,B),B) | member(f11(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 24 member(f9(A,B),B) | member(f12(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 25 member(f9(A,B),B) | member(f10(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 26 member(f8(A,B),B) | member(f11(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 27 member(f8(A,B),B) | member(f12(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 28 member(f8(A,B),B) | member(f10(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 29 member(f9(A,B),B) | apply(A,f10(A,B),f11(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 30 member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 31 member(f8(A,B),B) | apply(A,f10(A,B),f11(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 32 member(f8(A,B),B) | apply(A,f11(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 33 apply(A,f8(A,B),f9(A,B)) | member(f11(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 34 apply(A,f8(A,B),f9(A,B)) | member(f12(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 35 apply(A,f8(A,B),f9(A,B)) | member(f10(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 36 apply(A,f9(A,B),f8(A,B)) | member(f11(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 37 apply(A,f9(A,B),f8(A,B)) | member(f12(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 38 apply(A,f9(A,B),f8(A,B)) | member(f10(A,B),B) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 39 apply(A,f8(A,B),f9(A,B)) | apply(A,f10(A,B),f11(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 40 apply(A,f8(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 41 apply(A,f9(A,B),f8(A,B)) | apply(A,f10(A,B),f11(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 42 apply(A,f9(A,B),f8(A,B)) | apply(A,f11(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f9(D,B),B) | member(f11(D,B),B). [resolve(22,e,23,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f9(D,B),B) | member(f12(D,B),B). [resolve(22,e,24,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f9(D,B),B) | member(f10(D,B),B). [resolve(22,e,25,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f8(D,B),B) | member(f11(D,B),B). [resolve(22,e,26,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f8(D,B),B) | member(f12(D,B),B). [resolve(22,e,27,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f8(D,B),B) | member(f10(D,B),B). [resolve(22,e,28,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f9(D,B),B) | apply(D,f10(D,B),f11(D,B)). [resolve(22,e,29,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f9(D,B),B) | apply(D,f11(D,B),f12(D,B)). [resolve(22,e,30,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f8(D,B),B) | apply(D,f10(D,B),f11(D,B)). [resolve(22,e,31,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | member(f8(D,B),B) | apply(D,f11(D,B),f12(D,B)). [resolve(22,e,32,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f8(D,B),f9(D,B)) | member(f11(D,B),B). [resolve(22,e,33,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f8(D,B),f9(D,B)) | member(f12(D,B),B). [resolve(22,e,34,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f8(D,B),f9(D,B)) | member(f10(D,B),B). [resolve(22,e,35,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f9(D,B),f8(D,B)) | member(f11(D,B),B). [resolve(22,e,36,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f9(D,B),f8(D,B)) | member(f12(D,B),B). [resolve(22,e,37,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f9(D,B),f8(D,B)) | member(f10(D,B),B). [resolve(22,e,38,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f8(D,B),f9(D,B)) | apply(D,f10(D,B),f11(D,B)). [resolve(22,e,39,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f8(D,B),f9(D,B)) | apply(D,f11(D,B),f12(D,B)). [resolve(22,e,40,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f9(D,B),f8(D,B)) | apply(D,f10(D,B),f11(D,B)). [resolve(22,e,41,c)]. 0.46/1.03 Derived: -member(A,B) | -member(C,B) | -apply(D,C,A) | -apply(D,A,C) | apply(D,f9(D,B),f8(D,B)) | apply(D,f11(D,B),f12(D,B)). [resolve(22,e,42,c)]. 0.46/1.03 43 strict_order(A,B) | -strict_well_order(A,B) # label(strict_well_order) # label(axiom). [clausify(14)]. 0.46/1.03 Derived: -strict_well_order(A,B) | -member(C,B) | -member(D,B) | -apply(A,D,C) | -apply(A,C,D). [resolve(43,a,22,e)]. 0.46/1.03 44 subset(f4(A,B),B) | -strict_order(A,B) | strict_well_order(A,B) # label(strict_well_order) # label(axiom). [clausify(14)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f9(A,B),B) | member(f11(A,B),B). [resolve(44,b,23,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f9(A,B),B) | member(f12(A,B),B). [resolve(44,b,24,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f9(A,B),B) | member(f10(A,B),B). [resolve(44,b,25,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f8(A,B),B) | member(f11(A,B),B). [resolve(44,b,26,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f8(A,B),B) | member(f12(A,B),B). [resolve(44,b,27,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f8(A,B),B) | member(f10(A,B),B). [resolve(44,b,28,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f9(A,B),B) | apply(A,f10(A,B),f11(A,B)). [resolve(44,b,29,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)). [resolve(44,b,30,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f8(A,B),B) | apply(A,f10(A,B),f11(A,B)). [resolve(44,b,31,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | member(f8(A,B),B) | apply(A,f11(A,B),f12(A,B)). [resolve(44,b,32,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | member(f11(A,B),B). [resolve(44,b,33,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | member(f12(A,B),B). [resolve(44,b,34,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | member(f10(A,B),B). [resolve(44,b,35,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | member(f11(A,B),B). [resolve(44,b,36,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | member(f12(A,B),B). [resolve(44,b,37,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | member(f10(A,B),B). [resolve(44,b,38,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | apply(A,f10(A,B),f11(A,B)). [resolve(44,b,39,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)). [resolve(44,b,40,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | apply(A,f10(A,B),f11(A,B)). [resolve(44,b,41,c)]. 0.46/1.03 Derived: subset(f4(A,B),B) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | apply(A,f11(A,B),f12(A,B)). [resolve(44,b,42,c)]. 0.46/1.03 45 -least(A,B,f4(B,C)) | -strict_order(B,C) | strict_well_order(B,C) # label(strict_well_order) # label(axiom). [clausify(14)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f9(B,C),C) | member(f11(B,C),C). [resolve(45,b,23,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f9(B,C),C) | member(f12(B,C),C). [resolve(45,b,24,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f9(B,C),C) | member(f10(B,C),C). [resolve(45,b,25,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f8(B,C),C) | member(f11(B,C),C). [resolve(45,b,26,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f8(B,C),C) | member(f12(B,C),C). [resolve(45,b,27,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f8(B,C),C) | member(f10(B,C),C). [resolve(45,b,28,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f9(B,C),C) | apply(B,f10(B,C),f11(B,C)). [resolve(45,b,29,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f9(B,C),C) | apply(B,f11(B,C),f12(B,C)). [resolve(45,b,30,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f8(B,C),C) | apply(B,f10(B,C),f11(B,C)). [resolve(45,b,31,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | member(f8(B,C),C) | apply(B,f11(B,C),f12(B,C)). [resolve(45,b,32,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f8(B,C),f9(B,C)) | member(f11(B,C),C). [resolve(45,b,33,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f8(B,C),f9(B,C)) | member(f12(B,C),C). [resolve(45,b,34,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f8(B,C),f9(B,C)) | member(f10(B,C),C). [resolve(45,b,35,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f9(B,C),f8(B,C)) | member(f11(B,C),C). [resolve(45,b,36,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f9(B,C),f8(B,C)) | member(f12(B,C),C). [resolve(45,b,37,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f9(B,C),f8(B,C)) | member(f10(B,C),C). [resolve(45,b,38,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f8(B,C),f9(B,C)) | apply(B,f10(B,C),f11(B,C)). [resolve(45,b,39,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f8(B,C),f9(B,C)) | apply(B,f11(B,C),f12(B,C)). [resolve(45,b,40,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f9(B,C),f8(B,C)) | apply(B,f10(B,C),f11(B,C)). [resolve(45,b,41,c)]. 0.46/1.03 Derived: -least(A,B,f4(B,C)) | strict_well_order(B,C) | apply(B,f9(B,C),f8(B,C)) | apply(B,f11(B,C),f12(B,C)). [resolve(45,b,42,c)]. 0.46/1.03 46 member(f5(A,B),f4(A,B)) | -strict_order(A,B) | strict_well_order(A,B) # label(strict_well_order) # label(axiom). [clausify(14)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f9(A,B),B) | member(f11(A,B),B). [resolve(46,b,23,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f9(A,B),B) | member(f12(A,B),B). [resolve(46,b,24,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f9(A,B),B) | member(f10(A,B),B). [resolve(46,b,25,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f8(A,B),B) | member(f11(A,B),B). [resolve(46,b,26,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f8(A,B),B) | member(f12(A,B),B). [resolve(46,b,27,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f8(A,B),B) | member(f10(A,B),B). [resolve(46,b,28,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f9(A,B),B) | apply(A,f10(A,B),f11(A,B)). [resolve(46,b,29,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f9(A,B),B) | apply(A,f11(A,B),f12(A,B)). [resolve(46,b,30,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f8(A,B),B) | apply(A,f10(A,B),f11(A,B)). [resolve(46,b,31,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | member(f8(A,B),B) | apply(A,f11(A,B),f12(A,B)). [resolve(46,b,32,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | member(f11(A,B),B). [resolve(46,b,33,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | member(f12(A,B),B). [resolve(46,b,34,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | member(f10(A,B),B). [resolve(46,b,35,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | member(f11(A,B),B). [resolve(46,b,36,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | member(f12(A,B),B). [resolve(46,b,37,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | member(f10(A,B),B). [resolve(46,b,38,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | apply(A,f10(A,B),f11(A,B)). [resolve(46,b,39,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f8(A,B),f9(A,B)) | apply(A,f11(A,B),f12(A,B)). [resolve(46,b,40,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | apply(A,f10(A,B),f11(A,B)). [resolve(46,b,41,c)]. 0.46/1.03 Derived: member(f5(A,B),f4(A,B)) | strict_well_order(A,B) | apply(A,f9(A,B),f8(A,B)) | apply(A,f11(A,B),f12(A,B)). [resolve(46,b,42,c)]. 0.46/1.03 47 member(f9(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 Derived: member(f9(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | -member(C,B) | -member(D,B) | -apply(A,D,C) | -apply(A,C,D). [resolve(47,c,22,e)]. 0.46/1.03 Derived: member(f9(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | subset(f4(A,B),B) | strict_well_order(A,B). [resolve(47,c,44,b)]. 0.46/1.03 Derived: member(f9(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | -least(C,A,f4(A,B)) | strict_well_order(A,B). [resolve(47,c,45,b)]. 0.46/1.03 Derived: member(f9(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | member(f5(A,B),f4(A,B)) | strict_well_order(A,B). [resolve(47,c,46,b)]. 0.46/1.03 48 member(f8(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.46/1.03 Derived: member(f8(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | -member(C,B) | -member(D,B) | -apply(A,D,C) | -apply(A,C,D). [resolve(48,c,22,e)]. 0.46/1.03 Derived: member(f8(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | subset(f4(A,B),B) | strict_well_order(A,B). [resolve(48,c,44,b)]. 0.46/1.03 Derived: member(f8(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | -least(C,A,f4(A,B)) | strict_well_order(A,B). [resolve(48,c,45,b)]. 0.46/1.03 Derived: member(f8(A,B),B) | -apply(A,f10(A,B),f12(A,B)) | member(f5(A,B),f4(A,B)) | strict_well_order(A,B). [resolve(48,c,46,b)]. 0.76/1.04 49 apply(A,f8(A,B),f9(A,B)) | -apply(A,f10(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.76/1.04 Derived: apply(A,f8(A,B),f9(A,B)) | -apply(A,f10(A,B),f12(A,B)) | -member(C,B) | -member(D,B) | -apply(A,D,C) | -apply(A,C,D). [resolve(49,c,22,e)]. 0.76/1.04 Derived: apply(A,f8(A,B),f9(A,B)) | -apply(A,f10(A,B),f12(A,B)) | subset(f4(A,B),B) | strict_well_order(A,B). [resolve(49,c,44,b)]. 0.76/1.04 Derived: apply(A,f8(A,B),f9(A,B)) | -apply(A,f10(A,B),f12(A,B)) | -least(C,A,f4(A,B)) | strict_well_order(A,B). [resolve(49,c,45,b)]. 0.76/1.04 Derived: apply(A,f8(A,B),f9(A,B)) | -apply(A,f10(A,B),f12(A,B)) | member(f5(A,B),f4(A,B)) | strict_well_order(A,B). [resolve(49,c,46,b)]. 0.76/1.04 50 apply(A,f9(A,B),f8(A,B)) | -apply(A,f10(A,B),f12(A,B)) | strict_order(A,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.76/1.04 Derived: apply(A,f9(A,B),f8(A,B)) | -apply(A,f10(A,B),f12(A,B)) | -member(C,B) | -member(D,B) | -apply(A,D,C) | -apply(A,C,D). [resolve(50,c,22,e)]. 0.76/1.04 Derived: apply(A,f9(A,B),f8(A,B)) | -apply(A,f10(A,B),f12(A,B)) | subset(f4(A,B),B) | strict_well_order(A,B). [resolve(50,c,44,b)]. 0.76/1.04 Derived: apply(A,f9(A,B),f8(A,B)) | -apply(A,f10(A,B),f12(A,B)) | -least(C,A,f4(A,B)) | strict_well_order(A,B). [resolve(50,c,45,b)]. 0.76/1.04 Derived: apply(A,f9(A,B),f8(A,B)) | -apply(A,f10(A,B),f12(A,B)) | member(f5(A,B),f4(A,B)) | strict_well_order(A,B). [resolve(50,c,46,b)]. 0.76/1.04 51 -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | -strict_order(E,B) # label(strict_order) # label(axiom). [clausify(18)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f9(E,B),B) | member(f11(E,B),B). [resolve(51,g,23,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f9(E,B),B) | member(f12(E,B),B). [resolve(51,g,24,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f9(E,B),B) | member(f10(E,B),B). [resolve(51,g,25,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f8(E,B),B) | member(f11(E,B),B). [resolve(51,g,26,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f8(E,B),B) | member(f12(E,B),B). [resolve(51,g,27,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f8(E,B),B) | member(f10(E,B),B). [resolve(51,g,28,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f9(E,B),B) | apply(E,f10(E,B),f11(E,B)). [resolve(51,g,29,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f9(E,B),B) | apply(E,f11(E,B),f12(E,B)). [resolve(51,g,30,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f8(E,B),B) | apply(E,f10(E,B),f11(E,B)). [resolve(51,g,31,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f8(E,B),B) | apply(E,f11(E,B),f12(E,B)). [resolve(51,g,32,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f8(E,B),f9(E,B)) | member(f11(E,B),B). [resolve(51,g,33,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f8(E,B),f9(E,B)) | member(f12(E,B),B). [resolve(51,g,34,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f8(E,B),f9(E,B)) | member(f10(E,B),B). [resolve(51,g,35,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f9(E,B),f8(E,B)) | member(f11(E,B),B). [resolve(51,g,36,c)]. 0.76/1.04 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f9(E,B),f8(E,B)) | member(f12(E,B),B). [resolve(51,g,37,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f9(E,B),f8(E,B)) | member(f10(E,B),B). [resolve(51,g,38,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f8(E,B),f9(E,B)) | apply(E,f10(E,B),f11(E,B)). [resolve(51,g,39,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f8(E,B),f9(E,B)) | apply(E,f11(E,B),f12(E,B)). [resolve(51,g,40,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f9(E,B),f8(E,B)) | apply(E,f10(E,B),f11(E,B)). [resolve(51,g,41,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f9(E,B),f8(E,B)) | apply(E,f11(E,B),f12(E,B)). [resolve(51,g,42,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | -strict_well_order(E,B). [resolve(51,g,43,a)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f9(E,B),B) | -apply(E,f10(E,B),f12(E,B)). [resolve(51,g,47,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | member(f8(E,B),B) | -apply(E,f10(E,B),f12(E,B)). [resolve(51,g,48,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f8(E,B),f9(E,B)) | -apply(E,f10(E,B),f12(E,B)). [resolve(51,g,49,c)]. 1.89/2.17 Derived: -member(A,B) | -member(C,B) | -member(D,B) | -apply(E,D,A) | -apply(E,A,C) | apply(E,D,C) | apply(E,f9(E,B),f8(E,B)) | -apply(E,f10(E,B),f12(E,B)). [resolve(51,g,50,c)]. 1.89/2.17 52 -subset(A,B) | -subset(B,A) | equal_set(A,B) # label(equal_set) # label(axiom). [clausify(7)]. 1.89/2.17 53 subset(A,B) | -equal_set(A,B) # label(equal_set) # label(axiom). [clausify(7)]. 1.89/2.17 54 subset(A,B) | -equal_set(B,A) # label(equal_set) # label(axiom). [clausify(7)]. 1.89/2.17 1.89/2.17 ============================== end predicate elimination ============= 1.89/2.17 1.89/2.17 Auto_denials: (non-Horn, no changes). 1.89/2.17 1.89/2.17 Term ordering decisions: 1.89/2.17 Function symbol KB weights: on=1. member_predicate=1. empty_set=1. c1=1. union=1. intersection=1. unordered_pair=1. difference=1. f1=1. f2=1. f3=1. f4=1. f5=1. f8=1. f9=1. f10=1. f11=1. f12=1. singleton=1. product=1. sum=1. power_set=1. suc=1. f13=1. initial_segment=1. f6=1. f7=1. 1.89/2.17 1.89/2.17 ============================== end of process initial clauses ======== 1.89/2.17 1.89/2.17 ============================== CLAUSES FOR SEARCH ==================== 1.89/2.17 1.89/2.17 ============================== end of clauses for search ============= 1.89/2.17 1.89/2.17 ============================== SEARCH ================================ 1.89/2.17 1.89/2.17 % Starting search at 0.05 seconds. 1.89/2.17 1.89/2.17 Low Water (keep): wt=58.000, iters=5707 1.89/2.17 1.89/2.17 Low Water (keep): wt=55.000, iters=5410 1.89/2.17 1.89/2.17 Low Water (keep): wt=50.000, iters=4492 1.89/2.17 1.89/2.17 Low Water (keep): wt=47.000, iters=4060 1.89/2.17 1.89/2.17 Low Water (keep): wt=44.000, iters=3727 1.89/2.17 1.89/2.17 Low Water (keep): wt=43.000, iters=3529 1.89/2.17 1.89/2.17 Low Water (keep): wt=41.000, iters=4124 1.89/2.17 1.89/2.17 Low Water (keep): wt=38.000, iters=3908 1.89/2.17 1.89/2.17 Low Water (keep): wt=36.000, iters=3677 1.89/2.17 1.89/2.17 Low Water (keep): wt=28.000, iters=3363 1.89/2.17 1.89/2.17 Low Water (keep): wt=26.000, iters=3430 1.89/2.17 1.89/2.17 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 50 (0.00 of 0.75 sec). 1.89/2.17 1.89/2.17 Low Water (keep): wt=23.000, iters=3358 1.89/2.17 1.89/2.17 Low Water (keep): wt=22.000, iters=3342 1.89/2.17 1.89/2.17 Low Water (keep): wt=21.000, iters=3399 1.89/2.17 1.89/2.17 Low Water (keep): wt=19.000, iters=3337 1.89/2.17 1.89/2.17 Low Water (keep): wt=18.000, iters=3379 1.89/2.17 1.89/2.17 Low Water (keep): wt=17.000, iters=3483 1.89/2.17 1.89/2.17 Low Water (keep): wt=16.000, iters=3340 1.89/2.17 1.89/2.17 Low Water (keep): wt=14.000, iters=3346 1.89/2.17 1.89/2.17 Low Water (keep): wt=13.000, iters=3335 1.89/2.17 1.89/2.17 Low Water (keep): wt=12.000, iters=3402 1.89/2.17 1.89/2.17 Low Water (displace): id=2526, wt=59.000 1.89/2.17 1.89/2.17 Low Water (displace): id=2540, wt=57.000 1.89/2.17 1.89/2.17 Low Water (displace): id=2536, wt=56.000 1.89/2.17 1.89/2.17 Low Water (keep): wt=11.000, iters=3346 1.89/2.17 1.89/2.17 Low Water (displace): id=2550, wt=54.000 1.89/2.17 1.89/2.17 Low Water (displace): id=2424, wt=53.000 1.89/2.17 1.89/2.17 Low Water (displace): id=12361, wt=14.000 1.89/2.17 1.89/2.17 Low Water (displace): id=12406, wt=13.000 1.89/2.17 1.89/2.17 Low Water (displace): id=12468, wt=12.000 1.89/2.17 1.89/2.17 Low WateCputime limit exceeded (core dumped) 180.01/180.27 EOF