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