TSTP Solution File: SEU050+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU050+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU050+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 07:31:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.14/2.29 ----- Otter 3.3f, August 2004 -----
% 2.14/2.29 The process was started by sandbox2 on n011.cluster.edu,
% 2.14/2.29 Wed Jul 27 07:31:10 2022
% 2.14/2.29 The command was "./otter". The process ID is 9294.
% 2.14/2.29
% 2.14/2.29 set(prolog_style_variables).
% 2.14/2.29 set(auto).
% 2.14/2.29 dependent: set(auto1).
% 2.14/2.29 dependent: set(process_input).
% 2.14/2.29 dependent: clear(print_kept).
% 2.14/2.29 dependent: clear(print_new_demod).
% 2.14/2.29 dependent: clear(print_back_demod).
% 2.14/2.29 dependent: clear(print_back_sub).
% 2.14/2.29 dependent: set(control_memory).
% 2.14/2.29 dependent: assign(max_mem, 12000).
% 2.14/2.29 dependent: assign(pick_given_ratio, 4).
% 2.14/2.29 dependent: assign(stats_level, 1).
% 2.14/2.29 dependent: assign(max_seconds, 10800).
% 2.14/2.29 clear(print_given).
% 2.14/2.29
% 2.14/2.29 formula_list(usable).
% 2.14/2.29 all A (A=A).
% 2.14/2.29 all A B (in(A,B)-> -in(B,A)).
% 2.14/2.29 all A (empty(A)->function(A)).
% 2.14/2.29 all A (empty(A)->relation(A)).
% 2.14/2.29 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.14/2.29 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.14/2.29 all A (relation(A)&function(A)-> (all B C (C=relation_image(A,B)<-> (all D (in(D,C)<-> (exists E (in(E,relation_dom(A))&in(E,B)&D=apply(A,E)))))))).
% 2.14/2.29 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.14/2.29 all A exists B element(B,A).
% 2.14/2.29 empty(empty_set).
% 2.14/2.29 relation(empty_set).
% 2.14/2.29 relation_empty_yielding(empty_set).
% 2.14/2.29 all A (-empty(powerset(A))).
% 2.14/2.29 empty(empty_set).
% 2.14/2.29 all A B (-empty(unordered_pair(A,B))).
% 2.14/2.29 empty(empty_set).
% 2.14/2.29 relation(empty_set).
% 2.14/2.29 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.14/2.29 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.14/2.29 exists A (relation(A)&function(A)).
% 2.14/2.29 exists A (empty(A)&relation(A)).
% 2.14/2.29 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.14/2.29 exists A empty(A).
% 2.14/2.29 exists A (relation(A)&empty(A)&function(A)).
% 2.14/2.29 exists A (-empty(A)&relation(A)).
% 2.14/2.29 all A exists B (element(B,powerset(A))&empty(B)).
% 2.14/2.29 exists A (-empty(A)).
% 2.14/2.29 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.14/2.29 exists A (relation(A)&relation_empty_yielding(A)).
% 2.14/2.29 all A B subset(A,A).
% 2.14/2.29 -(all A B C (relation(C)&function(C)-> (in(A,relation_dom(C))&in(B,relation_dom(C))->relation_image(C,unordered_pair(A,B))=unordered_pair(apply(C,A),apply(C,B))))).
% 2.14/2.29 all A B (in(A,B)->element(A,B)).
% 2.14/2.29 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.14/2.29 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.14/2.29 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.14/2.29 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.14/2.29 all A (empty(A)->A=empty_set).
% 2.14/2.29 all A B (-(in(A,B)&empty(B))).
% 2.14/2.29 all A B (-(empty(A)&A!=B&empty(B))).
% 2.14/2.29 end_of_list.
% 2.14/2.29
% 2.14/2.29 -------> usable clausifies to:
% 2.14/2.29
% 2.14/2.29 list(usable).
% 2.14/2.29 0 [] A=A.
% 2.14/2.29 0 [] -in(A,B)| -in(B,A).
% 2.14/2.29 0 [] -empty(A)|function(A).
% 2.14/2.29 0 [] -empty(A)|relation(A).
% 2.14/2.29 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.14/2.29 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C!=relation_image(A,B)| -in(D,C)|in($f1(A,B,C,D),relation_dom(A)).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C!=relation_image(A,B)| -in(D,C)|in($f1(A,B,C,D),B).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C!=relation_image(A,B)| -in(D,C)|D=apply(A,$f1(A,B,C,D)).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C!=relation_image(A,B)|in(D,C)| -in(E,relation_dom(A))| -in(E,B)|D!=apply(A,E).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|in($f2(A,B,C),relation_dom(A)).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|in($f2(A,B,C),B).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|$f3(A,B,C)=apply(A,$f2(A,B,C)).
% 2.14/2.29 0 [] -relation(A)| -function(A)|C=relation_image(A,B)| -in($f3(A,B,C),C)| -in(X1,relation_dom(A))| -in(X1,B)|$f3(A,B,C)!=apply(A,X1).
% 2.14/2.29 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.14/2.29 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.14/2.29 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.14/2.29 0 [] C=unordered_pair(A,B)|in($f4(A,B,C),C)|$f4(A,B,C)=A|$f4(A,B,C)=B.
% 2.14/2.29 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=A.
% 2.14/2.29 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=B.
% 2.14/2.29 0 [] element($f5(A),A).
% 2.14/2.29 0 [] empty(empty_set).
% 2.14/2.29 0 [] relation(empty_set).
% 2.14/2.29 0 [] relation_empty_yielding(empty_set).
% 2.14/2.29 0 [] -empty(powerset(A)).
% 2.14/2.29 0 [] empty(empty_set).
% 2.14/2.29 0 [] -empty(unordered_pair(A,B)).
% 2.14/2.29 0 [] empty(empty_set).
% 2.14/2.29 0 [] relation(empty_set).
% 2.14/2.29 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.14/2.29 0 [] -empty(A)|empty(relation_dom(A)).
% 2.14/2.29 0 [] -empty(A)|relation(relation_dom(A)).
% 2.14/2.29 0 [] relation($c1).
% 2.14/2.29 0 [] function($c1).
% 2.14/2.29 0 [] empty($c2).
% 2.14/2.29 0 [] relation($c2).
% 2.14/2.29 0 [] empty(A)|element($f6(A),powerset(A)).
% 2.14/2.29 0 [] empty(A)| -empty($f6(A)).
% 2.14/2.29 0 [] empty($c3).
% 2.14/2.29 0 [] relation($c4).
% 2.14/2.29 0 [] empty($c4).
% 2.14/2.29 0 [] function($c4).
% 2.14/2.29 0 [] -empty($c5).
% 2.14/2.29 0 [] relation($c5).
% 2.14/2.29 0 [] element($f7(A),powerset(A)).
% 2.14/2.29 0 [] empty($f7(A)).
% 2.14/2.29 0 [] -empty($c6).
% 2.14/2.29 0 [] relation($c7).
% 2.14/2.29 0 [] function($c7).
% 2.14/2.29 0 [] one_to_one($c7).
% 2.14/2.29 0 [] relation($c8).
% 2.14/2.29 0 [] relation_empty_yielding($c8).
% 2.14/2.29 0 [] subset(A,A).
% 2.14/2.29 0 [] relation($c9).
% 2.14/2.29 0 [] function($c9).
% 2.14/2.29 0 [] in($c11,relation_dom($c9)).
% 2.14/2.29 0 [] in($c10,relation_dom($c9)).
% 2.14/2.29 0 [] relation_image($c9,unordered_pair($c11,$c10))!=unordered_pair(apply($c9,$c11),apply($c9,$c10)).
% 2.14/2.29 0 [] -in(A,B)|element(A,B).
% 2.14/2.29 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.14/2.29 0 [] -element(A,powerset(B))|subset(A,B).
% 2.14/2.29 0 [] element(A,powerset(B))| -subset(A,B).
% 2.14/2.29 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.14/2.29 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.14/2.29 0 [] -empty(A)|A=empty_set.
% 2.14/2.29 0 [] -in(A,B)| -empty(B).
% 2.14/2.29 0 [] -empty(A)|A=B| -empty(B).
% 2.14/2.29 end_of_list.
% 2.14/2.29
% 2.14/2.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.14/2.29
% 2.14/2.29 This ia a non-Horn set with equality. The strategy will be
% 2.14/2.29 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.14/2.29 deletion, with positive clauses in sos and nonpositive
% 2.14/2.29 clauses in usable.
% 2.14/2.29
% 2.14/2.29 dependent: set(knuth_bendix).
% 2.14/2.29 dependent: set(anl_eq).
% 2.14/2.29 dependent: set(para_from).
% 2.14/2.29 dependent: set(para_into).
% 2.14/2.29 dependent: clear(para_from_right).
% 2.14/2.29 dependent: clear(para_into_right).
% 2.14/2.29 dependent: set(para_from_vars).
% 2.14/2.29 dependent: set(eq_units_both_ways).
% 2.14/2.29 dependent: set(dynamic_demod_all).
% 2.14/2.29 dependent: set(dynamic_demod).
% 2.14/2.29 dependent: set(order_eq).
% 2.14/2.29 dependent: set(back_demod).
% 2.14/2.29 dependent: set(lrpo).
% 2.14/2.29 dependent: set(hyper_res).
% 2.14/2.29 dependent: set(unit_deletion).
% 2.14/2.29 dependent: set(factor).
% 2.14/2.29
% 2.14/2.29 ------------> process usable:
% 2.14/2.29 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.14/2.29 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.14/2.29 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.14/2.29 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.14/2.29 ** KEPT (pick-wt=20): 5 [] -relation(A)| -function(A)|B!=relation_image(A,C)| -in(D,B)|in($f1(A,C,B,D),relation_dom(A)).
% 2.14/2.29 ** KEPT (pick-wt=19): 6 [] -relation(A)| -function(A)|B!=relation_image(A,C)| -in(D,B)|in($f1(A,C,B,D),C).
% 2.14/2.29 ** KEPT (pick-wt=21): 8 [copy,7,flip.5] -relation(A)| -function(A)|B!=relation_image(A,C)| -in(D,B)|apply(A,$f1(A,C,B,D))=D.
% 2.14/2.29 ** KEPT (pick-wt=24): 9 [] -relation(A)| -function(A)|B!=relation_image(A,C)|in(D,B)| -in(E,relation_dom(A))| -in(E,C)|D!=apply(A,E).
% 2.14/2.29 ** KEPT (pick-wt=22): 10 [] -relation(A)| -function(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|in($f2(A,C,B),relation_dom(A)).
% 2.14/2.29 ** KEPT (pick-wt=21): 11 [] -relation(A)| -function(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|in($f2(A,C,B),C).
% 2.14/2.29 ** KEPT (pick-wt=26): 13 [copy,12,flip.5] -relation(A)| -function(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|apply(A,$f2(A,C,B))=$f3(A,C,B).
% 2.14/2.29 ** KEPT (pick-wt=30): 14 [] -relation(A)| -function(A)|B=relation_image(A,C)| -in($f3(A,C,B),B)| -in(D,relation_dom(A))| -in(D,C)|$f3(A,C,B)!=apply(A,D).
% 2.14/2.29 ** KEPT (pick-wt=14): 15 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.14/2.29 ** KEPT (pick-wt=11): 16 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.14/2.29 ** KEPT (pick-wt=11): 17 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.14/2.29 ** KEPT (pick-wt=17): 18 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=B.
% 2.14/2.29 ** KEPT (pick-wt=17): 19 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=C.
% 2.14/2.29 ** KEPT (pick-wt=3): 20 [] -empty(powerset(A)).
% 2.14/2.29 ** KEPT (pick-wt=4): 21 [] -empty(unordered_pair(A,B)).
% 2.14/2.29 ** KEPT (pick-wt=7): 22 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.14/2.29 ** KEPT (pick-wt=5): 23 [] -empty(A)|empty(relation_dom(A)).
% 2.14/2.29 ** KEPT (pick-wt=5): 24 [] -empty(A)|relation(relation_dom(A)).
% 2.14/2.29 ** KEPT (pick-wt=5): 25 [] empty(A)| -empty($f6(A)).
% 2.14/2.29 ** KEPT (pick-wt=2): 26 [] -empty($c5).
% 2.14/2.29 ** KEPT (pick-wt=2): 27 [] -empty($c6).
% 2.14/2.29 ** KEPT (pick-wt=13): 29 [copy,28,flip.1] unordered_pair(apply($c9,$c11),apply($c9,$c10))!=relation_image($c9,unordered_pair($c11,$c10)).
% 2.14/2.29 ** KEPAlarm clock
% 299.85/300.01 Otter interrupted
% 299.85/300.01 PROOF NOT FOUND
%------------------------------------------------------------------------------