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