TSTP Solution File: SEU260+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU260+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 13:30:27 EDT 2022
% Result : Timeout 300.02s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU260+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 19 05:49:47 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.49/0.78 ============================== Prover9 ===============================
% 0.49/0.78 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.78 Process 29699 was started by sandbox on n032.cluster.edu,
% 0.49/0.78 Sun Jun 19 05:49:48 2022
% 0.49/0.78 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29542_n032.cluster.edu".
% 0.49/0.78 ============================== end of head ===========================
% 0.49/0.78
% 0.49/0.78 ============================== INPUT =================================
% 0.49/0.78
% 0.49/0.78 % Reading from file /tmp/Prover9_29542_n032.cluster.edu
% 0.49/0.78
% 0.49/0.78 set(prolog_style_variables).
% 0.49/0.78 set(auto2).
% 0.49/0.78 % set(auto2) -> set(auto).
% 0.49/0.78 % set(auto) -> set(auto_inference).
% 0.49/0.78 % set(auto) -> set(auto_setup).
% 0.49/0.78 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.78 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.78 % set(auto) -> set(auto_limits).
% 0.49/0.78 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.78 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.78 % set(auto) -> set(auto_denials).
% 0.49/0.78 % set(auto) -> set(auto_process).
% 0.49/0.78 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.78 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.78 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.78 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.78 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.78 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.78 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.78 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.78 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.78 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.78 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.78 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.78 % set(auto2) -> assign(stats, some).
% 0.49/0.78 % set(auto2) -> clear(echo_input).
% 0.49/0.78 % set(auto2) -> set(quiet).
% 0.49/0.78 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.78 % set(auto2) -> clear(print_given).
% 0.49/0.78 assign(lrs_ticks,-1).
% 0.49/0.78 assign(sos_limit,10000).
% 0.49/0.78 assign(order,kbo).
% 0.49/0.78 set(lex_order_vars).
% 0.49/0.78 clear(print_given).
% 0.49/0.78
% 0.49/0.78 % formulas(sos). % not echoed (61 formulas)
% 0.49/0.78
% 0.49/0.78 ============================== end of input ==========================
% 0.49/0.78
% 0.49/0.78 % From the command line: assign(max_seconds, 300).
% 0.49/0.78
% 0.49/0.78 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.78
% 0.49/0.78 % Formulas that are not ordinary clauses:
% 0.49/0.78 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 2 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 3 (all A (relation(A) & empty(A) & function(A) -> relation(A) & function(A) & one_to_one(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 4 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 5 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 6 (all A (relation(A) & function(A) -> (all B all C (C = relation_inverse_image(A,B) <-> (all D (in(D,C) <-> in(D,relation_dom(A)) & in(apply(A,D),B))))))) # label(d13_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 7 (all A (relation(A) -> (all B all C (C = fiber(A,B) <-> (all D (in(D,C) <-> D != B & in(ordered_pair(D,B),A))))))) # label(d1_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 8 (all A (relation(A) -> (well_founded_relation(A) <-> (all B -(subset(B,relation_field(A)) & B != empty_set & (all C -(in(C,B) & disjoint(fiber(A,C),B)))))))) # label(d2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 9 (all A (relation(A) & function(A) -> (all B (B = relation_rng(A) <-> (all C (in(C,B) <-> (exists D (in(D,relation_dom(A)) & C = apply(A,D))))))))) # label(d5_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 10 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 11 (all A (relation(A) -> relation_field(A) = set_union2(relation_dom(A),relation_rng(A)))) # label(d6_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 12 (all A (relation(A) -> (all B (relation(B) -> (all C (relation(C) & function(C) -> (relation_isomorphism(A,B,C) <-> relation_dom(C) = relation_field(A) & relation_rng(C) = relation_field(B) & one_to_one(C) & (all D all E (in(ordered_pair(D,E),A) <-> in(D,relation_field(A)) & in(E,relation_field(A)) & in(ordered_pair(apply(C,D),apply(C,E)),B)))))))))) # label(d7_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 13 $T # label(dt_k10_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 14 $T # label(dt_k1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 15 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 16 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 17 $T # label(dt_k1_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 18 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 19 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 20 (all A (relation(A) & function(A) -> relation(function_inverse(A)) & function(function_inverse(A)))) # label(dt_k2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 21 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 22 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 23 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 24 $T # label(dt_k3_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 25 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 26 (all A all B (relation(A) & relation(B) -> relation(relation_composition(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 27 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 28 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 29 (all A all B (relation(A) & function(A) & relation(B) & function(B) -> relation(relation_composition(A,B)) & function(relation_composition(A,B)))) # label(fc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 30 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 31 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 32 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 33 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 34 (all A (relation(A) -> (reflexive(A) <-> (all B (in(B,relation_field(A)) -> in(ordered_pair(B,B),A)))))) # label(l1_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 35 (all A (relation(A) -> (transitive(A) <-> (all B all C all D (in(ordered_pair(B,C),A) & in(ordered_pair(C,D),A) -> in(ordered_pair(B,D),A)))))) # label(l2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 36 (all A (relation(A) -> (antisymmetric(A) <-> (all B all C (in(ordered_pair(B,C),A) & in(ordered_pair(C,B),A) -> B = C))))) # label(l3_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 37 (all A (relation(A) -> (connected(A) <-> (all B all C -(in(B,relation_field(A)) & in(C,relation_field(A)) & B != C & -in(ordered_pair(B,C),A) & -in(ordered_pair(C,B),A)))))) # label(l4_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 38 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 39 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 40 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 41 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 42 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 43 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 44 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 45 (all A all B (relation(B) -> subset(relation_inverse_image(B,A),relation_dom(B)))) # label(t167_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 46 (all A all B (relation(B) -> -(A != empty_set & subset(A,relation_rng(B)) & relation_inverse_image(B,A) = empty_set))) # label(t174_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 47 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 48 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 49 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 50 (all A all B all C (relation(C) -> (in(ordered_pair(A,B),C) -> in(A,relation_field(C)) & in(B,relation_field(C))))) # label(t30_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 51 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 52 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 53 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 54 (all A (relation(A) & function(A) -> (one_to_one(A) -> relation_rng(A) = relation_dom(function_inverse(A)) & relation_dom(A) = relation_rng(function_inverse(A))))) # label(t55_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 55 (all A all B (relation(B) & function(B) -> (one_to_one(B) & in(A,relation_rng(B)) -> A = apply(B,apply(function_inverse(B),A)) & A = apply(relation_composition(function_inverse(B),B),A)))) # label(t57_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 56 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 57 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 58 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 59 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.79 60 -(all A (relation(A) -> (all B (relation(B) -> (all C (relation(C) & function(C) -> (relation_isomorphism(A,B,C) -> (reflexive(A) -> reflexive(B)) & (transitive(A) -> transitive(B)) & (connected(A) -> connected(B)) & (antisymmetric(A) -> antisymmetric(B)) & (well_founded_relation(A) -> well_founded_relation(B))))))))) # label(t53_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/0.79
% 0.49/0.79 ============================== end of process non-clausal formulas ===
% 0.49/0.79
% 0.49/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.79
% 0.49/0.79 ============================== PREDICATE ELIMINATION =================
% 0.49/0.79 61 -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | -one_to_one(C) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(f8(A,B,C),relation_field(A)) # label(d7_wellord1) # label(axiom). [clausify(12)].
% 0.49/0.79 62 -relation(A) | -empty(A) | -function(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(3)].
% 0.49/0.79 63 -relation(A) | -relation(B) | -relation(C) | -function(C) | -relation_isomorphism(A,B,C) | one_to_one(C) # label(d7_wellord1) # label(axiom). [clausify(12)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(f8(A,B,C),relation_field(A)) | -relation(C) | -empty(C) | -function(C). [resolve(61,h,62,d)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(f8(A,B,C),relation_field(A)) | -relation(D) | -relation(E) | -relation(C) | -function(C) | -relation_isomorphism(D,E,C). [resolve(61,h,63,f)].
% 0.49/0.79 64 -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | -one_to_one(C) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(f9(A,B,C),relation_field(A)) # label(d7_wellord1) # label(axiom). [clausify(12)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(f9(A,B,C),relation_field(A)) | -relation(C) | -empty(C) | -function(C). [resolve(64,h,62,d)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(f9(A,B,C),relation_field(A)) | -relation(D) | -relation(E) | -relation(C) | -function(C) | -relation_isomorphism(D,E,C). [resolve(64,h,63,f)].
% 0.49/0.79 65 -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | -one_to_one(C) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(ordered_pair(apply(C,f8(A,B,C)),apply(C,f9(A,B,C))),B) # label(d7_wellord1) # label(axiom). [clausify(12)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(ordered_pair(apply(C,f8(A,B,C)),apply(C,f9(A,B,C))),B) | -relation(C) | -empty(C) | -function(C). [resolve(65,h,62,d)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | in(ordered_pair(apply(C,f8(A,B,C)),apply(C,f9(A,B,C))),B) | -relation(D) | -relation(E) | -relation(C) | -function(C) | -relation_isomorphism(D,E,C). [resolve(65,h,63,f)].
% 0.49/0.79 66 -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | -one_to_one(C) | -in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | -in(f8(A,B,C),relation_field(A)) | -in(f9(A,B,C),relation_field(A)) | -in(ordered_pair(apply(C,f8(A,B,C)),apply(C,f9(A,B,C))),B) # label(d7_wellord1) # label(axiom). [clausify(12)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | -in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | -in(f8(A,B,C),relation_field(A)) | -in(f9(A,B,C),relation_field(A)) | -in(ordered_pair(apply(C,f8(A,B,C)),apply(C,f9(A,B,C))),B) | -relation(C) | -empty(C) | -function(C). [resolve(66,h,62,d)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(C) | -function(C) | relation_isomorphism(A,B,C) | relation_field(A) != relation_dom(C) | relation_rng(C) != relation_field(B) | -in(ordered_pair(f8(A,B,C),f9(A,B,C)),A) | -in(f8(A,B,C),relation_field(A)) | -in(f9(A,B,C),relation_field(A)) | -in(ordered_pair(apply(C,f8(A,B,C)),apply(C,f9(A,B,C))),B) | -relation(D) | -relation(E) | -relation(C) | -function(C) | -relation_isomorphism(D,E,C). [resolve(66,h,63,f)].
% 0.49/0.79 67 one_to_one(c5) # label(rc3_funct_1) # label(axiom). [clausify(42)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(c5) | -function(c5) | relation_isomorphism(A,B,c5) | relation_field(A) != relation_dom(c5) | relation_rng(c5) != relation_field(B) | in(ordered_pair(f8(A,B,c5),f9(A,B,c5)),A) | in(f8(A,B,c5),relation_field(A)). [resolve(67,a,61,h)].
% 0.49/0.79 Derived: -relation(A) | -relation(B) | -relation(c5) | -function(c5) | relation_isomorphism(A,B,c5) | relation_field(A) != relation_dom(c5) | relation_rng(c5) != relation_field(B) | in(ordered_pair(f8(A,B,c5),f9(A,B,c5)),A) | in(f9(A,B,c5),relation_field(A)). [resolve(67,a,64,h)].
% 0.49/0.88 Derived: -relation(A) | -relation(B) | -relation(c5) | -function(c5) | relation_isomorphism(A,B,c5) | relation_field(A) != relation_dom(c5) | relation_rng(c5) != relation_field(B) | in(ordered_pair(f8(A,B,c5),f9(A,B,c5)),A) | in(ordered_pair(apply(c5,f8(A,B,c5)),apply(c5,f9(A,B,c5))),B). [resolve(67,a,65,h)].
% 0.49/0.88 Derived: -relation(A) | -relation(B) | -relation(c5) | -function(c5) | relation_isomorphism(A,B,c5) | relation_field(A) != relation_dom(c5) | relation_rng(c5) != relation_field(B) | -in(ordered_pair(f8(A,B,c5),f9(A,B,c5)),A) | -in(f8(A,B,c5),relation_field(A)) | -in(f9(A,B,c5),relation_field(A)) | -in(ordered_pair(apply(c5,f8(A,B,c5)),apply(c5,f9(A,B,c5))),B). [resolve(67,a,66,h)].
% 0.49/0.88 68 -relation(A) | -function(A) | -one_to_one(A) | relation_rng(A) = relation_dom(function_inverse(A)) # label(t55_funct_1) # label(axiom). [clausify(54)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | relation_rng(A) = relation_dom(function_inverse(A)) | -relation(A) | -empty(A) | -function(A). [resolve(68,c,62,d)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | relation_rng(A) = relation_dom(function_inverse(A)) | -relation(B) | -relation(C) | -relation(A) | -function(A) | -relation_isomorphism(B,C,A). [resolve(68,c,63,f)].
% 0.49/0.88 Derived: -relation(c5) | -function(c5) | relation_rng(c5) = relation_dom(function_inverse(c5)). [resolve(68,c,67,a)].
% 0.49/0.88 69 -relation(A) | -function(A) | -one_to_one(A) | relation_rng(function_inverse(A)) = relation_dom(A) # label(t55_funct_1) # label(axiom). [clausify(54)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | relation_rng(function_inverse(A)) = relation_dom(A) | -relation(A) | -empty(A) | -function(A). [resolve(69,c,62,d)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | relation_rng(function_inverse(A)) = relation_dom(A) | -relation(B) | -relation(C) | -relation(A) | -function(A) | -relation_isomorphism(B,C,A). [resolve(69,c,63,f)].
% 0.49/0.88 Derived: -relation(c5) | -function(c5) | relation_rng(function_inverse(c5)) = relation_dom(c5). [resolve(69,c,67,a)].
% 0.49/0.88 70 -relation(A) | -function(A) | -one_to_one(A) | -in(B,relation_rng(A)) | apply(A,apply(function_inverse(A),B)) = B # label(t57_funct_1) # label(axiom). [clausify(55)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | -in(B,relation_rng(A)) | apply(A,apply(function_inverse(A),B)) = B | -relation(A) | -empty(A) | -function(A). [resolve(70,c,62,d)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | -in(B,relation_rng(A)) | apply(A,apply(function_inverse(A),B)) = B | -relation(C) | -relation(D) | -relation(A) | -function(A) | -relation_isomorphism(C,D,A). [resolve(70,c,63,f)].
% 0.49/0.88 Derived: -relation(c5) | -function(c5) | -in(A,relation_rng(c5)) | apply(c5,apply(function_inverse(c5),A)) = A. [resolve(70,c,67,a)].
% 0.49/0.88 71 -relation(A) | -function(A) | -one_to_one(A) | -in(B,relation_rng(A)) | apply(relation_composition(function_inverse(A),A),B) = B # label(t57_funct_1) # label(axiom). [clausify(55)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | -in(B,relation_rng(A)) | apply(relation_composition(function_inverse(A),A),B) = B | -relation(A) | -empty(A) | -function(A). [resolve(71,c,62,d)].
% 0.49/0.88 Derived: -relation(A) | -function(A) | -in(B,relation_rng(A)) | apply(relation_composition(function_inverse(A),A),B) = B | -relation(C) | -relation(D) | -relation(A) | -function(A) | -relation_isomorphism(C,D,A). [resolve(71,c,63,f)].
% 0.49/0.88 Derived: -relation(c5) | -function(c5) | -in(A,relation_rng(c5)) | apply(relation_composition(function_inverse(c5),c5),A) = A. [resolve(71,c,67,a)].
% 0.49/0.88
% 0.49/0.88 ============================== end predicate elimination =============
% 0.49/0.88
% 0.49/0.88 Auto_denials: (non-Horn, no changes).
% 0.49/0.88
% 0.49/0.88 Term ordering decisions:
% 0.49/0.88 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. ordered_pair=1. apply=1. relation_inverse_image=1. fiber=1. set_union2=1. relation_composition=1. unordered_pair=1. f3=1. f6=1. f7=1. f19=1. relation_field=1. relation_rng=1. relation_dom=1. function_inverse=1. powerset=1. singleton=1. f4=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f1Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------