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