TSTP Solution File: ALG226+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG226+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Thu Jul 14 17:54:08 EDT 2022
% Result : Timeout 300.09s 300.41s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.16 % Problem : ALG226+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.17 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.38 % Computer : n022.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8042.1875MB
% 0.12/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 600
% 0.12/0.38 % DateTime : Wed Jun 8 22:10:34 EDT 2022
% 0.12/0.38 % CPUTime :
% 0.30/1.05 ============================== Prover9 ===============================
% 0.30/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.30/1.05 Process 8217 was started by sandbox on n022.cluster.edu,
% 0.30/1.05 Wed Jun 8 22:10:35 2022
% 0.30/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8064_n022.cluster.edu".
% 0.30/1.05 ============================== end of head ===========================
% 0.30/1.05
% 0.30/1.05 ============================== INPUT =================================
% 0.30/1.05
% 0.30/1.05 % Reading from file /tmp/Prover9_8064_n022.cluster.edu
% 0.30/1.05
% 0.30/1.05 set(prolog_style_variables).
% 0.30/1.05 set(auto2).
% 0.30/1.05 % set(auto2) -> set(auto).
% 0.30/1.05 % set(auto) -> set(auto_inference).
% 0.30/1.05 % set(auto) -> set(auto_setup).
% 0.30/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.30/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.30/1.05 % set(auto) -> set(auto_limits).
% 0.30/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.30/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.30/1.05 % set(auto) -> set(auto_denials).
% 0.30/1.05 % set(auto) -> set(auto_process).
% 0.30/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.30/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.30/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.30/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.30/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.30/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.30/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.30/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.30/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.30/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.30/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.30/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.30/1.05 % set(auto2) -> assign(stats, some).
% 0.30/1.05 % set(auto2) -> clear(echo_input).
% 0.30/1.05 % set(auto2) -> set(quiet).
% 0.30/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.30/1.05 % set(auto2) -> clear(print_given).
% 0.30/1.05 assign(lrs_ticks,-1).
% 0.30/1.05 assign(sos_limit,10000).
% 0.30/1.05 assign(order,kbo).
% 0.30/1.05 set(lex_order_vars).
% 0.30/1.05 clear(print_given).
% 0.30/1.05
% 0.30/1.05 % formulas(sos). % not echoed (57 formulas)
% 0.30/1.05
% 0.30/1.05 ============================== end of input ==========================
% 0.30/1.05
% 0.30/1.05 % From the command line: assign(max_seconds, 300).
% 0.30/1.05
% 0.30/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.30/1.05
% 0.30/1.05 % Formulas that are not ordinary clauses:
% 0.30/1.05 1 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 2 (all A (v1_xboole_0(A) -> v1_fraenkel(A))) # label(cc1_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 3 (all A (v1_xboole_0(A) -> v1_finset_1(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 4 (all A (v1_xboole_0(A) -> v1_funct_1(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 5 (all A all B (m1_pboole(B,A) -> (v3_relat_1(B) -> v1_pre_circ(B,A)))) # label(cc1_mssubfam) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 6 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (v2_relat_1(B) -> -v3_relat_1(B)))))) # label(cc1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 7 (all A (v1_relat_1(A) & v1_xboole_0(A) & v1_funct_1(A) -> v1_relat_1(A) & v1_funct_1(A) & v2_funct_1(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 8 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (v3_relat_1(B) -> -v2_relat_1(B)))))) # label(cc2_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 9 (all A all B k3_xboole_0(A,B) = k3_xboole_0(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 10 (all A all B (m1_pboole(B,A) -> (v2_relat_1(B) <-> (all C -(r2_hidden(C,A) & v1_xboole_0(k1_funct_1(B,C))))))) # label(d16_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 11 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (all C (C = k1_closure3(A,B) <-> C = a_2_0_closure3(A,B))))))) # label(d3_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 12 (all A all B (v1_relat_1(B) & v1_funct_1(B) -> (m1_pboole(B,A) <-> k1_relat_1(B) = A))) # label(d3_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 13 (all A all B all C (C = k3_xboole_0(A,B) <-> (all D (r2_hidden(D,C) <-> r2_hidden(D,A) & r2_hidden(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 14 $T # label(dt_k1_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 15 $T # label(dt_k1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 16 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 17 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 18 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 19 (all A all B (v1_relat_1(A) -> v1_relat_1(k7_relat_1(A,B)))) # label(dt_k7_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 20 (all A all B (m1_pboole(B,A) -> v1_relat_1(B) & v1_funct_1(B))) # label(dt_m1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 21 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 22 (all A exists B m1_pboole(B,A)) # label(existence_m1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 23 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 24 (all A all B (v1_finset_1(B) -> v1_finset_1(k3_xboole_0(A,B)))) # label(fc10_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 25 (all A all B (v1_finset_1(A) -> v1_finset_1(k3_xboole_0(A,B)))) # label(fc11_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 26 (all A all B all C (-v1_xboole_0(A) & v2_relat_1(B) & m1_pboole(B,A) & m1_subset_1(C,A) -> -v1_xboole_0(k1_funct_1(B,C)))) # label(fc2_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 27 (all A all B (v1_relat_1(A) & v1_funct_1(A) -> v1_relat_1(k7_relat_1(A,B)) & v1_funct_1(k7_relat_1(A,B)))) # label(fc4_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 28 (all A all B all C (-v1_xboole_0(B) & m1_pboole(C,B) -> (r2_hidden(A,a_2_0_closure3(B,C)) <-> (exists D (m1_subset_1(D,B) & A = D & k1_funct_1(C,D) != k1_xboole_0))))) # label(fraenkel_a_2_0_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 29 (all A all B all C (-v1_xboole_0(B) & v2_relat_1(C) & m1_pboole(C,B) -> (r2_hidden(A,a_2_1_closure3(B,C)) <-> (exists D (m1_subset_1(D,B) & A = D & k1_funct_1(C,D) != k1_xboole_0))))) # label(fraenkel_a_2_1_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 30 (all A all B k3_xboole_0(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 31 (exists A (v1_xboole_0(A) & v1_relat_1(A) & v1_funct_1(A) & v2_funct_1(A) & v1_finset_1(A) & v1_fraenkel(A))) # label(rc1_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 32 (exists A (-v1_xboole_0(A) & v1_finset_1(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 33 (exists A (v1_relat_1(A) & v1_funct_1(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 34 (exists A (v1_relat_1(A) & v3_relat_1(A) & v1_funct_1(A))) # label(rc1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 35 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 36 (exists A (v1_relat_1(A) & v1_xboole_0(A) & v1_funct_1(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 37 (all A exists B (m1_pboole(B,A) & v1_relat_1(B) & v3_relat_1(B) & v1_funct_1(B))) # label(rc2_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 38 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 39 (exists A (v1_relat_1(A) & v1_funct_1(A) & v2_funct_1(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 40 (all A exists B (m1_pboole(B,A) & v1_relat_1(B) & v2_relat_1(B) & v1_funct_1(B))) # label(rc3_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 41 (exists A (v1_relat_1(A) & v3_relat_1(A) & v1_funct_1(A))) # label(rc4_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 42 (exists A (v1_relat_1(A) & v2_relat_1(A) & v1_funct_1(A))) # label(rc5_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.05 43 (all A all B all C (m1_pboole(B,A) & m1_pboole(C,A) -> (r6_pboole(A,B,C) <-> B = C))) # label(redefinition_r6_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 44 (all A all B all C (m1_pboole(B,A) & m1_pboole(C,A) -> r6_pboole(A,B,B))) # label(reflexivity_r6_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 45 (all A all B all C (m1_pboole(B,A) & m1_pboole(C,A) -> (r6_pboole(A,B,C) -> r6_pboole(A,C,B)))) # label(symmetry_r6_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 46 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 47 (all A k3_xboole_0(A,k1_xboole_0) = k1_xboole_0) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 48 (all A all B (m1_subset_1(A,B) -> v1_xboole_0(B) | r2_hidden(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 49 (all A all B ((all C (r2_hidden(C,A) <-> r2_hidden(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 50 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.30/1.06 51 (all A all B all C (v1_relat_1(C) & v1_funct_1(C) -> (r2_hidden(B,k1_relat_1(k7_relat_1(C,A))) -> k1_funct_1(k7_relat_1(C,A),B) = k1_funct_1(C,B)))) # label(t70_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 52 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 53 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 54 (all A all B (v1_relat_1(B) -> k1_relat_1(k7_relat_1(B,A)) = k3_xboole_0(k1_relat_1(B),A))) # label(t90_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 55 (all A (v1_relat_1(A) & v1_funct_1(A) -> (all B (v1_relat_1(B) & v1_funct_1(B) -> (k1_relat_1(A) = k1_relat_1(B) & (all C (r2_hidden(C,k1_relat_1(A)) -> k1_funct_1(A,C) = k1_funct_1(B,C))) -> A = B))))) # label(t9_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.06 56 -(all A (-v1_xboole_0(A) -> (all B (v2_relat_1(B) & m1_pboole(B,A) -> (all C (v2_relat_1(C) & m1_pboole(C,A) -> (k1_closure3(A,B) = k1_closure3(A,C) & k7_relat_1(B,k1_closure3(A,B)) = k7_relat_1(C,k1_closure3(A,C)) -> r6_pboole(A,B,C)))))))) # label(t7_closure3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.06
% 0.75/1.06 ============================== end of process non-clausal formulas ===
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.06
% 0.75/1.06 ============================== PREDICATE ELIMINATION =================
% 0.75/1.06 57 v3_relat_1(c4) # label(rc1_pboole) # label(axiom). [clausify(34)].
% 0.75/1.06 58 -m1_pboole(A,B) | -v3_relat_1(A) | v1_pre_circ(A,B) # label(cc1_mssubfam) # label(axiom). [clausify(5)].
% 0.75/1.06 59 v1_xboole_0(A) | -m1_pboole(B,A) | -v2_relat_1(B) | -v3_relat_1(B) # label(cc1_pboole) # label(axiom). [clausify(6)].
% 0.75/1.06 60 v1_xboole_0(A) | -m1_pboole(B,A) | -v3_relat_1(B) | -v2_relat_1(B) # label(cc2_pboole) # label(axiom). [clausify(8)].
% 0.75/1.06 Derived: -m1_pboole(c4,A) | v1_pre_circ(c4,A). [resolve(57,a,58,b)].
% 0.75/1.06 Derived: v1_xboole_0(A) | -m1_pboole(c4,A) | -v2_relat_1(c4). [resolve(57,a,59,d)].
% 0.75/1.06 61 v3_relat_1(f7(A)) # label(rc2_pboole) # label(axiom). [clausify(37)].
% 0.75/1.06 Derived: -m1_pboole(f7(A),B) | v1_pre_circ(f7(A),B). [resolve(61,a,58,b)].
% 0.75/1.06 Derived: v1_xboole_0(A) | -m1_pboole(f7(B),A) | -v2_relat_1(f7(B)). [resolve(61,a,59,d)].
% 0.75/1.06 62 v3_relat_1(c9) # label(rc4_funct_1) # label(axiom). [clausify(41)].
% 0.75/1.06 Derived: -m1_pboole(c9,A) | v1_pre_circ(c9,A). [resolve(62,a,58,b)].
% 0.75/1.06 Derived: v1_xboole_0(A) | -m1_pboole(c9,A) | -v2_relat_1(c9). [resolve(62,a,59,d)].
% 0.75/1.06 63 v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | -m1_subset_1(C,A) | -v1_xboole_0(k1_funct_1(B,C)) # label(fc2_pboole) # label(axiom). [clausify(26)].
% 0.75/1.06 64 m1_subset_1(f4(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(23)].
% 0.75/1.06 Derived: v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | -v1_xboole_0(k1_funct_1(B,f4(A))). [resolve(63,d,64,a)].
% 0.75/1.06 65 v1_xboole_0(A) | -m1_pboole(B,A) | -r2_hidden(C,a_2_0_closure3(A,B)) | m1_subset_1(f5(C,A,B),A) # label(fraenkel_a_2_0_closure3) # label(axiom). [clausify(28)].
% 0.75/1.06 Derived: v1_xboole_0(A) | -m1_pboole(B,A) | -r2_hidden(C,a_2_0_closure3(A,B)) | v1_xboole_0(A) | -v2_relat_1(D) | -m1_pboole(D,A) | -v1_xboole_0(k1_funct_1(D,f5(C,A,B))). [resolve(65,d,63,d)].
% 1.06/1.37 66 v1_xboole_0(A) | -m1_pboole(B,A) | r2_hidden(C,a_2_0_closure3(A,B)) | -m1_subset_1(D,A) | D != C | k1_funct_1(B,D) = k1_xboole_0 # label(fraenkel_a_2_0_closure3) # label(axiom). [clausify(28)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -m1_pboole(B,A) | r2_hidden(C,a_2_0_closure3(A,B)) | f4(A) != C | k1_funct_1(B,f4(A)) = k1_xboole_0. [resolve(66,d,64,a)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -m1_pboole(B,A) | r2_hidden(C,a_2_0_closure3(A,B)) | f5(D,A,E) != C | k1_funct_1(B,f5(D,A,E)) = k1_xboole_0 | v1_xboole_0(A) | -m1_pboole(E,A) | -r2_hidden(D,a_2_0_closure3(A,E)). [resolve(66,d,65,d)].
% 1.06/1.37 67 v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | -r2_hidden(C,a_2_1_closure3(A,B)) | m1_subset_1(f6(C,A,B),A) # label(fraenkel_a_2_1_closure3) # label(axiom). [clausify(29)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | -r2_hidden(C,a_2_1_closure3(A,B)) | v1_xboole_0(A) | -v2_relat_1(D) | -m1_pboole(D,A) | -v1_xboole_0(k1_funct_1(D,f6(C,A,B))). [resolve(67,e,63,d)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | -r2_hidden(C,a_2_1_closure3(A,B)) | v1_xboole_0(A) | -m1_pboole(D,A) | r2_hidden(E,a_2_0_closure3(A,D)) | f6(C,A,B) != E | k1_funct_1(D,f6(C,A,B)) = k1_xboole_0. [resolve(67,e,66,d)].
% 1.06/1.37 68 v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | r2_hidden(C,a_2_1_closure3(A,B)) | -m1_subset_1(D,A) | D != C | k1_funct_1(B,D) = k1_xboole_0 # label(fraenkel_a_2_1_closure3) # label(axiom). [clausify(29)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | r2_hidden(C,a_2_1_closure3(A,B)) | f4(A) != C | k1_funct_1(B,f4(A)) = k1_xboole_0. [resolve(68,e,64,a)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | r2_hidden(C,a_2_1_closure3(A,B)) | f5(D,A,E) != C | k1_funct_1(B,f5(D,A,E)) = k1_xboole_0 | v1_xboole_0(A) | -m1_pboole(E,A) | -r2_hidden(D,a_2_0_closure3(A,E)). [resolve(68,e,65,d)].
% 1.06/1.37 Derived: v1_xboole_0(A) | -v2_relat_1(B) | -m1_pboole(B,A) | r2_hidden(C,a_2_1_closure3(A,B)) | f6(D,A,E) != C | k1_funct_1(B,f6(D,A,E)) = k1_xboole_0 | v1_xboole_0(A) | -v2_relat_1(E) | -m1_pboole(E,A) | -r2_hidden(D,a_2_1_closure3(A,E)). [resolve(68,e,67,e)].
% 1.06/1.37 69 -r2_hidden(A,B) | m1_subset_1(A,B) # label(t1_subset) # label(axiom). [clausify(46)].
% 1.06/1.37 Derived: -r2_hidden(A,B) | v1_xboole_0(B) | -v2_relat_1(C) | -m1_pboole(C,B) | -v1_xboole_0(k1_funct_1(C,A)). [resolve(69,b,63,d)].
% 1.06/1.37 Derived: -r2_hidden(A,B) | v1_xboole_0(B) | -m1_pboole(C,B) | r2_hidden(D,a_2_0_closure3(B,C)) | A != D | k1_funct_1(C,A) = k1_xboole_0. [resolve(69,b,66,d)].
% 1.06/1.37 Derived: -r2_hidden(A,B) | v1_xboole_0(B) | -v2_relat_1(C) | -m1_pboole(C,B) | r2_hidden(D,a_2_1_closure3(B,C)) | A != D | k1_funct_1(C,A) = k1_xboole_0. [resolve(69,b,68,e)].
% 1.06/1.37 70 -m1_subset_1(A,B) | v1_xboole_0(B) | r2_hidden(A,B) # label(t2_subset) # label(axiom). [clausify(48)].
% 1.06/1.37 Derived: v1_xboole_0(A) | r2_hidden(f4(A),A). [resolve(70,a,64,a)].
% 1.06/1.37 Derived: v1_xboole_0(A) | r2_hidden(f5(B,A,C),A) | v1_xboole_0(A) | -m1_pboole(C,A) | -r2_hidden(B,a_2_0_closure3(A,C)). [resolve(70,a,65,d)].
% 1.06/1.37 Derived: v1_xboole_0(A) | r2_hidden(f6(B,A,C),A) | v1_xboole_0(A) | -v2_relat_1(C) | -m1_pboole(C,A) | -r2_hidden(B,a_2_1_closure3(A,C)). [resolve(70,a,67,e)].
% 1.06/1.37
% 1.06/1.37 ============================== end predicate elimination =============
% 1.06/1.37
% 1.06/1.37 Auto_denials: (non-Horn, no changes).
% 1.06/1.37
% 1.06/1.37 Term ordering decisions:
% 1.06/1.37 Function symbol KB weights: k1_xboole_0=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. k1_funct_1=1. k3_xboole_0=1. a_2_0_closure3=1. a_2_1_closure3=1. k7_relat_1=1. k1_closure3=1. f1=1. f9=1. f10=1. k1_relat_1=1. f3=1. f4=1. f7=1. f8=1. f2=1. f5=1. f6=1.
% 1.06/1.37
% 1.06/1.37 ============================== end of process initial clauses ========
% 1.06/1.37
% 1.06/1.37 ============================== CLAUSES FOR SEARCH ====================
% 1.06/1.37
% 1.06/1.37 ============================== end of clauses for search =============
% 1.06/1.37
% 1.06/1.37 ============================== SEARCH ================================
% 1.06/1.37
% 1.06/1.37 % Starting search at 0.03 seconds.
% 1.06/1.37
% 1.06/1.37 NOTE: Back_subsumption disabled, ratio of Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------