TSTP Solution File: SET937+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET937+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:34 EDT 2022
% Result : Timeout 299.91s 300.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET937+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:32:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.80/2.01 ----- Otter 3.3f, August 2004 -----
% 1.80/2.01 The process was started by sandbox on n008.cluster.edu,
% 1.80/2.01 Wed Jul 27 10:32:23 2022
% 1.80/2.01 The command was "./otter". The process ID is 5175.
% 1.80/2.01
% 1.80/2.01 set(prolog_style_variables).
% 1.80/2.01 set(auto).
% 1.80/2.01 dependent: set(auto1).
% 1.80/2.01 dependent: set(process_input).
% 1.80/2.01 dependent: clear(print_kept).
% 1.80/2.01 dependent: clear(print_new_demod).
% 1.80/2.01 dependent: clear(print_back_demod).
% 1.80/2.01 dependent: clear(print_back_sub).
% 1.80/2.01 dependent: set(control_memory).
% 1.80/2.01 dependent: assign(max_mem, 12000).
% 1.80/2.01 dependent: assign(pick_given_ratio, 4).
% 1.80/2.01 dependent: assign(stats_level, 1).
% 1.80/2.01 dependent: assign(max_seconds, 10800).
% 1.80/2.01 clear(print_given).
% 1.80/2.01
% 1.80/2.01 formula_list(usable).
% 1.80/2.01 all A (A=A).
% 1.80/2.01 all A B (in(A,B)-> -in(B,A)).
% 1.80/2.01 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.80/2.01 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.80/2.01 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.80/2.01 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 1.80/2.01 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.80/2.01 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.80/2.01 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.80/2.01 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.80/2.01 empty(empty_set).
% 1.80/2.01 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.80/2.01 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.80/2.01 all A B (set_union2(A,A)=A).
% 1.80/2.01 all A B (set_intersection2(A,A)=A).
% 1.80/2.01 exists A empty(A).
% 1.80/2.01 exists A (-empty(A)).
% 1.80/2.01 all A B subset(A,A).
% 1.80/2.01 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.80/2.01 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.80/2.01 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 1.80/2.01 all A B subset(set_difference(A,B),A).
% 1.80/2.01 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 1.80/2.01 all A B disjoint(set_difference(A,B),B).
% 1.80/2.01 -(all A B subset(powerset(set_difference(A,B)),set_union2(singleton(empty_set),set_difference(powerset(A),powerset(B))))).
% 1.80/2.01 end_of_list.
% 1.80/2.01
% 1.80/2.01 -------> usable clausifies to:
% 1.80/2.01
% 1.80/2.01 list(usable).
% 1.80/2.01 0 [] A=A.
% 1.80/2.01 0 [] -in(A,B)| -in(B,A).
% 1.80/2.01 0 [] set_union2(A,B)=set_union2(B,A).
% 1.80/2.01 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.80/2.01 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.80/2.01 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.80/2.01 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.80/2.01 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.80/2.01 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 1.80/2.01 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 1.80/2.01 0 [] B=powerset(A)|in($f2(A,B),B)|subset($f2(A,B),A).
% 1.80/2.01 0 [] B=powerset(A)| -in($f2(A,B),B)| -subset($f2(A,B),A).
% 1.80/2.01 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.80/2.01 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.80/2.01 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.80/2.01 0 [] C=set_union2(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),A)|in($f3(A,B,C),B).
% 1.80/2.01 0 [] C=set_union2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),A).
% 1.80/2.01 0 [] C=set_union2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),B).
% 1.80/2.01 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.80/2.01 0 [] subset(A,B)|in($f4(A,B),A).
% 1.80/2.01 0 [] subset(A,B)| -in($f4(A,B),B).
% 1.80/2.01 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.80/2.01 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.80/2.01 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.80/2.01 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)|in($f5(A,B,C),A).
% 1.80/2.01 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 1.80/2.01 0 [] C=set_difference(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A)|in($f5(A,B,C),B).
% 1.80/2.01 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.80/2.01 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.80/2.01 0 [] empty(empty_set).
% 1.80/2.01 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.80/2.01 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.80/2.01 0 [] set_union2(A,A)=A.
% 1.80/2.01 0 [] set_intersection2(A,A)=A.
% 1.80/2.01 0 [] empty($c1).
% 1.80/2.01 0 [] -empty($c2).
% 1.80/2.01 0 [] subset(A,A).
% 1.80/2.01 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.80/2.01 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.80/2.01 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.80/2.01 0 [] subset(set_difference(A,B),A).
% 1.80/2.01 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.80/2.01 0 [] disjoint(set_difference(A,B),B).
% 1.80/2.01 0 [] -subset(powerset(set_difference($c4,$c3)),set_union2(singleton(empty_set),set_difference(powerset($c4),powerset($c3)))).
% 1.80/2.01 end_of_list.
% 1.80/2.01
% 1.80/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.80/2.01
% 1.80/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.80/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.80/2.01 deletion, with positive clauses in sos and nonpositive
% 1.80/2.01 clauses in usable.
% 1.80/2.01
% 1.80/2.01 dependent: set(knuth_bendix).
% 1.80/2.01 dependent: set(anl_eq).
% 1.80/2.01 dependent: set(para_from).
% 1.80/2.01 dependent: set(para_into).
% 1.80/2.01 dependent: clear(para_from_right).
% 1.80/2.01 dependent: clear(para_into_right).
% 1.80/2.01 dependent: set(para_from_vars).
% 1.80/2.01 dependent: set(eq_units_both_ways).
% 1.80/2.01 dependent: set(dynamic_demod_all).
% 1.80/2.01 dependent: set(dynamic_demod).
% 1.80/2.01 dependent: set(order_eq).
% 1.80/2.01 dependent: set(back_demod).
% 1.80/2.01 dependent: set(lrpo).
% 1.80/2.01 dependent: set(hyper_res).
% 1.80/2.01 dependent: set(unit_deletion).
% 1.80/2.01 dependent: set(factor).
% 1.80/2.01
% 1.80/2.01 ------------> process usable:
% 1.80/2.01 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.80/2.01 ** KEPT (pick-wt=10): 2 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.80/2.01 ** KEPT (pick-wt=10): 3 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.80/2.01 ** KEPT (pick-wt=14): 4 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 1.80/2.01 ** KEPT (pick-wt=10): 5 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 1.80/2.01 ** KEPT (pick-wt=10): 6 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 1.80/2.01 ** KEPT (pick-wt=14): 7 [] A=powerset(B)| -in($f2(B,A),A)| -subset($f2(B,A),B).
% 1.80/2.01 ** KEPT (pick-wt=14): 8 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.80/2.01 ** KEPT (pick-wt=11): 9 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.80/2.01 ** KEPT (pick-wt=11): 10 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.80/2.01 ** KEPT (pick-wt=17): 11 [] A=set_union2(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),B).
% 1.80/2.01 ** KEPT (pick-wt=17): 12 [] A=set_union2(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),C).
% 1.80/2.01 ** KEPT (pick-wt=9): 13 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.80/2.01 ** KEPT (pick-wt=8): 14 [] subset(A,B)| -in($f4(A,B),B).
% 1.80/2.01 ** KEPT (pick-wt=11): 15 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.80/2.01 ** KEPT (pick-wt=11): 16 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.80/2.01 ** KEPT (pick-wt=14): 17 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.80/2.01 ** KEPT (pick-wt=17): 18 [] A=set_difference(B,C)|in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 1.80/2.01 ** KEPT (pick-wt=23): 19 [] A=set_difference(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 1.80/2.01 ** KEPT (pick-wt=8): 20 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.80/2.01 ** KEPT (pick-wt=8): 21 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.80/2.01 ** KEPT (pick-wt=6): 22 [] empty(A)| -empty(set_union2(A,B)).
% 1.80/2.01 ** KEPT (pick-wt=6): 23 [] empty(A)| -empty(set_union2(B,A)).
% 1.80/2.01 ** KEPT (pick-wt=2): 24 [] -empty($c2).
% 1.80/2.01 ** KEPT (pick-wt=6): 25 [] -disjoint(A,B)|disjoint(B,A).
% 1.80/2.01 ** KEPT (pick-wt=9): 26 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.80/2.01 ** KEPT (pick-wt=8): 27 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.80/2.01 ** KEPT (pick-wt=9): 28 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.80/2.01 ** KEPT (pick-wt=13): 29 [] -subset(powerset(set_difference($c4,$c3)),set_union2(singleton(empty_set),set_difference(powerset($c4),powerset($c3)))).
% 1.80/2.01
% 1.80/2.01 ------------> process sos:
% 1.80/2.01 ** KEPT (pick-wt=3): 37 [] A=A.
% 1.80/2.01 ** KEPT (pick-wt=7): 38 [] set_union2(A,B)=set_union2(B,A).
% 1.80/2.01 ** KEPT (pick-wt=7): 39 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.80/2.01 ** KEPT (pick-wt=14): 40 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 1.80/2.01 ** KEPT (pick-wt=14): 41 [] A=powerset(B)|in($f2(B,A),A)|subset($f2(B,A),B).
% 1.80/2.01 ** KEPT (pick-wt=23): 42 [] A=set_union2(B,C)|in($f3(B,C,A),A)|in($f3(B,C,A),B)|in($f3(B,C,A),C).
% 1.80/2.01 ** KEPT (pick-wt=8): 43 [] subset(A,B)|in($f4(A,B),A).
% 1.80/2.01 ** KEPT (pick-wt=17): 44 [] A=set_difference(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B).
% 1.80/2.01 ** KEPT (pick-wt=2): 45 [] empty(empty_set).
% 1.80/2.01 ** KEPT (pick-wt=5): 46 [] set_union2(A,A)=A.
% 1.80/2.01 ---> New Demodulator: 47 [new_demod,46] set_union2(A,A)=A.
% 1.80/2.01 ** KEPT (pick-wt=5): 48 [] set_intersection2(A,A)=A.
% 1.80/2.01 ---> New Demodulator: 49 [new_demod,48] set_intersection2(A,A)=A.
% 1.80/2.01 ** KEPT (pick-wt=2): 50 [] empty($c1).
% 1.80/2.01 ** KEPT (pick-wt=3): 51 [] subset(A,A).
% 1.80/2.01 ** KEPT (pick-wt=5): 52 [] subset(set_difference(A,B),A).
% 1.80/2.01 ** KEPT (pick-wt=5): 53 [] disjoint(set_difference(A,B),B).
% 1.80/2.01 Following clause subsumed by 37 during input processing: 0 [copy,37,flip.1] A=A.
% 1.80/2.01 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.80/2.01 Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 1.80/2.01 >>>> Starting back demodulation with 47.
% 1.80/2.01 >> back demodulating 31 with 47.
% 1.80/2.01 >>>> StartinAlarm clock
% 299.91/300.08 Otter interrupted
% 299.91/300.08 PROOF NOT FOUND
%------------------------------------------------------------------------------