TSTP Solution File: SEU205+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU205+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:09 EDT 2022
% Result : Unknown 122.32s 122.52s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU205+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:42:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.02/2.22 ----- Otter 3.3f, August 2004 -----
% 2.02/2.22 The process was started by sandbox2 on n025.cluster.edu,
% 2.02/2.22 Wed Jul 27 07:42:15 2022
% 2.02/2.22 The command was "./otter". The process ID is 30685.
% 2.02/2.22
% 2.02/2.22 set(prolog_style_variables).
% 2.02/2.22 set(auto).
% 2.02/2.22 dependent: set(auto1).
% 2.02/2.22 dependent: set(process_input).
% 2.02/2.22 dependent: clear(print_kept).
% 2.02/2.22 dependent: clear(print_new_demod).
% 2.02/2.22 dependent: clear(print_back_demod).
% 2.02/2.22 dependent: clear(print_back_sub).
% 2.02/2.22 dependent: set(control_memory).
% 2.02/2.22 dependent: assign(max_mem, 12000).
% 2.02/2.22 dependent: assign(pick_given_ratio, 4).
% 2.02/2.22 dependent: assign(stats_level, 1).
% 2.02/2.22 dependent: assign(max_seconds, 10800).
% 2.02/2.22 clear(print_given).
% 2.02/2.22
% 2.02/2.22 formula_list(usable).
% 2.02/2.22 all A (A=A).
% 2.02/2.22 all A B (in(A,B)-> -in(B,A)).
% 2.02/2.22 all A (empty(A)->relation(A)).
% 2.02/2.22 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.02/2.22 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.02/2.22 all A (relation(A)-> (all B C (C=relation_image(A,B)<-> (all D (in(D,C)<-> (exists E (in(ordered_pair(E,D),A)&in(E,B)))))))).
% 2.02/2.22 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.02/2.22 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 $T.
% 2.02/2.22 all A exists B element(B,A).
% 2.02/2.22 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 2.02/2.22 empty(empty_set).
% 2.02/2.22 all A B (-empty(ordered_pair(A,B))).
% 2.02/2.22 all A (-empty(singleton(A))).
% 2.02/2.22 all A B (-empty(unordered_pair(A,B))).
% 2.02/2.22 empty(empty_set).
% 2.02/2.22 relation(empty_set).
% 2.02/2.22 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.02/2.22 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.02/2.22 all A B (set_intersection2(A,A)=A).
% 2.02/2.22 exists A (empty(A)&relation(A)).
% 2.02/2.22 exists A empty(A).
% 2.02/2.22 exists A (-empty(A)&relation(A)).
% 2.02/2.22 exists A (-empty(A)).
% 2.02/2.22 all A B C (relation(C)-> (in(A,relation_image(C,B))<-> (exists D (in(D,relation_dom(C))&in(ordered_pair(D,A),C)&in(D,B))))).
% 2.02/2.22 -(all A B (relation(B)->relation_image(B,A)=relation_image(B,set_intersection2(relation_dom(B),A)))).
% 2.02/2.22 all A B (in(A,B)->element(A,B)).
% 2.02/2.22 all A (set_intersection2(A,empty_set)=empty_set).
% 2.02/2.22 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.02/2.22 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.02/2.22 all A (empty(A)->A=empty_set).
% 2.02/2.22 all A B (-(in(A,B)&empty(B))).
% 2.02/2.22 all A B (-(empty(A)&A!=B&empty(B))).
% 2.02/2.22 end_of_list.
% 2.02/2.22
% 2.02/2.22 -------> usable clausifies to:
% 2.02/2.22
% 2.02/2.22 list(usable).
% 2.02/2.22 0 [] A=A.
% 2.02/2.22 0 [] -in(A,B)| -in(B,A).
% 2.02/2.22 0 [] -empty(A)|relation(A).
% 2.02/2.22 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.02/2.22 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.02/2.22 0 [] -relation(A)|C!=relation_image(A,B)| -in(D,C)|in(ordered_pair($f1(A,B,C,D),D),A).
% 2.02/2.22 0 [] -relation(A)|C!=relation_image(A,B)| -in(D,C)|in($f1(A,B,C,D),B).
% 2.02/2.22 0 [] -relation(A)|C!=relation_image(A,B)|in(D,C)| -in(ordered_pair(E,D),A)| -in(E,B).
% 2.02/2.22 0 [] -relation(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|in(ordered_pair($f2(A,B,C),$f3(A,B,C)),A).
% 2.02/2.22 0 [] -relation(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|in($f2(A,B,C),B).
% 2.02/2.22 0 [] -relation(A)|C=relation_image(A,B)| -in($f3(A,B,C),C)| -in(ordered_pair(X1,$f3(A,B,C)),A)| -in(X1,B).
% 2.02/2.22 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.02/2.22 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.02/2.22 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.02/2.22 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A).
% 2.02/2.22 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),B).
% 2.02/2.22 0 [] C=set_intersection2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A)| -in($f4(A,B,C),B).
% 2.02/2.22 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] $T.
% 2.02/2.22 0 [] element($f5(A),A).
% 2.02/2.22 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.02/2.22 0 [] empty(empty_set).
% 2.02/2.22 0 [] -empty(ordered_pair(A,B)).
% 2.02/2.22 0 [] -empty(singleton(A)).
% 2.02/2.22 0 [] -empty(unordered_pair(A,B)).
% 2.02/2.22 0 [] empty(empty_set).
% 2.02/2.22 0 [] relation(empty_set).
% 2.02/2.22 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.02/2.22 0 [] -empty(A)|empty(relation_dom(A)).
% 2.02/2.22 0 [] -empty(A)|relation(relation_dom(A)).
% 2.02/2.22 0 [] set_intersection2(A,A)=A.
% 2.02/2.22 0 [] empty($c1).
% 2.02/2.22 0 [] relation($c1).
% 2.02/2.22 0 [] empty($c2).
% 2.02/2.22 0 [] -empty($c3).
% 2.02/2.22 0 [] relation($c3).
% 2.02/2.22 0 [] -empty($c4).
% 2.02/2.22 0 [] -relation(C)| -in(A,relation_image(C,B))|in($f6(A,B,C),relation_dom(C)).
% 2.02/2.22 0 [] -relation(C)| -in(A,relation_image(C,B))|in(ordered_pair($f6(A,B,C),A),C).
% 2.02/2.23 0 [] -relation(C)| -in(A,relation_image(C,B))|in($f6(A,B,C),B).
% 2.02/2.23 0 [] -relation(C)|in(A,relation_image(C,B))| -in(D,relation_dom(C))| -in(ordered_pair(D,A),C)| -in(D,B).
% 2.02/2.23 0 [] relation($c5).
% 2.02/2.23 0 [] relation_image($c5,$c6)!=relation_image($c5,set_intersection2(relation_dom($c5),$c6)).
% 2.02/2.23 0 [] -in(A,B)|element(A,B).
% 2.02/2.23 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.02/2.23 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.02/2.23 0 [] in($f7(A,B),A)|in($f7(A,B),B)|A=B.
% 2.02/2.23 0 [] -in($f7(A,B),A)| -in($f7(A,B),B)|A=B.
% 2.02/2.23 0 [] -empty(A)|A=empty_set.
% 2.02/2.23 0 [] -in(A,B)| -empty(B).
% 2.02/2.23 0 [] -empty(A)|A=B| -empty(B).
% 2.02/2.23 end_of_list.
% 2.02/2.23
% 2.02/2.23 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.02/2.23
% 2.02/2.23 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.23 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.23 deletion, with positive clauses in sos and nonpositive
% 2.02/2.23 clauses in usable.
% 2.02/2.23
% 2.02/2.23 dependent: set(knuth_bendix).
% 2.02/2.23 dependent: set(anl_eq).
% 2.02/2.23 dependent: set(para_from).
% 2.02/2.23 dependent: set(para_into).
% 2.02/2.23 dependent: clear(para_from_right).
% 2.02/2.23 dependent: clear(para_into_right).
% 2.02/2.23 dependent: set(para_from_vars).
% 2.02/2.23 dependent: set(eq_units_both_ways).
% 2.02/2.23 dependent: set(dynamic_demod_all).
% 2.02/2.23 dependent: set(dynamic_demod).
% 2.02/2.23 dependent: set(order_eq).
% 2.02/2.23 dependent: set(back_demod).
% 2.02/2.23 dependent: set(lrpo).
% 2.02/2.23 dependent: set(hyper_res).
% 2.02/2.23 dependent: set(unit_deletion).
% 2.02/2.23 dependent: set(factor).
% 2.02/2.23
% 2.02/2.23 ------------> process usable:
% 2.02/2.23 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.02/2.23 ** KEPT (pick-wt=4): 2 [] -empty(A)|relation(A).
% 2.02/2.23 ** KEPT (pick-wt=19): 3 [] -relation(A)|B!=relation_image(A,C)| -in(D,B)|in(ordered_pair($f1(A,C,B,D),D),A).
% 2.02/2.23 ** KEPT (pick-wt=17): 4 [] -relation(A)|B!=relation_image(A,C)| -in(D,B)|in($f1(A,C,B,D),C).
% 2.02/2.23 ** KEPT (pick-wt=18): 5 [] -relation(A)|B!=relation_image(A,C)|in(D,B)| -in(ordered_pair(E,D),A)| -in(E,C).
% 2.02/2.23 ** KEPT (pick-wt=24): 6 [] -relation(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|in(ordered_pair($f2(A,C,B),$f3(A,C,B)),A).
% 2.02/2.23 ** KEPT (pick-wt=19): 7 [] -relation(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|in($f2(A,C,B),C).
% 2.02/2.23 ** KEPT (pick-wt=24): 8 [] -relation(A)|B=relation_image(A,C)| -in($f3(A,C,B),B)| -in(ordered_pair(D,$f3(A,C,B)),A)| -in(D,C).
% 2.02/2.23 ** KEPT (pick-wt=11): 9 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.02/2.23 ** KEPT (pick-wt=11): 10 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.02/2.23 ** KEPT (pick-wt=14): 11 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.02/2.23 ** KEPT (pick-wt=23): 12 [] A=set_intersection2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B)| -in($f4(B,C,A),C).
% 2.02/2.23 ** KEPT (pick-wt=8): 13 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.02/2.23 ** KEPT (pick-wt=4): 14 [] -empty(ordered_pair(A,B)).
% 2.02/2.23 ** KEPT (pick-wt=3): 15 [] -empty(singleton(A)).
% 2.02/2.23 ** KEPT (pick-wt=4): 16 [] -empty(unordered_pair(A,B)).
% 2.02/2.23 ** KEPT (pick-wt=7): 17 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.02/2.23 ** KEPT (pick-wt=5): 18 [] -empty(A)|empty(relation_dom(A)).
% 2.02/2.23 ** KEPT (pick-wt=5): 19 [] -empty(A)|relation(relation_dom(A)).
% 2.02/2.23 ** KEPT (pick-wt=2): 20 [] -empty($c3).
% 2.02/2.23 ** KEPT (pick-wt=2): 21 [] -empty($c4).
% 2.02/2.23 ** KEPT (pick-wt=14): 22 [] -relation(A)| -in(B,relation_image(A,C))|in($f6(B,C,A),relation_dom(A)).
% 2.02/2.23 ** KEPT (pick-wt=15): 23 [] -relation(A)| -in(B,relation_image(A,C))|in(ordered_pair($f6(B,C,A),B),A).
% 2.02/2.23 ** KEPT (pick-wt=13): 24 [] -relation(A)| -in(B,relation_image(A,C))|in($f6(B,C,A),C).
% 2.02/2.23 ** KEPT (pick-wt=19): 25 [] -relation(A)|in(B,relation_image(A,C))| -in(D,relation_dom(A))| -in(ordered_pair(D,B),A)| -in(D,C).
% 2.02/2.23 ** KEPT (pick-wt=10): 27 [copy,26,flip.1] relation_image($c5,set_intersection2(relation_dom($c5),$c6))!=relation_image($c5,$c6).
% 2.02/2.23 ** KEPT (pick-wt=6): 28 [] -in(A,B)|element(A,B).
% 2.02/2.23 ** KEPT (pick-wt=8): 29 [] -element(A,B)|empty(B)|in(A,B).
% 2.02/2.23 ** KEPT (pick-wt=13): 30 [] -in($f7(A,B),A)| -in($f7(A,B),B)|A=B.
% 2.02/2.23 ** KEPT (pick-wt=5): 31 [] -empty(A)|A=empty_set.
% 2.02/2.23 ** KEPT (pick-wt=5): 32 [] -in(A,B)| -empty(B).
% 2.02/2.23 ** KEPT (pick-wt=7): 33 [] -empty(A)|A=B| -empty(B).
% 2.02/2.23
% 2.02/2.23 ------------> process sos:
% 2.02/2.23 ** KEPT (pick-wt=3): 45 [] A=A.
% 2.02/2.23 ** KEPT (pick-wt=7): 46 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.02/2.23 ** KEPT (pick-wt=7): 47 [] set_intersection2(A,B)=set_intersection2(B,A).
% 122.32/122.52 ** KEPT (pick-wt=17): 48 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B).
% 122.32/122.52 ** KEPT (pick-wt=17): 49 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),C).
% 122.32/122.52 ** KEPT (pick-wt=10): 51 [copy,50,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 122.32/122.52 ---> New Demodulator: 52 [new_demod,51] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 122.32/122.52 ** KEPT (pick-wt=4): 53 [] element($f5(A),A).
% 122.32/122.52 ** KEPT (pick-wt=2): 54 [] empty(empty_set).
% 122.32/122.52 Following clause subsumed by 54 during input processing: 0 [] empty(empty_set).
% 122.32/122.52 ** KEPT (pick-wt=2): 55 [] relation(empty_set).
% 122.32/122.52 ** KEPT (pick-wt=5): 56 [] set_intersection2(A,A)=A.
% 122.32/122.52 ---> New Demodulator: 57 [new_demod,56] set_intersection2(A,A)=A.
% 122.32/122.52 ** KEPT (pick-wt=2): 58 [] empty($c1).
% 122.32/122.52 ** KEPT (pick-wt=2): 59 [] relation($c1).
% 122.32/122.52 ** KEPT (pick-wt=2): 60 [] empty($c2).
% 122.32/122.52 ** KEPT (pick-wt=2): 61 [] relation($c3).
% 122.32/122.52 ** KEPT (pick-wt=2): 62 [] relation($c5).
% 122.32/122.52 ** KEPT (pick-wt=5): 63 [] set_intersection2(A,empty_set)=empty_set.
% 122.32/122.52 ---> New Demodulator: 64 [new_demod,63] set_intersection2(A,empty_set)=empty_set.
% 122.32/122.52 ** KEPT (pick-wt=13): 65 [] in($f7(A,B),A)|in($f7(A,B),B)|A=B.
% 122.32/122.52 Following clause subsumed by 45 during input processing: 0 [copy,45,flip.1] A=A.
% 122.32/122.52 45 back subsumes 43.
% 122.32/122.52 45 back subsumes 42.
% 122.32/122.52 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 122.32/122.52 Following clause subsumed by 47 during input processing: 0 [copy,47,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 122.32/122.52 >>>> Starting back demodulation with 52.
% 122.32/122.52 >>>> Starting back demodulation with 57.
% 122.32/122.52 >> back demodulating 44 with 57.
% 122.32/122.52 >> back demodulating 40 with 57.
% 122.32/122.52 >> back demodulating 39 with 57.
% 122.32/122.52 >> back demodulating 36 with 57.
% 122.32/122.52 >>>> Starting back demodulation with 64.
% 122.32/122.52
% 122.32/122.52 ======= end of input processing =======
% 122.32/122.52
% 122.32/122.52 =========== start of search ===========
% 122.32/122.52
% 122.32/122.52
% 122.32/122.52 Resetting weight limit to 10.
% 122.32/122.52
% 122.32/122.52
% 122.32/122.52 Resetting weight limit to 10.
% 122.32/122.52
% 122.32/122.52 sos_size=363
% 122.32/122.52
% 122.32/122.52
% 122.32/122.52 Resetting weight limit to 7.
% 122.32/122.52
% 122.32/122.52
% 122.32/122.52 Resetting weight limit to 7.
% 122.32/122.52
% 122.32/122.52 sos_size=375
% 122.32/122.52
% 122.32/122.52 Search stopped because sos empty.
% 122.32/122.52
% 122.32/122.52
% 122.32/122.52 Search stopped because sos empty.
% 122.32/122.52
% 122.32/122.52 ============ end of search ============
% 122.32/122.52
% 122.32/122.52 -------------- statistics -------------
% 122.32/122.52 clauses given 499
% 122.32/122.52 clauses generated 1563581
% 122.32/122.52 clauses kept 647
% 122.32/122.52 clauses forward subsumed 4439
% 122.32/122.52 clauses back subsumed 22
% 122.32/122.52 Kbytes malloced 7812
% 122.32/122.52
% 122.32/122.52 ----------- times (seconds) -----------
% 122.32/122.52 user CPU time 120.28 (0 hr, 2 min, 0 sec)
% 122.32/122.52 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 122.32/122.52 wall-clock time 122 (0 hr, 2 min, 2 sec)
% 122.32/122.52
% 122.32/122.52 Process 30685 finished Wed Jul 27 07:44:17 2022
% 122.32/122.52 Otter interrupted
% 122.32/122.52 PROOF NOT FOUND
%------------------------------------------------------------------------------