TSTP Solution File: SEU410+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SEU410+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 13:31:39 EDT 2022

% Result   : Timeout 300.03s 300.28s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU410+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 05:59:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.42/1.02  ============================== Prover9 ===============================
% 0.42/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.02  Process 9504 was started by sandbox2 on n027.cluster.edu,
% 0.42/1.02  Sun Jun 19 05:59:24 2022
% 0.42/1.02  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9351_n027.cluster.edu".
% 0.42/1.02  ============================== end of head ===========================
% 0.42/1.02  
% 0.42/1.02  ============================== INPUT =================================
% 0.42/1.02  
% 0.42/1.02  % Reading from file /tmp/Prover9_9351_n027.cluster.edu
% 0.42/1.02  
% 0.42/1.02  set(prolog_style_variables).
% 0.42/1.02  set(auto2).
% 0.42/1.02      % set(auto2) -> set(auto).
% 0.42/1.02      % set(auto) -> set(auto_inference).
% 0.42/1.02      % set(auto) -> set(auto_setup).
% 0.42/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.42/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.02      % set(auto) -> set(auto_limits).
% 0.42/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.02      % set(auto) -> set(auto_denials).
% 0.42/1.02      % set(auto) -> set(auto_process).
% 0.42/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.42/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.42/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.42/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.42/1.02      % set(auto2) -> assign(stats, some).
% 0.42/1.02      % set(auto2) -> clear(echo_input).
% 0.42/1.02      % set(auto2) -> set(quiet).
% 0.42/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.02      % set(auto2) -> clear(print_given).
% 0.42/1.02  assign(lrs_ticks,-1).
% 0.42/1.02  assign(sos_limit,10000).
% 0.42/1.02  assign(order,kbo).
% 0.42/1.02  set(lex_order_vars).
% 0.42/1.02  clear(print_given).
% 0.42/1.02  
% 0.42/1.02  % formulas(sos).  % not echoed (62 formulas)
% 0.42/1.02  
% 0.42/1.02  ============================== end of input ==========================
% 0.42/1.02  
% 0.42/1.02  % From the command line: assign(max_seconds, 300).
% 0.42/1.02  
% 0.42/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.02  
% 0.42/1.02  % Formulas that are not ordinary clauses:
% 0.42/1.02  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.42/1.02  2 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  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.42/1.02  4 (all A all B all C (v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) & m1_subset_1(B,u1_struct_0(A)) & m1_subset_1(C,u1_struct_0(A)) -> k13_lattice3(A,B,C) = k13_lattice3(A,C,B))) # label(commutativity_k13_lattice3) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  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.42/1.02  6 (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.42/1.02  7 (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.42/1.02  8 (all A all B all C (l1_orders_2(A) & m1_subset_1(B,u1_struct_0(A)) & m1_subset_1(C,u1_struct_0(A)) -> m1_subset_1(k10_lattice3(A,B,C),u1_struct_0(A)))) # label(dt_k10_lattice3) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  9 (all A all B all C (v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) & m1_subset_1(B,u1_struct_0(A)) & m1_subset_1(C,u1_struct_0(A)) -> m1_subset_1(k13_lattice3(A,B,C),u1_struct_0(A)))) # label(dt_k13_lattice3) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  10 (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.42/1.02  11 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  12 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  13 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  14 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  15 (all A (l1_orders_2(A) -> l1_struct_0(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  16 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  17 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  18 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  19 (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.42/1.02  20 (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.42/1.02  21 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  22 (exists A l1_orders_2(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  23 (exists A l1_struct_0(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  24 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  25 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  26 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  27 (all A all B (l1_orders_2(A) & -v3_struct_0(B) & l1_orders_2(B) -> -v3_struct_0(k1_latsum_1(A,B)) & v1_orders_2(k1_latsum_1(A,B)))) # label(fc1_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  28 (all A (-v3_struct_0(A) & l1_struct_0(A) -> -v1_xboole_0(u1_struct_0(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  29 (all A all B (-v3_struct_0(A) & l1_orders_2(A) & l1_orders_2(B) -> -v3_struct_0(k1_latsum_1(A,B)) & v1_orders_2(k1_latsum_1(A,B)))) # label(fc2_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  30 (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.42/1.02  31 (all A all B k3_xboole_0(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  32 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  33 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  34 (exists A (l1_struct_0(A) & -v3_struct_0(A))) # label(rc3_struct_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  35 (all A (-v3_struct_0(A) & l1_struct_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) & -v1_xboole_0(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  36 (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.42/1.02  37 (all A (-v3_struct_0(A) & l1_orders_2(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) & -v1_xboole_0(B) & v12_waybel_0(B,A) & v13_waybel_0(B,A))))) # label(rc8_waybel_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  38 (all A (-v3_struct_0(A) & v2_orders_2(A) & v3_orders_2(A) & l1_orders_2(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) & -v1_xboole_0(B) & v1_waybel_0(B,A) & v12_waybel_0(B,A))))) # label(rc9_waybel_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  39 (all A all B all C (v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) & m1_subset_1(B,u1_struct_0(A)) & m1_subset_1(C,u1_struct_0(A)) -> k13_lattice3(A,B,C) = k10_lattice3(A,B,C))) # label(redefinition_k13_lattice3) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  40 (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.42/1.03  41 (all A all B all C (-v3_struct_0(A) & v2_orders_2(A) & l1_orders_2(A) & m1_subset_1(B,u1_struct_0(A)) & m1_subset_1(C,u1_struct_0(A)) -> (r3_orders_2(A,B,C) <-> r1_orders_2(A,B,C)))) # label(redefinition_r3_orders_2) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  42 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  43 (all A all B all C (-v3_struct_0(A) & v2_orders_2(A) & l1_orders_2(A) & m1_subset_1(B,u1_struct_0(A)) & m1_subset_1(C,u1_struct_0(A)) -> r3_orders_2(A,B,B))) # label(reflexivity_r3_orders_2) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  44 (all A (-v3_struct_0(A) & v2_orders_2(A) & v3_orders_2(A) & v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & v2_orders_2(B) & v3_orders_2(B) & v4_orders_2(B) & v1_lattice3(B) & l1_orders_2(B) -> (all C (r2_hidden(C,u1_struct_0(A)) -> m1_subset_1(C,u1_struct_0(k1_latsum_1(A,B))))))))) # label(t10_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  45 (all A (-v3_struct_0(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & l1_orders_2(B) -> (all C (r2_hidden(C,k3_xboole_0(u1_struct_0(A),u1_struct_0(B))) -> m1_subset_1(C,u1_struct_0(B)))))))) # label(t13_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  46 (all A (-v3_struct_0(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & l1_orders_2(B) -> (all C (m1_subset_1(C,u1_struct_0(A)) -> (all D (m1_subset_1(D,u1_struct_0(A)) -> (all E (m1_subset_1(E,u1_struct_0(B)) -> (all F (m1_subset_1(F,u1_struct_0(B)) -> (C = E & D = F & r1_latsum_1(A,B) & v3_orders_2(A) & v3_orders_2(B) -> (r1_orders_2(A,C,D) <-> r1_orders_2(B,E,F))))))))))))))) # label(t15_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  47 (all A (-v3_struct_0(A) & v2_orders_2(A) & v3_orders_2(A) & v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) -> (all B (v1_waybel_0(B,A) & v12_waybel_0(B,A) & m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) -> (all C (m1_subset_1(C,u1_struct_0(A)) -> (all D (m1_subset_1(D,u1_struct_0(A)) -> (r2_hidden(C,B) & r2_hidden(D,B) -> r2_hidden(k13_lattice3(A,C,D),B)))))))))) # label(t16_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  48 (all A (l1_orders_2(A) -> (all B (l1_orders_2(B) -> (all C (m1_subset_1(C,u1_struct_0(k1_latsum_1(A,B))) -> (all D (m1_subset_1(D,u1_struct_0(k1_latsum_1(A,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))) & r1_orders_2(k1_latsum_1(A,B),C,D) & r2_hidden(C,u1_struct_0(B)) -> r2_hidden(D,u1_struct_0(B))))))))))) # label(t18_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  49 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  50 (all A (v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) -> (all B (m1_subset_1(B,u1_struct_0(A)) -> (all C (m1_subset_1(C,u1_struct_0(A)) -> (all D (m1_subset_1(D,u1_struct_0(A)) -> (D = k13_lattice3(A,B,C) <-> r1_orders_2(A,B,D) & r1_orders_2(A,C,D) & (all E (m1_subset_1(E,u1_struct_0(A)) -> (r1_orders_2(A,B,E) & r1_orders_2(A,C,E) -> r1_orders_2(A,D,E))))))))))))) # label(t22_yellow_0) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  51 (all A k3_xboole_0(A,k1_xboole_0) = k1_xboole_0) # label(t2_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  52 (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.42/1.03  53 (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.42/1.03  54 (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.42/1.03  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.42/1.03  56 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  57 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  58 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  59 (all A (-v3_struct_0(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & l1_orders_2(B) -> (all C (m1_subset_1(C,u1_struct_0(A)) -> (all D (m1_subset_1(D,u1_struct_0(A)) -> (all E (m1_subset_1(E,u1_struct_0(k1_latsum_1(A,B))) -> (all F (m1_subset_1(F,u1_struct_0(k1_latsum_1(A,B))) -> (C = E & D = F & r1_latsum_1(A,B) & v3_orders_2(A) -> (r1_orders_2(A,C,D) <-> r1_orders_2(k1_latsum_1(A,B),E,F))))))))))))))) # label(t8_latsum_1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  60 (all A (v2_orders_2(A) & v3_orders_2(A) & v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) -> (all B (m1_subset_1(B,u1_struct_0(A)) -> (all C (m1_subset_1(C,u1_struct_0(A)) -> (all D (m1_subset_1(D,u1_struct_0(A)) -> (r3_orders_2(A,B,D) & r3_orders_2(A,C,D) -> r3_orders_2(A,k13_lattice3(A,B,C),D)))))))))) # label(t9_yellow_5) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.03  61 -(all A (-v3_struct_0(A) & v2_orders_2(A) & v3_orders_2(A) & v4_orders_2(A) & v1_lattice3(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & v2_orders_2(B) & v3_orders_2(B) & v4_orders_2(B) & v1_lattice3(B) & l1_orders_2(B) -> (all C (m1_subset_1(C,u1_struct_0(A)) -> (all D (m1_subset_1(D,u1_struct_0(A)) -> (all E (m1_subset_1(E,u1_struct_0(B)) -> (all F (m1_subset_1(F,u1_struct_0(B)) -> (v1_waybel_0(k3_xboole_0(u1_struct_0(A),u1_struct_0(B)),B) & 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))) & 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))) & r1_latsum_1(A,B) & C = E & D = F -> k13_lattice3(A,C,D) = k13_lattice3(B,E,F)))))))))))))) # label(t19_latsum_1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.42/1.03  
% 0.42/1.03  ============================== end of process non-clausal formulas ===
% 0.42/1.03  
% 0.42/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.03  
% 0.42/1.03  ============================== PREDICATE ELIMINATION =================
% 0.42/1.03  62 -m1_relset_1(A,B,B) | v1_orders_2(g1_orders_2(B,A)) # label(dt_g1_orders_2) # label(axiom).  [clausify(7)].
% 0.42/1.03  63 -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.42/1.03  Derived: -m1_relset_1(A,B,B) | -l1_orders_2(g1_orders_2(B,A)) | g1_orders_2(u1_struct_0(g1_orders_2(B,A)),u1_orders_2(g1_orders_2(B,A))) = g1_orders_2(B,A).  [resolve(62,b,63,b)].
% 0.42/1.03  64 -l1_orders_2(A) | -l1_orders_2(B) | v1_orders_2(k1_latsum_1(A,B)) # label(dt_k1_latsum_1) # label(axiom).  [clausify(10)].
% 0.42/1.03  Derived: -l1_orders_2(A) | -l1_orders_2(B) | -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).  [resolve(64,c,63,b)].
% 0.42/1.03  65 -l1_orders_2(A) | v3_struct_0(B) | -l1_orders_2(B) | v1_orders_2(k1_latsum_1(A,B)) # label(fc1_latsum_1) # label(axiom).  [clausify(27)].
% 0.42/1.03  66 v3_struct_0(A) | -l1_orders_2(A) | -l1_orders_2(B) | v1_orders_2(k1_latsum_1(A,B)) # label(fc2_latsum_1) # label(axiom).  [clausify(29)].
% 0.42/1.03  67 v3_struct_0(A) | -l1_struct_0(A) | -v1_xboole_0(u1_struct_0(A)) # label(fc1_struct_0) # label(axiom).  [clausify(28)].
% 0.42/1.03  68 -l1_orders_2(A) | l1_struct_0(A) # label(dt_l1_orders_2) # label(axiom).  [clausify(15)].
% 0.42/1.03  69 l1_struct_0(c2) # label(existence_l1_struct_0) # label(axiom).  [clausify(23)].
% 0.42/1.03  Derived: v3_struct_0(A) | -v1_xboole_0(u1_struct_0(A)) | -l1_orders_2(A).  [resolve(67,b,68,b)].
% 0.42/1.03  Derived: v3_struct_0(c2) | -v1_xboole_0(u1_struct_0(c2)).  [resolve(67,b,69,a)].
% 0.42/1.03  70 l1_struct_0(c5) # label(rc3_struct_0) # label(axiom).  [clausify(34)].
% 0.42/1.03  Derived: v3_struct_0(c5) | -v1_xboole_0(u1_struct_0(c5)).  [resolve(70,a,67,b)].
% 0.42/1.03  71 v3_struct_0(A) | -l1_struct_0(A) | m1_subset_1(f5(A),k1_zfmisc_1(u1_struct_0(A))) # label(rc5_struct_0) # label(axiom).  [clausify(35)].
% 0.42/1.04  Derived: v3_struct_0(A) | m1_subset_1(f5(A),k1_zfmisc_1(u1_struct_0(A))) | -l1_orders_2(A).  [resolve(71,b,68,b)].
% 0.42/1.04  Derived: v3_struct_0(c2) | m1_subset_1(f5(c2),k1_zfmisc_1(u1_struct_0(c2))).  [resolve(71,b,69,a)].
% 0.42/1.04  Derived: v3_struct_0(c5) | m1_subset_1(f5(c5),k1_zfmisc_1(u1_struct_0(c5))).  [resolve(71,b,70,a)].
% 0.42/1.04  72 v3_struct_0(A) | -l1_struct_0(A) | -v1_xboole_0(f5(A)) # label(rc5_struct_0) # label(axiom).  [clausify(35)].
% 0.42/1.04  Derived: v3_struct_0(A) | -v1_xboole_0(f5(A)) | -l1_orders_2(A).  [resolve(72,b,68,b)].
% 0.42/1.04  Derived: v3_struct_0(c2) | -v1_xboole_0(f5(c2)).  [resolve(72,b,69,a)].
% 0.42/1.04  Derived: v3_struct_0(c5) | -v1_xboole_0(f5(c5)).  [resolve(72,b,70,a)].
% 0.42/1.04  73 -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(20)].
% 0.42/1.04  74 -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(19)].
% 0.42/1.04  Derived: -l1_orders_2(A) | m1_subset_1(u1_orders_2(A),k1_zfmisc_1(k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)))).  [resolve(73,b,74,a)].
% 0.42/1.04  75 m2_relset_1(f4(A,B),A,B) # label(existence_m2_relset_1) # label(axiom).  [clausify(26)].
% 0.42/1.04  Derived: m1_subset_1(f4(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))).  [resolve(75,a,74,a)].
% 0.42/1.04  76 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom).  [clausify(40)].
% 0.42/1.04  Derived: m1_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)) | -l1_orders_2(A).  [resolve(76,a,73,b)].
% 0.42/1.04  Derived: m1_relset_1(f4(A,B),A,B).  [resolve(76,a,75,a)].
% 0.42/1.04  77 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom).  [clausify(40)].
% 0.42/1.04  Derived: -m1_relset_1(A,B,C) | m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))).  [resolve(77,a,74,a)].
% 0.42/1.04  78 v3_struct_0(A) | -v2_orders_2(A) | -v3_orders_2(A) | -v4_orders_2(A) | -v1_lattice3(A) | -l1_orders_2(A) | -v1_waybel_0(B,A) | -v12_waybel_0(B,A) | -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) | -m1_subset_1(C,u1_struct_0(A)) | -m1_subset_1(D,u1_struct_0(A)) | -r2_hidden(C,B) | -r2_hidden(D,B) | r2_hidden(k13_lattice3(A,C,D),B) # label(t16_latsum_1) # label(axiom).  [clausify(47)].
% 0.42/1.04  79 -l1_orders_2(A) | v12_waybel_0(f6(A),A) # label(rc7_waybel_0) # label(axiom).  [clausify(36)].
% 0.42/1.04  80 v3_struct_0(A) | -l1_orders_2(A) | v12_waybel_0(f7(A),A) # label(rc8_waybel_0) # label(axiom).  [clausify(37)].
% 0.42/1.04  81 v3_struct_0(A) | -v2_orders_2(A) | -v3_orders_2(A) | -l1_orders_2(A) | v12_waybel_0(f8(A),A) # label(rc9_waybel_0) # label(axiom).  [clausify(38)].
% 0.42/1.04  Derived: v3_struct_0(A) | -v2_orders_2(A) | -v3_orders_2(A) | -v4_orders_2(A) | -v1_lattice3(A) | -l1_orders_2(A) | -v1_waybel_0(f6(A),A) | -m1_subset_1(f6(A),k1_zfmisc_1(u1_struct_0(A))) | -m1_subset_1(B,u1_struct_0(A)) | -m1_subset_1(C,u1_struct_0(A)) | -r2_hidden(B,f6(A)) | -r2_hidden(C,f6(A)) | r2_hidden(k13_lattice3(A,B,C),f6(A)) | -l1_orders_2(A).  [resolve(78,h,79,b)].
% 0.42/1.04  Derived: v3_struct_0(A) | -v2_orders_2(A) | -v3_orders_2(A) | -v4_orders_2(A) | -v1_lattice3(A) | -l1_orders_2(A) | -v1_waybel_0(f7(A),A) | -m1_subset_1(f7(A),k1_zfmisc_1(u1_struct_0(A))) | -m1_subset_1(B,u1_struct_0(A)) | -m1_subset_1(C,u1_struct_0(A)) | -r2_hidden(B,f7(A)) | -r2_hidden(C,f7(A)) | r2_hidden(k13_lattice3(A,B,C),f7(A)) | v3_struct_0(A) | -l1_orders_2(A).  [resolve(78,h,80,c)].
% 0.42/1.04  Derived: v3_struct_0(A) | -v2_orders_2(A) | -v3_orders_2(A) | -v4_orders_2(A) | -v1_lattice3(A) | -l1_orders_2(A) | -v1_waybel_0(f8(A),A) | -m1_subset_1(f8(A),k1_zfmisc_1(u1_struct_0(A))) | -m1_subset_1(B,u1_struct_0(A)) | -m1_subset_1(C,u1_struct_0(A)) | -r2_hidden(B,f8(A)) | -r2_hidden(C,f8(A)) | r2_hidden(k13_lattice3(A,B,C),f8(A)) | v3_struct_0(A) | -v2_orders_2(A) | -v3_orders_2(A) | -l1_orders_2(A).  [resolve(78,h,81,e)].
% 0.42/1.04  82 v12_waybel_0(k3_xboole_0(u1_struct_0(c6),u1_struct_0(c7)),c7) # label(t19_latsum_1) # label(negated_conjecture).  [clausify(61)].
% 0.42/1.04  Derived: v3_struct_0(c7) | -v2_orders_2(c7) | -v3_orders_2(c7) | -v4_orders_2(c7) | -v1_lattice3(c7) | -l1_orders_2(c7) | -v1_waybel_0(k3_xboole_0(u1_struct_0(c6),u1_struct_0(c7)),c7) | -m1_subset_1(k3_xboole_0(u1_struct_0(c6),u1_struct_0(c7)),k1_zfmisc_1(u1_struct_0(c7))) | -m1_subset_1(A,u1_struct_0(c7)) | -m1_subset_1(B,u1_struct_0(c7)) | -r2_hidden(A,k3_xboole_0(u1_struct_0(c6),u1_struct_0(c7))) | -r2_hidden(B,k3_xboole_0(u1_struct_0(c6),u1_struct_0(c7))) | r2_hidden(k13_lattice3(c7,A,B),k3_xboole_0(u1_struct_0(c6),u1_struct_0(c7))).  [resolve(82,a,78,h)].
% 0.75/1.06  83 m1_subset_1(A,k1_zfmisc_1(B)) | -r1_tarski(A,B) # label(t3_subset) # label(axiom).  [clausify(53)].
% 0.75/1.06  84 r1_tarski(A,A) # label(reflexivity_r1_tarski) # label(axiom).  [clausify(42)].
% 0.75/1.06  85 -m1_subset_1(A,k1_zfmisc_1(B)) | r1_tarski(A,B) # label(t3_subset) # label(axiom).  [clausify(53)].
% 0.75/1.06  Derived: m1_subset_1(A,k1_zfmisc_1(A)).  [resolve(83,b,84,a)].
% 0.75/1.06  86 r1_latsum_1(c6,c7) # label(t19_latsum_1) # label(negated_conjecture).  [clausify(61)].
% 0.75/1.06  87 v3_struct_0(A) | -l1_orders_2(A) | v3_struct_0(B) | -l1_orders_2(B) | -m1_subset_1(C,u1_struct_0(A)) | -m1_subset_1(D,u1_struct_0(A)) | -m1_subset_1(E,u1_struct_0(B)) | -m1_subset_1(F,u1_struct_0(B)) | E != C | F != D | -r1_latsum_1(A,B) | -v3_orders_2(A) | -v3_orders_2(B) | -r1_orders_2(A,C,D) | r1_orders_2(B,E,F) # label(t15_latsum_1) # label(axiom).  [clausify(46)].
% 0.75/1.06  88 v3_struct_0(A) | -l1_orders_2(A) | v3_struct_0(B) | -l1_orders_2(B) | -m1_subset_1(C,u1_struct_0(A)) | -m1_subset_1(D,u1_struct_0(A)) | -m1_subset_1(E,u1_struct_0(B)) | -m1_subset_1(F,u1_struct_0(B)) | E != C | F != D | -r1_latsum_1(A,B) | -v3_orders_2(A) | -v3_orders_2(B) | r1_orders_2(A,C,D) | -r1_orders_2(B,E,F) # label(t15_latsum_1) # label(axiom).  [clausify(46)].
% 0.75/1.06  89 v3_struct_0(A) | -l1_orders_2(A) | v3_struct_0(B) | -l1_orders_2(B) | -m1_subset_1(C,u1_struct_0(A)) | -m1_subset_1(D,u1_struct_0(A)) | -m1_subset_1(E,u1_struct_0(k1_latsum_1(A,B))) | -m1_subset_1(F,u1_struct_0(k1_latsum_1(A,B))) | E != C | F != D | -r1_latsum_1(A,B) | -v3_orders_2(A) | -r1_orders_2(A,C,D) | r1_orders_2(k1_latsum_1(A,B),E,F) # label(t8_latsum_1) # label(axiom).  [clausify(59)].
% 0.75/1.06  90 v3_struct_0(A) | -l1_orders_2(A) | v3_struct_0(B) | -l1_orders_2(B) | -m1_subset_1(C,u1_struct_0(A)) | -m1_subset_1(D,u1_struct_0(A)) | -m1_subset_1(E,u1_struct_0(k1_latsum_1(A,B))) | -m1_subset_1(F,u1_struct_0(k1_latsum_1(A,B))) | E != C | F != D | -r1_latsum_1(A,B) | -v3_orders_2(A) | r1_orders_2(A,C,D) | -r1_orders_2(k1_latsum_1(A,B),E,F) # label(t8_latsum_1) # label(axiom).  [clausify(59)].
% 0.75/1.06  Derived: v3_struct_0(c6) | -l1_orders_2(c6) | v3_struct_0(c7) | -l1_orders_2(c7) | -m1_subset_1(A,u1_struct_0(c6)) | -m1_subset_1(B,u1_struct_0(c6)) | -m1_subset_1(C,u1_struct_0(c7)) | -m1_subset_1(D,u1_struct_0(c7)) | C != A | D != B | -v3_orders_2(c6) | -v3_orders_2(c7) | -r1_orders_2(c6,A,B) | r1_orders_2(c7,C,D).  [resolve(86,a,87,k)].
% 0.75/1.06  Derived: v3_struct_0(c6) | -l1_orders_2(c6) | v3_struct_0(c7) | -l1_orders_2(c7) | -m1_subset_1(A,u1_struct_0(c6)) | -m1_subset_1(B,u1_struct_0(c6)) | -m1_subset_1(C,u1_struct_0(c7)) | -m1_subset_1(D,u1_struct_0(c7)) | C != A | D != B | -v3_orders_2(c6) | -v3_orders_2(c7) | r1_orders_2(c6,A,B) | -r1_orders_2(c7,C,D).  [resolve(86,a,88,k)].
% 0.75/1.06  Derived: v3_struct_0(c6) | -l1_orders_2(c6) | v3_struct_0(c7) | -l1_orders_2(c7) | -m1_subset_1(A,u1_struct_0(c6)) | -m1_subset_1(B,u1_struct_0(c6)) | -m1_subset_1(C,u1_struct_0(k1_latsum_1(c6,c7))) | -m1_subset_1(D,u1_struct_0(k1_latsum_1(c6,c7))) | C != A | D != B | -v3_orders_2(c6) | -r1_orders_2(c6,A,B) | r1_orders_2(k1_latsum_1(c6,c7),C,D).  [resolve(86,a,89,k)].
% 0.75/1.06  Derived: v3_struct_0(c6) | -l1_orders_2(c6) | v3_struct_0(c7) | -l1_orders_2(c7) | -m1_subset_1(A,u1_struct_0(c6)) | -m1_subset_1(B,u1_struct_0(c6)) | -m1_subset_1(C,u1_struct_0(k1_latsum_1(c6,c7))) | -m1_subset_1(D,u1_struct_0(k1_latsum_1(c6,c7))) | C != A | D != B | -v3_orders_2(c6) | r1_orders_2(c6,A,B) | -r1_orders_2(k1_latsum_1(c6,c7),C,D).  [resolve(86,a,90,k)].
% 0.75/1.06  
% 0.75/1.06  ============================== end predicate elimination =============
% 0.75/1.06  
% 0.75/1.06  Auto_denials:  (non-Horn, no changes).
% 0.75/1.06  
% 0.75/1.06  Term ordering decisions:
% 0.75/1.06  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. k3_xboole_0=1. k1_latsum_1=1. g1_orders_2=1. k2_zfmisc_1=1. f2=1. f4=1. u1_struct_0=1. k1_Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------