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

View Problem - Process Solution

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

% Computer : n009.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:23 EDT 2022

% Result   : Unknown 11.22s 11.34s
% Output   : None 
% Verified : 
% SZS Type : -

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