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