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

View Problem - Process Solution

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

% Computer : n019.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:22 EDT 2022

% Result   : Unknown 3.36s 3.50s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU262+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n019.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:07:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.77/1.96  ----- Otter 3.3f, August 2004 -----
% 1.77/1.96  The process was started by sandbox on n019.cluster.edu,
% 1.77/1.96  Wed Jul 27 08:07:07 2022
% 1.77/1.96  The command was "./otter".  The process ID is 13526.
% 1.77/1.96  
% 1.77/1.96  set(prolog_style_variables).
% 1.77/1.96  set(auto).
% 1.77/1.96     dependent: set(auto1).
% 1.77/1.96     dependent: set(process_input).
% 1.77/1.96     dependent: clear(print_kept).
% 1.77/1.96     dependent: clear(print_new_demod).
% 1.77/1.96     dependent: clear(print_back_demod).
% 1.77/1.96     dependent: clear(print_back_sub).
% 1.77/1.96     dependent: set(control_memory).
% 1.77/1.96     dependent: assign(max_mem, 12000).
% 1.77/1.96     dependent: assign(pick_given_ratio, 4).
% 1.77/1.96     dependent: assign(stats_level, 1).
% 1.77/1.96     dependent: assign(max_seconds, 10800).
% 1.77/1.96  clear(print_given).
% 1.77/1.96  
% 1.77/1.96  formula_list(usable).
% 1.77/1.96  all A (A=A).
% 1.77/1.96  all A B (in(A,B)-> -in(B,A)).
% 1.77/1.96  all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.77/1.96  all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.77/1.96  all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.77/1.96  all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 1.77/1.96  all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 1.77/1.96  all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  $T.
% 1.77/1.96  all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.77/1.96  all A B exists C relation_of2(C,A,B).
% 1.77/1.96  all A exists B element(B,A).
% 1.77/1.96  all A B exists C relation_of2_as_subset(C,A,B).
% 1.77/1.96  empty(empty_set).
% 1.77/1.96  all A B (-empty(ordered_pair(A,B))).
% 1.77/1.96  exists A empty(A).
% 1.77/1.96  exists A (-empty(A)).
% 1.77/1.96  all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.77/1.96  all A B subset(A,A).
% 1.77/1.96  all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.77/1.96  -(all A B C (relation_of2_as_subset(C,A,B)->subset(relation_dom(C),A)&subset(relation_rng(C),B))).
% 1.77/1.96  all A B (in(A,B)->element(A,B)).
% 1.77/1.96  all A B (element(A,B)->empty(B)|in(A,B)).
% 1.77/1.96  all A B (element(A,powerset(B))<->subset(A,B)).
% 1.77/1.96  all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.77/1.96  all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.77/1.96  all A (empty(A)->A=empty_set).
% 1.77/1.96  all A B (-(in(A,B)&empty(B))).
% 1.77/1.96  all A B (-(empty(A)&A!=B&empty(B))).
% 1.77/1.96  end_of_list.
% 1.77/1.96  
% 1.77/1.96  -------> usable clausifies to:
% 1.77/1.96  
% 1.77/1.96  list(usable).
% 1.77/1.96  0 [] A=A.
% 1.77/1.96  0 [] -in(A,B)| -in(B,A).
% 1.77/1.96  0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.77/1.96  0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.77/1.96  0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.77/1.96  0 [] subset(A,B)|in($f1(A,B),A).
% 1.77/1.96  0 [] subset(A,B)| -in($f1(A,B),B).
% 1.77/1.96  0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f2(A,B,C)),A).
% 1.77/1.96  0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 1.77/1.96  0 [] -relation(A)|B=relation_dom(A)|in($f4(A,B),B)|in(ordered_pair($f4(A,B),$f3(A,B)),A).
% 1.77/1.96  0 [] -relation(A)|B=relation_dom(A)| -in($f4(A,B),B)| -in(ordered_pair($f4(A,B),X1),A).
% 1.77/1.96  0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f5(A,B,C),C),A).
% 1.77/1.96  0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.77/1.96  0 [] -relation(A)|B=relation_rng(A)|in($f7(A,B),B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 1.77/1.96  0 [] -relation(A)|B=relation_rng(A)| -in($f7(A,B),B)| -in(ordered_pair(X2,$f7(A,B)),A).
% 1.77/1.96  0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] $T.
% 1.77/1.96  0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.77/1.96  0 [] relation_of2($f8(A,B),A,B).
% 1.77/1.96  0 [] element($f9(A),A).
% 1.77/1.96  0 [] relation_of2_as_subset($f10(A,B),A,B).
% 1.77/1.96  0 [] empty(empty_set).
% 1.77/1.96  0 [] -empty(ordered_pair(A,B)).
% 1.77/1.96  0 [] empty($c1).
% 1.77/1.96  0 [] -empty($c2).
% 1.77/1.96  0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.77/1.96  0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.77/1.96  0 [] subset(A,A).
% 1.77/1.96  0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.77/1.96  0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.77/1.96  0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.77/1.96  0 [] relation_of2_as_subset($c3,$c5,$c4).
% 1.77/1.96  0 [] -subset(relation_dom($c3),$c5)| -subset(relation_rng($c3),$c4).
% 1.77/1.96  0 [] -in(A,B)|element(A,B).
% 1.77/1.96  0 [] -element(A,B)|empty(B)|in(A,B).
% 1.77/1.96  0 [] -element(A,powerset(B))|subset(A,B).
% 1.77/1.96  0 [] element(A,powerset(B))| -subset(A,B).
% 1.77/1.96  0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.77/1.96  0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.77/1.96  0 [] -empty(A)|A=empty_set.
% 1.77/1.96  0 [] -in(A,B)| -empty(B).
% 1.77/1.96  0 [] -empty(A)|A=B| -empty(B).
% 1.77/1.96  end_of_list.
% 1.77/1.96  
% 1.77/1.96  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.77/1.96  
% 1.77/1.96  This ia a non-Horn set with equality.  The strategy will be
% 1.77/1.96  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.96  deletion, with positive clauses in sos and nonpositive
% 1.77/1.96  clauses in usable.
% 1.77/1.96  
% 1.77/1.96     dependent: set(knuth_bendix).
% 1.77/1.96     dependent: set(anl_eq).
% 1.77/1.96     dependent: set(para_from).
% 1.77/1.96     dependent: set(para_into).
% 1.77/1.96     dependent: clear(para_from_right).
% 1.77/1.96     dependent: clear(para_into_right).
% 1.77/1.96     dependent: set(para_from_vars).
% 1.77/1.96     dependent: set(eq_units_both_ways).
% 1.77/1.96     dependent: set(dynamic_demod_all).
% 1.77/1.96     dependent: set(dynamic_demod).
% 1.77/1.96     dependent: set(order_eq).
% 1.77/1.96     dependent: set(back_demod).
% 1.77/1.96     dependent: set(lrpo).
% 1.77/1.96     dependent: set(hyper_res).
% 1.77/1.96     dependent: set(unit_deletion).
% 1.77/1.96     dependent: set(factor).
% 1.77/1.96  
% 1.77/1.96  ------------> process usable:
% 1.77/1.96  ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.77/1.96  ** KEPT (pick-wt=8): 2 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.77/1.96  ** KEPT (pick-wt=9): 3 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.77/1.96  ** KEPT (pick-wt=8): 4 [] subset(A,B)| -in($f1(A,B),B).
% 1.77/1.96  ** KEPT (pick-wt=17): 5 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f2(A,B,C)),A).
% 1.77/1.96  ** KEPT (pick-wt=14): 6 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 1.77/1.96  ** KEPT (pick-wt=20): 7 [] -relation(A)|B=relation_dom(A)|in($f4(A,B),B)|in(ordered_pair($f4(A,B),$f3(A,B)),A).
% 1.77/1.96  ** KEPT (pick-wt=18): 8 [] -relation(A)|B=relation_dom(A)| -in($f4(A,B),B)| -in(ordered_pair($f4(A,B),C),A).
% 1.77/1.96  ** KEPT (pick-wt=17): 9 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f5(A,B,C),C),A).
% 1.77/1.96  ** KEPT (pick-wt=14): 10 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.77/1.96  ** KEPT (pick-wt=20): 11 [] -relation(A)|B=relation_rng(A)|in($f7(A,B),B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 1.77/1.96  ** KEPT (pick-wt=18): 12 [] -relation(A)|B=relation_rng(A)| -in($f7(A,B),B)| -in(ordered_pair(C,$f7(A,B)),A).
% 1.77/1.96  ** KEPT (pick-wt=10): 13 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.77/1.96  ** KEPT (pick-wt=4): 14 [] -empty(ordered_pair(A,B)).
% 1.77/1.96  ** KEPT (pick-wt=2): 15 [] -empty($c2).
% 1.77/1.96  ** KEPT (pick-wt=8): 16 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 1.77/1.96  ** KEPT (pick-wt=8): 17 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 1.77/1.96  ** KEPT (pick-wt=10): 18 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.77/1.96  ** KEPT (pick-wt=10): 19 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.77/1.96  ** KEPT (pick-wt=13): 20 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.77/1.96  ** KEPT (pick-wt=8): 21 [] -subset(relation_dom($c3),$c5)| -subset(relation_rng($c3),$c4).
% 1.77/1.96  ** KEPT (pick-wt=6): 22 [] -in(A,B)|element(A,B).
% 1.77/1.96  ** KEPT (pick-wt=8): 23 [] -element(A,B)|empty(B)|in(A,B).
% 1.77/1.96  ** KEPT (pick-wt=7): 24 [] -element(A,powerset(B))|subset(A,B).
% 1.77/1.96  ** KEPT (pick-wt=7): 25 [] element(A,powerset(B))| -subset(A,B).
% 1.77/1.96  ** KEPT (pick-wt=10): 26 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.77/1.96  ** KEPT (pick-wt=9): 27 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.77/1.96  ** KEPT (pick-wt=5): 28 [] -empty(A)|A=empty_set.
% 1.77/1.96  ** KEPT (pick-wt=5): 29 [] -in(A,B)| -empty(B).
% 1.77/1.96  ** KEPT (pick-wt=7): 30 [] -empty(A)|A=B| -empty(B).
% 1.77/1.96  
% 1.77/1.96  ------------> process sos:
% 1.77/1.96  ** KEPT (pick-wt=3): 34 [] A=A.
% 1.77/1.96  ** KEPT (pick-wt=7): 35 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.77/1.96  ** KEPT (pick-wt=8): 36 [] subset(A,B)|in($f1(A,B),A).
% 1.77/1.96  ** KEPT (pick-wt=10): 38 [copy,37,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.77/1.96  ---> New Demodulator: 39 [new_demod,38] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.77/1.96  ** KEPT (pick-wt=6): 40 [] relation_of2($f8(A,B),A,B).
% 1.77/1.96  ** KEPT (pick-wt=4): 41 [] element($f9(A),A).
% 1.77/1.96  ** KEPT (pick-wt=6): 42 [] relation_of2_as_subset($f10(A,B),A,B).
% 1.77/1.96  ** KEPT (pick-wt=2): 43 [] empty(empty_set).
% 1.77/1.96  ** KEPT (pick-wt=2): 44 [] empty($c1).
% 1.77/1.96  ** KEPT (pick-wt=3): 45 [] subset(A,A).
% 1.77/1.96  ** KEPT (pick-wt=4): 46 [] relation_of2_as_subset($c3,$c5,$c4).
% 3.32/3.50    Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A.
% 3.32/3.50  34 back subsumes 33.
% 3.32/3.50    Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 3.32/3.50  >>>> Starting back demodulation with 39.
% 3.32/3.50  
% 3.32/3.50  ======= end of input processing =======
% 3.32/3.50  
% 3.32/3.50  =========== start of search ===========
% 3.32/3.50  
% 3.32/3.50  
% 3.32/3.50  Resetting weight limit to 7.
% 3.32/3.50  
% 3.32/3.50  
% 3.32/3.50  Resetting weight limit to 7.
% 3.32/3.50  
% 3.32/3.50  sos_size=314
% 3.32/3.50  
% 3.32/3.50  Search stopped because sos empty.
% 3.32/3.50  
% 3.32/3.50  
% 3.32/3.50  Search stopped because sos empty.
% 3.32/3.50  
% 3.32/3.50  ============ end of search ============
% 3.32/3.50  
% 3.32/3.50  -------------- statistics -------------
% 3.32/3.50  clauses given                382
% 3.32/3.50  clauses generated          92580
% 3.32/3.50  clauses kept                 423
% 3.32/3.50  clauses forward subsumed     413
% 3.32/3.50  clauses back subsumed         22
% 3.32/3.50  Kbytes malloced             6835
% 3.32/3.50  
% 3.32/3.50  ----------- times (seconds) -----------
% 3.32/3.50  user CPU time          1.54          (0 hr, 0 min, 1 sec)
% 3.32/3.50  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 3.32/3.50  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 3.32/3.50  
% 3.32/3.50  Process 13526 finished Wed Jul 27 08:07:10 2022
% 3.32/3.50  Otter interrupted
% 3.32/3.50  PROOF NOT FOUND
%------------------------------------------------------------------------------