TSTP Solution File: SEU248+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SEU248+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n012.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:20 EDT 2022

% Result   : Unknown 5.20s 5.39s
% Output   : None 
% Verified : 
% SZS Type : -

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