TSTP Solution File: GEO108-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO108-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 12:54:25 EDT 2022
% Result : Timeout 299.91s 300.07s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO108-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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:03:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.19/2.37 ----- Otter 3.3f, August 2004 -----
% 2.19/2.37 The process was started by sandbox on n007.cluster.edu,
% 2.19/2.37 Wed Jul 27 07:03:01 2022
% 2.19/2.37 The command was "./otter". The process ID is 31918.
% 2.19/2.37
% 2.19/2.37 set(prolog_style_variables).
% 2.19/2.37 set(auto).
% 2.19/2.37 dependent: set(auto1).
% 2.19/2.37 dependent: set(process_input).
% 2.19/2.37 dependent: clear(print_kept).
% 2.19/2.37 dependent: clear(print_new_demod).
% 2.19/2.37 dependent: clear(print_back_demod).
% 2.19/2.37 dependent: clear(print_back_sub).
% 2.19/2.37 dependent: set(control_memory).
% 2.19/2.37 dependent: assign(max_mem, 12000).
% 2.19/2.37 dependent: assign(pick_given_ratio, 4).
% 2.19/2.37 dependent: assign(stats_level, 1).
% 2.19/2.37 dependent: assign(max_seconds, 10800).
% 2.19/2.37 clear(print_given).
% 2.19/2.37
% 2.19/2.37 list(usable).
% 2.19/2.37 0 [] A=A.
% 2.19/2.37 0 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 2.19/2.37 0 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 2.19/2.37 0 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 2.19/2.37 0 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 2.19/2.37 0 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 2.19/2.37 0 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 2.19/2.37 0 [] incident_c(ax0_sk2(A,B,C),C)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 2.19/2.37 0 [] incident_c(ax0_sk2(A,B,C),C)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 2.19/2.37 0 [] -incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 2.19/2.37 0 [] -incident_c(ax0_sk2(A,B,C),A)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 2.19/2.37 0 [] -incident_c(ax0_sk2(A,B,C),B)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 2.19/2.37 0 [] -incident_c(ax0_sk2(A,B,C),A)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 2.19/2.37 0 [] -end_point(A,B)|incident_c(A,B).
% 2.19/2.37 0 [] -end_point(A,B)| -part_of(C,B)| -part_of(D,B)| -incident_c(A,C)| -incident_c(A,D)|part_of(C,D)|part_of(D,C).
% 2.19/2.37 0 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 2.19/2.37 0 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 2.19/2.37 0 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 2.19/2.37 0 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 2.19/2.37 0 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 2.19/2.37 0 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 2.19/2.37 0 [] -inner_point(A,B)|incident_c(A,B).
% 2.19/2.37 0 [] -inner_point(A,B)| -end_point(A,B).
% 2.19/2.37 0 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 2.19/2.37 0 [] -meet(A,B,C)|incident_c(A,B).
% 2.19/2.37 0 [] -meet(A,B,C)|incident_c(A,C).
% 2.19/2.37 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 2.19/2.37 0 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 2.19/2.37 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),B)|meet(A,B,C).
% 2.19/2.37 0 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 2.19/2.37 0 [] -incident_c(A,B)| -incident_c(A,C)| -end_point(ax0_sk5(C,B,A),B)| -end_point(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 2.19/2.37 0 [] -closed(A)| -end_point(B,A).
% 2.19/2.37 0 [] end_point(ax0_sk6(A),A)|closed(A).
% 2.19/2.37 0 [] -open(A)|end_point(ax0_sk7(A),A).
% 2.19/2.37 0 [] -end_point(A,B)|open(B).
% 2.19/2.37 0 [] -part_of(A,B)|A=B|open(A).
% 2.19/2.37 0 [] -part_of(A,B)| -part_of(C,B)| -part_of(D,B)| -end_point(E,A)| -end_point(E,C)| -end_point(E,D)|part_of(C,D)|part_of(D,C)|part_of(A,C)|part_of(C,A)|part_of(A,D)|part_of(D,A).
% 2.19/2.37 0 [] inner_point(ax0_sk8(A),A).
% 2.19/2.37 0 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 2.19/2.37 0 [] -inner_point(A,B)|B=sum(ax0_sk9(A,B),ax0_sk10(A,B)).
% 2.19/2.37 0 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 2.19/2.37 0 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 2.19/2.37 0 [] -end_point(A,B)|A!=ax0_sk11(A,B).
% 2.19/2.37 0 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 2.19/2.37 0 [] -meet(A,B,C)|ax0_sk12(C,B)=sum(B,C).
% 2.19/2.37 0 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 2.19/2.37 0 [] incident_c(ax0_sk13(A,B),B)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 2.19/2.37 0 [] -incident_c(ax0_sk13(A,B),A)|incident_c(ax0_sk13(A,B),A)|B=A.
% 2.19/2.37 0 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 2.19/2.37 0 [] -between_c(A,B,C,D)|B!=D.
% 2.19/2.37 0 [] -between_c(A,B,C,D)|part_of(ax1_sk1(D,C,B,A),A).
% 2.19/2.37 0 [] -between_c(A,B,C,D)|end_point(B,ax1_sk1(D,C,B,A)).
% 2.19/2.37 0 [] -between_c(A,B,C,D)|end_point(D,ax1_sk1(D,C,B,A)).
% 2.19/2.37 0 [] -between_c(A,B,C,D)|inner_point(C,ax1_sk1(D,C,B,A)).
% 2.19/2.37 0 [] A=B| -part_of(C,D)| -end_point(A,C)| -end_point(B,C)| -inner_point(E,C)|between_c(D,A,E,B).
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|B!=C.
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|B!=D.
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|C!=D.
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|meet(C,sk15(D,C,B,A),sk16(D,C,B,A)).
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|part_of(sk15(D,C,B,A),A).
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|part_of(sk16(D,C,B,A),A).
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|end_point(B,sk15(D,C,B,A)).
% 2.19/2.38 0 [] -between_c2(A,B,C,D)|end_point(D,sk16(D,C,B,A)).
% 2.19/2.38 0 [] A=B|A=C|B=C| -meet(B,D,E)| -part_of(D,F)| -part_of(E,F)| -end_point(A,D)| -end_point(C,E)|between_c2(F,A,B,C).
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|B!=C.
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|B!=D.
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|C!=D.
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|meet(C,sk17(D,C,B,A),sk18(D,C,B,A)).
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|sum(sk17(D,C,B,A),sk18(D,C,B,A))=A.
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|incident_c(B,sk17(D,C,B,A)).
% 2.19/2.38 0 [] -between_c3(A,B,C,D)|incident_c(D,sk18(D,C,B,A)).
% 2.19/2.38 0 [] A=B|A=C|B=C| -meet(B,D,E)|sum(D,E)!=F| -incident_c(A,D)| -incident_c(C,E)|between_c3(F,A,B,C).
% 2.19/2.38 0 [] between_c2(sk19,sk20,sk21,sk22)|between_c3(sk19,sk20,sk21,sk22).
% 2.19/2.38 0 [] between_c2(sk19,sk20,sk21,sk22)| -between_c2(sk19,sk20,sk21,sk22).
% 2.19/2.38 0 [] -between_c3(sk19,sk20,sk21,sk22)|between_c3(sk19,sk20,sk21,sk22).
% 2.19/2.38 0 [] -between_c3(sk19,sk20,sk21,sk22)| -between_c2(sk19,sk20,sk21,sk22).
% 2.19/2.38 end_of_list.
% 2.19/2.38
% 2.19/2.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 2.19/2.38
% 2.19/2.38 This ia a non-Horn set with equality. The strategy will be
% 2.19/2.38 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.19/2.38 deletion, with positive clauses in sos and nonpositive
% 2.19/2.38 clauses in usable.
% 2.19/2.38
% 2.19/2.38 dependent: set(knuth_bendix).
% 2.19/2.38 dependent: set(anl_eq).
% 2.19/2.38 dependent: set(para_from).
% 2.19/2.38 dependent: set(para_into).
% 2.19/2.38 dependent: clear(para_from_right).
% 2.19/2.38 dependent: clear(para_into_right).
% 2.19/2.38 dependent: set(para_from_vars).
% 2.19/2.38 dependent: set(eq_units_both_ways).
% 2.19/2.38 dependent: set(dynamic_demod_all).
% 2.19/2.38 dependent: set(dynamic_demod).
% 2.19/2.38 dependent: set(order_eq).
% 2.19/2.38 dependent: set(back_demod).
% 2.19/2.38 dependent: set(lrpo).
% 2.19/2.38 dependent: set(hyper_res).
% 2.19/2.38 dependent: set(unit_deletion).
% 2.19/2.38 dependent: set(factor).
% 2.19/2.38
% 2.19/2.38 ------------> process usable:
% 2.19/2.38 ** KEPT (pick-wt=9): 1 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 2.19/2.38 ** KEPT (pick-wt=8): 2 [] -incident_c(ax0_sk1(A,B),B)|part_of(A,B).
% 2.19/2.38 ** KEPT (pick-wt=14): 3 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 2.19/2.38 ** KEPT (pick-wt=11): 4 [] A!=sum(B,C)| -incident_c(D,B)|incident_c(D,A).
% 2.19/2.38 ** KEPT (pick-wt=11): 5 [] A!=sum(B,C)| -incident_c(D,C)|incident_c(D,A).
% 2.19/2.38 ** KEPT (pick-wt=17): 6 [] -incident_c(ax0_sk2(A,B,C),B)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 2.19/2.38 ** KEPT (pick-wt=17): 7 [] -incident_c(ax0_sk2(A,B,C),A)| -incident_c(ax0_sk2(A,B,C),C)|C=sum(B,A).
% 2.19/2.38 ** KEPT (pick-wt=6): 8 [] -end_point(A,B)|incident_c(A,B).
% 2.19/2.38 ** KEPT (pick-wt=21): 9 [] -end_point(A,B)| -part_of(C,B)| -part_of(D,B)| -incident_c(A,C)| -incident_c(A,D)|part_of(C,D)|part_of(D,C).
% 2.19/2.38 ** KEPT (pick-wt=11): 10 [] -incident_c(A,B)|part_of(ax0_sk3(B,A),B)|end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=11): 11 [] -incident_c(A,B)|part_of(ax0_sk4(B,A),B)|end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=11): 12 [] -incident_c(A,B)|incident_c(A,ax0_sk3(B,A))|end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=11): 13 [] -incident_c(A,B)|incident_c(A,ax0_sk4(B,A))|end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=13): 14 [] -incident_c(A,B)| -part_of(ax0_sk3(B,A),ax0_sk4(B,A))|end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=13): 15 [] -incident_c(A,B)| -part_of(ax0_sk4(B,A),ax0_sk3(B,A))|end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=6): 16 [] -inner_point(A,B)|incident_c(A,B).
% 2.19/2.38 ** KEPT (pick-wt=6): 17 [] -inner_point(A,B)| -end_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=9): 18 [] -incident_c(A,B)|end_point(A,B)|inner_point(A,B).
% 2.19/2.38 ** KEPT (pick-wt=7): 19 [] -meet(A,B,C)|incident_c(A,B).
% 2.19/2.38 ** KEPT (pick-wt=7): 20 [] -meet(A,B,C)|incident_c(A,C).
% 2.19/2.38 ** KEPT (pick-wt=13): 21 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 2.19/2.38 ** KEPT (pick-wt=13): 22 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 2.19/2.38 ** KEPT (pick-wt=16): 23 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),B)|meet(A,B,C).
% 2.19/2.38 ** KEPT (pick-wt=16): 24 [] -incident_c(A,B)| -incident_c(A,C)|incident_c(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 2.19/2.38 ** KEPT (pick-wt=22): 25 [] -incident_c(A,B)| -incident_c(A,C)| -end_point(ax0_sk5(C,B,A),B)| -end_point(ax0_sk5(C,B,A),C)|meet(A,B,C).
% 2.85/3.04 ** KEPT (pick-wt=5): 26 [] -closed(A)| -end_point(B,A).
% 2.85/3.04 ** KEPT (pick-wt=6): 27 [] -open(A)|end_point(ax0_sk7(A),A).
% 2.85/3.04 ** KEPT (pick-wt=5): 28 [] -end_point(A,B)|open(B).
% 2.85/3.04 ** KEPT (pick-wt=8): 29 [] -part_of(A,B)|A=B|open(A).
% 2.85/3.04 ** KEPT (pick-wt=36): 30 [] -part_of(A,B)| -part_of(C,B)| -part_of(D,B)| -end_point(E,A)| -end_point(E,C)| -end_point(E,D)|part_of(C,D)|part_of(D,C)|part_of(A,C)|part_of(C,A)|part_of(A,D)|part_of(D,A).
% 2.85/3.04 ** KEPT (pick-wt=11): 31 [] -inner_point(A,B)|meet(A,ax0_sk9(A,B),ax0_sk10(A,B)).
% 2.85/3.04 ** KEPT (pick-wt=12): 33 [copy,32,flip.2] -inner_point(A,B)|sum(ax0_sk9(A,B),ax0_sk10(A,B))=B.
% 2.85/3.04 ** KEPT (pick-wt=18): 34 [] -end_point(A,B)| -end_point(C,B)| -end_point(D,B)|A=C|A=D|C=D.
% 2.85/3.04 ** KEPT (pick-wt=8): 35 [] -end_point(A,B)|end_point(ax0_sk11(A,B),B).
% 2.85/3.04 ** KEPT (pick-wt=8): 37 [copy,36,flip.2] -end_point(A,B)|ax0_sk11(A,B)!=A.
% 2.85/3.04 ** KEPT (pick-wt=18): 38 [] -closed(A)| -meet(B,C,D)|A!=sum(C,D)| -end_point(E,C)|meet(E,C,D).
% 2.85/3.04 ** KEPT (pick-wt=11): 40 [copy,39,flip.2] -meet(A,B,C)|sum(B,C)=ax0_sk12(C,B).
% 2.85/3.04 ** KEPT (pick-wt=13): 41 [] -incident_c(ax0_sk13(A,B),A)| -incident_c(ax0_sk13(A,B),B)|B=A.
% 2.85/3.04 ** KEPT (pick-wt=8): 42 [] -between_c(A,B,C,D)|B!=D.
% 2.85/3.04 ** KEPT (pick-wt=12): 43 [] -between_c(A,B,C,D)|part_of(ax1_sk1(D,C,B,A),A).
% 2.85/3.04 ** KEPT (pick-wt=12): 44 [] -between_c(A,B,C,D)|end_point(B,ax1_sk1(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=12): 45 [] -between_c(A,B,C,D)|end_point(D,ax1_sk1(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=12): 46 [] -between_c(A,B,C,D)|inner_point(C,ax1_sk1(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=20): 47 [] A=B| -part_of(C,D)| -end_point(A,C)| -end_point(B,C)| -inner_point(E,C)|between_c(D,A,E,B).
% 2.85/3.04 ** KEPT (pick-wt=8): 48 [] -between_c2(A,B,C,D)|B!=C.
% 2.85/3.04 ** KEPT (pick-wt=8): 49 [] -between_c2(A,B,C,D)|B!=D.
% 2.85/3.04 ** KEPT (pick-wt=8): 50 [] -between_c2(A,B,C,D)|C!=D.
% 2.85/3.04 ** KEPT (pick-wt=17): 51 [] -between_c2(A,B,C,D)|meet(C,sk15(D,C,B,A),sk16(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=12): 52 [] -between_c2(A,B,C,D)|part_of(sk15(D,C,B,A),A).
% 2.85/3.04 ** KEPT (pick-wt=12): 53 [] -between_c2(A,B,C,D)|part_of(sk16(D,C,B,A),A).
% 2.85/3.04 ** KEPT (pick-wt=12): 54 [] -between_c2(A,B,C,D)|end_point(B,sk15(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=12): 55 [] -between_c2(A,B,C,D)|end_point(D,sk16(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=30): 56 [] A=B|A=C|B=C| -meet(B,D,E)| -part_of(D,F)| -part_of(E,F)| -end_point(A,D)| -end_point(C,E)|between_c2(F,A,B,C).
% 2.85/3.04 ** KEPT (pick-wt=8): 57 [] -between_c3(A,B,C,D)|B!=C.
% 2.85/3.04 ** KEPT (pick-wt=8): 58 [] -between_c3(A,B,C,D)|B!=D.
% 2.85/3.04 ** KEPT (pick-wt=8): 59 [] -between_c3(A,B,C,D)|C!=D.
% 2.85/3.04 ** KEPT (pick-wt=17): 60 [] -between_c3(A,B,C,D)|meet(C,sk17(D,C,B,A),sk18(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=18): 61 [] -between_c3(A,B,C,D)|sum(sk17(D,C,B,A),sk18(D,C,B,A))=A.
% 2.85/3.04 ** KEPT (pick-wt=12): 62 [] -between_c3(A,B,C,D)|incident_c(B,sk17(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=12): 63 [] -between_c3(A,B,C,D)|incident_c(D,sk18(D,C,B,A)).
% 2.85/3.04 ** KEPT (pick-wt=29): 64 [] A=B|A=C|B=C| -meet(B,D,E)|sum(D,E)!=F| -incident_c(A,D)| -incident_c(C,E)|between_c3(F,A,B,C).
% 2.85/3.04 ** KEPT (pick-wt=10): 65 [] -between_c3(sk19,sk20,sk21,sk22)| -between_c2(sk19,sk20,sk21,sk22).
% 2.85/3.04
% 2.85/3.04 ------------> process sos:
% 2.85/3.04 ** KEPT (pick-wt=3): 82 [] A=A.
% 2.85/3.04 ** KEPT (pick-wt=8): 83 [] incident_c(ax0_sk1(A,B),A)|part_of(A,B).
% 2.85/3.04 ** KEPT (pick-wt=23): 84 [] incident_c(ax0_sk2(A,B,C),C)|incident_c(ax0_sk2(A,B,C),B)|incident_c(ax0_sk2(A,B,C),A)|C=sum(B,A).
% 2.85/3.04 ** KEPT (pick-wt=6): 85 [] end_point(ax0_sk6(A),A)|closed(A).
% 2.85/3.04 ** KEPT (pick-wt=4): 86 [] inner_point(ax0_sk8(A),A).
% 2.85/3.04 ** KEPT (pick-wt=13): 87 [] incident_c(ax0_sk13(A,B),B)|incident_c(ax0_sk13(A,B),A)|B=A.
% 2.85/3.04 ** KEPT (pick-wt=10): 88 [] between_c2(sk19,sk20,sk21,sk22)|between_c3(sk19,sk20,sk21,sk22).
% 2.85/3.04 Following clause subsumed by 82 during input processing: 0 [copy,82,flip.1] A=A.
% 2.85/3.04 82 back subsumes 81.
% 2.85/3.04 82 back subsumes 80.
% 2.85/3.04 82 back subsumes 79.
% 2.85/3.04 82 back subsumes 78.
% 2.85/3.04 82 back subsumes 77.
% 2.85/3.04 82 back subsumes 75.
% 2.85/3.04 82 back subsumes 74.
% 2.85/3.04
% 2.85/3.04 ======= end of input processing =======
% 2.85/3.04
% 2.85/3.04 =========== start of search ===========
% 2.85/3.04
% 2.85/3.04
% 2.85/3.04 Resetting weight limit to 15.
% 2.85/3.04
% 2.85/3.04
% 2.85/3.04 Resetting weight limit to 15.
% 2.85/3.04
% 2.85/3.04 sos_size=1170
% 2.85/3.04
% 2.85/3.04
% 2.85/3.04 Resetting weight limit to 12.
% 2.85/3.04
% 2.85/3.04
% 2.85/3.04 Resetting weight limit to 12.Alarm clock
% 299.91/300.07 Otter interrupted
% 299.91/300.07 PROOF NOT FOUND
%------------------------------------------------------------------------------