TSTP Solution File: SET810+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET810+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:14 EDT 2022
% Result : Theorem 1.32s 1.60s
% Output : Refutation 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET810+4 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jul 10 07:26:47 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.48/1.05 ============================== Prover9 ===============================
% 0.48/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.05 Process 29097 was started by sandbox2 on n027.cluster.edu,
% 0.48/1.05 Sun Jul 10 07:26:48 2022
% 0.48/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28944_n027.cluster.edu".
% 0.48/1.05 ============================== end of head ===========================
% 0.48/1.05
% 0.48/1.05 ============================== INPUT =================================
% 0.48/1.05
% 0.48/1.05 % Reading from file /tmp/Prover9_28944_n027.cluster.edu
% 0.48/1.05
% 0.48/1.05 set(prolog_style_variables).
% 0.48/1.05 set(auto2).
% 0.48/1.05 % set(auto2) -> set(auto).
% 0.48/1.05 % set(auto) -> set(auto_inference).
% 0.48/1.05 % set(auto) -> set(auto_setup).
% 0.48/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.05 % set(auto) -> set(auto_limits).
% 0.48/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.05 % set(auto) -> set(auto_denials).
% 0.48/1.05 % set(auto) -> set(auto_process).
% 0.48/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.05 % set(auto2) -> assign(stats, some).
% 0.48/1.05 % set(auto2) -> clear(echo_input).
% 0.48/1.05 % set(auto2) -> set(quiet).
% 0.48/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.05 % set(auto2) -> clear(print_given).
% 0.48/1.05 assign(lrs_ticks,-1).
% 0.48/1.05 assign(sos_limit,10000).
% 0.48/1.05 assign(order,kbo).
% 0.48/1.05 set(lex_order_vars).
% 0.48/1.05 clear(print_given).
% 0.48/1.05
% 0.48/1.05 % formulas(sos). % not echoed (20 formulas)
% 0.48/1.05
% 0.48/1.05 ============================== end of input ==========================
% 0.48/1.05
% 0.48/1.05 % From the command line: assign(max_seconds, 300).
% 0.48/1.05
% 0.48/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.05
% 0.48/1.05 % Formulas that are not ordinary clauses:
% 0.48/1.05 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.48/1.05 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.48/1.05 3 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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.48/1.05 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.48/1.05 6 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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.48/1.05 8 (all X all A (member(X,singleton(A)) <-> X = A)) # label(singleton) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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.48/1.05 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.48/1.05 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.48/1.05 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.48/1.05 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.48/1.05 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.48/1.05 15 (all X all Y (apply(member_predicate,X,Y) <-> member(X,Y))) # label(rel_member) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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.48/1.05 17 (all X (set(X) -> (all Y (member(Y,X) -> set(Y))))) # label(set_member) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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.48/1.05 19 (all A all X (member(X,suc(A)) <-> member(X,union(A,singleton(A))))) # label(successor) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 20 -(all A all B (member(A,on) & member(B,on) -> -(member(A,B) & member(B,A)))) # label(thV3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.05
% 0.48/1.05 ============================== end of process non-clausal formulas ===
% 0.48/1.05
% 0.48/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.05
% 0.48/1.05 ============================== PREDICATE ELIMINATION =================
% 0.48/1.05 21 -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.48/1.05 22 strict_order(A,B) | member(f9(A,B),B) | member(f11(A,B),B) # label(strict_order) # label(axiom). [clausify(16)].
% 0.48/1.05 23 strict_order(A,B) | member(f9(A,B),B) | member(f12(A,B),B) # label(strict_order) # label(axiom). [clausify(16)].
% 0.48/1.05 24 strict_order(A,B) | member(f9(A,B),B) | member(f13(A,B),B) # label(strict_order) # label(axiom). [clausify(16)].
% 0.48/1.05 25 strict_order(A,B) | member(f10(A,B),B) | member(f11(A,B),B) # label(strict_order) # label(axiom). [clausify(16)].
% 0.48/1.05 26 strict_order(A,B) | member(f10(A,B),B) | member(f12(A,B),B) # label(strict_order) # label(axiom). [clausify(16)].
% 0.48/1.05 27 strict_order(A,B) | member(f10(A,B),B) | member(f13(A,B),B) # label(strict_order) # label(axiom). [clausify(16)].
% 0.48/1.05 28 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.48/1.05 29 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.48/1.05 30 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.48/1.05 31 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.48/1.05 32 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.48/1.05 33 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.48/1.05 34 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.48/1.05 35 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.48/1.05 36 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.48/1.05 37 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.48/1.05 38 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.48/1.05 39 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.48/1.05 40 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.48/1.05 41 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.48/1.05 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(21,a,22,a)].
% 0.48/1.05 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(21,a,23,a)].
% 0.48/1.05 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(21,a,24,a)].
% 0.48/1.05 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(21,a,25,a)].
% 0.48/1.05 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(21,a,26,a)].
% 0.48/1.05 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(21,a,27,a)].
% 0.48/1.05 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(21,a,28,a)].
% 0.48/1.05 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(21,a,29,a)].
% 0.48/1.05 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(21,a,30,a)].
% 0.48/1.05 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(21,a,31,a)].
% 0.48/1.05 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(21,a,32,a)].
% 0.48/1.05 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(21,a,33,a)].
% 0.48/1.05 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(21,a,34,a)].
% 0.48/1.05 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(21,a,35,a)].
% 0.48/1.05 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(21,a,36,a)].
% 0.48/1.05 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(21,a,37,a)].
% 0.48/1.05 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(21,a,38,a)].
% 0.48/1.05 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(21,a,39,a)].
% 0.48/1.05 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(21,a,40,a)].
% 0.48/1.05 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(21,a,41,a)].
% 0.48/1.05 42 -strict_well_order(A,B) | strict_order(A,B) # label(strict_well_order) # label(axiom). [clausify(13)].
% 0.48/1.05 Derived: -strict_well_order(A,B) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C). [resolve(42,b,21,a)].
% 0.48/1.05 43 strict_well_order(A,B) | -strict_order(A,B) | subset(f6(A,B),B) # label(strict_well_order) # label(axiom). [clausify(13)].
% 0.48/1.05 Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | member(f11(A,B),B). [resolve(43,b,22,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | member(f12(A,B),B). [resolve(43,b,23,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f9(A,B),B) | member(f13(A,B),B). [resolve(43,b,24,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | member(f11(A,B),B). [resolve(43,b,25,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | member(f12(A,B),B). [resolve(43,b,26,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | subset(f6(A,B),B) | member(f10(A,B),B) | member(f13(A,B),B). [resolve(43,b,27,a)].
% 0.48/1.05 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(43,b,28,a)].
% 0.48/1.05 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(43,b,29,a)].
% 0.48/1.05 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(43,b,30,a)].
% 0.48/1.05 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(43,b,31,a)].
% 0.48/1.05 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(43,b,32,a)].
% 0.48/1.05 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(43,b,33,a)].
% 0.48/1.05 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(43,b,34,a)].
% 0.48/1.05 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(43,b,35,a)].
% 0.48/1.05 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(43,b,36,a)].
% 0.48/1.05 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(43,b,37,a)].
% 0.48/1.05 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(43,b,38,a)].
% 0.48/1.05 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(43,b,39,a)].
% 0.48/1.05 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(43,b,40,a)].
% 0.48/1.05 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(43,b,41,a)].
% 0.48/1.05 44 strict_well_order(A,B) | -strict_order(A,B) | -least(C,A,f6(A,B)) # label(strict_well_order) # label(axiom). [clausify(13)].
% 0.48/1.05 Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | member(f11(A,B),B). [resolve(44,b,22,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | member(f12(A,B),B). [resolve(44,b,23,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f9(A,B),B) | member(f13(A,B),B). [resolve(44,b,24,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | member(f11(A,B),B). [resolve(44,b,25,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | member(f12(A,B),B). [resolve(44,b,26,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | -least(C,A,f6(A,B)) | member(f10(A,B),B) | member(f13(A,B),B). [resolve(44,b,27,a)].
% 0.48/1.05 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(44,b,28,a)].
% 0.48/1.05 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(44,b,29,a)].
% 0.48/1.05 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(44,b,30,a)].
% 0.48/1.05 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(44,b,31,a)].
% 0.48/1.05 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(44,b,32,a)].
% 0.48/1.05 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(44,b,33,a)].
% 0.48/1.05 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(44,b,34,a)].
% 0.48/1.05 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(44,b,35,a)].
% 0.48/1.05 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(44,b,36,a)].
% 0.48/1.05 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(44,b,37,a)].
% 0.48/1.05 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(44,b,38,a)].
% 0.48/1.05 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(44,b,39,a)].
% 0.48/1.05 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(44,b,40,a)].
% 0.48/1.05 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(44,b,41,a)].
% 0.48/1.05 45 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.48/1.05 Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | member(f11(A,B),B). [resolve(45,b,22,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | member(f12(A,B),B). [resolve(45,b,23,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f9(A,B),B) | member(f13(A,B),B). [resolve(45,b,24,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | member(f11(A,B),B). [resolve(45,b,25,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | member(f12(A,B),B). [resolve(45,b,26,a)].
% 0.48/1.05 Derived: strict_well_order(A,B) | member(f7(A,B),f6(A,B)) | member(f10(A,B),B) | member(f13(A,B),B). [resolve(45,b,27,a)].
% 0.48/1.05 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(45,b,28,a)].
% 0.48/1.05 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(45,b,29,a)].
% 0.48/1.05 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(45,b,30,a)].
% 0.48/1.05 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(45,b,31,a)].
% 0.48/1.05 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(45,b,32,a)].
% 0.48/1.05 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(45,b,33,a)].
% 0.48/1.05 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(45,b,34,a)].
% 0.48/1.05 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(45,b,35,a)].
% 0.48/1.05 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(45,b,36,a)].
% 0.79/1.05 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(45,b,37,a)].
% 0.79/1.05 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(45,b,38,a)].
% 0.79/1.05 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(45,b,39,a)].
% 0.79/1.05 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(45,b,40,a)].
% 0.79/1.05 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(45,b,41,a)].
% 0.79/1.05 46 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.79/1.05 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(46,a,21,a)].
% 0.79/1.05 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(46,a,43,b)].
% 0.79/1.05 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(46,a,44,b)].
% 0.79/1.05 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(46,a,45,b)].
% 0.79/1.05 47 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.79/1.05 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(47,a,21,a)].
% 0.79/1.05 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(47,a,43,b)].
% 0.79/1.05 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(47,a,44,b)].
% 0.79/1.05 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(47,a,45,b)].
% 0.79/1.06 48 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.79/1.06 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(48,a,21,a)].
% 0.79/1.06 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(48,a,43,b)].
% 0.79/1.06 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(48,a,44,b)].
% 0.79/1.06 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(48,a,45,b)].
% 0.79/1.06 49 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.79/1.06 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(49,a,21,a)].
% 0.79/1.06 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(49,a,43,b)].
% 0.79/1.06 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(49,a,44,b)].
% 0.79/1.06 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(49,a,45,b)].
% 0.79/1.06 50 -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.79/1.06 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(50,a,22,a)].
% 0.79/1.06 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(50,a,23,a)].
% 0.79/1.06 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(50,a,24,a)].
% 0.79/1.06 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(50,a,25,a)].
% 0.79/1.06 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(50,a,26,a)].
% 0.79/1.06 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(50,a,27,a)].
% 0.79/1.06 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(50,a,28,a)].
% 0.79/1.06 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(50,a,29,a)].
% 0.79/1.06 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(50,a,30,a)].
% 0.79/1.06 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(50,a,31,a)].
% 0.79/1.06 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(50,a,32,a)].
% 0.79/1.06 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(50,a,33,a)].
% 0.79/1.06 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(50,a,34,a)].
% 0.79/1.06 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(50,a,35,a)].
% 0.79/1.06 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(50,a,36,a)].
% 1.32/1.60 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(50,a,37,a)].
% 1.32/1.60 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(50,a,38,a)].
% 1.32/1.60 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(50,a,39,a)].
% 1.32/1.60 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(50,a,40,a)].
% 1.32/1.60 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(50,a,41,a)].
% 1.32/1.60 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(50,a,42,b)].
% 1.32/1.60 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(50,a,46,a)].
% 1.32/1.60 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(50,a,47,a)].
% 1.32/1.60 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(50,a,48,a)].
% 1.32/1.60 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(50,a,49,a)].
% 1.32/1.60 51 equal_set(A,B) | -subset(A,B) | -subset(B,A) # label(equal_set) # label(axiom). [clausify(2)].
% 1.32/1.60 52 -equal_set(A,B) | subset(A,B) # label(equal_set) # label(axiom). [clausify(2)].
% 1.32/1.60 53 -equal_set(A,B) | subset(B,A) # label(equal_set) # label(axiom). [clausify(2)].
% 1.32/1.60
% 1.32/1.60 ============================== end predicate elimination =============
% 1.32/1.60
% 1.32/1.60 Auto_denials: (non-Horn, no changes).
% 1.32/1.60
% 1.32/1.60 Term ordering decisions:
% 1.32/1.60 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. singleton=1. product=1. sum=1. power_set=1. suc=1. f4=1. initial_segment=1. f5=1. f8=1.
% 1.32/1.60
% 1.32/1.60 ============================== end of process initial clauses ========
% 1.32/1.60
% 1.32/1.60 ============================== CLAUSES FOR SEARCH ====================
% 1.32/1.60
% 1.32/1.60 ============================== end of clauses for search =============
% 1.32/1.60
% 1.32/1.60 ============================== SEARCH ================================
% 1.32/1.60
% 1.32/1.60 % Starting search at 0.06 seconds.
% 1.32/1.60
% 1.32/1.60 ============================== PROOF =================================
% 1.32/1.60 % SZS status Theorem
% 1.32/1.60 % SZS output start Refutation
% 1.32/1.60
% 1.32/1.60 % Proof 1 at 0.56 (+ 0.01) seconds.
% 1.32/1.60 % Length of proof is 24.
% 1.32/1.60 % Level of proof is 5.
% 1.32/1.60 % Maximum clause weight is 17.000.
% 1.32/1.60 % Given clauses 323.
% 1.32/1.60
% 1.32/1.60 1 (all A all B (subset(A,B) <-> (all X (member(X,A) -> member(X,B))))) # label(subset) # label(axiom) # label(non_clause). [assumption].
% 1.32/1.60 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].
% 1.32/1.60 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].
% 1.32/1.60 15 (all X all Y (apply(member_predicate,X,Y) <-> member(X,Y))) # label(rel_member) # label(axiom) # label(non_clause). [assumption].
% 1.32/1.60 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].
% 1.32/1.60 20 -(all A all B (member(A,on) & member(B,on) -> -(member(A,B) & member(B,A)))) # label(thV3) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.32/1.60 21 -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)].
% 1.32/1.60 42 -strict_well_order(A,B) | strict_order(A,B) # label(strict_well_order) # label(axiom). [clausify(13)].
% 1.32/1.60 54 member(c1,on) # label(thV3) # label(negated_conjecture). [clausify(20)].
% 1.32/1.60 56 member(c1,c2) # label(thV3) # label(negated_conjecture). [clausify(20)].
% 1.32/1.60 57 member(c2,c1) # label(thV3) # label(negated_conjecture). [clausify(20)].
% 1.32/1.60 63 -member(A,on) | strict_well_order(member_predicate,A) # label(ordinal_number) # label(axiom). [clausify(12)].
% 1.32/1.60 70 apply(member_predicate,A,B) | -member(A,B) # label(rel_member) # label(axiom). [clausify(15)].
% 1.32/1.60 80 -subset(A,B) | -member(C,A) | member(C,B) # label(subset) # label(axiom). [clausify(1)].
% 1.32/1.60 84 -member(A,on) | -member(B,A) | subset(B,A) # label(ordinal_number) # label(axiom). [clausify(12)].
% 1.32/1.60 124 -strict_well_order(A,B) | -member(C,B) | -member(D,B) | -apply(A,C,D) | -apply(A,D,C). [resolve(42,b,21,a)].
% 1.32/1.60 295 strict_well_order(member_predicate,c1). [resolve(63,a,54,a)].
% 1.32/1.60 301 apply(member_predicate,c2,c1). [resolve(70,b,57,a)].
% 1.32/1.60 302 apply(member_predicate,c1,c2). [resolve(70,b,56,a)].
% 1.32/1.60 328 subset(c2,c1). [resolve(84,b,57,a),unit_del(a,54)].
% 1.32/1.60 2597 -member(A,c2) | member(A,c1). [resolve(328,a,80,a)].
% 1.32/1.60 2670 -strict_well_order(member_predicate,A) | -member(c1,A) | -member(c2,A). [resolve(301,a,124,e),unit_del(d,302)].
% 1.32/1.60 2710 -member(c1,c1). [resolve(2670,a,295,a),unit_del(b,57)].
% 1.32/1.60 4339 $F. [resolve(2597,a,56,a),unit_del(a,2710)].
% 1.32/1.60
% 1.32/1.60 % SZS output end Refutation
% 1.32/1.60 ============================== end of proof ==========================
% 1.32/1.60
% 1.32/1.60 ============================== STATISTICS ============================
% 1.32/1.60
% 1.32/1.60 Given=323. Generated=10929. Kept=4284. proofs=1.
% 1.32/1.60 Usable=322. Sos=3876. Demods=0. Limbo=5, Disabled=285. Hints=0.
% 1.32/1.60 Megabytes=5.41.
% 1.32/1.60 User_CPU=0.56, System_CPU=0.01, Wall_clock=0.
% 1.32/1.60
% 1.32/1.60 ============================== end of statistics =====================
% 1.32/1.60
% 1.32/1.60 ============================== end of search =========================
% 1.32/1.60
% 1.32/1.60 THEOREM PROVED
% 1.32/1.60 % SZS status Theorem
% 1.32/1.60
% 1.32/1.60 Exiting with 1 proof.
% 1.32/1.60
% 1.32/1.60 Process 29097 exit (max_proofs) Sun Jul 10 07:26:48 2022
% 1.32/1.60 Prover9 interrupted
%------------------------------------------------------------------------------