TSTP Solution File: SEU412+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU412+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 : Timeout 300.02s 300.27s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU412+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 21:25:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.02 ============================== Prover9 ===============================
% 0.42/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.02 Process 30785 was started by sandbox2 on n028.cluster.edu,
% 0.42/1.02 Sat Jun 18 21:25:30 2022
% 0.42/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30632_n028.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_30632_n028.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 (57 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 k2_xboole_0(A,B) = k2_xboole_0(B,A)) # label(commutativity_k2_xboole_0) # 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 (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.42/1.02 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.42/1.02 8 (all A all B all C (C = k4_xboole_0(A,B) <-> (all D (r2_hidden(D,C) <-> r2_hidden(D,A) & -r2_hidden(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 9 (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 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_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 14 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 15 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 16 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 17 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 18 (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.42/1.02 19 (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.42/1.02 20 (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 21 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 22 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 23 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 24 (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 25 (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 26 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 27 (exists A l1_orders_2(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 28 (exists A l1_struct_0(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 29 (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 30 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 31 (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 32 (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.42/1.02 33 (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.42/1.02 34 (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 35 (all A all B k2_xboole_0(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 36 (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 37 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 38 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 39 (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.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.02 41 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 42 (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.42/1.02 43 (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.42/1.02 44 (all A k2_xboole_0(A,k1_xboole_0) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 45 (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.02 46 (all A k3_xboole_0(A,k1_xboole_0) = k1_xboole_0) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 47 (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.02 48 (all A k4_xboole_0(A,k1_xboole_0) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 49 (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.02 50 (all A k4_xboole_0(k1_xboole_0,A) = k1_xboole_0) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 51 (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.02 52 (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.02 53 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 54 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 55 (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.02 56 -(all A all B all C (l1_orders_2(C) -> (all D (l1_orders_2(D) -> -(r2_hidden(k4_tarski(A,B),u1_orders_2(k1_latsum_1(C,D))) & v13_waybel_0(k3_xboole_0(u1_struct_0(C),u1_struct_0(D)),C) & m1_subset_1(k3_xboole_0(u1_struct_0(C),u1_struct_0(D)),k1_zfmisc_1(u1_struct_0(C))) & -(r2_hidden(A,u1_struct_0(C)) & r2_hidden(B,u1_struct_0(C))) & -(r2_hidden(A,u1_struct_0(D)) & r2_hidden(B,u1_struct_0(D))) & -(r2_hidden(A,k4_xboole_0(u1_struct_0(C),u1_struct_0(D))) & r2_hidden(B,k4_xboole_0(u1_struct_0(D),u1_struct_0(C))))))))) # label(t22_latsum_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.02
% 0.42/1.02 ============================== end of process non-clausal formulas ===
% 0.42/1.02
% 0.42/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.02
% 0.42/1.02 ============================== PREDICATE ELIMINATION =================
% 0.42/1.02 57 m1_subset_1(A,k1_zfmisc_1(B)) | -r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(49)].
% 0.42/1.02 58 r1_tarski(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(41)].
% 0.42/1.02 59 -m1_subset_1(A,k1_zfmisc_1(B)) | r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(49)].
% 0.42/1.02 Derived: m1_subset_1(A,k1_zfmisc_1(A)). [resolve(57,b,58,a)].
% 0.42/1.02 60 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(40)].
% 0.42/1.02 61 m2_relset_1(f5(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(31)].
% 0.42/1.02 Derived: m1_relset_1(f5(A,B),A,B). [resolve(60,a,61,a)].
% 0.42/1.02 62 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(40)].
% 0.42/1.02 63 -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(25)].
% 0.42/1.02 Derived: -l1_orders_2(A) | m1_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)). [resolve(63,b,60,a)].
% 0.42/1.02 64 -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(24)].
% 0.42/1.02 Derived: m1_subset_1(f5(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(64,a,61,a)].
% 0.42/1.02 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(64,a,62,a)].
% 0.42/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(64,a,63,b)].
% 0.42/1.02 65 -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(19)].
% 0.42/1.03 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(65,c,60,a)].
% 0.42/1.03 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(65,c,64,a)].
% 0.42/1.03 66 -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 67 -m1_relset_1(A,B,B) | v1_orders_2(g1_orders_2(B,A)) # label(dt_g1_orders_2) # label(axiom). [clausify(9)].
% 0.42/1.03 68 -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(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(66,b,67,b)].
% 0.42/1.03 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(66,b,68,c)].
% 0.42/1.03 69 -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)].
% 0.42/1.03 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(69,c,67,b)].
% 0.42/1.03 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(69,c,68,c)].
% 0.42/1.03 70 -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)].
% 0.42/1.03 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(70,c,67,b)].
% 0.42/1.03 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(70,c,68,c)].
% 0.42/1.03 71 -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)].
% 0.42/1.03 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(71,c,67,b)].
% 0.42/1.03 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(71,c,68,c)].
% 0.42/1.03
% 0.42/1.03 ============================== end predicateCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------