TSTP Solution File: SEU176+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU176+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:15:03 EDT 2022
% Result : Timeout 299.84s 300.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU176+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.07/2.24 ----- Otter 3.3f, August 2004 -----
% 2.07/2.24 The process was started by sandbox on n015.cluster.edu,
% 2.07/2.24 Wed Jul 27 07:43:27 2022
% 2.07/2.24 The command was "./otter". The process ID is 7443.
% 2.07/2.24
% 2.07/2.24 set(prolog_style_variables).
% 2.07/2.24 set(auto).
% 2.07/2.24 dependent: set(auto1).
% 2.07/2.24 dependent: set(process_input).
% 2.07/2.24 dependent: clear(print_kept).
% 2.07/2.24 dependent: clear(print_new_demod).
% 2.07/2.24 dependent: clear(print_back_demod).
% 2.07/2.24 dependent: clear(print_back_sub).
% 2.07/2.24 dependent: set(control_memory).
% 2.07/2.24 dependent: assign(max_mem, 12000).
% 2.07/2.24 dependent: assign(pick_given_ratio, 4).
% 2.07/2.24 dependent: assign(stats_level, 1).
% 2.07/2.24 dependent: assign(max_seconds, 10800).
% 2.07/2.24 clear(print_given).
% 2.07/2.24
% 2.07/2.24 formula_list(usable).
% 2.07/2.24 all A (A=A).
% 2.07/2.24 all A B (in(A,B)-> -in(B,A)).
% 2.07/2.24 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.07/2.24 all A B ((A!=empty_set-> (B=set_meet(A)<-> (all C (in(C,B)<-> (all D (in(D,A)->in(C,D)))))))& (A=empty_set-> (B=set_meet(A)<->B=empty_set))).
% 2.07/2.24 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.07/2.24 all A (cast_to_subset(A)=A).
% 2.07/2.24 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 2.07/2.24 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 2.07/2.24 all A B (element(B,powerset(A))->subset_complement(A,B)=set_difference(A,B)).
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))-> (all C (element(C,powerset(powerset(A)))-> (C=complements_of_subsets(A,B)<-> (all D (element(D,powerset(A))-> (in(D,C)<->in(subset_complement(A,D),B)))))))).
% 2.07/2.24 $T.
% 2.07/2.24 $T.
% 2.07/2.24 $T.
% 2.07/2.24 all A element(cast_to_subset(A),powerset(A)).
% 2.07/2.24 all A B (element(B,powerset(A))->element(subset_complement(A,B),powerset(A))).
% 2.07/2.24 $T.
% 2.07/2.24 $T.
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))->element(union_of_subsets(A,B),powerset(A))).
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))->element(meet_of_subsets(A,B),powerset(A))).
% 2.07/2.24 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_difference(A,B,C),powerset(A))).
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))->element(complements_of_subsets(A,B),powerset(powerset(A)))).
% 2.07/2.24 $T.
% 2.07/2.24 all A exists B element(B,A).
% 2.07/2.24 all A (-empty(powerset(A))).
% 2.07/2.24 empty(empty_set).
% 2.07/2.24 all A B (element(B,powerset(A))->subset_complement(A,subset_complement(A,B))=B).
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))->complements_of_subsets(A,complements_of_subsets(A,B))=B).
% 2.07/2.24 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.07/2.24 exists A empty(A).
% 2.07/2.24 all A exists B (element(B,powerset(A))&empty(B)).
% 2.07/2.24 exists A (-empty(A)).
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))->union_of_subsets(A,B)=union(B)).
% 2.07/2.24 all A B (element(B,powerset(powerset(A)))->meet_of_subsets(A,B)=set_meet(B)).
% 2.07/2.24 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_difference(A,B,C)=set_difference(B,C)).
% 2.07/2.24 all A B subset(A,A).
% 2.07/2.24 all A B (in(A,B)->element(A,B)).
% 2.07/2.24 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.07/2.24 all A (set_difference(A,empty_set)=A).
% 2.07/2.24 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.07/2.24 -(all A B (element(B,powerset(powerset(A)))-> (B!=empty_set->union_of_subsets(A,complements_of_subsets(A,B))=subset_difference(A,cast_to_subset(A),meet_of_subsets(A,B))))).
% 2.07/2.24 all A (set_difference(empty_set,A)=empty_set).
% 2.07/2.24 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.07/2.24 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.07/2.24 all A (empty(A)->A=empty_set).
% 2.07/2.24 all A B (-(in(A,B)&empty(B))).
% 2.07/2.24 all A B (-(empty(A)&A!=B&empty(B))).
% 2.07/2.24 end_of_list.
% 2.07/2.24
% 2.07/2.24 -------> usable clausifies to:
% 2.07/2.24
% 2.07/2.24 list(usable).
% 2.07/2.24 0 [] A=A.
% 2.07/2.24 0 [] -in(A,B)| -in(B,A).
% 2.07/2.24 0 [] A!=B|subset(A,B).
% 2.07/2.24 0 [] A!=B|subset(B,A).
% 2.07/2.24 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.07/2.24 0 [] A=empty_set|B!=set_meet(A)| -in(C,B)| -in(D,A)|in(C,D).
% 2.07/2.24 0 [] A=empty_set|B!=set_meet(A)|in(C,B)|in($f1(A,B,C),A).
% 2.07/2.24 0 [] A=empty_set|B!=set_meet(A)|in(C,B)| -in(C,$f1(A,B,C)).
% 2.07/2.24 0 [] A=empty_set|B=set_meet(A)|in($f3(A,B),B)| -in(X1,A)|in($f3(A,B),X1).
% 2.07/2.24 0 [] A=empty_set|B=set_meet(A)| -in($f3(A,B),B)|in($f2(A,B),A).
% 2.07/2.24 0 [] A=empty_set|B=set_meet(A)| -in($f3(A,B),B)| -in($f3(A,B),$f2(A,B)).
% 2.07/2.24 0 [] A!=empty_set|B!=set_meet(A)|B=empty_set.
% 2.07/2.24 0 [] A!=empty_set|B=set_meet(A)|B!=empty_set.
% 2.07/2.24 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.07/2.24 0 [] subset(A,B)|in($f4(A,B),A).
% 2.07/2.24 0 [] subset(A,B)| -in($f4(A,B),B).
% 2.07/2.24 0 [] cast_to_subset(A)=A.
% 2.07/2.24 0 [] B!=union(A)| -in(C,B)|in(C,$f5(A,B,C)).
% 2.07/2.24 0 [] B!=union(A)| -in(C,B)|in($f5(A,B,C),A).
% 2.07/2.24 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 2.07/2.24 0 [] B=union(A)|in($f7(A,B),B)|in($f7(A,B),$f6(A,B)).
% 2.07/2.24 0 [] B=union(A)|in($f7(A,B),B)|in($f6(A,B),A).
% 2.07/2.24 0 [] B=union(A)| -in($f7(A,B),B)| -in($f7(A,B),X2)| -in(X2,A).
% 2.07/2.24 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 2.07/2.24 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 2.07/2.24 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 2.07/2.24 0 [] C=set_difference(A,B)|in($f8(A,B,C),C)|in($f8(A,B,C),A).
% 2.07/2.24 0 [] C=set_difference(A,B)|in($f8(A,B,C),C)| -in($f8(A,B,C),B).
% 2.07/2.24 0 [] C=set_difference(A,B)| -in($f8(A,B,C),C)| -in($f8(A,B,C),A)|in($f8(A,B,C),B).
% 2.07/2.24 0 [] -element(B,powerset(A))|subset_complement(A,B)=set_difference(A,B).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C!=complements_of_subsets(A,B)| -element(D,powerset(A))| -in(D,C)|in(subset_complement(A,D),B).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C!=complements_of_subsets(A,B)| -element(D,powerset(A))|in(D,C)| -in(subset_complement(A,D),B).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|element($f9(A,B,C),powerset(A)).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|in($f9(A,B,C),C)|in(subset_complement(A,$f9(A,B,C)),B).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)| -in($f9(A,B,C),C)| -in(subset_complement(A,$f9(A,B,C)),B).
% 2.07/2.24 0 [] $T.
% 2.07/2.24 0 [] $T.
% 2.07/2.24 0 [] $T.
% 2.07/2.24 0 [] element(cast_to_subset(A),powerset(A)).
% 2.07/2.24 0 [] -element(B,powerset(A))|element(subset_complement(A,B),powerset(A)).
% 2.07/2.24 0 [] $T.
% 2.07/2.24 0 [] $T.
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))|element(union_of_subsets(A,B),powerset(A)).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))|element(meet_of_subsets(A,B),powerset(A)).
% 2.07/2.24 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_difference(A,B,C),powerset(A)).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))|element(complements_of_subsets(A,B),powerset(powerset(A))).
% 2.07/2.24 0 [] $T.
% 2.07/2.24 0 [] element($f10(A),A).
% 2.07/2.24 0 [] -empty(powerset(A)).
% 2.07/2.24 0 [] empty(empty_set).
% 2.07/2.24 0 [] -element(B,powerset(A))|subset_complement(A,subset_complement(A,B))=B.
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))|complements_of_subsets(A,complements_of_subsets(A,B))=B.
% 2.07/2.24 0 [] empty(A)|element($f11(A),powerset(A)).
% 2.07/2.24 0 [] empty(A)| -empty($f11(A)).
% 2.07/2.24 0 [] empty($c1).
% 2.07/2.24 0 [] element($f12(A),powerset(A)).
% 2.07/2.24 0 [] empty($f12(A)).
% 2.07/2.24 0 [] -empty($c2).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))|union_of_subsets(A,B)=union(B).
% 2.07/2.24 0 [] -element(B,powerset(powerset(A)))|meet_of_subsets(A,B)=set_meet(B).
% 2.07/2.24 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_difference(A,B,C)=set_difference(B,C).
% 2.07/2.24 0 [] subset(A,A).
% 2.07/2.24 0 [] -in(A,B)|element(A,B).
% 2.07/2.24 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.07/2.24 0 [] set_difference(A,empty_set)=A.
% 2.07/2.24 0 [] -element(A,powerset(B))|subset(A,B).
% 2.07/2.24 0 [] element(A,powerset(B))| -subset(A,B).
% 2.07/2.24 0 [] element($c3,powerset(powerset($c4))).
% 2.07/2.24 0 [] $c3!=empty_set.
% 2.07/2.24 0 [] union_of_subsets($c4,complements_of_subsets($c4,$c3))!=subset_difference($c4,cast_to_subset($c4),meet_of_subsets($c4,$c3)).
% 2.07/2.24 0 [] set_difference(empty_set,A)=empty_set.
% 2.07/2.24 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.07/2.24 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.07/2.24 0 [] -empty(A)|A=empty_set.
% 2.07/2.24 0 [] -in(A,B)| -empty(B).
% 2.07/2.24 0 [] -empty(A)|A=B| -empty(B).
% 2.07/2.24 end_of_list.
% 2.07/2.24
% 2.07/2.24 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.07/2.24
% 2.07/2.24 This ia a non-Horn set with equality. The strategy will be
% 2.07/2.24 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.07/2.24 deletion, with positive clauses in sos and nonpositive
% 2.07/2.24 clauses in usable.
% 2.07/2.24
% 2.07/2.24 dependent: set(knuth_bendix).
% 2.07/2.24 dependent: set(anl_eq).
% 2.07/2.24 dependent: set(para_from).
% 2.07/2.24 dependent: set(para_into).
% 2.07/2.24 dependent: clear(para_from_right).
% 2.07/2.24 dependent: clear(para_into_right).
% 2.07/2.24 dependent: set(para_from_vars).
% 2.07/2.24 dependent: set(eq_units_both_ways).
% 2.07/2.24 dependent: set(dynamic_demod_all).
% 2.07/2.24 dependent: set(dynamic_demod).
% 2.07/2.24 dependent: set(order_eq).
% 2.07/2.24 dependent: set(back_demod).
% 2.07/2.24 dependent: set(lrpo).
% 2.07/2.24 dependent: set(hyper_res).
% 2.07/2.24 dependent: set(unit_deletion).
% 2.07/2.24 dependent: set(factor).
% 2.07/2.24
% 2.07/2.24 ------------> process usable:
% 2.07/2.24 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.07/2.24 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 2.07/2.24 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 2.07/2.24 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 2.07/2.24 ** KEPT (pick-wt=16): 5 [] A=empty_set|B!=set_meet(A)| -in(C,B)| -in(D,A)|in(C,D).
% 2.07/2.24 ** KEPT (pick-wt=16): 6 [] A=empty_set|B!=set_meet(A)|in(C,B)|in($f1(A,B,C),A).
% 2.07/2.24 ** KEPT (pick-wt=16): 7 [] A=empty_set|B!=set_meet(A)|in(C,B)| -in(C,$f1(A,B,C)).
% 2.07/2.24 ** KEPT (pick-wt=20): 8 [] A=empty_set|B=set_meet(A)|in($f3(A,B),B)| -in(C,A)|in($f3(A,B),C).
% 2.07/2.24 ** KEPT (pick-wt=17): 9 [] A=empty_set|B=set_meet(A)| -in($f3(A,B),B)|in($f2(A,B),A).
% 2.07/2.24 ** KEPT (pick-wt=19): 10 [] A=empty_set|B=set_meet(A)| -in($f3(A,B),B)| -in($f3(A,B),$f2(A,B)).
% 2.07/2.24 ** KEPT (pick-wt=10): 11 [] A!=empty_set|B!=set_meet(A)|B=empty_set.
% 2.07/2.24 ** KEPT (pick-wt=10): 12 [] A!=empty_set|B=set_meet(A)|B!=empty_set.
% 2.07/2.24 ** KEPT (pick-wt=9): 13 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.07/2.24 ** KEPT (pick-wt=8): 14 [] subset(A,B)| -in($f4(A,B),B).
% 2.07/2.24 ** KEPT (pick-wt=13): 15 [] A!=union(B)| -in(C,A)|in(C,$f5(B,A,C)).
% 2.07/2.24 ** KEPT (pick-wt=13): 16 [] A!=union(B)| -in(C,A)|in($f5(B,A,C),B).
% 2.07/2.24 ** KEPT (pick-wt=13): 17 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 2.07/2.24 ** KEPT (pick-wt=17): 18 [] A=union(B)| -in($f7(B,A),A)| -in($f7(B,A),C)| -in(C,B).
% 2.07/2.24 ** KEPT (pick-wt=11): 19 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 2.07/2.24 ** KEPT (pick-wt=11): 20 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 2.07/2.24 ** KEPT (pick-wt=14): 21 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 2.07/2.24 ** KEPT (pick-wt=17): 22 [] A=set_difference(B,C)|in($f8(B,C,A),A)| -in($f8(B,C,A),C).
% 2.07/2.24 ** KEPT (pick-wt=23): 23 [] A=set_difference(B,C)| -in($f8(B,C,A),A)| -in($f8(B,C,A),B)|in($f8(B,C,A),C).
% 2.07/2.24 ** KEPT (pick-wt=11): 24 [] -element(A,powerset(B))|subset_complement(B,A)=set_difference(B,A).
% 2.07/2.24 ** KEPT (pick-wt=27): 25 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C!=complements_of_subsets(B,A)| -element(D,powerset(B))| -in(D,C)|in(subset_complement(B,D),A).
% 2.07/2.24 ** KEPT (pick-wt=27): 26 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C!=complements_of_subsets(B,A)| -element(D,powerset(B))|in(D,C)| -in(subset_complement(B,D),A).
% 2.07/2.24 ** KEPT (pick-wt=22): 27 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|element($f9(B,A,C),powerset(B)).
% 2.07/2.24 ** KEPT (pick-wt=29): 28 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|in($f9(B,A,C),C)|in(subset_complement(B,$f9(B,A,C)),A).
% 2.07/2.24 ** KEPT (pick-wt=29): 29 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)| -in($f9(B,A,C),C)| -in(subset_complement(B,$f9(B,A,C)),A).
% 2.07/2.24 ** KEPT (pick-wt=10): 30 [] -element(A,powerset(B))|element(subset_complement(B,A),powerset(B)).
% 2.07/2.24 ** KEPT (pick-wt=11): 31 [] -element(A,powerset(powerset(B)))|element(union_of_subsets(B,A),powerset(B)).
% 2.07/2.24 ** KEPT (pick-wt=11): 32 [] -element(A,powerset(powerset(B)))|element(meet_of_subsets(B,A),powerset(B)).
% 2.07/2.24 ** KEPT (pick-wt=15): 33 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_difference(B,A,C),powerset(B)).
% 2.07/2.24 ** KEPT (pick-wt=12): 34 [] -element(A,powerset(powerset(B)))|element(complements_of_subsets(B,A),powerset(powerset(B))).
% 2.07/2.24 ** KEPT (pick-wt=3): 35 [] -empty(powerset(A)).
% 2.07/2.24 ** KEPT (pick-wt=11): 36 [] -element(A,powerset(B))|subset_complement(B,subset_complement(B,A))=A.
% 2.07/2.24 ** KEPT (pick-wt=12): 37 [] -element(A,powerset(powerset(B)))|complements_of_subsets(B,complements_of_subsets(B,A))=A.
% 2.07/2.24 ** KEPT (pick-wt=5): 38 [] empty(A)| -empty($f11(A)).
% 2.07/2.24 ** KEPT (pick-wt=2): 39 [] -empty($c2).
% 2.07/2.24 ** KEPT (pick-wt=11): 40 [] -element(A,powerset(powerset(B)))|union_of_subsets(B,A)=union(A).
% 2.07/2.24 ** KEPT (pick-wt=11): 41 [] -element(A,powerset(powerset(B)))|meet_of_subsets(B,A)=set_meet(A).
% 2.07/2.24 ** KEPT (pick-wt=16): 42 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_difference(B,A,C)=set_difference(A,C).
% 2.07/2.24 ** KEPT (pick-wt=6): 43 [] -in(A,B)|element(A,B).
% 2.07/2.24 ** KEPT (pick-wt=8): 44 [] -element(A,B)|empty(B)|in(A,B).
% 2.07/2.24 ** KEPT (pick-wt=7): 45 [] -element(A,powerset(B))|subset(A,B).
% 2.07/2.24 ** KEPT (pick-wt=7Alarm clock
% 299.84/300.01 Otter interrupted
% 299.84/300.01 PROOF NOT FOUND
%------------------------------------------------------------------------------