TSTP Solution File: SEU424+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU424+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:12 EDT 2022
% Result : Theorem 1.92s 2.12s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 5
% Syntax : Number of clauses : 6 ( 5 unt; 1 nHn; 6 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ v1_xboole_0(dollar_c4),
file('SEU424+1.p',unknown),
[] ).
cnf(2,axiom,
~ m1_subset_1(a_4_0_relset_2(dollar_c4,dollar_c3,dollar_c2,dollar_c1),k1_zfmisc_1(k1_zfmisc_1(dollar_c3))),
file('SEU424+1.p',unknown),
[] ).
cnf(23,axiom,
( v1_xboole_0(A)
| ~ m1_subset_1(B,k1_zfmisc_1(A))
| ~ m2_relset_1(C,A,D)
| m1_subset_1(a_4_0_relset_2(A,D,B,C),k1_zfmisc_1(k1_zfmisc_1(D))) ),
file('SEU424+1.p',unknown),
[] ).
cnf(39,axiom,
m1_subset_1(dollar_c2,k1_zfmisc_1(dollar_c4)),
file('SEU424+1.p',unknown),
[] ).
cnf(40,axiom,
m2_relset_1(dollar_c1,dollar_c4,dollar_c3),
file('SEU424+1.p',unknown),
[] ).
cnf(78,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[40,23,39]),1,2]),
[iquote('hyper,40,23,39,unit_del,1,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU424+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n004.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 08:00:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox2 on n004.cluster.edu,
% 1.92/2.11 Wed Jul 27 08:00:36 2022
% 1.92/2.11 The command was "./otter". The process ID is 5516.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 formula_list(usable).
% 1.92/2.11 all A (A=A).
% 1.92/2.11 -(all A (-v1_xboole_0(A)-> (all B C (m1_subset_1(C,k1_zfmisc_1(A))-> (all D (m2_relset_1(D,A,B)->m1_subset_1(a_4_0_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))))))))).
% 1.92/2.11 all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 1.92/2.11 all A (v1_xboole_0(A)->v1_relat_1(A)).
% 1.92/2.11 all A B C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))->v1_relat_1(C)).
% 1.92/2.11 all A B C (m2_relset_1(C,A,B)-> (all D (m1_subset_1(D,A)->k2_relset_2(A,B,C,D)=k10_relset_1(A,B,C,k1_tarski(D))))).
% 1.92/2.11 all A B C D (m1_relset_1(C,A,B)->m1_subset_1(k10_relset_1(A,B,C,D),k1_zfmisc_1(B))).
% 1.92/2.11 $T.
% 1.92/2.11 $T.
% 1.92/2.11 $T.
% 1.92/2.11 all A B C D (m1_relset_1(C,A,B)&m1_subset_1(D,A)->m1_subset_1(k2_relset_2(A,B,C,D),k1_zfmisc_1(B))).
% 1.92/2.11 $T.
% 1.92/2.11 $T.
% 1.92/2.11 $T.
% 1.92/2.11 $T.
% 1.92/2.11 all A B C (m2_relset_1(C,A,B)->m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))).
% 1.92/2.11 all A B exists C m1_relset_1(C,A,B).
% 1.92/2.11 all A exists B m1_subset_1(B,A).
% 1.92/2.11 all A B exists C m2_relset_1(C,A,B).
% 1.92/2.11 v1_xboole_0(k1_xboole_0).
% 1.92/2.11 v1_relat_1(k1_xboole_0).
% 1.92/2.11 v3_relat_1(k1_xboole_0).
% 1.92/2.11 all A (-v1_xboole_0(k1_zfmisc_1(A))).
% 1.92/2.11 all A B v1_relat_1(k2_zfmisc_1(A,B)).
% 1.92/2.11 all A (-v1_xboole_0(k1_tarski(A))).
% 1.92/2.11 v1_xboole_0(k1_xboole_0).
% 1.92/2.11 v1_relat_1(k1_xboole_0).
% 1.92/2.11 all A B (-v1_xboole_0(A)& -v1_xboole_0(B)-> -v1_xboole_0(k2_zfmisc_1(A,B))).
% 1.92/2.11 all A B C D E (-v1_xboole_0(B)&m1_subset_1(D,k1_zfmisc_1(B))&m2_relset_1(E,B,C)-> (r2_hidden(A,a_4_0_relset_2(B,C,D,E))<-> (exists F (m1_subset_1(F,B)&A=k2_relset_2(B,C,E,F)&r2_hidden(F,D))))).
% 1.92/2.11 exists A (v1_xboole_0(A)&v1_relat_1(A)).
% 1.92/2.11 all A (-v1_xboole_0(A)-> (exists B (m1_subset_1(B,k1_zfmisc_1(A))& -v1_xboole_0(B)))).
% 1.92/2.11 exists A (-v1_xboole_0(A)&v1_relat_1(A)).
% 1.92/2.11 all A exists B (m1_subset_1(B,k1_zfmisc_1(A))&v1_xboole_0(B)).
% 1.92/2.11 exists A (v1_relat_1(A)&v3_relat_1(A)).
% 1.92/2.11 all A B C D (m1_relset_1(C,A,B)->k10_relset_1(A,B,C,D)=k9_relat_1(C,D)).
% 1.92/2.11 all A B C (m2_relset_1(C,A,B)<->m1_relset_1(C,A,B)).
% 1.92/2.11 all A B r1_tarski(A,A).
% 1.92/2.11 all A B C D (-v1_xboole_0(A)&m1_subset_1(C,k1_zfmisc_1(A))&m2_relset_1(D,A,B)->m1_subset_1(a_4_0_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B)))).
% 1.92/2.11 all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 1.92/2.11 all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 1.92/2.11 all A B ((all C (r2_hidden(C,A)<->r2_hidden(C,B)))->A=B).
% 1.92/2.11 all A B (m1_subset_1(A,k1_zfmisc_1(B))<->r1_tarski(A,B)).
% 1.92/2.11 all A B C (r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))->m1_subset_1(A,C)).
% 1.92/2.11 all A B C (-(r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))&v1_xboole_0(C))).
% 1.92/2.11 all A (v1_xboole_0(A)->A=k1_xboole_0).
% 1.92/2.11 all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 1.92/2.11 all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 -------> usable clausifies to:
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] A=A.
% 1.92/2.11 0 [] -v1_xboole_0($c4).
% 1.92/2.11 0 [] m1_subset_1($c2,k1_zfmisc_1($c4)).
% 1.92/2.11 0 [] m2_relset_1($c1,$c4,$c3).
% 1.92/2.11 0 [] -m1_subset_1(a_4_0_relset_2($c4,$c3,$c2,$c1),k1_zfmisc_1(k1_zfmisc_1($c3))).
% 1.92/2.11 0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.92/2.11 0 [] -v1_xboole_0(A)|v1_relat_1(A).
% 1.92/2.11 0 [] -m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B)))|v1_relat_1(C).
% 1.92/2.11 0 [] -m2_relset_1(C,A,B)| -m1_subset_1(D,A)|k2_relset_2(A,B,C,D)=k10_relset_1(A,B,C,k1_tarski(D)).
% 1.92/2.11 0 [] -m1_relset_1(C,A,B)|m1_subset_1(k10_relset_1(A,B,C,D),k1_zfmisc_1(B)).
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] -m1_relset_1(C,A,B)| -m1_subset_1(D,A)|m1_subset_1(k2_relset_2(A,B,C,D),k1_zfmisc_1(B)).
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] $T.
% 1.92/2.11 0 [] -m2_relset_1(C,A,B)|m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))).
% 1.92/2.11 0 [] m1_relset_1($f1(A,B),A,B).
% 1.92/2.11 0 [] m1_subset_1($f2(A),A).
% 1.92/2.11 0 [] m2_relset_1($f3(A,B),A,B).
% 1.92/2.11 0 [] v1_xboole_0(k1_xboole_0).
% 1.92/2.11 0 [] v1_relat_1(k1_xboole_0).
% 1.92/2.11 0 [] v3_relat_1(k1_xboole_0).
% 1.92/2.11 0 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.92/2.11 0 [] v1_relat_1(k2_zfmisc_1(A,B)).
% 1.92/2.11 0 [] -v1_xboole_0(k1_tarski(A)).
% 1.92/2.11 0 [] v1_xboole_0(k1_xboole_0).
% 1.92/2.11 0 [] v1_relat_1(k1_xboole_0).
% 1.92/2.11 0 [] v1_xboole_0(A)|v1_xboole_0(B)| -v1_xboole_0(k2_zfmisc_1(A,B)).
% 1.92/2.11 0 [] v1_xboole_0(B)| -m1_subset_1(D,k1_zfmisc_1(B))| -m2_relset_1(E,B,C)| -r2_hidden(A,a_4_0_relset_2(B,C,D,E))|m1_subset_1($f4(A,B,C,D,E),B).
% 1.92/2.11 0 [] v1_xboole_0(B)| -m1_subset_1(D,k1_zfmisc_1(B))| -m2_relset_1(E,B,C)| -r2_hidden(A,a_4_0_relset_2(B,C,D,E))|A=k2_relset_2(B,C,E,$f4(A,B,C,D,E)).
% 1.92/2.11 0 [] v1_xboole_0(B)| -m1_subset_1(D,k1_zfmisc_1(B))| -m2_relset_1(E,B,C)| -r2_hidden(A,a_4_0_relset_2(B,C,D,E))|r2_hidden($f4(A,B,C,D,E),D).
% 1.92/2.11 0 [] v1_xboole_0(B)| -m1_subset_1(D,k1_zfmisc_1(B))| -m2_relset_1(E,B,C)|r2_hidden(A,a_4_0_relset_2(B,C,D,E))| -m1_subset_1(F,B)|A!=k2_relset_2(B,C,E,F)| -r2_hidden(F,D).
% 1.92/2.11 0 [] v1_xboole_0($c5).
% 1.92/2.11 0 [] v1_relat_1($c5).
% 1.92/2.11 0 [] v1_xboole_0(A)|m1_subset_1($f5(A),k1_zfmisc_1(A)).
% 1.92/2.11 0 [] v1_xboole_0(A)| -v1_xboole_0($f5(A)).
% 1.92/2.11 0 [] -v1_xboole_0($c6).
% 1.92/2.11 0 [] v1_relat_1($c6).
% 1.92/2.11 0 [] m1_subset_1($f6(A),k1_zfmisc_1(A)).
% 1.92/2.11 0 [] v1_xboole_0($f6(A)).
% 1.92/2.11 0 [] v1_relat_1($c7).
% 1.92/2.11 0 [] v3_relat_1($c7).
% 1.92/2.11 0 [] -m1_relset_1(C,A,B)|k10_relset_1(A,B,C,D)=k9_relat_1(C,D).
% 1.92/2.11 0 [] -m2_relset_1(C,A,B)|m1_relset_1(C,A,B).
% 1.92/2.11 0 [] m2_relset_1(C,A,B)| -m1_relset_1(C,A,B).
% 1.92/2.11 0 [] r1_tarski(A,A).
% 1.92/2.11 0 [] v1_xboole_0(A)| -m1_subset_1(C,k1_zfmisc_1(A))| -m2_relset_1(D,A,B)|m1_subset_1(a_4_0_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))).
% 1.92/2.11 0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.92/2.11 0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.92/2.11 0 [] r2_hidden($f7(A,B),A)|r2_hidden($f7(A,B),B)|A=B.
% 1.92/2.11 0 [] -r2_hidden($f7(A,B),A)| -r2_hidden($f7(A,B),B)|A=B.
% 1.92/2.11 0 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.92/2.11 0 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.92/2.11 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.92/2.11 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.92/2.11 0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.92/2.11 0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.92/2.11 0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.92/2.11
% 1.92/2.11 This ia a non-Horn set with equality. The strategy will be
% 1.92/2.11 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.92/2.11 deletion, with positive clauses in sos and nonpositive
% 1.92/2.11 clauses in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(knuth_bendix).
% 1.92/2.11 dependent: set(anl_eq).
% 1.92/2.11 dependent: set(para_from).
% 1.92/2.11 dependent: set(para_into).
% 1.92/2.11 dependent: clear(para_from_right).
% 1.92/2.11 dependent: clear(para_into_right).
% 1.92/2.11 dependent: set(para_from_vars).
% 1.92/2.11 dependent: set(eq_units_both_ways).
% 1.92/2.11 dependent: set(dynamic_demod_all).
% 1.92/2.11 dependent: set(dynamic_demod).
% 1.92/2.11 dependent: set(order_eq).
% 1.92/2.11 dependent: set(back_demod).
% 1.92/2.11 dependent: set(lrpo).
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: set(unit_deletion).
% 1.92/2.11 dependent: set(factor).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=2): 1 [] -v1_xboole_0($c4).
% 1.92/2.11 ** KEPT (pick-wt=9): 2 [] -m1_subset_1(a_4_0_relset_2($c4,$c3,$c2,$c1),k1_zfmisc_1(k1_zfmisc_1($c3))).
% 1.92/2.11 ** KEPT (pick-wt=6): 3 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.92/2.11 ** KEPT (pick-wt=4): 4 [] -v1_xboole_0(A)|v1_relat_1(A).
% 1.92/2.11 ** KEPT (pick-wt=8): 5 [] -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C)))|v1_relat_1(A).
% 1.92/2.11 ** KEPT (pick-wt=19): 6 [] -m2_relset_1(A,B,C)| -m1_subset_1(D,B)|k2_relset_2(B,C,A,D)=k10_relset_1(B,C,A,k1_tarski(D)).
% 1.92/2.11 ** KEPT (pick-wt=12): 7 [] -m1_relset_1(A,B,C)|m1_subset_1(k10_relset_1(B,C,A,D),k1_zfmisc_1(C)).
% 1.92/2.11 ** KEPT (pick-wt=15): 8 [] -m1_relset_1(A,B,C)| -m1_subset_1(D,B)|m1_subset_1(k2_relset_2(B,C,A,D),k1_zfmisc_1(C)).
% 1.92/2.11 ** KEPT (pick-wt=10): 9 [] -m2_relset_1(A,B,C)|m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))).
% 1.92/2.11 ** KEPT (pick-wt=3): 10 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.92/2.11 ** KEPT (pick-wt=3): 11 [] -v1_xboole_0(k1_tarski(A)).
% 1.92/2.11 ** KEPT (pick-wt=8): 12 [] v1_xboole_0(A)|v1_xboole_0(B)| -v1_xboole_0(k2_zfmisc_1(A,B)).
% 1.92/2.11 ** KEPT (pick-wt=25): 13 [] v1_xboole_0(A)| -m1_subset_1(B,k1_zfmisc_1(A))| -m2_relset_1(C,A,D)| -r2_hidden(E,a_4_0_relset_2(A,D,B,C))|m1_subset_1($f4(E,A,D,B,C),A).
% 1.92/2.11 ** KEPT (pick-wt=29): 15 [copy,14,flip.5] v1_xboole_0(A)| -m1_subset_1(B,k1_zfmisc_1(A))| -m2_relset_1(C,A,D)| -r2_hidden(E,a_4_0_relset_2(A,D,B,C))|k2_relset_2(A,D,C,$f4(E,A,D,B,C))=E.
% 1.92/2.12 ** KEPT (pick-wt=25): 16 [] v1_xboole_0(A)| -m1_subset_1(B,k1_zfmisc_1(A))| -m2_relset_1(C,A,D)| -r2_hidden(E,a_4_0_relset_2(A,D,B,C))|r2_hidden($f4(E,A,D,B,C),B).
% 1.92/2.12 ** KEPT (pick-wt=30): 17 [] v1_xboole_0(A)| -m1_subset_1(B,k1_zfmisc_1(A))| -m2_relset_1(C,A,D)|r2_hidden(E,a_4_0_relset_2(A,D,B,C))| -m1_subset_1(F,A)|E!=k2_relset_2(A,D,C,F)| -r2_hidden(F,B).
% 1.92/2.12 ** KEPT (pick-wt=5): 18 [] v1_xboole_0(A)| -v1_xboole_0($f5(A)).
% 1.92/2.12 ** KEPT (pick-wt=2): 19 [] -v1_xboole_0($c6).
% 1.92/2.12 ** KEPT (pick-wt=13): 20 [] -m1_relset_1(A,B,C)|k10_relset_1(B,C,A,D)=k9_relat_1(A,D).
% 1.92/2.12 ** KEPT (pick-wt=8): 21 [] -m2_relset_1(A,B,C)|m1_relset_1(A,B,C).
% 1.92/2.12 ** KEPT (pick-wt=8): 22 [] m2_relset_1(A,B,C)| -m1_relset_1(A,B,C).
% 1.92/2.12 ** KEPT (pick-wt=19): 23 [] v1_xboole_0(A)| -m1_subset_1(B,k1_zfmisc_1(A))| -m2_relset_1(C,A,D)|m1_subset_1(a_4_0_relset_2(A,D,B,C),k1_zfmisc_1(k1_zfmisc_1(D))).
% 1.92/2.12 ** KEPT (pick-wt=6): 24 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.92/2.12 ** KEPT (pick-wt=8): 25 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.92/2.12 ** KEPT (pick-wt=13): 26 [] -r2_hidden($f7(A,B),A)| -r2_hidden($f7(A,B),B)|A=B.
% 1.92/2.12 ** KEPT (pick-wt=7): 27 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.92/2.12 ** KEPT (pick-wt=7): 28 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.92/2.12 ** KEPT (pick-wt=10): 29 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.92/2.12 ** KEPT (pick-wt=9): 30 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.92/2.12 ** KEPT (pick-wt=5): 31 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.92/2.12 ** KEPT (pick-wt=5): 32 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.92/2.12 ** KEPT (pick-wt=7): 33 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.92/2.12
% 1.92/2.12 ------------> process sos:
% 1.92/2.12 ** KEPT (pick-wt=3): 38 [] A=A.
% 1.92/2.12 ** KEPT (pick-wt=4): 39 [] m1_subset_1($c2,k1_zfmisc_1($c4)).
% 1.92/2.12 ** KEPT (pick-wt=4): 40 [] m2_relset_1($c1,$c4,$c3).
% 1.92/2.12 ** KEPT (pick-wt=6): 41 [] m1_relset_1($f1(A,B),A,B).
% 1.92/2.12 ** KEPT (pick-wt=4): 42 [] m1_subset_1($f2(A),A).
% 1.92/2.12 ** KEPT (pick-wt=6): 43 [] m2_relset_1($f3(A,B),A,B).
% 1.92/2.12 ** KEPT (pick-wt=2): 44 [] v1_xboole_0(k1_xboole_0).
% 1.92/2.12 ** KEPT (pick-wt=2): 45 [] v1_relat_1(k1_xboole_0).
% 1.92/2.12 ** KEPT (pick-wt=2): 46 [] v3_relat_1(k1_xboole_0).
% 1.92/2.12 ** KEPT (pick-wt=4): 47 [] v1_relat_1(k2_zfmisc_1(A,B)).
% 1.92/2.12 Following clause subsumed by 44 during input processing: 0 [] v1_xboole_0(k1_xboole_0).
% 1.92/2.12 Following clause subsumed by 45 during input processing: 0 [] v1_relat_1(k1_xboole_0).
% 1.92/2.12 ** KEPT (pick-wt=2): 48 [] v1_xboole_0($c5).
% 1.92/2.12 ** KEPT (pick-wt=2): 49 [] v1_relat_1($c5).
% 1.92/2.12 ** KEPT (pick-wt=7): 50 [] v1_xboole_0(A)|m1_subset_1($f5(A),k1_zfmisc_1(A)).
% 1.92/2.12 ** KEPT (pick-wt=2): 51 [] v1_relat_1($c6).
% 1.92/2.12 ** KEPT (pick-wt=5): 52 [] m1_subset_1($f6(A),k1_zfmisc_1(A)).
% 1.92/2.12 ** KEPT (pick-wt=3): 53 [] v1_xboole_0($f6(A)).
% 1.92/2.12 ** KEPT (pick-wt=2): 54 [] v1_relat_1($c7).
% 1.92/2.12 ** KEPT (pick-wt=2): 55 [] v3_relat_1($c7).
% 1.92/2.12 ** KEPT (pick-wt=3): 56 [] r1_tarski(A,A).
% 1.92/2.12 ** KEPT (pick-wt=13): 57 [] r2_hidden($f7(A,B),A)|r2_hidden($f7(A,B),B)|A=B.
% 1.92/2.12 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] A=A.
% 1.92/2.12 38 back subsumes 37.
% 1.92/2.12 38 back subsumes 36.
% 1.92/2.12
% 1.92/2.12 ======= end of input processing =======
% 1.92/2.12
% 1.92/2.12 =========== start of search ===========
% 1.92/2.12
% 1.92/2.12 -------- PROOF --------
% 1.92/2.12
% 1.92/2.12 -----> EMPTY CLAUSE at 0.01 sec ----> 78 [hyper,40,23,39,unit_del,1,2] $F.
% 1.92/2.12
% 1.92/2.12 Length of proof is 0. Level of proof is 0.
% 1.92/2.12
% 1.92/2.12 ---------------- PROOF ----------------
% 1.92/2.12 % SZS status Theorem
% 1.92/2.12 % SZS output start Refutation
% See solution above
% 1.92/2.12 ------------ end of proof -------------
% 1.92/2.12
% 1.92/2.12
% 1.92/2.12 Search stopped by max_proofs option.
% 1.92/2.12
% 1.92/2.12
% 1.92/2.12 Search stopped by max_proofs option.
% 1.92/2.12
% 1.92/2.12 ============ end of search ============
% 1.92/2.12
% 1.92/2.12 -------------- statistics -------------
% 1.92/2.12 clauses given 11
% 1.92/2.12 clauses generated 56
% 1.92/2.12 clauses kept 75
% 1.92/2.12 clauses forward subsumed 40
% 1.92/2.12 clauses back subsumed 2
% 1.92/2.12 Kbytes malloced 1953
% 1.92/2.12
% 1.92/2.12 ----------- times (seconds) -----------
% 1.92/2.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.92/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.12
% 1.92/2.12 That finishes the proof of the theorem.
% 1.92/2.12
% 1.92/2.12 Process 5516 finished Wed Jul 27 08:00:38 2022
% 1.92/2.12 Otter interrupted
% 1.92/2.12 PROOF FOUND
%------------------------------------------------------------------------------