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