TSTP Solution File: SEU413+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %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 : 300s
% DateTime : Wed Jul 27 13:16:10 EDT 2022
% Result : Theorem 2.29s 2.52s
% Output : Refutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 28 ( 0 equ; 13 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ r2_hidden(dollar_c2,u1_struct_0(dollar_c4)),
file('SEU413+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ 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)) ),
file('SEU413+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ l1_orders_2(A)
| ~ l1_orders_2(B)
| l1_orders_2(k1_latsum_1(A,B)) ),
file('SEU413+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ 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)) ),
file('SEU413+1.p',unknown),
[] ).
cnf(38,axiom,
l1_orders_2(dollar_c4),
file('SEU413+1.p',unknown),
[] ).
cnf(39,axiom,
l1_orders_2(dollar_c3),
file('SEU413+1.p',unknown),
[] ).
cnf(40,axiom,
m1_subset_1(dollar_c2,u1_struct_0(k1_latsum_1(dollar_c4,dollar_c3))),
file('SEU413+1.p',unknown),
[] ).
cnf(41,axiom,
m1_subset_1(dollar_c1,u1_struct_0(k1_latsum_1(dollar_c4,dollar_c3))),
file('SEU413+1.p',unknown),
[] ).
cnf(42,axiom,
v12_waybel_0(k3_xboole_0(u1_struct_0(dollar_c4),u1_struct_0(dollar_c3)),dollar_c3),
file('SEU413+1.p',unknown),
[] ).
cnf(43,axiom,
m1_subset_1(k3_xboole_0(u1_struct_0(dollar_c4),u1_struct_0(dollar_c3)),k1_zfmisc_1(u1_struct_0(dollar_c3))),
file('SEU413+1.p',unknown),
[] ).
cnf(44,axiom,
r1_orders_2(k1_latsum_1(dollar_c4,dollar_c3),dollar_c2,dollar_c1),
file('SEU413+1.p',unknown),
[] ).
cnf(45,axiom,
r2_hidden(dollar_c1,u1_struct_0(dollar_c4)),
file('SEU413+1.p',unknown),
[] ).
cnf(72,plain,
l1_orders_2(k1_latsum_1(dollar_c4,dollar_c3)),
inference(hyper,[status(thm)],[39,11,38]),
[iquote('hyper,39,11,38')] ).
cnf(384,plain,
r2_hidden(k4_tarski(dollar_c2,dollar_c1),u1_orders_2(k1_latsum_1(dollar_c4,dollar_c3))),
inference(hyper,[status(thm)],[44,6,72,40,41]),
[iquote('hyper,44,6,72,40,41')] ).
cnf(2416,plain,
r2_hidden(dollar_c2,u1_struct_0(dollar_c4)),
inference(hyper,[status(thm)],[384,21,38,39,42,43,45]),
[iquote('hyper,384,21,38,39,42,43,45')] ).
cnf(2417,plain,
$false,
inference(binary,[status(thm)],[2416,1]),
[iquote('binary,2416.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 08:01:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.05/2.22 ----- Otter 3.3f, August 2004 -----
% 2.05/2.22 The process was started by sandbox on n015.cluster.edu,
% 2.05/2.22 Wed Jul 27 08:01:42 2022
% 2.05/2.22 The command was "./otter". The process ID is 8302.
% 2.05/2.22
% 2.05/2.22 set(prolog_style_variables).
% 2.05/2.22 set(auto).
% 2.05/2.22 dependent: set(auto1).
% 2.05/2.22 dependent: set(process_input).
% 2.05/2.22 dependent: clear(print_kept).
% 2.05/2.22 dependent: clear(print_new_demod).
% 2.05/2.22 dependent: clear(print_back_demod).
% 2.05/2.22 dependent: clear(print_back_sub).
% 2.05/2.22 dependent: set(control_memory).
% 2.05/2.22 dependent: assign(max_mem, 12000).
% 2.05/2.22 dependent: assign(pick_given_ratio, 4).
% 2.05/2.22 dependent: assign(stats_level, 1).
% 2.05/2.22 dependent: assign(max_seconds, 10800).
% 2.05/2.22 clear(print_given).
% 2.05/2.22
% 2.05/2.22 formula_list(usable).
% 2.05/2.22 all A (A=A).
% 2.05/2.22 -(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))))))))))).
% 2.05/2.22 all A (l1_orders_2(A)-> (v1_orders_2(A)->A=g1_orders_2(u1_struct_0(A),u1_orders_2(A)))).
% 2.05/2.22 all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 2.05/2.22 all A B C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))->v1_relat_1(C)).
% 2.05/2.22 all A B (k3_xboole_0(A,B)=k3_xboole_0(B,A)).
% 2.05/2.22 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)))))))).
% 2.05/2.22 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))).
% 2.05/2.22 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))).
% 2.05/2.22 $T.
% 2.05/2.22 $T.
% 2.05/2.22 $T.
% 2.05/2.22 $T.
% 2.05/2.22 $T.
% 2.05/2.22 all A (l1_orders_2(A)->l1_struct_0(A)).
% 2.05/2.22 $T.
% 2.05/2.22 $T.
% 2.05/2.22 $T.
% 2.05/2.22 all A B C (m2_relset_1(C,A,B)->m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))).
% 2.05/2.22 all A (l1_orders_2(A)->m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A))).
% 2.05/2.22 $T.
% 2.05/2.22 exists A l1_orders_2(A).
% 2.05/2.22 exists A l1_struct_0(A).
% 2.05/2.22 all A B exists C m1_relset_1(C,A,B).
% 2.05/2.22 all A exists B m1_subset_1(B,A).
% 2.05/2.22 all A B exists C m2_relset_1(C,A,B).
% 2.05/2.22 v1_xboole_0(k1_xboole_0).
% 2.05/2.22 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))).
% 2.05/2.22 all A B (k3_xboole_0(A,A)=A).
% 2.05/2.22 exists A v1_xboole_0(A).
% 2.05/2.22 exists A (-v1_xboole_0(A)).
% 2.05/2.22 all A B C (m2_relset_1(C,A,B)<->m1_relset_1(C,A,B)).
% 2.05/2.22 all A B r1_tarski(A,A).
% 2.05/2.22 all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 2.05/2.22 all A (l1_orders_2(A)-> (all B (l1_orders_2(B)-> (all C 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))))))).
% 2.05/2.22 all A (k3_xboole_0(A,k1_xboole_0)=k1_xboole_0).
% 2.05/2.22 all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 2.05/2.22 all A B (m1_subset_1(A,k1_zfmisc_1(B))<->r1_tarski(A,B)).
% 2.05/2.22 all A B C (r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))->m1_subset_1(A,C)).
% 2.05/2.22 all A B C (-(r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))&v1_xboole_0(C))).
% 2.05/2.22 all A (v1_xboole_0(A)->A=k1_xboole_0).
% 2.05/2.22 all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 2.05/2.22 all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 2.05/2.22 end_of_list.
% 2.05/2.22
% 2.05/2.22 -------> usable clausifies to:
% 2.05/2.22
% 2.05/2.22 list(usable).
% 2.05/2.22 0 [] A=A.
% 2.05/2.22 0 [] l1_orders_2($c4).
% 2.05/2.22 0 [] l1_orders_2($c3).
% 2.05/2.22 0 [] m1_subset_1($c2,u1_struct_0(k1_latsum_1($c4,$c3))).
% 2.05/2.22 0 [] m1_subset_1($c1,u1_struct_0(k1_latsum_1($c4,$c3))).
% 2.05/2.22 0 [] v12_waybel_0(k3_xboole_0(u1_struct_0($c4),u1_struct_0($c3)),$c3).
% 2.05/2.22 0 [] m1_subset_1(k3_xboole_0(u1_struct_0($c4),u1_struct_0($c3)),k1_zfmisc_1(u1_struct_0($c3))).
% 2.05/2.22 0 [] r1_orders_2(k1_latsum_1($c4,$c3),$c2,$c1).
% 2.05/2.22 0 [] r2_hidden($c1,u1_struct_0($c4)).
% 2.05/2.22 0 [] -r2_hidden($c2,u1_struct_0($c4)).
% 2.05/2.22 0 [] -l1_orders_2(A)| -v1_orders_2(A)|A=g1_orders_2(u1_struct_0(A),u1_orders_2(A)).
% 2.05/2.22 0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 2.05/2.22 0 [] -m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))|v1_relat_1(C).
% 2.05/2.22 0 [] k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 2.05/2.22 0 [] -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)).
% 2.05/2.22 0 [] -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)).
% 2.05/2.22 0 [] -m1_relset_1(B,A,A)|v1_orders_2(g1_orders_2(A,B)).
% 2.05/2.22 0 [] -m1_relset_1(B,A,A)|l1_orders_2(g1_orders_2(A,B)).
% 2.05/2.22 0 [] -l1_orders_2(A)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 2.05/2.22 0 [] -l1_orders_2(A)| -l1_orders_2(B)|l1_orders_2(k1_latsum_1(A,B)).
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] -l1_orders_2(A)|l1_struct_0(A).
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] -m2_relset_1(C,A,B)|m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))).
% 2.05/2.22 0 [] -l1_orders_2(A)|m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)).
% 2.05/2.22 0 [] $T.
% 2.05/2.22 0 [] l1_orders_2($c5).
% 2.05/2.22 0 [] l1_struct_0($c6).
% 2.05/2.22 0 [] m1_relset_1($f1(A,B),A,B).
% 2.05/2.22 0 [] m1_subset_1($f2(A),A).
% 2.05/2.22 0 [] m2_relset_1($f3(A,B),A,B).
% 2.05/2.22 0 [] v1_xboole_0(k1_xboole_0).
% 2.05/2.22 0 [] -m1_relset_1(B,A,A)|g1_orders_2(A,B)!=g1_orders_2(C,D)|A=C.
% 2.05/2.22 0 [] -m1_relset_1(B,A,A)|g1_orders_2(A,B)!=g1_orders_2(C,D)|B=D.
% 2.05/2.22 0 [] k3_xboole_0(A,A)=A.
% 2.05/2.22 0 [] v1_xboole_0($c7).
% 2.05/2.22 0 [] -v1_xboole_0($c8).
% 2.05/2.22 0 [] -m2_relset_1(C,A,B)|m1_relset_1(C,A,B).
% 2.05/2.22 0 [] m2_relset_1(C,A,B)| -m1_relset_1(C,A,B).
% 2.05/2.22 0 [] r1_tarski(A,A).
% 2.05/2.22 0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 2.05/2.22 0 [] -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)).
% 2.05/2.22 0 [] k3_xboole_0(A,k1_xboole_0)=k1_xboole_0.
% 2.05/2.22 0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 2.05/2.22 0 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 2.05/2.22 0 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 2.05/2.22 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 2.05/2.22 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 2.05/2.22 0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 2.05/2.22 0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 2.05/2.22 0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 2.05/2.22 end_of_list.
% 2.05/2.22
% 2.05/2.22 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.05/2.22
% 2.05/2.22 This ia a non-Horn set with equality. The strategy will be
% 2.05/2.22 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.05/2.22 deletion, with positive clauses in sos and nonpositive
% 2.05/2.22 clauses in usable.
% 2.05/2.22
% 2.05/2.22 dependent: set(knuth_bendix).
% 2.05/2.22 dependent: set(anl_eq).
% 2.05/2.22 dependent: set(para_from).
% 2.05/2.22 dependent: set(para_into).
% 2.05/2.22 dependent: clear(para_from_right).
% 2.05/2.22 dependent: clear(para_into_right).
% 2.05/2.22 dependent: set(para_from_vars).
% 2.05/2.22 dependent: set(eq_units_both_ways).
% 2.05/2.22 dependent: set(dynamic_demod_all).
% 2.05/2.22 dependent: set(dynamic_demod).
% 2.05/2.22 dependent: set(order_eq).
% 2.05/2.22 dependent: set(back_demod).
% 2.05/2.22 dependent: set(lrpo).
% 2.05/2.22 dependent: set(hyper_res).
% 2.05/2.22 dependent: set(unit_deletion).
% 2.05/2.22 dependent: set(factor).
% 2.05/2.22
% 2.05/2.22 ------------> process usable:
% 2.05/2.22 ** KEPT (pick-wt=4): 1 [] -r2_hidden($c2,u1_struct_0($c4)).
% 2.05/2.22 ** KEPT (pick-wt=11): 3 [copy,2,flip.3] -l1_orders_2(A)| -v1_orders_2(A)|g1_orders_2(u1_struct_0(A),u1_orders_2(A))=A.
% 2.05/2.22 ** KEPT (pick-wt=6): 4 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 2.05/2.22 ** KEPT (pick-wt=8): 5 [] -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C)))|v1_relat_1(A).
% 2.05/2.22 ** KEPT (pick-wt=20): 6 [] -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)).
% 2.05/2.22 ** KEPT (pick-wt=20): 7 [] -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)).
% 2.05/2.22 ** KEPT (pick-wt=8): 8 [] -m1_relset_1(A,B,B)|v1_orders_2(g1_orders_2(B,A)).
% 2.05/2.22 ** KEPT (pick-wt=8): 9 [] -m1_relset_1(A,B,B)|l1_orders_2(g1_orders_2(B,A)).
% 2.05/2.22 ** KEPT (pick-wt=8): 10 [] -l1_orders_2(A)| -l1_orders_2(B)|v1_orders_2(k1_latsum_1(A,B)).
% 2.05/2.22 ** KEPT (pick-wt=8): 11 [] -l1_orders_2(A)| -l1_orders_2(B)|l1_orders_2(k1_latsum_1(A,B)).
% 2.05/2.22 ** KEPT (pick-wt=4): 12 [] -l1_orders_2(A)|l1_struct_0(A).
% 2.05/2.22 ** KEPT (pick-wt=10): 13 [] -m2_relset_1(A,B,C)|m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))).
% 2.05/2.22 ** KEPT (pick-wt=9): 14 [] -l1_orders_2(A)|m2_relset_1(u1_orders_2(A),u1_struct_0(A),u1_struct_0(A)).
% 2.05/2.22 ** KEPT (pick-wt=14): 15 [] -m1_relset_1(A,B,B)|g1_orders_2(B,A)!=g1_orders_2(C,D)|B=C.
% 2.05/2.22 ** KEPT (pick-wt=14): 16 [] -m1_relset_1(A,B,B)|g1_orders_2(B,A)!=g1_orders_2(C,D)|A=D.
% 2.29/2.52 ** KEPT (pick-wt=2): 17 [] -v1_xboole_0($c8).
% 2.29/2.52 ** KEPT (pick-wt=8): 18 [] -m2_relset_1(A,B,C)|m1_relset_1(A,B,C).
% 2.29/2.52 ** KEPT (pick-wt=8): 19 [] m2_relset_1(A,B,C)| -m1_relset_1(A,B,C).
% 2.29/2.52 ** KEPT (pick-wt=6): 20 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 2.29/2.52 ** KEPT (pick-wt=36): 21 [] -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)).
% 2.29/2.52 ** KEPT (pick-wt=8): 22 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 2.29/2.52 ** KEPT (pick-wt=7): 23 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 2.29/2.52 ** KEPT (pick-wt=7): 24 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 2.29/2.52 ** KEPT (pick-wt=10): 25 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 2.29/2.52 ** KEPT (pick-wt=9): 26 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 2.29/2.52 ** KEPT (pick-wt=5): 27 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 2.29/2.52 ** KEPT (pick-wt=5): 28 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 2.29/2.52 ** KEPT (pick-wt=7): 29 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 2.29/2.52
% 2.29/2.52 ------------> process sos:
% 2.29/2.52 ** KEPT (pick-wt=3): 37 [] A=A.
% 2.29/2.52 ** KEPT (pick-wt=2): 38 [] l1_orders_2($c4).
% 2.29/2.52 ** KEPT (pick-wt=2): 39 [] l1_orders_2($c3).
% 2.29/2.52 ** KEPT (pick-wt=6): 40 [] m1_subset_1($c2,u1_struct_0(k1_latsum_1($c4,$c3))).
% 2.29/2.52 ** KEPT (pick-wt=6): 41 [] m1_subset_1($c1,u1_struct_0(k1_latsum_1($c4,$c3))).
% 2.29/2.52 ** KEPT (pick-wt=7): 42 [] v12_waybel_0(k3_xboole_0(u1_struct_0($c4),u1_struct_0($c3)),$c3).
% 2.29/2.52 ** KEPT (pick-wt=9): 43 [] m1_subset_1(k3_xboole_0(u1_struct_0($c4),u1_struct_0($c3)),k1_zfmisc_1(u1_struct_0($c3))).
% 2.29/2.52 ** KEPT (pick-wt=6): 44 [] r1_orders_2(k1_latsum_1($c4,$c3),$c2,$c1).
% 2.29/2.52 ** KEPT (pick-wt=4): 45 [] r2_hidden($c1,u1_struct_0($c4)).
% 2.29/2.52 ** KEPT (pick-wt=7): 46 [] k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 2.29/2.52 ** KEPT (pick-wt=2): 47 [] l1_orders_2($c5).
% 2.29/2.52 ** KEPT (pick-wt=2): 48 [] l1_struct_0($c6).
% 2.29/2.52 ** KEPT (pick-wt=6): 49 [] m1_relset_1($f1(A,B),A,B).
% 2.29/2.52 ** KEPT (pick-wt=4): 50 [] m1_subset_1($f2(A),A).
% 2.29/2.52 ** KEPT (pick-wt=6): 51 [] m2_relset_1($f3(A,B),A,B).
% 2.29/2.52 ** KEPT (pick-wt=2): 52 [] v1_xboole_0(k1_xboole_0).
% 2.29/2.52 ** KEPT (pick-wt=5): 53 [] k3_xboole_0(A,A)=A.
% 2.29/2.52 ---> New Demodulator: 54 [new_demod,53] k3_xboole_0(A,A)=A.
% 2.29/2.52 ** KEPT (pick-wt=2): 55 [] v1_xboole_0($c7).
% 2.29/2.52 ** KEPT (pick-wt=3): 56 [] r1_tarski(A,A).
% 2.29/2.52 ** KEPT (pick-wt=5): 57 [] k3_xboole_0(A,k1_xboole_0)=k1_xboole_0.
% 2.29/2.52 ---> New Demodulator: 58 [new_demod,57] k3_xboole_0(A,k1_xboole_0)=k1_xboole_0.
% 2.29/2.52 Following clause subsumed by 37 during input processing: 0 [copy,37,flip.1] A=A.
% 2.29/2.52 37 back subsumes 36.
% 2.29/2.52 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 2.29/2.52 >>>> Starting back demodulation with 54.
% 2.29/2.52 >> back demodulating 35 with 54.
% 2.29/2.52 >>>> Starting back demodulation with 58.
% 2.29/2.52
% 2.29/2.52 ======= end of input processing =======
% 2.29/2.52
% 2.29/2.52 =========== start of search ===========
% 2.29/2.52
% 2.29/2.52
% 2.29/2.52 Resetting weight limit to 6.
% 2.29/2.52
% 2.29/2.52
% 2.29/2.52 Resetting weight limit to 6.
% 2.29/2.52
% 2.29/2.52 sos_size=2172
% 2.29/2.52
% 2.29/2.52 -------- PROOF --------
% 2.29/2.52
% 2.29/2.52 ----> UNIT CONFLICT at 0.30 sec ----> 2417 [binary,2416.1,1.1] $F.
% 2.29/2.52
% 2.29/2.52 Length of proof is 3. Level of proof is 3.
% 2.29/2.52
% 2.29/2.52 ---------------- PROOF ----------------
% 2.29/2.52 % SZS status Theorem
% 2.29/2.52 % SZS output start Refutation
% See solution above
% 2.29/2.52 ------------ end of proof -------------
% 2.29/2.52
% 2.29/2.52
% 2.29/2.52 Search stopped by max_proofs option.
% 2.29/2.52
% 2.29/2.52
% 2.29/2.52 Search stopped by max_proofs option.
% 2.29/2.52
% 2.29/2.52 ============ end of search ============
% 2.29/2.52
% 2.29/2.52 -------------- statistics -------------
% 2.29/2.52 clauses given 533
% 2.29/2.52 clauses generated 30755
% 2.29/2.52 clauses kept 2394
% 2.29/2.52 clauses forward subsumed 1092
% 2.29/2.52 clauses back subsumed 4
% 2.29/2.52 Kbytes malloced 4882
% 2.29/2.52
% 2.29/2.52 ----------- times (seconds) -----------
% 2.29/2.52 user CPU time 0.30 (0 hr, 0 min, 0 sec)
% 2.29/2.52 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.29/2.52 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.29/2.52
% 2.29/2.52 That finishes the proof of the theorem.
% 2.29/2.52
% 2.29/2.52 Process 8302 finished Wed Jul 27 08:01:44 2022
% 2.29/2.52 Otter interrupted
% 2.29/2.52 PROOF FOUND
%------------------------------------------------------------------------------