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