TSTP Solution File: SEU191+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU191+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:06 EDT 2022
% Result : Unknown 26.32s 26.49s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU191+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:04:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.09/2.23 ----- Otter 3.3f, August 2004 -----
% 2.09/2.23 The process was started by sandbox on n015.cluster.edu,
% 2.09/2.23 Wed Jul 27 08:04:12 2022
% 2.09/2.23 The command was "./otter". The process ID is 14095.
% 2.09/2.23
% 2.09/2.23 set(prolog_style_variables).
% 2.09/2.23 set(auto).
% 2.09/2.23 dependent: set(auto1).
% 2.09/2.23 dependent: set(process_input).
% 2.09/2.23 dependent: clear(print_kept).
% 2.09/2.23 dependent: clear(print_new_demod).
% 2.09/2.23 dependent: clear(print_back_demod).
% 2.09/2.23 dependent: clear(print_back_sub).
% 2.09/2.23 dependent: set(control_memory).
% 2.09/2.23 dependent: assign(max_mem, 12000).
% 2.09/2.23 dependent: assign(pick_given_ratio, 4).
% 2.09/2.23 dependent: assign(stats_level, 1).
% 2.09/2.23 dependent: assign(max_seconds, 10800).
% 2.09/2.23 clear(print_given).
% 2.09/2.23
% 2.09/2.23 formula_list(usable).
% 2.09/2.23 all A (A=A).
% 2.09/2.23 all A B (in(A,B)-> -in(B,A)).
% 2.09/2.23 all A (empty(A)->relation(A)).
% 2.09/2.23 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.09/2.23 all A B (relation(B)-> (B=identity_relation(A)<-> (all C D (in(ordered_pair(C,D),B)<->in(C,A)&C=D)))).
% 2.09/2.23 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.09/2.23 all A (relation(A)-> (all B (relation(B)-> (all C (relation(C)-> (C=relation_composition(A,B)<-> (all D E (in(ordered_pair(D,E),C)<-> (exists F (in(ordered_pair(D,F),A)&in(ordered_pair(F,E),B))))))))))).
% 2.09/2.23 $T.
% 2.09/2.23 $T.
% 2.09/2.23 $T.
% 2.09/2.23 $T.
% 2.09/2.23 all A B (relation(A)&relation(B)->relation(relation_composition(A,B))).
% 2.09/2.23 all A relation(identity_relation(A)).
% 2.09/2.23 $T.
% 2.09/2.23 all A exists B element(B,A).
% 2.09/2.23 all A B (empty(A)&relation(B)->empty(relation_composition(B,A))&relation(relation_composition(B,A))).
% 2.09/2.23 empty(empty_set).
% 2.09/2.23 all A B (-empty(ordered_pair(A,B))).
% 2.09/2.23 all A (-empty(singleton(A))).
% 2.09/2.23 all A B (-empty(unordered_pair(A,B))).
% 2.09/2.23 empty(empty_set).
% 2.09/2.23 relation(empty_set).
% 2.09/2.23 all A B (empty(A)&relation(B)->empty(relation_composition(A,B))&relation(relation_composition(A,B))).
% 2.09/2.23 exists A (empty(A)&relation(A)).
% 2.09/2.23 exists A empty(A).
% 2.09/2.23 exists A (-empty(A)&relation(A)).
% 2.09/2.23 exists A (-empty(A)).
% 2.09/2.23 all A B (in(A,B)->element(A,B)).
% 2.09/2.23 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.09/2.23 all A (empty(A)->A=empty_set).
% 2.09/2.23 -(all A B C D (relation(D)-> (in(ordered_pair(A,B),relation_composition(identity_relation(C),D))<->in(A,C)&in(ordered_pair(A,B),D)))).
% 2.09/2.23 all A B (-(in(A,B)&empty(B))).
% 2.09/2.23 all A B (-(empty(A)&A!=B&empty(B))).
% 2.09/2.23 end_of_list.
% 2.09/2.23
% 2.09/2.23 -------> usable clausifies to:
% 2.09/2.23
% 2.09/2.23 list(usable).
% 2.09/2.23 0 [] A=A.
% 2.09/2.23 0 [] -in(A,B)| -in(B,A).
% 2.09/2.23 0 [] -empty(A)|relation(A).
% 2.09/2.23 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.09/2.23 0 [] -relation(B)|B!=identity_relation(A)| -in(ordered_pair(C,D),B)|in(C,A).
% 2.09/2.23 0 [] -relation(B)|B!=identity_relation(A)| -in(ordered_pair(C,D),B)|C=D.
% 2.09/2.23 0 [] -relation(B)|B!=identity_relation(A)|in(ordered_pair(C,D),B)| -in(C,A)|C!=D.
% 2.09/2.23 0 [] -relation(B)|B=identity_relation(A)|in(ordered_pair($f2(A,B),$f1(A,B)),B)|in($f2(A,B),A).
% 2.09/2.23 0 [] -relation(B)|B=identity_relation(A)|in(ordered_pair($f2(A,B),$f1(A,B)),B)|$f2(A,B)=$f1(A,B).
% 2.09/2.23 0 [] -relation(B)|B=identity_relation(A)| -in(ordered_pair($f2(A,B),$f1(A,B)),B)| -in($f2(A,B),A)|$f2(A,B)!=$f1(A,B).
% 2.09/2.23 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.09/2.23 0 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,$f3(A,B,C,D,E)),A).
% 2.09/2.23 0 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair($f3(A,B,C,D,E),E),B).
% 2.09/2.23 0 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)|in(ordered_pair(D,E),C)| -in(ordered_pair(D,F),A)| -in(ordered_pair(F,E),B).
% 2.09/2.23 0 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f6(A,B,C),$f5(A,B,C)),C)|in(ordered_pair($f6(A,B,C),$f4(A,B,C)),A).
% 2.09/2.23 0 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f6(A,B,C),$f5(A,B,C)),C)|in(ordered_pair($f4(A,B,C),$f5(A,B,C)),B).
% 2.09/2.23 0 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)| -in(ordered_pair($f6(A,B,C),$f5(A,B,C)),C)| -in(ordered_pair($f6(A,B,C),X1),A)| -in(ordered_pair(X1,$f5(A,B,C)),B).
% 2.09/2.23 0 [] $T.
% 2.09/2.23 0 [] $T.
% 2.09/2.23 0 [] $T.
% 2.09/2.23 0 [] $T.
% 2.09/2.23 0 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.09/2.23 0 [] relation(identity_relation(A)).
% 2.09/2.23 0 [] $T.
% 2.09/2.23 0 [] element($f7(A),A).
% 2.09/2.23 0 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 2.09/2.23 0 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 2.09/2.24 0 [] empty(empty_set).
% 2.09/2.24 0 [] -empty(ordered_pair(A,B)).
% 2.09/2.24 0 [] -empty(singleton(A)).
% 2.09/2.24 0 [] -empty(unordered_pair(A,B)).
% 2.09/2.24 0 [] empty(empty_set).
% 2.09/2.24 0 [] relation(empty_set).
% 2.09/2.24 0 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 2.09/2.24 0 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.09/2.24 0 [] empty($c1).
% 2.09/2.24 0 [] relation($c1).
% 2.09/2.24 0 [] empty($c2).
% 2.09/2.24 0 [] -empty($c3).
% 2.09/2.24 0 [] relation($c3).
% 2.09/2.24 0 [] -empty($c4).
% 2.09/2.24 0 [] -in(A,B)|element(A,B).
% 2.09/2.24 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.09/2.24 0 [] -empty(A)|A=empty_set.
% 2.09/2.24 0 [] relation($c5).
% 2.09/2.24 0 [] in(ordered_pair($c8,$c7),relation_composition(identity_relation($c6),$c5))|in($c8,$c6).
% 2.09/2.24 0 [] in(ordered_pair($c8,$c7),relation_composition(identity_relation($c6),$c5))|in(ordered_pair($c8,$c7),$c5).
% 2.09/2.24 0 [] -in(ordered_pair($c8,$c7),relation_composition(identity_relation($c6),$c5))| -in($c8,$c6)| -in(ordered_pair($c8,$c7),$c5).
% 2.09/2.24 0 [] -in(A,B)| -empty(B).
% 2.09/2.24 0 [] -empty(A)|A=B| -empty(B).
% 2.09/2.24 end_of_list.
% 2.09/2.24
% 2.09/2.24 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.09/2.24
% 2.09/2.24 This ia a non-Horn set with equality. The strategy will be
% 2.09/2.24 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.09/2.24 deletion, with positive clauses in sos and nonpositive
% 2.09/2.24 clauses in usable.
% 2.09/2.24
% 2.09/2.24 dependent: set(knuth_bendix).
% 2.09/2.24 dependent: set(anl_eq).
% 2.09/2.24 dependent: set(para_from).
% 2.09/2.24 dependent: set(para_into).
% 2.09/2.24 dependent: clear(para_from_right).
% 2.09/2.24 dependent: clear(para_into_right).
% 2.09/2.24 dependent: set(para_from_vars).
% 2.09/2.24 dependent: set(eq_units_both_ways).
% 2.09/2.24 dependent: set(dynamic_demod_all).
% 2.09/2.24 dependent: set(dynamic_demod).
% 2.09/2.24 dependent: set(order_eq).
% 2.09/2.24 dependent: set(back_demod).
% 2.09/2.24 dependent: set(lrpo).
% 2.09/2.24 dependent: set(hyper_res).
% 2.09/2.24 dependent: set(unit_deletion).
% 2.09/2.24 dependent: set(factor).
% 2.09/2.24
% 2.09/2.24 ------------> process usable:
% 2.09/2.24 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.09/2.24 ** KEPT (pick-wt=4): 2 [] -empty(A)|relation(A).
% 2.09/2.24 ** KEPT (pick-wt=14): 3 [] -relation(A)|A!=identity_relation(B)| -in(ordered_pair(C,D),A)|in(C,B).
% 2.09/2.24 ** KEPT (pick-wt=14): 4 [] -relation(A)|A!=identity_relation(B)| -in(ordered_pair(C,D),A)|C=D.
% 2.09/2.24 ** KEPT (pick-wt=17): 5 [] -relation(A)|A!=identity_relation(B)|in(ordered_pair(C,D),A)| -in(C,B)|C!=D.
% 2.09/2.24 ** KEPT (pick-wt=20): 6 [] -relation(A)|A=identity_relation(B)|in(ordered_pair($f2(B,A),$f1(B,A)),A)|in($f2(B,A),B).
% 2.09/2.24 ** KEPT (pick-wt=22): 7 [] -relation(A)|A=identity_relation(B)|in(ordered_pair($f2(B,A),$f1(B,A)),A)|$f2(B,A)=$f1(B,A).
% 2.09/2.24 ** KEPT (pick-wt=27): 8 [] -relation(A)|A=identity_relation(B)| -in(ordered_pair($f2(B,A),$f1(B,A)),A)| -in($f2(B,A),B)|$f2(B,A)!=$f1(B,A).
% 2.09/2.24 ** KEPT (pick-wt=26): 9 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,$f3(A,B,C,D,E)),A).
% 2.09/2.24 ** KEPT (pick-wt=26): 10 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair($f3(A,B,C,D,E),E),B).
% 2.09/2.24 ** KEPT (pick-wt=26): 11 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)|in(ordered_pair(D,E),C)| -in(ordered_pair(D,F),A)| -in(ordered_pair(F,E),B).
% 2.09/2.24 ** KEPT (pick-wt=33): 12 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f6(A,B,C),$f5(A,B,C)),C)|in(ordered_pair($f6(A,B,C),$f4(A,B,C)),A).
% 2.09/2.24 ** KEPT (pick-wt=33): 13 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f6(A,B,C),$f5(A,B,C)),C)|in(ordered_pair($f4(A,B,C),$f5(A,B,C)),B).
% 2.09/2.24 ** KEPT (pick-wt=38): 14 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)| -in(ordered_pair($f6(A,B,C),$f5(A,B,C)),C)| -in(ordered_pair($f6(A,B,C),D),A)| -in(ordered_pair(D,$f5(A,B,C)),B).
% 2.09/2.24 ** KEPT (pick-wt=8): 15 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.09/2.24 ** KEPT (pick-wt=8): 16 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 2.09/2.24 ** KEPT (pick-wt=8): 17 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 2.09/2.24 ** KEPT (pick-wt=4): 18 [] -empty(ordered_pair(A,B)).
% 2.09/2.24 ** KEPT (pick-wt=3): 19 [] -empty(singleton(A)).
% 2.09/2.24 ** KEPT (pick-wt=4): 20 [] -empty(unordered_pair(A,B)).
% 2.09/2.24 ** KEPT (pick-wt=8): 21 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 26.32/26.48 ** KEPT (pick-wt=8): 22 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 26.32/26.48 ** KEPT (pick-wt=2): 23 [] -empty($c3).
% 26.32/26.48 ** KEPT (pick-wt=2): 24 [] -empty($c4).
% 26.32/26.48 ** KEPT (pick-wt=6): 25 [] -in(A,B)|element(A,B).
% 26.32/26.48 ** KEPT (pick-wt=8): 26 [] -element(A,B)|empty(B)|in(A,B).
% 26.32/26.48 ** KEPT (pick-wt=5): 27 [] -empty(A)|A=empty_set.
% 26.32/26.48 ** KEPT (pick-wt=16): 28 [] -in(ordered_pair($c8,$c7),relation_composition(identity_relation($c6),$c5))| -in($c8,$c6)| -in(ordered_pair($c8,$c7),$c5).
% 26.32/26.48 ** KEPT (pick-wt=5): 29 [] -in(A,B)| -empty(B).
% 26.32/26.48 ** KEPT (pick-wt=7): 30 [] -empty(A)|A=B| -empty(B).
% 26.32/26.48
% 26.32/26.48 ------------> process sos:
% 26.32/26.48 ** KEPT (pick-wt=3): 64 [] A=A.
% 26.32/26.48 ** KEPT (pick-wt=7): 65 [] unordered_pair(A,B)=unordered_pair(B,A).
% 26.32/26.48 ** KEPT (pick-wt=10): 67 [copy,66,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 26.32/26.48 ---> New Demodulator: 68 [new_demod,67] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 26.32/26.48 ** KEPT (pick-wt=3): 69 [] relation(identity_relation(A)).
% 26.32/26.48 ** KEPT (pick-wt=4): 70 [] element($f7(A),A).
% 26.32/26.48 ** KEPT (pick-wt=2): 71 [] empty(empty_set).
% 26.32/26.48 Following clause subsumed by 71 during input processing: 0 [] empty(empty_set).
% 26.32/26.48 ** KEPT (pick-wt=2): 72 [] relation(empty_set).
% 26.32/26.48 ** KEPT (pick-wt=2): 73 [] empty($c1).
% 26.32/26.48 ** KEPT (pick-wt=2): 74 [] relation($c1).
% 26.32/26.48 ** KEPT (pick-wt=2): 75 [] empty($c2).
% 26.32/26.48 ** KEPT (pick-wt=2): 76 [] relation($c3).
% 26.32/26.48 ** KEPT (pick-wt=2): 77 [] relation($c5).
% 26.32/26.48 ** KEPT (pick-wt=11): 78 [] in(ordered_pair($c8,$c7),relation_composition(identity_relation($c6),$c5))|in($c8,$c6).
% 26.32/26.48 ** KEPT (pick-wt=13): 79 [] in(ordered_pair($c8,$c7),relation_composition(identity_relation($c6),$c5))|in(ordered_pair($c8,$c7),$c5).
% 26.32/26.48 Following clause subsumed by 64 during input processing: 0 [copy,64,flip.1] A=A.
% 26.32/26.48 64 back subsumes 55.
% 26.32/26.48 Following clause subsumed by 65 during input processing: 0 [copy,65,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 26.32/26.48 >>>> Starting back demodulation with 68.
% 26.32/26.48
% 26.32/26.48 ======= end of input processing =======
% 26.32/26.48
% 26.32/26.48 =========== start of search ===========
% 26.32/26.48
% 26.32/26.48
% 26.32/26.48 Resetting weight limit to 7.
% 26.32/26.48
% 26.32/26.48
% 26.32/26.48 Resetting weight limit to 7.
% 26.32/26.48
% 26.32/26.48 sos_size=668
% 26.32/26.48
% 26.32/26.48
% 26.32/26.48 Resetting weight limit to 6.
% 26.32/26.48
% 26.32/26.48
% 26.32/26.48 Resetting weight limit to 6.
% 26.32/26.48
% 26.32/26.48 sos_size=510
% 26.32/26.48
% 26.32/26.48 Search stopped because sos empty.
% 26.32/26.48
% 26.32/26.48
% 26.32/26.48 Search stopped because sos empty.
% 26.32/26.48
% 26.32/26.48 ============ end of search ============
% 26.32/26.48
% 26.32/26.48 -------------- statistics -------------
% 26.32/26.48 clauses given 544
% 26.32/26.48 clauses generated 554026
% 26.32/26.48 clauses kept 889
% 26.32/26.48 clauses forward subsumed 1344
% 26.32/26.48 clauses back subsumed 16
% 26.32/26.48 Kbytes malloced 8789
% 26.32/26.48
% 26.32/26.48 ----------- times (seconds) -----------
% 26.32/26.48 user CPU time 24.25 (0 hr, 0 min, 24 sec)
% 26.32/26.48 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 26.32/26.48 wall-clock time 26 (0 hr, 0 min, 26 sec)
% 26.32/26.48
% 26.32/26.48 Process 14095 finished Wed Jul 27 08:04:38 2022
% 26.32/26.48 Otter interrupted
% 26.32/26.48 PROOF NOT FOUND
%------------------------------------------------------------------------------