TSTP Solution File: SEU367+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:31:18 EDT 2022
% Result : Timeout 300.02s 300.40s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 13:30:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.76/1.02 ============================== Prover9 ===============================
% 0.76/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02 Process 24214 was started by sandbox on n021.cluster.edu,
% 0.76/1.02 Mon Jun 20 13:30:04 2022
% 0.76/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24061_n021.cluster.edu".
% 0.76/1.02 ============================== end of head ===========================
% 0.76/1.02
% 0.76/1.02 ============================== INPUT =================================
% 0.76/1.02
% 0.76/1.02 % Reading from file /tmp/Prover9_24061_n021.cluster.edu
% 0.76/1.02
% 0.76/1.02 set(prolog_style_variables).
% 0.76/1.02 set(auto2).
% 0.76/1.02 % set(auto2) -> set(auto).
% 0.76/1.02 % set(auto) -> set(auto_inference).
% 0.76/1.02 % set(auto) -> set(auto_setup).
% 0.76/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02 % set(auto) -> set(auto_limits).
% 0.76/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02 % set(auto) -> set(auto_denials).
% 0.76/1.02 % set(auto) -> set(auto_process).
% 0.76/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02 % set(auto2) -> assign(stats, some).
% 0.76/1.02 % set(auto2) -> clear(echo_input).
% 0.76/1.02 % set(auto2) -> set(quiet).
% 0.76/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02 % set(auto2) -> clear(print_given).
% 0.76/1.02 assign(lrs_ticks,-1).
% 0.76/1.02 assign(sos_limit,10000).
% 0.76/1.02 assign(order,kbo).
% 0.76/1.02 set(lex_order_vars).
% 0.76/1.02 clear(print_given).
% 0.76/1.02
% 0.76/1.02 % formulas(sos). % not echoed (53 formulas)
% 0.76/1.02
% 0.76/1.02 ============================== end of input ==========================
% 0.76/1.02
% 0.76/1.02 % From the command line: assign(max_seconds, 300).
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02
% 0.76/1.02 % Formulas that are not ordinary clauses:
% 0.76/1.02 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 2 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 3 (all A all B all C (element(C,powerset(cartesian_product2(A,B))) -> relation(C))) # label(cc1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 4 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 5 (all A (-empty_carrier(A) & one_sorted_str(A) -> (all B (-empty_carrier(B) & net_str(B,A) -> (all C (is_eventually_in(A,B,C) <-> (exists D (element(D,the_carrier(B)) & (all E (element(E,the_carrier(B)) -> (related(B,D,E) -> in(apply_netmap(A,B,E),C)))))))))))) # label(d11_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 6 (all A (-empty_carrier(A) & one_sorted_str(A) -> (all B (-empty_carrier(B) & net_str(B,A) -> (all C (is_often_in(A,B,C) <-> (all D (element(D,the_carrier(B)) -> (exists E (element(E,the_carrier(B)) & related(B,D,E) & in(apply_netmap(A,B,E),C))))))))))) # label(d12_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 7 (all A (-empty_carrier(A) & one_sorted_str(A) -> (all B (-empty_carrier(B) & net_str(B,A) -> (all C (element(C,the_carrier(B)) -> apply_netmap(A,B,C) = apply_on_structs(B,A,the_mapping(A,B),C))))))) # label(d8_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 8 $T # label(dt_k1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 9 (all A all B all C all D (-empty_carrier(A) & one_sorted_str(A) & -empty_carrier(B) & one_sorted_str(B) & function(C) & quasi_total(C,the_carrier(A),the_carrier(B)) & relation_of2(C,the_carrier(A),the_carrier(B)) & element(D,the_carrier(A)) -> element(apply_on_structs(A,B,C,D),the_carrier(B)))) # label(dt_k1_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 10 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 11 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 12 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 13 (all A all B all C (-empty_carrier(A) & one_sorted_str(A) & -empty_carrier(B) & net_str(B,A) & element(C,the_carrier(B)) -> element(apply_netmap(A,B,C),the_carrier(A)))) # label(dt_k3_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 14 (all A (rel_str(A) -> one_sorted_str(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 15 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 16 (all A (one_sorted_str(A) -> (all B (net_str(B,A) -> rel_str(B))))) # label(dt_l1_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 17 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 18 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 19 (all A all B all C (relation_of2_as_subset(C,A,B) -> element(C,powerset(cartesian_product2(A,B))))) # label(dt_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 20 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 21 (all A all B (one_sorted_str(A) & net_str(B,A) -> function(the_mapping(A,B)) & quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)) & relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)))) # label(dt_u1_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 22 (exists A rel_str(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 23 (exists A one_sorted_str(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 24 (all A (one_sorted_str(A) -> (exists B net_str(B,A)))) # label(existence_l1_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 25 (all A all B exists C relation_of2(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 26 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 27 (all A all B exists C relation_of2_as_subset(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 28 (all A all B (finite(A) & finite(B) -> finite(cartesian_product2(A,B)))) # label(fc14_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 29 (all A (-empty_carrier(A) & one_sorted_str(A) -> -empty(the_carrier(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 30 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 31 (all A all B (-empty(A) & -empty(B) -> -empty(cartesian_product2(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 32 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 33 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 34 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 35 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 36 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 37 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 38 (exists A (one_sorted_str(A) & -empty_carrier(A))) # label(rc3_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 39 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 40 (all A (-empty_carrier(A) & one_sorted_str(A) -> (exists B (element(B,powerset(the_carrier(A))) & -empty(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 41 (all A all B all C all D (-empty_carrier(A) & one_sorted_str(A) & -empty_carrier(B) & one_sorted_str(B) & function(C) & quasi_total(C,the_carrier(A),the_carrier(B)) & relation_of2(C,the_carrier(A),the_carrier(B)) & element(D,the_carrier(A)) -> apply_on_structs(A,B,C,D) = apply(C,D))) # label(redefinition_k1_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 42 (all A all B all C (relation_of2_as_subset(C,A,B) <-> relation_of2(C,A,B))) # label(redefinition_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 43 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 44 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 45 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 46 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 47 (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.76/1.02 48 (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.76/1.02 49 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 50 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 51 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 52 -(all A (-empty_carrier(A) & one_sorted_str(A) -> (all B (-empty_carrier(B) & net_str(B,A) -> (all C all D (subset(C,D) -> (is_eventually_in(A,B,C) -> is_eventually_in(A,B,D)) & (is_often_in(A,B,C) -> is_often_in(A,B,D)))))))) # label(t8_waybel_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02 53 -rel_str(A) | one_sorted_str(A) # label(dt_l1_orders_2) # label(axiom). [clausify(14)].
% 0.76/1.02 54 rel_str(c1) # label(existence_l1_orders_2) # label(axiom). [clausify(22)].
% 0.76/1.02 Derived: one_sorted_str(c1). [resolve(53,a,54,a)].
% 0.76/1.02 55 -one_sorted_str(A) | -net_str(B,A) | rel_str(B) # label(dt_l1_waybel_0) # label(axiom). [clausify(16)].
% 0.76/1.02 Derived: -one_sorted_str(A) | -net_str(B,A) | one_sorted_str(B). [resolve(55,c,53,a)].
% 0.76/1.02 56 element(A,powerset(B)) | -subset(A,B) # label(t3_subset) # label(axiom). [clausify(46)].
% 0.76/1.02 57 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(43)].
% 0.76/1.02 58 subset(c9,c10) # label(t8_waybel_0) # label(negated_conjecture). [clausify(52)].
% 0.76/1.02 59 -element(A,powerset(B)) | subset(A,B) # label(t3_subset) # label(axiom). [clausify(46)].
% 0.76/1.02 Derived: element(A,powerset(A)). [resolve(56,b,57,a)].
% 0.76/1.02 Derived: element(c9,powerset(c10)). [resolve(56,b,58,a)].
% 0.76/1.02 60 -one_sorted_str(A) | -net_str(B,A) | function(the_mapping(A,B)) # label(dt_u1_waybel_0) # label(axiom). [clausify(21)].
% 0.76/1.02 61 net_str(c8,c7) # label(t8_waybel_0) # label(negated_conjecture). [clausify(52)].
% 0.76/1.02 62 -one_sorted_str(A) | net_str(f5(A),A) # label(existence_l1_waybel_0) # label(axiom). [clausify(24)].
% 0.76/1.02 Derived: -one_sorted_str(c7) | function(the_mapping(c7,c8)). [resolve(60,b,61,a)].
% 0.76/1.02 Derived: -one_sorted_str(A) | function(the_mapping(A,f5(A))) | -one_sorted_str(A). [resolve(60,b,62,b)].
% 0.76/1.02 63 -one_sorted_str(A) | -net_str(B,A) | quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)) # label(dt_u1_waybel_0) # label(axiom). [clausify(21)].
% 0.76/1.02 Derived: -one_sorted_str(c7) | quasi_total(the_mapping(c7,c8),the_carrier(c8),the_carrier(c7)). [resolve(63,b,61,a)].
% 0.76/1.02 Derived: -one_sorted_str(A) | quasi_total(the_mapping(A,f5(A)),the_carrier(f5(A)),the_carrier(A)) | -one_sorted_str(A). [resolve(63,b,62,b)].
% 0.76/1.02 64 -one_sorted_str(A) | -net_str(B,A) | relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)) # label(dt_u1_waybel_0) # label(axiom). [clausify(21)].
% 0.76/1.02 Derived: -one_sorted_str(c7) | relation_of2_as_subset(the_mapping(c7,c8),the_carrier(c8),the_carrier(c7)). [resolve(64,b,61,a)].
% 0.76/1.02 Derived: -one_sorted_str(A) | relation_of2_as_subset(the_mapping(A,f5(A)),the_carrier(f5(A)),the_carrier(A)) | -one_sorted_str(A). [resolve(64,b,62,b)].
% 0.76/1.02 65 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -is_eventually_in(A,B,C) | element(f1(A,B,C),the_carrier(B)) # label(d11_waybel_0) # label(axiom). [clausify(5)].
% 0.76/1.02 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -is_eventually_in(c7,c8,A) | element(f1(c7,c8,A),the_carrier(c8)). [resolve(65,d,61,a)].
% 0.76/1.02 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -is_eventually_in(A,f5(A),B) | element(f1(A,f5(A),B),the_carrier(f5(A))) | -one_sorted_str(A). [resolve(65,d,62,b)].
% 0.76/1.02 66 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | is_often_in(A,B,C) | element(f4(A,B,C),the_carrier(B)) # label(d12_waybel_0) # label(axiom). [clausify(6)].
% 0.76/1.02 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | is_often_in(c7,c8,A) | element(f4(c7,c8,A),the_carrier(c8)). [resolve(66,d,61,a)].
% 0.76/1.02 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | is_often_in(A,f5(A),B) | element(f4(A,f5(A),B),the_carrier(f5(A))) | -one_sorted_str(A). [resolve(66,d,62,b)].
% 0.76/1.02 67 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -element(C,the_carrier(B)) | element(apply_netmap(A,B,C),the_carrier(A)) # label(dt_k3_waybel_0) # label(axiom). [clausify(13)].
% 0.76/1.02 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -element(A,the_carrier(c8)) | element(apply_netmap(c7,c8,A),the_carrier(c7)). [resolve(67,d,61,a)].
% 0.76/1.02 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -element(B,the_carrier(f5(A))) | element(apply_netmap(A,f5(A),B),the_carrier(A)) | -one_sorted_str(A). [resolve(67,d,62,b)].
% 0.76/1.02 68 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | is_eventually_in(A,B,C) | -element(D,the_carrier(B)) | element(f2(A,B,C,D),the_carrier(B)) # label(d11_waybel_0) # label(axiom). [clausify(5)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | is_eventually_in(c7,c8,A) | -element(B,the_carrier(c8)) | element(f2(c7,c8,A,B),the_carrier(c8)). [resolve(68,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | is_eventually_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | element(f2(A,f5(A),B,C),the_carrier(f5(A))) | -one_sorted_str(A). [resolve(68,d,62,b)].
% 0.76/1.03 69 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | is_eventually_in(A,B,C) | -element(D,the_carrier(B)) | related(B,D,f2(A,B,C,D)) # label(d11_waybel_0) # label(axiom). [clausify(5)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | is_eventually_in(c7,c8,A) | -element(B,the_carrier(c8)) | related(c8,B,f2(c7,c8,A,B)). [resolve(69,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | is_eventually_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | related(f5(A),C,f2(A,f5(A),B,C)) | -one_sorted_str(A). [resolve(69,d,62,b)].
% 0.76/1.03 70 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -is_often_in(A,B,C) | -element(D,the_carrier(B)) | element(f3(A,B,C,D),the_carrier(B)) # label(d12_waybel_0) # label(axiom). [clausify(6)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -is_often_in(c7,c8,A) | -element(B,the_carrier(c8)) | element(f3(c7,c8,A,B),the_carrier(c8)). [resolve(70,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -is_often_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | element(f3(A,f5(A),B,C),the_carrier(f5(A))) | -one_sorted_str(A). [resolve(70,d,62,b)].
% 0.76/1.03 71 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -is_often_in(A,B,C) | -element(D,the_carrier(B)) | related(B,D,f3(A,B,C,D)) # label(d12_waybel_0) # label(axiom). [clausify(6)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -is_often_in(c7,c8,A) | -element(B,the_carrier(c8)) | related(c8,B,f3(c7,c8,A,B)). [resolve(71,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -is_often_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | related(f5(A),C,f3(A,f5(A),B,C)) | -one_sorted_str(A). [resolve(71,d,62,b)].
% 0.76/1.03 72 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -element(C,the_carrier(B)) | apply_on_structs(B,A,the_mapping(A,B),C) = apply_netmap(A,B,C) # label(d8_waybel_0) # label(axiom). [clausify(7)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -element(A,the_carrier(c8)) | apply_on_structs(c8,c7,the_mapping(c7,c8),A) = apply_netmap(c7,c8,A). [resolve(72,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -element(B,the_carrier(f5(A))) | apply_on_structs(f5(A),A,the_mapping(A,f5(A)),B) = apply_netmap(A,f5(A),B) | -one_sorted_str(A). [resolve(72,d,62,b)].
% 0.76/1.03 73 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | is_eventually_in(A,B,C) | -element(D,the_carrier(B)) | -in(apply_netmap(A,B,f2(A,B,C,D)),C) # label(d11_waybel_0) # label(axiom). [clausify(5)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | is_eventually_in(c7,c8,A) | -element(B,the_carrier(c8)) | -in(apply_netmap(c7,c8,f2(c7,c8,A,B)),A). [resolve(73,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | is_eventually_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | -in(apply_netmap(A,f5(A),f2(A,f5(A),B,C)),B) | -one_sorted_str(A). [resolve(73,d,62,b)].
% 0.76/1.03 74 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -is_often_in(A,B,C) | -element(D,the_carrier(B)) | in(apply_netmap(A,B,f3(A,B,C,D)),C) # label(d12_waybel_0) # label(axiom). [clausify(6)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -is_often_in(c7,c8,A) | -element(B,the_carrier(c8)) | in(apply_netmap(c7,c8,f3(c7,c8,A,B)),A). [resolve(74,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -is_often_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | in(apply_netmap(A,f5(A),f3(A,f5(A),B,C)),B) | -one_sorted_str(A). [resolve(74,d,62,b)].
% 0.76/1.03 75 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | -is_eventually_in(A,B,C) | -element(D,the_carrier(B)) | -related(B,f1(A,B,C),D) | in(apply_netmap(A,B,D),C) # label(d11_waybel_0) # label(axiom). [clausify(5)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | -is_eventually_in(c7,c8,A) | -element(B,the_carrier(c8)) | -related(c8,f1(c7,c8,A),B) | in(apply_netmap(c7,c8,B),A). [resolve(75,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | -is_eventually_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | -related(f5(A),f1(A,f5(A),B),C) | in(apply_netmap(A,f5(A),C),B) | -one_sorted_str(A). [resolve(75,d,62,b)].
% 0.76/1.03 76 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -net_str(B,A) | is_often_in(A,B,C) | -element(D,the_carrier(B)) | -related(B,f4(A,B,C),D) | -in(apply_netmap(A,B,D),C) # label(d12_waybel_0) # label(axiom). [clausify(6)].
% 0.76/1.03 Derived: empty_carrier(c7) | -one_sorted_str(c7) | empty_carrier(c8) | is_often_in(c7,c8,A) | -element(B,the_carrier(c8)) | -related(c8,f4(c7,c8,A),B) | -in(apply_netmap(c7,c8,B),A). [resolve(76,d,61,a)].
% 0.76/1.03 Derived: empty_carrier(A) | -one_sorted_str(A) | empty_carrier(f5(A)) | is_often_in(A,f5(A),B) | -element(C,the_carrier(f5(A))) | -related(f5(A),f4(A,f5(A),B),C) | -in(apply_netmap(A,f5(A),C),B) | -one_sorted_str(A). [resolve(76,d,62,b)].
% 0.76/1.03 77 -one_sorted_str(A) | -net_str(B,A) | one_sorted_str(B). [resolve(55,c,53,a)].
% 0.76/1.03 Derived: -one_sorted_str(c7) | one_sorted_str(c8). [resolve(77,b,61,a)].
% 0.76/1.03 Derived: -one_sorted_str(A) | one_sorted_str(f5(A)) | -one_sorted_str(A). [resolve(77,b,62,b)].
% 0.76/1.03 78 -relation_of2_as_subset(A,B,C) | relation_of2(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(42)].
% 0.76/1.03 79 relation_of2_as_subset(f8(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(27)].
% 0.76/1.03 Derived: relation_of2(f8(A,B),A,B). [resolve(78,a,79,a)].
% 0.76/1.03 80 relation_of2_as_subset(A,B,C) | -relation_of2(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(42)].
% 0.76/1.04 81 -relation_of2_as_subset(A,B,C) | element(A,powerset(cartesian_product2(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(19)].
% 0.76/1.04 Derived: element(f8(A,B),powerset(cartesian_product2(A,B))). [resolve(81,a,79,a)].
% 0.76/1.04 Derived: element(A,powerset(cartesian_product2(B,C))) | -relation_of2(A,B,C). [resolve(81,a,80,a)].
% 0.76/1.04 82 -one_sorted_str(c7) | relation_of2_as_subset(the_mapping(c7,c8),the_carrier(c8),the_carrier(c7)). [resolve(64,b,61,a)].
% 0.76/1.04 Derived: -one_sorted_str(c7) | relation_of2(the_mapping(c7,c8),the_carrier(c8),the_carrier(c7)). [resolve(82,b,78,a)].
% 0.76/1.04 Derived: -one_sorted_str(c7) | element(the_mapping(c7,c8),powerset(cartesian_product2(the_carrier(c8),the_carrier(c7)))). [resolve(82,b,81,a)].
% 0.76/1.04 83 -one_sorted_str(A) | relation_of2_as_subset(the_mapping(A,f5(A)),the_carrier(f5(A)),the_carrier(A)) | -one_sorted_str(A). [resolve(64,b,62,b)].
% 0.76/1.04 Derived: -one_sorted_str(A) | -one_sorted_str(A) | relation_of2(the_mapping(A,f5(A)),the_carrier(f5(A)),the_carrier(A)). [resolve(83,b,78,a)].
% 0.76/1.04 Derived: -one_sorted_str(A) | -one_sorted_str(A) | element(the_mapping(A,f5(A)),powerset(cartesian_product2(the_carrier(f5(A)),the_carrier(A)))). [resolve(83,b,81,a)].
% 0.76/1.04 84 -one_sorted_str(c7) | function(the_mapping(c7,c8)). [resolve(60,b,61,a)].
% 0.76/1.04 85 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -one_sorted_str(B) | -function(C) | -quasi_total(C,the_carrier(A),the_carrier(B)) | -relation_of2(C,the_carrier(A),the_carrier(B)) | -element(D,the_carrier(A)) | element(apply_on_structs(A,B,C,D),the_carrier(B)) # label(dt_k1_waybel_0) # label(axiom). [clausify(9)].
% 0.76/1.04 86 empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -one_sorted_str(B) | -function(C) | -quasi_total(C,the_carrier(A),the_carrier(B)) | -relation_of2(C,the_carrier(A),the_carrier(B)) | -element(D,the_carrier(A)) | apply(C,D) = apply_on_structs(A,B,C,D) # label(redefinition_k1_waybel_0) # label(axiom). [clausify(41)].
% 0.76/1.04 Derived: -one_sorted_str(c7) | empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -one_sorted_str(B) | -quasi_total(the_mapping(c7,c8),the_carrier(A),the_carrier(B)) | -relation_of2(the_mapping(c7,c8),the_carrier(A),the_carrier(B)) | -element(C,the_carrier(A)) | element(apply_on_structs(A,B,the_mapping(c7,c8),C),the_carrier(B)). [resolve(84,b,85,e)].
% 0.76/1.04 Derived: -one_sorted_str(c7) | empty_carrier(A) | -one_sorted_str(A) | empty_carrier(B) | -one_sorted_str(B) | -quasi_total(the_mapping(c7,c8),the_carrier(A),the_carrier(B)) | -relation_of2(the_mapping(c7,c8),the_carrier(A),the_carrier(B)) | -element(C,the_carrier(A)) | apply(the_mapping(c7,c8),C) = apply_on_structs(A,B,the_mapping(c7,c8),C). [resolve(84,b,86,e)].
% 0.76/1.04 87 -one_sorted_str(A) | function(the_mapping(A,f5(A))) | -one_sorted_str(A). [resolve(60,b,62,b)].
% 0.76/1.04 Derived: -one_sorted_str(A) | -one_sorted_str(A) | empty_carrier(B) | -one_sorted_str(B) | empty_carrier(C) | -one_sorted_str(C) | -quasi_total(the_mapping(A,f5(A)),the_carrier(B),the_carrier(C)) | -relation_of2(the_mapping(A,f5(A)),the_carrier(B),the_carrier(C)) | -element(D,the_carrier(B)) | element(apply_on_structs(B,C,the_mapping(A,f5(A)),D),the_carrier(C)). [resolve(87,b,85,e)].
% 0.76/1.04 Derived: -one_sorted_str(A) | -one_sorted_str(A) | empty_carrier(B) | -one_sorted_str(B) | empty_carrier(C) | -one_sorted_str(C) | -quasi_total(the_mapping(A,f5(A)),the_carrier(B),the_carrier(C)) | -relation_of2(the_mapping(A,f5(A)),the_carrier(B),the_carrier(C)) | -element(D,the_carrier(B)) | apply(the_mapping(A,f5(A)),D) = apply_on_structs(B,C,the_mapping(A,f5(A)),D). [resolve(87,b,86,e)].
% 0.76/1.04
% 0.76/1.04 ============================== end predicate elimination =============
% 0.76/1.04
% 0.76/1.04 Auto_denials: (non-Horn, no changes).
% 0.76/1.04
% 0.76/1.04 Term ordering decisions:
% 0.76/1.04 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. the_mapping=1. cartesian_product2=1. apply=1. f6=1. f8=1. the_carrier=1. powerset=1. f5=1. f7=1. f9=1. f10=1. f11=1. f12=1. f13=1. apply_netmap=1. f1=1. f4=1. apply_on_structs=1. f2=1. f3=1.
% 0.76/1.04
% 0.76/1.04 =====================Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------