TSTP Solution File: SEU420+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU420+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 : Unknown 31.19s 31.38s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU420+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n004.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 07:47:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.91/2.11 ----- Otter 3.3f, August 2004 -----
% 1.91/2.11 The process was started by sandbox on n004.cluster.edu,
% 1.91/2.11 Wed Jul 27 07:47:36 2022
% 1.91/2.11 The command was "./otter". The process ID is 6445.
% 1.91/2.11
% 1.91/2.11 set(prolog_style_variables).
% 1.91/2.11 set(auto).
% 1.91/2.11 dependent: set(auto1).
% 1.91/2.11 dependent: set(process_input).
% 1.91/2.11 dependent: clear(print_kept).
% 1.91/2.11 dependent: clear(print_new_demod).
% 1.91/2.11 dependent: clear(print_back_demod).
% 1.91/2.11 dependent: clear(print_back_sub).
% 1.91/2.11 dependent: set(control_memory).
% 1.91/2.11 dependent: assign(max_mem, 12000).
% 1.91/2.11 dependent: assign(pick_given_ratio, 4).
% 1.91/2.11 dependent: assign(stats_level, 1).
% 1.91/2.11 dependent: assign(max_seconds, 10800).
% 1.91/2.11 clear(print_given).
% 1.91/2.11
% 1.91/2.11 formula_list(usable).
% 1.91/2.11 all A (A=A).
% 1.91/2.11 -(all A B (v1_relat_1(B)-> (all C (v1_relat_1(C)->r1_tarski(k9_relat_1(k3_xboole_0(B,C),k3_pua2mss1(A)),k3_xboole_0(k9_relat_1(B,k3_pua2mss1(A)),k9_relat_1(C,k3_pua2mss1(A)))))))).
% 1.91/2.11 all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 1.91/2.11 all A (v1_xboole_0(A)->v1_relat_1(A)).
% 1.91/2.11 all A B (k2_tarski(A,B)=k2_tarski(B,A)).
% 1.91/2.11 all A B (k3_xboole_0(A,B)=k3_xboole_0(B,A)).
% 1.91/2.11 all A (v1_relat_1(A)-> (all B C (C=k9_relat_1(A,B)<-> (all D (r2_hidden(D,C)<-> (exists E (r2_hidden(k4_tarski(E,D),A)&r2_hidden(E,B)))))))).
% 1.91/2.11 all A B (r1_tarski(A,B)<-> (all C (r2_hidden(C,A)->r2_hidden(C,B)))).
% 1.91/2.11 all A B C (C=k3_xboole_0(A,B)<-> (all D (r2_hidden(D,C)<->r2_hidden(D,A)&r2_hidden(D,B)))).
% 1.91/2.11 all A B (k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A))).
% 1.91/2.11 $T.
% 1.91/2.11 $T.
% 1.91/2.11 $T.
% 1.91/2.11 $T.
% 1.91/2.11 all A m1_e_qrel_1(k3_pua2mss1(A),A).
% 1.91/2.11 $T.
% 1.91/2.11 $T.
% 1.91/2.11 $T.
% 1.91/2.11 all A B (m1_e_qrel_1(B,A)->m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))).
% 1.91/2.11 $T.
% 1.91/2.11 all A exists B m1_e_qrel_1(B,A).
% 1.91/2.11 all A exists B m1_subset_1(B,A).
% 1.91/2.11 v1_xboole_0(k1_xboole_0).
% 1.91/2.11 v1_relat_1(k1_xboole_0).
% 1.91/2.11 v3_relat_1(k1_xboole_0).
% 1.91/2.11 all A B (v1_relat_1(A)&v1_relat_1(B)->v1_relat_1(k3_xboole_0(A,B))).
% 1.91/2.11 all A (-v1_xboole_0(k1_zfmisc_1(A))).
% 1.91/2.11 all A (-v1_xboole_0(k1_tarski(A))).
% 1.91/2.11 all A B (-v1_xboole_0(k2_tarski(A,B))).
% 1.91/2.11 v1_xboole_0(k1_xboole_0).
% 1.91/2.11 v1_relat_1(k1_xboole_0).
% 1.91/2.11 all A B (k3_xboole_0(A,A)=A).
% 1.91/2.11 exists A (v1_xboole_0(A)&v1_relat_1(A)).
% 1.91/2.11 all A (-v1_xboole_0(A)-> (exists B (m1_subset_1(B,k1_zfmisc_1(A))& -v1_xboole_0(B)))).
% 1.91/2.11 exists A (-v1_xboole_0(A)&v1_relat_1(A)).
% 1.91/2.11 all A exists B (m1_subset_1(B,k1_zfmisc_1(A))&v1_xboole_0(B)).
% 1.91/2.11 exists A (v1_relat_1(A)&v3_relat_1(A)).
% 1.91/2.11 all A B r1_tarski(A,A).
% 1.91/2.11 all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 1.91/2.11 all A (k3_xboole_0(A,k1_xboole_0)=k1_xboole_0).
% 1.91/2.11 all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 1.91/2.11 all A B (m1_subset_1(A,k1_zfmisc_1(B))<->r1_tarski(A,B)).
% 1.91/2.11 all A B C (r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))->m1_subset_1(A,C)).
% 1.91/2.11 all A B C (-(r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))&v1_xboole_0(C))).
% 1.91/2.11 all A (v1_xboole_0(A)->A=k1_xboole_0).
% 1.91/2.11 all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 1.91/2.11 all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 1.91/2.11 end_of_list.
% 1.91/2.11
% 1.91/2.11 -------> usable clausifies to:
% 1.91/2.11
% 1.91/2.11 list(usable).
% 1.91/2.11 0 [] A=A.
% 1.91/2.11 0 [] v1_relat_1($c2).
% 1.91/2.11 0 [] v1_relat_1($c1).
% 1.91/2.11 0 [] -r1_tarski(k9_relat_1(k3_xboole_0($c2,$c1),k3_pua2mss1($c3)),k3_xboole_0(k9_relat_1($c2,k3_pua2mss1($c3)),k9_relat_1($c1,k3_pua2mss1($c3)))).
% 1.91/2.11 0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.91/2.11 0 [] -v1_xboole_0(A)|v1_relat_1(A).
% 1.91/2.11 0 [] k2_tarski(A,B)=k2_tarski(B,A).
% 1.91/2.11 0 [] k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 1.91/2.11 0 [] -v1_relat_1(A)|C!=k9_relat_1(A,B)| -r2_hidden(D,C)|r2_hidden(k4_tarski($f1(A,B,C,D),D),A).
% 1.91/2.11 0 [] -v1_relat_1(A)|C!=k9_relat_1(A,B)| -r2_hidden(D,C)|r2_hidden($f1(A,B,C,D),B).
% 1.91/2.11 0 [] -v1_relat_1(A)|C!=k9_relat_1(A,B)|r2_hidden(D,C)| -r2_hidden(k4_tarski(E,D),A)| -r2_hidden(E,B).
% 1.91/2.11 0 [] -v1_relat_1(A)|C=k9_relat_1(A,B)|r2_hidden($f3(A,B,C),C)|r2_hidden(k4_tarski($f2(A,B,C),$f3(A,B,C)),A).
% 1.91/2.11 0 [] -v1_relat_1(A)|C=k9_relat_1(A,B)|r2_hidden($f3(A,B,C),C)|r2_hidden($f2(A,B,C),B).
% 1.91/2.11 0 [] -v1_relat_1(A)|C=k9_relat_1(A,B)| -r2_hidden($f3(A,B,C),C)| -r2_hidden(k4_tarski(X1,$f3(A,B,C)),A)| -r2_hidden(X1,B).
% 1.91/2.11 0 [] -r1_tarski(A,B)| -r2_hidden(C,A)|r2_hidden(C,B).
% 1.91/2.11 0 [] r1_tarski(A,B)|r2_hidden($f4(A,B),A).
% 1.91/2.11 0 [] r1_tarski(A,B)| -r2_hidden($f4(A,B),B).
% 1.91/2.11 0 [] C!=k3_xboole_0(A,B)| -r2_hidden(D,C)|r2_hidden(D,A).
% 1.91/2.11 0 [] C!=k3_xboole_0(A,B)| -r2_hidden(D,C)|r2_hidden(D,B).
% 1.91/2.11 0 [] C!=k3_xboole_0(A,B)|r2_hidden(D,C)| -r2_hidden(D,A)| -r2_hidden(D,B).
% 1.91/2.11 0 [] C=k3_xboole_0(A,B)|r2_hidden($f5(A,B,C),C)|r2_hidden($f5(A,B,C),A).
% 1.91/2.11 0 [] C=k3_xboole_0(A,B)|r2_hidden($f5(A,B,C),C)|r2_hidden($f5(A,B,C),B).
% 1.91/2.11 0 [] C=k3_xboole_0(A,B)| -r2_hidden($f5(A,B,C),C)| -r2_hidden($f5(A,B,C),A)| -r2_hidden($f5(A,B,C),B).
% 1.91/2.11 0 [] k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A)).
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] m1_e_qrel_1(k3_pua2mss1(A),A).
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] -m1_e_qrel_1(B,A)|m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A))).
% 1.91/2.11 0 [] $T.
% 1.91/2.11 0 [] m1_e_qrel_1($f6(A),A).
% 1.91/2.11 0 [] m1_subset_1($f7(A),A).
% 1.91/2.11 0 [] v1_xboole_0(k1_xboole_0).
% 1.91/2.11 0 [] v1_relat_1(k1_xboole_0).
% 1.91/2.11 0 [] v3_relat_1(k1_xboole_0).
% 1.91/2.11 0 [] -v1_relat_1(A)| -v1_relat_1(B)|v1_relat_1(k3_xboole_0(A,B)).
% 1.91/2.11 0 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.91/2.11 0 [] -v1_xboole_0(k1_tarski(A)).
% 1.91/2.11 0 [] -v1_xboole_0(k2_tarski(A,B)).
% 1.91/2.11 0 [] v1_xboole_0(k1_xboole_0).
% 1.91/2.11 0 [] v1_relat_1(k1_xboole_0).
% 1.91/2.11 0 [] k3_xboole_0(A,A)=A.
% 1.91/2.11 0 [] v1_xboole_0($c4).
% 1.91/2.11 0 [] v1_relat_1($c4).
% 1.91/2.11 0 [] v1_xboole_0(A)|m1_subset_1($f8(A),k1_zfmisc_1(A)).
% 1.91/2.11 0 [] v1_xboole_0(A)| -v1_xboole_0($f8(A)).
% 1.91/2.11 0 [] -v1_xboole_0($c5).
% 1.91/2.11 0 [] v1_relat_1($c5).
% 1.91/2.11 0 [] m1_subset_1($f9(A),k1_zfmisc_1(A)).
% 1.91/2.11 0 [] v1_xboole_0($f9(A)).
% 1.91/2.11 0 [] v1_relat_1($c6).
% 1.91/2.11 0 [] v3_relat_1($c6).
% 1.91/2.11 0 [] r1_tarski(A,A).
% 1.91/2.11 0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.91/2.11 0 [] k3_xboole_0(A,k1_xboole_0)=k1_xboole_0.
% 1.91/2.11 0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.91/2.11 0 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.91/2.11 0 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.91/2.11 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.91/2.11 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.91/2.11 0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.91/2.11 0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.91/2.11 0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.91/2.11 end_of_list.
% 1.91/2.11
% 1.91/2.11 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.91/2.11
% 1.91/2.11 This ia a non-Horn set with equality. The strategy will be
% 1.91/2.11 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.91/2.11 deletion, with positive clauses in sos and nonpositive
% 1.91/2.11 clauses in usable.
% 1.91/2.11
% 1.91/2.11 dependent: set(knuth_bendix).
% 1.91/2.11 dependent: set(anl_eq).
% 1.91/2.11 dependent: set(para_from).
% 1.91/2.11 dependent: set(para_into).
% 1.91/2.11 dependent: clear(para_from_right).
% 1.91/2.11 dependent: clear(para_into_right).
% 1.91/2.11 dependent: set(para_from_vars).
% 1.91/2.11 dependent: set(eq_units_both_ways).
% 1.91/2.11 dependent: set(dynamic_demod_all).
% 1.91/2.11 dependent: set(dynamic_demod).
% 1.91/2.11 dependent: set(order_eq).
% 1.91/2.11 dependent: set(back_demod).
% 1.91/2.11 dependent: set(lrpo).
% 1.91/2.11 dependent: set(hyper_res).
% 1.91/2.11 dependent: set(unit_deletion).
% 1.91/2.11 dependent: set(factor).
% 1.91/2.11
% 1.91/2.11 ------------> process usable:
% 1.91/2.11 ** KEPT (pick-wt=16): 1 [] -r1_tarski(k9_relat_1(k3_xboole_0($c2,$c1),k3_pua2mss1($c3)),k3_xboole_0(k9_relat_1($c2,k3_pua2mss1($c3)),k9_relat_1($c1,k3_pua2mss1($c3)))).
% 1.91/2.11 ** KEPT (pick-wt=6): 2 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.91/2.11 ** KEPT (pick-wt=4): 3 [] -v1_xboole_0(A)|v1_relat_1(A).
% 1.91/2.11 ** KEPT (pick-wt=19): 4 [] -v1_relat_1(A)|B!=k9_relat_1(A,C)| -r2_hidden(D,B)|r2_hidden(k4_tarski($f1(A,C,B,D),D),A).
% 1.91/2.11 ** KEPT (pick-wt=17): 5 [] -v1_relat_1(A)|B!=k9_relat_1(A,C)| -r2_hidden(D,B)|r2_hidden($f1(A,C,B,D),C).
% 1.91/2.11 ** KEPT (pick-wt=18): 6 [] -v1_relat_1(A)|B!=k9_relat_1(A,C)|r2_hidden(D,B)| -r2_hidden(k4_tarski(E,D),A)| -r2_hidden(E,C).
% 1.91/2.11 ** KEPT (pick-wt=24): 7 [] -v1_relat_1(A)|B=k9_relat_1(A,C)|r2_hidden($f3(A,C,B),B)|r2_hidden(k4_tarski($f2(A,C,B),$f3(A,C,B)),A).
% 1.91/2.11 ** KEPT (pick-wt=19): 8 [] -v1_relat_1(A)|B=k9_relat_1(A,C)|r2_hidden($f3(A,C,B),B)|r2_hidden($f2(A,C,B),C).
% 1.91/2.11 ** KEPT (pick-wt=24): 9 [] -v1_relat_1(A)|B=k9_relat_1(A,C)| -r2_hidden($f3(A,C,B),B)| -r2_hidden(k4_tarski(D,$f3(A,C,B)),A)| -r2_hidden(D,C).
% 1.91/2.11 ** KEPT (pick-wt=9): 10 [] -r1_tarski(A,B)| -r2_hidden(C,A)|r2_hidden(C,B).
% 1.91/2.11 ** KEPT (pick-wt=8): 11 [] r1_tarski(A,B)| -r2_hidden($f4(A,B),B).
% 1.91/2.11 ** KEPT (pick-wt=11): 12 [] A!=k3_xboole_0(B,C)| -r2_hidden(D,A)|r2_hidden(D,B).
% 1.91/2.11 ** KEPT (pick-wt=11): 13 [] A!=k3_xboole_0(B,C)| -r2_hidden(D,A)|r2_hidden(D,C).
% 1.91/2.11 ** KEPT (pick-wt=14): 14 [] A!=k3_xboole_0(B,C)|r2_hidden(D,A)| -r2_hidden(D,B)| -r2_hidden(D,C).
% 1.91/2.11 ** KEPT (pick-wt=23): 15 [] A=k3_xboole_0(B,C)| -r2_hidden($f5(B,C,A),A)| -r2_hidden($f5(B,C,A),B)| -r2_hidden($f5(B,C,A),C).
% 1.91/2.11 ** KEPT (pick-wt=8): 16 [] -m1_e_qrel_1(A,B)|m1_subset_1(A,k1_zfmisc_1(k1_zfmisc_1(B))).
% 31.19/31.38 ** KEPT (pick-wt=8): 17 [] -v1_relat_1(A)| -v1_relat_1(B)|v1_relat_1(k3_xboole_0(A,B)).
% 31.19/31.38 ** KEPT (pick-wt=3): 18 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 31.19/31.38 ** KEPT (pick-wt=3): 19 [] -v1_xboole_0(k1_tarski(A)).
% 31.19/31.38 ** KEPT (pick-wt=4): 20 [] -v1_xboole_0(k2_tarski(A,B)).
% 31.19/31.38 ** KEPT (pick-wt=5): 21 [] v1_xboole_0(A)| -v1_xboole_0($f8(A)).
% 31.19/31.38 ** KEPT (pick-wt=2): 22 [] -v1_xboole_0($c5).
% 31.19/31.38 ** KEPT (pick-wt=6): 23 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 31.19/31.38 ** KEPT (pick-wt=8): 24 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 31.19/31.38 ** KEPT (pick-wt=7): 25 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 31.19/31.38 ** KEPT (pick-wt=7): 26 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 31.19/31.38 ** KEPT (pick-wt=10): 27 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 31.19/31.38 ** KEPT (pick-wt=9): 28 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 31.19/31.38 ** KEPT (pick-wt=5): 29 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 31.19/31.38 ** KEPT (pick-wt=5): 30 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 31.19/31.38 ** KEPT (pick-wt=7): 31 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 31.19/31.38
% 31.19/31.38 ------------> process sos:
% 31.19/31.38 ** KEPT (pick-wt=3): 41 [] A=A.
% 31.19/31.38 ** KEPT (pick-wt=2): 42 [] v1_relat_1($c2).
% 31.19/31.38 ** KEPT (pick-wt=2): 43 [] v1_relat_1($c1).
% 31.19/31.38 ** KEPT (pick-wt=7): 44 [] k2_tarski(A,B)=k2_tarski(B,A).
% 31.19/31.38 ** KEPT (pick-wt=7): 45 [] k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 31.19/31.38 ** KEPT (pick-wt=8): 46 [] r1_tarski(A,B)|r2_hidden($f4(A,B),A).
% 31.19/31.38 ** KEPT (pick-wt=17): 47 [] A=k3_xboole_0(B,C)|r2_hidden($f5(B,C,A),A)|r2_hidden($f5(B,C,A),B).
% 31.19/31.38 ** KEPT (pick-wt=17): 48 [] A=k3_xboole_0(B,C)|r2_hidden($f5(B,C,A),A)|r2_hidden($f5(B,C,A),C).
% 31.19/31.38 ** KEPT (pick-wt=10): 49 [] k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A)).
% 31.19/31.38 ** KEPT (pick-wt=4): 50 [] m1_e_qrel_1(k3_pua2mss1(A),A).
% 31.19/31.38 ** KEPT (pick-wt=4): 51 [] m1_e_qrel_1($f6(A),A).
% 31.19/31.38 ** KEPT (pick-wt=4): 52 [] m1_subset_1($f7(A),A).
% 31.19/31.38 ** KEPT (pick-wt=2): 53 [] v1_xboole_0(k1_xboole_0).
% 31.19/31.38 ** KEPT (pick-wt=2): 54 [] v1_relat_1(k1_xboole_0).
% 31.19/31.38 ** KEPT (pick-wt=2): 55 [] v3_relat_1(k1_xboole_0).
% 31.19/31.38 Following clause subsumed by 53 during input processing: 0 [] v1_xboole_0(k1_xboole_0).
% 31.19/31.38 Following clause subsumed by 54 during input processing: 0 [] v1_relat_1(k1_xboole_0).
% 31.19/31.38 ** KEPT (pick-wt=5): 56 [] k3_xboole_0(A,A)=A.
% 31.19/31.38 ---> New Demodulator: 57 [new_demod,56] k3_xboole_0(A,A)=A.
% 31.19/31.38 ** KEPT (pick-wt=2): 58 [] v1_xboole_0($c4).
% 31.19/31.38 ** KEPT (pick-wt=2): 59 [] v1_relat_1($c4).
% 31.19/31.38 ** KEPT (pick-wt=7): 60 [] v1_xboole_0(A)|m1_subset_1($f8(A),k1_zfmisc_1(A)).
% 31.19/31.38 ** KEPT (pick-wt=2): 61 [] v1_relat_1($c5).
% 31.19/31.38 ** KEPT (pick-wt=5): 62 [] m1_subset_1($f9(A),k1_zfmisc_1(A)).
% 31.19/31.38 ** KEPT (pick-wt=3): 63 [] v1_xboole_0($f9(A)).
% 31.19/31.38 ** KEPT (pick-wt=2): 64 [] v1_relat_1($c6).
% 31.19/31.38 ** KEPT (pick-wt=2): 65 [] v3_relat_1($c6).
% 31.19/31.38 ** KEPT (pick-wt=3): 66 [] r1_tarski(A,A).
% 31.19/31.38 ** KEPT (pick-wt=5): 67 [] k3_xboole_0(A,k1_xboole_0)=k1_xboole_0.
% 31.19/31.38 ---> New Demodulator: 68 [new_demod,67] k3_xboole_0(A,k1_xboole_0)=k1_xboole_0.
% 31.19/31.38 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] A=A.
% 31.19/31.38 41 back subsumes 39.
% 31.19/31.38 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] k2_tarski(A,B)=k2_tarski(B,A).
% 31.19/31.38 Following clause subsumed by 45 during input processing: 0 [copy,45,flip.1] k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 31.19/31.38 ** KEPT (pick-wt=10): 71 [copy,49,flip.1] k2_tarski(k2_tarski(A,B),k1_tarski(A))=k4_tarski(A,B).
% 31.19/31.38 >>>> Starting back demodulation with 57.
% 31.19/31.38 >> back demodulating 40 with 57.
% 31.19/31.38 >> back demodulating 38 with 57.
% 31.19/31.38 >> back demodulating 37 with 57.
% 31.19/31.38 >> back demodulating 34 with 57.
% 31.19/31.38 >>>> Starting back demodulation with 68.
% 31.19/31.38 Following clause subsumed by 49 during input processing: 0 [copy,71,flip.1] k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A)).
% 31.19/31.38
% 31.19/31.38 ======= end of input processing =======
% 31.19/31.38
% 31.19/31.38 =========== start of search ===========
% 31.19/31.38
% 31.19/31.38
% 31.19/31.38 Resetting weight limit to 4.
% 31.19/31.38
% 31.19/31.38
% 31.19/31.38 Resetting weight limit to 4.
% 31.19/31.38
% 31.19/31.38 sos_size=369
% 31.19/31.38
% 31.19/31.38 Search stopped because sos empty.
% 31.19/31.38
% 31.19/31.38
% 31.19/31.38 Search stopped because sos empty.
% 31.19/31.38
% 31.19/31.38 ============ end of search ============
% 31.19/31.38
% 31.19/31.38 -------------- statistics -------------
% 31.19/31.38 clauses given 394
% 31.19/31.38 clauses generated 780994
% 31.19/31.38 clauses kept 462
% 31.19/31.38 clauses forward subsumed 706
% 31.19/31.38 clauses back subsumed 1
% 31.19/31.38 Kbytes malloced 7812
% 31.19/31.38
% 31.19/31.38 ----------- times (seconds) -----------
% 31.19/31.38 user CPU time 29.26 (0 hr, 0 min, 29 sec)
% 31.19/31.38 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 31.19/31.38 wall-clock time 31 (0 hr, 0 min, 31 sec)
% 31.19/31.38
% 31.19/31.38 Process 6445 finished Wed Jul 27 07:48:07 2022
% 31.19/31.38 Otter interrupted
% 31.19/31.38 PROOF NOT FOUND
%------------------------------------------------------------------------------