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