TSTP Solution File: SEU413+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU413+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:41 EDT 2022
% Result : Theorem 0.43s 1.02s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/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 21:10:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 32766 was started by sandbox2 on n027.cluster.edu,
% 0.43/1.01 Sun Jun 19 21:10:10 2022
% 0.43/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32482_n027.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_32482_n027.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (42 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01 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.43/1.01 2 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 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.43/1.01 4 (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.43/1.01 5 (all 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)) -> (r1_orders_2(A,B,C) <-> r2_hidden(k4_tarski(B,C),u1_orders_2(A))))))))) # label(d9_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 6 (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.43/1.01 7 (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.43/1.01 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 9 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 10 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 11 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 12 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 13 (all A (l1_orders_2(A) -> l1_struct_0(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 14 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 15 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 16 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 (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.43/1.01 18 (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.43/1.01 19 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 20 (exists A l1_orders_2(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 21 (exists A l1_struct_0(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 22 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 23 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 24 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 25 (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.43/1.01 26 (all A all B k3_xboole_0(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 27 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 28 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 29 (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.43/1.01 30 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 31 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 32 (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.43/1.01 33 (all A k3_xboole_0(A,k1_xboole_0) = k1_xboole_0) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 34 (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.43/1.01 35 (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.43/1.01 36 (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.43/1.01 37 (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.43/1.01 38 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 39 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 40 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 41 -(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))) -> (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_orders_2(k1_latsum_1(A,B),C,D) & r2_hidden(D,u1_struct_0(A)) -> r2_hidden(C,u1_struct_0(A))))))))))) # label(t23_latsum_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.02
% 0.43/1.02 ============================== PREDICATE ELIMINATION =================
% 0.43/1.02 42 m1_subset_1(A,k1_zfmisc_1(B)) | -r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(35)].
% 0.43/1.02 43 r1_tarski(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(30)].
% 0.43/1.02 44 -m1_subset_1(A,k1_zfmisc_1(B)) | r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(35)].
% 0.43/1.02 Derived: m1_subset_1(A,k1_zfmisc_1(A)). [resolve(42,b,43,a)].
% 0.43/1.02 45 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(29)].
% 0.43/1.02 46 m2_relset_1(f3(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(24)].
% 0.43/1.02 Derived: m1_relset_1(f3(A,B),A,B). [resolve(45,a,46,a)].
% 0.43/1.02 47 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(29)].
% 0.43/1.02 48 -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(18)].
% 0.43/1.02 Derived: -l1_orders_2(A) | m1_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)). [resolve(48,b,45,a)].
% 0.43/1.02 49 -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(17)].
% 0.43/1.02 Derived: m1_subset_1(f3(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(49,a,46,a)].
% 0.43/1.02 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(49,a,47,a)].
% 0.43/1.02 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(49,a,48,b)].
% 0.43/1.02 50 -l1_orders_2(A) | -m1_subset_1(B,u1_struct_0(A)) | -m1_subset_1(C,u1_struct_0(A)) | -r1_orders_2(A,B,C) | r2_hidden(k4_tarski(B,C),u1_orders_2(A)) # label(d9_orders_2) # label(axiom). [clausify(5)].
% 0.43/1.02 51 r1_orders_2(k1_latsum_1(c5,c6),c7,c8) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 Derived: -l1_orders_2(k1_latsum_1(c5,c6)) | -m1_subset_1(c7,u1_struct_0(k1_latsum_1(c5,c6))) | -m1_subset_1(c8,u1_struct_0(k1_latsum_1(c5,c6))) | r2_hidden(k4_tarski(c7,c8),u1_orders_2(k1_latsum_1(c5,c6))). [resolve(50,d,51,a)].
% 0.43/1.02 52 -l1_orders_2(A) | -m1_subset_1(B,u1_struct_0(A)) | -m1_subset_1(C,u1_struct_0(A)) | r1_orders_2(A,B,C) | -r2_hidden(k4_tarski(B,C),u1_orders_2(A)) # label(d9_orders_2) # label(axiom). [clausify(5)].
% 0.43/1.02 53 -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.43/1.02 54 -m1_relset_1(A,B,B) | v1_orders_2(g1_orders_2(B,A)) # label(dt_g1_orders_2) # label(axiom). [clausify(6)].
% 0.43/1.02 55 -l1_orders_2(A) | -l1_orders_2(B) | v1_orders_2(k1_latsum_1(A,B)) # label(dt_k1_latsum_1) # label(axiom). [clausify(7)].
% 0.43/1.02 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(53,b,54,b)].
% 0.43/1.02 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(53,b,55,c)].
% 0.43/1.02
% 0.43/1.02 ============================== end predicate elimination =============
% 0.43/1.02
% 0.43/1.02 Auto_denials: (non-Horn, no changes).
% 0.43/1.02
% 0.43/1.02 Term ordering decisions:
% 0.43/1.02 Function symbol KB weights: k1_xboole_0=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. k1_latsum_1=1. g1_orders_2=1. k3_xboole_0=1. k2_zfmisc_1=1. k4_tarski=1. f1=1. f3=1. u1_struct_0=1. k1_zfmisc_1=1. u1_orders_2=1. f2=1.
% 0.43/1.02
% 0.43/1.02 ============================== end of process initial clauses ========
% 0.43/1.02
% 0.43/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.02
% 0.43/1.02 ============================== end of clauses for search =============
% 0.43/1.02
% 0.43/1.02 ============================== SEARCH ================================
% 0.43/1.02
% 0.43/1.02 % Starting search at 0.02 seconds.
% 0.43/1.02
% 0.43/1.02 ============================== PROOF =================================
% 0.43/1.02 % SZS status Theorem
% 0.43/1.02 % SZS output start Refutation
% 0.43/1.02
% 0.43/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.02 % Length of proof is 21.
% 0.43/1.02 % Level of proof is 5.
% 0.43/1.02 % Maximum clause weight is 36.000.
% 0.43/1.02 % Given clauses 47.
% 0.43/1.02
% 0.43/1.02 5 (all 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)) -> (r1_orders_2(A,B,C) <-> r2_hidden(k4_tarski(B,C),u1_orders_2(A))))))))) # label(d9_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 7 (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.43/1.02 32 (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.43/1.02 41 -(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))) -> (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_orders_2(k1_latsum_1(A,B),C,D) & r2_hidden(D,u1_struct_0(A)) -> r2_hidden(C,u1_struct_0(A))))))))))) # label(t23_latsum_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.02 50 -l1_orders_2(A) | -m1_subset_1(B,u1_struct_0(A)) | -m1_subset_1(C,u1_struct_0(A)) | -r1_orders_2(A,B,C) | r2_hidden(k4_tarski(B,C),u1_orders_2(A)) # label(d9_orders_2) # label(axiom). [clausify(5)].
% 0.43/1.02 51 r1_orders_2(k1_latsum_1(c5,c6),c7,c8) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 59 l1_orders_2(c5) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 60 l1_orders_2(c6) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 62 r2_hidden(c8,u1_struct_0(c5)) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 66 m1_subset_1(c7,u1_struct_0(k1_latsum_1(c5,c6))) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 67 m1_subset_1(c8,u1_struct_0(k1_latsum_1(c5,c6))) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 69 v12_waybel_0(k3_xboole_0(u1_struct_0(c5),u1_struct_0(c6)),c6) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 70 m1_subset_1(k3_xboole_0(u1_struct_0(c5),u1_struct_0(c6)),k1_zfmisc_1(u1_struct_0(c6))) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 72 -r2_hidden(c7,u1_struct_0(c5)) # label(t23_latsum_1) # label(negated_conjecture). [clausify(41)].
% 0.43/1.02 80 -l1_orders_2(A) | -l1_orders_2(B) | l1_orders_2(k1_latsum_1(A,B)) # label(dt_k1_latsum_1) # label(axiom). [clausify(7)].
% 0.43/1.02 85 -l1_orders_2(A) | -l1_orders_2(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))) | -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). [clausify(32)].
% 0.43/1.02 92 -l1_orders_2(k1_latsum_1(c5,c6)) | -m1_subset_1(c7,u1_struct_0(k1_latsum_1(c5,c6))) | -m1_subset_1(c8,u1_struct_0(k1_latsum_1(c5,c6))) | r2_hidden(k4_tarski(c7,c8),u1_orders_2(k1_latsum_1(c5,c6))). [resolve(50,d,51,a)].
% 0.43/1.02 93 -l1_orders_2(k1_latsum_1(c5,c6)) | r2_hidden(k4_tarski(c7,c8),u1_orders_2(k1_latsum_1(c5,c6))). [copy(92),unit_del(b,66),unit_del(c,67)].
% 0.43/1.02 126 -r2_hidden(k4_tarski(c7,c8),u1_orders_2(k1_latsum_1(c5,c6))). [ur(85,a,59,a,b,60,a,c,69,a,d,70,a,f,62,a,g,72,a)].
% 0.43/1.02 127 -l1_orders_2(k1_latsum_1(c5,c6)). [back_unit_del(93),unit_del(b,126)].
% 0.43/1.02 150 $F. [ur(80,b,60,a,c,127,a),unit_del(a,59)].
% 0.43/1.02
% 0.43/1.02 % SZS output end Refutation
% 0.43/1.02 ============================== end of proof ==========================
% 0.43/1.02
% 0.43/1.02 ============================== STATISTICS ============================
% 0.43/1.02
% 0.43/1.02 Given=47. Generated=125. Kept=93. proofs=1.
% 0.43/1.02 Usable=46. Sos=42. Demods=6. Limbo=0, Disabled=61. Hints=0.
% 0.43/1.02 Megabytes=0.19.
% 0.43/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.02
% 0.43/1.02 ============================== end of statistics =====================
% 0.43/1.02
% 0.43/1.02 ============================== end of search =========================
% 0.43/1.02
% 0.43/1.02 THEOREM PROVED
% 0.43/1.02 % SZS status Theorem
% 0.43/1.02
% 0.43/1.02 Exiting with 1 proof.
% 0.43/1.02
% 0.43/1.02 Process 32766 exit (max_proofs) Sun Jun 19 21:10:10 2022
% 0.43/1.02 Prover9 interrupted
%------------------------------------------------------------------------------