TSTP Solution File: GEO099+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO099+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:24 EDT 2022
% Result : Timeout 299.84s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : GEO099+1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:24:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.83/2.05 ----- Otter 3.3f, August 2004 -----
% 1.83/2.05 The process was started by sandbox on n018.cluster.edu,
% 1.83/2.05 Wed Jul 27 07:24:16 2022
% 1.83/2.05 The command was "./otter". The process ID is 21612.
% 1.83/2.05
% 1.83/2.05 set(prolog_style_variables).
% 1.83/2.05 set(auto).
% 1.83/2.05 dependent: set(auto1).
% 1.83/2.05 dependent: set(process_input).
% 1.83/2.05 dependent: clear(print_kept).
% 1.83/2.05 dependent: clear(print_new_demod).
% 1.83/2.05 dependent: clear(print_back_demod).
% 1.83/2.05 dependent: clear(print_back_sub).
% 1.83/2.05 dependent: set(control_memory).
% 1.83/2.05 dependent: assign(max_mem, 12000).
% 1.83/2.05 dependent: assign(pick_given_ratio, 4).
% 1.83/2.05 dependent: assign(stats_level, 1).
% 1.83/2.05 dependent: assign(max_seconds, 10800).
% 1.83/2.05 clear(print_given).
% 1.83/2.05
% 1.83/2.05 formula_list(usable).
% 1.83/2.05 all A (A=A).
% 1.83/2.05 all C C1 (part_of(C1,C)<-> (all P (incident_c(P,C1)->incident_c(P,C)))).
% 1.83/2.05 all C C1 C2 (C=sum(C1,C2)<-> (all Q (incident_c(Q,C)<->incident_c(Q,C1)|incident_c(Q,C2)))).
% 1.83/2.05 all P C (end_point(P,C)<->incident_c(P,C)& (all C1 C2 (part_of(C1,C)&part_of(C2,C)&incident_c(P,C1)&incident_c(P,C2)->part_of(C1,C2)|part_of(C2,C1)))).
% 1.83/2.05 all P C (inner_point(P,C)<->incident_c(P,C)& -end_point(P,C)).
% 1.83/2.05 all P C C1 (meet(P,C,C1)<->incident_c(P,C)&incident_c(P,C1)& (all Q (incident_c(Q,C)&incident_c(Q,C1)->end_point(Q,C)&end_point(Q,C1)))).
% 1.83/2.05 all C (closed(C)<-> -(exists P end_point(P,C))).
% 1.83/2.05 all C (open(C)<-> (exists P end_point(P,C))).
% 1.83/2.05 all C C1 (part_of(C1,C)&C1!=C->open(C1)).
% 1.83/2.05 all C C1 C2 C3 (part_of(C1,C)&part_of(C2,C)&part_of(C3,C)& (exists P (end_point(P,C1)&end_point(P,C2)&end_point(P,C3)))->part_of(C2,C3)|part_of(C3,C2)|part_of(C1,C2)|part_of(C2,C1)|part_of(C1,C3)|part_of(C3,C1)).
% 1.83/2.05 all C exists P inner_point(P,C).
% 1.83/2.05 all C P (inner_point(P,C)-> (exists C1 C2 (meet(P,C1,C2)&C=sum(C1,C2)))).
% 1.83/2.05 all C P Q R (end_point(P,C)&end_point(Q,C)&end_point(R,C)->P=Q|P=R|Q=R).
% 1.83/2.05 all C P (end_point(P,C)-> (exists Q (end_point(Q,C)&P!=Q))).
% 1.83/2.05 all C C1 C2 P (closed(C)&meet(P,C1,C2)&C=sum(C1,C2)-> (all Q (end_point(Q,C1)->meet(Q,C1,C2)))).
% 1.83/2.05 all C1 C2 ((exists P meet(P,C1,C2))-> (exists C (C=sum(C1,C2)))).
% 1.83/2.05 all C C1 ((all P (incident_c(P,C)<->incident_c(P,C1)))->C=C1).
% 1.83/2.05 -(all C C1 P Q (closed(C)&part_of(C1,C)&end_point(P,C1)&end_point(Q,C1)&P!=Q-> (exists C2 (meet(P,C1,C2)&meet(Q,C1,C2)&C=sum(C1,C2))))).
% 1.83/2.05 end_of_list.
% 1.83/2.05
% 1.83/2.05 -------> usable clausifies to:
% 1.83/2.05
% 1.83/2.05 list(usable).
% 1.83/2.05 0 [] A=A.
% 1.83/2.05 0 [] -part_of(C1,C)| -incident_c(P,C1)|incident_c(P,C).
% 1.83/2.05 0 [] part_of(C1,C)|incident_c($f1(C,C1),C1).
% 1.83/2.05 0 [] part_of(C1,C)| -incident_c($f1(C,C1),C).
% 1.83/2.05 0 [] C!=sum(C1,C2)| -incident_c(Q,C)|incident_c(Q,C1)|incident_c(Q,C2).
% 1.83/2.05 0 [] C!=sum(C1,C2)|incident_c(Q,C)| -incident_c(Q,C1).
% 1.83/2.05 0 [] C!=sum(C1,C2)|incident_c(Q,C)| -incident_c(Q,C2).
% 1.83/2.05 0 [] C=sum(C1,C2)|incident_c($f2(C,C1,C2),C)|incident_c($f2(C,C1,C2),C1)|incident_c($f2(C,C1,C2),C2).
% 1.83/2.05 0 [] C=sum(C1,C2)| -incident_c($f2(C,C1,C2),C)| -incident_c($f2(C,C1,C2),C1).
% 1.83/2.05 0 [] C=sum(C1,C2)| -incident_c($f2(C,C1,C2),C)| -incident_c($f2(C,C1,C2),C2).
% 1.83/2.05 0 [] -end_point(P,C)|incident_c(P,C).
% 1.83/2.05 0 [] -end_point(P,C)| -part_of(C1,C)| -part_of(C2,C)| -incident_c(P,C1)| -incident_c(P,C2)|part_of(C1,C2)|part_of(C2,C1).
% 1.83/2.05 0 [] end_point(P,C)| -incident_c(P,C)|part_of($f4(P,C),C).
% 1.83/2.05 0 [] end_point(P,C)| -incident_c(P,C)|part_of($f3(P,C),C).
% 1.83/2.05 0 [] end_point(P,C)| -incident_c(P,C)|incident_c(P,$f4(P,C)).
% 1.83/2.05 0 [] end_point(P,C)| -incident_c(P,C)|incident_c(P,$f3(P,C)).
% 1.83/2.05 0 [] end_point(P,C)| -incident_c(P,C)| -part_of($f4(P,C),$f3(P,C)).
% 1.83/2.05 0 [] end_point(P,C)| -incident_c(P,C)| -part_of($f3(P,C),$f4(P,C)).
% 1.83/2.05 0 [] -inner_point(P,C)|incident_c(P,C).
% 1.83/2.05 0 [] -inner_point(P,C)| -end_point(P,C).
% 1.83/2.05 0 [] inner_point(P,C)| -incident_c(P,C)|end_point(P,C).
% 1.83/2.05 0 [] -meet(P,C,C1)|incident_c(P,C).
% 1.83/2.05 0 [] -meet(P,C,C1)|incident_c(P,C1).
% 1.83/2.05 0 [] -meet(P,C,C1)| -incident_c(Q,C)| -incident_c(Q,C1)|end_point(Q,C).
% 1.83/2.05 0 [] -meet(P,C,C1)| -incident_c(Q,C)| -incident_c(Q,C1)|end_point(Q,C1).
% 1.83/2.05 0 [] meet(P,C,C1)| -incident_c(P,C)| -incident_c(P,C1)|incident_c($f5(P,C,C1),C).
% 1.83/2.05 0 [] meet(P,C,C1)| -incident_c(P,C)| -incident_c(P,C1)|incident_c($f5(P,C,C1),C1).
% 1.83/2.05 0 [] meet(P,C,C1)| -incident_c(P,C)| -incident_c(P,C1)| -end_point($f5(P,C,C1),C)| -end_point($f5(P,C,C1),C1).
% 1.83/2.05 0 [] -closed(C)| -end_point(P,C).
% 1.83/2.05 0 [] closed(C)|end_point($f6(C),C).
% 1.83/2.05 0 [] -open(C)|end_point($f7(C),C).
% 1.83/2.05 0 [] open(C)| -end_point(P,C).
% 1.83/2.05 0 [] -part_of(C1,C)|C1=C|open(C1).
% 1.83/2.05 0 [] -part_of(C1,C)| -part_of(C2,C)| -part_of(C3,C)| -end_point(P,C1)| -end_point(P,C2)| -end_point(P,C3)|part_of(C2,C3)|part_of(C3,C2)|part_of(C1,C2)|part_of(C2,C1)|part_of(C1,C3)|part_of(C3,C1).
% 1.83/2.05 0 [] inner_point($f8(C),C).
% 1.83/2.05 0 [] -inner_point(P,C)|meet(P,$f10(C,P),$f9(C,P)).
% 1.83/2.05 0 [] -inner_point(P,C)|C=sum($f10(C,P),$f9(C,P)).
% 1.83/2.05 0 [] -end_point(P,C)| -end_point(Q,C)| -end_point(R,C)|P=Q|P=R|Q=R.
% 1.83/2.05 0 [] -end_point(P,C)|end_point($f11(C,P),C).
% 1.83/2.05 0 [] -end_point(P,C)|P!=$f11(C,P).
% 1.83/2.05 0 [] -closed(C)| -meet(P,C1,C2)|C!=sum(C1,C2)| -end_point(Q,C1)|meet(Q,C1,C2).
% 1.83/2.05 0 [] -meet(P,C1,C2)|$f12(C1,C2)=sum(C1,C2).
% 1.83/2.05 0 [] incident_c($f13(C,C1),C)|incident_c($f13(C,C1),C1)|C=C1.
% 1.83/2.05 0 [] -incident_c($f13(C,C1),C)| -incident_c($f13(C,C1),C1)|C=C1.
% 1.83/2.05 0 [] closed($c4).
% 1.83/2.05 0 [] part_of($c3,$c4).
% 1.83/2.05 0 [] end_point($c2,$c3).
% 1.83/2.05 0 [] end_point($c1,$c3).
% 1.83/2.05 0 [] $c2!=$c1.
% 1.83/2.05 0 [] -meet($c2,$c3,C2)| -meet($c1,$c3,C2)|$c4!=sum($c3,C2).
% 1.83/2.05 end_of_list.
% 1.83/2.05
% 1.83/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 1.83/2.05
% 1.83/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.83/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.05 deletion, with positive clauses in sos and nonpositive
% 1.83/2.05 clauses in usable.
% 1.83/2.05
% 1.83/2.05 dependent: set(knuth_bendix).
% 1.83/2.05 dependent: set(anl_eq).
% 1.83/2.05 dependent: set(para_from).
% 1.83/2.05 dependent: set(para_into).
% 1.83/2.05 dependent: clear(para_from_right).
% 1.83/2.05 dependent: clear(para_into_right).
% 1.83/2.05 dependent: set(para_from_vars).
% 1.83/2.05 dependent: set(eq_units_both_ways).
% 1.83/2.05 dependent: set(dynamic_demod_all).
% 1.83/2.05 dependent: set(dynamic_demod).
% 1.83/2.05 dependent: set(order_eq).
% 1.83/2.05 dependent: set(back_demod).
% 1.83/2.05 dependent: set(lrpo).
% 1.83/2.05 dependent: set(hyper_res).
% 1.83/2.05 dependent: set(unit_deletion).
% 1.83/2.05 dependent: set(factor).
% 1.83/2.05
% 1.83/2.05 ------------> process usable:
% 1.83/2.05 ** KEPT (pick-wt=9): 1 [] -part_of(A,B)| -incident_c(C,A)|incident_c(C,B).
% 1.83/2.05 ** KEPT (pick-wt=8): 2 [] part_of(A,B)| -incident_c($f1(B,A),B).
% 1.83/2.05 ** KEPT (pick-wt=14): 3 [] A!=sum(B,C)| -incident_c(D,A)|incident_c(D,B)|incident_c(D,C).
% 1.83/2.05 ** KEPT (pick-wt=11): 4 [] A!=sum(B,C)|incident_c(D,A)| -incident_c(D,B).
% 1.83/2.05 ** KEPT (pick-wt=11): 5 [] A!=sum(B,C)|incident_c(D,A)| -incident_c(D,C).
% 1.83/2.05 ** KEPT (pick-wt=17): 6 [] A=sum(B,C)| -incident_c($f2(A,B,C),A)| -incident_c($f2(A,B,C),B).
% 1.83/2.05 ** KEPT (pick-wt=17): 7 [] A=sum(B,C)| -incident_c($f2(A,B,C),A)| -incident_c($f2(A,B,C),C).
% 1.83/2.05 ** KEPT (pick-wt=6): 8 [] -end_point(A,B)|incident_c(A,B).
% 1.83/2.05 ** 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).
% 1.83/2.05 ** KEPT (pick-wt=11): 10 [] end_point(A,B)| -incident_c(A,B)|part_of($f4(A,B),B).
% 1.83/2.05 ** KEPT (pick-wt=11): 11 [] end_point(A,B)| -incident_c(A,B)|part_of($f3(A,B),B).
% 1.83/2.05 ** KEPT (pick-wt=11): 12 [] end_point(A,B)| -incident_c(A,B)|incident_c(A,$f4(A,B)).
% 1.83/2.05 ** KEPT (pick-wt=11): 13 [] end_point(A,B)| -incident_c(A,B)|incident_c(A,$f3(A,B)).
% 1.83/2.05 ** KEPT (pick-wt=13): 14 [] end_point(A,B)| -incident_c(A,B)| -part_of($f4(A,B),$f3(A,B)).
% 1.83/2.05 ** KEPT (pick-wt=13): 15 [] end_point(A,B)| -incident_c(A,B)| -part_of($f3(A,B),$f4(A,B)).
% 1.83/2.05 ** KEPT (pick-wt=6): 16 [] -inner_point(A,B)|incident_c(A,B).
% 1.83/2.05 ** KEPT (pick-wt=6): 17 [] -inner_point(A,B)| -end_point(A,B).
% 1.83/2.05 ** KEPT (pick-wt=9): 18 [] inner_point(A,B)| -incident_c(A,B)|end_point(A,B).
% 1.83/2.05 ** KEPT (pick-wt=7): 19 [] -meet(A,B,C)|incident_c(A,B).
% 1.83/2.05 ** KEPT (pick-wt=7): 20 [] -meet(A,B,C)|incident_c(A,C).
% 1.83/2.05 ** KEPT (pick-wt=13): 21 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,B).
% 1.83/2.05 ** KEPT (pick-wt=13): 22 [] -meet(A,B,C)| -incident_c(D,B)| -incident_c(D,C)|end_point(D,C).
% 1.83/2.05 ** KEPT (pick-wt=16): 23 [] meet(A,B,C)| -incident_c(A,B)| -incident_c(A,C)|incident_c($f5(A,B,C),B).
% 1.83/2.05 ** KEPT (pick-wt=16): 24 [] meet(A,B,C)| -incident_c(A,B)| -incident_c(A,C)|incident_c($f5(A,B,C),C).
% 1.83/2.05 ** KEPT (pick-wt=22): 25 [] meet(A,B,C)| -incident_c(A,B)| -incident_c(A,C)| -end_point($f5(A,B,C),B)| -end_point($f5(A,B,C),C).
% 1.83/2.05 ** KEPT (pick-wt=5): 26 [] -closed(A)| -end_point(B,A).
% 1.83/2.05 ** KEPT (pick-wt=6): 27 [] -open(A)|end_point($f7(A),A).
% 1.83/2.05 ** KEPT (pick-wt=5): 28 [] open(A)| -end_point(B,A).
% 1.83/2.05 ** KEPT (pick-wt=8): 29 [] -part_of(A,B)|A=B|open(A).
% 1.83/2.05 ** KEPT (pick-Alarm clock
% 299.84/300.02 Otter interrupted
% 299.84/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------