TSTP Solution File: SEU114+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:14:47 EDT 2022
% Result : Timeout 299.86s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n003.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:59:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.86/2.06 ----- Otter 3.3f, August 2004 -----
% 1.86/2.06 The process was started by sandbox on n003.cluster.edu,
% 1.86/2.06 Wed Jul 27 07:59:41 2022
% 1.86/2.06 The command was "./otter". The process ID is 11685.
% 1.86/2.06
% 1.86/2.06 set(prolog_style_variables).
% 1.86/2.06 set(auto).
% 1.86/2.06 dependent: set(auto1).
% 1.86/2.06 dependent: set(process_input).
% 1.86/2.06 dependent: clear(print_kept).
% 1.86/2.06 dependent: clear(print_new_demod).
% 1.86/2.06 dependent: clear(print_back_demod).
% 1.86/2.06 dependent: clear(print_back_sub).
% 1.86/2.06 dependent: set(control_memory).
% 1.86/2.06 dependent: assign(max_mem, 12000).
% 1.86/2.06 dependent: assign(pick_given_ratio, 4).
% 1.86/2.06 dependent: assign(stats_level, 1).
% 1.86/2.06 dependent: assign(max_seconds, 10800).
% 1.86/2.06 clear(print_given).
% 1.86/2.06
% 1.86/2.06 formula_list(usable).
% 1.86/2.06 all A (A=A).
% 1.86/2.06 all A B (in(A,B)-> -in(B,A)).
% 1.86/2.06 all A (empty(A)->finite(A)).
% 1.86/2.06 all A (preboolean(A)->cup_closed(A)&diff_closed(A)).
% 1.86/2.06 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.86/2.06 all A (cup_closed(A)&diff_closed(A)->preboolean(A)).
% 1.86/2.06 all A B (element(B,finite_subsets(A))->finite(B)).
% 1.86/2.06 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.86/2.06 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.86/2.06 all A B (preboolean(B)-> (B=finite_subsets(A)<-> (all C (in(C,B)<->subset(C,A)&finite(C))))).
% 1.86/2.06 all A preboolean(finite_subsets(A)).
% 1.86/2.06 all A exists B element(B,A).
% 1.86/2.06 all A (-empty(powerset(A))&cup_closed(powerset(A))&diff_closed(powerset(A))&preboolean(powerset(A))).
% 1.86/2.06 all A (-empty(powerset(A))).
% 1.86/2.06 empty(empty_set).
% 1.86/2.06 all A (-empty(finite_subsets(A))&cup_closed(finite_subsets(A))&diff_closed(finite_subsets(A))&preboolean(finite_subsets(A))).
% 1.86/2.06 exists A (-empty(A)&finite(A)).
% 1.86/2.06 exists A (-empty(A)&cup_closed(A)&cap_closed(A)&diff_closed(A)&preboolean(A)).
% 1.86/2.06 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.86/2.06 exists A empty(A).
% 1.86/2.06 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 1.86/2.06 all A exists B (element(B,powerset(A))&empty(B)).
% 1.86/2.06 exists A (-empty(A)).
% 1.86/2.06 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.86/2.06 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.86/2.06 all A B subset(A,A).
% 1.86/2.06 all A B (subset(A,B)&finite(B)->finite(A)).
% 1.86/2.06 all A B (in(A,B)->element(A,B)).
% 1.86/2.06 all A subset(finite_subsets(A),powerset(A)).
% 1.86/2.06 -(all A (finite(A)->finite_subsets(A)=powerset(A))).
% 1.86/2.06 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.86/2.06 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.86/2.06 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.86/2.06 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.86/2.06 all A (empty(A)->A=empty_set).
% 1.86/2.06 all A B (-(in(A,B)&empty(B))).
% 1.86/2.06 all A B (-(empty(A)&A!=B&empty(B))).
% 1.86/2.06 end_of_list.
% 1.86/2.06
% 1.86/2.06 -------> usable clausifies to:
% 1.86/2.06
% 1.86/2.06 list(usable).
% 1.86/2.06 0 [] A=A.
% 1.86/2.06 0 [] -in(A,B)| -in(B,A).
% 1.86/2.06 0 [] -empty(A)|finite(A).
% 1.86/2.06 0 [] -preboolean(A)|cup_closed(A).
% 1.86/2.06 0 [] -preboolean(A)|diff_closed(A).
% 1.86/2.06 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.86/2.06 0 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.86/2.06 0 [] -element(B,finite_subsets(A))|finite(B).
% 1.86/2.06 0 [] A!=B|subset(A,B).
% 1.86/2.06 0 [] A!=B|subset(B,A).
% 1.86/2.06 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.86/2.06 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.86/2.06 0 [] subset(A,B)|in($f1(A,B),A).
% 1.86/2.06 0 [] subset(A,B)| -in($f1(A,B),B).
% 1.86/2.06 0 [] -preboolean(B)|B!=finite_subsets(A)| -in(C,B)|subset(C,A).
% 1.86/2.06 0 [] -preboolean(B)|B!=finite_subsets(A)| -in(C,B)|finite(C).
% 1.86/2.06 0 [] -preboolean(B)|B!=finite_subsets(A)|in(C,B)| -subset(C,A)| -finite(C).
% 1.86/2.06 0 [] -preboolean(B)|B=finite_subsets(A)|in($f2(A,B),B)|subset($f2(A,B),A).
% 1.86/2.06 0 [] -preboolean(B)|B=finite_subsets(A)|in($f2(A,B),B)|finite($f2(A,B)).
% 1.86/2.06 0 [] -preboolean(B)|B=finite_subsets(A)| -in($f2(A,B),B)| -subset($f2(A,B),A)| -finite($f2(A,B)).
% 1.86/2.06 0 [] preboolean(finite_subsets(A)).
% 1.86/2.06 0 [] element($f3(A),A).
% 1.86/2.06 0 [] -empty(powerset(A)).
% 1.86/2.06 0 [] cup_closed(powerset(A)).
% 1.86/2.06 0 [] diff_closed(powerset(A)).
% 1.86/2.06 0 [] preboolean(powerset(A)).
% 1.86/2.06 0 [] -empty(powerset(A)).
% 1.86/2.06 0 [] empty(empty_set).
% 1.86/2.06 0 [] -empty(finite_subsets(A)).
% 1.86/2.06 0 [] cup_closed(finite_subsets(A)).
% 1.86/2.06 0 [] diff_closed(finite_subsets(A)).
% 1.86/2.06 0 [] preboolean(finite_subsets(A)).
% 1.86/2.06 0 [] -empty($c1).
% 1.86/2.06 0 [] finite($c1).
% 1.86/2.06 0 [] -empty($c2).
% 1.86/2.06 0 [] cup_closed($c2).
% 1.86/2.06 0 [] cap_closed($c2).
% 1.86/2.06 0 [] diff_closed($c2).
% 1.86/2.06 0 [] preboolean($c2).
% 1.86/2.06 0 [] empty(A)|element($f4(A),powerset(A)).
% 1.86/2.06 0 [] empty(A)| -empty($f4(A)).
% 1.86/2.06 0 [] empty($c3).
% 1.86/2.06 0 [] element($f5(A),powerset(A)).
% 1.86/2.06 0 [] empty($f5(A)).
% 1.86/2.06 0 [] relation($f5(A)).
% 1.86/2.06 0 [] function($f5(A)).
% 1.86/2.06 0 [] one_to_one($f5(A)).
% 1.86/2.06 0 [] epsilon_transitive($f5(A)).
% 1.86/2.06 0 [] epsilon_connected($f5(A)).
% 1.86/2.06 0 [] ordinal($f5(A)).
% 1.86/2.06 0 [] natural($f5(A)).
% 1.86/2.06 0 [] finite($f5(A)).
% 1.86/2.06 0 [] element($f6(A),powerset(A)).
% 1.86/2.06 0 [] empty($f6(A)).
% 1.86/2.06 0 [] -empty($c4).
% 1.86/2.06 0 [] empty(A)|element($f7(A),powerset(A)).
% 1.86/2.06 0 [] empty(A)| -empty($f7(A)).
% 1.86/2.06 0 [] empty(A)|finite($f7(A)).
% 1.86/2.06 0 [] empty(A)|element($f8(A),powerset(A)).
% 1.86/2.06 0 [] empty(A)| -empty($f8(A)).
% 1.86/2.06 0 [] empty(A)|finite($f8(A)).
% 1.86/2.06 0 [] subset(A,A).
% 1.86/2.06 0 [] -subset(A,B)| -finite(B)|finite(A).
% 1.86/2.06 0 [] -in(A,B)|element(A,B).
% 1.86/2.06 0 [] subset(finite_subsets(A),powerset(A)).
% 1.86/2.06 0 [] finite($c5).
% 1.86/2.06 0 [] finite_subsets($c5)!=powerset($c5).
% 1.86/2.06 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.86/2.06 0 [] -element(A,powerset(B))|subset(A,B).
% 1.86/2.06 0 [] element(A,powerset(B))| -subset(A,B).
% 1.86/2.06 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.86/2.06 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.86/2.06 0 [] -empty(A)|A=empty_set.
% 1.86/2.06 0 [] -in(A,B)| -empty(B).
% 1.86/2.06 0 [] -empty(A)|A=B| -empty(B).
% 1.86/2.06 end_of_list.
% 1.86/2.06
% 1.86/2.06 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.86/2.06
% 1.86/2.06 This ia a non-Horn set with equality. The strategy will be
% 1.86/2.06 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.86/2.06 deletion, with positive clauses in sos and nonpositive
% 1.86/2.06 clauses in usable.
% 1.86/2.06
% 1.86/2.06 dependent: set(knuth_bendix).
% 1.86/2.06 dependent: set(anl_eq).
% 1.86/2.06 dependent: set(para_from).
% 1.86/2.06 dependent: set(para_into).
% 1.86/2.06 dependent: clear(para_from_right).
% 1.86/2.06 dependent: clear(para_into_right).
% 1.86/2.06 dependent: set(para_from_vars).
% 1.86/2.06 dependent: set(eq_units_both_ways).
% 1.86/2.06 dependent: set(dynamic_demod_all).
% 1.86/2.06 dependent: set(dynamic_demod).
% 1.86/2.06 dependent: set(order_eq).
% 1.86/2.06 dependent: set(back_demod).
% 1.86/2.06 dependent: set(lrpo).
% 1.86/2.06 dependent: set(hyper_res).
% 1.86/2.06 dependent: set(unit_deletion).
% 1.86/2.06 dependent: set(factor).
% 1.86/2.06
% 1.86/2.06 ------------> process usable:
% 1.86/2.06 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.86/2.06 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.86/2.06 ** KEPT (pick-wt=4): 3 [] -preboolean(A)|cup_closed(A).
% 1.86/2.06 ** KEPT (pick-wt=4): 4 [] -preboolean(A)|diff_closed(A).
% 1.86/2.06 ** KEPT (pick-wt=8): 5 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.86/2.06 ** KEPT (pick-wt=6): 6 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.86/2.06 ** KEPT (pick-wt=6): 7 [] -element(A,finite_subsets(B))|finite(A).
% 1.86/2.06 ** KEPT (pick-wt=6): 8 [] A!=B|subset(A,B).
% 1.86/2.06 ** KEPT (pick-wt=6): 9 [] A!=B|subset(B,A).
% 1.86/2.06 ** KEPT (pick-wt=9): 10 [] A=B| -subset(A,B)| -subset(B,A).
% 1.86/2.06 ** KEPT (pick-wt=9): 11 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.86/2.06 ** KEPT (pick-wt=8): 12 [] subset(A,B)| -in($f1(A,B),B).
% 1.86/2.06 ** KEPT (pick-wt=12): 13 [] -preboolean(A)|A!=finite_subsets(B)| -in(C,A)|subset(C,B).
% 1.86/2.06 ** KEPT (pick-wt=11): 14 [] -preboolean(A)|A!=finite_subsets(B)| -in(C,A)|finite(C).
% 1.86/2.06 ** KEPT (pick-wt=14): 15 [] -preboolean(A)|A!=finite_subsets(B)|in(C,A)| -subset(C,B)| -finite(C).
% 1.86/2.06 ** KEPT (pick-wt=16): 16 [] -preboolean(A)|A=finite_subsets(B)|in($f2(B,A),A)|subset($f2(B,A),B).
% 1.86/2.06 ** KEPT (pick-wt=15): 17 [] -preboolean(A)|A=finite_subsets(B)|in($f2(B,A),A)|finite($f2(B,A)).
% 1.86/2.06 ** KEPT (pick-wt=20): 18 [] -preboolean(A)|A=finite_subsets(B)| -in($f2(B,A),A)| -subset($f2(B,A),B)| -finite($f2(B,A)).
% 1.86/2.06 ** KEPT (pick-wt=3): 19 [] -empty(powerset(A)).
% 1.86/2.06 Following clause subsumed by 19 during input processing: 0 [] -empty(powerset(A)).
% 1.86/2.06 ** KEPT (pick-wt=3): 20 [] -empty(finite_subsets(A)).
% 1.86/2.06 ** KEPT (pick-wt=2): 21 [] -empty($c1).
% 1.86/2.06 ** KEPT (pick-wt=2): 22 [] -empty($c2).
% 1.86/2.06 ** KEPT (pick-wt=5): 23 [] empty(A)| -empty($f4(A)).
% 1.86/2.06 ** KEPT (pick-wt=2): 24 [] -empty($c4).
% 1.86/2.06 ** KEPT (pick-wt=5): 25 [] empty(A)| -empty($f7(A)).
% 1.86/2.06 ** KEPT (pick-wt=5): 26 [] empty(A)| -empty($f8(A)).
% 1.86/2.06 ** KEPT (pick-wt=7): 27 [] -subset(A,B)| -finite(B)|finite(A).
% 1.86/2.06 ** KEPT (pick-wt=6): 28 [] -in(A,B)|element(A,B).
% 1.86/2.06 ** KEPT (pick-wt=5): 30 [copy,29,flip.1] powerset($c5)!=finite_subsets($c5).
% 1.86/2.06 ** KEPT (pick-wt=8): 31 [] -element(A,B)|empty(B)|in(A,B).
% 1.86/2.06 ** KEPT (pick-wt=7): 32 [] -element(A,powerset(B))|subset(A,B).
% 1.86/2.06 ** KEPT (pick-wt=7): 33 [] element(A,powerset(B))| -subset(A,B).
% 1.86/2.06 ** KEPT (pick-wt=10): 34 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.86/2.06 ** Alarm clock
% 299.86/300.02 Otter interrupted
% 299.86/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------