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

View Problem - Process Solution

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

% Computer : n008.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:14:43 EDT 2022

% Result   : Timeout 299.88s 300.03s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SEU055+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14  % Command  : otter-tptp-script %s
% 0.14/0.35  % Computer : n008.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Jul 27 08:01:08 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 2.04/2.24  ----- Otter 3.3f, August 2004 -----
% 2.04/2.24  The process was started by sandbox on n008.cluster.edu,
% 2.04/2.24  Wed Jul 27 08:01:08 2022
% 2.04/2.24  The command was "./otter".  The process ID is 7118.
% 2.04/2.24  
% 2.04/2.24  set(prolog_style_variables).
% 2.04/2.24  set(auto).
% 2.04/2.24     dependent: set(auto1).
% 2.04/2.24     dependent: set(process_input).
% 2.04/2.24     dependent: clear(print_kept).
% 2.04/2.24     dependent: clear(print_new_demod).
% 2.04/2.24     dependent: clear(print_back_demod).
% 2.04/2.24     dependent: clear(print_back_sub).
% 2.04/2.24     dependent: set(control_memory).
% 2.04/2.24     dependent: assign(max_mem, 12000).
% 2.04/2.24     dependent: assign(pick_given_ratio, 4).
% 2.04/2.24     dependent: assign(stats_level, 1).
% 2.04/2.24     dependent: assign(max_seconds, 10800).
% 2.04/2.24  clear(print_given).
% 2.04/2.24  
% 2.04/2.24  formula_list(usable).
% 2.04/2.24  all A (A=A).
% 2.04/2.24  all A B (in(A,B)-> -in(B,A)).
% 2.04/2.24  all A (empty(A)->function(A)).
% 2.04/2.24  all A (empty(A)->relation(A)).
% 2.04/2.24  all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.04/2.24  all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.04/2.24  all A (relation(A)&function(A)-> (one_to_one(A)<-> (all B C (in(B,relation_dom(A))&in(C,relation_dom(A))&apply(A,B)=apply(A,C)->B=C)))).
% 2.04/2.24  all A exists B element(B,A).
% 2.04/2.24  empty(empty_set).
% 2.04/2.24  relation(empty_set).
% 2.04/2.24  relation_empty_yielding(empty_set).
% 2.04/2.24  all A (-empty(powerset(A))).
% 2.04/2.24  empty(empty_set).
% 2.04/2.24  all A (-empty(singleton(A))).
% 2.04/2.24  all A B (relation(A)&relation(B)->relation(set_difference(A,B))).
% 2.04/2.24  empty(empty_set).
% 2.04/2.24  relation(empty_set).
% 2.04/2.24  all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.04/2.24  all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.04/2.24  exists A (relation(A)&function(A)).
% 2.04/2.24  exists A (empty(A)&relation(A)).
% 2.04/2.24  all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.04/2.24  exists A empty(A).
% 2.04/2.24  exists A (relation(A)&empty(A)&function(A)).
% 2.04/2.24  exists A (-empty(A)&relation(A)).
% 2.04/2.24  all A exists B (element(B,powerset(A))&empty(B)).
% 2.04/2.24  exists A (-empty(A)).
% 2.04/2.24  exists A (relation(A)&function(A)&one_to_one(A)).
% 2.04/2.24  exists A (relation(A)&relation_empty_yielding(A)).
% 2.04/2.24  all A B subset(A,A).
% 2.04/2.24  all A B (relation(B)&function(B)-> (in(A,relation_dom(B))->relation_image(B,singleton(A))=singleton(apply(B,A)))).
% 2.04/2.24  -(all A (relation(A)&function(A)-> ((all B C (relation_image(A,set_difference(B,C))=set_difference(relation_image(A,B),relation_image(A,C))))->one_to_one(A)))).
% 2.04/2.24  all A B (in(A,B)->element(A,B)).
% 2.04/2.24  all A B (set_difference(singleton(A),singleton(B))=singleton(A)<->A!=B).
% 2.04/2.24  all A B (element(A,B)->empty(B)|in(A,B)).
% 2.04/2.24  all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.04/2.24  all A (set_difference(A,empty_set)=A).
% 2.04/2.24  all A B (element(A,powerset(B))<->subset(A,B)).
% 2.04/2.24  all A (set_difference(empty_set,A)=empty_set).
% 2.04/2.24  all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.04/2.24  all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.04/2.24  all A (empty(A)->A=empty_set).
% 2.04/2.24  all A B (-(in(A,B)&empty(B))).
% 2.04/2.24  all A B (-(empty(A)&A!=B&empty(B))).
% 2.04/2.24  end_of_list.
% 2.04/2.24  
% 2.04/2.24  -------> usable clausifies to:
% 2.04/2.24  
% 2.04/2.24  list(usable).
% 2.04/2.24  0 [] A=A.
% 2.04/2.24  0 [] -in(A,B)| -in(B,A).
% 2.04/2.24  0 [] -empty(A)|function(A).
% 2.04/2.24  0 [] -empty(A)|relation(A).
% 2.04/2.24  0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.04/2.24  0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.04/2.24  0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.04/2.24  0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.04/2.24  0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.04/2.24  0 [] -relation(A)| -function(A)| -one_to_one(A)| -in(B,relation_dom(A))| -in(C,relation_dom(A))|apply(A,B)!=apply(A,C)|B=C.
% 2.04/2.24  0 [] -relation(A)| -function(A)|one_to_one(A)|in($f3(A),relation_dom(A)).
% 2.04/2.24  0 [] -relation(A)| -function(A)|one_to_one(A)|in($f2(A),relation_dom(A)).
% 2.04/2.24  0 [] -relation(A)| -function(A)|one_to_one(A)|apply(A,$f3(A))=apply(A,$f2(A)).
% 2.04/2.24  0 [] -relation(A)| -function(A)|one_to_one(A)|$f3(A)!=$f2(A).
% 2.04/2.24  0 [] element($f4(A),A).
% 2.04/2.24  0 [] empty(empty_set).
% 2.04/2.24  0 [] relation(empty_set).
% 2.04/2.24  0 [] relation_empty_yielding(empty_set).
% 2.04/2.24  0 [] -empty(powerset(A)).
% 2.04/2.24  0 [] empty(empty_set).
% 2.04/2.24  0 [] -empty(singleton(A)).
% 2.04/2.24  0 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 2.04/2.24  0 [] empty(empty_set).
% 2.04/2.24  0 [] relation(empty_set).
% 2.04/2.24  0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.04/2.24  0 [] -empty(A)|empty(relation_dom(A)).
% 2.04/2.24  0 [] -empty(A)|relation(relation_dom(A)).
% 2.04/2.24  0 [] relation($c1).
% 2.04/2.24  0 [] function($c1).
% 2.04/2.24  0 [] empty($c2).
% 2.04/2.24  0 [] relation($c2).
% 2.04/2.24  0 [] empty(A)|element($f5(A),powerset(A)).
% 2.04/2.24  0 [] empty(A)| -empty($f5(A)).
% 2.04/2.24  0 [] empty($c3).
% 2.04/2.24  0 [] relation($c4).
% 2.04/2.24  0 [] empty($c4).
% 2.04/2.24  0 [] function($c4).
% 2.04/2.24  0 [] -empty($c5).
% 2.04/2.24  0 [] relation($c5).
% 2.04/2.24  0 [] element($f6(A),powerset(A)).
% 2.04/2.24  0 [] empty($f6(A)).
% 2.04/2.24  0 [] -empty($c6).
% 2.04/2.24  0 [] relation($c7).
% 2.04/2.24  0 [] function($c7).
% 2.04/2.24  0 [] one_to_one($c7).
% 2.04/2.24  0 [] relation($c8).
% 2.04/2.24  0 [] relation_empty_yielding($c8).
% 2.04/2.24  0 [] subset(A,A).
% 2.04/2.24  0 [] -relation(B)| -function(B)| -in(A,relation_dom(B))|relation_image(B,singleton(A))=singleton(apply(B,A)).
% 2.04/2.24  0 [] relation($c9).
% 2.04/2.24  0 [] function($c9).
% 2.04/2.24  0 [] relation_image($c9,set_difference(B,C))=set_difference(relation_image($c9,B),relation_image($c9,C)).
% 2.04/2.24  0 [] -one_to_one($c9).
% 2.04/2.24  0 [] -in(A,B)|element(A,B).
% 2.04/2.24  0 [] set_difference(singleton(A),singleton(B))!=singleton(A)|A!=B.
% 2.04/2.24  0 [] set_difference(singleton(A),singleton(B))=singleton(A)|A=B.
% 2.04/2.24  0 [] -element(A,B)|empty(B)|in(A,B).
% 2.04/2.24  0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.04/2.24  0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.04/2.24  0 [] set_difference(A,empty_set)=A.
% 2.04/2.24  0 [] -element(A,powerset(B))|subset(A,B).
% 2.04/2.24  0 [] element(A,powerset(B))| -subset(A,B).
% 2.04/2.24  0 [] set_difference(empty_set,A)=empty_set.
% 2.04/2.24  0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.04/2.24  0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.04/2.24  0 [] -empty(A)|A=empty_set.
% 2.04/2.24  0 [] -in(A,B)| -empty(B).
% 2.04/2.24  0 [] -empty(A)|A=B| -empty(B).
% 2.04/2.24  end_of_list.
% 2.04/2.24  
% 2.04/2.24  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.04/2.24  
% 2.04/2.24  This ia a non-Horn set with equality.  The strategy will be
% 2.04/2.24  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.04/2.24  deletion, with positive clauses in sos and nonpositive
% 2.04/2.24  clauses in usable.
% 2.04/2.24  
% 2.04/2.24     dependent: set(knuth_bendix).
% 2.04/2.24     dependent: set(anl_eq).
% 2.04/2.24     dependent: set(para_from).
% 2.04/2.24     dependent: set(para_into).
% 2.04/2.24     dependent: clear(para_from_right).
% 2.04/2.24     dependent: clear(para_into_right).
% 2.04/2.24     dependent: set(para_from_vars).
% 2.04/2.24     dependent: set(eq_units_both_ways).
% 2.04/2.24     dependent: set(dynamic_demod_all).
% 2.04/2.24     dependent: set(dynamic_demod).
% 2.04/2.24     dependent: set(order_eq).
% 2.04/2.24     dependent: set(back_demod).
% 2.04/2.24     dependent: set(lrpo).
% 2.04/2.24     dependent: set(hyper_res).
% 2.04/2.24     dependent: set(unit_deletion).
% 2.04/2.24     dependent: set(factor).
% 2.04/2.24  
% 2.04/2.24  ------------> process usable:
% 2.04/2.24  ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.04/2.24  ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.04/2.24  ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.04/2.24  ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.04/2.24  ** KEPT (pick-wt=10): 5 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.04/2.24  ** KEPT (pick-wt=10): 6 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.04/2.24  ** KEPT (pick-wt=14): 7 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.04/2.24  ** KEPT (pick-wt=24): 8 [] -relation(A)| -function(A)| -one_to_one(A)| -in(B,relation_dom(A))| -in(C,relation_dom(A))|apply(A,B)!=apply(A,C)|B=C.
% 2.04/2.24  ** KEPT (pick-wt=11): 9 [] -relation(A)| -function(A)|one_to_one(A)|in($f3(A),relation_dom(A)).
% 2.04/2.24  ** KEPT (pick-wt=11): 10 [] -relation(A)| -function(A)|one_to_one(A)|in($f2(A),relation_dom(A)).
% 2.04/2.24  ** KEPT (pick-wt=15): 11 [] -relation(A)| -function(A)|one_to_one(A)|apply(A,$f3(A))=apply(A,$f2(A)).
% 2.04/2.24  ** KEPT (pick-wt=11): 12 [] -relation(A)| -function(A)|one_to_one(A)|$f3(A)!=$f2(A).
% 2.04/2.24  ** KEPT (pick-wt=3): 13 [] -empty(powerset(A)).
% 2.04/2.24  ** KEPT (pick-wt=3): 14 [] -empty(singleton(A)).
% 2.04/2.24  ** KEPT (pick-wt=8): 15 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 2.04/2.24  ** KEPT (pick-wt=7): 16 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.04/2.24  ** KEPT (pick-wt=5): 17 [] -empty(A)|empty(relation_dom(A)).
% 2.04/2.24  ** KEPT (pick-wt=5): 18 [] -empty(A)|relation(relation_dom(A)).
% 2.04/2.24  ** KEPT (pick-wt=5): 19 [] empty(A)| -empty($f5(A)).
% 2.04/2.24  ** KEPT (pick-wt=2): 20 [] -empty($c5).
% 2.04/2.24  ** KEPT (pick-wt=2): 21 [] -empty($c6).
% 2.04/2.24  ** KEPT (pick-wt=17): 23 [copy,22,flip.4] -relation(A)| -function(A)| -in(B,relation_dom(A))|singleton(apply(A,B))=relation_image(A,singleton(B)).
% 2.04/2.24  ** KEPT (pick-wt=2): 24 [] -one_to_one($c9).
% 2.04/2.24  ** KEPT (pick-wt=6): 25 [] -in(A,B)|element(A,B).
% 2.04/2.24  ** KEPT (pick-wt=11): 26 [] set_difference(singleton(A),singleton(B))!=singleton(A)|A!=B.
% 2.04/2.24  ** KEPT (pick-wt=8): 27 [] -element(A,B)|empty(B)|in(A,B).
% 2.04/2.24  ** KEPT (pick-wt=8): 28 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.04/2.24  ** KEPT (pick-wt=8): 29 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.04/2.24  ** KEPT (pick-wt=7): 30 [] -element(A,powerset(B))|subset(A,B).
% 2.04/2.24  **Alarm clock 
% 299.88/300.03  Otter interrupted
% 299.88/300.03  PROOF NOT FOUND
%------------------------------------------------------------------------------