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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SEU059+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n029.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.85s 300.02s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU059+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n029.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:41:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.85/2.07  ----- Otter 3.3f, August 2004 -----
% 1.85/2.07  The process was started by sandbox on n029.cluster.edu,
% 1.85/2.07  Wed Jul 27 07:41:44 2022
% 1.85/2.07  The command was "./otter".  The process ID is 20701.
% 1.85/2.07  
% 1.85/2.07  set(prolog_style_variables).
% 1.85/2.07  set(auto).
% 1.85/2.07     dependent: set(auto1).
% 1.85/2.07     dependent: set(process_input).
% 1.85/2.07     dependent: clear(print_kept).
% 1.85/2.07     dependent: clear(print_new_demod).
% 1.85/2.07     dependent: clear(print_back_demod).
% 1.85/2.07     dependent: clear(print_back_sub).
% 1.85/2.07     dependent: set(control_memory).
% 1.85/2.07     dependent: assign(max_mem, 12000).
% 1.85/2.07     dependent: assign(pick_given_ratio, 4).
% 1.85/2.07     dependent: assign(stats_level, 1).
% 1.85/2.07     dependent: assign(max_seconds, 10800).
% 1.85/2.07  clear(print_given).
% 1.85/2.07  
% 1.85/2.07  formula_list(usable).
% 1.85/2.07  all A (A=A).
% 1.85/2.07  all A B (in(A,B)-> -in(B,A)).
% 1.85/2.07  all A (empty(A)->function(A)).
% 1.85/2.07  all A (empty(A)->relation(A)).
% 1.85/2.07  all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.85/2.07  all A (relation(A)&function(A)-> (all B C (C=relation_inverse_image(A,B)<-> (all D (in(D,C)<->in(D,relation_dom(A))&in(apply(A,D),B)))))).
% 1.85/2.07  all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.85/2.07  all A exists B element(B,A).
% 1.85/2.07  empty(empty_set).
% 1.85/2.07  relation(empty_set).
% 1.85/2.07  relation_empty_yielding(empty_set).
% 1.85/2.07  all A (-empty(powerset(A))).
% 1.85/2.07  empty(empty_set).
% 1.85/2.07  all A B (relation(A)&relation(B)->relation(set_difference(A,B))).
% 1.85/2.07  empty(empty_set).
% 1.85/2.07  relation(empty_set).
% 1.85/2.07  all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.85/2.07  all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 1.85/2.07  exists A (relation(A)&function(A)).
% 1.85/2.07  exists A (empty(A)&relation(A)).
% 1.85/2.07  all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.85/2.07  exists A empty(A).
% 1.85/2.07  exists A (relation(A)&empty(A)&function(A)).
% 1.85/2.07  exists A (-empty(A)&relation(A)).
% 1.85/2.07  all A exists B (element(B,powerset(A))&empty(B)).
% 1.85/2.07  exists A (-empty(A)).
% 1.85/2.07  exists A (relation(A)&function(A)&one_to_one(A)).
% 1.85/2.07  exists A (relation(A)&relation_empty_yielding(A)).
% 1.85/2.07  all A B subset(A,A).
% 1.85/2.07  -(all A B C (relation(C)&function(C)->relation_inverse_image(C,set_difference(A,B))=set_difference(relation_inverse_image(C,A),relation_inverse_image(C,B)))).
% 1.85/2.07  all A B (in(A,B)->element(A,B)).
% 1.85/2.07  all A B (element(A,B)->empty(B)|in(A,B)).
% 1.85/2.07  all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.85/2.07  all A (set_difference(A,empty_set)=A).
% 1.85/2.07  all A B (element(A,powerset(B))<->subset(A,B)).
% 1.85/2.07  all A (set_difference(empty_set,A)=empty_set).
% 1.85/2.07  all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.85/2.07  all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.85/2.07  all A (empty(A)->A=empty_set).
% 1.85/2.07  all A B (-(in(A,B)&empty(B))).
% 1.85/2.07  all A B (-(empty(A)&A!=B&empty(B))).
% 1.85/2.07  end_of_list.
% 1.85/2.07  
% 1.85/2.07  -------> usable clausifies to:
% 1.85/2.07  
% 1.85/2.07  list(usable).
% 1.85/2.07  0 [] A=A.
% 1.85/2.07  0 [] -in(A,B)| -in(B,A).
% 1.85/2.07  0 [] -empty(A)|function(A).
% 1.85/2.07  0 [] -empty(A)|relation(A).
% 1.85/2.07  0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.07  0 [] -relation(A)| -function(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(D,relation_dom(A)).
% 1.85/2.07  0 [] -relation(A)| -function(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(apply(A,D),B).
% 1.85/2.07  0 [] -relation(A)| -function(A)|C!=relation_inverse_image(A,B)|in(D,C)| -in(D,relation_dom(A))| -in(apply(A,D),B).
% 1.85/2.07  0 [] -relation(A)| -function(A)|C=relation_inverse_image(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),relation_dom(A)).
% 1.85/2.07  0 [] -relation(A)| -function(A)|C=relation_inverse_image(A,B)|in($f1(A,B,C),C)|in(apply(A,$f1(A,B,C)),B).
% 1.85/2.07  0 [] -relation(A)| -function(A)|C=relation_inverse_image(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),relation_dom(A))| -in(apply(A,$f1(A,B,C)),B).
% 1.85/2.07  0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.85/2.07  0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.85/2.07  0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.85/2.07  0 [] C=set_difference(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A).
% 1.85/2.07  0 [] C=set_difference(A,B)|in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 1.85/2.07  0 [] C=set_difference(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 1.85/2.07  0 [] element($f3(A),A).
% 1.85/2.07  0 [] empty(empty_set).
% 1.85/2.07  0 [] relation(empty_set).
% 1.85/2.07  0 [] relation_empty_yielding(empty_set).
% 1.85/2.07  0 [] -empty(powerset(A)).
% 1.85/2.07  0 [] empty(empty_set).
% 1.85/2.07  0 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 1.85/2.07  0 [] empty(empty_set).
% 1.85/2.07  0 [] relation(empty_set).
% 1.85/2.07  0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.85/2.07  0 [] -empty(A)|empty(relation_dom(A)).
% 1.85/2.07  0 [] -empty(A)|relation(relation_dom(A)).
% 1.85/2.07  0 [] relation($c1).
% 1.85/2.07  0 [] function($c1).
% 1.85/2.07  0 [] empty($c2).
% 1.85/2.07  0 [] relation($c2).
% 1.85/2.07  0 [] empty(A)|element($f4(A),powerset(A)).
% 1.85/2.07  0 [] empty(A)| -empty($f4(A)).
% 1.85/2.07  0 [] empty($c3).
% 1.85/2.07  0 [] relation($c4).
% 1.85/2.07  0 [] empty($c4).
% 1.85/2.07  0 [] function($c4).
% 1.85/2.07  0 [] -empty($c5).
% 1.85/2.07  0 [] relation($c5).
% 1.85/2.07  0 [] element($f5(A),powerset(A)).
% 1.85/2.07  0 [] empty($f5(A)).
% 1.85/2.07  0 [] -empty($c6).
% 1.85/2.07  0 [] relation($c7).
% 1.85/2.07  0 [] function($c7).
% 1.85/2.07  0 [] one_to_one($c7).
% 1.85/2.07  0 [] relation($c8).
% 1.85/2.07  0 [] relation_empty_yielding($c8).
% 1.85/2.07  0 [] subset(A,A).
% 1.85/2.07  0 [] relation($c9).
% 1.85/2.07  0 [] function($c9).
% 1.85/2.07  0 [] relation_inverse_image($c9,set_difference($c11,$c10))!=set_difference(relation_inverse_image($c9,$c11),relation_inverse_image($c9,$c10)).
% 1.85/2.07  0 [] -in(A,B)|element(A,B).
% 1.85/2.07  0 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.07  0 [] in($f6(A,B),A)|in($f6(A,B),B)|A=B.
% 1.85/2.07  0 [] -in($f6(A,B),A)| -in($f6(A,B),B)|A=B.
% 1.85/2.07  0 [] set_difference(A,empty_set)=A.
% 1.85/2.07  0 [] -element(A,powerset(B))|subset(A,B).
% 1.85/2.07  0 [] element(A,powerset(B))| -subset(A,B).
% 1.85/2.07  0 [] set_difference(empty_set,A)=empty_set.
% 1.85/2.07  0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.85/2.07  0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.85/2.07  0 [] -empty(A)|A=empty_set.
% 1.85/2.07  0 [] -in(A,B)| -empty(B).
% 1.85/2.07  0 [] -empty(A)|A=B| -empty(B).
% 1.85/2.07  end_of_list.
% 1.85/2.07  
% 1.85/2.07  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.85/2.07  
% 1.85/2.07  This ia a non-Horn set with equality.  The strategy will be
% 1.85/2.07  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.85/2.07  deletion, with positive clauses in sos and nonpositive
% 1.85/2.07  clauses in usable.
% 1.85/2.07  
% 1.85/2.07     dependent: set(knuth_bendix).
% 1.85/2.07     dependent: set(anl_eq).
% 1.85/2.07     dependent: set(para_from).
% 1.85/2.07     dependent: set(para_into).
% 1.85/2.07     dependent: clear(para_from_right).
% 1.85/2.07     dependent: clear(para_into_right).
% 1.85/2.07     dependent: set(para_from_vars).
% 1.85/2.07     dependent: set(eq_units_both_ways).
% 1.85/2.07     dependent: set(dynamic_demod_all).
% 1.85/2.07     dependent: set(dynamic_demod).
% 1.85/2.07     dependent: set(order_eq).
% 1.85/2.07     dependent: set(back_demod).
% 1.85/2.07     dependent: set(lrpo).
% 1.85/2.07     dependent: set(hyper_res).
% 1.85/2.07     dependent: set(unit_deletion).
% 1.85/2.07     dependent: set(factor).
% 1.85/2.07  
% 1.85/2.07  ------------> process usable:
% 1.85/2.07  ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.85/2.07  ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.85/2.07  ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.85/2.07  ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.07  ** KEPT (pick-wt=16): 5 [] -relation(A)| -function(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(D,relation_dom(A)).
% 1.85/2.07  ** KEPT (pick-wt=17): 6 [] -relation(A)| -function(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(apply(A,D),C).
% 1.85/2.07  ** KEPT (pick-wt=21): 7 [] -relation(A)| -function(A)|B!=relation_inverse_image(A,C)|in(D,B)| -in(D,relation_dom(A))| -in(apply(A,D),C).
% 1.85/2.07  ** KEPT (pick-wt=22): 8 [] -relation(A)| -function(A)|B=relation_inverse_image(A,C)|in($f1(A,C,B),B)|in($f1(A,C,B),relation_dom(A)).
% 1.85/2.07  ** KEPT (pick-wt=23): 9 [] -relation(A)| -function(A)|B=relation_inverse_image(A,C)|in($f1(A,C,B),B)|in(apply(A,$f1(A,C,B)),C).
% 1.85/2.07  ** KEPT (pick-wt=30): 10 [] -relation(A)| -function(A)|B=relation_inverse_image(A,C)| -in($f1(A,C,B),B)| -in($f1(A,C,B),relation_dom(A))| -in(apply(A,$f1(A,C,B)),C).
% 1.85/2.07  ** KEPT (pick-wt=11): 11 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.85/2.07  ** KEPT (pick-wt=11): 12 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.85/2.07  ** KEPT (pick-wt=14): 13 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.85/2.07  ** KEPT (pick-wt=17): 14 [] A=set_difference(B,C)|in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 1.85/2.07  ** KEPT (pick-wt=23): 15 [] A=set_difference(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 1.85/2.07  ** KEPT (pick-wt=3): 16 [] -empty(powerset(A)).
% 1.85/2.07  ** KEPT (pick-wt=8): 17 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 1.85/2.07  ** KEPT (pick-wt=7): 18 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.85/2.07  ** KEPT (pick-wt=5): 19 [] -empty(A)|empty(relation_dom(A)).
% 1.85/2.07  ** KEPT (pick-wt=5): 20 [] -empty(A)|relation(relation_dom(A)).
% 1.85/2.07  ** KEPT (pick-wt=5): 21 [] empty(A)| -empty($f4(A)).
% 1.85/2.07  ** KEPT (pick-wt=2): 22 [] -empty($c5).
% 1.85/2.07  ** KEPT (pick-wt=2): 23 [] -empty($c6).
% 1.85/2.07  ** KEPT (pick-wt=13): 25 [copy,24,flip.1] set_difference(relation_inverse_image($c9,$c11),relation_inverse_image($c9,$c10))!=relation_inverse_image($c9,set_difference($c11,$c10)).
% 1.85/2.07  ** KEPT (Alarm clock 
% 299.85/300.02  Otter interrupted
% 299.85/300.02  PROOF NOT FOUND
%------------------------------------------------------------------------------