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