TSTP Solution File: TOP020+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : TOP020+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:26:49 EDT 2022
% Result : Unknown 5.84s 6.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : TOP020+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n004.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 01:48:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.75/1.95 ----- Otter 3.3f, August 2004 -----
% 1.75/1.95 The process was started by sandbox on n004.cluster.edu,
% 1.75/1.95 Wed Jul 27 01:48:51 2022
% 1.75/1.95 The command was "./otter". The process ID is 32423.
% 1.75/1.95
% 1.75/1.95 set(prolog_style_variables).
% 1.75/1.95 set(auto).
% 1.75/1.95 dependent: set(auto1).
% 1.75/1.95 dependent: set(process_input).
% 1.75/1.95 dependent: clear(print_kept).
% 1.75/1.95 dependent: clear(print_new_demod).
% 1.75/1.95 dependent: clear(print_back_demod).
% 1.75/1.95 dependent: clear(print_back_sub).
% 1.75/1.95 dependent: set(control_memory).
% 1.75/1.95 dependent: assign(max_mem, 12000).
% 1.75/1.95 dependent: assign(pick_given_ratio, 4).
% 1.75/1.95 dependent: assign(stats_level, 1).
% 1.75/1.95 dependent: assign(max_seconds, 10800).
% 1.75/1.95 clear(print_given).
% 1.75/1.95
% 1.75/1.95 formula_list(usable).
% 1.75/1.95 all A (A=A).
% 1.75/1.95 all X A ((all Y (a_member_of(Y,coerce_to_class(X))& -a_member_of(Y,A)-> (exists G (a_member_of(Y,G)&open_in(G,X)&disjoint(G,A)))))->closed_in(A,X)).
% 1.75/1.95 all X (a_hausdorff_top_space(X)-> (all A B (a_member_of(A,coerce_to_class(X))&a_member_of(B,coerce_to_class(X))&A!=B-> (exists G1 G2 (open_in(G1,X)&open_in(G2,X)&a_member_of(A,G1)&a_member_of(B,G2)&disjoint(G1,G2)))))).
% 1.75/1.95 all A X B Y (open_in(A,X)&open_in(B,Y)->open_in(the_product_of(A,B),the_product_top_space_of(X,Y))).
% 1.75/1.95 all S T X (a_member_of(X,coerce_to_class(the_product_top_space_of(S,T)))-> (exists A B (a_member_of(A,coerce_to_class(S))&a_member_of(B,coerce_to_class(T))&X=the_ordered_pair(A,B)))).
% 1.75/1.95 all X S T (a_member_of(X,the_product_of(S,T))<-> (exists A B (a_member_of(A,S)&a_member_of(B,T)&X=the_ordered_pair(A,B)))).
% 1.75/1.95 all A B (disjoint(A,B)<-> -(exists Y (a_member_of(Y,A)&a_member_of(Y,B)))).
% 1.75/1.95 all A B C D (the_ordered_pair(A,B)=the_ordered_pair(C,D)->A=C&B=D).
% 1.75/1.95 all X S (a_member_of(X,coerce_to_class(the_diagonal_top(S)))<-> (exists A (a_member_of(A,coerce_to_class(S))&X=the_ordered_pair(A,A)))).
% 1.75/1.95 -(all S (a_hausdorff_top_space(S)->closed_in(coerce_to_class(the_diagonal_top(S)),the_product_top_space_of(S,S)))).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 -------> usable clausifies to:
% 1.75/1.95
% 1.75/1.95 list(usable).
% 1.75/1.95 0 [] A=A.
% 1.75/1.95 0 [] a_member_of($f1(X,A),coerce_to_class(X))|closed_in(A,X).
% 1.75/1.95 0 [] -a_member_of($f1(X,A),A)|closed_in(A,X).
% 1.75/1.95 0 [] -a_member_of($f1(X,A),G)| -open_in(G,X)| -disjoint(G,A)|closed_in(A,X).
% 1.75/1.95 0 [] -a_hausdorff_top_space(X)| -a_member_of(A,coerce_to_class(X))| -a_member_of(B,coerce_to_class(X))|A=B|open_in($f3(X,A,B),X).
% 1.75/1.95 0 [] -a_hausdorff_top_space(X)| -a_member_of(A,coerce_to_class(X))| -a_member_of(B,coerce_to_class(X))|A=B|open_in($f2(X,A,B),X).
% 1.75/1.95 0 [] -a_hausdorff_top_space(X)| -a_member_of(A,coerce_to_class(X))| -a_member_of(B,coerce_to_class(X))|A=B|a_member_of(A,$f3(X,A,B)).
% 1.75/1.95 0 [] -a_hausdorff_top_space(X)| -a_member_of(A,coerce_to_class(X))| -a_member_of(B,coerce_to_class(X))|A=B|a_member_of(B,$f2(X,A,B)).
% 1.75/1.95 0 [] -a_hausdorff_top_space(X)| -a_member_of(A,coerce_to_class(X))| -a_member_of(B,coerce_to_class(X))|A=B|disjoint($f3(X,A,B),$f2(X,A,B)).
% 1.75/1.95 0 [] -open_in(A,X)| -open_in(B,Y)|open_in(the_product_of(A,B),the_product_top_space_of(X,Y)).
% 1.75/1.95 0 [] -a_member_of(X,coerce_to_class(the_product_top_space_of(S,T)))|a_member_of($f5(S,T,X),coerce_to_class(S)).
% 1.75/1.95 0 [] -a_member_of(X,coerce_to_class(the_product_top_space_of(S,T)))|a_member_of($f4(S,T,X),coerce_to_class(T)).
% 1.75/1.95 0 [] -a_member_of(X,coerce_to_class(the_product_top_space_of(S,T)))|X=the_ordered_pair($f5(S,T,X),$f4(S,T,X)).
% 1.75/1.95 0 [] -a_member_of(X,the_product_of(S,T))|a_member_of($f7(X,S,T),S).
% 1.75/1.95 0 [] -a_member_of(X,the_product_of(S,T))|a_member_of($f6(X,S,T),T).
% 1.75/1.95 0 [] -a_member_of(X,the_product_of(S,T))|X=the_ordered_pair($f7(X,S,T),$f6(X,S,T)).
% 1.75/1.95 0 [] a_member_of(X,the_product_of(S,T))| -a_member_of(A,S)| -a_member_of(B,T)|X!=the_ordered_pair(A,B).
% 1.75/1.95 0 [] -disjoint(A,B)| -a_member_of(Y,A)| -a_member_of(Y,B).
% 1.75/1.95 0 [] disjoint(A,B)|a_member_of($f8(A,B),A).
% 1.75/1.95 0 [] disjoint(A,B)|a_member_of($f8(A,B),B).
% 1.75/1.95 0 [] the_ordered_pair(A,B)!=the_ordered_pair(C,D)|A=C.
% 1.75/1.95 0 [] the_ordered_pair(A,B)!=the_ordered_pair(C,D)|B=D.
% 1.75/1.95 0 [] -a_member_of(X,coerce_to_class(the_diagonal_top(S)))|a_member_of($f9(X,S),coerce_to_class(S)).
% 1.75/1.95 0 [] -a_member_of(X,coerce_to_class(the_diagonal_top(S)))|X=the_ordered_pair($f9(X,S),$f9(X,S)).
% 1.75/1.95 0 [] a_member_of(X,coerce_to_class(the_diagonal_top(S)))| -a_member_of(A,coerce_to_class(S))|X!=the_ordered_pair(A,A).
% 1.75/1.95 0 [] a_hausdorff_top_space($c1).
% 1.75/1.95 0 [] -closed_in(coerce_to_class(the_diagonal_top($c1)),the_product_top_space_of($c1,$c1)).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.75/1.95
% 1.75/1.95 This ia a non-Horn set with equality. The strategy will be
% 1.75/1.95 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.75/1.95 deletion, with positive clauses in sos and nonpositive
% 1.75/1.95 clauses in usable.
% 1.75/1.95
% 1.75/1.95 dependent: set(knuth_bendix).
% 1.75/1.95 dependent: set(anl_eq).
% 1.75/1.95 dependent: set(para_from).
% 1.75/1.95 dependent: set(para_into).
% 1.75/1.95 dependent: clear(para_from_right).
% 1.75/1.95 dependent: clear(para_into_right).
% 1.75/1.95 dependent: set(para_from_vars).
% 1.75/1.95 dependent: set(eq_units_both_ways).
% 1.75/1.95 dependent: set(dynamic_demod_all).
% 1.75/1.95 dependent: set(dynamic_demod).
% 1.75/1.95 dependent: set(order_eq).
% 1.75/1.95 dependent: set(back_demod).
% 1.75/1.95 dependent: set(lrpo).
% 1.75/1.95 dependent: set(hyper_res).
% 1.75/1.95 dependent: set(unit_deletion).
% 1.75/1.95 dependent: set(factor).
% 1.75/1.95
% 1.75/1.95 ------------> process usable:
% 1.75/1.95 ** KEPT (pick-wt=8): 1 [] -a_member_of($f1(A,B),B)|closed_in(B,A).
% 1.75/1.95 ** KEPT (pick-wt=14): 2 [] -a_member_of($f1(A,B),C)| -open_in(C,A)| -disjoint(C,B)|closed_in(B,A).
% 1.75/1.95 ** KEPT (pick-wt=19): 3 [] -a_hausdorff_top_space(A)| -a_member_of(B,coerce_to_class(A))| -a_member_of(C,coerce_to_class(A))|B=C|open_in($f3(A,B,C),A).
% 1.75/1.95 ** KEPT (pick-wt=19): 4 [] -a_hausdorff_top_space(A)| -a_member_of(B,coerce_to_class(A))| -a_member_of(C,coerce_to_class(A))|B=C|open_in($f2(A,B,C),A).
% 1.75/1.95 ** KEPT (pick-wt=19): 5 [] -a_hausdorff_top_space(A)| -a_member_of(B,coerce_to_class(A))| -a_member_of(C,coerce_to_class(A))|B=C|a_member_of(B,$f3(A,B,C)).
% 1.75/1.95 ** KEPT (pick-wt=19): 6 [] -a_hausdorff_top_space(A)| -a_member_of(B,coerce_to_class(A))| -a_member_of(C,coerce_to_class(A))|B=C|a_member_of(C,$f2(A,B,C)).
% 1.75/1.95 ** KEPT (pick-wt=22): 7 [] -a_hausdorff_top_space(A)| -a_member_of(B,coerce_to_class(A))| -a_member_of(C,coerce_to_class(A))|B=C|disjoint($f3(A,B,C),$f2(A,B,C)).
% 1.75/1.95 ** KEPT (pick-wt=13): 8 [] -open_in(A,B)| -open_in(C,D)|open_in(the_product_of(A,C),the_product_top_space_of(B,D)).
% 1.75/1.95 ** KEPT (pick-wt=13): 9 [] -a_member_of(A,coerce_to_class(the_product_top_space_of(B,C)))|a_member_of($f5(B,C,A),coerce_to_class(B)).
% 1.75/1.95 ** KEPT (pick-wt=13): 10 [] -a_member_of(A,coerce_to_class(the_product_top_space_of(B,C)))|a_member_of($f4(B,C,A),coerce_to_class(C)).
% 1.75/1.95 ** KEPT (pick-wt=17): 12 [copy,11,flip.2] -a_member_of(A,coerce_to_class(the_product_top_space_of(B,C)))|the_ordered_pair($f5(B,C,A),$f4(B,C,A))=A.
% 1.75/1.95 ** KEPT (pick-wt=11): 13 [] -a_member_of(A,the_product_of(B,C))|a_member_of($f7(A,B,C),B).
% 1.75/1.95 ** KEPT (pick-wt=11): 14 [] -a_member_of(A,the_product_of(B,C))|a_member_of($f6(A,B,C),C).
% 1.75/1.95 ** KEPT (pick-wt=16): 16 [copy,15,flip.2] -a_member_of(A,the_product_of(B,C))|the_ordered_pair($f7(A,B,C),$f6(A,B,C))=A.
% 1.75/1.95 ** KEPT (pick-wt=16): 17 [] a_member_of(A,the_product_of(B,C))| -a_member_of(D,B)| -a_member_of(E,C)|A!=the_ordered_pair(D,E).
% 1.75/1.95 ** KEPT (pick-wt=9): 18 [] -disjoint(A,B)| -a_member_of(C,A)| -a_member_of(C,B).
% 1.75/1.95 ** KEPT (pick-wt=10): 19 [] the_ordered_pair(A,B)!=the_ordered_pair(C,D)|A=C.
% 1.75/1.95 ** KEPT (pick-wt=10): 20 [] the_ordered_pair(A,B)!=the_ordered_pair(C,D)|B=D.
% 1.75/1.95 ** KEPT (pick-wt=11): 21 [] -a_member_of(A,coerce_to_class(the_diagonal_top(B)))|a_member_of($f9(A,B),coerce_to_class(B)).
% 1.75/1.95 ** KEPT (pick-wt=14): 23 [copy,22,flip.2] -a_member_of(A,coerce_to_class(the_diagonal_top(B)))|the_ordered_pair($f9(A,B),$f9(A,B))=A.
% 1.75/1.95 ** KEPT (pick-wt=14): 24 [] a_member_of(A,coerce_to_class(the_diagonal_top(B)))| -a_member_of(C,coerce_to_class(B))|A!=the_ordered_pair(C,C).
% 1.75/1.95 ** KEPT (pick-wt=7): 25 [] -closed_in(coerce_to_class(the_diagonal_top($c1)),the_product_top_space_of($c1,$c1)).
% 1.75/1.95
% 1.75/1.95 ------------> process sos:
% 1.75/1.95 ** KEPT (pick-wt=3): 34 [] A=A.
% 1.75/1.95 ** KEPT (pick-wt=9): 35 [] a_member_of($f1(A,B),coerce_to_class(A))|closed_in(B,A).
% 1.75/1.95 ** KEPT (pick-wt=8): 36 [] disjoint(A,B)|a_member_of($f8(A,B),A).
% 1.75/1.95 ** KEPT (pick-wt=8): 37 [] disjoint(A,B)|a_member_of($f8(A,B),B).
% 1.75/1.95 ** KEPT (pick-wt=2): 38 [] a_hausdorff_top_space($c1).
% 1.75/1.95 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A.
% 1.75/1.95 34 back subsumes 30.
% 1.75/1.95 34 back subsumes 29.
% 1.75/1.95 34 back subsumes 28.
% 1.75/1.95 34 back subsumes 27.
% 1.75/1.95 34 back subsumes 26.
% 5.84/6.02
% 5.84/6.02 ======= end of input processing =======
% 5.84/6.02
% 5.84/6.02 =========== start of search ===========
% 5.84/6.02
% 5.84/6.02
% 5.84/6.02 Resetting weight limit to 16.
% 5.84/6.02
% 5.84/6.02
% 5.84/6.02 Resetting weight limit to 16.
% 5.84/6.02
% 5.84/6.02 sos_size=663
% 5.84/6.02
% 5.84/6.02 Search stopped because sos empty.
% 5.84/6.02
% 5.84/6.02
% 5.84/6.02 Search stopped because sos empty.
% 5.84/6.02
% 5.84/6.02 ============ end of search ============
% 5.84/6.02
% 5.84/6.02 -------------- statistics -------------
% 5.84/6.02 clauses given 696
% 5.84/6.02 clauses generated 85399
% 5.84/6.02 clauses kept 726
% 5.84/6.02 clauses forward subsumed 1026
% 5.84/6.02 clauses back subsumed 5
% 5.84/6.02 Kbytes malloced 7812
% 5.84/6.02
% 5.84/6.02 ----------- times (seconds) -----------
% 5.84/6.02 user CPU time 4.07 (0 hr, 0 min, 4 sec)
% 5.84/6.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 5.84/6.02 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 5.84/6.02
% 5.84/6.02 Process 32423 finished Wed Jul 27 01:48:57 2022
% 5.84/6.02 Otter interrupted
% 5.84/6.02 PROOF NOT FOUND
%------------------------------------------------------------------------------