TSTP Solution File: SEU415+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU415+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:43 EDT 2022
% Result : Timeout 300.02s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU415+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 20 00:53:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.75/1.07 ============================== Prover9 ===============================
% 0.75/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.07 Process 4528 was started by sandbox on n015.cluster.edu,
% 0.75/1.07 Mon Jun 20 00:53:16 2022
% 0.75/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4362_n015.cluster.edu".
% 0.75/1.07 ============================== end of head ===========================
% 0.75/1.07
% 0.75/1.07 ============================== INPUT =================================
% 0.75/1.07
% 0.75/1.07 % Reading from file /tmp/Prover9_4362_n015.cluster.edu
% 0.75/1.07
% 0.75/1.07 set(prolog_style_variables).
% 0.75/1.07 set(auto2).
% 0.75/1.07 % set(auto2) -> set(auto).
% 0.75/1.07 % set(auto) -> set(auto_inference).
% 0.75/1.07 % set(auto) -> set(auto_setup).
% 0.75/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.07 % set(auto) -> set(auto_limits).
% 0.75/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.07 % set(auto) -> set(auto_denials).
% 0.75/1.07 % set(auto) -> set(auto_process).
% 0.75/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.07 % set(auto2) -> assign(stats, some).
% 0.75/1.07 % set(auto2) -> clear(echo_input).
% 0.75/1.07 % set(auto2) -> set(quiet).
% 0.75/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.07 % set(auto2) -> clear(print_given).
% 0.75/1.07 assign(lrs_ticks,-1).
% 0.75/1.07 assign(sos_limit,10000).
% 0.75/1.07 assign(order,kbo).
% 0.75/1.07 set(lex_order_vars).
% 0.75/1.07 clear(print_given).
% 0.75/1.07
% 0.75/1.07 % formulas(sos). % not echoed (61 formulas)
% 0.75/1.07
% 0.75/1.07 ============================== end of input ==========================
% 0.75/1.07
% 0.75/1.07 % From the command line: assign(max_seconds, 300).
% 0.75/1.07
% 0.75/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.07
% 0.75/1.07 % Formulas that are not ordinary clauses:
% 0.75/1.07 1 (all A (l1_orders_2(A) -> (v1_orders_2(A) -> A = g1_orders_2(u1_struct_0(A),u1_orders_2(A))))) # label(abstractness_v1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 2 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 3 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> v1_relat_1(C))) # label(cc1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 4 (all A all B k2_xboole_0(A,B) = k2_xboole_0(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 5 (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.75/1.07 6 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C (v1_orders_2(C) & l1_orders_2(C) -> (C = k1_latsum_1(A,B) <-> u1_struct_0(C) = k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) & u1_orders_2(C) = k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B)))))))))) # label(d2_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 7 (all A all B all C (C = k2_xboole_0(A,B) <-> (all D (r2_hidden(D,C) <-> r2_hidden(D,A) | r2_hidden(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 8 (all A (l1_orders_2(A) -> (v3_orders_2(A) <-> r8_relat_2(u1_orders_2(A),u1_struct_0(A))))) # label(d5_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 9 (all A (v1_relat_1(A) -> (all B (v1_relat_1(B) -> (all C (v1_relat_1(C) -> (C = k5_relat_1(A,B) <-> (all D all E (r2_hidden(k4_tarski(D,E),C) <-> (exists F (r2_hidden(k4_tarski(D,F),A) & r2_hidden(k4_tarski(F,E),B)))))))))))) # label(d8_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 10 (all A (v1_relat_1(A) -> (all B (r8_relat_2(A,B) <-> (all C all D all E (r2_hidden(C,B) & r2_hidden(D,B) & r2_hidden(E,B) & r2_hidden(k4_tarski(C,D),A) & r2_hidden(k4_tarski(D,E),A) -> r2_hidden(k4_tarski(C,E),A))))))) # label(d8_relat_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 11 (all A all B (m1_relset_1(B,A,A) -> v1_orders_2(g1_orders_2(A,B)) & l1_orders_2(g1_orders_2(A,B)))) # label(dt_g1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 12 (all A all B (l1_orders_2(A) & l1_orders_2(B) -> v1_orders_2(k1_latsum_1(A,B)) & l1_orders_2(k1_latsum_1(A,B)))) # label(dt_k1_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 13 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 14 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 15 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 16 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 17 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 18 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 19 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k5_relat_1(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 20 (all A all B all C all D all E all F (m1_relset_1(E,A,B) & m1_relset_1(F,C,D) -> m2_relset_1(k7_relset_1(A,B,C,D,E,F),A,D))) # label(dt_k7_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 21 (all A (l1_orders_2(A) -> l1_struct_0(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 22 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 23 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 24 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 25 (all A all B all C (m2_relset_1(C,A,B) -> m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))))) # label(dt_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 26 (all A (l1_orders_2(A) -> m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)))) # label(dt_u1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 27 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 28 (exists A l1_orders_2(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 29 (exists A l1_struct_0(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 30 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 31 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 32 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 33 (all A all B (-v1_xboole_0(A) -> -v1_xboole_0(k2_xboole_0(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 34 (all A all B (-v1_xboole_0(A) -> -v1_xboole_0(k2_xboole_0(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 35 (all A all B (m1_relset_1(B,A,A) -> (all C all D (g1_orders_2(A,B) = g1_orders_2(C,D) -> A = C & B = D)))) # label(free_g1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 36 (all A all B k2_xboole_0(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 37 (all A all B k3_xboole_0(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 38 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 39 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 40 (all A (l1_orders_2(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) & v12_waybel_0(B,A) & v13_waybel_0(B,A))))) # label(rc7_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 41 (all A all B all C all D all E all F (m1_relset_1(E,A,B) & m1_relset_1(F,C,D) -> k7_relset_1(A,B,C,D,E,F) = k5_relat_1(E,F))) # label(redefinition_k7_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 42 (all A all B all C (m2_relset_1(C,A,B) <-> m1_relset_1(C,A,B))) # label(redefinition_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 43 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 44 (all A all B all C all D (r2_hidden(k4_tarski(A,B),k2_zfmisc_1(C,D)) <-> r2_hidden(A,C) & r2_hidden(B,D))) # label(t106_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 45 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C all D (v13_waybel_0(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),A) & m1_subset_1(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),k1_zfmisc_1(u1_struct_0(A))) & r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B))) & r2_hidden(C,u1_struct_0(B)) -> r2_hidden(D,u1_struct_0(B)))))))) # label(t17_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 46 (all A k2_xboole_0(A,k1_xboole_0) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 47 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 48 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C all D (v12_waybel_0(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),B) & m1_subset_1(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),k1_zfmisc_1(u1_struct_0(B))) & r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B))) & r2_hidden(D,u1_struct_0(A)) -> r2_hidden(C,u1_struct_0(A)))))))) # label(t21_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 49 (all A k3_xboole_0(A,k1_xboole_0) = k1_xboole_0) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 50 (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.75/1.07 51 (all A all B (m1_subset_1(A,k1_zfmisc_1(B)) <-> r1_tarski(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 52 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C all D (r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B))) & r2_hidden(C,u1_struct_0(A)) & r2_hidden(D,u1_struct_0(A)) & r1_latsum_1(A,B) & v3_orders_2(A) -> r2_hidden(k4_tarski(C,D),u1_orders_2(A)))))))) # label(t4_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 53 (all A all B all C (r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) -> m1_subset_1(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 54 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C all D (r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B))) & r2_hidden(C,u1_struct_0(B)) & r2_hidden(D,u1_struct_0(B)) & r1_latsum_1(A,B) & v3_orders_2(B) -> r2_hidden(k4_tarski(C,D),u1_orders_2(B)))))))) # label(t5_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 55 (all A all B all C -(r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) & v1_xboole_0(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 56 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 57 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C all D ((r2_hidden(k4_tarski(C,D),u1_orders_2(A)) -> r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B)))) & (r2_hidden(k4_tarski(C,D),u1_orders_2(B)) -> r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B)))))))))) # label(t6_latsum_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 58 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.07 59 (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.07 60 -(all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (v13_waybel_0(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),A) & m1_subset_1(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),k1_zfmisc_1(u1_struct_0(A))) & v12_waybel_0(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),B) & m1_subset_1(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),k1_zfmisc_1(u1_struct_0(B))) & r1_latsum_1(A,B) & v3_orders_2(A) & v3_orders_2(B) -> v3_orders_2(k1_latsum_1(A,B))))))) # label(t25_latsum_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.07
% 0.75/1.07 ============================== end of process non-clausal formulas ===
% 0.75/1.07
% 0.75/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.07
% 0.75/1.07 ============================== PREDICATE ELIMINATION =================
% 0.75/1.07 61 m1_subset_1(A,k1_zfmisc_1(B)) | -r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(51)].
% 0.75/1.07 62 r1_tarski(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(43)].
% 0.75/1.07 63 -m1_subset_1(A,k1_zfmisc_1(B)) | r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(51)].
% 0.75/1.07 Derived: m1_subset_1(A,k1_zfmisc_1(A)). [resolve(61,b,62,a)].
% 0.75/1.07 64 -l1_orders_2(A) | -l1_orders_2(B) | -r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B))) | -r2_hidden(C,u1_struct_0(A)) | -r2_hidden(D,u1_struct_0(A)) | -r1_latsum_1(A,B) | -v3_orders_2(A) | r2_hidden(k4_tarski(C,D),u1_orders_2(A)) # label(t4_latsum_1) # label(axiom). [clausify(52)].
% 0.75/1.07 65 r1_latsum_1(c5,c6) # label(t25_latsum_1) # label(negated_conjecture). [clausify(60)].
% 0.75/1.07 Derived: -l1_orders_2(c5) | -l1_orders_2(c6) | -r2_hidden(k4_tarski(A,B),u1_orders_2(k1_latsum_1(c5,c6))) | -r2_hidden(A,u1_struct_0(c5)) | -r2_hidden(B,u1_struct_0(c5)) | -v3_orders_2(c5) | r2_hidden(k4_tarski(A,B),u1_orders_2(c5)). [resolve(64,f,65,a)].
% 0.75/1.07 66 -l1_orders_2(A) | -l1_orders_2(B) | -r2_hidden(k4_tarski(C,D),u1_orders_2(k1_latsum_1(A,B))) | -r2_hidden(C,u1_struct_0(B)) | -r2_hidden(D,u1_struct_0(B)) | -r1_latsum_1(A,B) | -v3_orders_2(B) | r2_hidden(k4_tarski(C,D),u1_orders_2(B)) # label(t5_latsum_1) # label(axiom). [clausify(54)].
% 0.75/1.07 Derived: -l1_orders_2(c5) | -l1_orders_2(c6) | -r2_hidden(k4_tarski(A,B),u1_orders_2(k1_latsum_1(c5,c6))) | -r2_hidden(A,u1_struct_0(c6)) | -r2_hidden(B,u1_struct_0(c6)) | -v3_orders_2(c6) | r2_hidden(k4_tarski(A,B),u1_orders_2(c6)). [resolve(66,f,65,a)].
% 0.75/1.07 67 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(42)].
% 0.75/1.07 68 m2_relset_1(f11(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(32)].
% 0.75/1.07 Derived: m1_relset_1(f11(A,B),A,B). [resolve(67,a,68,a)].
% 0.75/1.07 69 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(42)].
% 0.75/1.07 70 -l1_orders_2(A) | m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)) # label(dt_u1_orders_2) # label(axiom). [clausify(26)].
% 0.75/1.07 Derived: -l1_orders_2(A) | m1_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)). [resolve(70,b,67,a)].
% 0.75/1.07 71 -m2_relset_1(A,B,C) | m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(25)].
% 0.75/1.07 Derived: m1_subset_1(f11(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(71,a,68,a)].
% 0.75/1.07 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(71,a,69,a)].
% 0.75/1.07 Derived: m1_subset_1(u1_orders_2(A),k1_zfmisc_1(k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)))) | -l1_orders_2(A). [resolve(71,a,70,b)].
% 0.75/1.07 72 -m1_relset_1(A,B,C) | -m1_relset_1(D,E,F) | m2_relset_1(k7_relset_1(B,C,E,F,A,D),B,F) # label(dt_k7_relset_1) # label(axiom). [clausify(20)].
% 0.75/1.07 Derived: -m1_relset_1(A,B,C) | -m1_relset_1(D,E,F) | m1_relset_1(k7_relset_1(B,C,E,F,A,D),B,F). [resolve(72,c,67,a)].
% 0.75/1.07 Derived: -m1_relset_1(A,B,C) | -m1_relset_1(D,E,F) | m1_subset_1(k7_relset_1(B,C,E,F,A,D),k1_zfmisc_1(k2_zfmisc_1(B,F))). [resolve(72,c,71,a)].
% 0.75/1.07 73 -l1_orders_2(A) | -v1_orders_2(A) | g1_orders_2(u1_struct_0(A),u1_orders_2(A)) = A # label(abstractness_v1_orders_2) # label(axiom). [clausify(1)].
% 0.75/1.07 74 -m1_relset_1(A,B,B) | v1_orders_2(g1_orders_2(B,A)) # label(dt_g1_orders_2) # label(axiom). [clausify(11)].
% 0.75/1.07 75 -l1_orders_2(A) | -l1_orders_2(B) | v1_orders_2(k1_latsum_1(A,B)) # label(dt_k1_latsum_1) # label(axiom). [clausify(12)].
% 0.75/1.07 Derived: -l1_orders_2(g1_orders_2(A,B)) | g1_orders_2(u1_struct_0(g1_orders_2(A,B)),u1_orders_2(g1_orders_2(A,B))) = g1_orders_2(A,B) | -m1_relset_1(B,A,A). [resolve(73,b,74,b)].
% 0.75/1.07 Derived: -l1_orders_2(k1_latsum_1(A,B)) | g1_orders_2(u1_struct_0(k1_latsum_1(A,B)),u1_orders_2(k1_latsum_1(A,B))) = k1_latsum_1(A,B) | -l1_orders_2(A) | -l1_orders_2(B). [resolve(73,b,75,c)].
% 0.75/1.07 76 -l1_orders_2(A) | -l1_orders_2(B) | -v1_orders_2(C) | -l1_orders_2(C) | k1_latsum_1(A,B) != C | k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) = u1_struct_0(C) # label(d2_latsum_1) # label(axiom). [clausify(6)].
% 13.56/13.86 Derived: -l1_orders_2(A) | -l1_orders_2(B) | -l1_orders_2(g1_orders_2(C,D)) | k1_latsum_1(A,B) != g1_orders_2(C,D) | k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) = u1_struct_0(g1_orders_2(C,D)) | -m1_relset_1(D,C,C). [resolve(76,c,74,b)].
% 13.56/13.86 Derived: -l1_orders_2(A) | -l1_orders_2(B) | -l1_orders_2(k1_latsum_1(C,D)) | k1_latsum_1(A,B) != k1_latsum_1(C,D) | k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) = u1_struct_0(k1_latsum_1(C,D)) | -l1_orders_2(C) | -l1_orders_2(D). [resolve(76,c,75,c)].
% 13.56/13.86 77 -l1_orders_2(A) | -l1_orders_2(B) | -v1_orders_2(C) | -l1_orders_2(C) | k1_latsum_1(A,B) != C | k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) = u1_orders_2(C) # label(d2_latsum_1) # label(axiom). [clausify(6)].
% 13.56/13.86 Derived: -l1_orders_2(A) | -l1_orders_2(B) | -l1_orders_2(g1_orders_2(C,D)) | k1_latsum_1(A,B) != g1_orders_2(C,D) | k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) = u1_orders_2(g1_orders_2(C,D)) | -m1_relset_1(D,C,C). [resolve(77,c,74,b)].
% 13.56/13.86 Derived: -l1_orders_2(A) | -l1_orders_2(B) | -l1_orders_2(k1_latsum_1(C,D)) | k1_latsum_1(A,B) != k1_latsum_1(C,D) | k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) = u1_orders_2(k1_latsum_1(C,D)) | -l1_orders_2(C) | -l1_orders_2(D). [resolve(77,c,75,c)].
% 13.56/13.86 78 -l1_orders_2(A) | -l1_orders_2(B) | -v1_orders_2(C) | -l1_orders_2(C) | k1_latsum_1(A,B) = C | k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) != u1_struct_0(C) | k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) != u1_orders_2(C) # label(d2_latsum_1) # label(axiom). [clausify(6)].
% 13.56/13.86 Derived: -l1_orders_2(A) | -l1_orders_2(B) | -l1_orders_2(g1_orders_2(C,D)) | k1_latsum_1(A,B) = g1_orders_2(C,D) | k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) != u1_struct_0(g1_orders_2(C,D)) | k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) != u1_orders_2(g1_orders_2(C,D)) | -m1_relset_1(D,C,C). [resolve(78,c,74,b)].
% 13.56/13.86 Derived: -l1_orders_2(A) | -l1_orders_2(B) | -l1_orders_2(k1_latsum_1(C,D)) | k1_latsum_1(A,B) = k1_latsum_1(C,D) | k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) != u1_struct_0(k1_latsum_1(C,D)) | k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) != u1_orders_2(k1_latsum_1(C,D)) | -l1_orders_2(C) | -l1_orders_2(D). [resolve(78,c,75,c)].
% 13.56/13.86
% 13.56/13.86 ============================== end predicate elimination =============
% 13.56/13.86
% 13.56/13.86 Auto_denials: (non-Horn, no changes).
% 13.56/13.86
% 13.56/13.86 Term ordering decisions:
% 13.56/13.86 Function symbol KB weights: k1_xboole_0=1. c1=1. c3=1. c4=1. c5=1. c6=1. k4_tarski=1. k1_latsum_1=1. k2_xboole_0=1. g1_orders_2=1. k3_xboole_0=1. k2_zfmisc_1=1. k5_relat_1=1. f6=1. f7=1. f8=1. f9=1. f11=1. u1_struct_0=1. u1_orders_2=1. k1_zfmisc_1=1. f10=1. f12=1. f1=1. f3=1. f4=1. f5=1. f2=1. k7_relset_1=1.
% 13.56/13.86
% 13.56/13.86 ============================== end of process initial clauses ========
% 13.56/13.86
% 13.56/13.86 ============================== CLAUSES FOR SEARCH ====================
% 13.56/13.86
% 13.56/13.86 ============================== end of clauses for search =============
% 13.56/13.86
% 13.56/13.86 ============================== SEARCH ================================
% 13.56/13.86
% 13.56/13.86 % Starting search at 0.06 seconds.
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=85.000, iters=3333
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=83.000, iters=3373
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=81.000, iters=3376
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=73.000, iters=3393
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=71.000, iters=3416
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=70.000, iters=3335
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=69.000, iters=3391
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wt=68.000, iters=3369
% 13.56/13.86
% 13.56/13.86 Low Water (keep): wtCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------