TSTP Solution File: SEU419+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU419+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:11 EDT 2022
% Result : Timeout 299.83s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU419+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.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:43:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.78/1.98 ----- Otter 3.3f, August 2004 -----
% 1.78/1.98 The process was started by sandbox2 on n010.cluster.edu,
% 1.78/1.98 Wed Jul 27 07:43:40 2022
% 1.78/1.98 The command was "./otter". The process ID is 23913.
% 1.78/1.98
% 1.78/1.98 set(prolog_style_variables).
% 1.78/1.98 set(auto).
% 1.78/1.98 dependent: set(auto1).
% 1.78/1.98 dependent: set(process_input).
% 1.78/1.98 dependent: clear(print_kept).
% 1.78/1.98 dependent: clear(print_new_demod).
% 1.78/1.98 dependent: clear(print_back_demod).
% 1.78/1.98 dependent: clear(print_back_sub).
% 1.78/1.98 dependent: set(control_memory).
% 1.78/1.98 dependent: assign(max_mem, 12000).
% 1.78/1.98 dependent: assign(pick_given_ratio, 4).
% 1.78/1.98 dependent: assign(stats_level, 1).
% 1.78/1.98 dependent: assign(max_seconds, 10800).
% 1.78/1.98 clear(print_given).
% 1.78/1.98
% 1.78/1.98 formula_list(usable).
% 1.78/1.98 all A (A=A).
% 1.78/1.98 -(all A B (v1_relat_1(B)-> (all C (v1_relat_1(C)->k9_relat_1(k4_xboole_0(B,C),k1_tarski(A))=k4_xboole_0(k9_relat_1(B,k1_tarski(A)),k9_relat_1(C,k1_tarski(A))))))).
% 1.78/1.98 all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 1.78/1.98 all A (v1_xboole_0(A)->v1_relat_1(A)).
% 1.78/1.98 all A B (k2_tarski(A,B)=k2_tarski(B,A)).
% 1.78/1.98 all A B (A=B<->r1_tarski(A,B)&r1_tarski(B,A)).
% 1.78/1.98 all A B (r1_tarski(A,B)<-> (all C (r2_hidden(C,A)->r2_hidden(C,B)))).
% 1.78/1.98 all A B C (C=k4_xboole_0(A,B)<-> (all D (r2_hidden(D,C)<->r2_hidden(D,A)& -r2_hidden(D,B)))).
% 1.78/1.98 all A B (k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A))).
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 $T.
% 1.78/1.98 all A exists B m1_subset_1(B,A).
% 1.78/1.98 v1_xboole_0(k1_xboole_0).
% 1.78/1.98 v1_relat_1(k1_xboole_0).
% 1.78/1.98 v3_relat_1(k1_xboole_0).
% 1.78/1.98 all A (-v1_xboole_0(k1_zfmisc_1(A))).
% 1.78/1.98 all A (-v1_xboole_0(k1_tarski(A))).
% 1.78/1.98 all A B (v1_relat_1(A)&v1_relat_1(B)->v1_relat_1(k4_xboole_0(A,B))).
% 1.78/1.98 all A B (-v1_xboole_0(k2_tarski(A,B))).
% 1.78/1.98 v1_xboole_0(k1_xboole_0).
% 1.78/1.98 v1_relat_1(k1_xboole_0).
% 1.78/1.98 exists A (v1_xboole_0(A)&v1_relat_1(A)).
% 1.78/1.98 all A (-v1_xboole_0(A)-> (exists B (m1_subset_1(B,k1_zfmisc_1(A))& -v1_xboole_0(B)))).
% 1.78/1.98 exists A (-v1_xboole_0(A)&v1_relat_1(A)).
% 1.78/1.98 all A exists B (m1_subset_1(B,k1_zfmisc_1(A))&v1_xboole_0(B)).
% 1.78/1.98 exists A (v1_relat_1(A)&v3_relat_1(A)).
% 1.78/1.98 all A B r1_tarski(A,A).
% 1.78/1.98 all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 1.78/1.98 all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 1.78/1.98 all A (k4_xboole_0(A,k1_xboole_0)=A).
% 1.78/1.98 all A B (m1_subset_1(A,k1_zfmisc_1(B))<->r1_tarski(A,B)).
% 1.78/1.98 all A (k4_xboole_0(k1_xboole_0,A)=k1_xboole_0).
% 1.78/1.98 all A B C (r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))->m1_subset_1(A,C)).
% 1.78/1.98 all A B C (-(r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))&v1_xboole_0(C))).
% 1.78/1.98 all A (v1_xboole_0(A)->A=k1_xboole_0).
% 1.78/1.98 all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 1.78/1.98 all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 1.78/1.98 all A B C (v1_relat_1(C)-> (r2_hidden(A,k9_relat_1(C,k1_tarski(B)))<->r2_hidden(k4_tarski(B,A),C))).
% 1.78/1.98 end_of_list.
% 1.78/1.98
% 1.78/1.98 -------> usable clausifies to:
% 1.78/1.98
% 1.78/1.98 list(usable).
% 1.78/1.98 0 [] A=A.
% 1.78/1.98 0 [] v1_relat_1($c2).
% 1.78/1.98 0 [] v1_relat_1($c1).
% 1.78/1.98 0 [] k9_relat_1(k4_xboole_0($c2,$c1),k1_tarski($c3))!=k4_xboole_0(k9_relat_1($c2,k1_tarski($c3)),k9_relat_1($c1,k1_tarski($c3))).
% 1.78/1.98 0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.78/1.98 0 [] -v1_xboole_0(A)|v1_relat_1(A).
% 1.78/1.98 0 [] k2_tarski(A,B)=k2_tarski(B,A).
% 1.78/1.98 0 [] A!=B|r1_tarski(A,B).
% 1.78/1.98 0 [] A!=B|r1_tarski(B,A).
% 1.78/1.98 0 [] A=B| -r1_tarski(A,B)| -r1_tarski(B,A).
% 1.78/1.98 0 [] -r1_tarski(A,B)| -r2_hidden(C,A)|r2_hidden(C,B).
% 1.78/1.98 0 [] r1_tarski(A,B)|r2_hidden($f1(A,B),A).
% 1.78/1.98 0 [] r1_tarski(A,B)| -r2_hidden($f1(A,B),B).
% 1.78/1.98 0 [] C!=k4_xboole_0(A,B)| -r2_hidden(D,C)|r2_hidden(D,A).
% 1.78/1.98 0 [] C!=k4_xboole_0(A,B)| -r2_hidden(D,C)| -r2_hidden(D,B).
% 1.78/1.98 0 [] C!=k4_xboole_0(A,B)|r2_hidden(D,C)| -r2_hidden(D,A)|r2_hidden(D,B).
% 1.78/1.98 0 [] C=k4_xboole_0(A,B)|r2_hidden($f2(A,B,C),C)|r2_hidden($f2(A,B,C),A).
% 1.78/1.98 0 [] C=k4_xboole_0(A,B)|r2_hidden($f2(A,B,C),C)| -r2_hidden($f2(A,B,C),B).
% 1.78/1.98 0 [] C=k4_xboole_0(A,B)| -r2_hidden($f2(A,B,C),C)| -r2_hidden($f2(A,B,C),A)|r2_hidden($f2(A,B,C),B).
% 1.78/1.98 0 [] k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A)).
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] $T.
% 1.78/1.98 0 [] m1_subset_1($f3(A),A).
% 1.78/1.98 0 [] v1_xboole_0(k1_xboole_0).
% 1.78/1.98 0 [] v1_relat_1(k1_xboole_0).
% 1.78/1.98 0 [] v3_relat_1(k1_xboole_0).
% 1.78/1.98 0 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.78/1.98 0 [] -v1_xboole_0(k1_tarski(A)).
% 1.78/1.98 0 [] -v1_relat_1(A)| -v1_relat_1(B)|v1_relat_1(k4_xboole_0(A,B)).
% 1.78/1.98 0 [] -v1_xboole_0(k2_tarski(A,B)).
% 1.78/1.98 0 [] v1_xboole_0(k1_xboole_0).
% 1.78/1.98 0 [] v1_relat_1(k1_xboole_0).
% 1.78/1.98 0 [] v1_xboole_0($c4).
% 1.78/1.98 0 [] v1_relat_1($c4).
% 1.78/1.99 0 [] v1_xboole_0(A)|m1_subset_1($f4(A),k1_zfmisc_1(A)).
% 1.78/1.99 0 [] v1_xboole_0(A)| -v1_xboole_0($f4(A)).
% 1.78/1.99 0 [] -v1_xboole_0($c5).
% 1.78/1.99 0 [] v1_relat_1($c5).
% 1.78/1.99 0 [] m1_subset_1($f5(A),k1_zfmisc_1(A)).
% 1.78/1.99 0 [] v1_xboole_0($f5(A)).
% 1.78/1.99 0 [] v1_relat_1($c6).
% 1.78/1.99 0 [] v3_relat_1($c6).
% 1.78/1.99 0 [] r1_tarski(A,A).
% 1.78/1.99 0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.78/1.99 0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.78/1.99 0 [] k4_xboole_0(A,k1_xboole_0)=A.
% 1.78/1.99 0 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.78/1.99 0 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.78/1.99 0 [] k4_xboole_0(k1_xboole_0,A)=k1_xboole_0.
% 1.78/1.99 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.78/1.99 0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.78/1.99 0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.78/1.99 0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.78/1.99 0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.78/1.99 0 [] -v1_relat_1(C)| -r2_hidden(A,k9_relat_1(C,k1_tarski(B)))|r2_hidden(k4_tarski(B,A),C).
% 1.78/1.99 0 [] -v1_relat_1(C)|r2_hidden(A,k9_relat_1(C,k1_tarski(B)))| -r2_hidden(k4_tarski(B,A),C).
% 1.78/1.99 end_of_list.
% 1.78/1.99
% 1.78/1.99 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.78/1.99
% 1.78/1.99 This ia a non-Horn set with equality. The strategy will be
% 1.78/1.99 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.78/1.99 deletion, with positive clauses in sos and nonpositive
% 1.78/1.99 clauses in usable.
% 1.78/1.99
% 1.78/1.99 dependent: set(knuth_bendix).
% 1.78/1.99 dependent: set(anl_eq).
% 1.78/1.99 dependent: set(para_from).
% 1.78/1.99 dependent: set(para_into).
% 1.78/1.99 dependent: clear(para_from_right).
% 1.78/1.99 dependent: clear(para_into_right).
% 1.78/1.99 dependent: set(para_from_vars).
% 1.78/1.99 dependent: set(eq_units_both_ways).
% 1.78/1.99 dependent: set(dynamic_demod_all).
% 1.78/1.99 dependent: set(dynamic_demod).
% 1.78/1.99 dependent: set(order_eq).
% 1.78/1.99 dependent: set(back_demod).
% 1.78/1.99 dependent: set(lrpo).
% 1.78/1.99 dependent: set(hyper_res).
% 1.78/1.99 dependent: set(unit_deletion).
% 1.78/1.99 dependent: set(factor).
% 1.78/1.99
% 1.78/1.99 ------------> process usable:
% 1.78/1.99 ** KEPT (pick-wt=16): 1 [] k9_relat_1(k4_xboole_0($c2,$c1),k1_tarski($c3))!=k4_xboole_0(k9_relat_1($c2,k1_tarski($c3)),k9_relat_1($c1,k1_tarski($c3))).
% 1.78/1.99 ** KEPT (pick-wt=6): 2 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.78/1.99 ** KEPT (pick-wt=4): 3 [] -v1_xboole_0(A)|v1_relat_1(A).
% 1.78/1.99 ** KEPT (pick-wt=6): 4 [] A!=B|r1_tarski(A,B).
% 1.78/1.99 ** KEPT (pick-wt=6): 5 [] A!=B|r1_tarski(B,A).
% 1.78/1.99 ** KEPT (pick-wt=9): 6 [] A=B| -r1_tarski(A,B)| -r1_tarski(B,A).
% 1.78/1.99 ** KEPT (pick-wt=9): 7 [] -r1_tarski(A,B)| -r2_hidden(C,A)|r2_hidden(C,B).
% 1.78/1.99 ** KEPT (pick-wt=8): 8 [] r1_tarski(A,B)| -r2_hidden($f1(A,B),B).
% 1.78/1.99 ** KEPT (pick-wt=11): 9 [] A!=k4_xboole_0(B,C)| -r2_hidden(D,A)|r2_hidden(D,B).
% 1.78/1.99 ** KEPT (pick-wt=11): 10 [] A!=k4_xboole_0(B,C)| -r2_hidden(D,A)| -r2_hidden(D,C).
% 1.78/1.99 ** KEPT (pick-wt=14): 11 [] A!=k4_xboole_0(B,C)|r2_hidden(D,A)| -r2_hidden(D,B)|r2_hidden(D,C).
% 1.78/1.99 ** KEPT (pick-wt=17): 12 [] A=k4_xboole_0(B,C)|r2_hidden($f2(B,C,A),A)| -r2_hidden($f2(B,C,A),C).
% 1.78/1.99 ** KEPT (pick-wt=23): 13 [] A=k4_xboole_0(B,C)| -r2_hidden($f2(B,C,A),A)| -r2_hidden($f2(B,C,A),B)|r2_hidden($f2(B,C,A),C).
% 1.78/1.99 ** KEPT (pick-wt=3): 14 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.78/1.99 ** KEPT (pick-wt=3): 15 [] -v1_xboole_0(k1_tarski(A)).
% 1.78/1.99 ** KEPT (pick-wt=8): 16 [] -v1_relat_1(A)| -v1_relat_1(B)|v1_relat_1(k4_xboole_0(A,B)).
% 1.78/1.99 ** KEPT (pick-wt=4): 17 [] -v1_xboole_0(k2_tarski(A,B)).
% 1.78/1.99 ** KEPT (pick-wt=5): 18 [] v1_xboole_0(A)| -v1_xboole_0($f4(A)).
% 1.78/1.99 ** KEPT (pick-wt=2): 19 [] -v1_xboole_0($c5).
% 1.78/1.99 ** KEPT (pick-wt=6): 20 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.78/1.99 ** KEPT (pick-wt=8): 21 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.78/1.99 ** KEPT (pick-wt=7): 22 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.78/1.99 ** KEPT (pick-wt=7): 23 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.78/1.99 ** KEPT (pick-wt=10): 24 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.78/1.99 ** KEPT (pick-wt=9): 25 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.78/1.99 ** KEPT (pick-wt=5): 26 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.78/1.99 ** KEPT (pick-wt=5): 27 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.78/1.99 ** KEPT (pick-wt=7): 28 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.78/1.99 ** KEPT (pick-wt=13): 29 [] -v1_relat_1(A)| -r2_hidden(B,k9_relat_1(A,k1_tarski(C)))|r2_hidden(k4_tarski(C,B),A).
% 1.78/1.99 ** KEPT (pick-wt=13): 30 [] -v1_relat_1(A)|r2_hidden(B,k9_relat_1(A,k1_tarski(C)))| -r2_hiddAlarm clock
% 299.83/300.02 Otter interrupted
% 299.83/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------