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