TSTP Solution File: SEU407+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU407+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %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 : 300s
% DateTime : Wed Jul 27 13:16:08 EDT 2022
% Result : Timeout 299.92s 300.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU407+1 : TPTP v8.1.0. Released v3.4.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:54:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.84/2.05 ----- Otter 3.3f, August 2004 -----
% 1.84/2.05 The process was started by sandbox2 on n027.cluster.edu,
% 1.84/2.05 Wed Jul 27 07:54:21 2022
% 1.84/2.05 The command was "./otter". The process ID is 26131.
% 1.84/2.05
% 1.84/2.05 set(prolog_style_variables).
% 1.84/2.05 set(auto).
% 1.84/2.05 dependent: set(auto1).
% 1.84/2.05 dependent: set(process_input).
% 1.84/2.05 dependent: clear(print_kept).
% 1.84/2.05 dependent: clear(print_new_demod).
% 1.84/2.05 dependent: clear(print_back_demod).
% 1.84/2.05 dependent: clear(print_back_sub).
% 1.84/2.05 dependent: set(control_memory).
% 1.84/2.05 dependent: assign(max_mem, 12000).
% 1.84/2.05 dependent: assign(pick_given_ratio, 4).
% 1.84/2.05 dependent: assign(stats_level, 1).
% 1.84/2.05 dependent: assign(max_seconds, 10800).
% 1.84/2.05 clear(print_given).
% 1.84/2.05
% 1.84/2.05 formula_list(usable).
% 1.84/2.05 all A (A=A).
% 1.84/2.05 -(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(k1_latsum_1(A,B)))->r2_hidden(C,u1_struct_0(A))|r2_hidden(C,k4_xboole_0(u1_struct_0(B),u1_struct_0(A))))))))).
% 1.84/2.05 all A (l1_orders_2(A)-> (v1_orders_2(A)->A=g1_orders_2(u1_struct_0(A),u1_orders_2(A)))).
% 1.84/2.05 all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 1.84/2.05 all A B C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))->v1_relat_1(C)).
% 1.84/2.05 all A B (k2_xboole_0(A,B)=k2_xboole_0(B,A)).
% 1.84/2.05 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))))))))).
% 1.84/2.05 all A B C (C=k2_xboole_0(A,B)<-> (all D (r2_hidden(D,C)<->r2_hidden(D,A)|r2_hidden(D,B)))).
% 1.84/2.05 all A B (m1_relset_1(B,A,A)->v1_orders_2(g1_orders_2(A,B))&l1_orders_2(g1_orders_2(A,B))).
% 1.84/2.05 all A 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))).
% 1.84/2.05 $T.
% 1.84/2.05 $T.
% 1.84/2.05 $T.
% 1.84/2.05 $T.
% 1.84/2.05 $T.
% 1.84/2.05 all A B (v1_relat_1(A)&v1_relat_1(B)->v1_relat_1(k5_relat_1(A,B))).
% 1.84/2.05 all A B C D E 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)).
% 1.84/2.05 all A (l1_orders_2(A)->l1_struct_0(A)).
% 1.84/2.05 $T.
% 1.84/2.05 $T.
% 1.84/2.05 $T.
% 1.84/2.05 all A B C (m2_relset_1(C,A,B)->m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))).
% 1.84/2.05 all A (l1_orders_2(A)->m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A))).
% 1.84/2.05 $T.
% 1.84/2.05 exists A l1_orders_2(A).
% 1.84/2.05 exists A l1_struct_0(A).
% 1.84/2.05 all A B exists C m1_relset_1(C,A,B).
% 1.84/2.05 all A exists B m1_subset_1(B,A).
% 1.84/2.05 all A B exists C m2_relset_1(C,A,B).
% 1.84/2.05 all A 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))).
% 1.84/2.05 all A (-v3_struct_0(A)&l1_struct_0(A)-> -v1_xboole_0(u1_struct_0(A))).
% 1.84/2.05 v1_xboole_0(k1_xboole_0).
% 1.84/2.05 all A 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))).
% 1.84/2.05 all A B (-v1_xboole_0(A)-> -v1_xboole_0(k2_xboole_0(A,B))).
% 1.84/2.05 all A B (-v1_xboole_0(A)-> -v1_xboole_0(k2_xboole_0(B,A))).
% 1.84/2.05 all A B (m1_relset_1(B,A,A)-> (all C D (g1_orders_2(A,B)=g1_orders_2(C,D)->A=C&B=D))).
% 1.84/2.05 all A B (k2_xboole_0(A,A)=A).
% 1.84/2.05 exists A v1_xboole_0(A).
% 1.84/2.05 exists A (-v1_xboole_0(A)).
% 1.84/2.05 exists A (l1_struct_0(A)& -v3_struct_0(A)).
% 1.84/2.05 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)))).
% 1.84/2.05 all A B C D E 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)).
% 1.84/2.05 all A B C (m2_relset_1(C,A,B)<->m1_relset_1(C,A,B)).
% 1.84/2.05 all A B r1_tarski(A,A).
% 1.84/2.05 all A (k2_xboole_0(A,k1_xboole_0)=A).
% 1.84/2.05 all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 1.84/2.05 all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 1.84/2.05 all A B (k2_xboole_0(A,k4_xboole_0(B,A))=k2_xboole_0(A,B)).
% 1.84/2.05 all A (k4_xboole_0(A,k1_xboole_0)=A).
% 1.84/2.05 all A B (m1_subset_1(A,k1_zfmisc_1(B))<->r1_tarski(A,B)).
% 1.84/2.05 all A (k4_xboole_0(k1_xboole_0,A)=k1_xboole_0).
% 1.84/2.05 all A B C (r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))->m1_subset_1(A,C)).
% 1.84/2.05 all A B C (-(r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))&v1_xboole_0(C))).
% 1.84/2.05 all A (v1_xboole_0(A)->A=k1_xboole_0).
% 1.84/2.05 all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 1.84/2.05 all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 1.84/2.05 end_of_list.
% 1.84/2.05
% 1.84/2.05 -------> usable clausifies to:
% 1.84/2.05
% 1.84/2.05 list(usable).
% 1.84/2.05 0 [] A=A.
% 1.84/2.05 0 [] -v3_struct_0($c3).
% 1.84/2.05 0 [] l1_orders_2($c3).
% 1.84/2.05 0 [] -v3_struct_0($c2).
% 1.84/2.05 0 [] l1_orders_2($c2).
% 1.84/2.05 0 [] m1_subset_1($c1,u1_struct_0(k1_latsum_1($c3,$c2))).
% 1.84/2.05 0 [] -r2_hidden($c1,u1_struct_0($c3)).
% 1.84/2.05 0 [] -r2_hidden($c1,k4_xboole_0(u1_struct_0($c2),u1_struct_0($c3))).
% 1.84/2.05 0 [] -l1_orders_2(A)| -v1_orders_2(A)|A=g1_orders_2(u1_struct_0(A),u1_orders_2(A)).
% 1.84/2.05 0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.84/2.05 0 [] -m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))|v1_relat_1(C).
% 1.84/2.05 0 [] k2_xboole_0(A,B)=k2_xboole_0(B,A).
% 1.84/2.05 0 [] -l1_orders_2(A)| -l1_orders_2(B)| -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)).
% 1.84/2.05 0 [] -l1_orders_2(A)| -l1_orders_2(B)| -v1_orders_2(C)| -l1_orders_2(C)|C!=k1_latsum_1(A,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))).
% 1.84/2.05 0 [] -l1_orders_2(A)| -l1_orders_2(B)| -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))).
% 1.84/2.05 0 [] C!=k2_xboole_0(A,B)| -r2_hidden(D,C)|r2_hidden(D,A)|r2_hidden(D,B).
% 1.84/2.05 0 [] C!=k2_xboole_0(A,B)|r2_hidden(D,C)| -r2_hidden(D,A).
% 1.84/2.05 0 [] C!=k2_xboole_0(A,B)|r2_hidden(D,C)| -r2_hidden(D,B).
% 1.84/2.05 0 [] C=k2_xboole_0(A,B)|r2_hidden($f1(A,B,C),C)|r2_hidden($f1(A,B,C),A)|r2_hidden($f1(A,B,C),B).
% 1.84/2.05 0 [] C=k2_xboole_0(A,B)| -r2_hidden($f1(A,B,C),C)| -r2_hidden($f1(A,B,C),A).
% 1.84/2.05 0 [] C=k2_xboole_0(A,B)| -r2_hidden($f1(A,B,C),C)| -r2_hidden($f1(A,B,C),B).
% 1.84/2.05 0 [] -m1_relset_1(B,A,A)|v1_orders_2(g1_orders_2(A,B)).
% 1.84/2.05 0 [] -m1_relset_1(B,A,A)|l1_orders_2(g1_orders_2(A,B)).
% 1.84/2.05 0 [] -l1_orders_2(A)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 0 [] -l1_orders_2(A)| -l1_orders_2(B)|l1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] -v1_relat_1(A)| -v1_relat_1(B)|v1_relat_1(k5_relat_1(A,B)).
% 1.84/2.05 0 [] -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).
% 1.84/2.05 0 [] -l1_orders_2(A)|l1_struct_0(A).
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] -m2_relset_1(C,A,B)|m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))).
% 1.84/2.05 0 [] -l1_orders_2(A)|m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)).
% 1.84/2.05 0 [] $T.
% 1.84/2.05 0 [] l1_orders_2($c4).
% 1.84/2.05 0 [] l1_struct_0($c5).
% 1.84/2.05 0 [] m1_relset_1($f2(A,B),A,B).
% 1.84/2.05 0 [] m1_subset_1($f3(A),A).
% 1.84/2.05 0 [] m2_relset_1($f4(A,B),A,B).
% 1.84/2.05 0 [] -l1_orders_2(A)|v3_struct_0(B)| -l1_orders_2(B)| -v3_struct_0(k1_latsum_1(A,B)).
% 1.84/2.05 0 [] -l1_orders_2(A)|v3_struct_0(B)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 0 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0(u1_struct_0(A)).
% 1.84/2.05 0 [] v1_xboole_0(k1_xboole_0).
% 1.84/2.05 0 [] v3_struct_0(A)| -l1_orders_2(A)| -l1_orders_2(B)| -v3_struct_0(k1_latsum_1(A,B)).
% 1.84/2.05 0 [] v3_struct_0(A)| -l1_orders_2(A)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 0 [] v1_xboole_0(A)| -v1_xboole_0(k2_xboole_0(A,B)).
% 1.84/2.05 0 [] v1_xboole_0(A)| -v1_xboole_0(k2_xboole_0(B,A)).
% 1.84/2.05 0 [] -m1_relset_1(B,A,A)|g1_orders_2(A,B)!=g1_orders_2(C,D)|A=C.
% 1.84/2.05 0 [] -m1_relset_1(B,A,A)|g1_orders_2(A,B)!=g1_orders_2(C,D)|B=D.
% 1.84/2.05 0 [] k2_xboole_0(A,A)=A.
% 1.84/2.05 0 [] v1_xboole_0($c6).
% 1.84/2.05 0 [] -v1_xboole_0($c7).
% 1.84/2.05 0 [] l1_struct_0($c8).
% 1.84/2.05 0 [] -v3_struct_0($c8).
% 1.84/2.05 0 [] v3_struct_0(A)| -l1_struct_0(A)|m1_subset_1($f5(A),k1_zfmisc_1(u1_struct_0(A))).
% 1.84/2.05 0 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0($f5(A)).
% 1.84/2.05 0 [] -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).
% 1.84/2.05 0 [] -m2_relset_1(C,A,B)|m1_relset_1(C,A,B).
% 1.84/2.05 0 [] m2_relset_1(C,A,B)| -m1_relset_1(C,A,B).
% 1.84/2.05 0 [] r1_tarski(A,A).
% 1.84/2.05 0 [] k2_xboole_0(A,k1_xboole_0)=A.
% 1.84/2.05 0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.84/2.05 0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.84/2.05 0 [] k2_xboole_0(A,k4_xboole_0(B,A))=k2_xboole_0(A,B).
% 1.84/2.05 0 [] k4_xboole_0(A,k1_xboole_0)=A.
% 1.84/2.05 0 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.84/2.05 0 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.84/2.05 0 [] k4_xboole_0(k1_xboole_0,A)=k1_xboole_0.
% 1.84/2.05 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.84/2.05 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.84/2.05 0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.84/2.05 0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.84/2.05 0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.84/2.05 end_of_list.
% 1.84/2.05
% 1.84/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.84/2.05
% 1.84/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.84/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.84/2.05 deletion, with positive clauses in sos and nonpositive
% 1.84/2.05 clauses in usable.
% 1.84/2.05
% 1.84/2.05 dependent: set(knuth_bendix).
% 1.84/2.05 dependent: set(anl_eq).
% 1.84/2.05 dependent: set(para_from).
% 1.84/2.05 dependent: set(para_into).
% 1.84/2.05 dependent: clear(para_from_right).
% 1.84/2.05 dependent: clear(para_into_right).
% 1.84/2.05 dependent: set(para_from_vars).
% 1.84/2.05 dependent: set(eq_units_both_ways).
% 1.84/2.05 dependent: set(dynamic_demod_all).
% 1.84/2.05 dependent: set(dynamic_demod).
% 1.84/2.05 dependent: set(order_eq).
% 1.84/2.05 dependent: set(back_demod).
% 1.84/2.05 dependent: set(lrpo).
% 1.84/2.05 dependent: set(hyper_res).
% 1.84/2.05 dependent: set(unit_deletion).
% 1.84/2.05 dependent: set(factor).
% 1.84/2.05
% 1.84/2.05 ------------> process usable:
% 1.84/2.05 ** KEPT (pick-wt=2): 1 [] -v3_struct_0($c3).
% 1.84/2.05 ** KEPT (pick-wt=2): 2 [] -v3_struct_0($c2).
% 1.84/2.05 ** KEPT (pick-wt=4): 3 [] -r2_hidden($c1,u1_struct_0($c3)).
% 1.84/2.05 ** KEPT (pick-wt=7): 4 [] -r2_hidden($c1,k4_xboole_0(u1_struct_0($c2),u1_struct_0($c3))).
% 1.84/2.05 ** KEPT (pick-wt=11): 6 [copy,5,flip.3] -l1_orders_2(A)| -v1_orders_2(A)|g1_orders_2(u1_struct_0(A),u1_orders_2(A))=A.
% 1.84/2.05 ** KEPT (pick-wt=6): 7 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.84/2.05 ** KEPT (pick-wt=8): 8 [] -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C)))|v1_relat_1(A).
% 1.84/2.05 ** KEPT (pick-wt=21): 9 [] -l1_orders_2(A)| -l1_orders_2(B)| -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)).
% 1.84/2.05 ** KEPT (pick-wt=35): 10 [] -l1_orders_2(A)| -l1_orders_2(B)| -v1_orders_2(C)| -l1_orders_2(C)|C!=k1_latsum_1(A,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))).
% 1.84/2.05 ** KEPT (pick-wt=43): 11 [] -l1_orders_2(A)| -l1_orders_2(B)| -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))).
% 1.84/2.05 ** KEPT (pick-wt=14): 12 [] A!=k2_xboole_0(B,C)| -r2_hidden(D,A)|r2_hidden(D,B)|r2_hidden(D,C).
% 1.84/2.05 ** KEPT (pick-wt=11): 13 [] A!=k2_xboole_0(B,C)|r2_hidden(D,A)| -r2_hidden(D,B).
% 1.84/2.05 ** KEPT (pick-wt=11): 14 [] A!=k2_xboole_0(B,C)|r2_hidden(D,A)| -r2_hidden(D,C).
% 1.84/2.05 ** KEPT (pick-wt=17): 15 [] A=k2_xboole_0(B,C)| -r2_hidden($f1(B,C,A),A)| -r2_hidden($f1(B,C,A),B).
% 1.84/2.05 ** KEPT (pick-wt=17): 16 [] A=k2_xboole_0(B,C)| -r2_hidden($f1(B,C,A),A)| -r2_hidden($f1(B,C,A),C).
% 1.84/2.05 ** KEPT (pick-wt=8): 17 [] -m1_relset_1(A,B,B)|v1_orders_2(g1_orders_2(B,A)).
% 1.84/2.05 ** KEPT (pick-wt=8): 18 [] -m1_relset_1(A,B,B)|l1_orders_2(g1_orders_2(B,A)).
% 1.84/2.05 ** KEPT (pick-wt=8): 19 [] -l1_orders_2(A)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 ** KEPT (pick-wt=8): 20 [] -l1_orders_2(A)| -l1_orders_2(B)|l1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 ** KEPT (pick-wt=8): 21 [] -v1_relat_1(A)| -v1_relat_1(B)|v1_relat_1(k5_relat_1(A,B)).
% 1.84/2.05 ** KEPT (pick-wt=18): 22 [] -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).
% 1.84/2.05 ** KEPT (pick-wt=4): 23 [] -l1_orders_2(A)|l1_struct_0(A).
% 1.84/2.05 ** KEPT (pick-wt=10): 24 [] -m2_relset_1(A,B,C)|m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))).
% 1.84/2.05 ** KEPT (pick-wt=9): 25 [] -l1_orders_2(A)|m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)).
% 1.84/2.05 ** KEPT (pick-wt=10): 26 [] -l1_orders_2(A)|v3_struct_0(B)| -l1_orders_2(B)| -v3_struct_0(k1_latsum_1(A,B)).
% 1.84/2.05 Following clause subsumed by 19 during input processing: 0 [] -l1_orders_2(A)|v3_struct_0(B)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 ** KEPT (pick-wt=7): 27 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0(u1_struct_0(A)).
% 1.84/2.05 ** KEPT (pick-wt=10): 28 [] v3_struct_0(A)| -l1_orders_2(A)| -l1_orders_2(B)| -v3_struct_0(k1_latsum_1(A,B)).
% 1.84/2.05 Following clause subsumed by 19 during input processing: 0 [] v3_struct_0(A)| -l1_orders_2(A)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 1.84/2.05 ** KEPT (pick-wt=6): 29 [] v1_xboole_0(A)| -v1Alarm clock
% 299.92/300.09 Otter interrupted
% 299.92/300.09 PROOF NOT FOUND
%------------------------------------------------------------------------------